> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset<MAX_COL>&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector<vector<T>> A){ init_(A); }\\n void init(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector<vector<T>> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector<vector<T>> &Y) { concat_col_(Y); }\\n void concat_col(vector<T> &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector<vector<T>> &Y) { concat_row_(Y); }\\n void concat_row(vector<T> &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix<MAX_COL, bool>;\\n\\ntemplate<typename T=bool> struct GaussJordan{\\n private:\\n int rank;\\n vector<bool> solution;\\n\\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , vector<T> &b){\\n Matrix X(A), Y(b);\\n return solve_simultaneous_equation_(X, Y);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , vector<T> &b){\\n Matrix Y(b);\\n return solve_simultaneous_equation_(A, Y);\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , Matrix &b){\\n Matrix X(A);\\n return solve_simultaneous_equation_(X, b);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n A.concat_col(b);\\n return solve_simultaneous_equation_(A);\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A){\\n return solve_simultaneous_equation_(to_matrix(A));\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector<bool> res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A) { return solve_simultaneous_equation_(A); }\\n vector<bool> solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector<T> get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector<vector<char>> S;\\nvector<vector<bool>> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector<char>(m));\\n A.resize(n, vector<bool>(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector<vector<bool>> M(n*m,vector<bool>(n*m,0));\\n vector<bool> res(n*m);\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) res[i*m+j] = 1;\\n }\\n GaussJordan gj;\\n auto ans = gj.solve_simultaneous_equation(M,res);\\n if(ans.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3852,\n \"score_of_the_acc\": -0.0548,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1308_7339747\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair<ll,ll> P ;\\ntypedef tuple<ll,ll,ll> TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<int MAX_COL, typename T=bool> struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector<bitset<MAX_COL>> mat;\\n\\n void init_(vector<vector<T>> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector<T> A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector<bitset<MAX_COL>> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector<T> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector<T> &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset<MAX_COL>&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector<vector<T>> A){ init_(A); }\\n void init(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector<vector<T>> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector<vector<T>> &Y) { concat_col_(Y); }\\n void concat_col(vector<T> &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector<vector<T>> &Y) { concat_row_(Y); }\\n void concat_row(vector<T> &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix<MAX_COL, bool>;\\n\\ntemplate<typename T=bool> struct GaussJordan{\\n private:\\n int rank;\\n vector<bool> solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , vector<T> &b){\\n Matrix X(A), Y(b);\\n return solve_simultaneous_equation_(X,Y);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , vector<T> &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n A.concat_col(b);\\n return solve_simultaneous_equation_(A);\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A){\\n Matrix M(A);\\n return solve_simultaneous_equation_(M);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector<bool> res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A) { return solve_simultaneous_equation_(A); }\\n vector<bool> solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector<T> get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector<vector<char>> S;\\nvector<vector<bool>> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector<char>(m));\\n A.resize(n, vector<bool>(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector<vector<bool>> M(n*m,vector<bool>(n*m,0));\\n vector<bool> res(n*m);\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) res[i*m+j] = 1;\\n }\\n GaussJordan gj;\\n auto ans = gj.solve_simultaneous_equation(M,res);\\n if(ans.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.0408,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1308_7339729\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair<ll,ll> P ;\\ntypedef tuple<ll,ll,ll> TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<int MAX_COL, typename T=bool> struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector<bitset<MAX_COL>> mat;\\n\\n void init_(vector<vector<T>> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector<T> A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector<bitset<MAX_COL>> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector<T> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector<T> &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset<MAX_COL>&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector<vector<T>> A){ init_(A); }\\n void init(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector<vector<T>> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector<vector<T>> &Y) { concat_col_(Y); }\\n void concat_col(vector<T> &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector<vector<T>> &Y) { concat_row_(Y); }\\n void concat_row(vector<T> &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix<MAX_COL, bool>;\\n\\ntemplate<typename T=bool> struct GaussJordan{\\n private:\\n int rank;\\n vector<bool> solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , vector<T> &b){\\n return solve_simultaneous_equation_(Matrix(A), Matrix(b));\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , vector<T> &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n return solve_simultaneous_equation_(A.concat_col(b));\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A){\\n Matrix M(A);\\n return solve_simultaneous_equation_(M);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector<bool> res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A) { return solve_simultaneous_equation_(A); }\\n vector<bool> solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector<T> get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector<vector<char>> S;\\nvector<vector<bool>> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector<char>(m));\\n A.resize(n, vector<bool>(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector<vector<bool>> M(n*m,vector<bool>(n*m+1,0));\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) M[i*m+j][n*m] = 1;\\n }\\n GaussJordan gj;\\n auto res = gj.solve_simultaneous_equation(M);\\n if(res.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3828,\n \"score_of_the_acc\": -0.0516,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1308_7339652\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std ;\\n#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);\\n#pragma GCC optimize(\\\"Ofast,no-stack-protector,unroll-loops,fast-math\\\")\\ntypedef long long ll ;\\ntypedef long double ld ;\\ntypedef pair<ll,ll> P ;\\ntypedef tuple<ll,ll,ll> TP ;\\n#define chmin(a,b) a = min(a,b)\\n#define chmax(a,b) a = max(a,b)\\n#define bit_count(x) __builtin_popcountll(x)\\n#define gcd(a,b) __gcd(a,b)\\n#define lcm(a,b) a / gcd(a,b) * b\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\n#define rrep(i,a,b) for(int i = a ; i < b ; i++)\\n#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)\\n#define pt(a) cout << a << endl\\n#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << \\\" \\\" ; cout << endl ;\\n#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;\\n#define DEBUG_REP(V) cout << \\\"{ \\\" ; repi(itr,V) cout << *itr << \\\", \\\" ; cout << \\\"}\\\" << endl ;\\n#define debug(a) cout << #a << \\\" \\\" << a << endl\\n#define all(a) a.begin(), a.end()\\n#define endl \\\"\\\\n\\\"\\n\\ntemplate<int MAX_COL, typename T=bool> struct BitMatrix{\\n\\n private:\\n int row, col;\\n vector<bitset<MAX_COL>> mat;\\n\\n void init_(vector<vector<T>> A){\\n row = A.size();\\n col = A[0].size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(A[i][j] != 0) mat[i][j] = 1;\\n else mat[i][j] = 0;\\n }\\n }\\n }\\n \\n void init_(vector<T> A, bool row_matrix = false){\\n if(row_matrix) {\\n col = (int)A.size();\\n row = 1;\\n mat.resize(1);\\n for(int i = 0; i < col; i++){\\n if(A[i] != 0) mat[0][i] = 1;\\n else mat[0][i] = 0;\\n }\\n }\\n else {\\n col = 1;\\n row = (int)A.size();\\n mat.resize(row);\\n for(int i = 0; i < row; i++){\\n if(A[i] != 0) mat[i][0] = 1;\\n else mat[i][0] = 0;\\n }\\n }\\n }\\n\\n void transpose_() {\\n vector<bitset<MAX_COL>> res(col);\\n rep(i,row) rep(j,col) res[j][i] = mat[i][j];\\n mat = res;\\n swap(row,col);\\n }\\n \\n void flip_() {\\n rep(i,row) rep(j,col) mat[i][j].flip();\\n }\\n\\n void concat_col_(vector<T> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_col_(X);\\n }\\n void concat_col_(BitMatrix &Y) {\\n assert((int)Y.row == row);\\n rep(i,row) {\\n rep(j,Y.col) mat[i][j+col] = (Y.mat[i][j]);\\n }\\n col += Y.col;\\n }\\n\\n void concat_row_(vector<T> &Y) {\\n BitMatrix X(Y,true);\\n concat_row_(X);\\n }\\n void concat_row_(vector<vector<T>> &Y) {\\n BitMatrix X(Y);\\n concat_row_(X);\\n }\\n void concat_row_(BitMatrix &Y) {\\n assert((int)Y.col == col);\\n row += Y.row;\\n rep(i,Y.row) mat.push_back(Y.mat[i]);\\n }\\n\\n void print_() {\\n rep(i,row){\\n rep(j,col) cout << mat[i][j]; cout << endl;\\n }\\n }\\n\\n public:\\n\\n inline BitMatrix &operator&=(const BitMatrix Y) {\\n rep(i,row) mat[i] &= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix &operator|=(const BitMatrix Y) {\\n rep(i,row) mat[i] |= Y.mat[i];\\n return *this ;\\n }\\n \\n inline BitMatrix &operator^=(const BitMatrix Y) {\\n rep(i,row) mat[i] ^= Y.mat[i];\\n return *this ;\\n }\\n\\n inline BitMatrix operator&(const BitMatrix Y) const { return BitMatrix(*this) &= Y; }\\n\\n inline BitMatrix operator|(const BitMatrix Y) const { return BitMatrix(*this) |= Y; }\\n\\n inline BitMatrix operator^(const BitMatrix Y) const { return BitMatrix(*this) += Y; }\\n\\n inline bool operator==(const BitMatrix Y) const { return mat == Y.mat; }\\n\\n inline bool operator!=(const BitMatrix Y) const { return mat != Y.mat; }\\n\\n inline bitset<MAX_COL>&operator[] (int i) {return mat[i]; }\\n\\n BitMatrix(int n): row(n), col(0) { mat.resize(row); }\\n BitMatrix(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n BitMatrix(vector<vector<T>> A){ init_(A); }\\n void init(vector<T> A, bool row_matrix = false) { init_(A, row_matrix); }\\n void init(vector<vector<T>> A) { init_(A); }\\n size_t row_size() { return row; }\\n size_t col_size() { return col; }\\n void transpose() { transpose_(); }\\n void flip() { flip_(); }\\n void concat_col(vector<vector<T>> &Y) { concat_col_(Y); }\\n void concat_col(vector<T> &Y) { concat_col_(Y); }\\n void concat_col(BitMatrix &Y) { concat_col_(Y); }\\n void concat_row(vector<vector<T>> &Y) { concat_row_(Y); }\\n void concat_row(vector<T> &Y) { concat_row_(Y); }\\n void concat_row(BitMatrix &Y) { concat_row_(Y); }\\n void print() { print_(); }\\n};\\n\\nconst int MAX_COL = 2510;\\nusing Matrix = BitMatrix<MAX_COL, bool>;\\n\\ntemplate<typename T=bool> struct GaussJordan{\\n private:\\n int rank;\\n vector<bool> solution;\\n \\n int sweep_out_(Matrix &A , bool is_extended = false){\\n rank = 0 ;\\n for(int col = 0 ; col < A.col_size() ; col++){\\n if(is_extended && col == A.col_size() - 1) break ;\\n\\n int pivot = -1 ;\\n for(int row = rank ; row < A.col_size() ; row++){\\n if(A[row][col]){\\n pivot = row ;\\n break ;\\n }\\n }\\n\\n if(pivot == -1) continue ;\\n swap(A[pivot] , A[rank]) ;\\n for(int row = 0 ; row < A.row_size() ; row++){\\n if(row != rank && A[row][col]) A[row] ^= A[rank] ;\\n }\\n rank++ ;\\n }\\n return rank ;\\n }\\n \\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , vector<T> &b){\\n return solve_simultaneous_equation_(Matrix(A), Matrix(b));\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , vector<T> &b){\\n return solve_simultaneous_equation_(A, Matrix(b));\\n }\\n vector<bool> solve_simultaneous_equation_(vector<vector<T>> &A , Matrix &b){\\n return solve_simultaneous_equation_(Matrix(A), b);\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &A , Matrix &b){\\n return solve_simultaneous_equation_(A.concat_col(b));\\n }\\n vector<bool> solve_simultaneous_equation_(Matrix &M){\\n\\n int n = M.row_size() , m = M.col_size();\\n\\n rank = sweep_out_(M,true);\\n\\n for(int row = rank ; row < n ; row++) if(M[row][n]) return {};\\n\\n vector<bool> res;\\n res.resize(rank);\\n for(int i = 0 ; i < rank; i++) res[i] = M[i][m];\\n\\n return solution = res;\\n }\\n\\n public:\\n GaussJordan(){}\\n int sweep_out(Matrix &A) { return sweep_out_(A, false); }\\n int sweep_out(Matrix &A, bool is_extended) { return sweep_out_(A, is_extended); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(Matrix &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , vector<T> &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(vector<vector<T>> &A , Matrix &b) { return solve_simultaneous_equation_(A, b); }\\n vector<bool> solve_simultaneous_equation(Matrix A) { return solve_simultaneous_equation_(A); }\\n int get_rank() { return rank; }\\n vector<T> get_solution() { return solution; }\\n};\\n\\nint n, m, d;\\nvector<vector<char>> S;\\nvector<vector<bool>> A;\\n\\nbool solve(){\\n S.clear();\\n A.clear();\\n cin >> m >> n >> d;\\n if(m == 0 && n == 0 && d == 0) return false;\\n S.resize(n, vector<char>(m));\\n A.resize(n, vector<bool>(m));\\n rep(i,n) rep(j,m) cin >> S[i][j], A[i][j] = S[i][j] - '0';\\n vector<vector<bool>> M(n*m,vector<bool>(n*m+1,0));\\n rep(i,n) rep(j,m){\\n M[i*m+j][i*m+j] = 1;\\n rep(x,n) rep(y,m){\\n int dist = abs(i - x) + abs(j - y);\\n if(dist == d) {\\n M[i*m+j][x*m+y] = 1;\\n }\\n }\\n if(!A[i][j]) M[i*m+j][n*m] = 1;\\n }\\n GaussJordan gj;\\n auto res = gj.solve_simultaneous_equation(Matrix(M));\\n if(res.empty()) cout << 0 << endl;\\n else cout << 1 << endl;\\n return 1;\\n}\\n\\nint main(){\\n fast_io\\n while(1){\\n if(!solve()) {\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.0223,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":760,"cells":{"group_id":{"kind":"string","value":"aoj_1310_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nFind the Multiples\nYou are given a sequence\na\n0\na\n1\n...\na\nN\n-1\ndigits and a prime number\nQ\n. For each\ni\n≤\nj\nwith\na\ni\n≠ 0, the subsequence\na\ni\na\ni\n+1\n...\na\nj\ncan be read as a decimal representation of a positive integer. Subsequences with leading zeros are not considered. Your task is to count the number of pairs (\ni\n,\nj\n) such that the corresponding subsequence is a multiple of\nQ\n.\nInput\nThe input consists of at most 50 datasets. Each dataset is represented by a line containing four integers\nN\n,\nS\n,\nW\n, and\nQ\n, separated by spaces, where 1 ≤\nN\n≤ 10\n5\n, 1 ≤\nS\n≤ 10\n9\n, 1 ≤\nW\n≤ 10\n9\n, and\nQ\nis a prime number less than 10\n8\n. The sequence\na\n0\n...\na\nN\n-1\nof length\nN\nis generated by the following code, in which ai is written as\na[i]\n.\nint g = S;\n for(int i=0; i<N; i++) {\n a[i] = (g/7) % 10;\n if( g%2 == 0 ) { g = (g/2); }\n else { g = (g/2) ^ W; }\n }\nNote:\nthe operators\n/\n,\n%\n, and\n^\nare the integer division, the modulo, and the bitwise exclusiveor, respectively. The above code is meant to be a random number generator. The intended solution does not rely on the way how the sequence is generated.\nThe end of the input is indicated by a line containing four zeros separated by spaces.\nOutput\nFor each dataset, output the answer in a line. You may assume that the answer is less than 2\n30\n.\nSample Input\n3 32 64 7\n4 35 89 5\n5 555 442 3\n5 777 465 11\n100000 666 701622763 65537\n0 0 0 0\nOutput for the Sample Input\n2\n4\n6\n3\n68530\nIn the first dataset, the sequence is 421. We can find two multiples of\nQ\n= 7, namely, 42 and 21.\nIn the second dataset, the sequence is 5052, from which we can find 5, 50, 505, and 5 being the multiples of\nQ\n= 5. Notice that we don't count 0 or 05 since they are not a valid representation of positive integers. Also notice that we count 5 twice, because it occurs twice in different positions.\nIn the third and fourth datasets, the sequences are 95073 and 12221, respectively."},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1310_10851362","code_snippet":"#include <cstdio>\n#include <map>\n#include <iostream>\n#include <cstring>\nusing namespace std;\nusing std::map;\nint a[100010];\nmap<long long,int> mp;\nlong long pow_mod(long long a,long long b,long long p)\n{\n\tlong long ans = 1;\n\twhile(b) {\n\t\tif(b&1) ans = ans * a % p;\n\t\tb >>= 1; a = a * a % p;\n\t}\n\treturn ans;\n}\n\nint main()\n{\n\tlong long N,S,W,Q;\n\twhile(std::cin>>N>>S>>W>>Q)\n\t{\n\t\tif(!N) break;\n\t\tmp.clear();\n\t\tint g = S;\n\t\ta[0] = 0;\n\t\tfor(int i = 1; i <= N; i++)\n\t\t{\n\t\t\ta[i] = (g/7) % 10;\n\t\t\tif(g%2==0) g /= 2;\n\t\t\telse g = (g/2) ^ W;\n\t\t}\n\t\tif(Q == 5 || Q == 2)\n\t\t{\n\t\t\tint ans = 0;\n\t\t\tint cnt = 0;\n\t\t\tfor(int i = 1;i <= N;i++)\n\t\t\t{\n\t\t\t\tif(a[i] != 0)cnt++;\n\t\t\t\tif(a[i] % Q == 0)ans += cnt;\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",ans);\n\t\t\tcontinue;\n\t\t}\n\t\tlong long ans = 0;\n\t\tlong long sum = 0;\n\t\tlong long S = 1;\n\t\tfor(int i = N; i >= 1; i--)\n\t\t{\n\t\t\tsum = (S*a[i] + sum) % Q;\n\t if(a[i] > 0 && !sum) ans++;\n\t\t\tif(a[i] > 0) ans += mp[sum] ;\n\t\t\tmp[sum]++;\n\t\t\tS *= 10;\n\t\t\tS %= Q;\n\t\t}\n\t\tstd::cout<<ans<<std::endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":390,"memory_kb":9440,"score_of_the_acc":-0.9644,"final_rank":14},{"submission_id":"aoj_1310_9730559","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\nwhile(1) {\n ll N, S, W, Q;\n cin >> N >> S >> W >> Q;\n if (N == 0) return 0;\n ll G = S;\n vector<ll> A(N);\n rep(i,0,N) {\n A[i] = (G/7) % 10;\n if (G % 2 == 0) G /= 2;\n else G = (G/2) ^ W;\n }\n reverse(ALL(A));\n if (Q == 2) {\n ll ANS = 0;\n ll COUNT = 0;\n rep(i,0,N) {\n if (A[i] % 2 == 0) COUNT++;\n if (A[i] != 0) ANS += COUNT;\n }\n cout << ANS << endl;\n continue;\n }\n if (Q == 5) {\n ll ANS = 0;\n ll COUNT = 0;\n rep(i,0,N) {\n if (A[i] % 5 == 0) COUNT++;\n if (A[i] != 0) ANS += COUNT;\n }\n cout << ANS << endl;\n continue;\n }\n ll D = 1, Cur = 0;\n ll ANS = 0;\n map<ll,int> mp;\n mp[0]++;\n rep(i,0,N) {\n Cur += (D * A[i]);\n D *= 10;\n Cur %= Q;\n D %= Q;\n if (A[i] != 0) ANS += mp[Cur];\n mp[Cur]++;\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":380,"memory_kb":9848,"score_of_the_acc":-0.9499,"final_rank":12},{"submission_id":"aoj_1310_8998678","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint solve2(int N, vector<i64> a, int Q) {\n int ans = 0, zero = 0;\n for(int i : rep(N)) {\n if(a[i] % Q == 0) ans += i + 1 - zero;\n if(a[i] == 0) zero++;\n }\n return ans - zero;\n}\n\nint solve(int N, int S, int W, int Q) {\n vector<i64> a(N);\n {\n int g = S;\n for(int i = 0; i < N; i++) {\n a[i] = (g / 7) % 10;\n if(g % 2 == 0) { g = (g / 2); }\n else {g = (g / 2) ^ W; }\n }\n }\n\n if(Q == 2 or Q == 5) return solve2(N, a, Q);\n\n i64 pow10 = 1;\n vector<i64> b(N);\n for(int i : revrep(N)) {\n b[i] = (a[i] * pow10) % Q;\n pow10 = (pow10 * 10) % Q;\n }\n\n vector<i64> s(N + 1, 0);\n for(int i : revrep(N)) s[i] = (s[i + 1] + b[i]) % Q;\n int ans = 0;\n map<i64, int> mp;\n mp[0] = 1;\n for(int i : revrep(N)) {\n if(a[i] != 0) ans += mp[s[i]];\n mp[s[i]]++;\n }\n return ans;\n}\n\nint main() {\n while(true) {\n int N = in(), S = in(), W = in(), Q = in();\n if(make_tuple(N, S, W, Q) == make_tuple(0, 0, 0, 0)) return 0;\n print(solve(N, S, W, Q));\n }\n}","accuracy":1,"time_ms":410,"memory_kb":10956,"score_of_the_acc":-1.625,"final_rank":20},{"submission_id":"aoj_1310_8505599","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n while (1) {\n int n, s, w, p;\n cin >> n >> s >> w >> p;\n if (!n)\n break;\n vector<int> a(n);\n int g = s;\n rep(i, n) {\n a[i] = g / 7 % 10;\n g = (g % 2 == 0 ? g / 2 : (g / 2) ^ w);\n }\n ll ans = 0;\n if (p == 2 || p == 5) {\n ll cnt = 0;\n rep(i, n) {\n if (a[i] % p == 0) {\n if (a[i]) ans++;\n ans += cnt;\n }\n if (a[i]) cnt++;\n }\n }\n else {\n map<ll, ll> m;\n ll val = 0, t = 1;\n m[0]++;\n per(i, n) {\n val += t * a[i];\n val %= p;\n if (a[i]) ans += m[val];\n m[val]++;\n t *= 10, t %= p;\n }\n }\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":400,"memory_kb":9400,"score_of_the_acc":-1.0785,"final_rank":16},{"submission_id":"aoj_1310_6761294","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n// #define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\ntemplate<class T> void scan(T& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ cout << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nvoid solve() {\n int n, s, w, q;\n while(cin >> n >> s >> w >> q) {\n if(n == 0) break;\n int g = s;\n vc<int> a(n);\n rep(i, n) {\n a[i] = (g / 7) % 10;\n if(g % 2 == 0) {\n g = g / 2;\n } else {\n g = (g / 2) ^ w;\n }\n }\n if(q == 2 || q == 5) {\n int cnt = 0;\n ll ans = 0;\n rev_rep(i, n) {\n if(a[i] % q == 0) ++ cnt;\n if(a[i] != 0) ans += cnt;\n }\n out(ans);\n continue;\n }\n if(n <= 10) dump(a);\n ll ans = 0;\n map<int, int> mp;\n mp[0] ++;\n int cur = 0;\n int pw = 1;\n for(int i = n - 1; i >= 0; -- i) {\n (cur += a[i] * pw % q) %= q;\n (pw *= 10) %= q;\n if(n <= 10) debug(cur);\n if(a[i] != 0) ans += (ll)mp[cur];\n mp[cur] ++;\n }\n // vc<int> sum(n + 1, 0);\n // sum[n] = n;\n // pw = 1;\n // for(int i = n - 1; i >= 0; -- i) {\n // sum[i] = sum[i + 1] + a[i] * pw;\n // sum[i] %= q;\n // (pw *= 10) %= q;\n // }\n // rep(i, n) {\n // rep(j, i + 1, n + 1) {\n // if(a[i] != 0 && sum[i] == sum[j]) ++ ans;\n // }\n // }\n out(ans);\n } \n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":7800,"score_of_the_acc":-0.1452,"final_rank":3},{"submission_id":"aoj_1310_6677476","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (int i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nint t=INF;\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tint N,S,W,Q;\n\tcin>>N>>S>>W>>Q;\n\tif(N==0){\n\t\tt=0;\n\t\treturn;\n\t}\n\tif(Q==2||Q==5){\n\t\tll ans=0,C=0;\n\t\trep(i,N){\n\t\t\tint tmp=(S/7)%10;\n\t\t\tif(tmp%Q==0){\n\t\t\t\tans+=C;\n\t\t\t\tif(tmp!=0) ans++;\n\t\t\t}if(tmp!=0) C++;\n\t\t\tif(S%2==0) S/=2;\n\t\t\telse S=((S/2)^W);\n\t\t}\n\t\tcout<<ans<<\"\\n\";\n\t\treturn;\n\t}\n\tmap<int,int> m;\n\tll ans=0;\n\tll R=1,A=10,P=Q-2;\n\twhile(P){\n\t\tif(P&1){\n\t\t\tR=(R*A)%Q;\n\t\t}\n\t\tA=(A*A)%Q;\n\t\tP>>=1;\n\t}\n\tll v=0,D=1;\n\trep(i,N){\n\t\tll tmp=(S/7)%10;\n\t\tif(tmp!=0) m[v]++;\n\t\tv=(v+tmp*D)%Q;\n\t\tD=(R*D)%Q;\n\t\tans+=m[v];\n\t\tif(S%2==0) S/=2;\n\t\telse S=((S/2)^W);\n\t}\n\tcout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":390,"memory_kb":7568,"score_of_the_acc":-0.4573,"final_rank":8},{"submission_id":"aoj_1310_6583669","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n ll N, S, W, Q;\n cin >> N >> S >> W >> Q;\n if (N == 0) break;\n\n int g = S;\n vector<ll> a(N);\n rep(i,0,N) {\n a[i] = (g/7) % 10;\n if (g % 2 == 0) g = g / 2;\n else g = (g / 2) ^ W;\n }\n\n ll ans = 0;\n if (Q == 2 || Q == 5) {\n ll cnt = 0;\n rep(i,0,N) {\n if (a[i] != 0) ++cnt;\n if (a[i] % Q == 0) ans += cnt;\n }\n } else {\n map<ll, ll> cnt;\n cnt[0] = 1;\n reverse(all(a));\n ll x = 0;\n ll p = 1;\n rep(i,0,N) {\n x = (x + a[i]*p) % Q;\n p = p * 10 % Q;\n if (a[i] != 0) ans += cnt[x];\n ++cnt[x];\n }\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":370,"memory_kb":9768,"score_of_the_acc":-0.8032,"final_rank":11},{"submission_id":"aoj_1310_6337167","code_snippet":"#include<bits/stdc++.h>\nusing ll = long long;\n#define var auto\nconst char newl = '\\n';\n\nusing namespace std;\n\ntemplate<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\ntemplate<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\n\nbool solve() {\n int n, s, w, q;\n cin >> n >> s >> w >> q;\n if (n == 0) return false;\n\n vector<int> a(n);\n {\n int g = s;\n for (int i = 0; i < n; i++) {\n a[i] = (g / 7) % 10;\n if (g % 2 == 0) { g = (g / 2); }\n else { g = (g / 2) ^ w; }\n }\n }\n\n ll res = 0;\n if (q == 2 || q == 5) {\n int tail_cnt = 0;\n for (int i = n - 1; i >= 0; i--) {\n if (a[i] % q == 0) tail_cnt++;\n if (a[i] != 0) res += tail_cnt;\n }\n }\n else {\n map<ll, int> tail_cnts;\n ll cur_mul = 0;\n ll cur_base = 1;\n tail_cnts[cur_mul]++;\n for (int i = n - 1; i >= 0; i--) {\n cur_mul = (a[i] * cur_base + cur_mul) % q;\n if (a[i] != 0) res += tail_cnts[cur_mul];\n tail_cnts[cur_mul]++;\n cur_base = (cur_base * 10) % q;\n }\n }\n\n cout << res << endl;\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (solve());\n}","accuracy":1,"time_ms":400,"memory_kb":9324,"score_of_the_acc":-1.058,"final_rank":15},{"submission_id":"aoj_1310_6214711","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\nstruct F {\n ll L;\n ll R;\n\n};\nll d(F f) {\n return f.R - f.L + 1;\n}\n\nint main() {\n while (1) {\n ll N, S, W, Q;\n cin >> N >> S >> W >> Q;\n if (N == 0)return 0;\n\n vll A(N);\n ll g = S;\n for (int i = 0; i < N; i++) {\n A[i] = (g / 7) % 10;\n if (g % 2 == 0) { g = (g / 2); }\n else { g = (g / 2) ^ W; }\n }\n reverse(all(A));\n ll an = 0;\n map<ll, ll> M;\n M[0]++;\n ll k = 0;\n ll t = 1;\n if (Q == 2) {\n vll E(2, 0);\n //E[0]++;\n rep(i, N) {\n E[A[i] % 2]++;\n if (A[i] != 0)an += E[0];\n \n }\n cout << an << endl;\n continue;\n }\n else if (Q == 5) {\n vll E(5, 0);\n //E[0]++;\n rep(i, N) {\n E[A[i] % 5]++;\n if (A[i] != 0)an += E[0];\n \n }\n cout << an << endl;\n continue;\n }\n rep(i, N) {\n k += A[i] * t;\n k %= Q;\n M[k]++;\n t *= 10;\n t %= Q;\n\n if (A[i] != 0) {\n an += (M[k] - 1);\n }\n }\n cout << an << endl;\n }\n}","accuracy":1,"time_ms":380,"memory_kb":9888,"score_of_the_acc":-0.9607,"final_rank":13},{"submission_id":"aoj_1310_6026504","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int N, S, W, Q;\n cin >> N >> S >> W >> Q;\n if (N == 0 and S == 0 and W == 0 and W == 0) return false;\n\n vector<int> a(N);\n int g = S;\n for (int i = 0; i < N; i++) {\n a[i] = (g / 7) % 10;\n if (g % 2 == 0) {\n g = (g / 2);\n } else {\n g = (g / 2) ^ W;\n }\n }\n\n long long ans = 0;\n if (Q == 2 or Q == 5) {\n int nonzero = 0;\n for (int i = 0; i < N; i++) {\n nonzero += (a[i] != 0);\n if (a[i] % Q == 0) ans += nonzero;\n }\n cout << ans << '\\n';\n return true;\n }\n\n int suf = 0;\n map<int, int> mp;\n mp[suf]++;\n for (int i = N - 1, power = 1; i >= 0; i--, (power *= 10) %= Q) {\n suf = (suf + a[i] * power) % Q;\n if (a[i] != 0) ans += mp[suf];\n mp[suf]++;\n }\n\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (solve())\n ;\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":7756,"score_of_the_acc":-0.1333,"final_rank":2},{"submission_id":"aoj_1310_6026503","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\n for (size_t i = 0; i < N; i++) {\n os << v[i] << (i + 1 == N ? \"\" : \" \");\n }\n return os;\n}\n\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\nlong long MSK(int n) { return (1LL << n) - 1; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <typename T> void mkuni(vector<T>& v) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n}\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\n#pragma endregion\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nbool solve() {\n int N, S, W, Q;\n cin >> N >> S >> W >> Q;\n if (N == 0 and S == 0 and W == 0 and W == 0) return false;\n\n vector<int> a(N);\n int g = S;\n for (int i = 0; i < N; i++) {\n a[i] = (g / 7) % 10;\n if (g % 2 == 0) {\n g = (g / 2);\n } else {\n g = (g / 2) ^ W;\n }\n }\n\n ll ans = 0;\n if (Q == 2 or Q == 5) {\n int nonzero = 0;\n for (int i = 0; i < N; i++) {\n nonzero += (a[i] != 0);\n if (a[i] % Q == 0) ans += nonzero;\n }\n cout << ans << '\\n';\n return true;\n }\n\n int suf = 0;\n map<int, int> mp;\n mp[suf]++;\n for (int i = N - 1, power = 1; i >= 0; i--, (power *= 10) %= Q) {\n suf = (suf + a[i] * power) % Q;\n if (a[i] != 0) ans += mp[suf];\n mp[suf]++;\n }\n\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (solve())\n ;\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":7580,"score_of_the_acc":-0.2106,"final_rank":4},{"submission_id":"aoj_1310_6014367","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nconstexpr ll mod = 1e9+7;\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,s,w,q;\n while(cin >> n >> s >> w >> q,n){\n ll g = s;\n vector<int> a(n);\n for(int i=0;i<n;i++){\n a[i] = (g/7) % 10;\n if(g&1) g = (g>>1)^w;\n else g = (g>>1);\n }\n // 場合分け\n if(q == 2 or q == 5){\n ll res = 0;\n ll pre = 0;\n for(int i=0;i<n;i++){\n if(a[i]) pre++;\n if(q == 2){\n if(!(a[i]&1)) res += pre;\n }\n else{\n if(a[i] == 0 or a[i] == 5) res += pre;\n }\n }\n cout << res << \"\\n\";\n }\n else{\n vector<ll> sum(n+1);\n ll po = 1;\n for(int i=n-1;i>=0;i--){\n sum[i] = (sum[i+1] + a[i]*po) % q;\n po *= 10; if(po >= q) po %= q;\n }\n map<ll,ll> mp;\n ll res = 0;\n for(int i=0;i<n;i++){\n if(a[i]) mp[sum[i]]++;\n res += mp[sum[i+1]];\n }\n cout << res << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":400,"memory_kb":10168,"score_of_the_acc":-1.2866,"final_rank":17},{"submission_id":"aoj_1310_6006874","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int n, s, w, q;\n cin >> n >> s >> w >> q;\n if (n == 0) return 0;\n\n vector<int> a(n);\n int g = s;\n for (int i = 0; i < n; i++) {\n a.at(i) = (g / 7) % 10;\n if (g % 2 == 0) g = g / 2;\n else g = ((g / 2) ^ w);\n }\n\n if (q == 2 || q == 5) {\n int ans = 0, count = 0;\n for (int i = n - 1; i >= 0; i--) {\n if (a.at(i) % q == 0) count++;\n if (a.at(i) != 0) ans += count;\n }\n cout << ans << '\\n';\n continue;\n }\n\n map<int, int> mp;\n mp[0]++;\n int now = 0, now10 = 1, ans = 0;\n for (int i = n - 1; i >= 0; i--) {\n now += now10 * a.at(i);\n now %= q;\n now10 = (now10 * 10) % q;\n if (a.at(i) != 0) ans += mp[now];\n mp[now]++;\n }\n\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":360,"memory_kb":7720,"score_of_the_acc":-0.1235,"final_rank":1},{"submission_id":"aoj_1310_6004979","code_snippet":"#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &...tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector<std::pair<char, int>> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector<std::pair<char, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate <class T>\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\n\tint n = v.size();\n\tstd::vector<std::pair<T, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector<int> iota(int n) {\n\tstd::vector<int> p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate <class T>\nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate <class U>\n\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector<T> cum;\n};\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) / 2;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 2 \"a.cpp\"\n\nvector<int> gen(int n, int s, int w) {\n\tint g = s;\n\tvector<int> a(n);\n\tfor(int i = 0; i < n; i++) {\n\t\ta[i] = (g / 7) % 10;\n\t\tif(g % 2 == 0)\n\t\t\tg /= 2;\n\t\telse\n\t\t\tg = (g / 2) ^ w;\n\t}\n\treturn a;\n}\n\nvoid main_() {\n\twhile(1) {\n\t\tINT(n, s, w, q);\n\t\tif(!n) break;\n\t\tauto a = gen(n, s, w);\n\t\tif(q == 2 or q == 5) {\n\t\t\tV<> valid(n);\n\t\t\tREP(i, n) { valid[i] = !!a[i]; }\n\t\t\tcum_vector<int> cum(valid);\n\t\t\tint res = 0;\n\t\t\tRREP(i, n) {\n\t\t\t\tif(a[i] % q) continue;\n\t\t\t\tres += cum.prod(0, i + 1);\n\t\t\t}\n\t\t\tprint(res);\n\t\t\tcontinue;\n\t\t}\n\t\tmap<int, int> memo;\n\t\tll val = 0, base = 1, res = 0;\n\t\tmemo[0] = 1;\n\t\tRREP(i, n) {\n\t\t\tval += (ll)a[i] * base;\n\t\t\tval %= q;\n\t\t\tbase *= 10;\n\t\t\tbase %= q;\n\t\t\tif(a[i]) res += memo[val];\n\t\t\tmemo[val]++;\n\t\t}\n\t\tprint(res);\n\t}\n}","accuracy":1,"time_ms":380,"memory_kb":7840,"score_of_the_acc":-0.406,"final_rank":7},{"submission_id":"aoj_1310_5995675","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\n#define POPCOUNT(x) __builtin_popcount(x)\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nconst ll INF = 1LL << 60;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nconst ll MOD = 1e9 + 7;\n\n// BEGIN CUT\nll modpow(ll x, ll y, ll m) {\n ll a = 1, p = x;\n while (y > 0) {\n if (y % 2 == 0) {\n p = (p * p) % m;\n y /= 2;\n } else {\n a = (a * p) % m;\n y--;\n }\n }\n return a;\n}\n// END CUT\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nint A[100000];\nll B[100001];\nll mul[100000];\n\nint main() {\n int N, S, W, Q;\n while (cin >> N >> S >> W >> Q, N) {\n int g = S;\n for (int i = 0; i < N; i++) {\n A[i] = (g / 7) % 10;\n if (g % 2 == 0) {\n g = (g / 2);\n } else {\n g = (g / 2) ^ W;\n }\n }\n if (Q == 2 || Q == 5) {\n int ans = 0;\n int k = 0;\n for (int i = 0; i < N; i++) {\n if (A[i] == 0) {\n ans += k;\n } else {\n if (A[i] % Q == 0)\n ans += k + 1;\n k++;\n }\n }\n cout << ans << '\\n';\n continue;\n }\n mul[N - 1] = 1;\n for (int i = N - 2; i >= 0; i--) {\n mul[i] = (mul[i + 1] * 10) % Q;\n }\n memset(B, 0, sizeof(B));\n for (int i = 0; i < N; i++) {\n if (i > 0)\n B[i] = B[i - 1];\n (B[i] += A[i] * mul[i] % Q) %= Q;\n }\n map<int, int> cnt;\n int prev = 0;\n int ans = 0;\n for (int i = 0; i < N; i++) {\n ans += cnt[B[i]];\n if (A[i] != 0) {\n cnt[prev]++;\n }\n if (A[i] != 0 && A[i] % Q == 0)\n ans++;\n prev = B[i];\n }\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":440,"memory_kb":9388,"score_of_the_acc":-1.5753,"final_rank":19},{"submission_id":"aoj_1310_5960866","code_snippet":"#pragma GCC tag(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 5050000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nll modpow(ll x, ll n, ll mod){\n ll res = 1;\n while(n > 0){\n if(n & 1) res = res * x % mod;\n x = x * x % mod;\n n >>= 1;\n }\n return res;\n}\n\nint main(){\n while(1){\n ll n,s,w,p; cin >> n >> s >> w >> p;\n if(!n) break;\n vl a(n);\n ll g = s;\n rep(i,n){\n a[i] = (g/7) % 10;\n if(g % 2 == 0) g = g/2;\n else g = (g/2) ^ w;\n }\n ll inv10 = modpow(10,p-2,p);\n ll ans = 0;\n if(p == 2 || p == 5){\n ll cnt = 0;\n rep(i,n){\n if(a[i] == 0) ans += cnt;\n else{\n cnt++;\n if(a[i] % p == 0) ans += cnt;\n }\n }\n }else{\n map<ll,ll> mp;\n ll now = 0;\n ll mul = 1;\n mp[0]++;\n rep(i,n){\n if(a[i] == 0) ans--;\n now = (now * 10 + a[i]) % p;\n ll tmp = now * mul % p;\n if(mp.count(tmp)) ans += mp[tmp];\n if(a[i] != 0) mp[tmp]++;\n mul = mul * inv10 % p;\n }\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":430,"memory_kb":9288,"score_of_the_acc":-1.4232,"final_rank":18},{"submission_id":"aoj_1310_5537799","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N, S, W, Q;\n while (cin >> N >> S >> W >> Q, N) {\n vector<int> a(N);\n int g = S;\n for (int i = 0; i < N; i++) {\n a[i] = (g / 7) % 10;\n if (g % 2 == 0) {\n g = (g / 2);\n } else {\n g = (g / 2) ^ W;\n }\n }\n int ans = 0;\n if (10 % Q == 0) {\n int maine = 0;\n for (int i = N - 1; i >= 0; i--) {\n maine += (a[i] % Q == 0);\n if (a[i])\n ans += maine;\n }\n } else {\n map<int, int> maine;\n maine[0]++;\n int book = 0, tens = 1;\n for (int i = N - 1; i >= 0; i--) {\n (tens *= 10) %= Q;\n (book += tens * a[i]) %= Q;\n if (a[i] != 0)\n ans += maine[book];\n maine[book]++;\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":380,"memory_kb":7668,"score_of_the_acc":-0.3594,"final_rank":6},{"submission_id":"aoj_1310_5252898","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n\nusing namespace std;\n\nbool solve() {\n int n;\n cin >> n;\n if (n == 0) return false;\n\n vector<int> ds(n);\n {\n int s, w;\n cin >> s >> w;\n\n for (auto& d : ds) {\n d = (s / 7) % 10;\n\n if (s % 2 == 0) {\n s = s / 2;\n } else {\n s = (s / 2) ^ w;\n }\n }\n }\n\n int p;\n cin >> p;\n\n int ans = 0;\n if (p == 2 || p == 5) {\n int acc = 0;\n for (auto d : ds) {\n if (d != 0) ++acc;\n if (d % p == 0) ans += acc;\n }\n } else {\n reverse(ds.begin(), ds.end());\n map<int, int> cnt;\n\n int sum = 0, deg = 1;\n for (auto d : ds) {\n ++cnt[sum];\n (sum += d * deg) %= p;\n (deg *= 10) %= p;\n\n if (d != 0 && cnt.count(sum)) ans += cnt[sum];\n }\n }\n\n cout << ans << \"\\n\";\n return true;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while (solve()) {}\n\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":7692,"score_of_the_acc":-0.2409,"final_rank":5},{"submission_id":"aoj_1310_4956348","code_snippet":"#include<iostream>\n#include<map>\nusing namespace std;\nlong modpow(long a,long b,long mod){return b?modpow(a*a%mod,b/2,mod)*(b%2?a:1)%mod:1%mod;}\nint N,S,W,Q;\nmain()\n{\n\twhile(cin>>N>>S>>W>>Q,N)\n\t{\n\t\tlong inv=modpow(10,Q-2,Q),pinv=1;\n\t\tlong ans=0,now=0,cnt=0;\n\t\tmap<int,int>mp;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tint a=S/7%10;\n\t\t\tif(a!=0)\n\t\t\t{\n\t\t\t\tmp[now]++;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tnow=(now+pinv*a)%Q;\n\t\t\tpinv=pinv*inv%Q;\n\t\t\tif(Q==2||Q==5)\n\t\t\t{\n\t\t\t\tif(a%Q==0)ans+=cnt;\n\t\t\t}\n\t\t\telse ans+=mp[now];\n\t\t\tif(S%2==0)S/=2;\n\t\t\telse S=S/2^W;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":410,"memory_kb":7304,"score_of_the_acc":-0.6358,"final_rank":10},{"submission_id":"aoj_1310_4941064","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\n//constexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\nconstexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N >> L >> M >> K, N) {\n\t\tvector<int>v(N + 1);\n\t\tfor (int i = 1; i <= N; i++) {\n\t\t\tv[i] = (L / 7) % 10;\n\t\t\tif (L & 1)L = (L / 2) ^ M;\n\t\t\telse L >>= 1;\n\t\t}\n\t\tif (K == 2 || K == 5) {\n\t\t\tlong long int ans = 0;\n\t\t\tint num = 0;\n\t\t\tfor (int i = 1; i <= N; i++) {\n\t\t\t//\tcout << v[i];\n\t\t\t\tif (v[i]) {\n\t\t\t\t\tnum++;\n\t\t\t\t\tif (v[i] % K == 0) {\n\t\t\t\t\t\tans += num;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tans += num;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tmap<int, int>mp;\n\t\tlong long int ans = 0;\n\t\tmp[0]++;\n\t\tlong long int num = 0;\n\t\tlong long int by = 1;\n\t\tfor (int i = N; i > 0; i--) {\n\t\t\tnum += by * v[i];\n\t\t\tnum %= K;\n\t\t\tif (v[i]) {\n\t\t\t\tans += mp[num];\n\t\t\t}\n\t\t\tmp[num]++;\n\t\t\tby *= 10;\n\t\t\tby %= K;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":410,"memory_kb":7264,"score_of_the_acc":-0.625,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_1310_10851362\",\n \"code_snippet\": \"#include <cstdio>\\n#include <map>\\n#include <iostream>\\n#include <cstring>\\nusing namespace std;\\nusing std::map;\\nint a[100010];\\nmap<long long,int> mp;\\nlong long pow_mod(long long a,long long b,long long p)\\n{\\n\\tlong long ans = 1;\\n\\twhile(b) {\\n\\t\\tif(b&1) ans = ans * a % p;\\n\\t\\tb >>= 1; a = a * a % p;\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main()\\n{\\n\\tlong long N,S,W,Q;\\n\\twhile(std::cin>>N>>S>>W>>Q)\\n\\t{\\n\\t\\tif(!N) break;\\n\\t\\tmp.clear();\\n\\t\\tint g = S;\\n\\t\\ta[0] = 0;\\n\\t\\tfor(int i = 1; i <= N; i++)\\n\\t\\t{\\n\\t\\t\\ta[i] = (g/7) % 10;\\n\\t\\t\\tif(g%2==0) g /= 2;\\n\\t\\t\\telse g = (g/2) ^ W;\\n\\t\\t}\\n\\t\\tif(Q == 5 || Q == 2)\\n\\t\\t{\\n\\t\\t\\tint ans = 0;\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tfor(int i = 1;i <= N;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(a[i] != 0)cnt++;\\n\\t\\t\\t\\tif(a[i] % Q == 0)ans += cnt;\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tlong long ans = 0;\\n\\t\\tlong long sum = 0;\\n\\t\\tlong long S = 1;\\n\\t\\tfor(int i = N; i >= 1; i--)\\n\\t\\t{\\n\\t\\t\\tsum = (S*a[i] + sum) % Q;\\n\\t if(a[i] > 0 && !sum) ans++;\\n\\t\\t\\tif(a[i] > 0) ans += mp[sum] ;\\n\\t\\t\\tmp[sum]++;\\n\\t\\t\\tS *= 10;\\n\\t\\t\\tS %= Q;\\n\\t\\t}\\n\\t\\tstd::cout<<ans<<std::endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 9440,\n \"score_of_the_acc\": -0.9644,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1310_9730559\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\nwhile(1) {\\n ll N, S, W, Q;\\n cin >> N >> S >> W >> Q;\\n if (N == 0) return 0;\\n ll G = S;\\n vector<ll> A(N);\\n rep(i,0,N) {\\n A[i] = (G/7) % 10;\\n if (G % 2 == 0) G /= 2;\\n else G = (G/2) ^ W;\\n }\\n reverse(ALL(A));\\n if (Q == 2) {\\n ll ANS = 0;\\n ll COUNT = 0;\\n rep(i,0,N) {\\n if (A[i] % 2 == 0) COUNT++;\\n if (A[i] != 0) ANS += COUNT;\\n }\\n cout << ANS << endl;\\n continue;\\n }\\n if (Q == 5) {\\n ll ANS = 0;\\n ll COUNT = 0;\\n rep(i,0,N) {\\n if (A[i] % 5 == 0) COUNT++;\\n if (A[i] != 0) ANS += COUNT;\\n }\\n cout << ANS << endl;\\n continue;\\n }\\n ll D = 1, Cur = 0;\\n ll ANS = 0;\\n map<ll,int> mp;\\n mp[0]++;\\n rep(i,0,N) {\\n Cur += (D * A[i]);\\n D *= 10;\\n Cur %= Q;\\n D %= Q;\\n if (A[i] != 0) ANS += mp[Cur];\\n mp[Cur]++;\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 9848,\n \"score_of_the_acc\": -0.9499,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1310_8998678\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint solve2(int N, vector<i64> a, int Q) {\\n int ans = 0, zero = 0;\\n for(int i : rep(N)) {\\n if(a[i] % Q == 0) ans += i + 1 - zero;\\n if(a[i] == 0) zero++;\\n }\\n return ans - zero;\\n}\\n\\nint solve(int N, int S, int W, int Q) {\\n vector<i64> a(N);\\n {\\n int g = S;\\n for(int i = 0; i < N; i++) {\\n a[i] = (g / 7) % 10;\\n if(g % 2 == 0) { g = (g / 2); }\\n else {g = (g / 2) ^ W; }\\n }\\n }\\n\\n if(Q == 2 or Q == 5) return solve2(N, a, Q);\\n\\n i64 pow10 = 1;\\n vector<i64> b(N);\\n for(int i : revrep(N)) {\\n b[i] = (a[i] * pow10) % Q;\\n pow10 = (pow10 * 10) % Q;\\n }\\n\\n vector<i64> s(N + 1, 0);\\n for(int i : revrep(N)) s[i] = (s[i + 1] + b[i]) % Q;\\n int ans = 0;\\n map<i64, int> mp;\\n mp[0] = 1;\\n for(int i : revrep(N)) {\\n if(a[i] != 0) ans += mp[s[i]];\\n mp[s[i]]++;\\n }\\n return ans;\\n}\\n\\nint main() {\\n while(true) {\\n int N = in(), S = in(), W = in(), Q = in();\\n if(make_tuple(N, S, W, Q) == make_tuple(0, 0, 0, 0)) return 0;\\n print(solve(N, S, W, Q));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 10956,\n \"score_of_the_acc\": -1.625,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1310_8505599\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n while (1) {\\n int n, s, w, p;\\n cin >> n >> s >> w >> p;\\n if (!n)\\n break;\\n vector<int> a(n);\\n int g = s;\\n rep(i, n) {\\n a[i] = g / 7 % 10;\\n g = (g % 2 == 0 ? g / 2 : (g / 2) ^ w);\\n }\\n ll ans = 0;\\n if (p == 2 || p == 5) {\\n ll cnt = 0;\\n rep(i, n) {\\n if (a[i] % p == 0) {\\n if (a[i]) ans++;\\n ans += cnt;\\n }\\n if (a[i]) cnt++;\\n }\\n }\\n else {\\n map<ll, ll> m;\\n ll val = 0, t = 1;\\n m[0]++;\\n per(i, n) {\\n val += t * a[i];\\n val %= p;\\n if (a[i]) ans += m[val];\\n m[val]++;\\n t *= 10, t %= p;\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 9400,\n \"score_of_the_acc\": -1.0785,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1310_6761294\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n// #define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\ntemplate<class T> void scan(T& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ cout << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nvoid solve() {\\n int n, s, w, q;\\n while(cin >> n >> s >> w >> q) {\\n if(n == 0) break;\\n int g = s;\\n vc<int> a(n);\\n rep(i, n) {\\n a[i] = (g / 7) % 10;\\n if(g % 2 == 0) {\\n g = g / 2;\\n } else {\\n g = (g / 2) ^ w;\\n }\\n }\\n if(q == 2 || q == 5) {\\n int cnt = 0;\\n ll ans = 0;\\n rev_rep(i, n) {\\n if(a[i] % q == 0) ++ cnt;\\n if(a[i] != 0) ans += cnt;\\n }\\n out(ans);\\n continue;\\n }\\n if(n <= 10) dump(a);\\n ll ans = 0;\\n map<int, int> mp;\\n mp[0] ++;\\n int cur = 0;\\n int pw = 1;\\n for(int i = n - 1; i >= 0; -- i) {\\n (cur += a[i] * pw % q) %= q;\\n (pw *= 10) %= q;\\n if(n <= 10) debug(cur);\\n if(a[i] != 0) ans += (ll)mp[cur];\\n mp[cur] ++;\\n }\\n // vc<int> sum(n + 1, 0);\\n // sum[n] = n;\\n // pw = 1;\\n // for(int i = n - 1; i >= 0; -- i) {\\n // sum[i] = sum[i + 1] + a[i] * pw;\\n // sum[i] %= q;\\n // (pw *= 10) %= q;\\n // }\\n // rep(i, n) {\\n // rep(j, i + 1, n + 1) {\\n // if(a[i] != 0 && sum[i] == sum[j]) ++ ans;\\n // }\\n // }\\n out(ans);\\n } \\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 7800,\n \"score_of_the_acc\": -0.1452,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1310_6677476\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (int i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nint t=INF;\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\t//cin>>t;\\n\\trep(i,t) solve();\\n}\\n\\nvoid solve(){\\n\\tint N,S,W,Q;\\n\\tcin>>N>>S>>W>>Q;\\n\\tif(N==0){\\n\\t\\tt=0;\\n\\t\\treturn;\\n\\t}\\n\\tif(Q==2||Q==5){\\n\\t\\tll ans=0,C=0;\\n\\t\\trep(i,N){\\n\\t\\t\\tint tmp=(S/7)%10;\\n\\t\\t\\tif(tmp%Q==0){\\n\\t\\t\\t\\tans+=C;\\n\\t\\t\\t\\tif(tmp!=0) ans++;\\n\\t\\t\\t}if(tmp!=0) C++;\\n\\t\\t\\tif(S%2==0) S/=2;\\n\\t\\t\\telse S=((S/2)^W);\\n\\t\\t}\\n\\t\\tcout<<ans<<\\\"\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tmap<int,int> m;\\n\\tll ans=0;\\n\\tll R=1,A=10,P=Q-2;\\n\\twhile(P){\\n\\t\\tif(P&1){\\n\\t\\t\\tR=(R*A)%Q;\\n\\t\\t}\\n\\t\\tA=(A*A)%Q;\\n\\t\\tP>>=1;\\n\\t}\\n\\tll v=0,D=1;\\n\\trep(i,N){\\n\\t\\tll tmp=(S/7)%10;\\n\\t\\tif(tmp!=0) m[v]++;\\n\\t\\tv=(v+tmp*D)%Q;\\n\\t\\tD=(R*D)%Q;\\n\\t\\tans+=m[v];\\n\\t\\tif(S%2==0) S/=2;\\n\\t\\telse S=((S/2)^W);\\n\\t}\\n\\tcout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 7568,\n \"score_of_the_acc\": -0.4573,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1310_6583669\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n ll N, S, W, Q;\\n cin >> N >> S >> W >> Q;\\n if (N == 0) break;\\n\\n int g = S;\\n vector<ll> a(N);\\n rep(i,0,N) {\\n a[i] = (g/7) % 10;\\n if (g % 2 == 0) g = g / 2;\\n else g = (g / 2) ^ W;\\n }\\n\\n ll ans = 0;\\n if (Q == 2 || Q == 5) {\\n ll cnt = 0;\\n rep(i,0,N) {\\n if (a[i] != 0) ++cnt;\\n if (a[i] % Q == 0) ans += cnt;\\n }\\n } else {\\n map<ll, ll> cnt;\\n cnt[0] = 1;\\n reverse(all(a));\\n ll x = 0;\\n ll p = 1;\\n rep(i,0,N) {\\n x = (x + a[i]*p) % Q;\\n p = p * 10 % Q;\\n if (a[i] != 0) ans += cnt[x];\\n ++cnt[x];\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 9768,\n \"score_of_the_acc\": -0.8032,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1310_6337167\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing ll = long long;\\n#define var auto\\nconst char newl = '\\\\n';\\n\\nusing namespace std;\\n\\ntemplate<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\\ntemplate<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\\n\\nbool solve() {\\n int n, s, w, q;\\n cin >> n >> s >> w >> q;\\n if (n == 0) return false;\\n\\n vector<int> a(n);\\n {\\n int g = s;\\n for (int i = 0; i < n; i++) {\\n a[i] = (g / 7) % 10;\\n if (g % 2 == 0) { g = (g / 2); }\\n else { g = (g / 2) ^ w; }\\n }\\n }\\n\\n ll res = 0;\\n if (q == 2 || q == 5) {\\n int tail_cnt = 0;\\n for (int i = n - 1; i >= 0; i--) {\\n if (a[i] % q == 0) tail_cnt++;\\n if (a[i] != 0) res += tail_cnt;\\n }\\n }\\n else {\\n map<ll, int> tail_cnts;\\n ll cur_mul = 0;\\n ll cur_base = 1;\\n tail_cnts[cur_mul]++;\\n for (int i = n - 1; i >= 0; i--) {\\n cur_mul = (a[i] * cur_base + cur_mul) % q;\\n if (a[i] != 0) res += tail_cnts[cur_mul];\\n tail_cnts[cur_mul]++;\\n cur_base = (cur_base * 10) % q;\\n }\\n }\\n\\n cout << res << endl;\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 9324,\n \"score_of_the_acc\": -1.058,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1310_6214711\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\nstruct F {\\n ll L;\\n ll R;\\n\\n};\\nll d(F f) {\\n return f.R - f.L + 1;\\n}\\n\\nint main() {\\n while (1) {\\n ll N, S, W, Q;\\n cin >> N >> S >> W >> Q;\\n if (N == 0)return 0;\\n\\n vll A(N);\\n ll g = S;\\n for (int i = 0; i < N; i++) {\\n A[i] = (g / 7) % 10;\\n if (g % 2 == 0) { g = (g / 2); }\\n else { g = (g / 2) ^ W; }\\n }\\n reverse(all(A));\\n ll an = 0;\\n map<ll, ll> M;\\n M[0]++;\\n ll k = 0;\\n ll t = 1;\\n if (Q == 2) {\\n vll E(2, 0);\\n //E[0]++;\\n rep(i, N) {\\n E[A[i] % 2]++;\\n if (A[i] != 0)an += E[0];\\n \\n }\\n cout << an << endl;\\n continue;\\n }\\n else if (Q == 5) {\\n vll E(5, 0);\\n //E[0]++;\\n rep(i, N) {\\n E[A[i] % 5]++;\\n if (A[i] != 0)an += E[0];\\n \\n }\\n cout << an << endl;\\n continue;\\n }\\n rep(i, N) {\\n k += A[i] * t;\\n k %= Q;\\n M[k]++;\\n t *= 10;\\n t %= Q;\\n\\n if (A[i] != 0) {\\n an += (M[k] - 1);\\n }\\n }\\n cout << an << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 9888,\n \"score_of_the_acc\": -0.9607,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1310_6026504\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int N, S, W, Q;\\n cin >> N >> S >> W >> Q;\\n if (N == 0 and S == 0 and W == 0 and W == 0) return false;\\n\\n vector<int> a(N);\\n int g = S;\\n for (int i = 0; i < N; i++) {\\n a[i] = (g / 7) % 10;\\n if (g % 2 == 0) {\\n g = (g / 2);\\n } else {\\n g = (g / 2) ^ W;\\n }\\n }\\n\\n long long ans = 0;\\n if (Q == 2 or Q == 5) {\\n int nonzero = 0;\\n for (int i = 0; i < N; i++) {\\n nonzero += (a[i] != 0);\\n if (a[i] % Q == 0) ans += nonzero;\\n }\\n cout << ans << '\\\\n';\\n return true;\\n }\\n\\n int suf = 0;\\n map<int, int> mp;\\n mp[suf]++;\\n for (int i = N - 1, power = 1; i >= 0; i--, (power *= 10) %= Q) {\\n suf = (suf + a[i] * power) % Q;\\n if (a[i] != 0) ans += mp[suf];\\n mp[suf]++;\\n }\\n\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while (solve())\\n ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 7756,\n \"score_of_the_acc\": -0.1333,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1310_6026503\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\\n for (size_t i = 0; i < N; i++) {\\n os << v[i] << (i + 1 == N ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\nlong long MSK(int n) { return (1LL << n) - 1; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <typename T> void mkuni(vector<T>& v) {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n}\\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\\n#pragma endregion\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nbool solve() {\\n int N, S, W, Q;\\n cin >> N >> S >> W >> Q;\\n if (N == 0 and S == 0 and W == 0 and W == 0) return false;\\n\\n vector<int> a(N);\\n int g = S;\\n for (int i = 0; i < N; i++) {\\n a[i] = (g / 7) % 10;\\n if (g % 2 == 0) {\\n g = (g / 2);\\n } else {\\n g = (g / 2) ^ W;\\n }\\n }\\n\\n ll ans = 0;\\n if (Q == 2 or Q == 5) {\\n int nonzero = 0;\\n for (int i = 0; i < N; i++) {\\n nonzero += (a[i] != 0);\\n if (a[i] % Q == 0) ans += nonzero;\\n }\\n cout << ans << '\\\\n';\\n return true;\\n }\\n\\n int suf = 0;\\n map<int, int> mp;\\n mp[suf]++;\\n for (int i = N - 1, power = 1; i >= 0; i--, (power *= 10) %= Q) {\\n suf = (suf + a[i] * power) % Q;\\n if (a[i] != 0) ans += mp[suf];\\n mp[suf]++;\\n }\\n\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while (solve())\\n ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 7580,\n \"score_of_the_acc\": -0.2106,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1310_6014367\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nconstexpr ll mod = 1e9+7;\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,s,w,q;\\n while(cin >> n >> s >> w >> q,n){\\n ll g = s;\\n vector<int> a(n);\\n for(int i=0;i<n;i++){\\n a[i] = (g/7) % 10;\\n if(g&1) g = (g>>1)^w;\\n else g = (g>>1);\\n }\\n // 場合分け\\n if(q == 2 or q == 5){\\n ll res = 0;\\n ll pre = 0;\\n for(int i=0;i<n;i++){\\n if(a[i]) pre++;\\n if(q == 2){\\n if(!(a[i]&1)) res += pre;\\n }\\n else{\\n if(a[i] == 0 or a[i] == 5) res += pre;\\n }\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n else{\\n vector<ll> sum(n+1);\\n ll po = 1;\\n for(int i=n-1;i>=0;i--){\\n sum[i] = (sum[i+1] + a[i]*po) % q;\\n po *= 10; if(po >= q) po %= q;\\n }\\n map<ll,ll> mp;\\n ll res = 0;\\n for(int i=0;i<n;i++){\\n if(a[i]) mp[sum[i]]++;\\n res += mp[sum[i+1]];\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 10168,\n \"score_of_the_acc\": -1.2866,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1310_6006874\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n int n, s, w, q;\\n cin >> n >> s >> w >> q;\\n if (n == 0) return 0;\\n\\n vector<int> a(n);\\n int g = s;\\n for (int i = 0; i < n; i++) {\\n a.at(i) = (g / 7) % 10;\\n if (g % 2 == 0) g = g / 2;\\n else g = ((g / 2) ^ w);\\n }\\n\\n if (q == 2 || q == 5) {\\n int ans = 0, count = 0;\\n for (int i = n - 1; i >= 0; i--) {\\n if (a.at(i) % q == 0) count++;\\n if (a.at(i) != 0) ans += count;\\n }\\n cout << ans << '\\\\n';\\n continue;\\n }\\n\\n map<int, int> mp;\\n mp[0]++;\\n int now = 0, now10 = 1, ans = 0;\\n for (int i = n - 1; i >= 0; i--) {\\n now += now10 * a.at(i);\\n now %= q;\\n now10 = (now10 * 10) % q;\\n if (a.at(i) != 0) ans += mp[now];\\n mp[now]++;\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 7720,\n \"score_of_the_acc\": -0.1235,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1310_6004979\",\n \"code_snippet\": \"#line 1 \\\"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &...tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\nstd::vector<std::pair<char, int>> rle(const string &s) {\\n\\tint n = s.size();\\n\\tstd::vector<std::pair<char, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and s[l] == s[r]; r++) {}\\n\\t\\tret.emplace_back(s[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T>\\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\\n\\tint n = v.size();\\n\\tstd::vector<std::pair<T, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and v[l] == v[r]; r++) {}\\n\\t\\tret.emplace_back(v[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\nstd::vector<int> iota(int n) {\\n\\tstd::vector<int> p(n);\\n\\tstd::iota(p.begin(), p.end(), 0);\\n\\treturn p;\\n}\\ntemplate <class T>\\nstruct cum_vector {\\npublic:\\n\\tcum_vector() = default;\\n\\ttemplate <class U>\\n\\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\\n\\t\\tfor(int i = 0; i < (int)vec.size(); i++)\\n\\t\\t\\tcum[i + 1] = cum[i] + vec[i];\\n\\t}\\n\\tT prod(int l, int r) {\\n\\t\\treturn cum[r] - cum[l];\\n\\t}\\n\\nprivate:\\n\\tstd::vector<T> cum;\\n};\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\ta = (a % mod + mod) % mod;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f) {\\n\\twhile(abs(ok - ng) > 1) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f, int loop) {\\n\\tfor(int i = 0; i < loop; i++) {\\n\\t\\tT mid = (ok + ng) / 2;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nvoid main_();\\n\\nint main() {\\n\\tmain_();\\n\\treturn 0;\\n}\\n#line 2 \\\"a.cpp\\\"\\n\\nvector<int> gen(int n, int s, int w) {\\n\\tint g = s;\\n\\tvector<int> a(n);\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\ta[i] = (g / 7) % 10;\\n\\t\\tif(g % 2 == 0)\\n\\t\\t\\tg /= 2;\\n\\t\\telse\\n\\t\\t\\tg = (g / 2) ^ w;\\n\\t}\\n\\treturn a;\\n}\\n\\nvoid main_() {\\n\\twhile(1) {\\n\\t\\tINT(n, s, w, q);\\n\\t\\tif(!n) break;\\n\\t\\tauto a = gen(n, s, w);\\n\\t\\tif(q == 2 or q == 5) {\\n\\t\\t\\tV<> valid(n);\\n\\t\\t\\tREP(i, n) { valid[i] = !!a[i]; }\\n\\t\\t\\tcum_vector<int> cum(valid);\\n\\t\\t\\tint res = 0;\\n\\t\\t\\tRREP(i, n) {\\n\\t\\t\\t\\tif(a[i] % q) continue;\\n\\t\\t\\t\\tres += cum.prod(0, i + 1);\\n\\t\\t\\t}\\n\\t\\t\\tprint(res);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tmap<int, int> memo;\\n\\t\\tll val = 0, base = 1, res = 0;\\n\\t\\tmemo[0] = 1;\\n\\t\\tRREP(i, n) {\\n\\t\\t\\tval += (ll)a[i] * base;\\n\\t\\t\\tval %= q;\\n\\t\\t\\tbase *= 10;\\n\\t\\t\\tbase %= q;\\n\\t\\t\\tif(a[i]) res += memo[val];\\n\\t\\t\\tmemo[val]++;\\n\\t\\t}\\n\\t\\tprint(res);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 7840,\n \"score_of_the_acc\": -0.406,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1310_5995675\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\n#define POPCOUNT(x) __builtin_popcount(x)\\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\\n\\nconst ll INF = 1LL << 60;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nconst ll MOD = 1e9 + 7;\\n\\n// BEGIN CUT\\nll modpow(ll x, ll y, ll m) {\\n ll a = 1, p = x;\\n while (y > 0) {\\n if (y % 2 == 0) {\\n p = (p * p) % m;\\n y /= 2;\\n } else {\\n a = (a * p) % m;\\n y--;\\n }\\n }\\n return a;\\n}\\n// END CUT\\n\\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\\n\\nint A[100000];\\nll B[100001];\\nll mul[100000];\\n\\nint main() {\\n int N, S, W, Q;\\n while (cin >> N >> S >> W >> Q, N) {\\n int g = S;\\n for (int i = 0; i < N; i++) {\\n A[i] = (g / 7) % 10;\\n if (g % 2 == 0) {\\n g = (g / 2);\\n } else {\\n g = (g / 2) ^ W;\\n }\\n }\\n if (Q == 2 || Q == 5) {\\n int ans = 0;\\n int k = 0;\\n for (int i = 0; i < N; i++) {\\n if (A[i] == 0) {\\n ans += k;\\n } else {\\n if (A[i] % Q == 0)\\n ans += k + 1;\\n k++;\\n }\\n }\\n cout << ans << '\\\\n';\\n continue;\\n }\\n mul[N - 1] = 1;\\n for (int i = N - 2; i >= 0; i--) {\\n mul[i] = (mul[i + 1] * 10) % Q;\\n }\\n memset(B, 0, sizeof(B));\\n for (int i = 0; i < N; i++) {\\n if (i > 0)\\n B[i] = B[i - 1];\\n (B[i] += A[i] * mul[i] % Q) %= Q;\\n }\\n map<int, int> cnt;\\n int prev = 0;\\n int ans = 0;\\n for (int i = 0; i < N; i++) {\\n ans += cnt[B[i]];\\n if (A[i] != 0) {\\n cnt[prev]++;\\n }\\n if (A[i] != 0 && A[i] % Q == 0)\\n ans++;\\n prev = B[i];\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 9388,\n \"score_of_the_acc\": -1.5753,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1310_5960866\",\n \"code_snippet\": \"#pragma GCC tag(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 5050000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nll modpow(ll x, ll n, ll mod){\\n ll res = 1;\\n while(n > 0){\\n if(n & 1) res = res * x % mod;\\n x = x * x % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\nint main(){\\n while(1){\\n ll n,s,w,p; cin >> n >> s >> w >> p;\\n if(!n) break;\\n vl a(n);\\n ll g = s;\\n rep(i,n){\\n a[i] = (g/7) % 10;\\n if(g % 2 == 0) g = g/2;\\n else g = (g/2) ^ w;\\n }\\n ll inv10 = modpow(10,p-2,p);\\n ll ans = 0;\\n if(p == 2 || p == 5){\\n ll cnt = 0;\\n rep(i,n){\\n if(a[i] == 0) ans += cnt;\\n else{\\n cnt++;\\n if(a[i] % p == 0) ans += cnt;\\n }\\n }\\n }else{\\n map<ll,ll> mp;\\n ll now = 0;\\n ll mul = 1;\\n mp[0]++;\\n rep(i,n){\\n if(a[i] == 0) ans--;\\n now = (now * 10 + a[i]) % p;\\n ll tmp = now * mul % p;\\n if(mp.count(tmp)) ans += mp[tmp];\\n if(a[i] != 0) mp[tmp]++;\\n mul = mul * inv10 % p;\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 9288,\n \"score_of_the_acc\": -1.4232,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1310_5537799\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N, S, W, Q;\\n while (cin >> N >> S >> W >> Q, N) {\\n vector<int> a(N);\\n int g = S;\\n for (int i = 0; i < N; i++) {\\n a[i] = (g / 7) % 10;\\n if (g % 2 == 0) {\\n g = (g / 2);\\n } else {\\n g = (g / 2) ^ W;\\n }\\n }\\n int ans = 0;\\n if (10 % Q == 0) {\\n int maine = 0;\\n for (int i = N - 1; i >= 0; i--) {\\n maine += (a[i] % Q == 0);\\n if (a[i])\\n ans += maine;\\n }\\n } else {\\n map<int, int> maine;\\n maine[0]++;\\n int book = 0, tens = 1;\\n for (int i = N - 1; i >= 0; i--) {\\n (tens *= 10) %= Q;\\n (book += tens * a[i]) %= Q;\\n if (a[i] != 0)\\n ans += maine[book];\\n maine[book]++;\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 7668,\n \"score_of_the_acc\": -0.3594,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1310_5252898\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n\\nbool solve() {\\n int n;\\n cin >> n;\\n if (n == 0) return false;\\n\\n vector<int> ds(n);\\n {\\n int s, w;\\n cin >> s >> w;\\n\\n for (auto& d : ds) {\\n d = (s / 7) % 10;\\n\\n if (s % 2 == 0) {\\n s = s / 2;\\n } else {\\n s = (s / 2) ^ w;\\n }\\n }\\n }\\n\\n int p;\\n cin >> p;\\n\\n int ans = 0;\\n if (p == 2 || p == 5) {\\n int acc = 0;\\n for (auto d : ds) {\\n if (d != 0) ++acc;\\n if (d % p == 0) ans += acc;\\n }\\n } else {\\n reverse(ds.begin(), ds.end());\\n map<int, int> cnt;\\n\\n int sum = 0, deg = 1;\\n for (auto d : ds) {\\n ++cnt[sum];\\n (sum += d * deg) %= p;\\n (deg *= 10) %= p;\\n\\n if (d != 0 && cnt.count(sum)) ans += cnt[sum];\\n }\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n while (solve()) {}\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 7692,\n \"score_of_the_acc\": -0.2409,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1310_4956348\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\nusing namespace std;\\nlong modpow(long a,long b,long mod){return b?modpow(a*a%mod,b/2,mod)*(b%2?a:1)%mod:1%mod;}\\nint N,S,W,Q;\\nmain()\\n{\\n\\twhile(cin>>N>>S>>W>>Q,N)\\n\\t{\\n\\t\\tlong inv=modpow(10,Q-2,Q),pinv=1;\\n\\t\\tlong ans=0,now=0,cnt=0;\\n\\t\\tmap<int,int>mp;\\n\\t\\tfor(int i=0;i<N;i++)\\n\\t\\t{\\n\\t\\t\\tint a=S/7%10;\\n\\t\\t\\tif(a!=0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmp[now]++;\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t}\\n\\t\\t\\tnow=(now+pinv*a)%Q;\\n\\t\\t\\tpinv=pinv*inv%Q;\\n\\t\\t\\tif(Q==2||Q==5)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(a%Q==0)ans+=cnt;\\n\\t\\t\\t}\\n\\t\\t\\telse ans+=mp[now];\\n\\t\\t\\tif(S%2==0)S/=2;\\n\\t\\t\\telse S=S/2^W;\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 7304,\n \"score_of_the_acc\": -0.6358,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1310_4941064\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\n//constexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\nconstexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N >> L >> M >> K, N) {\\n\\t\\tvector<int>v(N + 1);\\n\\t\\tfor (int i = 1; i <= N; i++) {\\n\\t\\t\\tv[i] = (L / 7) % 10;\\n\\t\\t\\tif (L & 1)L = (L / 2) ^ M;\\n\\t\\t\\telse L >>= 1;\\n\\t\\t}\\n\\t\\tif (K == 2 || K == 5) {\\n\\t\\t\\tlong long int ans = 0;\\n\\t\\t\\tint num = 0;\\n\\t\\t\\tfor (int i = 1; i <= N; i++) {\\n\\t\\t\\t//\\tcout << v[i];\\n\\t\\t\\t\\tif (v[i]) {\\n\\t\\t\\t\\t\\tnum++;\\n\\t\\t\\t\\t\\tif (v[i] % K == 0) {\\n\\t\\t\\t\\t\\t\\tans += num;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tans += num;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcout << ans << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tmap<int, int>mp;\\n\\t\\tlong long int ans = 0;\\n\\t\\tmp[0]++;\\n\\t\\tlong long int num = 0;\\n\\t\\tlong long int by = 1;\\n\\t\\tfor (int i = N; i > 0; i--) {\\n\\t\\t\\tnum += by * v[i];\\n\\t\\t\\tnum %= K;\\n\\t\\t\\tif (v[i]) {\\n\\t\\t\\t\\tans += mp[num];\\n\\t\\t\\t}\\n\\t\\t\\tmp[num]++;\\n\\t\\t\\tby *= 10;\\n\\t\\t\\tby %= K;\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 7264,\n \"score_of_the_acc\": -0.625,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":761,"cells":{"group_id":{"kind":"string","value":"aoj_1302_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nTwenty Questions\nConsider a closed world and a set of features that are defined for all the objects in the world.\nEach feature can be answered with \"yes\" or \"no\". Using those features, we can identify any\nobject from the rest of the objects in the world. In other words, each object can be represented\nas a fixed-length sequence of booleans. Any object is different from other objects by at least\none feature.\nYou would like to identify an object from others. For this purpose, you can ask a series of\nquestions to someone who knows what the object is. Every question you can ask is about one\nof the features. He/she immediately answers each question with \"yes\" or \"no\" correctly. You\ncan choose the next question after you get the answer to the previous question.\nYou kindly pay the answerer 100 yen as a tip for each question. Because you don' t have surplus\nmoney, it is necessary to minimize the number of questions in the worst case. You don’t know\nwhat is the correct answer, but fortunately know all the objects in the world. Therefore, you\ncan plan an optimal strategy before you start questioning.\nThe problem you have to solve is: given a set of boolean-encoded objects, minimize the maximum\nnumber of questions by which every object in the set is identifiable.\nInput\nThe input is a sequence of multiple datasets. Each dataset begins with a line which consists of\ntwo integers,\nm\nand\nn\n: the number of features, and the number of objects, respectively. You\ncan assume 0 <\nm\n≤ 11 and 0 <\nn\n≤ 128. It is followed by\nn\nlines, each of which corresponds\nto an object. Each line includes a binary string of length\nm\nwhich represent the value (\"yes\" or\n\"no\") of features. There are no two identical objects.\nThe end of the input is indicated by a line containing two zeros. There are at most 100 datasets.\nOutput\nFor each dataset, minimize the maximum number of questions by which every object is identifiable and output the result.\nSample Input\n8 1\n11010101\n11 4\n00111001100\n01001101011\n01010000011\n01100110001\n11 16\n01000101111\n01011000000\n01011111001\n01101101001\n01110010111\n01110100111\n10000001010\n10010001000\n10010110100\n10100010100\n10101010110\n10110100010\n11001010011\n11011001001\n11111000111\n11111011101\n11 12\n10000000000\n01000000000\n00100000000\n00010000000\n00001000000\n00000100000\n00000010000\n00000001000\n00000000100\n00000000010\n00000000001\n00000000000\n9 32\n001000000\n000100000\n000010000\n000001000\n000000100\n000000010\n000000001\n000000000\n011000000\n010100000\n010010000\n010001000\n010000100\n010000010\n010000001\n010000000\n101000000\n100100000\n100010000\n100001000\n100000100\n100000010\n100000001\n100000000\n111000000\n110100000\n110010000\n110001000\n110000100\n110000010\n110000001\n110000000\n0 0\nOutput for the Sample Input\n0\n2\n4\n11\n9"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1302_10848269","code_snippet":"#include<iostream>\n#include<fstream>\n#include<iomanip>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iomanip>\n#include<algorithm>\n#include<list>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<vector>\n#include<functional>\n#include<string>\n#define INF 1000000007\n#define ll long long\n#define rep(i,k) for(int i=g.start[k];i!=INF;i=g.next[i])\n\nusing namespace std;\nint n,m,p[130];\nint cnt[1<<11][1<<11],dp[1<<11][1<<11];\n\nvoid Init()\n{\n\tstring t;\n\tmemset(cnt,0,sizeof(cnt));\n\tmemset(dp,-1,sizeof(dp));\n\tfor(int i=0;i<n;i++){\n\t\tcin>>t;\n\t\tfor(int j=0;j<t.length();j++)\n\t\t\tp[i]=(p[i]<<1)+t[j]-'0';\n\t}\n\tfor(int i=0;i<(1<<m);i++)\n\t\tfor(int j=0;j<n;j++)\n\t\t\tcnt[i][i&p[j]]++;\n}\nint DP(int mask1,int mask2)\n{\n\tif(dp[mask1][mask2]!=-1)return dp[mask1][mask2];\n\tif(cnt[mask1][mask2]<=1)return dp[mask1][mask2]=0;\n\tdp[mask1][mask2]=INF;\n\tfor(int i=0;i<m;i++)\n\t{\n\t\tif(mask1&(1<<i))continue;\n\t\tint& ans=dp[mask1][mask2];\n\t\tint tmp=mask1^(1<<i);\n\t\tans=min(ans,max(DP(tmp,mask2),DP(tmp,mask2^(1<<i)))+1);\n\t}\n\treturn dp[mask1][mask2];\n}\nint main()\n{\n\tios::sync_with_stdio(false);\n\t\n\twhile(cin>>m>>n&&(n||m))\n\t{\n\t\tInit();\n\t\tcout<<DP(0,0)<<endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":36156,"score_of_the_acc":-0.9968,"final_rank":17},{"submission_id":"aoj_1302_10002395","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int m, n;\n cin >> m >> n;\n while(m) {\n vector<string> t(n);\n rep(i, n) cin >> t[i];\n vector<string> s(m, string(n, '0'));\n rep(i, n) rep(j, m) s[j][i] = t[i][j];\n map<pair<vector<int>, int>, int> mp;\n auto dfs = [&](auto &&dfs, vector<int> v, int bit) -> int {\n if((int)v.size() <= 1) return 0;\n if(mp.count({v, bit})) return mp[{v, bit}];\n int ans = m;\n \n for(int i = 0; i < m; i ++) {\n if(bit >> i & 1) continue;\n vector<int> nx1, nx2;\n foa(j, v) {\n if(s[i][j] == '1') nx1.pb(j);\n else nx2.pb(j);\n }\n if(nx1.empty() or nx2.empty()) continue;\n ans = min(ans, max(dfs(dfs, nx1, bit | (1 << i)), dfs(dfs, nx2, bit | (1 << i))) + 1);\n }\n \n return mp[{v, bit}] = ans;\n };\n\n vector<int> base(n);\n iota(all(base), 0);\n cout << dfs(dfs, base, 0) << endl;\n cin >> m >> n;\n }\n return 0;\n}","accuracy":1,"time_ms":600,"memory_kb":9224,"score_of_the_acc":-0.5596,"final_rank":7},{"submission_id":"aoj_1302_9729469","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0) return 0;\n vector<vector<int>> A(M,vector<int>(N));\n rep(i,0,M) {\n rep(j,0,N) {\n char C;\n cin >> C;\n A[i][j] = C - '0';\n }\n }\n vector<int> DP((int)pow(3,N),inf);\n rep(i,0,(int)pow(3,N)) {\n vector<int> V(N);\n int I = i;\n rep(j,0,N) {\n V[j] = I % 3;\n I /= 3;\n }\n vector<bool> B(M,true);\n rep(j,0,N) {\n if (V[j] == 2) continue;\n rep(k,0,M) {\n if (A[k][j] != V[j]) B[k] = false;\n }\n }\n int COUNT = 0;\n rep(j,0,M) if (B[j]) COUNT++;\n if (COUNT <= 1) {\n DP[i] = 0;\n continue;\n }\n rep(j,0,N) {\n if (V[j] == 2) {\n int MAX = 0;\n rep(k,0,2) {\n V[j] = k;\n int X = 0;\n rrep(l,0,N) {\n X *= 3;\n X += V[l];\n }\n chmax(MAX,DP[X]);\n V[j] = 2;\n }\n chmin(DP[i],MAX+1);\n }\n }\n }\n cout << DP[pow(3,N)-1] << endl;\n}\n}","accuracy":1,"time_ms":1450,"memory_kb":4452,"score_of_the_acc":-1.03,"final_rank":19},{"submission_id":"aoj_1302_8992741","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint solve(int m, int n) {\n vector<string> s = in(n);\n\n map<vector<int>, int> memo;\n vector<int> used(m, 0);\n auto dfs = [&](auto self, vector<int> a) -> int {\n if(a.size() <= 1) return 0;\n if(memo.count(a)) return memo[a];\n\n int ans = 1e9;\n for(int i : rep(m)) if(not used[i]) {\n vector<int> a0, a1;\n for(int id : a) {\n (s[id][i] == '0' ? a0 : a1).push_back(id);\n }\n if(a0.size() == 0 or a1.size() == 0) continue;\n used[i] = 1;\n chmin(ans, 1 + max(self(self, a0), self(self, a1)));\n used[i] = 0;\n }\n return memo[a] = ans;\n };\n\n return dfs(dfs, iota(n));\n}\n\nint main() {\n while(true) {\n int m = in(), n = in();\n if(make_pair(m, n) == make_pair(0, 0)) return 0;\n print(solve(m, n));\n }\n}","accuracy":1,"time_ms":150,"memory_kb":5500,"score_of_the_acc":-0.1199,"final_rank":3},{"submission_id":"aoj_1302_8820636","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\n\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\n\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n pair<vector<int>, int> p = make_pair(vi, used);\n if (mp.count(p))\n return mp[p];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n vector<int> a, b;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n a.clear(); b.clear();\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n return mp[p] = res;\n}\n\nint main() {\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":780,"memory_kb":8648,"score_of_the_acc":-0.6725,"final_rank":10},{"submission_id":"aoj_1302_8808449","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\n\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\n\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n\n if (vi.size() > (1 << (m - depth)))\n return 100;\n\n if (vi.size() == 1)\n return depth;\n\n int res = 100;\n\n vector<int> a(n), b(n); // Initialize a and b with the maximum possible size\n\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n\n a.clear();\n b.clear();\n\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n\n if (a.empty() || b.empty())\n continue;\n\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n\n mp[make_pair(vi, used)] = res; // Store the result in mp\n\n return res;\n}\n\nint main() {\n int m, n;\n\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n\n vector<int> vi(n);\n\n for (int i = 0; i < n; i++)\n vi[i] = i;\n\n mp.clear();\n\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":830,"memory_kb":9064,"score_of_the_acc":-0.7214,"final_rank":11},{"submission_id":"aoj_1302_8808444","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\n\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\n\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n\n if (vi.size() > (1 << (m - depth)))\n return 100;\n\n if (vi.size() == 1)\n return depth;\n\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n\n if (a.empty() || b.empty())\n continue;\n\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n\n return mp[make_pair(vi, used)] = res;\n}\n\nint main() {\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":920,"memory_kb":8696,"score_of_the_acc":-0.7754,"final_rank":15},{"submission_id":"aoj_1302_8496704","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> Vi;\nconst int INF = 1<<29;\nint m, n, obj[130];\nmap<Vi, int> mp;\nint dfs(Vi vi){\n if(vi.size()<2) return 0;\n if(mp.count(vi)>0) return mp[vi];\n int res = INF;\n for(int i=0;i<m;i++){\n Vi v0, v1;\n for(int j=0;j<vi.size();j++){\n int num = vi[j];\n if(obj[num]&1<<i) v1.push_back(num);\n else v0.push_back(num);\n }\n if(v0.size()<1 || v1.size()<1) continue;\n res = min(res, max(dfs(v0), dfs(v1))+1);\n }\n return mp[vi] = res;\n}\nint main(){\n string s;\n while(cin >> m >> n, m){\n Vi vi;\n for(int i=0;i<n;i++){\n cin >> s;\n int ob = 0;\n for(int j=0;j<m;j++){\n if(s[j]=='1') ob |= 1<<j;\n }\n obj[i] = ob;\n vi.push_back(i);\n }\n cout << dfs(vi) << endl;\n mp.clear();\n }\n return(0);\n}","accuracy":1,"time_ms":260,"memory_kb":5392,"score_of_the_acc":-0.1964,"final_rank":4},{"submission_id":"aoj_1302_8321504","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\twhile (true) {\n\t\tint M, N;\n\t\tcin >> M >> N;\n\t\tif (M == 0 && N == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<string> S(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> S[i];\n\t\t}\n\t\tvector<int> power(M + 1);\n\t\tpower[0] = 1;\n\t\tfor (int i = 1; i <= M; i++) {\n\t\t\tpower[i] = power[i - 1] * 3;\n\t\t}\n\t\tvector<int> cnt(power[M]);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < (1 << M); j++) {\n\t\t\t\tint code = 0;\n\t\t\t\tfor (int k = 0; k < M; k++) {\n\t\t\t\t\tcode += ((j >> k) & 1 ? 2 : int(S[i][k] - '0')) * power[k];\n\t\t\t\t}\n\t\t\t\tcnt[code] += 1;\n\t\t\t}\n\t\t}\n\t\tconst int INF = 1012345678;\n\t\tvector<int> dp(power[M]);\n\t\tfor (int i = 0; i < power[M]; i++) {\n\t\t\tif (cnt[i] <= 1) {\n\t\t\t\tdp[i] = 0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdp[i] = INF;\n\t\t\t\tfor (int j = 0; j < M; j++) {\n\t\t\t\t\tint z = i / power[j] % 3;\n\t\t\t\t\tif (z == 2) {\n\t\t\t\t\t\tint resl = dp[i - 2 * power[j]];\n\t\t\t\t\t\tint resr = dp[i - 1 * power[j]];\n\t\t\t\t\t\tdp[i] = min(dp[i], max(resl, resr) + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[power[M] - 1] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":4324,"score_of_the_acc":-0.0334,"final_rank":1},{"submission_id":"aoj_1302_8302614","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\nbool is_end = false;\n\nconst int INF = 1e9;\nint dp[1<<11][1<<11];\n\nvoid init()\n{\n\tfor (int i = 0; i < (1<<11); ++i)\n\t{\n\t\tfor (int j = 0; j < (1<<11); ++j)\n\t\t{\n\t\t\tdp[i][j] = INF;\n\t\t}\n\t}\n\treturn;\n}\n\nvoid calc()\n{\n\tint M, N; cin >> M >> N;\n\t\n\tif (M == 0)\n\t{\n\t\tis_end = true;\n\t\treturn;\n\t}\n\t\n\tvector<int> quest(N);\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tstring S; cin >> S;\n\t\tbitset<11> bs(S);\n\t\tquest[i] = bs.to_ullong();\n\t}\n\t\n\tinit();\n\t\n\tfor (int bit = (1<<M)-1; bit >= 0; --bit)\n\t{\n\t\tfor (int sbit = bit; sbit >= 0; sbit = bit & (sbit-1))\n\t\t{\n\t\t\tint sum = 0;\n\t\t\tfor (int i = 0; i < N; ++i)\n\t\t\t{\n\t\t\t\tif ((quest[i] & bit) == sbit) {sum += 1;}\n\t\t\t}\n\t\t\t\n\t\t\tif (sum <= 1)\n\t\t\t{\n\t\t\t\tdp[bit][sbit] = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < M; ++i)\n\t\t\t\t{\n\t\t\t\t\tif ((bit & (1<<i))) {continue;}\n\t\t\t\t\tint nbit = 1<<i;\n\t\t\t\t\tchmin(dp[bit][sbit], 1 + max(dp[bit^nbit][sbit], dp[bit^nbit][sbit^nbit]));\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (sbit == 0) {break;}\n\t\t}\n\t}\n\t\n\tint res = dp[0][0];\n\tcout << res << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\twhile (!is_end)\n\t{\n\t\tcalc();\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":19580,"score_of_the_acc":-0.5348,"final_rank":6},{"submission_id":"aoj_1302_8215672","code_snippet":"#include <fstream>\n#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n return mp[make_pair(vi, used)] = res;\n}\nint main() {\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":920,"memory_kb":8572,"score_of_the_acc":-0.7716,"final_rank":13},{"submission_id":"aoj_1302_8215669","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n return mp[make_pair(vi, used)] = res;\n}\nint main() {\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":920,"memory_kb":8668,"score_of_the_acc":-0.7745,"final_rank":14},{"submission_id":"aoj_1302_8116035","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\nmap<pair<vector<int>, int>, int> mp;\nvector<string> qes(128);\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count({vi, used}))\n return mp[{vi, used}];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n return mp[{vi, used}] = res;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":870,"memory_kb":8664,"score_of_the_acc":-0.7382,"final_rank":12},{"submission_id":"aoj_1302_8051593","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\n\nint search(const vector<int>& vi, int depth, int used, int m) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n int a_used = used | (1 << i);\n int res_a, res_b;\n if (mp.count(make_pair(a, a_used))) {\n res_a = mp[make_pair(a, a_used)];\n } else {\n res_a = search(a, depth + 1, a_used, m);\n mp[make_pair(a, a_used)] = res_a;\n }\n int b_used = a_used;\n if (mp.count(make_pair(b, b_used))) {\n res_b = mp[make_pair(b, b_used)];\n } else {\n res_b = search(b, depth + 1, b_used, m);\n mp[make_pair(b, b_used)] = res_b;\n }\n res = min(res, max(res_a, res_b));\n }\n return mp[make_pair(vi, used)] = res;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m) << '\\n';\n }\n}","accuracy":1,"time_ms":960,"memory_kb":14144,"score_of_the_acc":-0.9705,"final_rank":16},{"submission_id":"aoj_1302_8051587","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\nmap<pair<int, int>, int> mp;\nstring qes[128];\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n auto key = make_pair(vi.size(), used);\n if (mp.count(key))\n return mp[key];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\n search(b, depth + 1, used | (1 << i), m, n)));\n }\n return mp[key] = res;\n}\nint main() {\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":4044,"score_of_the_acc":-0.0466,"final_rank":2},{"submission_id":"aoj_1302_8051585","code_snippet":"#include <iostream>\n#include <map>\n#include <string>\n#include <vector>\nusing namespace std;\nmap<pair<vector<int>, int>, int> mp;\nstring qes[128];\nint search(vector<int> &vi, int depth, int used, int m, int n) {\n if (mp.count(make_pair(vi, used)))\n return mp[make_pair(vi, used)];\n if (vi.size() > (1 << (m - depth)))\n return 100;\n if (vi.size() == 1)\n return depth;\n int res = 100;\n for (int i = 0; i < m; i++) {\n if ((used >> i) & 1)\n continue;\n vector<int> a, b;\n for (int j = 0; j < vi.size(); j++) {\n if (qes[vi[j]][i] == '0')\n a.push_back(vi[j]);\n else\n b.push_back(vi[j]);\n }\n if (a.empty() || b.empty())\n continue;\n int a_res = search(a, depth + 1, used | (1 << i), m, n);\n int b_res = search(b, depth + 1, used | (1 << i), m, n);\n res = min(res, max(a_res, b_res));\n }\n return mp[make_pair(vi, used)] = res;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n int m, n;\n while (cin >> m >> n, m) {\n for (int i = 0; i < n; i++)\n cin >> qes[i];\n vector<int> vi(n);\n for (int i = 0; i < n; i++)\n vi[i] = i;\n mp.clear();\n cout << search(vi, 0, 0, m, n) << '\\n';\n }\n}","accuracy":1,"time_ms":630,"memory_kb":9300,"score_of_the_acc":-0.5836,"final_rank":8},{"submission_id":"aoj_1302_7787815","code_snippet":"#include <stdio.h>\n\n#include <algorithm>\n#include <vector>\nusing namespace std;\nchar str[150][13];\nint dp[180000];\nint pow3[13];\nint m, n;\nint calc(int a) {\n if (~dp[a]) return dp[a];\n vector<int> c;\n int key[13];\n for (int i = 0; i < m; i++) key[i] = a % pow3[i + 1] / pow3[i];\n for (int i = 0; i < n; i++) {\n bool ok = true;\n for (int j = 0; j < m; j++) {\n if (key[j] && str[i][j] - '0' + 1 != key[j]) ok = false;\n }\n if (ok) c.push_back(i);\n }\n if (c.size() <= 1) return dp[a] = 0;\n int ret = 99999999;\n for (int i = 0; i < m; i++) {\n if (key[i]) continue;\n int L = calc(a + pow3[i]);\n int R = calc(a + pow3[i] * 2);\n ret = min(ret, max(L, R) + 1);\n }\n return dp[a] = ret;\n}\nint main() {\n int a, b;\n pow3[0] = 1;\n for (int i = 1; i < 13; i++) pow3[i] = pow3[i - 1] * 3;\n while (scanf(\"%d%d\", &a, &b), a) {\n n = b;\n m = a;\n for (int i = 0; i < b; i++) scanf(\"%s\", str[i]);\n for (int i = 0; i < pow3[a]; i++) dp[i] = -1;\n printf(\"%d\\n\", calc(0));\n }\n}","accuracy":1,"time_ms":930,"memory_kb":3468,"score_of_the_acc":-0.6232,"final_rank":9},{"submission_id":"aoj_1302_7191475","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nstruct Solver{\n int n, m;\n vector<int> a;\n map<pair<int, vector<int>>, int> mem;\n Solver(int n, int m): n(n), m(m), a(vector<int>(n)){\n for(int i = 0; i < n; i++){\n string line; cin >> line;\n for(int j = 0; j < m; j++){\n if(line[j] == '1') a[i] |= 1 << j;\n }\n }\n }\n\n int f(int used, vector<int> a){\n if(mem.count({used, a}) == 1) return mem[{used, a}];\n if(a.size() <= 1) return 0;\n if(a.size() == 2) return 1;\n int res = 1 << 30;\n for(int i = 0; i < m; i++){\n if((used >> i) & 1) continue;\n vector<int> u, v;\n for(auto &it: a){\n if((it >> i) & 1) u.emplace_back(it);\n else v.emplace_back(it);\n }\n res = min(res, max(f(used | 1 << i, u), f(used | 1 << i, v))+1);\n }\n mem[{used, a}] = res;\n return res;\n }\n\n void solve(){\n cout << f(0, a) << '\\n';\n }\n};\n\nint main(){\n while(true){\n int m, n;\n cin >> m >> n;\n if(m == 0 && n == 0) break;\n \n Solver sol(n, m);\n sol.solve();\n }\n return 0;\n}","accuracy":1,"time_ms":520,"memory_kb":6932,"score_of_the_acc":-0.4317,"final_rank":5},{"submission_id":"aoj_1302_6842375","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline T read(T&x){\n T data=0;\n int w=1;\n char ch=getchar();\n while(ch!='-'&&!isdigit(ch))\n ch=getchar();\n if(ch=='-')\n w=-1,ch=getchar();\n while(isdigit(ch))\n data=10*data+ch-'0',ch=getchar();\n return x=data*w;\n}\nconst int maxn=150;\nint m,n;\nint feature[maxn],cnt[(1<<11)+10][(1<<11)+10];\nint d[(1<<11)+10][(1<<11)+10];\n\nint dp(int s,int a){\n if(d[s][a]!=-1)return d[s][a];\n if(cnt[s][a]<=1)return d[s][a]=0;\n if(cnt[s][a]==2)return d[s][a]==1;\n int ans=20;\n for(int i=0;i<m;++i)\n if(!(s&(1<<i)))ans=min(ans, max(dp(s|(1<<i),a),dp(s|(1<<i),a|(1<<i)))+1 );\n return d[s][a]=ans;\n}\nint main(){\n while(read(m)&&read(n)){\n memset(feature,0,sizeof(feature));\n char s[20];\n for(int i=1;i<=n;++i){\n scanf(\"%s\",s);\n for(int j=0;j<m;++j)\n feature[i]|=((s[j]-'0')<<j);\n }\n memset(cnt,0,sizeof(cnt));\n for(int i=0;i<(1<<m);++i)\n for(int j=1;j<=n;++j)\n ++cnt[i][i&feature[j]];\n memset(d,-1,sizeof(d));\n printf(\"%d\\n\",!dp(0,0)?0:dp(0,0)+1);\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":36260,"score_of_the_acc":-1,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1302_10848269\",\n \"code_snippet\": \"#include<iostream>\\n#include<fstream>\\n#include<iomanip>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<iomanip>\\n#include<algorithm>\\n#include<list>\\n#include<map>\\n#include<set>\\n#include<queue>\\n#include<deque>\\n#include<vector>\\n#include<functional>\\n#include<string>\\n#define INF 1000000007\\n#define ll long long\\n#define rep(i,k) for(int i=g.start[k];i!=INF;i=g.next[i])\\n\\nusing namespace std;\\nint n,m,p[130];\\nint cnt[1<<11][1<<11],dp[1<<11][1<<11];\\n\\nvoid Init()\\n{\\n\\tstring t;\\n\\tmemset(cnt,0,sizeof(cnt));\\n\\tmemset(dp,-1,sizeof(dp));\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tcin>>t;\\n\\t\\tfor(int j=0;j<t.length();j++)\\n\\t\\t\\tp[i]=(p[i]<<1)+t[j]-'0';\\n\\t}\\n\\tfor(int i=0;i<(1<<m);i++)\\n\\t\\tfor(int j=0;j<n;j++)\\n\\t\\t\\tcnt[i][i&p[j]]++;\\n}\\nint DP(int mask1,int mask2)\\n{\\n\\tif(dp[mask1][mask2]!=-1)return dp[mask1][mask2];\\n\\tif(cnt[mask1][mask2]<=1)return dp[mask1][mask2]=0;\\n\\tdp[mask1][mask2]=INF;\\n\\tfor(int i=0;i<m;i++)\\n\\t{\\n\\t\\tif(mask1&(1<<i))continue;\\n\\t\\tint& ans=dp[mask1][mask2];\\n\\t\\tint tmp=mask1^(1<<i);\\n\\t\\tans=min(ans,max(DP(tmp,mask2),DP(tmp,mask2^(1<<i)))+1);\\n\\t}\\n\\treturn dp[mask1][mask2];\\n}\\nint main()\\n{\\n\\tios::sync_with_stdio(false);\\n\\t\\n\\twhile(cin>>m>>n&&(n||m))\\n\\t{\\n\\t\\tInit();\\n\\t\\tcout<<DP(0,0)<<endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 36156,\n \"score_of_the_acc\": -0.9968,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1302_10002395\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(v) (v).begin(),(v).end()\\n#define pb(a) push_back(a)\\n#define rep(i, n) for(int i=0;i<n;i++)\\n#define foa(e, v) for(auto&& e : v)\\nusing ll = long long;\\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int m, n;\\n cin >> m >> n;\\n while(m) {\\n vector<string> t(n);\\n rep(i, n) cin >> t[i];\\n vector<string> s(m, string(n, '0'));\\n rep(i, n) rep(j, m) s[j][i] = t[i][j];\\n map<pair<vector<int>, int>, int> mp;\\n auto dfs = [&](auto &&dfs, vector<int> v, int bit) -> int {\\n if((int)v.size() <= 1) return 0;\\n if(mp.count({v, bit})) return mp[{v, bit}];\\n int ans = m;\\n \\n for(int i = 0; i < m; i ++) {\\n if(bit >> i & 1) continue;\\n vector<int> nx1, nx2;\\n foa(j, v) {\\n if(s[i][j] == '1') nx1.pb(j);\\n else nx2.pb(j);\\n }\\n if(nx1.empty() or nx2.empty()) continue;\\n ans = min(ans, max(dfs(dfs, nx1, bit | (1 << i)), dfs(dfs, nx2, bit | (1 << i))) + 1);\\n }\\n \\n return mp[{v, bit}] = ans;\\n };\\n\\n vector<int> base(n);\\n iota(all(base), 0);\\n cout << dfs(dfs, base, 0) << endl;\\n cin >> m >> n;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 9224,\n \"score_of_the_acc\": -0.5596,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1302_9729469\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0) return 0;\\n vector<vector<int>> A(M,vector<int>(N));\\n rep(i,0,M) {\\n rep(j,0,N) {\\n char C;\\n cin >> C;\\n A[i][j] = C - '0';\\n }\\n }\\n vector<int> DP((int)pow(3,N),inf);\\n rep(i,0,(int)pow(3,N)) {\\n vector<int> V(N);\\n int I = i;\\n rep(j,0,N) {\\n V[j] = I % 3;\\n I /= 3;\\n }\\n vector<bool> B(M,true);\\n rep(j,0,N) {\\n if (V[j] == 2) continue;\\n rep(k,0,M) {\\n if (A[k][j] != V[j]) B[k] = false;\\n }\\n }\\n int COUNT = 0;\\n rep(j,0,M) if (B[j]) COUNT++;\\n if (COUNT <= 1) {\\n DP[i] = 0;\\n continue;\\n }\\n rep(j,0,N) {\\n if (V[j] == 2) {\\n int MAX = 0;\\n rep(k,0,2) {\\n V[j] = k;\\n int X = 0;\\n rrep(l,0,N) {\\n X *= 3;\\n X += V[l];\\n }\\n chmax(MAX,DP[X]);\\n V[j] = 2;\\n }\\n chmin(DP[i],MAX+1);\\n }\\n }\\n }\\n cout << DP[pow(3,N)-1] << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1450,\n \"memory_kb\": 4452,\n \"score_of_the_acc\": -1.03,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1302_8992741\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint solve(int m, int n) {\\n vector<string> s = in(n);\\n\\n map<vector<int>, int> memo;\\n vector<int> used(m, 0);\\n auto dfs = [&](auto self, vector<int> a) -> int {\\n if(a.size() <= 1) return 0;\\n if(memo.count(a)) return memo[a];\\n\\n int ans = 1e9;\\n for(int i : rep(m)) if(not used[i]) {\\n vector<int> a0, a1;\\n for(int id : a) {\\n (s[id][i] == '0' ? a0 : a1).push_back(id);\\n }\\n if(a0.size() == 0 or a1.size() == 0) continue;\\n used[i] = 1;\\n chmin(ans, 1 + max(self(self, a0), self(self, a1)));\\n used[i] = 0;\\n }\\n return memo[a] = ans;\\n };\\n\\n return dfs(dfs, iota(n));\\n}\\n\\nint main() {\\n while(true) {\\n int m = in(), n = in();\\n if(make_pair(m, n) == make_pair(0, 0)) return 0;\\n print(solve(m, n));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 5500,\n \"score_of_the_acc\": -0.1199,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1302_8820636\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\n\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n pair<vector<int>, int> p = make_pair(vi, used);\\n if (mp.count(p))\\n return mp[p];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n vector<int> a, b;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n a.clear(); b.clear();\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n return mp[p] = res;\\n}\\n\\nint main() {\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 8648,\n \"score_of_the_acc\": -0.6725,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1302_8808449\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\n\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n\\n if (vi.size() == 1)\\n return depth;\\n\\n int res = 100;\\n\\n vector<int> a(n), b(n); // Initialize a and b with the maximum possible size\\n\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n\\n a.clear();\\n b.clear();\\n\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n\\n if (a.empty() || b.empty())\\n continue;\\n\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n\\n mp[make_pair(vi, used)] = res; // Store the result in mp\\n\\n return res;\\n}\\n\\nint main() {\\n int m, n;\\n\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n\\n vector<int> vi(n);\\n\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n\\n mp.clear();\\n\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 830,\n \"memory_kb\": 9064,\n \"score_of_the_acc\": -0.7214,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1302_8808444\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\n\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n\\n if (vi.size() == 1)\\n return depth;\\n\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n\\n if (a.empty() || b.empty())\\n continue;\\n\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n\\n return mp[make_pair(vi, used)] = res;\\n}\\n\\nint main() {\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 8696,\n \"score_of_the_acc\": -0.7754,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1302_8496704\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef vector<int> Vi;\\nconst int INF = 1<<29;\\nint m, n, obj[130];\\nmap<Vi, int> mp;\\nint dfs(Vi vi){\\n if(vi.size()<2) return 0;\\n if(mp.count(vi)>0) return mp[vi];\\n int res = INF;\\n for(int i=0;i<m;i++){\\n Vi v0, v1;\\n for(int j=0;j<vi.size();j++){\\n int num = vi[j];\\n if(obj[num]&1<<i) v1.push_back(num);\\n else v0.push_back(num);\\n }\\n if(v0.size()<1 || v1.size()<1) continue;\\n res = min(res, max(dfs(v0), dfs(v1))+1);\\n }\\n return mp[vi] = res;\\n}\\nint main(){\\n string s;\\n while(cin >> m >> n, m){\\n Vi vi;\\n for(int i=0;i<n;i++){\\n cin >> s;\\n int ob = 0;\\n for(int j=0;j<m;j++){\\n if(s[j]=='1') ob |= 1<<j;\\n }\\n obj[i] = ob;\\n vi.push_back(i);\\n }\\n cout << dfs(vi) << endl;\\n mp.clear();\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 5392,\n \"score_of_the_acc\": -0.1964,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1302_8321504\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint M, N;\\n\\t\\tcin >> M >> N;\\n\\t\\tif (M == 0 && N == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<string> S(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> S[i];\\n\\t\\t}\\n\\t\\tvector<int> power(M + 1);\\n\\t\\tpower[0] = 1;\\n\\t\\tfor (int i = 1; i <= M; i++) {\\n\\t\\t\\tpower[i] = power[i - 1] * 3;\\n\\t\\t}\\n\\t\\tvector<int> cnt(power[M]);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < (1 << M); j++) {\\n\\t\\t\\t\\tint code = 0;\\n\\t\\t\\t\\tfor (int k = 0; k < M; k++) {\\n\\t\\t\\t\\t\\tcode += ((j >> k) & 1 ? 2 : int(S[i][k] - '0')) * power[k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcnt[code] += 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst int INF = 1012345678;\\n\\t\\tvector<int> dp(power[M]);\\n\\t\\tfor (int i = 0; i < power[M]; i++) {\\n\\t\\t\\tif (cnt[i] <= 1) {\\n\\t\\t\\t\\tdp[i] = 0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tdp[i] = INF;\\n\\t\\t\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\t\\t\\tint z = i / power[j] % 3;\\n\\t\\t\\t\\t\\tif (z == 2) {\\n\\t\\t\\t\\t\\t\\tint resl = dp[i - 2 * power[j]];\\n\\t\\t\\t\\t\\t\\tint resr = dp[i - 1 * power[j]];\\n\\t\\t\\t\\t\\t\\tdp[i] = min(dp[i], max(resl, resr) + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << dp[power[M] - 1] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4324,\n \"score_of_the_acc\": -0.0334,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1302_8302614\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\nbool is_end = false;\\n\\nconst int INF = 1e9;\\nint dp[1<<11][1<<11];\\n\\nvoid init()\\n{\\n\\tfor (int i = 0; i < (1<<11); ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < (1<<11); ++j)\\n\\t\\t{\\n\\t\\t\\tdp[i][j] = INF;\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint M, N; cin >> M >> N;\\n\\t\\n\\tif (M == 0)\\n\\t{\\n\\t\\tis_end = true;\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tvector<int> quest(N);\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tstring S; cin >> S;\\n\\t\\tbitset<11> bs(S);\\n\\t\\tquest[i] = bs.to_ullong();\\n\\t}\\n\\t\\n\\tinit();\\n\\t\\n\\tfor (int bit = (1<<M)-1; bit >= 0; --bit)\\n\\t{\\n\\t\\tfor (int sbit = bit; sbit >= 0; sbit = bit & (sbit-1))\\n\\t\\t{\\n\\t\\t\\tint sum = 0;\\n\\t\\t\\tfor (int i = 0; i < N; ++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif ((quest[i] & bit) == sbit) {sum += 1;}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (sum <= 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[bit][sbit] = 0;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif ((bit & (1<<i))) {continue;}\\n\\t\\t\\t\\t\\tint nbit = 1<<i;\\n\\t\\t\\t\\t\\tchmin(dp[bit][sbit], 1 + max(dp[bit^nbit][sbit], dp[bit^nbit][sbit^nbit]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (sbit == 0) {break;}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint res = dp[0][0];\\n\\tcout << res << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\twhile (!is_end)\\n\\t{\\n\\t\\tcalc();\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 19580,\n \"score_of_the_acc\": -0.5348,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1302_8215672\",\n \"code_snippet\": \"#include <fstream>\\n#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n return mp[make_pair(vi, used)] = res;\\n}\\nint main() {\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 8572,\n \"score_of_the_acc\": -0.7716,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1302_8215669\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n return mp[make_pair(vi, used)] = res;\\n}\\nint main() {\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 8668,\n \"score_of_the_acc\": -0.7745,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1302_8116035\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nmap<pair<vector<int>, int>, int> mp;\\nvector<string> qes(128);\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count({vi, used}))\\n return mp[{vi, used}];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n return mp[{vi, used}] = res;\\n}\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 8664,\n \"score_of_the_acc\": -0.7382,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1302_8051593\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\n\\nint search(const vector<int>& vi, int depth, int used, int m) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n int a_used = used | (1 << i);\\n int res_a, res_b;\\n if (mp.count(make_pair(a, a_used))) {\\n res_a = mp[make_pair(a, a_used)];\\n } else {\\n res_a = search(a, depth + 1, a_used, m);\\n mp[make_pair(a, a_used)] = res_a;\\n }\\n int b_used = a_used;\\n if (mp.count(make_pair(b, b_used))) {\\n res_b = mp[make_pair(b, b_used)];\\n } else {\\n res_b = search(b, depth + 1, b_used, m);\\n mp[make_pair(b, b_used)] = res_b;\\n }\\n res = min(res, max(res_a, res_b));\\n }\\n return mp[make_pair(vi, used)] = res;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 14144,\n \"score_of_the_acc\": -0.9705,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1302_8051587\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nmap<pair<int, int>, int> mp;\\nstring qes[128];\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n auto key = make_pair(vi.size(), used);\\n if (mp.count(key))\\n return mp[key];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n res = min(res, max(search(a, depth + 1, used | (1 << i), m, n),\\n search(b, depth + 1, used | (1 << i), m, n)));\\n }\\n return mp[key] = res;\\n}\\nint main() {\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4044,\n \"score_of_the_acc\": -0.0466,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1302_8051585\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nmap<pair<vector<int>, int>, int> mp;\\nstring qes[128];\\nint search(vector<int> &vi, int depth, int used, int m, int n) {\\n if (mp.count(make_pair(vi, used)))\\n return mp[make_pair(vi, used)];\\n if (vi.size() > (1 << (m - depth)))\\n return 100;\\n if (vi.size() == 1)\\n return depth;\\n int res = 100;\\n for (int i = 0; i < m; i++) {\\n if ((used >> i) & 1)\\n continue;\\n vector<int> a, b;\\n for (int j = 0; j < vi.size(); j++) {\\n if (qes[vi[j]][i] == '0')\\n a.push_back(vi[j]);\\n else\\n b.push_back(vi[j]);\\n }\\n if (a.empty() || b.empty())\\n continue;\\n int a_res = search(a, depth + 1, used | (1 << i), m, n);\\n int b_res = search(b, depth + 1, used | (1 << i), m, n);\\n res = min(res, max(a_res, b_res));\\n }\\n return mp[make_pair(vi, used)] = res;\\n}\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout.tie(nullptr);\\n int m, n;\\n while (cin >> m >> n, m) {\\n for (int i = 0; i < n; i++)\\n cin >> qes[i];\\n vector<int> vi(n);\\n for (int i = 0; i < n; i++)\\n vi[i] = i;\\n mp.clear();\\n cout << search(vi, 0, 0, m, n) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 9300,\n \"score_of_the_acc\": -0.5836,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1302_7787815\",\n \"code_snippet\": \"#include <stdio.h>\\n\\n#include <algorithm>\\n#include <vector>\\nusing namespace std;\\nchar str[150][13];\\nint dp[180000];\\nint pow3[13];\\nint m, n;\\nint calc(int a) {\\n if (~dp[a]) return dp[a];\\n vector<int> c;\\n int key[13];\\n for (int i = 0; i < m; i++) key[i] = a % pow3[i + 1] / pow3[i];\\n for (int i = 0; i < n; i++) {\\n bool ok = true;\\n for (int j = 0; j < m; j++) {\\n if (key[j] && str[i][j] - '0' + 1 != key[j]) ok = false;\\n }\\n if (ok) c.push_back(i);\\n }\\n if (c.size() <= 1) return dp[a] = 0;\\n int ret = 99999999;\\n for (int i = 0; i < m; i++) {\\n if (key[i]) continue;\\n int L = calc(a + pow3[i]);\\n int R = calc(a + pow3[i] * 2);\\n ret = min(ret, max(L, R) + 1);\\n }\\n return dp[a] = ret;\\n}\\nint main() {\\n int a, b;\\n pow3[0] = 1;\\n for (int i = 1; i < 13; i++) pow3[i] = pow3[i - 1] * 3;\\n while (scanf(\\\"%d%d\\\", &a, &b), a) {\\n n = b;\\n m = a;\\n for (int i = 0; i < b; i++) scanf(\\\"%s\\\", str[i]);\\n for (int i = 0; i < pow3[a]; i++) dp[i] = -1;\\n printf(\\\"%d\\\\n\\\", calc(0));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.6232,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1302_7191475\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\n\\nstruct Solver{\\n int n, m;\\n vector<int> a;\\n map<pair<int, vector<int>>, int> mem;\\n Solver(int n, int m): n(n), m(m), a(vector<int>(n)){\\n for(int i = 0; i < n; i++){\\n string line; cin >> line;\\n for(int j = 0; j < m; j++){\\n if(line[j] == '1') a[i] |= 1 << j;\\n }\\n }\\n }\\n\\n int f(int used, vector<int> a){\\n if(mem.count({used, a}) == 1) return mem[{used, a}];\\n if(a.size() <= 1) return 0;\\n if(a.size() == 2) return 1;\\n int res = 1 << 30;\\n for(int i = 0; i < m; i++){\\n if((used >> i) & 1) continue;\\n vector<int> u, v;\\n for(auto &it: a){\\n if((it >> i) & 1) u.emplace_back(it);\\n else v.emplace_back(it);\\n }\\n res = min(res, max(f(used | 1 << i, u), f(used | 1 << i, v))+1);\\n }\\n mem[{used, a}] = res;\\n return res;\\n }\\n\\n void solve(){\\n cout << f(0, a) << '\\\\n';\\n }\\n};\\n\\nint main(){\\n while(true){\\n int m, n;\\n cin >> m >> n;\\n if(m == 0 && n == 0) break;\\n \\n Solver sol(n, m);\\n sol.solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 6932,\n \"score_of_the_acc\": -0.4317,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1302_6842375\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline T read(T&x){\\n T data=0;\\n int w=1;\\n char ch=getchar();\\n while(ch!='-'&&!isdigit(ch))\\n ch=getchar();\\n if(ch=='-')\\n w=-1,ch=getchar();\\n while(isdigit(ch))\\n data=10*data+ch-'0',ch=getchar();\\n return x=data*w;\\n}\\nconst int maxn=150;\\nint m,n;\\nint feature[maxn],cnt[(1<<11)+10][(1<<11)+10];\\nint d[(1<<11)+10][(1<<11)+10];\\n\\nint dp(int s,int a){\\n if(d[s][a]!=-1)return d[s][a];\\n if(cnt[s][a]<=1)return d[s][a]=0;\\n if(cnt[s][a]==2)return d[s][a]==1;\\n int ans=20;\\n for(int i=0;i<m;++i)\\n if(!(s&(1<<i)))ans=min(ans, max(dp(s|(1<<i),a),dp(s|(1<<i),a|(1<<i)))+1 );\\n return d[s][a]=ans;\\n}\\nint main(){\\n while(read(m)&&read(n)){\\n memset(feature,0,sizeof(feature));\\n char s[20];\\n for(int i=1;i<=n;++i){\\n scanf(\\\"%s\\\",s);\\n for(int j=0;j<m;++j)\\n feature[i]|=((s[j]-'0')<<j);\\n }\\n memset(cnt,0,sizeof(cnt));\\n for(int i=0;i<(1<<m);++i)\\n for(int j=1;j<=n;++j)\\n ++cnt[i][i&feature[j]];\\n memset(d,-1,sizeof(d));\\n printf(\\\"%d\\\\n\\\",!dp(0,0)?0:dp(0,0)+1);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 36260,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":762,"cells":{"group_id":{"kind":"string","value":"aoj_1311_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nTest Case Tweaking\nYou are a judge of a programming contest. You are preparing a dataset for a graph problem to seek for the cost of the minimum cost path. You've generated some random cases, but they are not interesting. You want to produce a dataset whose answer is a desired value such as the number representing this year 2010. So you will tweak (which means 'adjust') the cost of the minimum cost path to a given value by changing the costs of some edges. The number of changes should be made as few as possible.\nA non-negative integer c and a directed graph\nG\nare given. Each edge of\nG\nis associated with a cost of a non-negative integer. Given a path from one node of\nG\nto another, we can define the cost of the path as the sum of the costs of edges constituting the path. Given a pair of nodes in\nG\n, we can associate it with a non-negative cost which is the minimum of the costs of paths connecting them.\nGiven a graph and a pair of nodes in it, you are asked to adjust the costs of edges so that the minimum cost path from one node to the other will be the given target cost\nc\n. You can assume that\nc\nis smaller than the cost of the minimum cost path between the given nodes in the original graph.\nFor example, in Figure G.1, the minimum cost of the path from node 1 to node 3 in the given graph is 6. In order to adjust this minimum cost to 2, we can change the cost of the edge from node 1 to node 3 to 2. This direct edge becomes the minimum cost path after the change.\nFor another example, in Figure G.2, the minimum cost of the path from node 1 to node 12 in the given graph is 4022. In order to adjust this minimum cost to 2010, we can change the cost of the edge from node 6 to node 12 and one of the six edges in the right half of the graph. There are many possibilities of edge modification, but the minimum number of modified edges is 2.\nInput\nThe input is a sequence of datasets. Each dataset is formatted as follows.\nn m c\nf\n1\nt\n1\nc\n1\nf\n2\nt\n2\nc\n2\n.\n.\n.\nf\nm\nt\nm\nc\nm\nFigure G.1: Example 1 of graph\nFigure G.2: Example 2 of graph\nThe integers\nn\n,\nm\nand\nc\nare the number of the nodes, the number of the edges, and the target cost, respectively, each separated by a single space, where 2 ≤\nn\n≤ 100, 1 ≤\nm\n≤ 1000 and 0 ≤\nc\n≤ 100000.\nEach node in the graph is represented by an integer 1 through\nn\n.\nThe following\nm\nlines represent edges: the integers\nf\ni\n,\nt\ni\nand\nc\ni\n(1 ≤\ni\n≤\nm\n) are the originating node, the destination node and the associated cost of the\ni\n-th edge, each separated by a single space. They satisfy 1 ≤\nf\ni\n,\nt\ni\n≤\nn\nand 0 ≤\nc\ni\n≤ 10000. You can assume that\nf\ni\n≠\nt\ni\nand (\nf\ni\n,\nt\ni\n) ≠ (\nf\nj\n,\nt\nj\n) when\ni\n≠\nj\n.\nYou can assume that, for each dataset, there is at least one path from node 1 to node\nn\n, and that the cost of the minimum cost path from node 1 to node\nn\nof the given graph is greater than\nc\n.\nThe end of the input is indicated by a line containing three zeros separated by single spaces.\nOutput\nFor each dataset, output a line containing\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1311_10848586","code_snippet":"/* ***********************************************\nAuthor :kuangbin\nCreated Time :2013/11/15 16:30:39\nFile Name :G.cpp\n************************************************ */\n\n#include <stdio.h>\n#include <string.h>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <set>\n#include <map>\n#include <string>\n#include <math.h>\n#include <stdlib.h>\n#include <time.h>\nusing namespace std;\nconst int INF = 0x3f3f3f3f;\nstruct Edge\n{\n\tint to,next;\n\tint w;\n}edge[20010];\nint head[110];\nint tot;\nvoid addedge(int u,int v,int w)\n{\n\tedge[tot].to = v;\n\tedge[tot].next = head[u];\n\tedge[tot].w = w;\n\thead[u] = tot++;\n}\n\nvoid init()\n{\n\ttot = 0;\n\tmemset(head,-1,sizeof(head));\n}\nint dp[110][1010];\nint n,m;\nbool vis[110][1010];\nvoid SPFA(int s)\n{\n\tqueue<pair<int,int> >q;\n\tq.push(make_pair(s,0));\n\tfor(int i = 1;i <= n;i++)\n\t\tfor(int j = 0;j < 1010;j++)\n\t\t\tdp[i][j] = INF;\n\tmemset(vis,false,sizeof(vis));\n\tdp[s][0] = 0;\n\tvis[s][0] = true;\n\twhile(!q.empty())\n\t{\n\t\tpair<int,int> tmp = q.front();\n\t\tint u = tmp.first;\n\t\tint k = tmp.second;\n\t\t//printf(\"%d %d\\n\",u,k);\n\t\tq.pop();\n\t\tvis[u][k] = false;\n\t\tfor(int i = head[u];i != -1;i = edge[i].next)\n\t\t{\n\t\t\tint v = edge[i].to;\n\t\t\t//cout<<v<<endl;\n\t\t//\tprintf(\"%d %d\\n\",dp[v][k],dp[u][k] + edge[i].w);\n\n\t\t\tif(dp[v][k] > dp[u][k] + edge[i].w)\n\t\t\t{\n\t\t\t//\tcout<<\"*\"<<endl;\n\t\t\t\tdp[v][k] = dp[u][k] + edge[i].w;\n\t\t\t\tif(!vis[v][k])\n\t\t\t\t{\n\t\t\t\t\tq.push(make_pair(v,k));\n\t\t\t\t\tvis[v][k] = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(k < m && dp[v][k+1] > dp[u][k] )\n\t\t\t{\n\t\t\t\tdp[v][k+1] = dp[u][k] ;\n\t\t\t\tif(!vis[v][k+1])\n\t\t\t\t{\n\t\t\t\t\tq.push(make_pair(v,k+1));\n\t\t\t\t\tvis[v][k+1] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n //freopen(\"out.txt\",\"w\",stdout);\n int c;\n\twhile(scanf(\"%d%d%d\",&n,&m,&c) == 3)\n\t{\n\t\tif(n == 0 && m == 0 && c == 0)break;\n\t\tinit();\n\t\tint u,v,w;\n\t\tfor(int i = 0;i < m;i++)\n\t\t{\n\t\t\tscanf(\"%d%d%d\",&u,&v,&w);\n\t\t\taddedge(u,v,w);\n\t\t}\n\t\tSPFA(1);\n\t//\tfor(int i = 1;i <= n;i++)\n\t//\t\tfor(int j = 0;j <= m;j++)\n\t//\t\t\tprintf(\" %d %d %d\\n\",i,j,dp[i][j]);\n\t\tint ans = m ;\n\t\tfor(int i = 0;i <= m;i++)\n\t\t\tif(dp[n][i] <= c)\n\t\t\t{\n\t\t\t\tans = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcout<<ans<<endl;\n\t}\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3916,"score_of_the_acc":-0.0325,"final_rank":7},{"submission_id":"aoj_1311_10005516","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, m, C;\n cin >> n >> m >> C;\n while(n) {\n int inf = 1 << 30;\n vector dis(n, vector(m + 1, inf));\n vector<vector<pair<int, int>>> v(n);\n rep(i, m) {\n int a, b, c; cin >> a >> b >> c;\n a --; b --;\n v[a].push_back({b, c});\n }\n dis[0][0] = 0;\n multiset<tuple<int, int, int>> ms;\n ms.insert({0, 0, 0});\n while(!ms.empty()) {\n auto [d, now, k] = *ms.begin();\n ms.erase(ms.begin());\n for(auto [to, cost] : v[now]) {\n if(dis[to][k] > d + cost) {\n dis[to][k] = d + cost;\n ms.insert({dis[to][k], to, k});\n }\n if(k < m and dis[to][k + 1] > d) {\n dis[to][k + 1] = d;\n ms.insert({dis[to][k + 1], to, k + 1});\n }\n }\n }\n int ans = inf;\n rep(i, m + 1) if(dis[n - 1][i] <= C) ans = min(ans, i);\n cout << ans << endl; \n cin >> n >> m >> C;\n }\n\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":10088,"score_of_the_acc":-0.3954,"final_rank":15},{"submission_id":"aoj_1311_9729492","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\nwhile(1) {\n int N, M, K;\n cin >> N >> M >> K;\n if (N == 0) return 0;\n vector<vector<int>> G(N);\n vector<int> A(M), B(M), C(M);\n rep(i,0,M) {\n cin >> A[i] >> B[i] >> C[i];\n A[i]--, B[i]--;\n G[A[i]].push_back(i);\n }\n vector<vector<int>> DP(N,vector<int>(N+1,inf));\n priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>> PQ;\n DP[0][0] = 0;\n PQ.push({0,{0,0}});\n while(!PQ.empty()) {\n auto [D,P] = PQ.top();\n auto [V,X] = P;\n PQ.pop();\n if (D > DP[V][X]) continue;\n for (int i : G[V]) {\n int NV = B[i], Cost = C[i];\n if (chmin(DP[NV][X],DP[V][X]+Cost)) {\n PQ.push({DP[NV][X],{NV,X}});\n }\n if (X < N) {\n if (chmin(DP[NV][X+1],DP[V][X])) {\n PQ.push({DP[NV][X+1],{NV,X+1}});\n }\n }\n }\n }\n int ANS = inf;\n rep(i,0,N+1) {\n if (DP[N-1][i] <= K) chmin(ANS,i);\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":40,"memory_kb":3676,"score_of_the_acc":-0.0281,"final_rank":6},{"submission_id":"aoj_1311_9006540","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nstruct SetupIO {\n SetupIO() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(30);\n }\n} setup_io;\ntemplate <typename T = int>\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n Edge()\n : from(-1), to(-1), cost(-1), idx(-1) {}\n Edge(int from, int to, T cost = 1, int idx = -1)\n : from(from), to(to), cost(cost), idx(idx) {}\n operator int() const {\n return to;\n }\n};\ntemplate <typename T = int>\nstruct Graph {\n Graph(int N)\n : n(N), es(0), g(N) {}\n int size() const {\n return n;\n }\n int edge_size() const {\n return es;\n }\n void add_edge(int from, int to, T cost = 1) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n void add_directed_edge(int from, int to, T cost = 1) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n g[from].emplace_back(from, to, cost, es++);\n }\n inline vector<Edge<T>>& operator[](const int& k) {\n assert(0 <= k and k < n);\n return g[k];\n }\n inline const vector<Edge<T>>& operator[](const int& k) const {\n assert(0 <= k and k < n);\n return g[k];\n }\n\n private:\n int n, es;\n vector<vector<Edge<T>>> g;\n};\ntemplate <typename T = int>\nusing Edges = vector<Edge<T>>;\ntemplate <typename T>\nvector<pair<T, int>> dijkstra(const Graph<T>& g, const int s = 0) {\n int n = g.size();\n assert(0 <= s and s < n);\n vector<pair<T, int>> d(n, {numeric_limits<T>::max(), -1});\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\n d[s] = {0, -1};\n pq.push({0, s});\n while(!pq.empty()) {\n pair<T, int> p = pq.top();\n pq.pop();\n T dist = p.first;\n int cur = p.second;\n if(d[cur].first < dist) continue;\n for(const Edge<T>& edge : g[cur]) {\n if(d[edge.to].first > d[cur].first + edge.cost) {\n d[edge.to] = {d[cur].first + edge.cost, cur};\n pq.push({d[edge.to].first, edge.to});\n }\n }\n }\n return d;\n}\nint main(void) {\n while(true) {\n int n, m, c;\n cin >> n >> m >> c;\n if(n == 0 and m == 0 and c == 0) break;\n Graph<int> g(n * (m + 1));\n rep(i, 0, m) {\n int f, t, w;\n cin >> f >> t >> w;\n f--;\n t--;\n rep(j, 0, m) {\n g.add_directed_edge(f * (m + 1) + j, t * (m + 1) + j + 1, 0);\n }\n rep(j, 0, m + 1) {\n g.add_directed_edge(f * (m + 1) + j, t * (m + 1) + j, w);\n }\n }\n vector<pair<int, int>> d = dijkstra(g);\n int ans = m;\n rep(i, 0, m + 1) {\n if(d[(n - 1) * (m + 1) + i].first <= c) {\n ans = i;\n break;\n }\n }\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":790,"memory_kb":56420,"score_of_the_acc":-1.9802,"final_rank":20},{"submission_id":"aoj_1311_8998572","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 1 \"cp-library/src/graph/shortest_path.hpp\"\n// g <- pair < v , cost > \ntemplate < class T >\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {\n T INF = numeric_limits< T >::max();\n vector<T> dist(graph.size(), INF);\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\n q.push({dist[s] = T(0), s});\n while(!q.empty()){\n auto [uc, ui] = q.top(); q.pop();\n if(uc != dist[ui]) continue;\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \n q.push({dist[vi] = uc + vc, vi});\n }\n return dist;\n}\n\n// g <- pair < v , cost > \ntemplate < class T >\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, vector<int> &starts) {\n T INF = numeric_limits< T >::max();\n vector<T> dist(graph.size(), INF);\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\n for(int s : starts) q.push({dist[s] = T(0), s});\n while(!q.empty()){\n auto [uc, ui] = q.top(); q.pop();\n if(uc != dist[ui]) continue;\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \n q.push({dist[vi] = uc + vc, vi});\n }\n return dist;\n}\n\n// g <- pair < v , cost > \ntemplate < class T >\npair< T, vector<int> > shortest_path(vector<vector<pair<int, T>>> &graph, int s, int t) {\n T INF = numeric_limits< T >::max();\n vector<T> dist(graph.size(), INF);\n vector<int> prev(graph.size(), -1);\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\n q.push({dist[s] = T(0), s});\n while(!q.empty()){\n auto [uc, ui] = q.top(); q.pop();\n if(uc != dist[ui]) continue;\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \n q.push({dist[vi] = uc + vc, vi}), prev[vi] = ui;\n }\n\n vector<int> path;\n if(dist[t] != INF) {\n for(int v = t; v != -1; v = prev[v]) path.push_back(v);\n reverse(path.begin(), path.end());\n }\n return {dist[t], path};\n}\n#line 4 \"A.cpp\"\n\nint solve(int n, int m, int target_cost) {\n vector<vector<pair<int,int>>> g(n * (m + 1));\n auto h = [&](int v, int e) { return v * (m + 1) + e; };\n for(int _ : rep(m)) {\n int f = in(), t = in(), c = in(); f--, t--;\n for(int e = 0; e <= m; e++) {\n g[h(f, e)].push_back({h(t, e), c});\n if(e + 1 <= m)\n g[h(f, e)].push_back({h(t, e + 1), 0});\n }\n }\n\n vector<int> dist = dijkstra(g, h(0, 0));\n for(int e = 0; e <= m; e++) {\n if(dist[h(n - 1, e)] <= target_cost) {\n return e;\n }\n }\n\n assert(0);\n}\n\nint main() {\n while(true) {\n int n = in(), m = in(), c = in();\n if(make_tuple(n, m, c) == make_tuple(0, 0, 0)) return 0;\n print(solve(n, m, c));\n }\n}","accuracy":1,"time_ms":600,"memory_kb":33568,"score_of_the_acc":-1.312,"final_rank":17},{"submission_id":"aoj_1311_8505587","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n while (1) {\n int n, m, c;\n cin >> n >> m >> c;\n if (!n)\n break;\n vector<vector<pii>> g(n);\n rep(i, m) {\n int u, v, w;\n cin >> u >> v >> w;\n u--, v--;\n g[u].eb(v, w);\n }\n vector<vector<int>> d(n, vector<int>(n, 1e9));\n minheap<pair<int, pii>> que;\n d[0][0] = 0, que.emplace(0, pair(0, 0));\n while (sz(que)) {\n auto [nd, ij] = que.top();\n que.pop();\n auto [ni, nj] = ij;\n if (nd != d[ni][nj])\n continue;\n for (auto [e, cost] : g[ni]) {\n if (chmin(d[e][nj], nd + cost))\n que.emplace(nd + cost, pair(e, nj));\n if (nj + 1 < n && chmin(d[e][nj + 1], nd))\n que.emplace(nd, pair(e, nj + 1));\n }\n }\n rep(j, n) {\n if (d[n - 1][j] <= c) {\n cout << j << '\\n';\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3440,"score_of_the_acc":-0.0106,"final_rank":2},{"submission_id":"aoj_1311_8162785","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\ntemplate<class T>\nbool chmin(T &a, const T b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T b) {if (a < b) {a = b; return 1;} return 0;}\n\nbool is_end = false;\n\nstruct edge\n{\n\tll to, cost;\n\t\n\tedge() = default;\n\tedge(ll t, ll c) : to(t), cost(c) { }\n};\n\nvoid calc()\n{\n\tll N, M, C; cin >> N >> M >> C;\n\t\n\tif (N == 0)\n\t{\n\t\tis_end = true;\n\t\treturn;\n\t}\n\t\n\tvector<vector<edge>> G(N);\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tll f, t, c; cin >> f >> t >> c;\n\t\tf--, t--;\n\t\tG[f].emplace_back(edge(t, c));\n\t}\n\t\n\tconst ll INF = 1e18;\n\tvector<vector<ll>> dist(N, vector<ll>(M+1, INF));\n\tdist[0][0] = 0;\n\tpriority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> pq;\n\tpq.push({dist[0][0], 0, 0});\n\t\n\twhile (!pq.empty())\n\t{\n\t\tauto [d, v, m] = pq.top();\n\t\tpq.pop();\n\t\t\n\t\tif (dist[v][m] < d) {continue;}\n\t\t\t\t\n\t\tfor (auto e : G[v])\n\t\t{\n\t\t\tll nv = e.to, cst = e.cost;\n\t\t\tif (chmin(dist[nv][m], dist[v][m] + cst))\n\t\t\t{\n\t\t\t\tpq.push({dist[nv][m], nv, m});\n\t\t\t}\n\t\t\tif (m == M) {continue;}\n\t\t\tif (chmin(dist[nv][m+1], dist[v][m] + 0))\n\t\t\t{\n\t\t\t\tpq.push({dist[nv][m+1], nv, m+1});\n\t\t\t}\n\t\t}\n\t\t\n\t}\n\t\n\t// for (int v = 0; v < N; ++v)\n\t// {\n\t// \tcout << endl;\n\t// \tfor (int i = 0; i <= M; ++i)\n\t// \t{\n\t// \t\tif (dist[v][i] < INF)\n\t// \t\t{\n\t// \t\t\tcout << v << \" \" << i << \" \" << dist[v][i] << endl;\n\t// \t\t}\n\t// \t}\n\t// }\n\t\n\tll res = M;\n\tfor (ll i = 0; i <= M; ++i)\n\t{\n\t\tif (dist[N-1][i] <= C) {chmin(res, i);}\n\t}\n\tcout << res << endl;\n\t\n\t\n\treturn;\n}\n\nint main()\n{\n\twhile (!is_end)\n\t{\n\t\tcalc();\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":9320,"score_of_the_acc":-0.3551,"final_rank":14},{"submission_id":"aoj_1311_6783569","code_snippet":"#line 1 \"c.cpp\"\n/**\n *\tauthor: nok0\n *\tcreated: 2022.07.05 15:55:33\n**/\n#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define repname(a, b, c, d, e, ...) e\n#define rep(...) repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define rep0(x) for(int i = 0; i < (x); ++i)\n#define rep1(i, x) for(int i = 0; i < (x); ++i)\n#define rep2(i, l, r) for(int i = (l); i < (r); ++i)\n#define rep3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define repsname(a, b, c, ...) c\n#define reps(...) repsname(__VA_ARGS__, reps1, reps0)(__VA_ARGS__)\n#define reps0(x) for(int i = 1; i <= (x); ++i)\n#define reps1(i, x) for(int i = 1; i <= (x); ++i)\n#define rrepname(a, b, c, d, e, ...) e\n#define rrep(...) rrepname(__VA_ARGS__, rrep3, rrep2, rrep1, rrep0)(__VA_ARGS__)\n#define rrep0(x) for(int i = (x)-1; i >= 0; --i)\n#define rrep1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define rrep2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define rrep3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define rrepsname(a, b, c, ...) c\n#define rreps(...) rrepsname(__VA_ARGS__, rreps1, rreps0)(__VA_ARGS__)\n#define rreps0(x) for(int i = (x); i >= 1; --i)\n#define rreps1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &...tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector<std::pair<char, int>> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector<std::pair<char, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate <class T>\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\n\tint n = v.size();\n\tstd::vector<std::pair<T, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector<int> iota(int n) {\n\tstd::vector<int> p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate <class T>\nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate <class U>\n\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector<T> cum;\n};\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) / 2;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 10 \"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\"\n\nstruct Edge {\n\tint to;\n\tlong long cost;\n\tEdge() = default;\n\tEdge(int to_, long long cost_) : to(to_), cost(cost_) {}\n\tbool operator<(const Edge &a) const { return cost < a.cost; }\n\tbool operator>(const Edge &a) const { return cost > a.cost; }\n\tfriend std::ostream &operator<<(std::ostream &s, Edge &a) {\n\t\ts << \"to: \" << a.to << \", cost: \" << a.cost;\n\t\treturn s;\n\t}\n};\n\nclass graph {\n\tstd::vector<std::vector<Edge>> edges;\n\n\ttemplate <class F>\n\tstruct rec_lambda {\n\t\tF f;\n\t\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\n\t\ttemplate <class... Args>\n\t\tauto operator()(Args &&...args) const {\n\t\t\treturn f(*this, std::forward<Args>(args)...);\n\t\t}\n\t};\n\npublic:\n\tinline const std::vector<Edge> &operator[](int k) const { return edges[k]; }\n\tinline std::vector<Edge> &operator[](int k) { return edges[k]; }\n\n\tint size() const { return edges.size(); }\n\tvoid resize(const int n) { edges.resize(n); }\n\n\tgraph() = default;\n\tgraph(int n) : edges(n) {}\n\tgraph(int n, int e, bool weight = 0, bool directed = 0, int idx = 1) : edges(n) { input(e, weight, directed, idx); }\n\tconst long long INF = 3e18;\n\n\tvoid input(int e = -1, bool weight = 0, bool directed = false, int idx = 1) {\n\t\tif(e == -1) e = size() - 1;\n\t\twhile(e--) {\n\t\t\tint u, v;\n\t\t\tlong long cost = 1;\n\t\t\tstd::cin >> u >> v;\n\t\t\tif(weight) std::cin >> cost;\n\t\t\tu -= idx, v -= idx;\n\t\t\tedges[u].emplace_back(v, cost);\n\t\t\tif(!directed) edges[v].emplace_back(u, cost);\n\t\t}\n\t}\n\n\tvoid add_edge(int u, int v, long long cost = 1, bool directed = false, int idx = 0) {\n\t\tu -= idx, v -= idx;\n\t\tedges[u].emplace_back(v, cost);\n\t\tif(!directed) edges[v].emplace_back(u, cost);\n\t}\n\n\t// Ο(V+E)\n\tstd::vector<long long> bfs(int s) {\n\t\tstd::vector<long long> dist(size(), INF);\n\t\tstd::queue<int> que;\n\t\tdist[s] = 0;\n\t\tque.push(s);\n\t\twhile(!que.empty()) {\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(dist[e.to] != INF) continue;\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tque.push(e.to);\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(V+E)\n\t// constraint: cost of each edge is zero or one\n\tstd::vector<long long> zero_one_bfs(int s) {\n\t\tstd::vector<long long> dist(size(), INF);\n\t\tstd::deque<int> deq;\n\t\tdist[s] = 0;\n\t\tdeq.push_back(s);\n\t\twhile(!deq.empty()) {\n\t\t\tint v = deq.front();\n\t\t\tdeq.pop_front();\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tassert(0LL <= e.cost and e.cost < 2LL);\n\t\t\t\tif(e.cost and dist[e.to] > dist[v] + 1) {\n\t\t\t\t\tdist[e.to] = dist[v] + 1;\n\t\t\t\t\tdeq.push_back(e.to);\n\t\t\t\t} else if(!e.cost and dist[e.to] > dist[v]) {\n\t\t\t\t\tdist[e.to] = dist[v];\n\t\t\t\t\tdeq.push_front(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο((E+V)logV)\n\t// cannot reach: INF\n\tstd::vector<long long> dijkstra(int s) { // verified\n\t\tstd::vector<long long> dist(size(), INF);\n\t\tconst auto compare = [](const std::pair<long long, int> &a, const std::pair<long long, int> &b) { return a.first > b.first; };\n\t\tstd::priority_queue<std::pair<long long, int>, std::vector<std::pair<long long, int>>, decltype(compare)> que{compare};\n\t\tdist[s] = 0;\n\t\tque.emplace(0, s);\n\t\twhile(!que.empty()) {\n\t\t\tstd::pair<long long, int> p = que.top();\n\t\t\tque.pop();\n\t\t\tint v = p.second;\n\t\t\tif(dist[v] < p.first) continue;\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(dist[e.to] > dist[v] + e.cost) {\n\t\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\t\tque.emplace(dist[e.to], e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(VE)\n\t// cannot reach: INF\n\t// negative cycle: -INF\n\tstd::vector<long long> bellman_ford(int s) { // verified\n\t\tint n = size();\n\t\tstd::vector<long long> res(n, INF);\n\t\tres[s] = 0;\n\t\tfor(int loop = 0; loop < n - 1; loop++) {\n\t\t\tfor(int v = 0; v < n; v++) {\n\t\t\t\tif(res[v] == INF) continue;\n\t\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\t\tres[e.to] = std::min(res[e.to], res[v] + e.cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::queue<int> que;\n\t\tstd::vector<int> chk(n);\n\t\tfor(int v = 0; v < n; v++) {\n\t\t\tif(res[v] == INF) continue;\n\t\t\tfor(auto &e : edges[v]) {\n\t\t\t\tif(res[e.to] > res[v] + e.cost and !chk[e.to]) {\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t\tchk[e.to] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile(!que.empty()) {\n\t\t\tint now = que.front();\n\t\t\tque.pop();\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(!chk[e.to]) {\n\t\t\t\t\tchk[e.to] = 1;\n\t\t\t\t\tque.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(chk[i]) res[i] = -INF;\n\t\treturn res;\n\t}\n\n\t// Ο(V^3)\n\tstd::vector<std::vector<long long>> warshall_floyd() { // verified\n\t\tint n = size();\n\t\tstd::vector<std::vector<long long>> dist(n, std::vector<long long>(n, INF));\n\t\tfor(int i = 0; i < n; i++) dist[i][i] = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(auto &e : edges[i]) dist[i][e.to] = std::min(dist[i][e.to], e.cost);\n\t\tfor(int k = 0; k < n; k++)\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(dist[i][k] == INF) continue;\n\t\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\t\tif(dist[k][j] == INF) continue;\n\t\t\t\t\tdist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\n\t\t\t\t}\n\t\t\t}\n\t\treturn dist;\n\t}\n\n\t// Ο(V) (using DFS)\n\t// if a directed cycle exists, return {}\n\tstd::vector<int> topological_sort() { // verified\n\t\tstd::vector<int> res;\n\t\tint n = size();\n\t\tstd::vector<int> used(n, 0);\n\t\tbool not_DAG = false;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\trec_lambda([&](auto &&dfs, int k) -> void {\n\t\t\t\tif(not_DAG) return;\n\t\t\t\tif(used[k]) {\n\t\t\t\t\tif(used[k] == 1) not_DAG = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tused[k] = 1;\n\t\t\t\tfor(auto &e : edges[k]) dfs(e.to);\n\t\t\t\tused[k] = 2;\n\t\t\t\tres.push_back(k);\n\t\t\t})(i);\n\t\t}\n\t\tif(not_DAG) return std::vector<int>{};\n\t\tstd::reverse(res.begin(), res.end());\n\t\treturn res;\n\t}\n\n\tbool is_DAG() { return !topological_sort().empty(); } // verified\n\n\t// Ο(V)\n\t// array of the distance from each vertex to the most distant vertex\n\tstd::vector<long long> height() { // verified\n\t\tauto vec1 = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tlong long dia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec1[i]) dia = vec1[i], v1 = i;\n\t\tvec1 = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec1[i]) dia = vec1[i], v2 = i;\n\t\tauto vec2 = bfs(v2);\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(vec1[i] < vec2[i]) vec1[i] = vec2[i];\n\t\treturn vec1;\n\t}\n\n\t// O(V+E)\n\t// vector<(int)(0 or 1)>\n\t// if it is not bipartite, return {}\n\tstd::vector<int> bipartite_grouping() {\n\t\tstd::vector<int> colors(size(), -1);\n\t\tauto dfs = [&](auto self, int now, int col) -> bool {\n\t\t\tcolors[now] = col;\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(col == colors[e.to]) return false;\n\t\t\t\tif(colors[e.to] == -1 and !self(self, e.to, !col)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(colors[i] == -1 and !dfs(dfs, i, 0)) return std::vector<int>{};\n\t\treturn colors;\n\t}\n\n\tbool is_bipartite() { return !bipartite_grouping().empty(); }\n\n\t// Ο(V+E)\n\t// ((v1, v2), diameter)\n\tstd::pair<std::pair<int, int>, long long> diameter() { // verified\n\t\tauto vec = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tlong long dia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec[i]) dia = vec[i], v1 = i;\n\t\tvec = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec[i]) dia = vec[i], v2 = i;\n\t\tstd::pair<std::pair<int, int>, long long> res = {{v1, v2}, dia};\n\t\treturn res;\n\t}\n\n\t// Ο(V+E)\n\t// return {s, v1, v2, ... t}\n\tstd::vector<int> diameter_path() {\n\t\tauto vec = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tlong long dia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec[i]) dia = vec[i], v1 = i;\n\t\tauto vec2 = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\n\t\tvec = bfs(v2);\n\t\tstd::vector<int> ret;\n\t\tauto dfs = [&](auto self, int now, int p) -> void {\n\t\t\tret.emplace_back(now);\n\t\t\tif(now == v2) return;\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(vec[to] + vec2[to] == dia and to != p)\n\t\t\t\t\tself(self, to, now);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, v1, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(V+E)\n\t// return subtree_size, root = root\n\tstd::vector<int> subtree_size(const int root) {\n\t\tint n = size();\n\t\tstd::vector<int> ret(n, 1);\n\t\trec_lambda([&](auto &&dfs, int now, int p) -> void {\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(to == p) continue;\n\t\t\t\tdfs(to, now);\n\t\t\t\tret[now] += ret[to];\n\t\t\t}\n\t\t})(root, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(ElogV)\n\tlong long prim() { // verified\n\t\tlong long res = 0;\n\t\tstd::priority_queue<Edge, std::vector<Edge>, std::greater<Edge>> que;\n\t\tfor(auto &e : edges[0]) que.push(e);\n\t\tstd::vector<int> chk(size());\n\t\tchk[0] = 1;\n\t\tint cnt = 1;\n\t\twhile(cnt < size()) {\n\t\t\tauto e = que.top();\n\t\t\tque.pop();\n\t\t\tif(chk[e.to]) continue;\n\t\t\tcnt++;\n\t\t\tres += e.cost;\n\t\t\tchk[e.to] = 1;\n\t\t\tfor(auto &e2 : edges[e.to]) que.push(e2);\n\t\t}\n\t\treturn res;\n\t}\n\n\t// Ο(ElogE)\n\tlong long kruskal() { // verified\n\t\tstd::vector<std::tuple<int, int, long long>> Edges;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\n\t\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &b) {\n\t\t\treturn std::get<2>(a) < std::get<2>(b);\n\t\t});\n\t\tstd::vector<int> uf_data(size(), -1);\n\t\tauto root = [&uf_data](auto self, int x) -> int {\n\t\t\tif(uf_data[x] < 0) return x;\n\t\t\treturn uf_data[x] = self(self, uf_data[x]);\n\t\t};\n\t\tauto unite = [&uf_data, &root](int u, int v) -> bool {\n\t\t\tu = root(root, u), v = root(root, v);\n\t\t\tif(u == v) return false;\n\t\t\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\n\t\t\tuf_data[u] += uf_data[v];\n\t\t\tuf_data[v] = u;\n\t\t\treturn true;\n\t\t};\n\t\tlong long ret = 0;\n\t\tfor(auto &e : Edges)\n\t\t\tif(unite(std::get<0>(e), std::get<1>(e))) ret += std::get<2>(e);\n\t\treturn ret;\n\t}\n\n\tgraph build_mst() {\n\t\tstd::vector<std::tuple<int, int, long long>> Edges;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\n\t\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &b) {\n\t\t\treturn std::get<2>(a) < std::get<2>(b);\n\t\t});\n\t\tstd::vector<int> uf_data(size(), -1);\n\t\tauto root = [&uf_data](auto self, int x) -> int {\n\t\t\tif(uf_data[x] < 0) return x;\n\t\t\treturn uf_data[x] = self(self, uf_data[x]);\n\t\t};\n\t\tauto unite = [&uf_data, &root](int u, int v) -> bool {\n\t\t\tu = root(root, u), v = root(root, v);\n\t\t\tif(u == v) return false;\n\t\t\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\n\t\t\tuf_data[u] += uf_data[v];\n\t\t\tuf_data[v] = u;\n\t\t\treturn true;\n\t\t};\n\t\tgraph g(this->size());\n\t\tfor(auto &e : Edges)\n\t\t\tif(unite(std::get<0>(e), std::get<1>(e))) {\n\t\t\t\tg.add_edge(std::get<0>(e), std::get<1>(e), std::get<2>(e));\n\t\t\t}\n\t\treturn g;\n\t}\n\n\t// O(V)\n\tstd::vector<int> centroid() {\n\t\tint n = size();\n\t\tstd::vector<int> centroid, sz(n);\n\t\tauto dfs = [&](auto self, int now, int per) -> void {\n\t\t\tsz[now] = 1;\n\t\t\tbool is_centroid = true;\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(e.to != per) {\n\t\t\t\t\tself(self, e.to, now);\n\t\t\t\t\tsz[now] += sz[e.to];\n\t\t\t\t\tif(sz[e.to] > n / 2) is_centroid = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n - sz[now] > n / 2) is_centroid = false;\n\t\t\tif(is_centroid) centroid.push_back(now);\n\t\t};\n\t\tdfs(dfs, 0, -1);\n\t\treturn centroid;\n\t}\n\n\t// Ο(V+E)\n\t// directed graph from root to leaf\n\tgraph root_to_leaf(int root = 0) {\n\t\tgraph res(size());\n\t\tstd::vector<int> chk(size(), 0);\n\t\tchk[root] = 1;\n\t\tauto dfs = [&](auto self, int now) -> void {\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(chk[e.to] == 1) continue;\n\t\t\t\tchk[e.to] = 1;\n\t\t\t\tres.add_edge(now, e.to, e.cost, 1, 0);\n\t\t\t\tself(self, e.to);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, root);\n\t\treturn res;\n\t}\n\n\t// Ο(V+E)\n\t// directed graph from leaf to root\n\tgraph leaf_to_root(int root = 0) {\n\t\tgraph res(size());\n\t\tstd::vector<int> chk(size(), 0);\n\t\tchk[root] = 1;\n\t\tauto dfs = [&](auto self, int now) -> void {\n\t\t\tfor(auto &e : edges[now]) {\n\t\t\t\tif(chk[e.to] == 1) continue;\n\t\t\t\tchk[e.to] = 1;\n\t\t\t\tres.add_edge(e.to, now, e.cost, 1, 0);\n\t\t\t\tself(self, e.to);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, root);\n\t\treturn res;\n\t}\n\n\t// long long Chu_Liu_Edmonds(int root = 0) {}\n};\n#line 7 \"c.cpp\"\n\nvoid solve() {\n\tINT(n, m, c);\n\tif(!n) exit(0);\n\tgraph g(n, m, 1, 1);\n\tgraph h(n * (m + 1));\n\trep(i, n) {\n\t\trep(j, m + 1) {\n\t\t\tfor(auto [to, cost] : g[i]) {\n\t\t\t\t//skip する場合\n\t\t\t\tif(j + 1 <= m) h.add_edge(i * (m + 1) + j, to * (m + 1) + j + 1, 0, 1);\n\t\t\t\th.add_edge(i * (m + 1) + j, to * (m + 1) + j, cost, 1);\n\t\t\t}\n\t\t}\n\t}\n\tauto d = h.dijkstra(0);\n\trep(i, m + 1) {\n\t\tif(d[(n - 1) * (m + 1) + i] <= c) {\n\t\t\tprint(i);\n\t\t\treturn;\n\t\t}\n\t}\n}\n\nvoid main_() {\n\twhile(1) solve();\n}","accuracy":1,"time_ms":590,"memory_kb":57500,"score_of_the_acc":-1.7368,"final_rank":19},{"submission_id":"aoj_1311_6501233","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=1167167167167167167;\nconst int INF=1050000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\nint N,M,C;\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\twhile(cin>>N>>M>>C,N) solve();\n}\n\nvoid solve(){\n\tvector<vector<pair<int,int>>> G(N*(M+1));\n\trep(i,M){\n\t\tint f,t,w;\n\t\tcin>>f>>t>>w;\n\t\tf--,t--;\n\t\trep(j,M){\n\t\t\tG[f+j*N].push_back({t+j*N,w});\n\t\t\tG[f+j*N].push_back({t+j*N+N,0});\n\t\t}\n\t}\n\tvector<int> dp(N*(M+1),INF);\n\t_pq<pair<int,int>> pq;\n\tdp[0]=0;\n\tpq.push({0,0});\n\twhile(!pq.empty()){\n\t\tint ind,time;\n\t\ttie(time,ind)=pq.top();\n\t\tpq.pop();\n\t\tif(dp[ind]>time) continue;\n\t\tfor(auto x:G[ind]){\n\t\t\tif(chmin(dp[x.first],time+x.second)){\n\t\t\t\tpq.push({dp[x.first],x.first});\n\t\t\t}\n\t\t}\n\t}\n\trep(i,M){\n\t\tif(dp[i*N+N-1]>C&&C>=dp[N*(i+2)-1]){\n\t\t\tcout<<i+1<<\"\\n\";\n\t\t\treturn;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":600,"memory_kb":31504,"score_of_the_acc":-1.2742,"final_rank":16},{"submission_id":"aoj_1311_6023641","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1 << 30;\n\nbool solve() {\n int n, m, c;\n cin >> n >> m >> c;\n if (n == 0 and m == 0 and c == 0) return false;\n vector<vector<pair<int, int>>> G(n);\n for (; m--;) {\n int f, t, x;\n cin >> f >> t >> x;\n G[--f].emplace_back(--t, x);\n }\n\n vector<vector<int>> dp(n, vector<int>(n, INF));\n priority_queue<tuple<int, int, int>> pq;\n dp[0][0] = 0;\n pq.emplace(-dp[0][0], 0, 0);\n\n while (!pq.empty()) {\n auto t = pq.top();\n pq.pop();\n int val, v, x;\n tie(val, v, x) = t;\n val *= -1;\n if (dp[v][x] < val) continue;\n for (auto& e : G[v]) {\n int u = e.first;\n if (val + e.second < dp[u][x]) {\n dp[u][x] = val + e.second;\n pq.emplace(-dp[u][x], u, x);\n }\n if (x + 1 < n and val < dp[u][x + 1]) {\n dp[u][x + 1] = val;\n pq.emplace(-dp[u][x + 1], u, x + 1);\n }\n }\n }\n\n int ans = n;\n for (int j = n - 1; j >= 0; j--) {\n if (dp[n - 1][j] <= c) {\n ans = j;\n }\n }\n\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (solve())\n ;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3436,"score_of_the_acc":-0.05,"final_rank":9},{"submission_id":"aoj_1311_6023637","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\n for (size_t i = 0; i < N; i++) {\n os << v[i] << (i + 1 == N ? \"\" : \" \");\n }\n return os;\n}\n\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\nlong long MSK(int n) { return (1LL << n) - 1; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <typename T> void mkuni(vector<T>& v) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n}\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\n#pragma endregion\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nbool solve() {\n int n, m, c;\n cin >> n >> m >> c;\n if (n == 0 and m == 0 and c == 0) return false;\n vector<vector<pair<int, int>>> G(n);\n for (; m--;) {\n int f, t, x;\n cin >> f >> t >> x;\n G[--f].emplace_back(--t, x);\n }\n\n vector<vector<int>> dp(n, vector<int>(n, INF));\n priority_queue<tuple<int, int, int>> pq;\n dp[0][0] = 0;\n pq.emplace(-dp[0][0], 0, 0);\n\n while (!pq.empty()) {\n auto t = pq.top();\n pq.pop();\n int val, v, x;\n tie(val, v, x) = t;\n val *= -1;\n if (dp[v][x] < val) continue;\n for (auto& e : G[v]) {\n int u = e.first;\n if (val + e.second < dp[u][x]) {\n dp[u][x] = val + e.second;\n pq.emplace(-dp[u][x], u, x);\n }\n if (x + 1 < n and val < dp[u][x + 1]) {\n dp[u][x + 1] = val;\n pq.emplace(-dp[u][x + 1], u, x + 1);\n }\n }\n }\n\n int ans = n;\n for (int j = n - 1; j >= 0; j--) {\n if (dp[n - 1][j] <= c) {\n ans = j;\n }\n }\n\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (solve())\n ;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3560,"score_of_the_acc":-0.0523,"final_rank":10},{"submission_id":"aoj_1311_6020851","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long int;\n//using Int=__int128;\n#define ALL(A) A.begin(),A.end()\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\n//→ ↓ ← ↑ \nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\n//右上から時計回り\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\nlong double EPS = 1e-6;\nlong double PI = acos(-1);\nconst ll INF=(1LL<<62);\nconst int MAX=(1<<30);\nconstexpr ll MOD=1000000000+7;\n//constexpr ll MOD=998244353;\n\n\ninline void bin101(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n}\n\nusing pii=pair<int,int>;\nusing pil=pair<int,ll>;\nusing pli=pair<ll,int>;\nusing pll=pair<ll,ll>;\nusing psi=pair<string,int>;\nusing pis=pair<int,string>;\nusing psl=pair<string,ll>;\nusing pls=pair<ll,string>;\nusing pss=pair<string,string>;\n\nusing Graph=vector<vector<int>>;\n\ntemplate<typename T >\nstruct edge {\n\tint to;\n\tT cost;\n\tedge()=default;\n\tedge(int to, T cost) : to(to), cost(cost) {}\n\n};\ntemplate<typename T>\nusing WeightGraph=vector<vector<edge<T>>>;\n\ntemplate<typename T>\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n T cost;\n cin>>s>>t>>cost;\n if(index1) s--,t--;\n g[s].emplace_back(t,cost);\n if(not directed) g[t].emplace_back(s,cost);\n }\n}\n\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n cin>>s>>t;\n if(index1) s--,t--;\n g[s].push_back(t);\n if(not directed) g[t].push_back(s);\n }\n}\n\n\n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<T> &v) {\n for(size_t i=0;i<v.size();i++) is>>v[i];\n\treturn is;\n}\n \n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n is>>v[i];\n }\n return is;\n}\n//vector cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\n for(size_t i=0;i<v.size();i++){\n if(i) os<<\" \";\n os<<v[i];\n }\n return os;\n}\n//vector<vector> cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n os<<v[i];\n if(i+1!=v.size()) os<<\"\\n\";\n }\n return os;\n}\n\n//Graph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const Graph &g) {\n for(size_t i=0;i<g.size();i++){\n for(int to:g[i]){\n os<<i<<\"->\"<<to<<\" \";\n }\n os<<endl;\n }\n return os;\n}\n\n//WeightGraph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\n for(size_t i=0;i<g.size();i++){\n for(auto e:g[i]){\n os<<i<<\"->\"<<e.to<<\"(\"<<e.cost<<\") \";\n }\n os<<endl;\n }\n return os;\n}\n\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n\treturn vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n\tauto v=vmake(args...);\n\treturn vector<decltype(v)>(n,move(v));\n}\ntemplate<typename V,typename T>\nvoid fill(V &v,const T value){\n v=value;\n}\n\ntemplate<typename V,typename T>\nvoid fill(vector<V> &vec,const T value){\n for(auto &v:vec) fill(v,value);\n}\n\n//pair cout\ntemplate<typename T, typename U>\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\n\tos<<p.first<<\" \"<<p.second;\n\treturn os;\n}\n \n//pair cin\ntemplate<typename T, typename U>\ninline istream &operator>>(istream &is,pair<T,U> &p) {\n\tis>>p.first>>p.second;\n\treturn is;\n}\n \n//ソート\ntemplate<typename T>\ninline void vsort(vector<T> &v){\n sort(v.begin(),v.end());\n}\n \n//逆順ソート\ntemplate<typename T>\ninline void rvsort(vector<T> &v){\n\tsort(v.rbegin(),v.rend());\n}\n\n//1ビットの数を返す\ninline int popcount(int x){\n\treturn __builtin_popcount(x);\n}\n//1ビットの数を返す\ninline int popcount(ll x){\n\treturn __builtin_popcountll(x);\n}\ntemplate<typename T>\ninline void Compress(vector<T> &C){\n sort(C.begin(),C.end());\n C.erase(unique(C.begin(),C.end()),C.end());\n}\ntemplate<typename T>\ninline int lower_idx(const vector<T> &C,T value){\n return lower_bound(C.begin(),C.end(),value)-C.begin();\n}\ntemplate<typename T>\ninline int upper_idx(const vector<T> &C,T value){\n return upper_bound(C.begin(),C.end(),value)-C.begin();\n}\n//時計回りに90度回転\ntemplate<typename T>\ninline void rotate90(vector<vector<T>> &C){\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\n for(int h=0;h<C.size();h++){\n for(int w=0;w<C[h].size();w++){\n D[w][C.size()-1-h]=C[h][w];\n }\n }\n C=D;\n}\n//補グラフを返す\n//i→iのような辺は加えない\nGraph ComplementGraph(const Graph &g){\n size_t sz=g.size();\n bool used[sz][sz];\n fill(used[0],used[sz],false);\n for(size_t i=0;i<sz;i++){\n for(int to:g[i]){\n used[i][to]=true;\n }\n }\n Graph ret(sz);\n for(size_t i=0;i<sz;i++){\n for(size_t j=0;j<sz;j++){\n if(used[i][j]) continue;\n if(i==j) continue;\n ret[i].push_back(j);\n }\n }\n return ret;\n}\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\n//無効グラフのみに対応\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\n vector<Graph> ret;\n vector<int> now;\n for(size_t i=0;i<g.size();i++){\n if(id[i].first!=-1) continue;\n id[i].first=ret.size();\n id[i].second=0;\n now.push_back(i);\n for(size_t j=0;j<now.size();j++){\n for(int to:g[now[j]]){\n if(id[to].first==-1){\n id[to].first=ret.size();\n id[to].second=now.size();\n now.push_back(to);\n }\n }\n }\n Graph r(now.size());\n for(size_t j=0;j<now.size();j++){\n r[j]=g[now[j]];\n for(int &to:r[j]){\n to=id[to].second;\n }\n }\n ret.push_back(r);\n now.clear();\n }\n return make_pair(ret,id);\n}\n//0indexを想定\nbool OutGrid(ll h,ll w,ll H,ll W){\n return (h>=H or w>=W or h<0 or w<0);\n}\n\nvoid NO(){\n cout<<\"NO\"<<\"\\n\";\n}\nvoid YES(){\n cout<<\"YES\"<<\"\\n\";\n}\nvoid No(){\n cout<<\"No\"<<\"\\n\";\n}\nvoid Yes(){\n cout<<\"Yes\"<<\"\\n\";\n}\nnamespace overflow{\n template<typename T>\n T max(){\n return numeric_limits<T>::max();\n }\n template<typename T>\n T ADD(T a,T b){\n T res;\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\n }\n template<typename T>\n T MUL(T a,T b){\n T res;\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\n }\n};\nusing namespace overflow;\nstruct ModInt{\n using u64=uint_fast64_t;\n u64 a;\n constexpr ModInt() :a(0){}\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\n\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\n return ModInt(*this)+=rhs;\n }\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\n return ModInt(*this)-=rhs;\n }\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\n return ModInt(*this)*=rhs;\n }\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\n return ModInt(*this)/=rhs;\n }\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\n return ModInt(*this)+=ModInt(rhs);\n }\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\n return ModInt(*this)-=ModInt(rhs);\n }\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\n return ModInt(*this)*=ModInt(rhs);\n }\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\n return ModInt(*this)/=ModInt(rhs);\n }\n\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\n a+=rhs.a;\n if(a>=MOD) a-=MOD;\n return *this;\n }\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\n if(rhs.a>a) a+=MOD;\n a-=rhs.a;\n return *this;\n }\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\n a=(a*rhs.a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\n a=(a*rhs.inverse().a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\n return *this+=ModInt(rhs);\n }\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\n return *this-=ModInt(rhs);\n }\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\n return *this*=ModInt(rhs);\n }\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\n return *this/=ModInt(rhs);\n }\n\n inline constexpr ModInt operator=(const ll x)noexcept{\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\n return *this;\n }\n\n inline constexpr bool operator==(const ModInt p)const noexcept{\n return a==p.a;\n }\n\n inline constexpr bool operator!=(const ModInt p)const noexcept{\n return a!=p.a;\n }\n\n inline constexpr ModInt pow(ll N) const noexcept{\n ModInt ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline constexpr ModInt inverse() const noexcept{\n return pow(MOD-2);\n }\n\n};\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)+=b;\n}\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)-=b;\n}\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)*=b;\n}\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const ModInt &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,ModInt &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\n\nstruct Binominal{\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\n int sz;\n Binominal(int n=10) :sz(1){\n if(n<=0) n=10;\n init(n);\n }\n inline void init(int n){\n fac.resize(n+1,1);\n finv.resize(n+1,1);\n inv.resize(n+1,1);\n for(int i=sz+1;i<=n;i++){\n fac[i]=fac[i-1]*i;\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\n finv[i]=finv[i-1]*inv[i];\n }\n sz=n;\n }\n //nCk(n,k<=N) をO(1)で求める\n inline ModInt com(int n,int k){\n if(n<k) return ModInt(0);\n if(n<0 || k<0) return ModInt(0);\n if(n>sz) init(n);\n return fac[n]*finv[k]*finv[n-k];\n }\n //nCk(k<=N) をO(k) で求める \n inline ModInt rcom(ll n,int k){\n if(n<0 || k<0 || n<k) return ModInt(0);\n if(k>sz) init(k);\n ModInt ret(1);\n for(int i=0;i<k;i++){\n ret*=n-i;\n }\n ret*=finv[k];\n return ret;\n }\n\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\n //〇がn個,|がk個\n inline ModInt h(int n,int k){\n return com(n+k-1,k);\n }\n};\nvector<int> Subset(int S,bool zero=false,bool full=false){\n vector<int> ret;\n int now=(S-1)&S;\n if(full and S){\n ret.push_back(S);\n }\n do{\n ret.push_back(now);\n now=(now-1)&S;\n }while(now!=0);\n if(zero){\n ret.push_back(0);\n }\n return ret;\n}\ntemplate<typename T>\nT SUM(const vector<T> &v,int s,int t){\n chmax(s,0);\n chmin(t,int(v.size())-1);\n if(s>t) return 0;\n if(s==0) return v[t];\n else return v[t]-v[s-1];\n}\ntemplate<typename T>\nvoid buildSUM(vector<T> &v){\n for(size_t i=1;i<v.size();i++){\n v[i]+=v[i-1];\n }\n return;\n}\n \n\nvoid solve(){\nwhile(true){\n int N,M,C;\n cin>>N>>M>>C;\n if(N==0) return;\n WeightGraph<int> G(N);\n for(int i=0;i<M;i++){\n int a,b,c; cin>>a>>b>>c;\n a--; b--;\n G[a].emplace_back(b,c);\n }\n auto dp=vmake(N,N+1,MAX);\n using T=tuple<int,int,int>;\n priority_queue<T,vector<T>,greater<T>> que;\n que.emplace(0,0,0);\n dp[0][0]=0;\n while(que.size()){\n int c,now,used;\n tie(c,now,used)=que.top(); que.pop();\n if(c>dp[now][used]) continue;\n\n for(auto e:G[now]){\n \n if(used<N and chmin(dp[e.to][used+1],c)){\n que.emplace(c,e.to,used+1);\n }\n if(chmin(dp[e.to][used],c+e.cost)){\n que.emplace(c+e.cost,e.to,used);\n }\n }\n }\n for(int used=0;used<=N;used++){\n if(dp[N-1][used]<=C){\n cout<<used<<endl;\n break;\n }\n }\n}\n}\n\nint main(){\n bin101();\n int T=1;\n //cin>>T;\n while(T--) solve();\n}","accuracy":1,"time_ms":30,"memory_kb":3676,"score_of_the_acc":-0.0149,"final_rank":5},{"submission_id":"aoj_1311_5972710","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \n \n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 1000000007 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n x %= mod;\n if(x == 0) return 0;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n BIT(){}\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n void build(int n) {\n N = n;\n node.resize(N+10);\n }\n /* a: 1-indexed */\n void add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(const string &s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = 1001;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n /* \n concat \n @verify https://codeforces.com/problemset/problem/514/C\n */\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n};\nint dist[110][1010];\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int n, m, c;\n while(cin >> n >> m >> c) {\n if(n == 0 && m == 0 && c == 0) break;\n vector<vector<pair<int, int>>> g(n);\n REP(i,m) {\n int a, b, d; cin >> a >> b >> d;\n a--; b--;\n g[a].push_back({b, d});\n }\n REP(i,n) REP(j,m+1) dist[i][j] = 1e9;\n // iにいて変更回数がj回, これまでのコストがkであるとき\n priority_queue<pair<ll,pair<ll,ll>>, vector<pair<ll,pair<ll,ll>>>, greater<pair<ll,pair<ll,ll>>>> pq;\n pq.push({0, {0,0}});\n dist[0][0] = 0;\n while(pq.size()) {\n auto[d, p] = pq.top(); pq.pop();\n auto[t, v] = p;\n if(dist[v][t] < d) continue;\n for(auto[u, cost]: g[v]) {\n if(dist[u][t] > dist[v][t] + cost) {\n dist[u][t] = dist[v][t] + cost;\n pq.push({dist[u][t], {t, u}});\n }\n if(dist[u][t+1] > dist[v][t]) {\n dist[u][t+1] = dist[v][t];\n pq.push({dist[u][t+1], {t+1, u}});\n }\n }\n\n }\n int ans = 1e9;\n REP(i,m+1) if(dist[n-1][i] <= c) {\n ans = i;\n break;\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3968,"score_of_the_acc":-0.165,"final_rank":12},{"submission_id":"aoj_1311_5964333","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing T = tuple<int, int, int>;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int n, m, c;\n cin >> n >> m >> c;\n if (n == 0 && m == 0 && c == 0) break;\n vector<vector<pair<int, int>>> G(n);\n for (int i = 0; i < m; ++i) {\n int f, t, ci;\n cin >> f >> t >> ci;\n --f, --t;\n G[f].push_back({t, ci});\n }\n vector<vector<int>> dist(n, vector<int>(n, 1e9)); // minimum dist to i after removing j edges\n dist[0][0] = 0;\n priority_queue<T, vector<T>, greater<>> pq;\n pq.push({0, 0, 0});\n while (!pq.empty()) {\n auto [d, v, k] = pq.top();\n pq.pop();\n if (d > dist[v][k]) continue;\n for (auto [u, w] : G[v]) {\n if (k + 1 < n && d < dist[u][k+1]) {\n dist[u][k+1] = d;\n pq.push({d, u, k + 1});\n }\n if (d + w < dist[u][k]) {\n dist[u][k] = d + w;\n pq.push({d + w, u, k});\n }\n }\n }\n for (int j = 0; j < n; ++j) {\n if (dist[n-1][j] <= c) {\n cout << j << \"\\n\";\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3472,"score_of_the_acc":-0.0112,"final_rank":3},{"submission_id":"aoj_1311_5959190","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 5050000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nint main(){\n while(1){\n int n,m,C; cin >> n >> m >> C;\n if(!n) break;\n vector<vpl> G(n);\n rep(i,m){\n int u,v,c; cin >> u >> v >> c; u--; v--;\n G[u].emplace_back(v,c);\n }\n int ok = m, ng = 0;\n vvl d(n,vl(m+1,inf));\n while(ok-ng > 1){\n int mid = (ok+ng) / 2;\n rep(i,n) rep(j,m+1) d[i][j] = inf;\n d[0][0] = 0;\n priority_queue<tapu,vector<tapu>,greater<tapu>> pq;\n pq.emplace(0,0,0);\n while(!pq.empty()){\n int c,u,t;\n tie(c,u,t) = pq.top(); pq.pop();\n if(d[u][t] < c) continue;\n for(auto v : G[u]){\n if(chmin(d[v.first][t], c + v.second)){\n pq.emplace(d[v.first][t], v.first, t);\n }\n if(t < mid && chmin(d[v.first][t+1], c)){\n pq.emplace(d[v.first][t+1], v.first, t+1);\n }\n }\n }\n int res = *min_element(all(d[n-1]));\n if(res <= C) ok = mid;\n else ng = mid;\n }\n cout << ok << \"\\n\";\n }\n}","accuracy":1,"time_ms":240,"memory_kb":6456,"score_of_the_acc":-0.3421,"final_rank":13},{"submission_id":"aoj_1311_5434873","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define ALL(x) begin(x),end(x)\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define debug(v) cout<<#v<<\":\";for(auto x:v){cout<<x<<' ';}cout<<endl;\n#define mod 998244353\nusing ll=long long;\nconst int INF=1000000000;\nconst ll LINF=1001002003004005006ll;\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\n\nstruct IOSetup{\n IOSetup(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout<<fixed<<setprecision(12);\n }\n} iosetup;\n \ntemplate<typename T>\nostream &operator<<(ostream &os,const vector<T>&v){\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\"\":\" \");\n return os;\n}\ntemplate<typename T>\nistream &operator>>(istream &is,vector<T>&v){\n for(T &x:v)is>>x;\n return is;\n}\n\nint N,M,C;\n\n// graph template\n// ref : https://ei1333.github.io/library/graph/graph-template.cpp\ntemplate<typename T=int>\nstruct Edge{\n int from,to;\n T w;\n int idx;\n Edge()=default;\n Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){}\n operator int() const{return to;}\n};\n\ntemplate<typename T=int>\nstruct Graph{\n vector<vector<Edge<T>>> g;\n int V,E;\n Graph()=default;\n Graph(int n):g(n),V(n),E(0){}\n\n size_t size(){\n return g.size();\n }\n void resize(int k){\n g.resize(k);\n }\n inline const vector<Edge<T>> &operator[](int k)const{\n return (g.at(k));\n }\n inline vector<Edge<T>> &operator[](int k){\n return (g.at(k));\n }\n void add_directed_edge(int from,int to,T cost=1){\n g[from].emplace_back(from,to,cost,E++);\n }\n void add_edge(int from,int to,T cost=1){\n g[from].emplace_back(from,to,cost,E);\n g[to].emplace_back(to,from,cost,E++);\n }\n void read(int m,int pad=-1,bool weighted=false,bool directed=false){\n for(int i=0;i<m;i++){\n int u,v;cin>>u>>v;\n u+=pad,v+=pad;\n T w=T(1);\n if(weighted) cin>>w;\n if(directed) add_directed_edge(u,v,w);\n else add_edge(u,v,w);\n }\n }\n};\n\nvoid solve(){\n Graph<int> G(N);\n G.read(M,-1,true,true);\n\n vector<vector<int>> dp(N,vector<int>(N+1,INF));\n dp[0][0]=0;\n using P=pair<int,int>;\n\n priority_queue<pair<int,P>,vector<pair<int,P>>,greater<pair<int,P>>> que;\n que.emplace(0,P(0,0));\n\n while(!que.empty()){\n auto [d,p]=que.top();que.pop();\n\n if(dp[p.first][p.second]<d) continue;\n\n for(auto &e:G[p.first]){\n if(p.second<N)if(chmin(dp[e][p.second+1],d)) que.emplace(d,P(e,p.second+1));\n if(chmin(dp[e][p.second],d+e.w)) que.emplace(d+e.w,P(e,p.second));\n }\n }\n\n for(int k=0;k<=N;k++){\n if(dp[N-1][k]<=C){\n cout<<k<<endl;\n return ;\n }\n }\n cout<<-1<<endl;\n return ;\n}\n\nsigned main(){\n while(cin>>N>>M>>C,N and M) solve();\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3628,"score_of_the_acc":-0.0141,"final_rank":4},{"submission_id":"aoj_1311_5434869","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define ALL(x) begin(x),end(x)\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define debug(v) cout<<#v<<\":\";for(auto x:v){cout<<x<<' ';}cout<<endl;\n#define mod 998244353\nusing ll=long long;\nconst int INF=1000000000;\nconst ll LINF=1001002003004005006ll;\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\n\nstruct IOSetup{\n IOSetup(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout<<fixed<<setprecision(12);\n }\n} iosetup;\n \ntemplate<typename T>\nostream &operator<<(ostream &os,const vector<T>&v){\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\"\":\" \");\n return os;\n}\ntemplate<typename T>\nistream &operator>>(istream &is,vector<T>&v){\n for(T &x:v)is>>x;\n return is;\n}\n\nint N,M,C;\n\n// graph template\n// ref : https://ei1333.github.io/library/graph/graph-template.cpp\ntemplate<typename T=int>\nstruct Edge{\n int from,to;\n T w;\n int idx;\n Edge()=default;\n Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){}\n operator int() const{return to;}\n};\n\ntemplate<typename T=int>\nstruct Graph{\n vector<vector<Edge<T>>> g;\n int V,E;\n Graph()=default;\n Graph(int n):g(n),V(n),E(0){}\n\n size_t size(){\n return g.size();\n }\n void resize(int k){\n g.resize(k);\n }\n inline const vector<Edge<T>> &operator[](int k)const{\n return (g.at(k));\n }\n inline vector<Edge<T>> &operator[](int k){\n return (g.at(k));\n }\n void add_directed_edge(int from,int to,T cost=1){\n g[from].emplace_back(from,to,cost,E++);\n }\n void add_edge(int from,int to,T cost=1){\n g[from].emplace_back(from,to,cost,E);\n g[to].emplace_back(to,from,cost,E++);\n }\n void read(int m,int pad=-1,bool weighted=false,bool directed=false){\n for(int i=0;i<m;i++){\n int u,v;cin>>u>>v;\n u+=pad,v+=pad;\n T w=T(1);\n if(weighted) cin>>w;\n if(directed) add_directed_edge(u,v,w);\n else add_edge(u,v,w);\n }\n }\n};\n\ntemplate<typename T>\nvector<vector<T>> WarshallFloyd(vector<vector<T>> mat, T inf=1000000100){\n int n=(int)mat.size();\n for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)\n if(mat[i][k]<inf and mat[k][j]<inf) mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);\n return mat;\n}\n\nvoid solve(){\n vector<Edge<int>> E;\n vector<vector<int>> W(N,vector<int>(N,INF));\n rep(i,M){\n int u,v,c;cin>>u>>v>>c;\n u--,v--;\n E.emplace_back(u,v,c,0);\n chmin(W[u][v],c);\n }\n\n sort(ALL(E),[](Edge<int> a,Edge<int> b){return a.w<b.w;});\n reverse(ALL(E));\n\n W=WarshallFloyd(W);\n\n\n for(auto &e:E){\n chmin(W[e.from][e.to],0);\n e.idx=1;\n\n for(int i=0;i<N;i++)for(int j=0;j<N;j++)\n chmin(W[i][j],W[i][e.from]+W[e.to][j]);\n\n if(W[0][N-1]<=C) break;\n }\n \n Graph<int> G(N);\n for(auto &e:E) G.g[e.from].push_back(e);\n \n\n vector<vector<int>> dp(N,vector<int>(N+1,INF));\n dp[0][0]=0;\n using P=pair<int,int>;\n\n priority_queue<pair<int,P>,vector<pair<int,P>>,greater<pair<int,P>>> que;\n que.emplace(0,P(0,0));\n\n while(!que.empty()){\n auto [d,p]=que.top();que.pop();\n\n if(dp[p.first][p.second]<d) continue;\n\n for(auto &e:G[p.first]){\n if(p.second<N)if(chmin(dp[e][p.second+1],d)) que.emplace(d,P(e,p.second+1));\n if(chmin(dp[e][p.second],d+e.w)) que.emplace(d+e.w,P(e,p.second));\n }\n }\n\n for(int k=0;k<=N;k++){\n if(dp[N-1][k]<=C){\n cout<<k<<endl;\n return ;\n }\n }\n cout<<-1<<endl;\n return ;\n}\n\nsigned main(){\n while(cin>>N>>M>>C,N and M) solve();\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3664,"score_of_the_acc":-0.1331,"final_rank":11},{"submission_id":"aoj_1311_5312019","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\ntemplate <class Cost = int>\nstruct edge {\n int from, to;\n Cost cost;\n edge() {}\n edge(int from, int to, Cost cost) : from(from), to(to), cost(cost) {}\n\n // for debug\n friend ostream &operator<<(ostream &os, const edge &e) {\n os << e.from << \" -> \" << e.to << \" : \" << e.cost << \", \";\n return os;\n }\n};\n\ntemplate <class Cost = int>\nstruct Graph {\n int V;\n vector<vector<edge<Cost>>> G;\n Graph() {}\n Graph(int V) : V(V) { G.resize(V); }\n void add_edge(int a, int b, Cost cost = Cost(0)) {\n G[a].push_back(edge<Cost>(a, b, cost));\n }\n void add_edge_undirected(int a, int b, Cost cost = Cost(0)) {\n G[a].push_back(edge<Cost>(a, b, cost));\n G[b].push_back(edge<Cost>(b, a, cost));\n }\n size_t size() const { return G.size(); }\n const vector<edge<Cost>> &operator[](int id) const { return G[id]; }\n\n // for debug\n friend ostream &operator<<(ostream &os, const Graph g) {\n for (int i = 0; i < g.size(); i++) {\n os << g[i];\n if (i + 1 < g.size()) os << endl;\n }\n return os;\n }\n};\n\n// verified\n// https://atcoder.jp/contests/dwacon6th-final-open/submissions/10023433\ntemplate <class Cost>\nvector<Cost> dijkstra(Graph<Cost> &g, int s) {\n assert(0 <= s && s < g.size());\n vector<Cost> dist;\n dist.assign(g.size(), numeric_limits<Cost>::max());\n dist[s] = Cost(0);\n MinHeap<pair<Cost, int>> q;\n q.push(make_pair(Cost(0), s));\n while (!q.empty()) {\n auto a = q.top();\n q.pop();\n int v = a.second;\n if (dist[v] < a.first) continue;\n for (auto e : g[v]) {\n if (dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n q.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n return dist;\n}\n\nbool solve() {\n int n, m, c;\n cin >> n >> m >> c;\n if (n + m + c == 0) return false;\n Graph<int> g(n * (m + 1));\n for (int i = 0; i < m; i++) {\n int a, b, cost;\n cin >> a >> b >> cost;\n a--;\n b--;\n for (int j = 0; j < m; j++) {\n g.add_edge(j * n + a, j * n + b, cost);\n g.add_edge(j * n + a, (j + 1) * n + b, 0);\n }\n }\n auto dist = dijkstra(g, 0);\n for (int i = 0; i <= m; i++) {\n if (dist[i * n + n - 1] <= c) {\n cout << i << endl;\n return true;\n }\n }\n assert(false);\n return true;\n}\n\nint main() {\n fastio();\n // solve();\n while (solve()) {}\n // int t; cin >> t; while(t--)solve();\n\n // int t; cin >> t;\n // for(int i=1;i<=t;i++){\n // cout << \"Case #\" << i << \": \";\n // solve();\n // }\n return 0;\n}","accuracy":1,"time_ms":680,"memory_kb":43084,"score_of_the_acc":-1.5914,"final_rank":18},{"submission_id":"aoj_1311_5136684","code_snippet":"//#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n \nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n\treturn (ull)rng() % B;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m,c;\n while(cin >> n >> m >> c,n+m+c){\n vector<vector<pair<int,int>>> g(n);\n for(int i=0;i<m;i++){\n int x,y,w; cin >> x >> y >> w;\n x--; y--;\n g[x].push_back({y,w});\n }\n vector<vector<int>> d(n,vector<int>(n+1,1e9));\n d[0][0]=0;\n priority_queue<pair<int,pair<int,int>>> pq;\n pq.push(make_pair(0,make_pair(0,0)));\n while(pq.size()){\n auto p=pq.top(); pq.pop();\n if(-p.first!=d[p.second.first][p.second.second])continue;\n for(auto to:g[p.second.first]){\n int t=to.first;\n if(d[t][p.second.second]>-p.first+to.second){\n d[t][p.second.second]=-p.first+to.second;\n pq.push(make_pair(-d[t][p.second.second],make_pair(t,p.second.second)));\n }\n if(p.second.second+1>n)continue;\n if(d[t][p.second.second+1]>-p.first){\n d[t][p.second.second+1]=-p.first;\n pq.push(make_pair(p.first,make_pair(t,p.second.second+1)));\n }\n }\n }\n for(int i=0;i<=n;i++){\n if(c>=d[n-1][i]){\n cout << i << endl;\n break;\n }\n }\n } \n}","accuracy":1,"time_ms":60,"memory_kb":3272,"score_of_the_acc":-0.047,"final_rank":8},{"submission_id":"aoj_1311_4996007","code_snippet":"#include<cstdio>\n#include<vector>\n#include<queue>\n#include<map>\n#include<algorithm>\nusing namespace std;\nusing P = pair<int, int>;\nusing Q = pair<int, P>;\nconstexpr int INF = 1000000000;\n\nint n, m, c, x, y, z;\nvector<P> e[100];\nint mn[100][101];\n\nint main() {\n while (scanf(\"%d%d%d\", &n, &m, &c), n) {\n for (int i = 0; i < n; i++) {\n e[i].clear();\n for (int j = 0; j <= n; j++) mn[i][j] = INF;\n }\n for (int i = 0; i < m; i++) {\n scanf(\"%d%d%d\", &x, &y, &z);\n x--; y--;\n e[x].push_back(P(y, z));\n }\n priority_queue<Q, vector<Q>, greater<Q>> pq; // (cost, P(num, minas))\n pq.push(Q(0, P(0, 0)));\n for (int i = 0; i <= n; i++) mn[0][i] = 0;\n while (!pq.empty()) {\n Q tmp = pq.top(); pq.pop();\n int num = tmp.second.first, minas = tmp.second.second;\n if (mn[num][minas] < tmp.first) continue;\n for (P p : e[num]) {\n if (mn[p.first][minas] > mn[num][minas] + p.second) {\n mn[p.first][minas] = mn[num][minas] + p.second;\n pq.push(Q(mn[p.first][minas], P(p.first, minas)));\n }\n if (minas < n && mn[p.first][minas+1] > mn[num][minas]) {\n if (mn[num][minas] >= mn[p.first][minas]) continue;\n mn[p.first][minas+1] = mn[num][minas];\n pq.push(Q(mn[p.first][minas+1], P(p.first, minas+1)));\n }\n }\n }\n int ans = 0;\n while (mn[n-1][ans] > c) ans++;\n printf(\"%d\\n\", ans);\n }\n}","accuracy":1,"time_ms":30,"memory_kb":2860,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1311_10848586\",\n \"code_snippet\": \"/* ***********************************************\\nAuthor :kuangbin\\nCreated Time :2013/11/15 16:30:39\\nFile Name :G.cpp\\n************************************************ */\\n\\n#include <stdio.h>\\n#include <string.h>\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <string>\\n#include <math.h>\\n#include <stdlib.h>\\n#include <time.h>\\nusing namespace std;\\nconst int INF = 0x3f3f3f3f;\\nstruct Edge\\n{\\n\\tint to,next;\\n\\tint w;\\n}edge[20010];\\nint head[110];\\nint tot;\\nvoid addedge(int u,int v,int w)\\n{\\n\\tedge[tot].to = v;\\n\\tedge[tot].next = head[u];\\n\\tedge[tot].w = w;\\n\\thead[u] = tot++;\\n}\\n\\nvoid init()\\n{\\n\\ttot = 0;\\n\\tmemset(head,-1,sizeof(head));\\n}\\nint dp[110][1010];\\nint n,m;\\nbool vis[110][1010];\\nvoid SPFA(int s)\\n{\\n\\tqueue<pair<int,int> >q;\\n\\tq.push(make_pair(s,0));\\n\\tfor(int i = 1;i <= n;i++)\\n\\t\\tfor(int j = 0;j < 1010;j++)\\n\\t\\t\\tdp[i][j] = INF;\\n\\tmemset(vis,false,sizeof(vis));\\n\\tdp[s][0] = 0;\\n\\tvis[s][0] = true;\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tpair<int,int> tmp = q.front();\\n\\t\\tint u = tmp.first;\\n\\t\\tint k = tmp.second;\\n\\t\\t//printf(\\\"%d %d\\\\n\\\",u,k);\\n\\t\\tq.pop();\\n\\t\\tvis[u][k] = false;\\n\\t\\tfor(int i = head[u];i != -1;i = edge[i].next)\\n\\t\\t{\\n\\t\\t\\tint v = edge[i].to;\\n\\t\\t\\t//cout<<v<<endl;\\n\\t\\t//\\tprintf(\\\"%d %d\\\\n\\\",dp[v][k],dp[u][k] + edge[i].w);\\n\\n\\t\\t\\tif(dp[v][k] > dp[u][k] + edge[i].w)\\n\\t\\t\\t{\\n\\t\\t\\t//\\tcout<<\\\"*\\\"<<endl;\\n\\t\\t\\t\\tdp[v][k] = dp[u][k] + edge[i].w;\\n\\t\\t\\t\\tif(!vis[v][k])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.push(make_pair(v,k));\\n\\t\\t\\t\\t\\tvis[v][k] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(k < m && dp[v][k+1] > dp[u][k] )\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[v][k+1] = dp[u][k] ;\\n\\t\\t\\t\\tif(!vis[v][k+1])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.push(make_pair(v,k+1));\\n\\t\\t\\t\\t\\tvis[v][k+1] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint main()\\n{\\n //freopen(\\\"in.txt\\\",\\\"r\\\",stdin);\\n //freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n int c;\\n\\twhile(scanf(\\\"%d%d%d\\\",&n,&m,&c) == 3)\\n\\t{\\n\\t\\tif(n == 0 && m == 0 && c == 0)break;\\n\\t\\tinit();\\n\\t\\tint u,v,w;\\n\\t\\tfor(int i = 0;i < m;i++)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%d%d%d\\\",&u,&v,&w);\\n\\t\\t\\taddedge(u,v,w);\\n\\t\\t}\\n\\t\\tSPFA(1);\\n\\t//\\tfor(int i = 1;i <= n;i++)\\n\\t//\\t\\tfor(int j = 0;j <= m;j++)\\n\\t//\\t\\t\\tprintf(\\\" %d %d %d\\\\n\\\",i,j,dp[i][j]);\\n\\t\\tint ans = m ;\\n\\t\\tfor(int i = 0;i <= m;i++)\\n\\t\\t\\tif(dp[n][i] <= c)\\n\\t\\t\\t{\\n\\t\\t\\t\\tans = i;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.0325,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1311_10005516\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(v) (v).begin(),(v).end()\\n#define pb(a) push_back(a)\\n#define rep(i, n) for(int i=0;i<n;i++)\\n#define foa(e, v) for(auto&& e : v)\\nusing ll = long long;\\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int n, m, C;\\n cin >> n >> m >> C;\\n while(n) {\\n int inf = 1 << 30;\\n vector dis(n, vector(m + 1, inf));\\n vector<vector<pair<int, int>>> v(n);\\n rep(i, m) {\\n int a, b, c; cin >> a >> b >> c;\\n a --; b --;\\n v[a].push_back({b, c});\\n }\\n dis[0][0] = 0;\\n multiset<tuple<int, int, int>> ms;\\n ms.insert({0, 0, 0});\\n while(!ms.empty()) {\\n auto [d, now, k] = *ms.begin();\\n ms.erase(ms.begin());\\n for(auto [to, cost] : v[now]) {\\n if(dis[to][k] > d + cost) {\\n dis[to][k] = d + cost;\\n ms.insert({dis[to][k], to, k});\\n }\\n if(k < m and dis[to][k + 1] > d) {\\n dis[to][k + 1] = d;\\n ms.insert({dis[to][k + 1], to, k + 1});\\n }\\n }\\n }\\n int ans = inf;\\n rep(i, m + 1) if(dis[n - 1][i] <= C) ans = min(ans, i);\\n cout << ans << endl; \\n cin >> n >> m >> C;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 10088,\n \"score_of_the_acc\": -0.3954,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1311_9729492\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\nwhile(1) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n if (N == 0) return 0;\\n vector<vector<int>> G(N);\\n vector<int> A(M), B(M), C(M);\\n rep(i,0,M) {\\n cin >> A[i] >> B[i] >> C[i];\\n A[i]--, B[i]--;\\n G[A[i]].push_back(i);\\n }\\n vector<vector<int>> DP(N,vector<int>(N+1,inf));\\n priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>> PQ;\\n DP[0][0] = 0;\\n PQ.push({0,{0,0}});\\n while(!PQ.empty()) {\\n auto [D,P] = PQ.top();\\n auto [V,X] = P;\\n PQ.pop();\\n if (D > DP[V][X]) continue;\\n for (int i : G[V]) {\\n int NV = B[i], Cost = C[i];\\n if (chmin(DP[NV][X],DP[V][X]+Cost)) {\\n PQ.push({DP[NV][X],{NV,X}});\\n }\\n if (X < N) {\\n if (chmin(DP[NV][X+1],DP[V][X])) {\\n PQ.push({DP[NV][X+1],{NV,X+1}});\\n }\\n }\\n }\\n }\\n int ANS = inf;\\n rep(i,0,N+1) {\\n if (DP[N-1][i] <= K) chmin(ANS,i);\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.0281,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1311_9006540\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nstruct SetupIO {\\n SetupIO() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout << fixed << setprecision(30);\\n }\\n} setup_io;\\ntemplate <typename T = int>\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n Edge()\\n : from(-1), to(-1), cost(-1), idx(-1) {}\\n Edge(int from, int to, T cost = 1, int idx = -1)\\n : from(from), to(to), cost(cost), idx(idx) {}\\n operator int() const {\\n return to;\\n }\\n};\\ntemplate <typename T = int>\\nstruct Graph {\\n Graph(int N)\\n : n(N), es(0), g(N) {}\\n int size() const {\\n return n;\\n }\\n int edge_size() const {\\n return es;\\n }\\n void add_edge(int from, int to, T cost = 1) {\\n assert(0 <= from and from < n);\\n assert(0 <= to and to < n);\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n void add_directed_edge(int from, int to, T cost = 1) {\\n assert(0 <= from and from < n);\\n assert(0 <= to and to < n);\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n inline vector<Edge<T>>& operator[](const int& k) {\\n assert(0 <= k and k < n);\\n return g[k];\\n }\\n inline const vector<Edge<T>>& operator[](const int& k) const {\\n assert(0 <= k and k < n);\\n return g[k];\\n }\\n\\n private:\\n int n, es;\\n vector<vector<Edge<T>>> g;\\n};\\ntemplate <typename T = int>\\nusing Edges = vector<Edge<T>>;\\ntemplate <typename T>\\nvector<pair<T, int>> dijkstra(const Graph<T>& g, const int s = 0) {\\n int n = g.size();\\n assert(0 <= s and s < n);\\n vector<pair<T, int>> d(n, {numeric_limits<T>::max(), -1});\\n priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;\\n d[s] = {0, -1};\\n pq.push({0, s});\\n while(!pq.empty()) {\\n pair<T, int> p = pq.top();\\n pq.pop();\\n T dist = p.first;\\n int cur = p.second;\\n if(d[cur].first < dist) continue;\\n for(const Edge<T>& edge : g[cur]) {\\n if(d[edge.to].first > d[cur].first + edge.cost) {\\n d[edge.to] = {d[cur].first + edge.cost, cur};\\n pq.push({d[edge.to].first, edge.to});\\n }\\n }\\n }\\n return d;\\n}\\nint main(void) {\\n while(true) {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if(n == 0 and m == 0 and c == 0) break;\\n Graph<int> g(n * (m + 1));\\n rep(i, 0, m) {\\n int f, t, w;\\n cin >> f >> t >> w;\\n f--;\\n t--;\\n rep(j, 0, m) {\\n g.add_directed_edge(f * (m + 1) + j, t * (m + 1) + j + 1, 0);\\n }\\n rep(j, 0, m + 1) {\\n g.add_directed_edge(f * (m + 1) + j, t * (m + 1) + j, w);\\n }\\n }\\n vector<pair<int, int>> d = dijkstra(g);\\n int ans = m;\\n rep(i, 0, m + 1) {\\n if(d[(n - 1) * (m + 1) + i].first <= c) {\\n ans = i;\\n break;\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 56420,\n \"score_of_the_acc\": -1.9802,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1311_8998572\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 1 \\\"cp-library/src/graph/shortest_path.hpp\\\"\\n// g <- pair < v , cost > \\ntemplate < class T >\\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {\\n T INF = numeric_limits< T >::max();\\n vector<T> dist(graph.size(), INF);\\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\\n q.push({dist[s] = T(0), s});\\n while(!q.empty()){\\n auto [uc, ui] = q.top(); q.pop();\\n if(uc != dist[ui]) continue;\\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \\n q.push({dist[vi] = uc + vc, vi});\\n }\\n return dist;\\n}\\n\\n// g <- pair < v , cost > \\ntemplate < class T >\\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, vector<int> &starts) {\\n T INF = numeric_limits< T >::max();\\n vector<T> dist(graph.size(), INF);\\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\\n for(int s : starts) q.push({dist[s] = T(0), s});\\n while(!q.empty()){\\n auto [uc, ui] = q.top(); q.pop();\\n if(uc != dist[ui]) continue;\\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \\n q.push({dist[vi] = uc + vc, vi});\\n }\\n return dist;\\n}\\n\\n// g <- pair < v , cost > \\ntemplate < class T >\\npair< T, vector<int> > shortest_path(vector<vector<pair<int, T>>> &graph, int s, int t) {\\n T INF = numeric_limits< T >::max();\\n vector<T> dist(graph.size(), INF);\\n vector<int> prev(graph.size(), -1);\\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\\n q.push({dist[s] = T(0), s});\\n while(!q.empty()){\\n auto [uc, ui] = q.top(); q.pop();\\n if(uc != dist[ui]) continue;\\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \\n q.push({dist[vi] = uc + vc, vi}), prev[vi] = ui;\\n }\\n\\n vector<int> path;\\n if(dist[t] != INF) {\\n for(int v = t; v != -1; v = prev[v]) path.push_back(v);\\n reverse(path.begin(), path.end());\\n }\\n return {dist[t], path};\\n}\\n#line 4 \\\"A.cpp\\\"\\n\\nint solve(int n, int m, int target_cost) {\\n vector<vector<pair<int,int>>> g(n * (m + 1));\\n auto h = [&](int v, int e) { return v * (m + 1) + e; };\\n for(int _ : rep(m)) {\\n int f = in(), t = in(), c = in(); f--, t--;\\n for(int e = 0; e <= m; e++) {\\n g[h(f, e)].push_back({h(t, e), c});\\n if(e + 1 <= m)\\n g[h(f, e)].push_back({h(t, e + 1), 0});\\n }\\n }\\n\\n vector<int> dist = dijkstra(g, h(0, 0));\\n for(int e = 0; e <= m; e++) {\\n if(dist[h(n - 1, e)] <= target_cost) {\\n return e;\\n }\\n }\\n\\n assert(0);\\n}\\n\\nint main() {\\n while(true) {\\n int n = in(), m = in(), c = in();\\n if(make_tuple(n, m, c) == make_tuple(0, 0, 0)) return 0;\\n print(solve(n, m, c));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 33568,\n \"score_of_the_acc\": -1.312,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1311_8505587\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n while (1) {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if (!n)\\n break;\\n vector<vector<pii>> g(n);\\n rep(i, m) {\\n int u, v, w;\\n cin >> u >> v >> w;\\n u--, v--;\\n g[u].eb(v, w);\\n }\\n vector<vector<int>> d(n, vector<int>(n, 1e9));\\n minheap<pair<int, pii>> que;\\n d[0][0] = 0, que.emplace(0, pair(0, 0));\\n while (sz(que)) {\\n auto [nd, ij] = que.top();\\n que.pop();\\n auto [ni, nj] = ij;\\n if (nd != d[ni][nj])\\n continue;\\n for (auto [e, cost] : g[ni]) {\\n if (chmin(d[e][nj], nd + cost))\\n que.emplace(nd + cost, pair(e, nj));\\n if (nj + 1 < n && chmin(d[e][nj + 1], nd))\\n que.emplace(nd, pair(e, nj + 1));\\n }\\n }\\n rep(j, n) {\\n if (d[n - 1][j] <= c) {\\n cout << j << '\\\\n';\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0106,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1311_8162785\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nbool is_end = false;\\n\\nstruct edge\\n{\\n\\tll to, cost;\\n\\t\\n\\tedge() = default;\\n\\tedge(ll t, ll c) : to(t), cost(c) { }\\n};\\n\\nvoid calc()\\n{\\n\\tll N, M, C; cin >> N >> M >> C;\\n\\t\\n\\tif (N == 0)\\n\\t{\\n\\t\\tis_end = true;\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tvector<vector<edge>> G(N);\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tll f, t, c; cin >> f >> t >> c;\\n\\t\\tf--, t--;\\n\\t\\tG[f].emplace_back(edge(t, c));\\n\\t}\\n\\t\\n\\tconst ll INF = 1e18;\\n\\tvector<vector<ll>> dist(N, vector<ll>(M+1, INF));\\n\\tdist[0][0] = 0;\\n\\tpriority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> pq;\\n\\tpq.push({dist[0][0], 0, 0});\\n\\t\\n\\twhile (!pq.empty())\\n\\t{\\n\\t\\tauto [d, v, m] = pq.top();\\n\\t\\tpq.pop();\\n\\t\\t\\n\\t\\tif (dist[v][m] < d) {continue;}\\n\\t\\t\\t\\t\\n\\t\\tfor (auto e : G[v])\\n\\t\\t{\\n\\t\\t\\tll nv = e.to, cst = e.cost;\\n\\t\\t\\tif (chmin(dist[nv][m], dist[v][m] + cst))\\n\\t\\t\\t{\\n\\t\\t\\t\\tpq.push({dist[nv][m], nv, m});\\n\\t\\t\\t}\\n\\t\\t\\tif (m == M) {continue;}\\n\\t\\t\\tif (chmin(dist[nv][m+1], dist[v][m] + 0))\\n\\t\\t\\t{\\n\\t\\t\\t\\tpq.push({dist[nv][m+1], nv, m+1});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t\\n\\t// for (int v = 0; v < N; ++v)\\n\\t// {\\n\\t// \\tcout << endl;\\n\\t// \\tfor (int i = 0; i <= M; ++i)\\n\\t// \\t{\\n\\t// \\t\\tif (dist[v][i] < INF)\\n\\t// \\t\\t{\\n\\t// \\t\\t\\tcout << v << \\\" \\\" << i << \\\" \\\" << dist[v][i] << endl;\\n\\t// \\t\\t}\\n\\t// \\t}\\n\\t// }\\n\\t\\n\\tll res = M;\\n\\tfor (ll i = 0; i <= M; ++i)\\n\\t{\\n\\t\\tif (dist[N-1][i] <= C) {chmin(res, i);}\\n\\t}\\n\\tcout << res << endl;\\n\\t\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\twhile (!is_end)\\n\\t{\\n\\t\\tcalc();\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 9320,\n \"score_of_the_acc\": -0.3551,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1311_6783569\",\n \"code_snippet\": \"#line 1 \\\"c.cpp\\\"\\n/**\\n *\\tauthor: nok0\\n *\\tcreated: 2022.07.05 15:55:33\\n**/\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define repname(a, b, c, d, e, ...) e\\n#define rep(...) repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define rep0(x) for(int i = 0; i < (x); ++i)\\n#define rep1(i, x) for(int i = 0; i < (x); ++i)\\n#define rep2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define rep3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define repsname(a, b, c, ...) c\\n#define reps(...) repsname(__VA_ARGS__, reps1, reps0)(__VA_ARGS__)\\n#define reps0(x) for(int i = 1; i <= (x); ++i)\\n#define reps1(i, x) for(int i = 1; i <= (x); ++i)\\n#define rrepname(a, b, c, d, e, ...) e\\n#define rrep(...) rrepname(__VA_ARGS__, rrep3, rrep2, rrep1, rrep0)(__VA_ARGS__)\\n#define rrep0(x) for(int i = (x)-1; i >= 0; --i)\\n#define rrep1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define rrep2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define rrep3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define rrepsname(a, b, c, ...) c\\n#define rreps(...) rrepsname(__VA_ARGS__, rreps1, rreps0)(__VA_ARGS__)\\n#define rreps0(x) for(int i = (x); i >= 1; --i)\\n#define rreps1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &...tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\nstd::vector<std::pair<char, int>> rle(const string &s) {\\n\\tint n = s.size();\\n\\tstd::vector<std::pair<char, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and s[l] == s[r]; r++) {}\\n\\t\\tret.emplace_back(s[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T>\\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\\n\\tint n = v.size();\\n\\tstd::vector<std::pair<T, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and v[l] == v[r]; r++) {}\\n\\t\\tret.emplace_back(v[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\nstd::vector<int> iota(int n) {\\n\\tstd::vector<int> p(n);\\n\\tstd::iota(p.begin(), p.end(), 0);\\n\\treturn p;\\n}\\ntemplate <class T>\\nstruct cum_vector {\\npublic:\\n\\tcum_vector() = default;\\n\\ttemplate <class U>\\n\\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\\n\\t\\tfor(int i = 0; i < (int)vec.size(); i++)\\n\\t\\t\\tcum[i + 1] = cum[i] + vec[i];\\n\\t}\\n\\tT prod(int l, int r) {\\n\\t\\treturn cum[r] - cum[l];\\n\\t}\\n\\nprivate:\\n\\tstd::vector<T> cum;\\n};\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\ta = (a % mod + mod) % mod;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f) {\\n\\twhile(abs(ok - ng) > 1) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f, int loop) {\\n\\tfor(int i = 0; i < loop; i++) {\\n\\t\\tT mid = (ok + ng) / 2;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nvoid main_();\\n\\nint main() {\\n\\tmain_();\\n\\treturn 0;\\n}\\n#line 10 \\\"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\\\"\\n\\nstruct Edge {\\n\\tint to;\\n\\tlong long cost;\\n\\tEdge() = default;\\n\\tEdge(int to_, long long cost_) : to(to_), cost(cost_) {}\\n\\tbool operator<(const Edge &a) const { return cost < a.cost; }\\n\\tbool operator>(const Edge &a) const { return cost > a.cost; }\\n\\tfriend std::ostream &operator<<(std::ostream &s, Edge &a) {\\n\\t\\ts << \\\"to: \\\" << a.to << \\\", cost: \\\" << a.cost;\\n\\t\\treturn s;\\n\\t}\\n};\\n\\nclass graph {\\n\\tstd::vector<std::vector<Edge>> edges;\\n\\n\\ttemplate <class F>\\n\\tstruct rec_lambda {\\n\\t\\tF f;\\n\\t\\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\\n\\t\\ttemplate <class... Args>\\n\\t\\tauto operator()(Args &&...args) const {\\n\\t\\t\\treturn f(*this, std::forward<Args>(args)...);\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tinline const std::vector<Edge> &operator[](int k) const { return edges[k]; }\\n\\tinline std::vector<Edge> &operator[](int k) { return edges[k]; }\\n\\n\\tint size() const { return edges.size(); }\\n\\tvoid resize(const int n) { edges.resize(n); }\\n\\n\\tgraph() = default;\\n\\tgraph(int n) : edges(n) {}\\n\\tgraph(int n, int e, bool weight = 0, bool directed = 0, int idx = 1) : edges(n) { input(e, weight, directed, idx); }\\n\\tconst long long INF = 3e18;\\n\\n\\tvoid input(int e = -1, bool weight = 0, bool directed = false, int idx = 1) {\\n\\t\\tif(e == -1) e = size() - 1;\\n\\t\\twhile(e--) {\\n\\t\\t\\tint u, v;\\n\\t\\t\\tlong long cost = 1;\\n\\t\\t\\tstd::cin >> u >> v;\\n\\t\\t\\tif(weight) std::cin >> cost;\\n\\t\\t\\tu -= idx, v -= idx;\\n\\t\\t\\tedges[u].emplace_back(v, cost);\\n\\t\\t\\tif(!directed) edges[v].emplace_back(u, cost);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid add_edge(int u, int v, long long cost = 1, bool directed = false, int idx = 0) {\\n\\t\\tu -= idx, v -= idx;\\n\\t\\tedges[u].emplace_back(v, cost);\\n\\t\\tif(!directed) edges[v].emplace_back(u, cost);\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\tstd::vector<long long> bfs(int s) {\\n\\t\\tstd::vector<long long> dist(size(), INF);\\n\\t\\tstd::queue<int> que;\\n\\t\\tdist[s] = 0;\\n\\t\\tque.push(s);\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(dist[e.to] != INF) continue;\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// constraint: cost of each edge is zero or one\\n\\tstd::vector<long long> zero_one_bfs(int s) {\\n\\t\\tstd::vector<long long> dist(size(), INF);\\n\\t\\tstd::deque<int> deq;\\n\\t\\tdist[s] = 0;\\n\\t\\tdeq.push_back(s);\\n\\t\\twhile(!deq.empty()) {\\n\\t\\t\\tint v = deq.front();\\n\\t\\t\\tdeq.pop_front();\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tassert(0LL <= e.cost and e.cost < 2LL);\\n\\t\\t\\t\\tif(e.cost and dist[e.to] > dist[v] + 1) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v] + 1;\\n\\t\\t\\t\\t\\tdeq.push_back(e.to);\\n\\t\\t\\t\\t} else if(!e.cost and dist[e.to] > dist[v]) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v];\\n\\t\\t\\t\\t\\tdeq.push_front(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο((E+V)logV)\\n\\t// cannot reach: INF\\n\\tstd::vector<long long> dijkstra(int s) { // verified\\n\\t\\tstd::vector<long long> dist(size(), INF);\\n\\t\\tconst auto compare = [](const std::pair<long long, int> &a, const std::pair<long long, int> &b) { return a.first > b.first; };\\n\\t\\tstd::priority_queue<std::pair<long long, int>, std::vector<std::pair<long long, int>>, decltype(compare)> que{compare};\\n\\t\\tdist[s] = 0;\\n\\t\\tque.emplace(0, s);\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tstd::pair<long long, int> p = que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tint v = p.second;\\n\\t\\t\\tif(dist[v] < p.first) continue;\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\t\\tque.emplace(dist[e.to], e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(VE)\\n\\t// cannot reach: INF\\n\\t// negative cycle: -INF\\n\\tstd::vector<long long> bellman_ford(int s) { // verified\\n\\t\\tint n = size();\\n\\t\\tstd::vector<long long> res(n, INF);\\n\\t\\tres[s] = 0;\\n\\t\\tfor(int loop = 0; loop < n - 1; loop++) {\\n\\t\\t\\tfor(int v = 0; v < n; v++) {\\n\\t\\t\\t\\tif(res[v] == INF) continue;\\n\\t\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\t\\tres[e.to] = std::min(res[e.to], res[v] + e.cost);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstd::queue<int> que;\\n\\t\\tstd::vector<int> chk(n);\\n\\t\\tfor(int v = 0; v < n; v++) {\\n\\t\\t\\tif(res[v] == INF) continue;\\n\\t\\t\\tfor(auto &e : edges[v]) {\\n\\t\\t\\t\\tif(res[e.to] > res[v] + e.cost and !chk[e.to]) {\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(!que.empty()) {\\n\\t\\t\\tint now = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(!chk[e.to]) {\\n\\t\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\t\\tque.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tif(chk[i]) res[i] = -INF;\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(V^3)\\n\\tstd::vector<std::vector<long long>> warshall_floyd() { // verified\\n\\t\\tint n = size();\\n\\t\\tstd::vector<std::vector<long long>> dist(n, std::vector<long long>(n, INF));\\n\\t\\tfor(int i = 0; i < n; i++) dist[i][i] = 0;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(auto &e : edges[i]) dist[i][e.to] = std::min(dist[i][e.to], e.cost);\\n\\t\\tfor(int k = 0; k < n; k++)\\n\\t\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif(dist[i][k] == INF) continue;\\n\\t\\t\\t\\tfor(int j = 0; j < n; j++) {\\n\\t\\t\\t\\t\\tif(dist[k][j] == INF) continue;\\n\\t\\t\\t\\t\\tdist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\treturn dist;\\n\\t}\\n\\n\\t// Ο(V) (using DFS)\\n\\t// if a directed cycle exists, return {}\\n\\tstd::vector<int> topological_sort() { // verified\\n\\t\\tstd::vector<int> res;\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> used(n, 0);\\n\\t\\tbool not_DAG = false;\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\trec_lambda([&](auto &&dfs, int k) -> void {\\n\\t\\t\\t\\tif(not_DAG) return;\\n\\t\\t\\t\\tif(used[k]) {\\n\\t\\t\\t\\t\\tif(used[k] == 1) not_DAG = true;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[k] = 1;\\n\\t\\t\\t\\tfor(auto &e : edges[k]) dfs(e.to);\\n\\t\\t\\t\\tused[k] = 2;\\n\\t\\t\\t\\tres.push_back(k);\\n\\t\\t\\t})(i);\\n\\t\\t}\\n\\t\\tif(not_DAG) return std::vector<int>{};\\n\\t\\tstd::reverse(res.begin(), res.end());\\n\\t\\treturn res;\\n\\t}\\n\\n\\tbool is_DAG() { return !topological_sort().empty(); } // verified\\n\\n\\t// Ο(V)\\n\\t// array of the distance from each vertex to the most distant vertex\\n\\tstd::vector<long long> height() { // verified\\n\\t\\tauto vec1 = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tlong long dia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec1[i]) dia = vec1[i], v1 = i;\\n\\t\\tvec1 = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec1[i]) dia = vec1[i], v2 = i;\\n\\t\\tauto vec2 = bfs(v2);\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(vec1[i] < vec2[i]) vec1[i] = vec2[i];\\n\\t\\treturn vec1;\\n\\t}\\n\\n\\t// O(V+E)\\n\\t// vector<(int)(0 or 1)>\\n\\t// if it is not bipartite, return {}\\n\\tstd::vector<int> bipartite_grouping() {\\n\\t\\tstd::vector<int> colors(size(), -1);\\n\\t\\tauto dfs = [&](auto self, int now, int col) -> bool {\\n\\t\\t\\tcolors[now] = col;\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(col == colors[e.to]) return false;\\n\\t\\t\\t\\tif(colors[e.to] == -1 and !self(self, e.to, !col)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(colors[i] == -1 and !dfs(dfs, i, 0)) return std::vector<int>{};\\n\\t\\treturn colors;\\n\\t}\\n\\n\\tbool is_bipartite() { return !bipartite_grouping().empty(); }\\n\\n\\t// Ο(V+E)\\n\\t// ((v1, v2), diameter)\\n\\tstd::pair<std::pair<int, int>, long long> diameter() { // verified\\n\\t\\tauto vec = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tlong long dia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec[i]) dia = vec[i], v1 = i;\\n\\t\\tvec = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec[i]) dia = vec[i], v2 = i;\\n\\t\\tstd::pair<std::pair<int, int>, long long> res = {{v1, v2}, dia};\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// return {s, v1, v2, ... t}\\n\\tstd::vector<int> diameter_path() {\\n\\t\\tauto vec = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tlong long dia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec[i]) dia = vec[i], v1 = i;\\n\\t\\tauto vec2 = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\\n\\t\\tvec = bfs(v2);\\n\\t\\tstd::vector<int> ret;\\n\\t\\tauto dfs = [&](auto self, int now, int p) -> void {\\n\\t\\t\\tret.emplace_back(now);\\n\\t\\t\\tif(now == v2) return;\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(vec[to] + vec2[to] == dia and to != p)\\n\\t\\t\\t\\t\\tself(self, to, now);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, v1, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// return subtree_size, root = root\\n\\tstd::vector<int> subtree_size(const int root) {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> ret(n, 1);\\n\\t\\trec_lambda([&](auto &&dfs, int now, int p) -> void {\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(to == p) continue;\\n\\t\\t\\t\\tdfs(to, now);\\n\\t\\t\\t\\tret[now] += ret[to];\\n\\t\\t\\t}\\n\\t\\t})(root, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(ElogV)\\n\\tlong long prim() { // verified\\n\\t\\tlong long res = 0;\\n\\t\\tstd::priority_queue<Edge, std::vector<Edge>, std::greater<Edge>> que;\\n\\t\\tfor(auto &e : edges[0]) que.push(e);\\n\\t\\tstd::vector<int> chk(size());\\n\\t\\tchk[0] = 1;\\n\\t\\tint cnt = 1;\\n\\t\\twhile(cnt < size()) {\\n\\t\\t\\tauto e = que.top();\\n\\t\\t\\tque.pop();\\n\\t\\t\\tif(chk[e.to]) continue;\\n\\t\\t\\tcnt++;\\n\\t\\t\\tres += e.cost;\\n\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\tfor(auto &e2 : edges[e.to]) que.push(e2);\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(ElogE)\\n\\tlong long kruskal() { // verified\\n\\t\\tstd::vector<std::tuple<int, int, long long>> Edges;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\\n\\t\\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &b) {\\n\\t\\t\\treturn std::get<2>(a) < std::get<2>(b);\\n\\t\\t});\\n\\t\\tstd::vector<int> uf_data(size(), -1);\\n\\t\\tauto root = [&uf_data](auto self, int x) -> int {\\n\\t\\t\\tif(uf_data[x] < 0) return x;\\n\\t\\t\\treturn uf_data[x] = self(self, uf_data[x]);\\n\\t\\t};\\n\\t\\tauto unite = [&uf_data, &root](int u, int v) -> bool {\\n\\t\\t\\tu = root(root, u), v = root(root, v);\\n\\t\\t\\tif(u == v) return false;\\n\\t\\t\\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\\n\\t\\t\\tuf_data[u] += uf_data[v];\\n\\t\\t\\tuf_data[v] = u;\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\t\\tlong long ret = 0;\\n\\t\\tfor(auto &e : Edges)\\n\\t\\t\\tif(unite(std::get<0>(e), std::get<1>(e))) ret += std::get<2>(e);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tgraph build_mst() {\\n\\t\\tstd::vector<std::tuple<int, int, long long>> Edges;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\\n\\t\\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &b) {\\n\\t\\t\\treturn std::get<2>(a) < std::get<2>(b);\\n\\t\\t});\\n\\t\\tstd::vector<int> uf_data(size(), -1);\\n\\t\\tauto root = [&uf_data](auto self, int x) -> int {\\n\\t\\t\\tif(uf_data[x] < 0) return x;\\n\\t\\t\\treturn uf_data[x] = self(self, uf_data[x]);\\n\\t\\t};\\n\\t\\tauto unite = [&uf_data, &root](int u, int v) -> bool {\\n\\t\\t\\tu = root(root, u), v = root(root, v);\\n\\t\\t\\tif(u == v) return false;\\n\\t\\t\\tif(uf_data[u] > uf_data[v]) std::swap(u, v);\\n\\t\\t\\tuf_data[u] += uf_data[v];\\n\\t\\t\\tuf_data[v] = u;\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\t\\tgraph g(this->size());\\n\\t\\tfor(auto &e : Edges)\\n\\t\\t\\tif(unite(std::get<0>(e), std::get<1>(e))) {\\n\\t\\t\\t\\tg.add_edge(std::get<0>(e), std::get<1>(e), std::get<2>(e));\\n\\t\\t\\t}\\n\\t\\treturn g;\\n\\t}\\n\\n\\t// O(V)\\n\\tstd::vector<int> centroid() {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> centroid, sz(n);\\n\\t\\tauto dfs = [&](auto self, int now, int per) -> void {\\n\\t\\t\\tsz[now] = 1;\\n\\t\\t\\tbool is_centroid = true;\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(e.to != per) {\\n\\t\\t\\t\\t\\tself(self, e.to, now);\\n\\t\\t\\t\\t\\tsz[now] += sz[e.to];\\n\\t\\t\\t\\t\\tif(sz[e.to] > n / 2) is_centroid = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(n - sz[now] > n / 2) is_centroid = false;\\n\\t\\t\\tif(is_centroid) centroid.push_back(now);\\n\\t\\t};\\n\\t\\tdfs(dfs, 0, -1);\\n\\t\\treturn centroid;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// directed graph from root to leaf\\n\\tgraph root_to_leaf(int root = 0) {\\n\\t\\tgraph res(size());\\n\\t\\tstd::vector<int> chk(size(), 0);\\n\\t\\tchk[root] = 1;\\n\\t\\tauto dfs = [&](auto self, int now) -> void {\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(chk[e.to] == 1) continue;\\n\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\tres.add_edge(now, e.to, e.cost, 1, 0);\\n\\t\\t\\t\\tself(self, e.to);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, root);\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// directed graph from leaf to root\\n\\tgraph leaf_to_root(int root = 0) {\\n\\t\\tgraph res(size());\\n\\t\\tstd::vector<int> chk(size(), 0);\\n\\t\\tchk[root] = 1;\\n\\t\\tauto dfs = [&](auto self, int now) -> void {\\n\\t\\t\\tfor(auto &e : edges[now]) {\\n\\t\\t\\t\\tif(chk[e.to] == 1) continue;\\n\\t\\t\\t\\tchk[e.to] = 1;\\n\\t\\t\\t\\tres.add_edge(e.to, now, e.cost, 1, 0);\\n\\t\\t\\t\\tself(self, e.to);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, root);\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// long long Chu_Liu_Edmonds(int root = 0) {}\\n};\\n#line 7 \\\"c.cpp\\\"\\n\\nvoid solve() {\\n\\tINT(n, m, c);\\n\\tif(!n) exit(0);\\n\\tgraph g(n, m, 1, 1);\\n\\tgraph h(n * (m + 1));\\n\\trep(i, n) {\\n\\t\\trep(j, m + 1) {\\n\\t\\t\\tfor(auto [to, cost] : g[i]) {\\n\\t\\t\\t\\t//skip する場合\\n\\t\\t\\t\\tif(j + 1 <= m) h.add_edge(i * (m + 1) + j, to * (m + 1) + j + 1, 0, 1);\\n\\t\\t\\t\\th.add_edge(i * (m + 1) + j, to * (m + 1) + j, cost, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto d = h.dijkstra(0);\\n\\trep(i, m + 1) {\\n\\t\\tif(d[(n - 1) * (m + 1) + i] <= c) {\\n\\t\\t\\tprint(i);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid main_() {\\n\\twhile(1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 590,\n \"memory_kb\": 57500,\n \"score_of_the_acc\": -1.7368,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1311_6501233\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=1167167167167167167;\\nconst int INF=1050000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\nint N,M,C;\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\twhile(cin>>N>>M>>C,N) solve();\\n}\\n\\nvoid solve(){\\n\\tvector<vector<pair<int,int>>> G(N*(M+1));\\n\\trep(i,M){\\n\\t\\tint f,t,w;\\n\\t\\tcin>>f>>t>>w;\\n\\t\\tf--,t--;\\n\\t\\trep(j,M){\\n\\t\\t\\tG[f+j*N].push_back({t+j*N,w});\\n\\t\\t\\tG[f+j*N].push_back({t+j*N+N,0});\\n\\t\\t}\\n\\t}\\n\\tvector<int> dp(N*(M+1),INF);\\n\\t_pq<pair<int,int>> pq;\\n\\tdp[0]=0;\\n\\tpq.push({0,0});\\n\\twhile(!pq.empty()){\\n\\t\\tint ind,time;\\n\\t\\ttie(time,ind)=pq.top();\\n\\t\\tpq.pop();\\n\\t\\tif(dp[ind]>time) continue;\\n\\t\\tfor(auto x:G[ind]){\\n\\t\\t\\tif(chmin(dp[x.first],time+x.second)){\\n\\t\\t\\t\\tpq.push({dp[x.first],x.first});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\trep(i,M){\\n\\t\\tif(dp[i*N+N-1]>C&&C>=dp[N*(i+2)-1]){\\n\\t\\t\\tcout<<i+1<<\\\"\\\\n\\\";\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 31504,\n \"score_of_the_acc\": -1.2742,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1311_6023641\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1 << 30;\\n\\nbool solve() {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if (n == 0 and m == 0 and c == 0) return false;\\n vector<vector<pair<int, int>>> G(n);\\n for (; m--;) {\\n int f, t, x;\\n cin >> f >> t >> x;\\n G[--f].emplace_back(--t, x);\\n }\\n\\n vector<vector<int>> dp(n, vector<int>(n, INF));\\n priority_queue<tuple<int, int, int>> pq;\\n dp[0][0] = 0;\\n pq.emplace(-dp[0][0], 0, 0);\\n\\n while (!pq.empty()) {\\n auto t = pq.top();\\n pq.pop();\\n int val, v, x;\\n tie(val, v, x) = t;\\n val *= -1;\\n if (dp[v][x] < val) continue;\\n for (auto& e : G[v]) {\\n int u = e.first;\\n if (val + e.second < dp[u][x]) {\\n dp[u][x] = val + e.second;\\n pq.emplace(-dp[u][x], u, x);\\n }\\n if (x + 1 < n and val < dp[u][x + 1]) {\\n dp[u][x + 1] = val;\\n pq.emplace(-dp[u][x + 1], u, x + 1);\\n }\\n }\\n }\\n\\n int ans = n;\\n for (int j = n - 1; j >= 0; j--) {\\n if (dp[n - 1][j] <= c) {\\n ans = j;\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while (solve())\\n ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.05,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1311_6023637\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\\n for (size_t i = 0; i < N; i++) {\\n os << v[i] << (i + 1 == N ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\nlong long MSK(int n) { return (1LL << n) - 1; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <typename T> void mkuni(vector<T>& v) {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n}\\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\\n#pragma endregion\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nbool solve() {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if (n == 0 and m == 0 and c == 0) return false;\\n vector<vector<pair<int, int>>> G(n);\\n for (; m--;) {\\n int f, t, x;\\n cin >> f >> t >> x;\\n G[--f].emplace_back(--t, x);\\n }\\n\\n vector<vector<int>> dp(n, vector<int>(n, INF));\\n priority_queue<tuple<int, int, int>> pq;\\n dp[0][0] = 0;\\n pq.emplace(-dp[0][0], 0, 0);\\n\\n while (!pq.empty()) {\\n auto t = pq.top();\\n pq.pop();\\n int val, v, x;\\n tie(val, v, x) = t;\\n val *= -1;\\n if (dp[v][x] < val) continue;\\n for (auto& e : G[v]) {\\n int u = e.first;\\n if (val + e.second < dp[u][x]) {\\n dp[u][x] = val + e.second;\\n pq.emplace(-dp[u][x], u, x);\\n }\\n if (x + 1 < n and val < dp[u][x + 1]) {\\n dp[u][x + 1] = val;\\n pq.emplace(-dp[u][x + 1], u, x + 1);\\n }\\n }\\n }\\n\\n int ans = n;\\n for (int j = n - 1; j >= 0; j--) {\\n if (dp[n - 1][j] <= c) {\\n ans = j;\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while (solve())\\n ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -0.0523,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1311_6020851\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long int;\\n//using Int=__int128;\\n#define ALL(A) A.begin(),A.end()\\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\\n//→ ↓ ← ↑ \\nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\\n//右上から時計回り\\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\\nlong double EPS = 1e-6;\\nlong double PI = acos(-1);\\nconst ll INF=(1LL<<62);\\nconst int MAX=(1<<30);\\nconstexpr ll MOD=1000000000+7;\\n//constexpr ll MOD=998244353;\\n\\n\\ninline void bin101(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n}\\n\\nusing pii=pair<int,int>;\\nusing pil=pair<int,ll>;\\nusing pli=pair<ll,int>;\\nusing pll=pair<ll,ll>;\\nusing psi=pair<string,int>;\\nusing pis=pair<int,string>;\\nusing psl=pair<string,ll>;\\nusing pls=pair<ll,string>;\\nusing pss=pair<string,string>;\\n\\nusing Graph=vector<vector<int>>;\\n\\ntemplate<typename T >\\nstruct edge {\\n\\tint to;\\n\\tT cost;\\n\\tedge()=default;\\n\\tedge(int to, T cost) : to(to), cost(cost) {}\\n\\n};\\ntemplate<typename T>\\nusing WeightGraph=vector<vector<edge<T>>>;\\n\\ntemplate<typename T>\\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n T cost;\\n cin>>s>>t>>cost;\\n if(index1) s--,t--;\\n g[s].emplace_back(t,cost);\\n if(not directed) g[t].emplace_back(s,cost);\\n }\\n}\\n\\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n cin>>s>>t;\\n if(index1) s--,t--;\\n g[s].push_back(t);\\n if(not directed) g[t].push_back(s);\\n }\\n}\\n\\n\\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<T> &v) {\\n for(size_t i=0;i<v.size();i++) is>>v[i];\\n\\treturn is;\\n}\\n \\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n is>>v[i];\\n }\\n return is;\\n}\\n//vector cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\\n for(size_t i=0;i<v.size();i++){\\n if(i) os<<\\\" \\\";\\n os<<v[i];\\n }\\n return os;\\n}\\n//vector<vector> cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n os<<v[i];\\n if(i+1!=v.size()) os<<\\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\n//Graph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const Graph &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(int to:g[i]){\\n os<<i<<\\\"->\\\"<<to<<\\\" \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n//WeightGraph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n os<<i<<\\\"->\\\"<<e.to<<\\\"(\\\"<<e.cost<<\\\") \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n\\treturn vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n\\tauto v=vmake(args...);\\n\\treturn vector<decltype(v)>(n,move(v));\\n}\\ntemplate<typename V,typename T>\\nvoid fill(V &v,const T value){\\n v=value;\\n}\\n\\ntemplate<typename V,typename T>\\nvoid fill(vector<V> &vec,const T value){\\n for(auto &v:vec) fill(v,value);\\n}\\n\\n//pair cout\\ntemplate<typename T, typename U>\\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\\n\\tos<<p.first<<\\\" \\\"<<p.second;\\n\\treturn os;\\n}\\n \\n//pair cin\\ntemplate<typename T, typename U>\\ninline istream &operator>>(istream &is,pair<T,U> &p) {\\n\\tis>>p.first>>p.second;\\n\\treturn is;\\n}\\n \\n//ソート\\ntemplate<typename T>\\ninline void vsort(vector<T> &v){\\n sort(v.begin(),v.end());\\n}\\n \\n//逆順ソート\\ntemplate<typename T>\\ninline void rvsort(vector<T> &v){\\n\\tsort(v.rbegin(),v.rend());\\n}\\n\\n//1ビットの数を返す\\ninline int popcount(int x){\\n\\treturn __builtin_popcount(x);\\n}\\n//1ビットの数を返す\\ninline int popcount(ll x){\\n\\treturn __builtin_popcountll(x);\\n}\\ntemplate<typename T>\\ninline void Compress(vector<T> &C){\\n sort(C.begin(),C.end());\\n C.erase(unique(C.begin(),C.end()),C.end());\\n}\\ntemplate<typename T>\\ninline int lower_idx(const vector<T> &C,T value){\\n return lower_bound(C.begin(),C.end(),value)-C.begin();\\n}\\ntemplate<typename T>\\ninline int upper_idx(const vector<T> &C,T value){\\n return upper_bound(C.begin(),C.end(),value)-C.begin();\\n}\\n//時計回りに90度回転\\ntemplate<typename T>\\ninline void rotate90(vector<vector<T>> &C){\\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\\n for(int h=0;h<C.size();h++){\\n for(int w=0;w<C[h].size();w++){\\n D[w][C.size()-1-h]=C[h][w];\\n }\\n }\\n C=D;\\n}\\n//補グラフを返す\\n//i→iのような辺は加えない\\nGraph ComplementGraph(const Graph &g){\\n size_t sz=g.size();\\n bool used[sz][sz];\\n fill(used[0],used[sz],false);\\n for(size_t i=0;i<sz;i++){\\n for(int to:g[i]){\\n used[i][to]=true;\\n }\\n }\\n Graph ret(sz);\\n for(size_t i=0;i<sz;i++){\\n for(size_t j=0;j<sz;j++){\\n if(used[i][j]) continue;\\n if(i==j) continue;\\n ret[i].push_back(j);\\n }\\n }\\n return ret;\\n}\\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\\n//無効グラフのみに対応\\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\\n vector<Graph> ret;\\n vector<int> now;\\n for(size_t i=0;i<g.size();i++){\\n if(id[i].first!=-1) continue;\\n id[i].first=ret.size();\\n id[i].second=0;\\n now.push_back(i);\\n for(size_t j=0;j<now.size();j++){\\n for(int to:g[now[j]]){\\n if(id[to].first==-1){\\n id[to].first=ret.size();\\n id[to].second=now.size();\\n now.push_back(to);\\n }\\n }\\n }\\n Graph r(now.size());\\n for(size_t j=0;j<now.size();j++){\\n r[j]=g[now[j]];\\n for(int &to:r[j]){\\n to=id[to].second;\\n }\\n }\\n ret.push_back(r);\\n now.clear();\\n }\\n return make_pair(ret,id);\\n}\\n//0indexを想定\\nbool OutGrid(ll h,ll w,ll H,ll W){\\n return (h>=H or w>=W or h<0 or w<0);\\n}\\n\\nvoid NO(){\\n cout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n}\\nvoid YES(){\\n cout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n}\\nvoid No(){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n}\\nvoid Yes(){\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n}\\nnamespace overflow{\\n template<typename T>\\n T max(){\\n return numeric_limits<T>::max();\\n }\\n template<typename T>\\n T ADD(T a,T b){\\n T res;\\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\\n }\\n template<typename T>\\n T MUL(T a,T b){\\n T res;\\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\\n }\\n};\\nusing namespace overflow;\\nstruct ModInt{\\n using u64=uint_fast64_t;\\n u64 a;\\n constexpr ModInt() :a(0){}\\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\\n\\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\\n return ModInt(*this)+=rhs;\\n }\\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\\n return ModInt(*this)-=rhs;\\n }\\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\\n return ModInt(*this)*=rhs;\\n }\\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\\n return ModInt(*this)/=rhs;\\n }\\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\\n return ModInt(*this)+=ModInt(rhs);\\n }\\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\\n return ModInt(*this)-=ModInt(rhs);\\n }\\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\\n return ModInt(*this)*=ModInt(rhs);\\n }\\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\\n return ModInt(*this)/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\\n a+=rhs.a;\\n if(a>=MOD) a-=MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\\n if(rhs.a>a) a+=MOD;\\n a-=rhs.a;\\n return *this;\\n }\\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\\n a=(a*rhs.a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\\n a=(a*rhs.inverse().a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\\n return *this+=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\\n return *this-=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\\n return *this*=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\\n return *this/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt operator=(const ll x)noexcept{\\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\\n return *this;\\n }\\n\\n inline constexpr bool operator==(const ModInt p)const noexcept{\\n return a==p.a;\\n }\\n\\n inline constexpr bool operator!=(const ModInt p)const noexcept{\\n return a!=p.a;\\n }\\n\\n inline constexpr ModInt pow(ll N) const noexcept{\\n ModInt ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline constexpr ModInt inverse() const noexcept{\\n return pow(MOD-2);\\n }\\n\\n};\\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)+=b;\\n}\\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)-=b;\\n}\\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)*=b;\\n}\\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const ModInt &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,ModInt &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\n\\nstruct Binominal{\\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\\n int sz;\\n Binominal(int n=10) :sz(1){\\n if(n<=0) n=10;\\n init(n);\\n }\\n inline void init(int n){\\n fac.resize(n+1,1);\\n finv.resize(n+1,1);\\n inv.resize(n+1,1);\\n for(int i=sz+1;i<=n;i++){\\n fac[i]=fac[i-1]*i;\\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\\n finv[i]=finv[i-1]*inv[i];\\n }\\n sz=n;\\n }\\n //nCk(n,k<=N) をO(1)で求める\\n inline ModInt com(int n,int k){\\n if(n<k) return ModInt(0);\\n if(n<0 || k<0) return ModInt(0);\\n if(n>sz) init(n);\\n return fac[n]*finv[k]*finv[n-k];\\n }\\n //nCk(k<=N) をO(k) で求める \\n inline ModInt rcom(ll n,int k){\\n if(n<0 || k<0 || n<k) return ModInt(0);\\n if(k>sz) init(k);\\n ModInt ret(1);\\n for(int i=0;i<k;i++){\\n ret*=n-i;\\n }\\n ret*=finv[k];\\n return ret;\\n }\\n\\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\\n //〇がn個,|がk個\\n inline ModInt h(int n,int k){\\n return com(n+k-1,k);\\n }\\n};\\nvector<int> Subset(int S,bool zero=false,bool full=false){\\n vector<int> ret;\\n int now=(S-1)&S;\\n if(full and S){\\n ret.push_back(S);\\n }\\n do{\\n ret.push_back(now);\\n now=(now-1)&S;\\n }while(now!=0);\\n if(zero){\\n ret.push_back(0);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nT SUM(const vector<T> &v,int s,int t){\\n chmax(s,0);\\n chmin(t,int(v.size())-1);\\n if(s>t) return 0;\\n if(s==0) return v[t];\\n else return v[t]-v[s-1];\\n}\\ntemplate<typename T>\\nvoid buildSUM(vector<T> &v){\\n for(size_t i=1;i<v.size();i++){\\n v[i]+=v[i-1];\\n }\\n return;\\n}\\n \\n\\nvoid solve(){\\nwhile(true){\\n int N,M,C;\\n cin>>N>>M>>C;\\n if(N==0) return;\\n WeightGraph<int> G(N);\\n for(int i=0;i<M;i++){\\n int a,b,c; cin>>a>>b>>c;\\n a--; b--;\\n G[a].emplace_back(b,c);\\n }\\n auto dp=vmake(N,N+1,MAX);\\n using T=tuple<int,int,int>;\\n priority_queue<T,vector<T>,greater<T>> que;\\n que.emplace(0,0,0);\\n dp[0][0]=0;\\n while(que.size()){\\n int c,now,used;\\n tie(c,now,used)=que.top(); que.pop();\\n if(c>dp[now][used]) continue;\\n\\n for(auto e:G[now]){\\n \\n if(used<N and chmin(dp[e.to][used+1],c)){\\n que.emplace(c,e.to,used+1);\\n }\\n if(chmin(dp[e.to][used],c+e.cost)){\\n que.emplace(c+e.cost,e.to,used);\\n }\\n }\\n }\\n for(int used=0;used<=N;used++){\\n if(dp[N-1][used]<=C){\\n cout<<used<<endl;\\n break;\\n }\\n }\\n}\\n}\\n\\nint main(){\\n bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.0149,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1311_5972710\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n#pragma GCC target (\\\"avx2\\\")\\n#pragma GCC optimization (\\\"O3\\\")\\n#pragma GCC optimization (\\\"unroll-loops\\\")\\nusing namespace std;\\n \\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\n \\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef unsigned long long ull;\\n \\n \\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n \\n#define MOD 1000000007\\n \\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\nconst double EPS = 1e-8, PI = acos(-1);\\nconst double pi = 3.141592653589793238462643383279;\\n//ここから編集 \\ntypedef string::const_iterator State;\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b) * b;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n \\n ModInt() : x(0) {}\\n \\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n \\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n \\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n \\n ModInt operator-() const { return ModInt(-x); }\\n \\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n \\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n \\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n \\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n \\n bool operator==(const ModInt &p) const { return x == p.x; }\\n \\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n \\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n \\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n \\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n \\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n \\n static int get_mod() { return mod; }\\n};\\n \\nusing modint = ModInt< 1000000007 >;\\ntemplate< typename T >\\nstruct Combination {\\n vector< T > _fact, _rfact, _inv;\\n \\n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\\n _fact[0] = _rfact[sz] = _inv[0] = 1;\\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[sz] /= _fact[sz];\\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n \\n inline T fact(int k) const { return _fact[k]; }\\n \\n inline T rfact(int k) const { return _rfact[k]; }\\n \\n inline T inv(int k) const { return _inv[k]; }\\n \\n T P(int n, int r) const {\\n if(r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n \\n T C(int p, int q) const {\\n if(q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n \\n T H(int n, int r) const {\\n if(n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n \\nll modpow(ll x, ll n, ll mod) {\\n ll res = 1;\\n x %= mod;\\n if(x == 0) return 0;\\n while(n) {\\n if(n&1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n} \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\ntemplate<typename T> \\nstruct BIT{\\n int N;\\n std::vector<T> node;\\n BIT(){}\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\n void build(int n) {\\n N = n;\\n node.resize(N+10);\\n }\\n /* a: 1-indexed */\\n void add(int a, T x){\\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\\n }\\n\\n /* [1, a] */\\n T sum(int a){\\n T res = 0;\\n for(int x=a; x>0; x -= x & -x) res += node[x];\\n return res;\\n }\\n\\n /* [l, r] */\\n T rangesum(int l, int r){\\n return sum(r) - sum(l-1);\\n }\\n\\n /* \\n a1+a2+...+aw >= valとなるような最小のwを返す\\n @verify https://codeforces.com/contest/992/problem/E\\n */\\n int lower_bound(T val) {\\n if(val < 0) return 0;\\n\\n int res = 0;\\n int n = 1; \\n while (n < N) n *= 2;\\n\\n T tv=0;\\n for (int k = n; k > 0; k /= 2) {\\n if(res + k < N && node[res + k] < val){\\n val -= node[res+k];\\n res += k;\\n }\\n }\\n return res+1; \\n }\\n};\\nstruct UnionFind{\\n std::vector<int> par;\\n std::vector<int> siz;\\n\\n UnionFind(int sz_): par(sz_), siz(sz_) {\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n void init(int sz_){\\n par.resize(sz_);\\n siz.resize(sz_);\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n int root(int x){\\n if(x == par[x]) return x;\\n return par[x] = root(par[x]);\\n }\\n\\n bool merge(int x, int y){\\n x = root(x), y = root(y);\\n if(x == y) return false;\\n if(siz[x] < siz[y]) std::swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool issame(int x, int y){\\n return root(x) == root(y);\\n }\\n\\n int size(int x){\\n return siz[root(x)];\\n }\\n};\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(const string &s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = 1001;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n /* \\n concat \\n @verify https://codeforces.com/problemset/problem/514/C\\n */\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n};\\nint dist[110][1010];\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n int n, m, c;\\n while(cin >> n >> m >> c) {\\n if(n == 0 && m == 0 && c == 0) break;\\n vector<vector<pair<int, int>>> g(n);\\n REP(i,m) {\\n int a, b, d; cin >> a >> b >> d;\\n a--; b--;\\n g[a].push_back({b, d});\\n }\\n REP(i,n) REP(j,m+1) dist[i][j] = 1e9;\\n // iにいて変更回数がj回, これまでのコストがkであるとき\\n priority_queue<pair<ll,pair<ll,ll>>, vector<pair<ll,pair<ll,ll>>>, greater<pair<ll,pair<ll,ll>>>> pq;\\n pq.push({0, {0,0}});\\n dist[0][0] = 0;\\n while(pq.size()) {\\n auto[d, p] = pq.top(); pq.pop();\\n auto[t, v] = p;\\n if(dist[v][t] < d) continue;\\n for(auto[u, cost]: g[v]) {\\n if(dist[u][t] > dist[v][t] + cost) {\\n dist[u][t] = dist[v][t] + cost;\\n pq.push({dist[u][t], {t, u}});\\n }\\n if(dist[u][t+1] > dist[v][t]) {\\n dist[u][t+1] = dist[v][t];\\n pq.push({dist[u][t+1], {t+1, u}});\\n }\\n }\\n\\n }\\n int ans = 1e9;\\n REP(i,m+1) if(dist[n-1][i] <= c) {\\n ans = i;\\n break;\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.165,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1311_5964333\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing T = tuple<int, int, int>;\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if (n == 0 && m == 0 && c == 0) break;\\n vector<vector<pair<int, int>>> G(n);\\n for (int i = 0; i < m; ++i) {\\n int f, t, ci;\\n cin >> f >> t >> ci;\\n --f, --t;\\n G[f].push_back({t, ci});\\n }\\n vector<vector<int>> dist(n, vector<int>(n, 1e9)); // minimum dist to i after removing j edges\\n dist[0][0] = 0;\\n priority_queue<T, vector<T>, greater<>> pq;\\n pq.push({0, 0, 0});\\n while (!pq.empty()) {\\n auto [d, v, k] = pq.top();\\n pq.pop();\\n if (d > dist[v][k]) continue;\\n for (auto [u, w] : G[v]) {\\n if (k + 1 < n && d < dist[u][k+1]) {\\n dist[u][k+1] = d;\\n pq.push({d, u, k + 1});\\n }\\n if (d + w < dist[u][k]) {\\n dist[u][k] = d + w;\\n pq.push({d + w, u, k});\\n }\\n }\\n }\\n for (int j = 0; j < n; ++j) {\\n if (dist[n-1][j] <= c) {\\n cout << j << \\\"\\\\n\\\";\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.0112,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1311_5959190\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 5050000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nint main(){\\n while(1){\\n int n,m,C; cin >> n >> m >> C;\\n if(!n) break;\\n vector<vpl> G(n);\\n rep(i,m){\\n int u,v,c; cin >> u >> v >> c; u--; v--;\\n G[u].emplace_back(v,c);\\n }\\n int ok = m, ng = 0;\\n vvl d(n,vl(m+1,inf));\\n while(ok-ng > 1){\\n int mid = (ok+ng) / 2;\\n rep(i,n) rep(j,m+1) d[i][j] = inf;\\n d[0][0] = 0;\\n priority_queue<tapu,vector<tapu>,greater<tapu>> pq;\\n pq.emplace(0,0,0);\\n while(!pq.empty()){\\n int c,u,t;\\n tie(c,u,t) = pq.top(); pq.pop();\\n if(d[u][t] < c) continue;\\n for(auto v : G[u]){\\n if(chmin(d[v.first][t], c + v.second)){\\n pq.emplace(d[v.first][t], v.first, t);\\n }\\n if(t < mid && chmin(d[v.first][t+1], c)){\\n pq.emplace(d[v.first][t+1], v.first, t+1);\\n }\\n }\\n }\\n int res = *min_element(all(d[n-1]));\\n if(res <= C) ok = mid;\\n else ng = mid;\\n }\\n cout << ok << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 6456,\n \"score_of_the_acc\": -0.3421,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1311_5434873\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define ALL(x) begin(x),end(x)\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define debug(v) cout<<#v<<\\\":\\\";for(auto x:v){cout<<x<<' ';}cout<<endl;\\n#define mod 998244353\\nusing ll=long long;\\nconst int INF=1000000000;\\nconst ll LINF=1001002003004005006ll;\\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\\n\\nstruct IOSetup{\\n IOSetup(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout<<fixed<<setprecision(12);\\n }\\n} iosetup;\\n \\ntemplate<typename T>\\nostream &operator<<(ostream &os,const vector<T>&v){\\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\\\"\\\":\\\" \\\");\\n return os;\\n}\\ntemplate<typename T>\\nistream &operator>>(istream &is,vector<T>&v){\\n for(T &x:v)is>>x;\\n return is;\\n}\\n\\nint N,M,C;\\n\\n// graph template\\n// ref : https://ei1333.github.io/library/graph/graph-template.cpp\\ntemplate<typename T=int>\\nstruct Edge{\\n int from,to;\\n T w;\\n int idx;\\n Edge()=default;\\n Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){}\\n operator int() const{return to;}\\n};\\n\\ntemplate<typename T=int>\\nstruct Graph{\\n vector<vector<Edge<T>>> g;\\n int V,E;\\n Graph()=default;\\n Graph(int n):g(n),V(n),E(0){}\\n\\n size_t size(){\\n return g.size();\\n }\\n void resize(int k){\\n g.resize(k);\\n }\\n inline const vector<Edge<T>> &operator[](int k)const{\\n return (g.at(k));\\n }\\n inline vector<Edge<T>> &operator[](int k){\\n return (g.at(k));\\n }\\n void add_directed_edge(int from,int to,T cost=1){\\n g[from].emplace_back(from,to,cost,E++);\\n }\\n void add_edge(int from,int to,T cost=1){\\n g[from].emplace_back(from,to,cost,E);\\n g[to].emplace_back(to,from,cost,E++);\\n }\\n void read(int m,int pad=-1,bool weighted=false,bool directed=false){\\n for(int i=0;i<m;i++){\\n int u,v;cin>>u>>v;\\n u+=pad,v+=pad;\\n T w=T(1);\\n if(weighted) cin>>w;\\n if(directed) add_directed_edge(u,v,w);\\n else add_edge(u,v,w);\\n }\\n }\\n};\\n\\nvoid solve(){\\n Graph<int> G(N);\\n G.read(M,-1,true,true);\\n\\n vector<vector<int>> dp(N,vector<int>(N+1,INF));\\n dp[0][0]=0;\\n using P=pair<int,int>;\\n\\n priority_queue<pair<int,P>,vector<pair<int,P>>,greater<pair<int,P>>> que;\\n que.emplace(0,P(0,0));\\n\\n while(!que.empty()){\\n auto [d,p]=que.top();que.pop();\\n\\n if(dp[p.first][p.second]<d) continue;\\n\\n for(auto &e:G[p.first]){\\n if(p.second<N)if(chmin(dp[e][p.second+1],d)) que.emplace(d,P(e,p.second+1));\\n if(chmin(dp[e][p.second],d+e.w)) que.emplace(d+e.w,P(e,p.second));\\n }\\n }\\n\\n for(int k=0;k<=N;k++){\\n if(dp[N-1][k]<=C){\\n cout<<k<<endl;\\n return ;\\n }\\n }\\n cout<<-1<<endl;\\n return ;\\n}\\n\\nsigned main(){\\n while(cin>>N>>M>>C,N and M) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.0141,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1311_5434869\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define ALL(x) begin(x),end(x)\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define debug(v) cout<<#v<<\\\":\\\";for(auto x:v){cout<<x<<' ';}cout<<endl;\\n#define mod 998244353\\nusing ll=long long;\\nconst int INF=1000000000;\\nconst ll LINF=1001002003004005006ll;\\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\\n\\nstruct IOSetup{\\n IOSetup(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout<<fixed<<setprecision(12);\\n }\\n} iosetup;\\n \\ntemplate<typename T>\\nostream &operator<<(ostream &os,const vector<T>&v){\\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\\\"\\\":\\\" \\\");\\n return os;\\n}\\ntemplate<typename T>\\nistream &operator>>(istream &is,vector<T>&v){\\n for(T &x:v)is>>x;\\n return is;\\n}\\n\\nint N,M,C;\\n\\n// graph template\\n// ref : https://ei1333.github.io/library/graph/graph-template.cpp\\ntemplate<typename T=int>\\nstruct Edge{\\n int from,to;\\n T w;\\n int idx;\\n Edge()=default;\\n Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){}\\n operator int() const{return to;}\\n};\\n\\ntemplate<typename T=int>\\nstruct Graph{\\n vector<vector<Edge<T>>> g;\\n int V,E;\\n Graph()=default;\\n Graph(int n):g(n),V(n),E(0){}\\n\\n size_t size(){\\n return g.size();\\n }\\n void resize(int k){\\n g.resize(k);\\n }\\n inline const vector<Edge<T>> &operator[](int k)const{\\n return (g.at(k));\\n }\\n inline vector<Edge<T>> &operator[](int k){\\n return (g.at(k));\\n }\\n void add_directed_edge(int from,int to,T cost=1){\\n g[from].emplace_back(from,to,cost,E++);\\n }\\n void add_edge(int from,int to,T cost=1){\\n g[from].emplace_back(from,to,cost,E);\\n g[to].emplace_back(to,from,cost,E++);\\n }\\n void read(int m,int pad=-1,bool weighted=false,bool directed=false){\\n for(int i=0;i<m;i++){\\n int u,v;cin>>u>>v;\\n u+=pad,v+=pad;\\n T w=T(1);\\n if(weighted) cin>>w;\\n if(directed) add_directed_edge(u,v,w);\\n else add_edge(u,v,w);\\n }\\n }\\n};\\n\\ntemplate<typename T>\\nvector<vector<T>> WarshallFloyd(vector<vector<T>> mat, T inf=1000000100){\\n int n=(int)mat.size();\\n for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)\\n if(mat[i][k]<inf and mat[k][j]<inf) mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);\\n return mat;\\n}\\n\\nvoid solve(){\\n vector<Edge<int>> E;\\n vector<vector<int>> W(N,vector<int>(N,INF));\\n rep(i,M){\\n int u,v,c;cin>>u>>v>>c;\\n u--,v--;\\n E.emplace_back(u,v,c,0);\\n chmin(W[u][v],c);\\n }\\n\\n sort(ALL(E),[](Edge<int> a,Edge<int> b){return a.w<b.w;});\\n reverse(ALL(E));\\n\\n W=WarshallFloyd(W);\\n\\n\\n for(auto &e:E){\\n chmin(W[e.from][e.to],0);\\n e.idx=1;\\n\\n for(int i=0;i<N;i++)for(int j=0;j<N;j++)\\n chmin(W[i][j],W[i][e.from]+W[e.to][j]);\\n\\n if(W[0][N-1]<=C) break;\\n }\\n \\n Graph<int> G(N);\\n for(auto &e:E) G.g[e.from].push_back(e);\\n \\n\\n vector<vector<int>> dp(N,vector<int>(N+1,INF));\\n dp[0][0]=0;\\n using P=pair<int,int>;\\n\\n priority_queue<pair<int,P>,vector<pair<int,P>>,greater<pair<int,P>>> que;\\n que.emplace(0,P(0,0));\\n\\n while(!que.empty()){\\n auto [d,p]=que.top();que.pop();\\n\\n if(dp[p.first][p.second]<d) continue;\\n\\n for(auto &e:G[p.first]){\\n if(p.second<N)if(chmin(dp[e][p.second+1],d)) que.emplace(d,P(e,p.second+1));\\n if(chmin(dp[e][p.second],d+e.w)) que.emplace(d+e.w,P(e,p.second));\\n }\\n }\\n\\n for(int k=0;k<=N;k++){\\n if(dp[N-1][k]<=C){\\n cout<<k<<endl;\\n return ;\\n }\\n }\\n cout<<-1<<endl;\\n return ;\\n}\\n\\nsigned main(){\\n while(cin>>N>>M>>C,N and M) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.1331,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1311_5312019\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\ntemplate <class Cost = int>\\nstruct edge {\\n int from, to;\\n Cost cost;\\n edge() {}\\n edge(int from, int to, Cost cost) : from(from), to(to), cost(cost) {}\\n\\n // for debug\\n friend ostream &operator<<(ostream &os, const edge &e) {\\n os << e.from << \\\" -> \\\" << e.to << \\\" : \\\" << e.cost << \\\", \\\";\\n return os;\\n }\\n};\\n\\ntemplate <class Cost = int>\\nstruct Graph {\\n int V;\\n vector<vector<edge<Cost>>> G;\\n Graph() {}\\n Graph(int V) : V(V) { G.resize(V); }\\n void add_edge(int a, int b, Cost cost = Cost(0)) {\\n G[a].push_back(edge<Cost>(a, b, cost));\\n }\\n void add_edge_undirected(int a, int b, Cost cost = Cost(0)) {\\n G[a].push_back(edge<Cost>(a, b, cost));\\n G[b].push_back(edge<Cost>(b, a, cost));\\n }\\n size_t size() const { return G.size(); }\\n const vector<edge<Cost>> &operator[](int id) const { return G[id]; }\\n\\n // for debug\\n friend ostream &operator<<(ostream &os, const Graph g) {\\n for (int i = 0; i < g.size(); i++) {\\n os << g[i];\\n if (i + 1 < g.size()) os << endl;\\n }\\n return os;\\n }\\n};\\n\\n// verified\\n// https://atcoder.jp/contests/dwacon6th-final-open/submissions/10023433\\ntemplate <class Cost>\\nvector<Cost> dijkstra(Graph<Cost> &g, int s) {\\n assert(0 <= s && s < g.size());\\n vector<Cost> dist;\\n dist.assign(g.size(), numeric_limits<Cost>::max());\\n dist[s] = Cost(0);\\n MinHeap<pair<Cost, int>> q;\\n q.push(make_pair(Cost(0), s));\\n while (!q.empty()) {\\n auto a = q.top();\\n q.pop();\\n int v = a.second;\\n if (dist[v] < a.first) continue;\\n for (auto e : g[v]) {\\n if (dist[e.to] > dist[v] + e.cost) {\\n dist[e.to] = dist[v] + e.cost;\\n q.push(make_pair(dist[e.to], e.to));\\n }\\n }\\n }\\n return dist;\\n}\\n\\nbool solve() {\\n int n, m, c;\\n cin >> n >> m >> c;\\n if (n + m + c == 0) return false;\\n Graph<int> g(n * (m + 1));\\n for (int i = 0; i < m; i++) {\\n int a, b, cost;\\n cin >> a >> b >> cost;\\n a--;\\n b--;\\n for (int j = 0; j < m; j++) {\\n g.add_edge(j * n + a, j * n + b, cost);\\n g.add_edge(j * n + a, (j + 1) * n + b, 0);\\n }\\n }\\n auto dist = dijkstra(g, 0);\\n for (int i = 0; i <= m; i++) {\\n if (dist[i * n + n - 1] <= c) {\\n cout << i << endl;\\n return true;\\n }\\n }\\n assert(false);\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n // solve();\\n while (solve()) {}\\n // int t; cin >> t; while(t--)solve();\\n\\n // int t; cin >> t;\\n // for(int i=1;i<=t;i++){\\n // cout << \\\"Case #\\\" << i << \\\": \\\";\\n // solve();\\n // }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 43084,\n \"score_of_the_acc\": -1.5914,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1311_5136684\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n \\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n\\treturn (ull)rng() % B;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m,c;\\n while(cin >> n >> m >> c,n+m+c){\\n vector<vector<pair<int,int>>> g(n);\\n for(int i=0;i<m;i++){\\n int x,y,w; cin >> x >> y >> w;\\n x--; y--;\\n g[x].push_back({y,w});\\n }\\n vector<vector<int>> d(n,vector<int>(n+1,1e9));\\n d[0][0]=0;\\n priority_queue<pair<int,pair<int,int>>> pq;\\n pq.push(make_pair(0,make_pair(0,0)));\\n while(pq.size()){\\n auto p=pq.top(); pq.pop();\\n if(-p.first!=d[p.second.first][p.second.second])continue;\\n for(auto to:g[p.second.first]){\\n int t=to.first;\\n if(d[t][p.second.second]>-p.first+to.second){\\n d[t][p.second.second]=-p.first+to.second;\\n pq.push(make_pair(-d[t][p.second.second],make_pair(t,p.second.second)));\\n }\\n if(p.second.second+1>n)continue;\\n if(d[t][p.second.second+1]>-p.first){\\n d[t][p.second.second+1]=-p.first;\\n pq.push(make_pair(p.first,make_pair(t,p.second.second+1)));\\n }\\n }\\n }\\n for(int i=0;i<=n;i++){\\n if(c>=d[n-1][i]){\\n cout << i << endl;\\n break;\\n }\\n }\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.047,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1311_4996007\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<algorithm>\\nusing namespace std;\\nusing P = pair<int, int>;\\nusing Q = pair<int, P>;\\nconstexpr int INF = 1000000000;\\n\\nint n, m, c, x, y, z;\\nvector<P> e[100];\\nint mn[100][101];\\n\\nint main() {\\n while (scanf(\\\"%d%d%d\\\", &n, &m, &c), n) {\\n for (int i = 0; i < n; i++) {\\n e[i].clear();\\n for (int j = 0; j <= n; j++) mn[i][j] = INF;\\n }\\n for (int i = 0; i < m; i++) {\\n scanf(\\\"%d%d%d\\\", &x, &y, &z);\\n x--; y--;\\n e[x].push_back(P(y, z));\\n }\\n priority_queue<Q, vector<Q>, greater<Q>> pq; // (cost, P(num, minas))\\n pq.push(Q(0, P(0, 0)));\\n for (int i = 0; i <= n; i++) mn[0][i] = 0;\\n while (!pq.empty()) {\\n Q tmp = pq.top(); pq.pop();\\n int num = tmp.second.first, minas = tmp.second.second;\\n if (mn[num][minas] < tmp.first) continue;\\n for (P p : e[num]) {\\n if (mn[p.first][minas] > mn[num][minas] + p.second) {\\n mn[p.first][minas] = mn[num][minas] + p.second;\\n pq.push(Q(mn[p.first][minas], P(p.first, minas)));\\n }\\n if (minas < n && mn[p.first][minas+1] > mn[num][minas]) {\\n if (mn[num][minas] >= mn[p.first][minas]) continue;\\n mn[p.first][minas+1] = mn[num][minas];\\n pq.push(Q(mn[p.first][minas+1], P(p.first, minas+1)));\\n }\\n }\\n }\\n int ans = 0;\\n while (mn[n-1][ans] > c) ans++;\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2860,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":763,"cells":{"group_id":{"kind":"string","value":"aoj_1315_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nGift from the Goddess of Programming\nThe goddess of programming is reviewing a thick logbook, which is a yearly record of visitors\nto her holy altar of programming. The logbook also records her visits at the altar.\nThe altar attracts programmers from all over the world because one visitor is chosen every\nyear and endowed with a gift of miracle programming power by the goddess. The endowed\nprogrammer is chosen from those programmers who spent the longest time at the altar during\nthe goddess's presence. There have been enthusiastic visitors who spent very long time at the\naltar but failed to receive the gift because the goddess was absent during their visits.\nNow, your mission is to write a program that finds how long the programmer to be endowed\nstayed at the altar during the goddess's presence.\nInput\nThe input is a sequence of datasets. The number of datasets is less than 100. Each dataset is\nformatted as follows.\nn\nM\n1\n/D\n1\nh\n1\n:\nm\n1\ne\n1\np\n1\nM\n2\n/D\n2\nh\n2\n:\nm\n2\ne\n2\np\n2\n.\n.\n.\nM\nn\n/D\nn\nh\nn\n:\nm\nn\ne\nn\np\nn\nThe first line of a dataset contains a positive even integer, n ≤ 1000, which denotes the number\nof lines of the logbook. This line is followed by\nn\nlines of space-separated data, where\nM\ni\n/D\ni\nidentifies the month and the day of the visit,\nh\ni\n:\nm\ni\nrepresents the time of either the entrance\nto or exit from the altar,\ne\ni\nis either I for entrance, or O for exit, and\np\ni\nidentifies the visitor.\nAll the lines in the logbook are formatted in a fixed-column format. Both the month and the\nday in the month are represented by two digits. Therefore April 1 is represented by 04/01 and\nnot by 4/1. The time is described in the 24-hour system, taking two digits for the hour, followed\nby a colon and two digits for minutes, 09:13 for instance and not like 9:13. A programmer is\nidentified by an ID, a unique number using three digits. The same format is used to indicate\nentrance and exit of the goddess, whose ID is 000.\nAll the lines in the logbook are sorted in ascending order with respect to date and time. Because\nthe altar is closed at midnight, the altar is emptied at 00:00. You may assume that each time\nin the input is between 00:01 and 23:59, inclusive.\nA programmer may leave the altar just after entering it. In this case, the entrance and exit\ntime are the same and the length of such a visit is considered 0 minute. You may assume for\nsuch entrance and exit records, the line that corresponds to the entrance appears earlier in the\ninput than the line that corresponds to the exit. You may assume that at least one programmer\nappears in the logbook.\nThe end of the input is indicated by a line containing a single zero.\nOutput\nFor each dataset, output the total sum of the blessed time of the endowed programmer. The\nblessed time of a programmer is the length of his/her stay at the altar during the presence of\nthe goddess. The endowed programmer is the one whose total blessed time is the longest among\nall the programmers. The output should be represented\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1315_4851862","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst vector<int> convert={1440,60,1};\nvector<int> month={0,31,28,31,30,31,30,31,31,30,31,30};\n\nint time(string s,string t){\n int M=(s[0]-'0')*10+(s[1]-'0')-1;\n int D=(s[3]-'0')*10+(s[4]-'0')-1;\n int h=(t[0]-'0')*10+(t[1]-'0');\n int m=(t[3]-'0')*10+(t[4]-'0');\n return convert[0]*(month[M]+D)+convert[1]*h+convert[2]*m;\n}\n\nconst int MAX_T=6e5+10,MAX_N=1010;\nint imos[MAX_T];\n\nvoid solve(int n){\n vector<string> S(n),T(n);\n vector<char> IO(n);\n vector<int> id(n);\n for (int i=0;i<n;++i){\n string ID; cin >> S[i] >> T[i] >> IO[i] >> ID;\n id[i]=stoi(ID);\n }\n\n vector<int> sum(MAX_N,0),pre(MAX_N,0);\n for (int i=0;i<MAX_T;++i) imos[i]=0;\n for (int i=0;i<n;++i){\n if (id[i]) continue;\n int t=time(S[i],T[i]);\n if (IO[i]=='I') ++imos[t+1];\n else --imos[t+1];\n }\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\n\n for (int i=0;i<n;++i){\n if (!id[i]) continue;\n int t=time(S[i],T[i]);\n if (IO[i]=='I') pre[id[i]]=t;\n else sum[id[i]]+=imos[t]-imos[pre[id[i]]];\n }\n\n int ans=0;\n for (int i=0;i<MAX_N;++i) ans=max(ans,sum[i]);\n\n cout << ans << '\\n';\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n for (int i=0;i<11;++i) month[i+1]+=month[i];\n int n;\n while(cin >> n,n){\n solve(n);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":5644,"score_of_the_acc":-0.3098,"final_rank":14},{"submission_id":"aoj_1315_4851861","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define LOCAL\n#pragma region Macros\ntypedef long long ll;\n#define ALL(x) (x).begin(),(x).end()\nconst long long MOD=1000000007;\n// const long long MOD=998244353;\nconst int INF=1e9;\nconst long long IINF=1e18;\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nconst char dir[4]={'D','R','U','L'};\n\ntemplate<typename T>\nistream &operator>>(istream &is,vector<T> &v){\n for (T &x:v) is >> x;\n return is;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const vector<T> &v){\n for (int i=0;i<v.size();++i){\n os << v[i] << (i+1==v.size()?\"\": \" \");\n }\n return os;\n}\ntemplate<typename T,typename U>\nostream &operator<<(ostream &os,const pair<T,U> &p){\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate<typename T,typename U>\nostream &operator<<(ostream &os,const map<T,U> &m){\n os << '{';\n for (auto itr=m.begin();itr!=m.end();++itr){\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr!=m.end()) os << ',';\n --itr;\n }\n os << '}';\n return os;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const set<T> &s){\n os << '{';\n for (auto itr=s.begin();itr!=s.end();++itr){\n os << *itr;\n if (++itr!=s.end()) os << ',';\n --itr;\n }\n os << '}';\n return os;\n}\n\nvoid debug_out(){cerr << '\\n';}\ntemplate<class Head,class... Tail>\nvoid debug_out(Head&& head,Tail&&... tail){\n cerr << head;\n if (sizeof...(Tail)>0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) cerr << \" \";\\\ncerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n';\\\ncerr << \" \";\\\ndebug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}\ntemplate<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}\n\ntemplate<class T1,class T2> inline bool chmin(T1 &a,T2 b){\n if (a>b){a=b; return true;} return false;\n}\ntemplate<class T1,class T2> inline bool chmax(T1 &a,T2 b){\n if (a<b){a=b; return true;} return false;\n}\n#pragma endregion\n\nconst vector<int> convert={1440,60,1};\nvector<int> month={0,31,28,31,30,31,30,31,31,30,31,30};\n\nint time(string s,string t){\n int M=(s[0]-'0')*10+(s[1]-'0')-1;\n int D=(s[3]-'0')*10+(s[4]-'0')-1;\n int h=(t[0]-'0')*10+(t[1]-'0');\n int m=(t[3]-'0')*10+(t[4]-'0');\n return convert[0]*(month[M]+D)+convert[1]*h+convert[2]*m;\n}\n\nconst int MAX_T=6e5+10,MAX_N=1010;\nint imos[MAX_T];\n\nvoid solve(int n){\n vector<string> S(n),T(n);\n vector<char> IO(n);\n vector<int> id(n);\n for (int i=0;i<n;++i){\n string ID; cin >> S[i] >> T[i] >> IO[i] >> ID;\n id[i]=stoi(ID);\n }\n\n vector<int> sum(MAX_N,0),pre(MAX_N,0);\n for (int i=0;i<MAX_T;++i) imos[i]=0;\n for (int i=0;i<n;++i){\n if (id[i]) continue;\n int t=time(S[i],T[i]);\n if (IO[i]=='I') ++imos[t+1];\n else --imos[t+1];\n }\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\n\n for (int i=0;i<n;++i){\n if (!id[i]) continue;\n int t=time(S[i],T[i]);\n if (IO[i]=='I') pre[id[i]]=t;\n else sum[id[i]]+=imos[t]-imos[pre[id[i]]];\n }\n\n int ans=0;\n for (int i=0;i<MAX_N;++i) ans=max(ans,sum[i]);\n\n cout << ans << '\\n';\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n for (int i=0;i<11;++i) month[i+1]+=month[i];\n int n;\n while(cin >> n,n){\n solve(n);\n }\n}","accuracy":1,"time_ms":60,"memory_kb":5612,"score_of_the_acc":-0.3068,"final_rank":13},{"submission_id":"aoj_1315_4813376","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 1020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nint main(){\n\twhile(1){\n\t\tint n; cin >> n;\n\t\tif(!n) break;\n\t\tmap<int,map<int,vector<pii>>> mp;\n\t\trep(i,n){\n\t\t\tint a,b,c,d,e; char f;\n\t\t\tscanf(\"%d/%d %d:%d %c %d\",&a,&b,&c,&d,&f,&e);\n\t\t\tint s = f == 'I';\n\t\t\tmp[a*31+b][c*60+d].emplace_back(s, e);\n\t\t}\n\t\tvector<int> t(n,0);\n\t\tset<int> se;\n\t\tfor(auto i : mp){\n\t\t\trep(j,1440){\n\t\t\t\tfor(auto k : i.second[j]){\n\t\t\t\t\tif(k.first) se.insert(k.second);\n\t\t\t\t\telse se.erase(k.second);\n\t\t\t\t}\n\t\t\t\tif(se.count(0) == 1){\n\t\t\t\t\tfor(auto l : se) t[l]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tt[0] = 0;\n\t\tcout << *max_element(all(t)) << \"\\n\";\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":3424,"score_of_the_acc":-0.0596,"final_rank":10},{"submission_id":"aoj_1315_4773668","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nint second(string s) {\n\tfor (auto &i : s)i -= '0';\n\tint ret = s[0];\n\tret *= 10;\n\tret += s[1];\n\tret *= 6;\n\tret += s[3];\n\tret *= 10;\n\tret += s[4];\n\treturn ret;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N, N) {\n\t\tmap<string, vector<int>>mp;\n\t\tvector<string>a(N);\n\t\tvector<string>b(N);\n\t\tvector<char>c(N);\n\t\tvector<string>d(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> a[i] >> b[i] >> c[i] >> d[i];\n\t\t\tmp[a[i]].push_back(i);\n\t\t}\n\t\tmap<string, int>score;\n\t\tfor (auto i : mp) {\n\t\t\tvector<int>v(1441);\n\t\t\tfor (auto j : i.second) {\n\t\t\t\tif (d[j] == \"000\") {\n\t\t\t\t\tif (c[j] == 'I') {\n\t\t\t\t\t\tv[second(b[j])]++;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tv[second(b[j])]--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int j = 1; j <= 1440; j++) {\n\t\t\t\tv[j] += v[j - 1];\n\t\t\t}\n\t\t\tfor (auto j : i.second) {\n\t\t\t\tif (d[j] != \"000\") {\n\t\t\t\t\tif (c[j] == 'I') {\n\t\t\t\t\t\tfor (int k = second(b[j]); k <= 1440; k++) {\n\t\t\t\t\t\t\tscore[d[j]] += v[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tfor (int k = second(b[j]); k <= 1440; k++) {\n\t\t\t\t\t\t\tscore[d[j]] -= v[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (auto i : score) {\n\t\t\tans = max(ans, i.second);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":3380,"score_of_the_acc":-0.1269,"final_rank":11},{"submission_id":"aoj_1315_4745873","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while (1){\n int n;\n cin >> n;\n if (n == 0){\n break;\n }\n vector<int> M(n), D(n), h(n), m(n);\n vector<char> e(n);\n vector<int> p(n);\n for (int i = 0; i < n; i++){\n char c1, c2;\n cin >> M[i] >> c1 >> D[i] >> h[i] >> c2 >> m[i] >> e[i] >> p[i];\n }\n vector<int> time(n);\n for (int i = 0; i < n; i++){\n time[i] = ((M[i] * 40 + D[i]) * 24 + h[i]) * 60 + m[i];\n }\n vector<int> t(1000, 0);\n vector<bool> c(1000, false);\n for (int i = 0; i < n; i++){\n if (e[i] == 'I'){\n c[p[i]] = true;\n }\n if (e[i] == 'O'){\n c[p[i]] = false;\n }\n if (i < n - 1 && c[0]){\n int dt = time[i + 1] - time[i];\n for (int j = 1; j < 1000; j++){\n if (c[j]){\n t[j] += dt;\n }\n }\n }\n }\n int ans = 0;\n for (int j = 1; j < 1000; j++){\n ans = max(ans, t[j]);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3092,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1315_4120552","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\n\n// quoted from beet-aizu\ntemplate <typename T, typename E, typename F, typename G>\nstruct SegmentTree{\n // using F = function<T(T, T)>\n // using G = function<T(T, E)>\n int n;\n F f;\n G g;\n T ti;\n vector<T> dat;\n SegmentTree(){};\n SegmentTree(F f,G g,T ti):f(f),g(g),ti(ti){}\n void init(int n_){ \n n=1;\n while(n<n_) n<<=1;\n dat.assign(n<<1,ti);\n }\n void build(const vector<T> &v){\n int n_=v.size();\n init(n_);\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\n for(int i=n-1;i;i--)\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\n }\n void update(int k,const E &x){\n k += n;\n dat[k] = g(dat[k], x);\n while(k>>=1)\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \n }\n T operator [](int k) const { return dat[k+n]; }\n T query(int a,int b) const {\n T vl=ti,vr=ti;\n for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\n if(l&1) vl=f(vl,dat[l++]);\n if(r&1) vr=f(dat[--r],vr);\n }\n return f(vl,vr);\n }\n\n /* TODO わからない 聞く \n template<typename C>\n int find(int a,int b,C &check,int k,int l,int r){\n if(!check(dat[k])||r<=a||b<=l) return -1;\n if(k>=n) return k-n;\n int m=(l+r)>>1;\n int vl=find(a,b,check,(k<<1)|0,l,m);\n if(~vl) return vl;\n return find(a,b,check,(k<<1)|1,m,r);\n }\n template<typename C>\n int find(int a,int b,C &check){\n return find(a,b,check,1,0,n);\n }*/\n \n};\n\n\n/** テンプレ\nint main(){\n**/\n\nbool solve() {\n int n; cin >> n;\n if(n == 0) return false;\n vector<int> id(n);\n vector<int> t(n);\n vector<char> mode(n);\n \n for(int i = 0; i < n; i++) {\n string a, b, c, ID; cin >> a >> b >> c >> ID;\n // cerr << a.substr(3, 2) << \" \" << b.substr(0, 2) << \" \" << b.substr(3, 2) << endl;\n int M = stoi(a.substr(0, 2));\n int d = stoi(a.substr(3, 2));\n int h = stoi(b.substr(0, 2));\n int m = stoi(b.substr(3, 2));\n assert(M <= 12);\n assert(d <= 31);\n assert(h <= 24);\n assert(m <= 60);\n\n t[i] = M * 32 * 24 * 60 + d * 24 * 60 + h * 60 + m;\n id[i] = stoi(ID);\n mode[i] = c[0];\n }\n\n vector<vector<int>> l(1000);\n vector<vector<int>> r(1000);\n\n for(int i = 0; i < n; i++) {\n if(mode[i] == 'I') {\n l[id[i]].push_back(t[i]);\n } else {\n r[id[i]].push_back(t[i]);\n }\n }\n \n vector<int> dat(13 * 32 * 25 * 61, 0);\n \n assert(l[0].size() == r[0].size());\n for(int j = 0; j < l[0].size(); j++) {\n int left = l[0][j];\n int right = r[0][j];\n for(int i = left; i < right; i++) dat[i] = 1;\n }\n\n using T = int; // type T\n using E = int; // type E\n auto f = [](T a, T b){ // return type T value\n return a + b;\n };\n auto g = [](T a, E b){ // return type T value\n return b; // return b;\n };\n T ti = 0; // identify element\n SegmentTree<T, E, decltype(f), decltype(g)> sg(f, g, ti); // don't change\n sg.build(dat); // 初期配列を代入\n \n vector<int> cnt(1000, 0);\n for(int i = 1; i < 1000; i++) {\n assert(l[i].size() == r[i].size());\n for(int j = 0; j < l[i].size(); j++) {\n int left = l[i][j];\n int right = r[i][j];\n cnt[i] += sg.query(left, right);\n }\n }\n\n int ma = 0;\n for(int i = 0; i < 1000; i++) ma = max(ma, cnt[i]);\n cout << ma << endl;\n \n return true;\n}\n\nsigned main() {\n \n while(solve()) {}\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":13800,"score_of_the_acc":-1.3571,"final_rank":18},{"submission_id":"aoj_1315_4120415","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\nint solve_testcase() {\n int N; cin >> N;\n if(N == 0) return 1;\n\n vector< vector< tuple<int, int, int> > > info(31 * 12);\n for(int i=0; i<N; i++) {\n int day = 0, time = 0, inout = 0, id = -1;\n {\n int m, d; scanf(\"%d/%d\", &m, &d); m--, d--;\n day = 31 * m + d;\n }\n {\n int h, m; scanf(\"%d:%d\", &h, &m);\n time = h * 60 + m;\n }\n {\n char c; scanf(\" %c\", &c);\n inout = (c == 'I' ? 1 : 0);\n }\n {\n scanf(\" %d\", &id);\n }\n info[day].emplace_back(time, inout, id);\n }\n\n // id, 時間\n map<int, int> rec;\n const int MAX_TIME = 3600;\n for(int d=0; d<31 * 12; d++) {\n vector<bool> god(MAX_TIME);\n\n // 誰がいまいるかの集合\n set<int> S;\n \n int ptr = 0;\n for(int t=0; t<MAX_TIME; t++) {\n while(ptr < info[d].size() and get<0>(info[d][ptr]) == t) {\n int inout, id; tie(std::ignore, inout, id) = info[d][ptr];\n if(inout == 1) S.emplace(id);\n if(inout == 0) S.erase(id);\n ptr++;\n }\n\n god[t] = S.count(0);\n for(auto p : S) {\n if(p == 0) continue;\n if(god[t]) rec[p]++;\n }\n }\n }\n\n int ans = 0;\n for(auto e : rec) ans = max(ans, e.second);\n printf(\"%d\\n\", ans);\n return 0;\n}\n\nint main() {\n while(!solve_testcase());\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":3260,"score_of_the_acc":-0.43,"final_rank":15},{"submission_id":"aoj_1315_4120397","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint timetom(string s){\n int h=stoi(s.substr(0,2));\n int m=stoi(s.substr(3,2));\n return h*60+m;\n}\n\nbool solve(){\n int n;\n cin>>n;\n if(n==0)return false;\n //vector<pair<pair<int,bool>,int>> d(n);//<time,io>,id\n vector<vector<int>> d;\n vector<int> tm(n);\n map<string,int> mp;\n int godind=-1;\n for (int i = 0; i < n; ++i) {\n string s,t;\n cin>>s>>t;\n tm[i]=timetom(t);\n char c;\n cin>>c;\n string id;\n cin>>id;\n if(mp.find(id)==mp.end()){\n mp[id]=d.size();\n if(id==\"000\")godind=d.size();\n d.emplace_back(vector<int>(n+1,0));\n }\n if(c=='I')++d[mp[id]][i];\n else --d[mp[id]][i];\n }\n for(auto &i:d){\n for (int j = 0; j < n; ++j) {\n i[j+1]+=i[j];\n }\n }\n if(godind==-1){\n cout<<0<<endl;\n return true;\n }\n int ans=0;\n for (int i = 0; i < d.size(); ++i) {\n if(i==godind)continue;\n int tans=0;\n for (int j = 0; j < n-1; ++j) {\n if(d[i][j]==1&&d[godind][j]==1){\n tans+=tm[j+1]-tm[j];\n }\n }\n ans=max(ans,tans);\n }\n cout<<ans<<endl;\n return true;\n}\n\nint main(){\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4888,"score_of_the_acc":-0.1677,"final_rank":12},{"submission_id":"aoj_1315_3904078","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nconst int year1=372;\nconst int day1=1440;\nclass logdata\n{\n\tpublic:\n\tint day;\n\tint date;\n\tint visitor;\n\tlogdata()\n\t{}\n\tlogdata(string m,string t,string v)\n\t{\n\t\tvisitor=stoi(v);\n\t\tint big=(m[0]-'0')*10+(m[1]-'0');\n\t\tint little=(m[3]-'0')*10+(m[4]-'0');\n\t\tday=(big-1)*31+little;\n\t\tbig=(t[0]-'0')*10+(t[1]-'0');\n\t\tlittle=(t[3]-'0')*10+(t[4]-'0');\n\t\tdate=big*60+little;\n\t}\n};\nlogdata IO[1000];\nbool inroom[1000];//誰が部屋にいるか\nint during[1000];//goddessと一緒にいた時間\nstring indata[4];\n\n//IO[index-1]からIO[index]までの経過時間を求める\nint keika(int index)\n{\n\tint diffday=IO[index].day-IO[index-1].day;\n\tint difftime=IO[index].date-IO[index-1].date;\n\treturn diffday*day1+difftime;\n}\n\nint main()\n{\n\tint n;\n\twhile(1)\n\t{\n\t\tcin>>n;\n\t\tif(n==0)\n\t\t\tbreak;\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tfor(int j=0;j<4;j++)\n\t\t\t\tcin>>indata[j];\n\t\t\tIO[i]=logdata(indata[0],indata[1],indata[3]);\n\t\t\tif(i>0)\n\t\t\t{\n\t\t\t\tif(IO[i].day<IO[i-1].day)\n\t\t\t\t\tIO[i].day+=((IO[i-1].day-IO[i].day)/year1+1)*year1;\n\t\t\t}\n\t\t}\n\t\t//input end\n\t\tfill(during,during+1000,0);\n\t\tfill(inroom,inroom+1000,false);\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\t//goddessがいるなら部屋にいる人の時間を加算する\n\t\t\tif(inroom[0])\n\t\t\t{\n\t\t\t\tint k=keika(i);\n\t\t\t\tfor(int j=1;j<1000;j++)\n\t\t\t\t{\n\t\t\t\t\tif(inroom[j])\n\t\t\t\t\t\tduring[j]+=k;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//部屋にいる人\n\t\t\tinroom[IO[i].visitor]^=true;//反転\n\t\t}\n\t\tsort(during,during+1000);\n\t\treverse(during,during+1000);\n\t\tcout<<during[0]<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3156,"score_of_the_acc":-0.006,"final_rank":5},{"submission_id":"aoj_1315_3695170","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n \n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e16;\nconst ll MOD = 1e9 + 7;\n \n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n \nll n;\nll sum[600][60*30];\nll ans[600];\n \nvoid solve(){\n // ll res = 0;\n rep(i,600)rep(j,60*30-1)sum[i][j+1] += sum[i][j];\n FOR(i,1,600){\n ll cnt = 0;\n rep(j,60*30){\n if((sum[i][j] > 0) && (sum[0][j] > 0))cnt++;\n // else cnt = 0;\n // res = max(cnt,res);\n }\n\t\tans[i] += cnt;\n }\n // return res;\n}\n \nvoid init(){\n rep(i,600)rep(j,60*30)sum[i][j] = 0;\n}\n \nll calc(string s){\n return ((s[0] - '0')*10+(s[1] - '0'))*60 + (s[3] - '0')*10+(s[4] - '0');\n}\n \nint main(){\n while(cin >> n && n){\n\t\tfill(ans,ans+600,0);\n string pre = \"\";\n ll aans = 0;\n rep(i,n){\n string s,hm,e;\n ll p;\n cin >> s >> hm >> e >> p;\n if(pre != s){\n pre = s;\n\t\t\t\tsolve();\n // ans = max(ans,solve());\n\t\t\t\t// cout << \"!!\" << pre << \" \" << ans << endl;\n init();\n }\n ll num = calc(hm);\n // cout << p << endl;\n if(e == \"I\")sum[p][num] = 1;\n else sum[p][num] = -1;\n }\n // ans = max(ans,solve());\n\t\tsolve();\n\t\tinit();\n\t\tFOR(i,1,600)aans = max(aans,ans[i]);\n\t\t// cout << \"!!\" << pre << \" \" << ans << endl;\n cout << aans << endl;\n }\n}","accuracy":1,"time_ms":710,"memory_kb":11500,"score_of_the_acc":-1.7852,"final_rank":20},{"submission_id":"aoj_1315_3595576","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\n\n\nint timesum[1001];\nint entry[1001];\nint main(void) {\n // cin.tie(0); ios::sync_with_stdio(false);\n int n;\n while(cin >> n,n){\n vector<int> M(n),D(n),h(n),m(n);\n vector<string> e(n);\n vector<int> p(n);\n char c;\n for(int i = 0; i < n;i++){\n cin >> M[i] >> c >> D[i] >> h[i] >> c >> m[i] >> e[i] >> p[i];\n }\n fill(timesum,timesum+1001,0);\n fill(entry,entry+1001,-1);\n \n for(int i = 0; i < n;i++){\n \n if(e[i] == \"I\"){\n entry[p[i]] = h[i] * 60 + m[i];\n }else{\n int time = h[i] * 60 + m[i];\n \n if(p[i] == 0){\n for(int j = 1; j <= 1000; j++){\n if(entry[j] == -1) continue;\n timesum[j] += time-max(entry[0],entry[j]);\n }\n \n }else{\n if(entry[0] != -1 && entry[p[i]] != -1){\n timesum[p[i]] += time - max(entry[0],entry[p[i]]);\n }\n }\n entry[p[i]] = -1;\n }\n }\n cout << *max_element(timesum, timesum+101) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3208,"score_of_the_acc":-0.0108,"final_rank":7},{"submission_id":"aoj_1315_3372181","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nint n;\nint f()\n{\n\tint a,b;scanf(\"%d:%d\",&a,&b);return a*60+b;\n}\nmain()\n{\n\twhile(cin>>n,n)\n\t{\n\t\tint a[1000]={};\n\t\tint t[1000]={};\n\t\tint ans=0;\n\t\tbool flag=false;\n\t\tfor(;n--;)\n\t\t{\n\t\t\tstring s;cin>>s;\n\t\t\tint X=f();\n\t\t\tstring io;int id;cin>>io>>id;\n\t\t\tif(io==\"I\")\n\t\t\t{\n\t\t\t\tif(id)t[id]=X;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor(int j=1;j<1000;j++)if(t[j])t[j]=X;\n\t\t\t\t\tflag=true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(id)\n\t\t\t\t{\n\t\t\t\t\tif(flag)\n\t\t\t\t\t{\n\t\t\t\t\t\ta[id]+=X-t[id];\n\t\t\t\t\t\tans=max(ans,a[id]);\n\t\t\t\t\t}\n\t\t\t\t\tt[id]=0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor(int j=1;j<1000;j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(t[j])\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ta[j]+=X-t[j];\n\t\t\t\t\t\t\tans=max(ans,a[j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tflag=false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3196,"score_of_the_acc":-0.0097,"final_rank":6},{"submission_id":"aoj_1315_3314957","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint convert(char x,char y){\n return (x-'0')*10+y-'0';\n}\nint solve(int n){\n vector<string> date(n);\n vector<int> t(n);\n vector<char> op(n);\n vector<string> id(n);\n for(int i=0;i<n;i++){\n string buf;\n cin>>date[i]>>buf>>op[i]>>id[i];\n t[i]=convert(buf[0],buf[1])*60+convert(buf[3],buf[4]);\n }\n\n map<string,int> res;\n map<string,vector<int>> events;\n for(int i=0;i<n;i++) events[date[i]].push_back(i);\n\n for(auto &kvp:events){\n auto event=kvp.second;\n stack<tuple<string,int,int>> outer;\n map<string,int> inner;\n int gin=0;\n for(int idx:event){\n if(id[idx]==\"000\"){\n if(op[idx]=='I'){\n gin=t[idx];\n }\n else{\n for(auto &e:inner){\n res[e.first]+=t[idx]-max(gin,e.second);\n }\n while(!outer.empty()){\n auto tmp=outer.top(); outer.pop();\n res[get<0>(tmp)]+=max(get<2>(tmp)-max(get<1>(tmp),gin),0);\n }\n }\n }\n else{\n if(op[idx]=='I'){\n inner[id[idx]]=t[idx];\n }\n else{\n outer.push(make_tuple(id[idx],inner[id[idx]],t[idx]));\n inner.erase(id[idx]);\n }\n }\n } \n }\n int ret=0;\n for(auto &e:res) if(e.first!=\"000\") ret=max(ret,e.second);\n return ret;\n}\n \nint main(){\n int n;\n while(cin>>n,n){\n cout<<solve(n)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3332,"score_of_the_acc":-0.0224,"final_rank":8},{"submission_id":"aoj_1315_3274069","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\n#define REP(i,n) for (int i=0; i<n; i++)\n\nint imos[1003][1500], staytime[1003];\n\nint main(){\n while(1) {\n int n, mon, d, h, min, p, prevdate = 0;\n char e;\n cin >> n;\n\n if (n==0){\n break;\n }\n\n REP(i,1000){\n REP(j,1500){\n imos[i][j] = 0;\n }\n staytime[i] = 0;\n }\n\n REP(i, n) {\n scanf(\"%d/%d %d:%d %c %d\\n\", &mon, &d, &h, &min, &e, &p);\n// printf(\"%d/%d %d:%d %c %d\\n\", mon, d, h, min, e, p);\n if (mon * 12 + d != prevdate) {\n// printf(\"prevdate: %d\\n\", prevdate);\n REP(j, 1000) {\n REP(k, 1499){\n imos[j][k+1] += imos[j][k];\n }\n }\n REP(k, 1500){\n if (imos[0][k]>0){\n REP(j,1000){\n if (imos[j][k]>0){\n staytime[j] += 1;\n }\n }\n }\n }\n REP(j,1000){\n REP(k,1500){\n imos[j][k] = 0;\n }\n }\n prevdate = mon * 12 + d;\n }\n if (e == 'I') {\n imos[p][60 * h + min] += 1;\n } else {\n imos[p][60 * h + min] -= 1;\n }\n }\n\n REP(j, 1000) {\n REP(k, 1499){\n imos[j][k+1] += imos[j][k];\n }\n }\n REP(k, 1500){\n if (imos[0][k]>0){\n REP(j,1000){\n if (imos[j][k]>0){\n staytime[j] += 1;\n }\n }\n }\n }\n\n int ans=0;\n for (int i=1; i<1000; i++){ // 直す\n ans = max(ans, staytime[i]);\n// printf(\"staytime[%d] = %d\\n\", i, staytime[i]);\n }\n\n cout << ans << endl;\n\n }\n\n\n return 0;\n}","accuracy":1,"time_ms":620,"memory_kb":8984,"score_of_the_acc":-1.4217,"final_rank":19},{"submission_id":"aoj_1315_3252243","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a*b/gcd(a,b);\n}\n\nint toi(string s){\n int ret = 0;\n rep(i,s.size()){\n ret *= 10;\n ret += s[i]-'0';\n }\n return ret;\n}\n\n#define M 60*24+3\n\nint main(void) {\n int i,j;\n int n;\n int days[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};\n rep(i,12)days[i+1] += days[i];\n while(cin >> n, n){\n vector<vector<vp> > v(365,vector<vp>(1000));\n rep(i,n){\n string a,b,io,id;\n cin >> a >> b >> io >> id;\n int day = days[toi(a.substr(0,2))-1] + toi(a.substr(3,2));\n int t = toi(b.substr(0,2))*60 + toi(b.substr(3,2));\n v[day][toi(id)].push_back(pii(t,int(io==\"O\")));\n }\n vi sum(1000,0);\n rep(i,365){\n int god[M] = {};\n rep(k,v[i][0].size()){\n if(v[i][0][k].second) god[v[i][0][k].first]--;\n else god[v[i][0][k].first]++;\n }\n rep(k,M-1)god[k+1] += god[k];\n loop(j,1,1000)if(v[i][j].size()){\n int t[M] = {};\n rep(k,v[i][j].size()){\n if(v[i][j][k].second) t[v[i][j][k].first]--;\n else t[v[i][j][k].first]++;\n }\n rep(k,M-1)t[k+1] += t[k];\n rep(k,M)if(god[k]&&t[k])sum[j]++;\n }\n }\n sort(all(sum));\n cout << sum[999] << endl;\n }\n}","accuracy":1,"time_ms":390,"memory_kb":11476,"score_of_the_acc":-1.3258,"final_rank":17},{"submission_id":"aoj_1315_3219599","code_snippet":"//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <climits>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <queue>\n#include <random>\n#include <cctype>\n#include <complex>\n#include <regex>\n\nusing namespace std;\n\n#define C_MAX(a, b) ((a)>(b)?(a):(b))\n#define SHOW_VECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << \" \" << xxx.second << \"\\n\";}}\n\nstruct Data {\n int time;\n string which;\n string id;\n};\n\nstruct Per {\n int start;\n int end;\n string id;\n};\n\nint getTime(string s) {\n int hour = stoi(s.substr(0, 2));\n int minute = stoi(s.substr(3, 2));\n int time = hour * 60 + minute;\n return time;\n}\n\nint main() {\n\n while (true) {\n\n int N;\n cin >> N;\n\n if (N == 0) break;\n\n string pre = \"\";\n vector<vector<Data>> datas;\n for (int i = 0; i < N; i++) {\n string date, ti, which, id;\n cin >> date >> ti >> which >> id;\n int time = getTime(ti);\n if (i == 0) {\n datas.push_back(vector<Data>());\n datas.back().push_back((Data) {time, which, id});\n pre = date;\n continue;\n }\n if (pre == date) datas.back().push_back((Data) {time, which, id});\n else {\n datas.push_back(vector<Data>());\n datas.back().push_back((Data) {time, which, id});\n pre = date;\n }\n }\n\n map<string, int> M;\n for (int i = 0; i < datas.size(); i++) {\n vector<Per> god;\n vector<Per> other;\n int have = -1;\n for (int j = 0; j < datas[i].size(); j++) {\n auto data = datas[i][j];\n if (data.id == \"000\") {\n if (have == -1) have = data.time;\n else {\n god.push_back((Per) {have, data.time, \"000\"});\n have = -1;\n }\n }\n }\n map<string, int> has;\n for (int j = 0; j < datas[i].size(); j++) has[datas[i][j].id] = -1;\n for (int j = 0; j < datas[i].size(); j++) {\n auto data = datas[i][j];\n if (data.id != \"000\") {\n if (has[data.id] == -1) has[data.id] = data.time;\n else {\n other.push_back((Per) {has[data.id], data.time, data.id});\n has[data.id] = -1;\n }\n }\n }\n for (auto go: god) {\n for (auto ot: other) {\n int minV = max(go.start, ot.start);\n int maxV = min(go.end, ot.end);\n int d = maxV - minV;\n M[ot.id] += max(0, d);\n }\n }\n }\n\n int ansV = 0;\n for (auto x: M) ansV = max(ansV, x.second);\n\n cout << ansV << endl;\n\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3344,"score_of_the_acc":-0.0235,"final_rank":9},{"submission_id":"aoj_1315_3048256","code_snippet":"#include <iostream>\n#include <map>\nusing namespace std;\nconst int INF = (1e9);\n\nint main(){\n int N;\n const string g = \"000\";\n while(cin >> N, N){\n string d, t, e, id, D;\n map<string, int> T, I, O;\n for(int i = 0; i < N; ++i){\n cin >> d >> t >> e >> id;\n if(D != d){\n D = d;\n for(auto itr = I.begin(); itr != I.end(); ++itr) itr->second = INF;\n for(auto itr = O.begin(); itr != O.end(); ++itr) itr->second = -1;\n }\n int m = stoi(t.substr(0,2))*60 + stoi(t.substr(3,2));\n if(e == \"I\"){\n I[id] = m;\n O[id] = INF;\n }else{\n O[id] = m;\n if(id != g && O[g] > m){\n T[id] += max(0, m - max(I[g],I[id]));\n }else if(id == g){\n for(auto itr = O.begin(); itr != O.end(); ++itr){\n id = itr->first;\n int o = itr->second;\n if(o > m){\n T[id] += max(0,m - max(I[id],I[g]));\n }\n }\n }\n }\n }\n int ans = 0;\n for(auto itr = T.begin(); itr != T.end(); ++itr){\n if(itr->first == g) continue;\n //cout << itr->first << \" \" << itr->second << endl;\n ans = max(ans, itr->second);\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3152,"score_of_the_acc":-0.0056,"final_rank":4},{"submission_id":"aoj_1315_2737477","code_snippet":"#include<iostream>\n#include<vector>\n#include<stdlib.h>\n#include<string>\n#define f first\n#define s second\nusing namespace std;\n \nint T(string s){\n int time=0;\n string s1=s.substr(0,2);\n string s2=s.substr(3,2);\n time+=(60)*atoi(s1.c_str());\n time+=atoi(s2.c_str());\n return time;\n}\n \nint main()\n{\n int N,n;\n string s1,s2;\n char c;\n \n while(1){\n cin>>N;\n if(N==0)break;\n int S[1000]={};\n vector<vector<pair<string,pair<int,int> > > > V(1000);\n for(int i=0;i<N;i++){\n cin>>s1>>s2>>c>>n;\n if(c=='I')S[n]=T(s2);\n else {\n V[n].push_back(make_pair(s1,make_pair(S[n],T(s2))));\n S[n]=0;\n }\n }\n for(int i=0;i<1000;i++)S[i]=0;\n for(int k=1;k<1000;k++){\n if(V[k].empty())continue;\n for(int i=0;i<V[0].size();i++){\n for(int j=0;j<V[k].size();j++){\n if(V[0][i].f!=V[k][j].f)continue;\n //0 1 1 0\n if(V[0][i].s.f<=V[k][j].s.f && V[k][j].s.s<=V[0][i].s.s){\n S[k]+=(V[k][j].s.s-V[k][j].s.f);\n }\n //1 0 0 1\n else if(V[k][j].s.f<=V[0][i].s.f && V[0][i].s.s<=V[k][j].s.s){\n S[k]+=(V[0][i].s.s-V[0][i].s.f);\n }\n //0 1 0 1\n else if(V[0][i].s.f<=V[k][j].s.f && V[k][j].s.f <=V[0][i].s.s){\n S[k]+=(V[0][i].s.s-V[k][j].s.f);\n }\n //1 0 1 0\n else if(V[0][i].s.f<=V[k][j].s.s && V[k][j].s.s <=V[0][i].s.s){\n S[k]+=(V[k][j].s.s-V[0][i].s.f);\n }\n }\n }\n }\n int ans=0;\n for(int i=1;i<1000;i++)ans=max(ans,S[i]);\n cout<<ans<<endl;\n/*\n for(int k=0;k<5;k++){\n for(int i=0;i<V[k].size();i++)cout<<V[k][i].f<<\" \"<<V[k][i].s.f<<\" \"<<V[k][i].s.s<<\" \"<<k<<endl;\n }*/\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3124,"score_of_the_acc":-0.003,"final_rank":3},{"submission_id":"aoj_1315_2639658","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <cassert>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n\nint N;\nconst int S = 1000;\n\nstruct Elem {\n bool in_room;\n int month, day, t;\n Elem() : in_room(false) {};\n Elem(int mo, int da, int h, int m) : month(mo), day(da), t(60*h+m) {\n in_room = true;\n }\n};\n\nint seg_val(int xl, int xr, int yl, int yr) {\n // x := user, y := goddess\n if(xr <= yl || yr <= xl) return 0;\n if(xl <= yl && yr <= xr) return yr - yl;\n if(yl <= xl && xr <= yr) return xr - xl;\n if(xl <= yl && yl <= xr) return xr - yl;\n return yr - xl;\n}\n\nint main() {\n while(cin >> N, N) {\n vector< pair<int, int> > seg[S][12][31];\n vector<Elem> es(S);\n for(int i=0; i<N; i++) {\n int month, day, h, m, id;\n char io;\n scanf(\"%02d/%02d %02d:%02d %c %03d\", &month, &day, &h, &m, &io, &id);\n month--; day--;\n if(io == 'I') {\n es[id] = Elem(month, day, h, m);\n }\n else {\n assert(es[id].month == month && es[id].day == day);\n int cur_time = 60*h + m;\n // ?????????\n seg[id][month][day].push_back(make_pair(es[id].t, cur_time));\n }\n }\n\n vector<int> sum_time(S);\n for(int id=1; id<1000; id++) {\n for(int mo=0; mo<12; mo++) {\n for(int da=0; da<31; da++) {\n for(auto x : seg[id][mo][da]) {\n for(auto y : seg[0][mo][da]) {\n int xl = x.first, xr = x.second;\n int yl = y.first, yr = y.second;\n sum_time[id] += seg_val(xl, xr, yl, yr);\n }\n }\n }\n }\n }\n cout << *max_element(sum_time.begin(), sum_time.end()) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":11992,"score_of_the_acc":-1.0454,"final_rank":16},{"submission_id":"aoj_1315_2573865","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <cstdlib>\nusing namespace std;\n\nint main(){\n\twhile(1){\n\t\tint n;\n\t\tcin >> n;\n\t\tif(n==0) break;\n\t\t\n\t\tvector<vector<int> > in(1000), out(1000);\n\t\tint idmax=0;\n\t\tfor(int i=0; i<n; i++){\n\t\t\tstring date,time,io,id;\n\t\t\tcin >> date >> time >> io >> id;\n\t\t\tint min = stoi(date.substr(0,2))*50000 +stoi(date.substr(3,2))*1440\n\t\t\t\t\t\t+stoi(time.substr(0,2))*60 +stoi(time.substr(3,2));\n\t\t\tif(io==\"I\"){\n\t\t\t\tin[stoi(id)].push_back(min);\n\t\t\t}else{\n\t\t\t\tout[stoi(id)].push_back(min);\n\t\t\t}\n\t\t\tidmax = max(idmax, stoi(id));\n\t\t}\n\t\t\n\t\tint ans=0;\n\t\tfor(int i=1; i<=idmax; i++){\n\t\t\tint sum=0;\n\t\t\tfor(int j=0; j<(int)in[0].size(); j++){\n\t\t\t\tfor(int k=0; k<(int)in[i].size(); k++){\n\t\t\t\t\tif((in[0][j]<=in[i][k] && in[i][k]<=out[0][j]) || (in[i][k]<=in[0][j] && in[0][j]<=out[i][k])){\n\t\t\t\t\t\tsum += abs(max(in[0][j], in[i][k]) -min(out[0][j], out[i][k]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = max(ans, sum);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3116,"score_of_the_acc":-0.0022,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1315_4851862\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst vector<int> convert={1440,60,1};\\nvector<int> month={0,31,28,31,30,31,30,31,31,30,31,30};\\n\\nint time(string s,string t){\\n int M=(s[0]-'0')*10+(s[1]-'0')-1;\\n int D=(s[3]-'0')*10+(s[4]-'0')-1;\\n int h=(t[0]-'0')*10+(t[1]-'0');\\n int m=(t[3]-'0')*10+(t[4]-'0');\\n return convert[0]*(month[M]+D)+convert[1]*h+convert[2]*m;\\n}\\n\\nconst int MAX_T=6e5+10,MAX_N=1010;\\nint imos[MAX_T];\\n\\nvoid solve(int n){\\n vector<string> S(n),T(n);\\n vector<char> IO(n);\\n vector<int> id(n);\\n for (int i=0;i<n;++i){\\n string ID; cin >> S[i] >> T[i] >> IO[i] >> ID;\\n id[i]=stoi(ID);\\n }\\n\\n vector<int> sum(MAX_N,0),pre(MAX_N,0);\\n for (int i=0;i<MAX_T;++i) imos[i]=0;\\n for (int i=0;i<n;++i){\\n if (id[i]) continue;\\n int t=time(S[i],T[i]);\\n if (IO[i]=='I') ++imos[t+1];\\n else --imos[t+1];\\n }\\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\\n\\n for (int i=0;i<n;++i){\\n if (!id[i]) continue;\\n int t=time(S[i],T[i]);\\n if (IO[i]=='I') pre[id[i]]=t;\\n else sum[id[i]]+=imos[t]-imos[pre[id[i]]];\\n }\\n\\n int ans=0;\\n for (int i=0;i<MAX_N;++i) ans=max(ans,sum[i]);\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n for (int i=0;i<11;++i) month[i+1]+=month[i];\\n int n;\\n while(cin >> n,n){\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5644,\n \"score_of_the_acc\": -0.3098,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1315_4851861\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define LOCAL\\n#pragma region Macros\\ntypedef long long ll;\\n#define ALL(x) (x).begin(),(x).end()\\nconst long long MOD=1000000007;\\n// const long long MOD=998244353;\\nconst int INF=1e9;\\nconst long long IINF=1e18;\\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\nconst char dir[4]={'D','R','U','L'};\\n\\ntemplate<typename T>\\nistream &operator>>(istream &is,vector<T> &v){\\n for (T &x:v) is >> x;\\n return is;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const vector<T> &v){\\n for (int i=0;i<v.size();++i){\\n os << v[i] << (i+1==v.size()?\\\"\\\": \\\" \\\");\\n }\\n return os;\\n}\\ntemplate<typename T,typename U>\\nostream &operator<<(ostream &os,const pair<T,U> &p){\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate<typename T,typename U>\\nostream &operator<<(ostream &os,const map<T,U> &m){\\n os << '{';\\n for (auto itr=m.begin();itr!=m.end();++itr){\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr!=m.end()) os << ',';\\n --itr;\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const set<T> &s){\\n os << '{';\\n for (auto itr=s.begin();itr!=s.end();++itr){\\n os << *itr;\\n if (++itr!=s.end()) os << ',';\\n --itr;\\n }\\n os << '}';\\n return os;\\n}\\n\\nvoid debug_out(){cerr << '\\\\n';}\\ntemplate<class Head,class... Tail>\\nvoid debug_out(Head&& head,Tail&&... tail){\\n cerr << head;\\n if (sizeof...(Tail)>0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) cerr << \\\" \\\";\\\\\\ncerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n';\\\\\\ncerr << \\\" \\\";\\\\\\ndebug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n\\ntemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}\\ntemplate<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}\\n\\ntemplate<class T1,class T2> inline bool chmin(T1 &a,T2 b){\\n if (a>b){a=b; return true;} return false;\\n}\\ntemplate<class T1,class T2> inline bool chmax(T1 &a,T2 b){\\n if (a<b){a=b; return true;} return false;\\n}\\n#pragma endregion\\n\\nconst vector<int> convert={1440,60,1};\\nvector<int> month={0,31,28,31,30,31,30,31,31,30,31,30};\\n\\nint time(string s,string t){\\n int M=(s[0]-'0')*10+(s[1]-'0')-1;\\n int D=(s[3]-'0')*10+(s[4]-'0')-1;\\n int h=(t[0]-'0')*10+(t[1]-'0');\\n int m=(t[3]-'0')*10+(t[4]-'0');\\n return convert[0]*(month[M]+D)+convert[1]*h+convert[2]*m;\\n}\\n\\nconst int MAX_T=6e5+10,MAX_N=1010;\\nint imos[MAX_T];\\n\\nvoid solve(int n){\\n vector<string> S(n),T(n);\\n vector<char> IO(n);\\n vector<int> id(n);\\n for (int i=0;i<n;++i){\\n string ID; cin >> S[i] >> T[i] >> IO[i] >> ID;\\n id[i]=stoi(ID);\\n }\\n\\n vector<int> sum(MAX_N,0),pre(MAX_N,0);\\n for (int i=0;i<MAX_T;++i) imos[i]=0;\\n for (int i=0;i<n;++i){\\n if (id[i]) continue;\\n int t=time(S[i],T[i]);\\n if (IO[i]=='I') ++imos[t+1];\\n else --imos[t+1];\\n }\\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\\n for (int i=0;i<MAX_T-1;++i) imos[i+1]+=imos[i];\\n\\n for (int i=0;i<n;++i){\\n if (!id[i]) continue;\\n int t=time(S[i],T[i]);\\n if (IO[i]=='I') pre[id[i]]=t;\\n else sum[id[i]]+=imos[t]-imos[pre[id[i]]];\\n }\\n\\n int ans=0;\\n for (int i=0;i<MAX_N;++i) ans=max(ans,sum[i]);\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n for (int i=0;i<11;++i) month[i+1]+=month[i];\\n int n;\\n while(cin >> n,n){\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5612,\n \"score_of_the_acc\": -0.3068,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1315_4813376\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 1020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tint n; cin >> n;\\n\\t\\tif(!n) break;\\n\\t\\tmap<int,map<int,vector<pii>>> mp;\\n\\t\\trep(i,n){\\n\\t\\t\\tint a,b,c,d,e; char f;\\n\\t\\t\\tscanf(\\\"%d/%d %d:%d %c %d\\\",&a,&b,&c,&d,&f,&e);\\n\\t\\t\\tint s = f == 'I';\\n\\t\\t\\tmp[a*31+b][c*60+d].emplace_back(s, e);\\n\\t\\t}\\n\\t\\tvector<int> t(n,0);\\n\\t\\tset<int> se;\\n\\t\\tfor(auto i : mp){\\n\\t\\t\\trep(j,1440){\\n\\t\\t\\t\\tfor(auto k : i.second[j]){\\n\\t\\t\\t\\t\\tif(k.first) se.insert(k.second);\\n\\t\\t\\t\\t\\telse se.erase(k.second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(se.count(0) == 1){\\n\\t\\t\\t\\t\\tfor(auto l : se) t[l]++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tt[0] = 0;\\n\\t\\tcout << *max_element(all(t)) << \\\"\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.0596,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1315_4773668\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nint second(string s) {\\n\\tfor (auto &i : s)i -= '0';\\n\\tint ret = s[0];\\n\\tret *= 10;\\n\\tret += s[1];\\n\\tret *= 6;\\n\\tret += s[3];\\n\\tret *= 10;\\n\\tret += s[4];\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N, N) {\\n\\t\\tmap<string, vector<int>>mp;\\n\\t\\tvector<string>a(N);\\n\\t\\tvector<string>b(N);\\n\\t\\tvector<char>c(N);\\n\\t\\tvector<string>d(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> a[i] >> b[i] >> c[i] >> d[i];\\n\\t\\t\\tmp[a[i]].push_back(i);\\n\\t\\t}\\n\\t\\tmap<string, int>score;\\n\\t\\tfor (auto i : mp) {\\n\\t\\t\\tvector<int>v(1441);\\n\\t\\t\\tfor (auto j : i.second) {\\n\\t\\t\\t\\tif (d[j] == \\\"000\\\") {\\n\\t\\t\\t\\t\\tif (c[j] == 'I') {\\n\\t\\t\\t\\t\\t\\tv[second(b[j])]++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tv[second(b[j])]--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int j = 1; j <= 1440; j++) {\\n\\t\\t\\t\\tv[j] += v[j - 1];\\n\\t\\t\\t}\\n\\t\\t\\tfor (auto j : i.second) {\\n\\t\\t\\t\\tif (d[j] != \\\"000\\\") {\\n\\t\\t\\t\\t\\tif (c[j] == 'I') {\\n\\t\\t\\t\\t\\t\\tfor (int k = second(b[j]); k <= 1440; k++) {\\n\\t\\t\\t\\t\\t\\t\\tscore[d[j]] += v[k];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tfor (int k = second(b[j]); k <= 1440; k++) {\\n\\t\\t\\t\\t\\t\\t\\tscore[d[j]] -= v[k];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (auto i : score) {\\n\\t\\t\\tans = max(ans, i.second);\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1269,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1315_4745873\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n while (1){\\n int n;\\n cin >> n;\\n if (n == 0){\\n break;\\n }\\n vector<int> M(n), D(n), h(n), m(n);\\n vector<char> e(n);\\n vector<int> p(n);\\n for (int i = 0; i < n; i++){\\n char c1, c2;\\n cin >> M[i] >> c1 >> D[i] >> h[i] >> c2 >> m[i] >> e[i] >> p[i];\\n }\\n vector<int> time(n);\\n for (int i = 0; i < n; i++){\\n time[i] = ((M[i] * 40 + D[i]) * 24 + h[i]) * 60 + m[i];\\n }\\n vector<int> t(1000, 0);\\n vector<bool> c(1000, false);\\n for (int i = 0; i < n; i++){\\n if (e[i] == 'I'){\\n c[p[i]] = true;\\n }\\n if (e[i] == 'O'){\\n c[p[i]] = false;\\n }\\n if (i < n - 1 && c[0]){\\n int dt = time[i + 1] - time[i];\\n for (int j = 1; j < 1000; j++){\\n if (c[j]){\\n t[j] += dt;\\n }\\n }\\n }\\n }\\n int ans = 0;\\n for (int j = 1; j < 1000; j++){\\n ans = max(ans, t[j]);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1315_4120552\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <functional>\\n#include <bitset>\\n\\nusing namespace std;\\nusing lint = long long int;\\nlong long int INF = 1001001001001001LL;\\nint inf = 1000000007;\\nlong long int MOD = 1000000007LL;\\ndouble PI = 3.1415926535897932;\\n\\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\\n\\n#define ALL(a) a.begin(),a.end()\\n#define RALL(a) a.rbegin(),a.rend()\\n\\n/* do your best */\\n\\n\\n// quoted from beet-aizu\\ntemplate <typename T, typename E, typename F, typename G>\\nstruct SegmentTree{\\n // using F = function<T(T, T)>\\n // using G = function<T(T, E)>\\n int n;\\n F f;\\n G g;\\n T ti;\\n vector<T> dat;\\n SegmentTree(){};\\n SegmentTree(F f,G g,T ti):f(f),g(g),ti(ti){}\\n void init(int n_){ \\n n=1;\\n while(n<n_) n<<=1;\\n dat.assign(n<<1,ti);\\n }\\n void build(const vector<T> &v){\\n int n_=v.size();\\n init(n_);\\n for(int i=0;i<n_;i++) dat[n+i]=v[i];\\n for(int i=n-1;i;i--)\\n dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);\\n }\\n void update(int k,const E &x){\\n k += n;\\n dat[k] = g(dat[k], x);\\n while(k>>=1)\\n dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]); \\n }\\n T operator [](int k) const { return dat[k+n]; }\\n T query(int a,int b) const {\\n T vl=ti,vr=ti;\\n for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {\\n if(l&1) vl=f(vl,dat[l++]);\\n if(r&1) vr=f(dat[--r],vr);\\n }\\n return f(vl,vr);\\n }\\n\\n /* TODO わからない 聞く \\n template<typename C>\\n int find(int a,int b,C &check,int k,int l,int r){\\n if(!check(dat[k])||r<=a||b<=l) return -1;\\n if(k>=n) return k-n;\\n int m=(l+r)>>1;\\n int vl=find(a,b,check,(k<<1)|0,l,m);\\n if(~vl) return vl;\\n return find(a,b,check,(k<<1)|1,m,r);\\n }\\n template<typename C>\\n int find(int a,int b,C &check){\\n return find(a,b,check,1,0,n);\\n }*/\\n \\n};\\n\\n\\n/** テンプレ\\nint main(){\\n**/\\n\\nbool solve() {\\n int n; cin >> n;\\n if(n == 0) return false;\\n vector<int> id(n);\\n vector<int> t(n);\\n vector<char> mode(n);\\n \\n for(int i = 0; i < n; i++) {\\n string a, b, c, ID; cin >> a >> b >> c >> ID;\\n // cerr << a.substr(3, 2) << \\\" \\\" << b.substr(0, 2) << \\\" \\\" << b.substr(3, 2) << endl;\\n int M = stoi(a.substr(0, 2));\\n int d = stoi(a.substr(3, 2));\\n int h = stoi(b.substr(0, 2));\\n int m = stoi(b.substr(3, 2));\\n assert(M <= 12);\\n assert(d <= 31);\\n assert(h <= 24);\\n assert(m <= 60);\\n\\n t[i] = M * 32 * 24 * 60 + d * 24 * 60 + h * 60 + m;\\n id[i] = stoi(ID);\\n mode[i] = c[0];\\n }\\n\\n vector<vector<int>> l(1000);\\n vector<vector<int>> r(1000);\\n\\n for(int i = 0; i < n; i++) {\\n if(mode[i] == 'I') {\\n l[id[i]].push_back(t[i]);\\n } else {\\n r[id[i]].push_back(t[i]);\\n }\\n }\\n \\n vector<int> dat(13 * 32 * 25 * 61, 0);\\n \\n assert(l[0].size() == r[0].size());\\n for(int j = 0; j < l[0].size(); j++) {\\n int left = l[0][j];\\n int right = r[0][j];\\n for(int i = left; i < right; i++) dat[i] = 1;\\n }\\n\\n using T = int; // type T\\n using E = int; // type E\\n auto f = [](T a, T b){ // return type T value\\n return a + b;\\n };\\n auto g = [](T a, E b){ // return type T value\\n return b; // return b;\\n };\\n T ti = 0; // identify element\\n SegmentTree<T, E, decltype(f), decltype(g)> sg(f, g, ti); // don't change\\n sg.build(dat); // 初期配列を代入\\n \\n vector<int> cnt(1000, 0);\\n for(int i = 1; i < 1000; i++) {\\n assert(l[i].size() == r[i].size());\\n for(int j = 0; j < l[i].size(); j++) {\\n int left = l[i][j];\\n int right = r[i][j];\\n cnt[i] += sg.query(left, right);\\n }\\n }\\n\\n int ma = 0;\\n for(int i = 0; i < 1000; i++) ma = max(ma, cnt[i]);\\n cout << ma << endl;\\n \\n return true;\\n}\\n\\nsigned main() {\\n \\n while(solve()) {}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 13800,\n \"score_of_the_acc\": -1.3571,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1315_4120415\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\nusing ll = long long int;\\nusing int64 = long long int;\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst int INF = 1LL << 29;\\nconst ll LONGINF = 1LL << 60;\\nconst ll MOD = 1000000007LL;\\n\\nint solve_testcase() {\\n int N; cin >> N;\\n if(N == 0) return 1;\\n\\n vector< vector< tuple<int, int, int> > > info(31 * 12);\\n for(int i=0; i<N; i++) {\\n int day = 0, time = 0, inout = 0, id = -1;\\n {\\n int m, d; scanf(\\\"%d/%d\\\", &m, &d); m--, d--;\\n day = 31 * m + d;\\n }\\n {\\n int h, m; scanf(\\\"%d:%d\\\", &h, &m);\\n time = h * 60 + m;\\n }\\n {\\n char c; scanf(\\\" %c\\\", &c);\\n inout = (c == 'I' ? 1 : 0);\\n }\\n {\\n scanf(\\\" %d\\\", &id);\\n }\\n info[day].emplace_back(time, inout, id);\\n }\\n\\n // id, 時間\\n map<int, int> rec;\\n const int MAX_TIME = 3600;\\n for(int d=0; d<31 * 12; d++) {\\n vector<bool> god(MAX_TIME);\\n\\n // 誰がいまいるかの集合\\n set<int> S;\\n \\n int ptr = 0;\\n for(int t=0; t<MAX_TIME; t++) {\\n while(ptr < info[d].size() and get<0>(info[d][ptr]) == t) {\\n int inout, id; tie(std::ignore, inout, id) = info[d][ptr];\\n if(inout == 1) S.emplace(id);\\n if(inout == 0) S.erase(id);\\n ptr++;\\n }\\n\\n god[t] = S.count(0);\\n for(auto p : S) {\\n if(p == 0) continue;\\n if(god[t]) rec[p]++;\\n }\\n }\\n }\\n\\n int ans = 0;\\n for(auto e : rec) ans = max(ans, e.second);\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\\n\\nint main() {\\n while(!solve_testcase());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.43,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1315_4120397\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint timetom(string s){\\n int h=stoi(s.substr(0,2));\\n int m=stoi(s.substr(3,2));\\n return h*60+m;\\n}\\n\\nbool solve(){\\n int n;\\n cin>>n;\\n if(n==0)return false;\\n //vector<pair<pair<int,bool>,int>> d(n);//<time,io>,id\\n vector<vector<int>> d;\\n vector<int> tm(n);\\n map<string,int> mp;\\n int godind=-1;\\n for (int i = 0; i < n; ++i) {\\n string s,t;\\n cin>>s>>t;\\n tm[i]=timetom(t);\\n char c;\\n cin>>c;\\n string id;\\n cin>>id;\\n if(mp.find(id)==mp.end()){\\n mp[id]=d.size();\\n if(id==\\\"000\\\")godind=d.size();\\n d.emplace_back(vector<int>(n+1,0));\\n }\\n if(c=='I')++d[mp[id]][i];\\n else --d[mp[id]][i];\\n }\\n for(auto &i:d){\\n for (int j = 0; j < n; ++j) {\\n i[j+1]+=i[j];\\n }\\n }\\n if(godind==-1){\\n cout<<0<<endl;\\n return true;\\n }\\n int ans=0;\\n for (int i = 0; i < d.size(); ++i) {\\n if(i==godind)continue;\\n int tans=0;\\n for (int j = 0; j < n-1; ++j) {\\n if(d[i][j]==1&&d[godind][j]==1){\\n tans+=tm[j+1]-tm[j];\\n }\\n }\\n ans=max(ans,tans);\\n }\\n cout<<ans<<endl;\\n return true;\\n}\\n\\nint main(){\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4888,\n \"score_of_the_acc\": -0.1677,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1315_3904078\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nconst int year1=372;\\nconst int day1=1440;\\nclass logdata\\n{\\n\\tpublic:\\n\\tint day;\\n\\tint date;\\n\\tint visitor;\\n\\tlogdata()\\n\\t{}\\n\\tlogdata(string m,string t,string v)\\n\\t{\\n\\t\\tvisitor=stoi(v);\\n\\t\\tint big=(m[0]-'0')*10+(m[1]-'0');\\n\\t\\tint little=(m[3]-'0')*10+(m[4]-'0');\\n\\t\\tday=(big-1)*31+little;\\n\\t\\tbig=(t[0]-'0')*10+(t[1]-'0');\\n\\t\\tlittle=(t[3]-'0')*10+(t[4]-'0');\\n\\t\\tdate=big*60+little;\\n\\t}\\n};\\nlogdata IO[1000];\\nbool inroom[1000];//誰が部屋にいるか\\nint during[1000];//goddessと一緒にいた時間\\nstring indata[4];\\n\\n//IO[index-1]からIO[index]までの経過時間を求める\\nint keika(int index)\\n{\\n\\tint diffday=IO[index].day-IO[index-1].day;\\n\\tint difftime=IO[index].date-IO[index-1].date;\\n\\treturn diffday*day1+difftime;\\n}\\n\\nint main()\\n{\\n\\tint n;\\n\\twhile(1)\\n\\t{\\n\\t\\tcin>>n;\\n\\t\\tif(n==0)\\n\\t\\t\\tbreak;\\n\\t\\tfor(int i=0;i<n;i++)\\n\\t\\t{\\n\\t\\t\\tfor(int j=0;j<4;j++)\\n\\t\\t\\t\\tcin>>indata[j];\\n\\t\\t\\tIO[i]=logdata(indata[0],indata[1],indata[3]);\\n\\t\\t\\tif(i>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(IO[i].day<IO[i-1].day)\\n\\t\\t\\t\\t\\tIO[i].day+=((IO[i-1].day-IO[i].day)/year1+1)*year1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//input end\\n\\t\\tfill(during,during+1000,0);\\n\\t\\tfill(inroom,inroom+1000,false);\\n\\t\\tfor(int i=0;i<n;i++)\\n\\t\\t{\\n\\t\\t\\t//goddessがいるなら部屋にいる人の時間を加算する\\n\\t\\t\\tif(inroom[0])\\n\\t\\t\\t{\\n\\t\\t\\t\\tint k=keika(i);\\n\\t\\t\\t\\tfor(int j=1;j<1000;j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(inroom[j])\\n\\t\\t\\t\\t\\t\\tduring[j]+=k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//部屋にいる人\\n\\t\\t\\tinroom[IO[i].visitor]^=true;//反転\\n\\t\\t}\\n\\t\\tsort(during,during+1000);\\n\\t\\treverse(during,during+1000);\\n\\t\\tcout<<during[0]<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1315_3695170\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n \\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e16;\\nconst ll MOD = 1e9 + 7;\\n \\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n \\nll n;\\nll sum[600][60*30];\\nll ans[600];\\n \\nvoid solve(){\\n // ll res = 0;\\n rep(i,600)rep(j,60*30-1)sum[i][j+1] += sum[i][j];\\n FOR(i,1,600){\\n ll cnt = 0;\\n rep(j,60*30){\\n if((sum[i][j] > 0) && (sum[0][j] > 0))cnt++;\\n // else cnt = 0;\\n // res = max(cnt,res);\\n }\\n\\t\\tans[i] += cnt;\\n }\\n // return res;\\n}\\n \\nvoid init(){\\n rep(i,600)rep(j,60*30)sum[i][j] = 0;\\n}\\n \\nll calc(string s){\\n return ((s[0] - '0')*10+(s[1] - '0'))*60 + (s[3] - '0')*10+(s[4] - '0');\\n}\\n \\nint main(){\\n while(cin >> n && n){\\n\\t\\tfill(ans,ans+600,0);\\n string pre = \\\"\\\";\\n ll aans = 0;\\n rep(i,n){\\n string s,hm,e;\\n ll p;\\n cin >> s >> hm >> e >> p;\\n if(pre != s){\\n pre = s;\\n\\t\\t\\t\\tsolve();\\n // ans = max(ans,solve());\\n\\t\\t\\t\\t// cout << \\\"!!\\\" << pre << \\\" \\\" << ans << endl;\\n init();\\n }\\n ll num = calc(hm);\\n // cout << p << endl;\\n if(e == \\\"I\\\")sum[p][num] = 1;\\n else sum[p][num] = -1;\\n }\\n // ans = max(ans,solve());\\n\\t\\tsolve();\\n\\t\\tinit();\\n\\t\\tFOR(i,1,600)aans = max(aans,ans[i]);\\n\\t\\t// cout << \\\"!!\\\" << pre << \\\" \\\" << ans << endl;\\n cout << aans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 11500,\n \"score_of_the_acc\": -1.7852,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1315_3595576\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\n\\n\\nint timesum[1001];\\nint entry[1001];\\nint main(void) {\\n // cin.tie(0); ios::sync_with_stdio(false);\\n int n;\\n while(cin >> n,n){\\n vector<int> M(n),D(n),h(n),m(n);\\n vector<string> e(n);\\n vector<int> p(n);\\n char c;\\n for(int i = 0; i < n;i++){\\n cin >> M[i] >> c >> D[i] >> h[i] >> c >> m[i] >> e[i] >> p[i];\\n }\\n fill(timesum,timesum+1001,0);\\n fill(entry,entry+1001,-1);\\n \\n for(int i = 0; i < n;i++){\\n \\n if(e[i] == \\\"I\\\"){\\n entry[p[i]] = h[i] * 60 + m[i];\\n }else{\\n int time = h[i] * 60 + m[i];\\n \\n if(p[i] == 0){\\n for(int j = 1; j <= 1000; j++){\\n if(entry[j] == -1) continue;\\n timesum[j] += time-max(entry[0],entry[j]);\\n }\\n \\n }else{\\n if(entry[0] != -1 && entry[p[i]] != -1){\\n timesum[p[i]] += time - max(entry[0],entry[p[i]]);\\n }\\n }\\n entry[p[i]] = -1;\\n }\\n }\\n cout << *max_element(timesum, timesum+101) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.0108,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1315_3372181\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\nusing namespace std;\\nint n;\\nint f()\\n{\\n\\tint a,b;scanf(\\\"%d:%d\\\",&a,&b);return a*60+b;\\n}\\nmain()\\n{\\n\\twhile(cin>>n,n)\\n\\t{\\n\\t\\tint a[1000]={};\\n\\t\\tint t[1000]={};\\n\\t\\tint ans=0;\\n\\t\\tbool flag=false;\\n\\t\\tfor(;n--;)\\n\\t\\t{\\n\\t\\t\\tstring s;cin>>s;\\n\\t\\t\\tint X=f();\\n\\t\\t\\tstring io;int id;cin>>io>>id;\\n\\t\\t\\tif(io==\\\"I\\\")\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(id)t[id]=X;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j=1;j<1000;j++)if(t[j])t[j]=X;\\n\\t\\t\\t\\t\\tflag=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(id)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(flag)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\ta[id]+=X-t[id];\\n\\t\\t\\t\\t\\t\\tans=max(ans,a[id]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tt[id]=0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j=1;j<1000;j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(t[j])\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\ta[j]+=X-t[j];\\n\\t\\t\\t\\t\\t\\t\\tans=max(ans,a[j]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tflag=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.0097,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1315_3314957\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint convert(char x,char y){\\n return (x-'0')*10+y-'0';\\n}\\nint solve(int n){\\n vector<string> date(n);\\n vector<int> t(n);\\n vector<char> op(n);\\n vector<string> id(n);\\n for(int i=0;i<n;i++){\\n string buf;\\n cin>>date[i]>>buf>>op[i]>>id[i];\\n t[i]=convert(buf[0],buf[1])*60+convert(buf[3],buf[4]);\\n }\\n\\n map<string,int> res;\\n map<string,vector<int>> events;\\n for(int i=0;i<n;i++) events[date[i]].push_back(i);\\n\\n for(auto &kvp:events){\\n auto event=kvp.second;\\n stack<tuple<string,int,int>> outer;\\n map<string,int> inner;\\n int gin=0;\\n for(int idx:event){\\n if(id[idx]==\\\"000\\\"){\\n if(op[idx]=='I'){\\n gin=t[idx];\\n }\\n else{\\n for(auto &e:inner){\\n res[e.first]+=t[idx]-max(gin,e.second);\\n }\\n while(!outer.empty()){\\n auto tmp=outer.top(); outer.pop();\\n res[get<0>(tmp)]+=max(get<2>(tmp)-max(get<1>(tmp),gin),0);\\n }\\n }\\n }\\n else{\\n if(op[idx]=='I'){\\n inner[id[idx]]=t[idx];\\n }\\n else{\\n outer.push(make_tuple(id[idx],inner[id[idx]],t[idx]));\\n inner.erase(id[idx]);\\n }\\n }\\n } \\n }\\n int ret=0;\\n for(auto &e:res) if(e.first!=\\\"000\\\") ret=max(ret,e.second);\\n return ret;\\n}\\n \\nint main(){\\n int n;\\n while(cin>>n,n){\\n cout<<solve(n)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.0224,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1315_3274069\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\n#define REP(i,n) for (int i=0; i<n; i++)\\n\\nint imos[1003][1500], staytime[1003];\\n\\nint main(){\\n while(1) {\\n int n, mon, d, h, min, p, prevdate = 0;\\n char e;\\n cin >> n;\\n\\n if (n==0){\\n break;\\n }\\n\\n REP(i,1000){\\n REP(j,1500){\\n imos[i][j] = 0;\\n }\\n staytime[i] = 0;\\n }\\n\\n REP(i, n) {\\n scanf(\\\"%d/%d %d:%d %c %d\\\\n\\\", &mon, &d, &h, &min, &e, &p);\\n// printf(\\\"%d/%d %d:%d %c %d\\\\n\\\", mon, d, h, min, e, p);\\n if (mon * 12 + d != prevdate) {\\n// printf(\\\"prevdate: %d\\\\n\\\", prevdate);\\n REP(j, 1000) {\\n REP(k, 1499){\\n imos[j][k+1] += imos[j][k];\\n }\\n }\\n REP(k, 1500){\\n if (imos[0][k]>0){\\n REP(j,1000){\\n if (imos[j][k]>0){\\n staytime[j] += 1;\\n }\\n }\\n }\\n }\\n REP(j,1000){\\n REP(k,1500){\\n imos[j][k] = 0;\\n }\\n }\\n prevdate = mon * 12 + d;\\n }\\n if (e == 'I') {\\n imos[p][60 * h + min] += 1;\\n } else {\\n imos[p][60 * h + min] -= 1;\\n }\\n }\\n\\n REP(j, 1000) {\\n REP(k, 1499){\\n imos[j][k+1] += imos[j][k];\\n }\\n }\\n REP(k, 1500){\\n if (imos[0][k]>0){\\n REP(j,1000){\\n if (imos[j][k]>0){\\n staytime[j] += 1;\\n }\\n }\\n }\\n }\\n\\n int ans=0;\\n for (int i=1; i<1000; i++){ // 直す\\n ans = max(ans, staytime[i]);\\n// printf(\\\"staytime[%d] = %d\\\\n\\\", i, staytime[i]);\\n }\\n\\n cout << ans << endl;\\n\\n }\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 8984,\n \"score_of_the_acc\": -1.4217,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1315_3252243\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<cctype>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define MOD 1000000007\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define loop(i,a,n) for(i=a;i<(n);i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vp;\\n\\nint gcd(int a, int b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\nint lcm(int a, int b){\\n return a*b/gcd(a,b);\\n}\\n\\nint toi(string s){\\n int ret = 0;\\n rep(i,s.size()){\\n ret *= 10;\\n ret += s[i]-'0';\\n }\\n return ret;\\n}\\n\\n#define M 60*24+3\\n\\nint main(void) {\\n int i,j;\\n int n;\\n int days[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};\\n rep(i,12)days[i+1] += days[i];\\n while(cin >> n, n){\\n vector<vector<vp> > v(365,vector<vp>(1000));\\n rep(i,n){\\n string a,b,io,id;\\n cin >> a >> b >> io >> id;\\n int day = days[toi(a.substr(0,2))-1] + toi(a.substr(3,2));\\n int t = toi(b.substr(0,2))*60 + toi(b.substr(3,2));\\n v[day][toi(id)].push_back(pii(t,int(io==\\\"O\\\")));\\n }\\n vi sum(1000,0);\\n rep(i,365){\\n int god[M] = {};\\n rep(k,v[i][0].size()){\\n if(v[i][0][k].second) god[v[i][0][k].first]--;\\n else god[v[i][0][k].first]++;\\n }\\n rep(k,M-1)god[k+1] += god[k];\\n loop(j,1,1000)if(v[i][j].size()){\\n int t[M] = {};\\n rep(k,v[i][j].size()){\\n if(v[i][j][k].second) t[v[i][j][k].first]--;\\n else t[v[i][j][k].first]++;\\n }\\n rep(k,M-1)t[k+1] += t[k];\\n rep(k,M)if(god[k]&&t[k])sum[j]++;\\n }\\n }\\n sort(all(sum));\\n cout << sum[999] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 11476,\n \"score_of_the_acc\": -1.3258,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1315_3219599\",\n \"code_snippet\": \"//include\\n//------------------------------------------\\n#include <vector>\\n#include <list>\\n#include <map>\\n#include <climits>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <bitset>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\n#include <ctime>\\n#include <queue>\\n#include <random>\\n#include <cctype>\\n#include <complex>\\n#include <regex>\\n\\nusing namespace std;\\n\\n#define C_MAX(a, b) ((a)>(b)?(a):(b))\\n#define SHOW_VECTOR(v) {std::cerr << #v << \\\"\\\\t:\\\";for(const auto& xxx : v){std::cerr << xxx << \\\" \\\";}std::cerr << \\\"\\\\n\\\";}\\n#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << \\\" \\\" << xxx.second << \\\"\\\\n\\\";}}\\n\\nstruct Data {\\n int time;\\n string which;\\n string id;\\n};\\n\\nstruct Per {\\n int start;\\n int end;\\n string id;\\n};\\n\\nint getTime(string s) {\\n int hour = stoi(s.substr(0, 2));\\n int minute = stoi(s.substr(3, 2));\\n int time = hour * 60 + minute;\\n return time;\\n}\\n\\nint main() {\\n\\n while (true) {\\n\\n int N;\\n cin >> N;\\n\\n if (N == 0) break;\\n\\n string pre = \\\"\\\";\\n vector<vector<Data>> datas;\\n for (int i = 0; i < N; i++) {\\n string date, ti, which, id;\\n cin >> date >> ti >> which >> id;\\n int time = getTime(ti);\\n if (i == 0) {\\n datas.push_back(vector<Data>());\\n datas.back().push_back((Data) {time, which, id});\\n pre = date;\\n continue;\\n }\\n if (pre == date) datas.back().push_back((Data) {time, which, id});\\n else {\\n datas.push_back(vector<Data>());\\n datas.back().push_back((Data) {time, which, id});\\n pre = date;\\n }\\n }\\n\\n map<string, int> M;\\n for (int i = 0; i < datas.size(); i++) {\\n vector<Per> god;\\n vector<Per> other;\\n int have = -1;\\n for (int j = 0; j < datas[i].size(); j++) {\\n auto data = datas[i][j];\\n if (data.id == \\\"000\\\") {\\n if (have == -1) have = data.time;\\n else {\\n god.push_back((Per) {have, data.time, \\\"000\\\"});\\n have = -1;\\n }\\n }\\n }\\n map<string, int> has;\\n for (int j = 0; j < datas[i].size(); j++) has[datas[i][j].id] = -1;\\n for (int j = 0; j < datas[i].size(); j++) {\\n auto data = datas[i][j];\\n if (data.id != \\\"000\\\") {\\n if (has[data.id] == -1) has[data.id] = data.time;\\n else {\\n other.push_back((Per) {has[data.id], data.time, data.id});\\n has[data.id] = -1;\\n }\\n }\\n }\\n for (auto go: god) {\\n for (auto ot: other) {\\n int minV = max(go.start, ot.start);\\n int maxV = min(go.end, ot.end);\\n int d = maxV - minV;\\n M[ot.id] += max(0, d);\\n }\\n }\\n }\\n\\n int ansV = 0;\\n for (auto x: M) ansV = max(ansV, x.second);\\n\\n cout << ansV << endl;\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.0235,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1315_3048256\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\nusing namespace std;\\nconst int INF = (1e9);\\n\\nint main(){\\n int N;\\n const string g = \\\"000\\\";\\n while(cin >> N, N){\\n string d, t, e, id, D;\\n map<string, int> T, I, O;\\n for(int i = 0; i < N; ++i){\\n cin >> d >> t >> e >> id;\\n if(D != d){\\n D = d;\\n for(auto itr = I.begin(); itr != I.end(); ++itr) itr->second = INF;\\n for(auto itr = O.begin(); itr != O.end(); ++itr) itr->second = -1;\\n }\\n int m = stoi(t.substr(0,2))*60 + stoi(t.substr(3,2));\\n if(e == \\\"I\\\"){\\n I[id] = m;\\n O[id] = INF;\\n }else{\\n O[id] = m;\\n if(id != g && O[g] > m){\\n T[id] += max(0, m - max(I[g],I[id]));\\n }else if(id == g){\\n for(auto itr = O.begin(); itr != O.end(); ++itr){\\n id = itr->first;\\n int o = itr->second;\\n if(o > m){\\n T[id] += max(0,m - max(I[id],I[g]));\\n }\\n }\\n }\\n }\\n }\\n int ans = 0;\\n for(auto itr = T.begin(); itr != T.end(); ++itr){\\n if(itr->first == g) continue;\\n //cout << itr->first << \\\" \\\" << itr->second << endl;\\n ans = max(ans, itr->second);\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.0056,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1315_2737477\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<stdlib.h>\\n#include<string>\\n#define f first\\n#define s second\\nusing namespace std;\\n \\nint T(string s){\\n int time=0;\\n string s1=s.substr(0,2);\\n string s2=s.substr(3,2);\\n time+=(60)*atoi(s1.c_str());\\n time+=atoi(s2.c_str());\\n return time;\\n}\\n \\nint main()\\n{\\n int N,n;\\n string s1,s2;\\n char c;\\n \\n while(1){\\n cin>>N;\\n if(N==0)break;\\n int S[1000]={};\\n vector<vector<pair<string,pair<int,int> > > > V(1000);\\n for(int i=0;i<N;i++){\\n cin>>s1>>s2>>c>>n;\\n if(c=='I')S[n]=T(s2);\\n else {\\n V[n].push_back(make_pair(s1,make_pair(S[n],T(s2))));\\n S[n]=0;\\n }\\n }\\n for(int i=0;i<1000;i++)S[i]=0;\\n for(int k=1;k<1000;k++){\\n if(V[k].empty())continue;\\n for(int i=0;i<V[0].size();i++){\\n for(int j=0;j<V[k].size();j++){\\n if(V[0][i].f!=V[k][j].f)continue;\\n //0 1 1 0\\n if(V[0][i].s.f<=V[k][j].s.f && V[k][j].s.s<=V[0][i].s.s){\\n S[k]+=(V[k][j].s.s-V[k][j].s.f);\\n }\\n //1 0 0 1\\n else if(V[k][j].s.f<=V[0][i].s.f && V[0][i].s.s<=V[k][j].s.s){\\n S[k]+=(V[0][i].s.s-V[0][i].s.f);\\n }\\n //0 1 0 1\\n else if(V[0][i].s.f<=V[k][j].s.f && V[k][j].s.f <=V[0][i].s.s){\\n S[k]+=(V[0][i].s.s-V[k][j].s.f);\\n }\\n //1 0 1 0\\n else if(V[0][i].s.f<=V[k][j].s.s && V[k][j].s.s <=V[0][i].s.s){\\n S[k]+=(V[k][j].s.s-V[0][i].s.f);\\n }\\n }\\n }\\n }\\n int ans=0;\\n for(int i=1;i<1000;i++)ans=max(ans,S[i]);\\n cout<<ans<<endl;\\n/*\\n for(int k=0;k<5;k++){\\n for(int i=0;i<V[k].size();i++)cout<<V[k][i].f<<\\\" \\\"<<V[k][i].s.f<<\\\" \\\"<<V[k][i].s.s<<\\\" \\\"<<k<<endl;\\n }*/\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.003,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1315_2639658\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <cassert>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n\\nint N;\\nconst int S = 1000;\\n\\nstruct Elem {\\n bool in_room;\\n int month, day, t;\\n Elem() : in_room(false) {};\\n Elem(int mo, int da, int h, int m) : month(mo), day(da), t(60*h+m) {\\n in_room = true;\\n }\\n};\\n\\nint seg_val(int xl, int xr, int yl, int yr) {\\n // x := user, y := goddess\\n if(xr <= yl || yr <= xl) return 0;\\n if(xl <= yl && yr <= xr) return yr - yl;\\n if(yl <= xl && xr <= yr) return xr - xl;\\n if(xl <= yl && yl <= xr) return xr - yl;\\n return yr - xl;\\n}\\n\\nint main() {\\n while(cin >> N, N) {\\n vector< pair<int, int> > seg[S][12][31];\\n vector<Elem> es(S);\\n for(int i=0; i<N; i++) {\\n int month, day, h, m, id;\\n char io;\\n scanf(\\\"%02d/%02d %02d:%02d %c %03d\\\", &month, &day, &h, &m, &io, &id);\\n month--; day--;\\n if(io == 'I') {\\n es[id] = Elem(month, day, h, m);\\n }\\n else {\\n assert(es[id].month == month && es[id].day == day);\\n int cur_time = 60*h + m;\\n // ?????????\\n seg[id][month][day].push_back(make_pair(es[id].t, cur_time));\\n }\\n }\\n\\n vector<int> sum_time(S);\\n for(int id=1; id<1000; id++) {\\n for(int mo=0; mo<12; mo++) {\\n for(int da=0; da<31; da++) {\\n for(auto x : seg[id][mo][da]) {\\n for(auto y : seg[0][mo][da]) {\\n int xl = x.first, xr = x.second;\\n int yl = y.first, yr = y.second;\\n sum_time[id] += seg_val(xl, xr, yl, yr);\\n }\\n }\\n }\\n }\\n }\\n cout << *max_element(sum_time.begin(), sum_time.end()) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 11992,\n \"score_of_the_acc\": -1.0454,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1315_2573865\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <cstdlib>\\nusing namespace std;\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\tif(n==0) break;\\n\\t\\t\\n\\t\\tvector<vector<int> > in(1000), out(1000);\\n\\t\\tint idmax=0;\\n\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\tstring date,time,io,id;\\n\\t\\t\\tcin >> date >> time >> io >> id;\\n\\t\\t\\tint min = stoi(date.substr(0,2))*50000 +stoi(date.substr(3,2))*1440\\n\\t\\t\\t\\t\\t\\t+stoi(time.substr(0,2))*60 +stoi(time.substr(3,2));\\n\\t\\t\\tif(io==\\\"I\\\"){\\n\\t\\t\\t\\tin[stoi(id)].push_back(min);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tout[stoi(id)].push_back(min);\\n\\t\\t\\t}\\n\\t\\t\\tidmax = max(idmax, stoi(id));\\n\\t\\t}\\n\\t\\t\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=1; i<=idmax; i++){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\tfor(int j=0; j<(int)in[0].size(); j++){\\n\\t\\t\\t\\tfor(int k=0; k<(int)in[i].size(); k++){\\n\\t\\t\\t\\t\\tif((in[0][j]<=in[i][k] && in[i][k]<=out[0][j]) || (in[i][k]<=in[0][j] && in[0][j]<=out[i][k])){\\n\\t\\t\\t\\t\\t\\tsum += abs(max(in[0][j], in[i][k]) -min(out[0][j], out[i][k]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans = max(ans, sum);\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.0022,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":764,"cells":{"group_id":{"kind":"string","value":"aoj_1313_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nIntersection of Two Prisms\nSuppose that\nP\n1\nis an infinite-height prism whose axis is parallel to the\nz\n-axis, and\nP\n2\nis also an infinite-height prism whose axis is parallel to the\ny\n-axis.\nP\n1\nis defined by the polygon\nC\n1\nwhich is the cross section of\nP\n1\nand the\nxy\n-plane, and\nP\n2\nis also defined by the polygon\nC\n2\nwhich is the cross section of\nP\n2\nand the\nx\nz-plane.\nFigure I.1 shows two cross sections which appear as the first dataset in the sample input, and\nFigure I.2 shows the relationship between the prisms and their cross sections.\nFigure I.1: Cross sections of Prisms\nFigure I.2: Prisms and their cross sections\nFigure I.3: Intersection of two prisms\nFigure I.3 shows the intersection of two prisms in Figure I.2, namely,\nP\n1\nand\nP\n2\n.\nWrite a program which calculates the volume of the intersection of two prisms.\nInput\nThe input is a sequence of datasets. The number of datasets is less than 200.\nEach dataset is formatted as follows.\nm n\nx\n11\ny\n11\nx\n12\ny\n12\n.\n.\n.\nx\n1\nm\ny\n1\nm\nx\n21\nz\n21\nx\n22\nz\n22\n.\n.\n.\nx\n2\nn\nz\n2\nn\nm\nand\nn\nare integers (3 ≤\nm\n≤ 100, 3 ≤\nn\n≤ 100) which represent the numbers of the vertices of the polygons,\nC\n1\nand\nC\n2\n, respectively.\nx\n1\ni\n,\ny\n1\ni\n,\nx\n2\nj\nand\nz\n2\nj\nare integers between -100 and 100, inclusive. (\nx\n1\ni\n,\ny\n1\ni\n) and (\nx\n2\nj\n,\nz\n2\nj\n) mean the\ni\n-th and\nj\n-th vertices' positions of\nC\n1\nand\nC\n2\nrespectively.\nThe sequences of these vertex positions are given in the counterclockwise order either on the\nxy\n-plane or the\nxz\n-plane as in Figure I.1.\nYou may assume that all the polygons are\nconvex\n, that is, all the interior angles of the polygons are less than 180 degrees. You may also assume that all the polygons are\nsimple\n, that is, each polygon's boundary does not cross nor touch itself.\nThe end of the input is indicated by a line containing two zeros.\nOutput\nFor each dataset, output the volume of the intersection of the two prisms,\nP\n1\nand\nP\n2\n, with a decimal representation in a line.\nNone of the output values may have an error greater than 0.001. The output should not contain any other extra characters.\nSample Input\n4 3\n7 2\n3 3\n0 2\n3 1\n4 2\n0 1\n8 1\n4 4\n30 2\n30 12\n2 12\n2 2\n15 2\n30 8\n13 14\n2 8\n8 5\n13 5\n21 7\n21 9\n18 15\n11 15\n6 10\n6 8\n8 5\n10 12\n5 9\n15 6\n20 10\n18 12\n3 3\n5 5\n10 3\n10 10\n20 8\n10 15\n10 8\n4 4\n-98 99\n-99 -99\n99 -98\n99 97\n-99 99\n-98 -98\n99 -99\n96 99\n0 0\nOutput for the Sample Input\n4.708333333333333\n1680.0000000000005\n491.1500000000007\n0.0\n7600258.4847715655"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1313_6066782","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\n#define double long double\n\nconst double eps = 1e-9;\n\n// Geometry Library\n// written by okuraofvegetable\n\n#define pb push_back\n#define DOUBLE_INF 1e50\n#define Points vector<Point>\n\n#define EQ(a, b) (abs((a) - (b)) < eps)\n#define GT(a, b) ((a) > (b))\n#define GE(a, b) (GT(a, b) || EQ(a, b))\n#define LT(a, b) ((a) < (b))\n#define LE(a, b) (LT(a, b) || EQ(a, b))\n\ninline double add(double a, double b) {\n if (abs(a + b) < eps * (abs(a) + abs(b))) return 0;\n return a + b;\n}\n\n// --------------------- Point -----------------------\n\n#define Vector Point\nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\n Point operator+(Point p) { return Point(add(x, p.x), add(y, p.y)); }\n Point operator-(Point p) { return Point(add(x, -p.x), add(y, -p.y)); }\n Point operator*(double d) { return Point(x * d, y * d); }\n Point operator/(double d) { return Point(x / d, y / d); }\n double dot(Point p) { return add(x * p.x, y * p.y); }\n double det(Point p) { return add(x * p.y, -y * p.x); }\n double norm() { return sqrt(x * x + y * y); }\n double norm2() { return x * x + y * y; }\n double dist(Point p) { return ((*this) - p).norm(); }\n double dist2(Point p) { return sq(x - p.x) + sq(y - p.y); }\n double arg() { return atan2(y, x); } // [-PI,PI]\n double arg(Vector v) { return v.arg() - arg(); } // henkaku\n double angle(Vector v) { // [0,PI]\n return acos(cos(arg(v)));\n }\n Vector normalize() { return (*this) * (1.0 / norm()); }\n Point vert() { return Point(y, -x); }\n\n // Signed area of triange (0,0) (x,y) (p.x,p.y)\n double area(Point p) { return (x * p.y - p.x * y) / 2.0; }\n friend istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }\n friend ostream &operator<<(ostream &os, const Point &p) {\n return os << '(' << p.x << ',' << p.y << ')';\n }\n};\n\nPoint divide_rate(Point a, Point b, double A, double B) {\n assert(!EQ(A + B, 0.0));\n return (a * B + b * A) * (1.0 / (A + B));\n}\n\nVector polar(double len, double arg) {\n return Vector(cos(arg) * len, sin(arg) * len);\n}\n\n// Direction a -> b -> c\n// verified AOJ CGL_1_C\nenum { COUNTER_CLOCKWISE, CLOCKWISE, ONLINE_BACK, ONLINE_FRONT, ON_SEGMENT };\nint ccw(Point a, Point b, Point c) {\n Vector p = b - a;\n Vector q = c - a;\n if (p.det(q) > 0.0) return COUNTER_CLOCKWISE; // counter clockwise\n if (p.det(q) < 0.0) return CLOCKWISE; // clockwise\n if (p.dot(q) < 0.0) return ONLINE_BACK; // c--a--b online_back\n if (p.norm() < q.norm()) return ONLINE_FRONT; // a--b--c online_front\n return ON_SEGMENT; // a--c--b on_segment\n}\n\n// --------------------- Line ------------------------\nstruct Line {\n Point a, b;\n Line() {}\n Line(Point a, Point b) : a(a), b(b) {}\n bool on(Point q) { return EQ((a - q).det(b - q), 0.0); }\n // following 2 functions verified AOJ CGL_2_A\n bool is_parallel(Line l) { return EQ((a - b).det(l.a - l.b), 0.0); }\n bool is_orthogonal(Line l) { return EQ((a - b).dot(l.a - l.b), 0.0); }\n Point intersection(Line l) {\n assert(!is_parallel(l));\n return a + (b - a) * ((l.b - l.a).det(l.a - a) / (l.b - l.a).det(b - a));\n }\n // Projection of p to this line\n // verified AOJ CGL_1_A\n Point projection(Point p) {\n return (b - a) * ((b - a).dot(p - a) / (b - a).norm2()) + a;\n }\n double distance(Point p) {\n Point q = projection(p);\n return p.dist(q);\n }\n // Reflection point of p onto this line\n // verified AOJ CGL_1_B\n Point refl(Point p) {\n Point proj = projection(p);\n return p + ((proj - p) * 2.0);\n }\n bool left(Point p) {\n if ((p - a).det(b - a) > 0.0)\n return true;\n else\n return false;\n }\n friend istream &operator>>(istream &is, Line &l) { return is >> l.a >> l.b; }\n friend ostream &operator<<(ostream &os, const Line &l) {\n return os << l.a << \" -> \" << l.b;\n }\n};\n\n// ------------------- Segment ----------------------\nstruct Segment {\n Point a, b;\n Segment() {}\n Segment(Point a, Point b) : a(a), b(b) {}\n Line line() { return Line(a, b); }\n bool on(Point q) {\n return (EQ((a - q).det(b - q), 0.0) && LE((a - q).dot(b - q), 0.0));\n }\n // verified AOJ CGL_2_B\n bool is_intersect(Segment s) {\n if (line().is_parallel(s.line())) {\n if (on(s.a) || on(s.b)) return true;\n if (s.on(a) || s.on(b)) return true;\n return false;\n }\n Point p = line().intersection(s.line());\n if (on(p) && s.on(p))\n return true;\n else\n return false;\n }\n bool is_intersect(Line l) {\n if (line().is_parallel(l)) {\n if (l.on(a) || l.on(b))\n return true;\n else\n return false;\n }\n Point p = line().intersection(l);\n if (on(p))\n return true;\n else\n return false;\n }\n // following 2 distance functions are verified at AOJ CGL_2_D\n double distance(Point p) {\n double res = DOUBLE_INF;\n Point q = line().projection(p);\n if (on(q)) res = min(res, p.dist(q));\n res = min(res, min(p.dist(a), p.dist(b)));\n return res;\n }\n double distance(Segment s) {\n if (is_intersect(s)) return 0.0;\n double res = DOUBLE_INF;\n res = min(res, s.distance(a));\n res = min(res, s.distance(b));\n res = min(res, this->distance(s.a));\n res = min(res, this->distance(s.b));\n return res;\n }\n friend istream &operator>>(istream &is, Segment &s) {\n return is >> s.a >> s.b;\n }\n friend ostream &operator<<(ostream &os, const Segment &s) {\n return os << s.a << \" -> \" << s.b;\n }\n};\n\ntypedef vector<Point> Polygon;\n\nbool solve() {\n int m, n;\n cin >> m >> n;\n if (n == 0 && m == 0) return false;\n Polygon a(m), b(n);\n cin >> a >> b;\n\n double a_x_max = -200, b_x_max = -200;\n double a_x_min = 200, b_x_min = 200;\n\n for (int i = 0; i < m; i++) {\n chmax(a_x_max, a[i].x);\n chmin(a_x_min, a[i].x);\n }\n\n for (int i = 0; i < n; i++) {\n chmax(b_x_max, b[i].x);\n chmin(b_x_min, b[i].x);\n }\n\n // if (a_x_max - eps < b_x_min || b_x_max - eps < a_x_min) {\n // cout << 0.0 << endl;\n // return true;\n // }\n\n auto intersection_length = [&](const Polygon &pol, const Line &l) {\n vector<Point> ps;\n for (int i = 0; i < pol.size(); i++) {\n Segment seg(pol[i], pol[(i + 1) % pol.size()]);\n if (seg.a.x < l.a.x && seg.b.x < l.a.x) continue;\n if (seg.a.x > l.a.x && seg.b.x > l.a.x) continue;\n // if (seg.line().is_parallel(l) && EQ(pol[i].x, l.a.x)) return -1.0;\n if (seg.line().is_parallel(l)) continue;\n if (!seg.is_intersect(l)) continue;\n Point inter = seg.line().intersection(l);\n bool is_new = true;\n for (auto &p : ps) {\n if ((p - inter).norm() < eps) is_new = false;\n }\n if (is_new) ps.push_back(inter);\n }\n assert(ps.size() <= 2);\n dmp(ps);\n if (ps.size() == 2) return (ps[0] - ps[1]).norm();\n return (double)0.0;\n };\n\n auto f = [&](double x) {\n // cerr << fixed << setprecision(20) << x << endl;\n Line l(Point(x, 0), Point(x, 1));\n auto len_a = intersection_length(a, l);\n if (EQ(len_a, 0.0)) return (double)0.0;\n auto len_b = intersection_length(b, l);\n if (EQ(len_b, 0.0)) return (double)0.0;\n dmp(x, len_a, len_b);\n return len_a * len_b;\n };\n\n double ans = 0.0;\n double s = -100, step = 1.0;\n while (s + step <= 105) {\n double mid = s + step / 2.0;\n if (a_x_min <= mid && mid <= a_x_max && b_x_min <= mid && mid <= b_x_max) {\n double p = f(s), q = f(mid), r = f(s + step);\n ans += (p + 4.0 * q + r) * step / 6.0;\n }\n s += step;\n }\n cout << ans << endl;\n\n return true;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n while (solve()) {}\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.9988,"final_rank":13},{"submission_id":"aoj_1313_6066758","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\n#define double long double\n\nconst double eps = 1e-9;\n\n// Geometry Library\n// written by okuraofvegetable\n\n#define pb push_back\n#define DOUBLE_INF 1e50\n#define Points vector<Point>\n\n#define EQ(a, b) (abs((a) - (b)) < eps)\n#define GT(a, b) ((a) > (b))\n#define GE(a, b) (GT(a, b) || EQ(a, b))\n#define LT(a, b) ((a) < (b))\n#define LE(a, b) (LT(a, b) || EQ(a, b))\n\ninline double add(double a, double b) {\n if (abs(a + b) < eps * (abs(a) + abs(b))) return 0;\n return a + b;\n}\n\n// --------------------- Point -----------------------\n\n#define Vector Point\nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\n Point operator+(Point p) { return Point(add(x, p.x), add(y, p.y)); }\n Point operator-(Point p) { return Point(add(x, -p.x), add(y, -p.y)); }\n Point operator*(double d) { return Point(x * d, y * d); }\n Point operator/(double d) { return Point(x / d, y / d); }\n double dot(Point p) { return add(x * p.x, y * p.y); }\n double det(Point p) { return add(x * p.y, -y * p.x); }\n double norm() { return sqrt(x * x + y * y); }\n double norm2() { return x * x + y * y; }\n double dist(Point p) { return ((*this) - p).norm(); }\n double dist2(Point p) { return sq(x - p.x) + sq(y - p.y); }\n double arg() { return atan2(y, x); } // [-PI,PI]\n double arg(Vector v) { return v.arg() - arg(); } // henkaku\n double angle(Vector v) { // [0,PI]\n return acos(cos(arg(v)));\n }\n Vector normalize() { return (*this) * (1.0 / norm()); }\n Point vert() { return Point(y, -x); }\n\n // Signed area of triange (0,0) (x,y) (p.x,p.y)\n double area(Point p) { return (x * p.y - p.x * y) / 2.0; }\n friend istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }\n friend ostream &operator<<(ostream &os, const Point &p) {\n return os << '(' << p.x << ',' << p.y << ')';\n }\n};\n\nPoint divide_rate(Point a, Point b, double A, double B) {\n assert(!EQ(A + B, 0.0));\n return (a * B + b * A) * (1.0 / (A + B));\n}\n\nVector polar(double len, double arg) {\n return Vector(cos(arg) * len, sin(arg) * len);\n}\n\n// Direction a -> b -> c\n// verified AOJ CGL_1_C\nenum { COUNTER_CLOCKWISE, CLOCKWISE, ONLINE_BACK, ONLINE_FRONT, ON_SEGMENT };\nint ccw(Point a, Point b, Point c) {\n Vector p = b - a;\n Vector q = c - a;\n if (p.det(q) > 0.0) return COUNTER_CLOCKWISE; // counter clockwise\n if (p.det(q) < 0.0) return CLOCKWISE; // clockwise\n if (p.dot(q) < 0.0) return ONLINE_BACK; // c--a--b online_back\n if (p.norm() < q.norm()) return ONLINE_FRONT; // a--b--c online_front\n return ON_SEGMENT; // a--c--b on_segment\n}\n\n// --------------------- Line ------------------------\nstruct Line {\n Point a, b;\n Line() {}\n Line(Point a, Point b) : a(a), b(b) {}\n bool on(Point q) { return EQ((a - q).det(b - q), 0.0); }\n // following 2 functions verified AOJ CGL_2_A\n bool is_parallel(Line l) { return EQ((a - b).det(l.a - l.b), 0.0); }\n bool is_orthogonal(Line l) { return EQ((a - b).dot(l.a - l.b), 0.0); }\n Point intersection(Line l) {\n assert(!is_parallel(l));\n return a + (b - a) * ((l.b - l.a).det(l.a - a) / (l.b - l.a).det(b - a));\n }\n // Projection of p to this line\n // verified AOJ CGL_1_A\n Point projection(Point p) {\n return (b - a) * ((b - a).dot(p - a) / (b - a).norm2()) + a;\n }\n double distance(Point p) {\n Point q = projection(p);\n return p.dist(q);\n }\n // Reflection point of p onto this line\n // verified AOJ CGL_1_B\n Point refl(Point p) {\n Point proj = projection(p);\n return p + ((proj - p) * 2.0);\n }\n bool left(Point p) {\n if ((p - a).det(b - a) > 0.0)\n return true;\n else\n return false;\n }\n friend istream &operator>>(istream &is, Line &l) { return is >> l.a >> l.b; }\n friend ostream &operator<<(ostream &os, const Line &l) {\n return os << l.a << \" -> \" << l.b;\n }\n};\n\n// ------------------- Segment ----------------------\nstruct Segment {\n Point a, b;\n Segment() {}\n Segment(Point a, Point b) : a(a), b(b) {}\n Line line() { return Line(a, b); }\n bool on(Point q) {\n return (EQ((a - q).det(b - q), 0.0) && LE((a - q).dot(b - q), 0.0));\n }\n // verified AOJ CGL_2_B\n bool is_intersect(Segment s) {\n if (line().is_parallel(s.line())) {\n if (on(s.a) || on(s.b)) return true;\n if (s.on(a) || s.on(b)) return true;\n return false;\n }\n Point p = line().intersection(s.line());\n if (on(p) && s.on(p))\n return true;\n else\n return false;\n }\n bool is_intersect(Line l) {\n if (line().is_parallel(l)) {\n if (l.on(a) || l.on(b))\n return true;\n else\n return false;\n }\n Point p = line().intersection(l);\n if (on(p))\n return true;\n else\n return false;\n }\n // following 2 distance functions are verified at AOJ CGL_2_D\n double distance(Point p) {\n double res = DOUBLE_INF;\n Point q = line().projection(p);\n if (on(q)) res = min(res, p.dist(q));\n res = min(res, min(p.dist(a), p.dist(b)));\n return res;\n }\n double distance(Segment s) {\n if (is_intersect(s)) return 0.0;\n double res = DOUBLE_INF;\n res = min(res, s.distance(a));\n res = min(res, s.distance(b));\n res = min(res, this->distance(s.a));\n res = min(res, this->distance(s.b));\n return res;\n }\n friend istream &operator>>(istream &is, Segment &s) {\n return is >> s.a >> s.b;\n }\n friend ostream &operator<<(ostream &os, const Segment &s) {\n return os << s.a << \" -> \" << s.b;\n }\n};\n\ntypedef vector<Point> Polygon;\n\nbool solve() {\n int m, n;\n cin >> m >> n;\n if (n == 0 && m == 0) return false;\n Polygon a(m), b(n);\n cin >> a >> b;\n\n double a_x_max = -200, b_x_max = -200;\n double a_x_min = 200, b_x_min = 200;\n\n for (int i = 0; i < m; i++) {\n chmax(a_x_max, a[i].x);\n chmin(a_x_min, a[i].x);\n }\n\n for (int i = 0; i < n; i++) {\n chmax(b_x_max, b[i].x);\n chmin(b_x_min, b[i].x);\n }\n\n // if (a_x_max - eps < b_x_min || b_x_max - eps < a_x_min) {\n // cout << 0.0 << endl;\n // return true;\n // }\n\n auto intersection_length = [&](const Polygon &pol, const Line &l) {\n vector<Point> ps;\n for (int i = 0; i < pol.size(); i++) {\n Segment seg(pol[i], pol[(i + 1) % pol.size()]);\n if (seg.a.x < l.a.x && seg.b.x < l.a.x) continue;\n if (seg.a.x > l.a.x && seg.b.x > l.a.x) continue;\n // if (seg.line().is_parallel(l) && EQ(pol[i].x, l.a.x)) return -1.0;\n if (seg.line().is_parallel(l)) continue;\n if (!seg.is_intersect(l)) continue;\n Point inter = seg.line().intersection(l);\n bool is_new = true;\n for (auto &p : ps) {\n if ((p - inter).norm() < eps) is_new = false;\n }\n if (is_new) ps.push_back(inter);\n }\n assert(ps.size() <= 2);\n dmp(ps);\n if (ps.size() == 2) return (ps[0] - ps[1]).norm();\n return (double)0.0;\n };\n\n auto f = [&](double x) {\n // cerr << fixed << setprecision(20) << x << endl;\n Line l(Point(x, 0), Point(x, 1));\n auto len_a = intersection_length(a, l);\n if (EQ(len_a, 0.0)) return (double)0.0;\n auto len_b = intersection_length(b, l);\n if (EQ(len_b, 0.0)) return (double)0.0;\n dmp(x, len_a, len_b);\n return len_a * len_b;\n };\n\n double ans = 0.0;\n double s = -100, step = 1.0;\n while (s + step <= 105) {\n double mid = s + step / 2.0;\n if (a_x_min <= mid && mid <= a_x_max && b_x_min <= mid && mid <= b_x_max) {\n double p = f(s), q = f(s + step / 2.0), r = f(s + step);\n ans += (p + 4.0 * q + r) * step / 6.0;\n }\n s += step;\n }\n cout << ans << endl;\n\n return true;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n while (solve()) {}\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-1,"final_rank":14},{"submission_id":"aoj_1313_3978161","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename F>\nstruct Point {\n F x, y;\n Point(F x = 0, F y = 0) : x(x), y(y) {}\n bool operator<(const Point &oth) const {\n return x == oth.x ? y < oth.y : x < oth.x;\n }\n Point operator-(const Point &oth) const {\n return Point(x - oth.x, y - oth.y);\n }\n};\n\ntemplate<typename F>\nusing Polygon = vector<Point<F>>;\n\ntemplate<typename F>\nPolygon<F> upperConvexHull(Polygon<F> P) {\n reverse(P.begin(), P.end());\n rotate(P.begin(), min_element(P.begin(), P.end(), [](Point<F> a, Point<F> b) {\n return a.x == b.x ? a.y > b.y : a.x < b.x;\n }), P.end());\n int n = P.size();\n Polygon<F> ret = {P[0]};\n for (int i = 1; i < n; ++i) {\n auto dir = P[i] - P[i - 1];\n if (dir.x > 0) ret.push_back(P[i]);\n }\n return ret;\n}\n\ntemplate<typename F>\nPolygon<F> lowerConvexHull(Polygon<F> P) {\n rotate(P.begin(), min_element(P.begin(), P.end()), P.end());\n int n = P.size();\n Polygon<F> ret = {P[0]};\n for (int i = 1; i < n; ++i) {\n auto dir = P[i] - P[i - 1];\n if (dir.x > 0) ret.push_back(P[i]);\n }\n return ret;\n}\n\ntemplate<typename F>\ndouble getLen(F x, Polygon<F> U, Polygon<F> L) {\n int i = upper_bound(U.begin(), U.end(), Point<F>(x, -1e9)) - U.begin();\n int j = upper_bound(L.begin(), L.end(), Point<F>(x, -1e9)) - L.begin();\n if (i == U.size() or j == L.size()) return 0;\n if (i == 0 and U[i].x > x) return 0;\n if (j == 0 and L[j].x > x) return 0;\n auto getY = [&](double x, int i, Polygon<F> P) -> double {\n if (i == 0) return P[i].y;\n return P[i].y - (double) (P[i].y - P[i - 1].y) / \n (P[i].x - P[i - 1].x) * \n (P[i].x - x);\n };\n return getY(x, i, U) - getY(x, j, L);\n}\n\n\ntemplate<typename Double>\nclass Integration {\n Double ALPHA = sqrt((5 - sqrt(40. / 7))) / 3, WA = (322 + sqrt(11830)) / 900;\n Double W0 = 128. / 225.;\n Double BETA = sqrt((5 + sqrt(40. / 7))) / 3, WB = (322 - sqrt(11830)) / 900;\n function<Double(Double)> f;\n Double quadrature(Double l, Double r) {\n auto m = (l + r) / 2, len = r - m;\n return (f(m - ALPHA * len) * WA + f(m - BETA * len) * WB + f(m) * W0 +\n f(m + ALPHA * len) * WA + f(m + BETA * len) * WB) * len;\n }\n Double askArea(Double l, Double r, Double exceptArea) {\n Double m = (l + r) / 2, L = quadrature(l, m), R = quadrature(m, r);\n if (abs(L + R - exceptArea) < 1e-10)\n return L + R;\n else return askArea(l, m, L) + askArea(m, r, R);\n }\npublic:\n Integration(function<Double(Double)> func) : f(func) {}\n Double intergal(Double l, Double r, int piece = 10) {\n Double ans = 0;\n for (Double dx = (r - l) / piece, i = 0; i < piece; ++i) {\n auto cur = l + dx * i;\n ans += askArea(cur, cur + dx, quadrature(cur, cur + dx));\n }\n return ans;\n }\n};\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(0);\n int n, m; \n while (cin >> n >> m and n and m) {\n Polygon<double> Z, Y;\n vector<int> Xs;\n for (int i = 0; i < n; ++i) {\n int x, y; cin >> x >> y;\n Z.emplace_back(x, y);\n Xs.emplace_back(x);\n }\n for (int i = 0; i < m; ++i) {\n int x, y; cin >> x >> y;\n Y.emplace_back(x, y);\n Xs.emplace_back(x);\n }\n sort(Xs.begin(), Xs.end());\n Xs.erase(unique(Xs.begin(), Xs.end()), Xs.end());\n Polygon<double> UZ = upperConvexHull(Z);\n Polygon<double> LZ = lowerConvexHull(Z);\n Polygon<double> UY = upperConvexHull(Y);\n Polygon<double> LY = lowerConvexHull(Y);\n double preX = Xs[0];\n double ans = 0;\n Integration<double> formula([=](double x) {\n return getLen(x, UZ, LZ) * getLen(x, UY, LY);\n });\n for (int x : Xs) {\n ans += formula.intergal(preX, x);\n preX = x;\n }\n cout << fixed << setprecision(10) << ans << '\\n';\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3284,"score_of_the_acc":-0.9642,"final_rank":12},{"submission_id":"aoj_1313_3042345","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n#define X real()\n#define Y imag()\n\ntypedef complex<double> P;\ntypedef vector<P> VP;\nstruct L : array<P, 2>{\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\n L(){}\n};\n\nnamespace std{\n bool operator < (const P& a, const P& b){\n return (a.X!=b.X) ? a.X<b.X : a.Y<b.Y;\n }\n bool operator == (const P& a, const P& b){\n return abs(a-b) < EPS;\n }\n}\n\ndouble dot(P a, P b){\n return (conj(a)*b).X;\n}\ndouble cross(P a, P b){\n return (conj(a)*b).Y;\n}\nint ccw(P a, P b, P c){\n b -= a;\n c -= a;\n if(cross(b,c) > EPS) return +1; //ccw\n if(cross(b,c) < -EPS) return -1; //cw\n if(dot(b,c) < -EPS) return +2; //c-a-b\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\n return 0; //a-c-b\n}\n\nbool intersectLS(const L& l, const L& s){\n return cross(l[1]-l[0], s[0]-l[0])*\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\ndouble getarea(const VP &poly){\n double ret = 0;\n for (int i=0; i<(int)poly.size(); i++){ \n ret += cross(poly[i], poly[(i+1)%poly.size()]);\n }\n return ret*0.5;\n}\n\nVP convex_cut(const VP& p, const L& l){\n VP ret;\n int n = p.size();\n for(int i=0; i<n; i++){\n P curr = p[i];\n P next = p[(i+1)%n];\n if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);\n if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){\n ret.push_back(crosspointLL(L(curr, next), l));\n }\n }\n return ret;\n}\n\nstruct c2cut{\n double z, x[2];\n c2cut(double z, double xmin, double xmax):z(z),x{xmin, xmax}{}\n c2cut(){}\n bool operator <(const c2cut &a){\n return z < a.z;\n }\n bool operator ==(const c2cut &a){\n return z == a.z;\n }\n};\n\nint main(){\n while(1){\n int m,n;\n cin >> m >> n;\n if(n==0) break;\n \n VP c1(m), c2(n);\n for(int i=0; i<m; i++){\n double x,y;\n cin >> x >> y;\n c1[i] = P(x, y);\n }\n for(int i=0; i<n; i++){\n double x,z;\n cin >> x >> z;\n c2[i] = P(x, z);\n }\n \n vector<c2cut> cz(n);\n for(int i=0; i<n; i++){\n double z = c2[i].Y;\n L cutline(P(0, z), P(1, z));\n vector<double> cpx;\n for(int i=0; i<n; i++){\n L edge(c2[i], c2[(i+1)%n]);\n if(!isParallel(cutline, edge) && intersectLS(cutline, edge)){\n cpx.push_back((crosspointLL(cutline, edge)).X);\n }\n }\n double xmin = *min_element(cpx.begin(), cpx.end());\n double xmax = *max_element(cpx.begin(), cpx.end());\n cz[i] = c2cut(z, xmin, xmax);\n }\n sort(cz.begin(), cz.end());\n cz.erase(unique(cz.begin(), cz.end()), cz.end());\n\n double ans = 0;\n for(int i=0; i<(int)cz.size()-1; i++){\n vector<double> zdiff;\n for(int d=0; d<2; d++){\n double x[2] = {cz[i].x[d], cz[i+1].x[d]};\n if(abs(x[1]-x[0]) < EPS) continue;\n if(x[0] > x[1]) swap(x[0], x[1]);\n L cut[2] = {L(P(x[1], 0), P(x[1], 1)), L(P(x[0], 1), P(x[0], 0))};\n VP p = convex_cut(c1, cut[0]);\n p = convex_cut(p, cut[1]);\n for(int j=0; j<(int)p.size(); j++){\n double xdiff = abs(p[j].X -cz[i].x[d]);\n zdiff.push_back((cz[i+1].z -cz[i].z) *xdiff/(x[1]-x[0]));\n }\n }\n for(int d=0; d<2; d++){\n int xmax = cz[i+d].x[1];\n int xmin = cz[i+d].x[0];\n L cut[2] = {L(P(xmax, 0), P(xmax, 1)), L(P(xmin, 1), P(xmin, 0))};\n VP p = convex_cut(c1, cut[0]);\n p = convex_cut(p, cut[1]);\n if(!p.empty()){\n zdiff.push_back((cz[i+1].z -cz[i].z) *d);\n }\n }\n sort(zdiff.begin(), zdiff.end());\n zdiff.erase(unique(zdiff.begin(), zdiff.end()), zdiff.end());\n\n for(int j=0; j<(int)zdiff.size()-1; j++){\n double z[3];\n z[0] = cz[i].z +zdiff[j];\n z[2] = cz[i].z +zdiff[j+1];\n z[1] = (z[0] +z[2])/2;\n double area[3];\n for(int k=0; k<3; k++){\n L cutline(P(0, z[k]), P(1, z[k]));\n vector<double> cpx;\n for(int i=0; i<n; i++){\n L edge(c2[i], c2[(i+1)%n]);\n if(!isParallel(cutline, edge) && intersectLS(cutline, edge)){\n cpx.push_back((crosspointLL(cutline, edge)).X);\n }\n }\n double xmin = *min_element(cpx.begin(), cpx.end());\n double xmax = *max_element(cpx.begin(), cpx.end());\n L cut[2] = {L(P(xmax, 0), P(xmax, 1)), L(P(xmin, 1), P(xmin, 0))};\n VP con = convex_cut(c1, cut[0]);\n con = convex_cut(con, cut[1]);\n area[k] = getarea(con);\n }\n ans += (z[2] -z[0])/6 *(area[0] +4*area[1] +area[2]);\n }\n }\n\n cout << fixed << setprecision(10);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3268,"score_of_the_acc":-0.9489,"final_rank":11},{"submission_id":"aoj_1313_2423083","code_snippet":"#include <bits/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\n#define EPS 1e-10\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define each(a, b) for(auto (a): (b))\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout <<#x<<\" = \"<<(x)<<endl\n#define spair(p) cout <<#p<<\": \"<<p.fi<<\" \"<<p.se<<endl\n#define svec(v) cout<<#v<<\":\";rep(kbrni,v.size())cout<<\" \"<<v[kbrni];cout<<endl\n#define sset(s) cout<<#s<<\":\";each(kbrni,s)cout <<\" \"<<kbrni;cout<<endl\n\nusing namespace std;\n\ntypedef complex<double> C;\ntypedef pair<int,int>P;\n\nnamespace std\n{\n bool operator < (const C a, const C b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\nstruct L : public vector<C>\n{\n L(const C a, const C b) {\n push_back(a); push_back(b);\n }\n};\n\nbool eq(double a,double b)\n{\n return (-EPS<a-b&&a-b<EPS);\n}\n\nbool eq(C c1,C c2)\n{\n return (eq(c1.real(),c2.real()) && eq(c1.imag(),c2.imag()));\n}\n\n//?????¶??????sqrt\ndouble Sqrt(double x)\n{\n if(x<0) return 0;\n else return sqrt(x);\n}\n\n//??£??????\nC normalize(C c)\n{\n return c / abs(c);\n}\n\n//?§????(rad)\ndouble getarg(C a,C b){\n return arg(b*conj(a));\n}\n\n//??????\ndouble cross(const C a, const C b)\n{\n return imag(conj(a)*b);\n}\n//??????\ndouble dot(const C a, const C b)\n{\n return real(conj(a)*b);\n}\n\nint ccw(C a, C b, C c)\n{\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\n//??´???????????????????????????(????????´??????True)\nbool intersectLL(const L &l, const L &m)\n{\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;\n}\n//??´?????¨?????????????????????(????????±??????????????¨??????)\nbool intersectLS(const L &l, const L &s)\n{\n return cross(l[1]-l[0], s[0]-l[0]) * cross(l[1]-l[0], s[1]-l[0]) < EPS;\n}\n//??´?????¨????????????(??±???)??????\nbool intersectLP(const L &l, const C p)\n{\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\n}\n//??????????????????????????????(????????±??????????????¨??????)\nbool intersectSS(const L &s, const L &t)\n{\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\n}\n//????????¨????????????(??±???)??????\nbool intersectSP(const L &s, const C p)\n{\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;\n}\n//???p?????´???l???????°???±\nC projection(const L &l, const C p)\n{\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\n}\n//???p?????´???l????????¨??????????§°?§????\nC reflection(const L &l, const C p)\n{\n return p + (projection(l, p) - p)*2.0;\n}\n//?????¨??´???????????¢\ndouble distanceLP(const L &l, const C p)\n{\n return abs(p - projection(l, p));\n}\n//??´?????¨??´???????????¢\ndouble distanceLL(const L &l, const L &m)\n{\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\n}\n//??´?????¨??????????????¢\ndouble distanceLS(const L &l, const L &s)\n{\n if (intersectLS(l, s)) return 0;\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\n}\n//????????¨???????????¢\ndouble distanceSP(const L &s, const C p)\n{\n const C r = projection(s, p);\n if (intersectSP(s, r)) return abs(r - p);\n return min(abs(s[0] - p), abs(s[1] - p));\n}\n//????????¨??????????????¢\ndouble distanceSS(const L &s, const L &t)\n{\n if (intersectSS(s, t)) return 0;\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),min(distanceSP(t, s[0]), distanceSP(t, s[1])));\n}\n//??´???????????????????????????\nC crosspointLL(const L &l, const L &m)\n{\n double A = cross(l[1] - l[0], m[1] - m[0]);\n double B = cross(l[1] - l[0], l[1] - m[0]);\n //????????´????????¨???\n if(abs(A) < EPS && abs(B) < EPS){\n return m[0];\n }\n return m[0] + B / A * (m[1] - m[0]);\n}\n//?????¨??´????????????\ndouble gettime(C c1,C c2)\n{\n return (dot(c1,c2) < 0 ? -1.0 : 1.0 ) * abs(c2) / abs(c1);\n}\n//?????¨??´????????????\nvector<C> crosspointCL(C c1,double r1,L l)\n{\n C a=l[0], b=l[1];\n vector<C> res;\n C base=b-a, target=projection(L(a,b),c1);\n double length=abs(base), h=abs(c1-target);\n base/=length;\n if(r1+EPS<h) return res;\n double w=Sqrt(r1*r1-h*h);\n double LL=gettime(normalize(b-a),target-a)-w,RR=LL+w*2.0;\n res.push_back(a+base*LL);\n if(eq(LL,RR)) return res;\n res.push_back(a+base*RR);\n return res;\n}\n//?????¨???????????????\nvector<C> crosspointCS(C c1,double r1,L s)\n{\n vector<C> tmp=crosspointCL(c1,r1,s);\n vector<C> res;\n rep(i,tmp.size()){\n if(eq(abs(s[1]-s[0]),abs(s[0]-tmp[i])+abs(s[1]-tmp[i]))){\n res.push_back(tmp[i]);\n }\n }\n return res;\n}\n//?????????????????????\nL crosspointCC(const C c1, const double r1, const C c2, const double r2)\n{\n C a = conj(c2-c1), b = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), c = r1*r1*(c2-c1);\n C d = b*b-4.0*a*c;\n C z1 = (-b+sqrt(d))/(2.0*a)+c1, z2 = (-b-sqrt(d))/(2.0*a)+c1;\n return L(z1, z2);\n}\n//?????¨????§???¢?????±?????¨????????¢???\ndouble getarea(C c1,double r1,C a,C b)\n{\n C va=c1-a,vb=c1-b;\n double A=abs(va),B=abs(vb);\n double f=cross(va,vb),d=distanceSP(L(a,b),c1),res=0;\n if(eq(f,0.0)) return 0;\n if(A < r1+EPS && B < r1+EPS) return f*0.5;\n if(d>r1-EPS) return r1*r1*M_PI*getarg(va,vb)/(2.0*M_PI);\n vector<C> u=crosspointCS(c1,r1,L(a,b));\n u.insert(u.begin(),a),u.push_back(b);\n for(int i=0;i+1<(int)u.size();i++){\n res+=getarea(c1,r1,u[i],u[i+1]);\n }\n return res;\n}\ndouble getcrossarea(vector<C> t,C c1,double r1)\n{\n int n=t.size();\n if(n<3) return 0;\n double res=0;\n rep(i,n){\n C a=t[i], b=t[(i+1)%n];\n res += getarea(c1,r1,a,b);\n }\n return res;\n}\n//??????????±???????\nvector<C> convex_hull(vector<C> ps)\n{\n int n = ps.size(), k = 0;\n sort(ps.begin(), ps.end());\n vector<C> ch(2*n);\n for (int i = 0; i < n; ch[k++] = ps[i++]){\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) k--;\n }\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]){\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) k--;\n }\n ch.resize(k-1);\n return ch;\n}\n//?????§??????\nbool isconvex(const vector<C> &ps)\n{\n rep(i,ps.size()){\n if (ccw(ps[(i+ps.size()-1) % ps.size()],ps[i],ps[(i+1) % ps.size()])) return false;\n }\n return true;\n}\n//????§???¢?????¢???\ndouble area(const vector<C> &ps)\n{\n double A = 0;\n rep(i,ps.size()){\n A += cross(ps[i],ps[(i+1) % ps.size()]);\n }\n return A / 2.0;\n}\n//???????§???¢?????´?????§???????????????????????´????????¢\nvector<C> convex_cut(const vector<C> &ps, const L &l)\n{\n vector<C> Q;\n rep(i,ps.size()){\n C A = ps[i], B = ps[(i+1)%ps.size()];\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n Q.push_back(crosspointLL(L(A, B),l));\n }\n return Q;\n}\n//??????????§???¢???????????????????????????(0??????????????????,1?????????,2???????????????)\nint contains(const vector<C>& ps, const C p)\n{\n bool flag = false;\n rep(i,ps.size()) {\n C a = ps[i] - p, b = ps[(i+1)%ps.size()] - p;\n if (imag(a) > imag(b)) swap(a, b);\n if (imag(a) <= 0 && 0 < imag(b)){\n if (cross(a, b) < 0) flag = !flag;\n }\n if (cross(a, b) == 0 && dot(a, b) <= 0) return 1;\n }\n return flag ? 2 : 0;\n}\n//???????§???¢?????´???????±???????(?????£????????????)\n//maxi,maxj?????????????????¨??????\ndouble convex_diameter(const vector<C> &ps)\n{\n const int n = ps.size();\n int is = 0, js = 0;\n for (int i = 1; i < n; ++i) {\n if (imag(ps[i]) > imag(ps[is])) is = i;\n if (imag(ps[i]) < imag(ps[js])) js = i;\n }\n double maxd = abs(ps[is]-ps[js]);\n int i, maxi, j, maxj;\n i = maxi = is;\n j = maxj = js;\n do{\n if (cross(ps[(i+1)%ps.size()]-ps[i],ps[(j+1)%ps.size()]-ps[j]) >= 0) j = (j+1) % n;\n else i = (i+1) % n;\n if (abs(ps[i]-ps[j]) > maxd) {\n maxd = abs(ps[i]-ps[j]);\n maxi = i; maxj = j;\n }\n } while (i != is || j != js);\n return maxd;\n}\n\nbool compyx(C c1,C c2)\n{\n return c1.imag() != c2.imag() ? c1.imag() < c2.imag() : c1.real() < c2.real();\n}\n\n//????????????????±???????\ndouble closest_pair(C *a, int n)\n{\n if(n<=1) return INF;\n int m=n/2;\n double x=a[m].real();\n double d=min(closest_pair(a,m),closest_pair(a+m,n-m));\n inplace_merge(a,a+m,a+n,compyx);\n vector<C> b;\n rep(i,n){\n if(abs(x-a[i].real())>=d) continue;\n rep(j,b.size()){\n C dp=a[i]-b[b.size()-1-j];\n if(dp.imag()>=d) break;\n d=min(d,abs(dp));\n }\n b.push_back(a[i]);\n }\n return d;\n}\ndouble compute_shortest(C *a,int n)\n{\n sort(a,a+n);\n return closest_pair(a,n);\n}\n//2??????????????¢????????????(????????????2??????????????±?????\\????????°)\nint getstateCC(C c1,double r1,C c2,double r2)\n{\n double d=abs(c1-c2);\n if(d>r1+r2+EPS)return 4;\n if(d>r1+r2-EPS)return 3;\n if(d>abs(r1-r2)+EPS)return 2;\n if(d>abs(r1-r2)-EPS)return 1;\n return 0;\n}\n//?????????????????\\???????????????????????\\???\nC gettangentCP_(C c1,double r1,C p,int flg){\n C base=c1-p;\n double w=Sqrt(norm(base)-r1*r1);\n C s=p+base*C(w,r1 * flg)/norm(base)*w;\n return s;\n}\n//????????????????????\\???\nvector<L> gettangentCP(C c1,double r1,C p){\n vector<L> res;\n C s=gettangentCP_(c1,r1,p,1);\n C t=gettangentCP_(c1,r1,p,-1);\n //??????????????¨??????????????´???\n if(eq(s,t)){\n res.push_back(L(s,s+(c1-p)*C(0,1)));\n }else{\n res.push_back(L(p,s));\n res.push_back(L(p,t));\n }\n return res;\n}\n\n//2????????±????????\\???????±???????\nL getintangent(C c1,double r1,C c2,double r2,double flg)\n{\n C base=c2-c1;\n double w=r1+r2;\n double h=Sqrt(norm(base)-w*w);\n C k=base*C(w,h*flg)/norm(base);\n return L(c1+k*r1,c2-k*r2);\n}\n//2????????±????????\\???????±???????\nL getouttangent(C c1,double r1,C c2,double r2,double flg)\n{\n C base=c2-c1;\n double h=r2-r1;\n double w=Sqrt(norm(base)-h*h);\n C k=base*C(w,h*flg)/norm(base)*C(0,flg);\n return L(c1+k*r1,c2+k*r2);\n}\n//2????????±?????\\???????±???????(?????´??????????????????????????????????????\\???)\nvector<L> gettangentCC(C c1,double r1,C c2,double r2)\n{\n vector<L> res;\n double d=abs(c1-c2);\n if(d>r1+r2+EPS) res.push_back(getintangent(c1,r1,c2,r2,1));\n if(d>r1+r2-EPS) res.push_back(getintangent(c1,r1,c2,r2,-1));\n if(d>abs(r1-r2)+EPS) res.push_back(getouttangent(c1,r1,c2,r2,1));\n if(d>abs(r1-r2)-EPS) res.push_back(getouttangent(c1,r1,c2,r2,-1));\n return res;\n}\n\ndouble width(vector<P> vec,int n,double x)\n{\n double lb = INF,ub = -INF;\n rep(i,n){\n L hoge(C(vec[i].fi,vec[i].se),C(vec[(i+1)%n].fi,vec[(i+1)%n].se));\n L cri(C(x,101),C(x,-101));\n if(intersectLS(cri,hoge)){\n C res = crosspointLL(cri,hoge);\n lb = min(lb,res.imag());\n ub = max(ub,res.imag());\n }\n }\n return max(0.0,ub-lb);\n}\n\nint main()\n{\n while(1){\n int n,m;\n cin >> m >> n;\n if(n == 0 && m == 0){\n break;\n }\n vector<P> v1,v2;\n vector<int> ax;\n rep(i,m){\n int x,y;\n cin >> x >> y;\n v1.pb(P(x,y));\n ax.pb(x);\n }\n rep(i,n){\n int x,y;\n cin >> x >> y;\n v2.pb(P(x,y));\n ax.pb(x);\n }\n sort(all(ax));\n ax.erase(unique(all(ax)),ax.end());\n int mn1 = (*min_element(all(v1))).fi;\n int mx1 = (*max_element(all(v1))).fi;\n int mn2 = (*min_element(all(v2))).fi;\n int mx2 = (*max_element(all(v2))).fi;\n double res = 0.0;\n rep(i,ax.size()-1){\n double a = ax[i],b = ax[i+1],c = (a+b)/2;\n if(mn1 <= c && c <= mx1 && mn2 <= c && c <= mx2){\n double fa = width(v1,m,a) * width(v2,n,a);\n double fb = width(v1,m,b) * width(v2,n,b);\n double fc = width(v1,m,c) * width(v2,n,c);\n res += (b - a) / 6 * (fa + 4*fc + fb);\n }\n }\n printf(\"%.10f\\n\",res);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3176,"score_of_the_acc":-0.9222,"final_rank":10},{"submission_id":"aoj_1313_2040628","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef double dbl;\n#define double long double\ntypedef complex<double> P;\ntypedef vector<P> G;\n#define REP(i,n) for(int i = 0 ; i < n ; i++)\ndouble eps = 1e-11;\ndouble EPS = eps;\n\nbool eq(double a,double b){\n\treturn fabs(a-b) < eps;\n}\n\ndouble cross(P a,P b) { return imag(conj(a)*b); }\ndouble dot(P a,P b) { return real(conj(a)*b);}\n\nvector<P> ps1,ps2;\n//??´???\nstruct L : public vector<P> {\n\tL(P a,P b) {\n\t\tpush_back(a); push_back(b);\n\t}\n\t\n};\nint ccw(P a, P b, P c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > 0) return +1;\t// a ??? b ??§???????¨??????????????????? b ??? c(???)\n\tif (cross(b, c) < 0) return -1;\t// a ??? b ??§????¨??????????????????? b ??? c(???)\n\tif (dot(b, c) < 0) return +2; \t// a???b??§????????????a??????????¶???????b???c(c--a--b)\n\tif (norm(b) < norm(c)) return -2;\t// a???b??§????????????b???c(a--b--c)\n\treturn 0;\t\t\t\t\t\t\t// a???b??§????????????b???c(????????? b == c)\n}\n \n\n\nP crosspoint(const L &l, const L &m) {\n\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\n\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\n\tif (abs(A) < EPS && abs(B) < EPS) return m[0];\n\treturn m[0] + B / A * (m[1] - m[0]);\n}\n \n \n// ???????§???¢???????????????????§???¢???????????´?????§????????????\n//???????????´?????????????????´?????????????????´?????????????????¨?????????????????¨?????????????????????????????¨????????????????????????\n#define curr(P, i) P[(i) % P.size()]\n#define next(P, i) P[(i+1)%P.size()]\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\nG convex_cut(const G& poly, const L& l) {\n G Q;\n for (int i = 0; i < poly.size(); ++i) {\n P A = curr(poly, i), B = next(poly, i);\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\n Q.push_back(crosspoint(L(A, B), l));\n }\n return Q;\n}\n\n// ????´?????§???¢?????¢??????\"2???\"????±??????? O(n)\ndouble area2(const G& poly) {\n\tdouble A = 0;\n\tREP(i,poly.size()) A += cross(curr(poly, i), next(poly, i));\n\treturn abs(A);\n}\n\n\nvector<double> ux;\n\nP in(){\n\tdouble x,y;\n\tcin >> x >> y;\n\t\n\treturn P(x,y);\n}\npair<double,double> seg(const vector<P> &ps,double x){\n\tdouble mi = 1e9, ma = -1e9;\n\tauto reflesh = [&mi,&ma](double y){\n\t\tmi = min(mi,y);\n\t\tma = max(ma,y);\n\t};\n\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\tP a = ps[i];\n\t\tP b = ps[(i+1)%ps.size()];\n\t\tif( a.real() > b.real() ) swap(a,b);\n\t\tif( eq(a.real(),x) ) reflesh(a.imag());\n\t\tif( eq(b.real(),x) ) reflesh(b.imag());\n\t\tif( a.real() + eps < x and x < b.real() - eps ){\n\t\t\treflesh(a.imag() + (x - a.real()) * (b.imag() - a.imag()) / (b.real()-a.real()));\n\t\t}\n\t}\n\tif( ma < mi ) return {0.0,0.0};\n\treturn {mi,ma};\n}\n\ndouble S(double l,double r){\n\tif( r <= l ) return 0;\n\tG g1 = convex_cut(ps1,L(P(l,0),P(l,-1)));\n\tG g2 = convex_cut(g1,L(P(r,0),P(r,+1)));\n\t\n\treturn area2(g2) / 2;\n\t\n}\n\ndouble Vf(double z){\n\tauto p = seg(ps2,z);\n\treturn S(p.first,p.second);\n}\n\ndouble Vs(double l,double r){\n\treturn (r-l)/6*(Vf(l)+4*Vf((l+r)/2)+Vf(r));\n}\n\ndouble V(double l,double r,int k=6){\n\tif( l >= r ) return 0;\n\tdouble m = (l+r)/2;\n\tdouble a = Vs(l,m);\n\tdouble b = Vs(m,r);\n\tdouble c = Vs(l,r);\n\tif( ( k <= 0) and eq(a+b,c) ){\n\t\treturn c;\n\t}else{\n\t\treturn V(l,m,k-1) + V(m,r,k-1);\n\t}\t\n}\n\nint main(){\n\tint m,n;\n\twhile(cin >> m >> n && m ){\n\t\t\n\t\tps1.clear();\n\t\tps2.clear();\n\t\tux.clear();\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tps1.push_back(in());\n\t\t\tux.push_back(ps1.back().real());\n\t\t}\n\n\t\tvector<double> uz;\n\t\tfor(int i = 0 ; i < n ; i++){\n\t\t\tps2.push_back(in());\n\t\t\tps2.back() = P(ps2.back().imag(),ps2.back().real());\n\t\t\tuz.push_back(ps2.back().real());\n\n\t\t}\n\t\t\n\t\tsort(uz.begin(),uz.end());\n\t\tsort(ux.begin(),ux.end());\n\t\tdouble vans = 0;\n\t\t//for( auto z : uz ) cout << z << \" \"; cout << endl;\n\t\t//for( auto x : ux ) cout << x << \" \"; cout << endl;\n\t\tfor(int i = 0 ; i+1 < uz.size() ; i++)\n\t\t\tif( uz[i] != uz[i+1] )\n\t\t\t\tvans += V(uz[i],uz[i+1]);\n\t\tprintf(\"%.8lf\\n\",(dbl)vans);\n\t}\n}","accuracy":1,"time_ms":5650,"memory_kb":3240,"score_of_the_acc":-1.9408,"final_rank":16},{"submission_id":"aoj_1313_1195725","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <cstring>\n#include <functional>\n#include <cmath>\n#include <complex>\n#include <cassert>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define fs first\n#define sc second\n#define pb push_back\n#define show(x) cout << #x << \" \" << x << endl\ntypedef long double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\ntypedef vector<P> Pol;\nD eps=1e-11,Eps=1e-9;\nD cro(P a,P b){return imag(conj(a)*b);}\nint ccw(P a,P b,P c){\n\tif(cro(b-a,c-a)>eps) return 1;\n\tif(cro(b-a,c-a)<-eps) return -1;\n\tif(abs(abs(a-c)+abs(c-b)-abs(a-b))<eps) return 0;\n\tif(abs(abs(a-b)+abs(c-b)-abs(a-c))<eps) return -2;\n\treturn 2;\n}\nbool iLS(L l,L s){\n\tif(abs(cro(l.fs-l.sc,s.fs-s.sc))<eps) return 0;\n\treturn cro(l.sc-l.fs,s.fs-l.fs)*cro(l.sc-l.fs,s.sc-l.fs)<eps;\n}\nP intLL(L a,L b){\n\tD t=cro(a.sc-a.fs,a.sc-b.fs)/cro(a.sc-a.fs,b.sc-b.fs);\n\treturn b.fs+t*(b.sc-b.fs);\n}\nint M,N;\nPol a,b;\nD rec(D x){\n\tL l=L(P(x,0),P(x,1));\n\tPol inters;\n\trep(j,M){\n\t\tL e=L(a[j],a[(j+1)%M]);\n\t\tif(iLS(l,e)) inters.pb(intLL(l,e));\n\t}\n\tif(inters.size()<=1) return -1;\n\tD leny=0;\n\tfor(P p:inters) for(P q:inters) leny=max(leny,abs(p-q));\n\tinters.clear();\n\trep(j,N){\n\t\tL e=L(b[j],b[(j+1)%N]);\n\t\tif(iLS(l,e)) inters.pb(intLL(l,e));\n\t}\n\tif(inters.size()<=1) return -1;\n\tD lenz=0;\n\tfor(P p:inters) for(P q:inters) lenz=max(lenz,abs(p-q));\n\treturn leny*lenz;\n}\nint main(){\n\twhile(true){\n\t\tcin>>M>>N;\n\t\tif(M==0) break;\n\t\ta.clear(),b.clear();\n\t\tvector<D> xs;\n\t\tD ans=0;\n\t\trep(i,M){\n\t\t\tD x,y;\n\t\t\tcin>>x>>y;\n\t\t\ta.pb(P(x,y));\n\t\t\txs.pb(x-Eps);\n\t\t\txs.pb(x+Eps);\n\t\t}\n\t\trep(i,N){\n\t\t\tD x,y;\n\t\t\tcin>>x>>y;\n\t\t\tb.pb(P(x,y));\n\t\t\txs.pb(x-Eps);\n\t\t\txs.pb(x+Eps);\n\t\t}\n\t\tsort(all(xs));\n\t\trep(i,xs.size()-1){\n\t\t\tif(rec(xs[i])<-eps||rec(xs[i])<-eps) continue;\n\t\t\tans+=(xs[i+1]-xs[i])/6.0*(rec(xs[i])+4.0*rec((xs[i+1]+xs[i])/2)+rec(xs[i+1]));\n\t\t}\n\t\tprintf(\"%.4f\\n\",(double)ans);\n\t}\n}","accuracy":1,"time_ms":110,"memory_kb":1308,"score_of_the_acc":-0.3975,"final_rank":7},{"submission_id":"aoj_1313_1156580","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <assert.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nnamespace geom{\n#define X real()\n#define Y imag()\n#define at(i) ((*this)[i])\n#define SELF (*this)\n\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\n\ttypedef int BOOL;\n\ttypedef long double R;\n\tconst R INF = 1e8;\n\tR EPS = 1e-12;\n\tconst R PI = 3.1415926535897932384626;\n\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\n\ttypedef complex<R> P;\n\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\n\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\n\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\n\tinline P unit(const P& p){return p/abs(p);}\n\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\n\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\n\t\tint res = sig(outp(t-s, p-s));\n\t\tif(res || !adv) return res;\n\t\tif(sig(inp(t-s, p-s)) < 0) return -2;\t// p-s-t\n\t\tif(sig(inp(s-t, p-t)) < 0) return 2;\t// s-t-p\n\t\treturn 0;\t\t\t\t\t\t\t\t// s-p-t\n\t}\n\t\n\t\n\tstruct L : public vector<P>{\t// line\n\t\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\n\t\tL(){}\n\t\tP dir()const {return at(1) - at(0);}\n\t};\n\tstruct S : public L{\t// segment\n\t\tS(const P &p1, const P &p2):L(p1, p2){}\n\t\tS(){}\n\t};\n\tstruct G : public vector<P>{\n\t\tG(size_type size=0):vector(size){}\n\t\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\n\t};\n\tBOOL intersect(const S &s, const S &t){\n\t\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\n\t\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\n\t\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\n\t}\n\tBOOL intersect(const S &s, const L &l){\n\t\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\n\t}\n\tinline P crosspoint(const L &l, const L &m){\n\t\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\n\t\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\n\t\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n\t\treturn m[0] + B / A * (m[1] - m[0]);\n\t}\n\n\ttemplate<class Func> R simpson(R s, R t, Func func){\n\t\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\n\t}\n#undef SELF\n#undef at\n}\n\nusing namespace geom;\n\nint f = 0;\nnamespace std{\n\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\n\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\n\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\n\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\n}\n\nint n, m;\n\nint main(){\n\tios::sync_with_stdio(false);\n\twhile(cin >> m >> n, n){\n\t\tG g1(m), g2(n);\n\t\tvector<R> x;\n\t\tREP(i, m){\n\t\t\tcin >> g1[i];\n\t\t\tx.push_back(g1[i].X);\n\t\t}\n\t\tREP(i, n){\n\t\t\tcin >> g2[i];\n\t\t\tx.push_back(g2[i].X);\n\t\t}\n\t\tsort(ALL(x));UNIQUE(x);\n\t\t\n\t\tauto width = [&](const G &g, R x){\n\t\t\tL l(P(x, 0), P(x, 1));\n\t\t\tR b = INF, u = -INF;\n\t\t\tREP(i, g.size()){\n\t\t\t\tif(sig(g.edge(i).dir().X) && intersect(g.edge(i), l)){\n\t\t\t\t\tP p = crosspoint(g.edge(i), l);\n\t\t\t\t\tb = min(b, p.Y);\n\t\t\t\t\tu = max(u, p.Y);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max<R>(0, u-b);\n\t\t};\n\t\tauto area = [&](R x){\n\t\t\treturn width(g1, x) * width(g2, x);\n\t\t};\n\t\t\n\t\tR ans = 0;\n\t\tREP(i, (int)x.size()-1){\n\t\t\tans += simpson(x[i], x[i+1], area);\n\t\t}\n\t\tprintf(\"%.10f\\n\", (double)ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":1308,"score_of_the_acc":-0.3851,"final_rank":6},{"submission_id":"aoj_1313_1113794","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n bool operator==(const P &a, const P &b){return EQ(a,b);}\n}\n\ninline D dot(P x, P y){return real(conj(x)*y);}\ninline D cross(P x, P y){return imag(conj(x)*y);}\n\ninline int ccw(P a,P b,P c){\n b -= a;c -= a;\n if (cross(b,c)>EPS) return 1; //counter clockwise\n if (cross(b,c)<-EPS) return -1; //clockwise\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\n return 0; //on segment\n}\n\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\n\ninline bool is_cp(L a,L b){\n if(para(a,b))return false;\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\ninline P line_cp(L a,L b){\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\n}\n\nvector<P> p[2];\ninline D len(D x, int id){\n L l = L( P(x,-1000), P(x,1000) );\n vector<P> res;\n rep(i,p[id].size()){\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\n if(is_cp(a,l)){\n P cp = line_cp(a,l);\n if(!EQ(cp,p[id][i]))res.push_back(cp);\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\n res.push_back(a.sc);\n }\n }\n\n if(res.size()<2)return 0;\n return abs(res[0]-res[1]);\n}\n\ninline D f(D x){\n return len(x/2,0) * len(x/2,1);\n}\n\nint main(){\n int m,n;\n while(cin >> m >> n, m){\n int minx[2], maxx[2];\n p[0].resize(m); p[1].resize(n);\n minx[0] = minx[1] = 1000;\n maxx[0] = maxx[1] = -1000;\n\n rep(i,m){\n int x,y;\n cin >> x >> y;\n p[0][i] = P(x,y);\n minx[0]=min(minx[0],x);\n maxx[0]=max(maxx[0],x);\n }\n\n rep(i,n){\n int x,z;\n cin >> x >> z;\n p[1][i] = P(x,z);\n minx[1]=min(minx[1],x);\n maxx[1]=max(maxx[1],x);\n }\n\n D ans = 0;\n for(D i=-199;i<200;i+=2){\n if(2*minx[0]<=i && i<=2*maxx[0]){\n\tif(2*minx[1]<=i && i<=2*maxx[1]){\n\t ans += f(i-1)+4*f(i)+f(i+1);\n\t}\n }\n }\n cout << fixed << setprecision(9) << ans/6 << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1288,"score_of_the_acc":-0.3758,"final_rank":3},{"submission_id":"aoj_1313_1113792","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n bool operator==(const P &a, const P &b){return EQ(a,b);}\n}\n\ninline D dot(P x, P y){return real(conj(x)*y);}\ninline D cross(P x, P y){return imag(conj(x)*y);}\n\nint ccw(P a,P b,P c){\n b -= a;c -= a;\n if (cross(b,c)>EPS) return 1; //counter clockwise\n if (cross(b,c)<-EPS) return -1; //clockwise\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\n return 0; //on segment\n}\n\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\n\ninline bool is_cp(L a,L b){\n if(para(a,b))return false;\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\ninline P line_cp(L a,L b){\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\n}\n\nvector<P> p[2];\ninline D len(D x, int id){\n L l = L( P(x,-1000), P(x,1000) );\n vector<P> res;\n rep(i,p[id].size()){\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\n if(is_cp(a,l)){\n P cp = line_cp(a,l);\n if(!EQ(cp,p[id][i]))res.push_back(cp);\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\n res.push_back(a.sc);\n }\n }\n\n if(res.size()<2)return 0;\n return abs(res[0]-res[1]);\n}\n\ninline D f(D x){\n return len(x/2,0) * len(x/2,1);\n}\n\nint main(){\n int m,n;\n while(cin >> m >> n, m){\n int minx[2], maxx[2];\n p[0].resize(m); p[1].resize(n);\n minx[0] = minx[1] = 1000;\n maxx[0] = maxx[1] = -1000;\n\n rep(i,m){\n int x,y;\n cin >> x >> y;\n p[0][i] = P(x,y);\n minx[0]=min(minx[0],x);\n maxx[0]=max(maxx[0],x);\n }\n\n rep(i,n){\n int x,z;\n cin >> x >> z;\n p[1][i] = P(x,z);\n minx[1]=min(minx[1],x);\n maxx[1]=max(maxx[1],x);\n }\n\n D ans = 0;\n for(D i=-199;i<200;i+=2){\n if(2*minx[0]<=i && i<=2*maxx[0]){\n\tif(2*minx[1]<=i && i<=2*maxx[1]){\n\t ans += f(i-1)+4*f(i)+f(i+1);\n\t}\n }\n }\n cout << fixed << setprecision(9) << ans/6 << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":1284,"score_of_the_acc":-0.3764,"final_rank":4},{"submission_id":"aoj_1313_1113791","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\nusing namespace std;\ntypedef double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n bool operator==(const P &a, const P &b){return EQ(a,b);}\n}\n\ninline D dot(P x, P y){return real(conj(x)*y);}\ninline D cross(P x, P y){return imag(conj(x)*y);}\n\nint ccw(P a,P b,P c){\n b -= a;c -= a;\n if (cross(b,c)>EPS) return 1; //counter clockwise\n if (cross(b,c)<-EPS) return -1; //clockwise\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\n return 0; //on segment\n}\n\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\n\ninline bool is_cp(L a,L b){\n if(para(a,b))return false;\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\ninline P line_cp(L a,L b){\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\n}\n\nvector<P> p[2];\ninline D len(D x, int id){\n L l = L( P(x,-1000), P(x,1000) );\n vector<P> res;\n rep(i,p[id].size()){\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\n if(is_cp(a,l)){\n P cp = line_cp(a,l);\n if(!EQ(cp,p[id][i]))res.push_back(cp);\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\n res.push_back(a.sc);\n }\n }\n\n if(res.size()<2)return 0;\n return abs(res[0]-res[1]);\n}\n\ninline D f(D x){\n return len(x,0) * len(x,1);\n}\n\nint main(){\n int m,n;\n while(cin >> m >> n, m){\n D minx[2], maxx[2];\n p[0].resize(m); p[1].resize(n);\n minx[0] = minx[1] = 1000;\n maxx[0] = maxx[1] = -1000;\n\n rep(i,m){\n D x,y;\n cin >> x >> y;\n p[0][i] = P(x,y);\n minx[0]=min(minx[0],x);\n maxx[0]=max(maxx[0],x);\n }\n\n rep(i,n){\n D x,z;\n cin >> x >> z;\n p[1][i] = P(x,z);\n minx[1]=min(minx[1],x);\n maxx[1]=max(maxx[1],x);\n }\n\n D ans = 0;\n for(D i=-100;i<100;i+=1){\n if(minx[0]<=i+0.5 && i+0.5<=maxx[0]){\n\tif(minx[1]<=i+0.5 && i+0.5<=maxx[1]){\n\t ans += f(i)+4*f(i+0.5)+f(i+1);\n\t}\n }\n }\n cout << fixed << setprecision(9) << ans/6 << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":1320,"score_of_the_acc":-0.385,"final_rank":5},{"submission_id":"aoj_1313_1113790","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define EQ(a,b) (abs((a)-(b)) < EPS)\n#define fs first\n#define sc second\nusing namespace std;\ntypedef long double D;\ntypedef complex<D> P;\ntypedef pair<P,P> L;\n\nconst D EPS = 1e-8;\n\nnamespace std{\n bool operator<(const P &a,const P &b){\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\n }\n bool operator==(const P &a, const P &b){return EQ(a,b);}\n}\n\ninline D dot(P x, P y){return real(conj(x)*y);}\ninline D cross(P x, P y){return imag(conj(x)*y);}\n\nint ccw(P a,P b,P c){\n b -= a;c -= a;\n if (cross(b,c)>EPS) return 1; //counter clockwise\n if (cross(b,c)<-EPS) return -1; //clockwise\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\n return 0; //on segment\n}\n\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\n\ninline bool is_cp(L a,L b){\n if(para(a,b))return false;\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\n return false;\n}\n\ninline P line_cp(L a,L b){\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\n}\n\nvector<P> p[2];\ninline D len(D x, int id){\n L l = L( P(x,-1000), P(x,1000) );\n vector<P> res;\n rep(i,p[id].size()){\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\n if(is_cp(a,l)){\n P cp = line_cp(a,l);\n if(!EQ(cp,p[id][i]))res.push_back(cp);\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\n res.push_back(a.sc);\n }\n }\n\n if(res.size()<2)return 0;\n return abs(res[0]-res[1]);\n}\n\ninline D f(D x){\n return len(x,0) * len(x,1);\n}\n\nint main(){\n int m,n;\n while(cin >> m >> n, m){\n D minx[2], maxx[2];\n p[0].resize(m); p[1].resize(n);\n minx[0] = minx[1] = 1000;\n maxx[0] = maxx[1] = -1000;\n\n rep(i,m){\n D x,y;\n cin >> x >> y;\n p[0][i] = P(x,y);\n minx[0]=min(minx[0],x);\n maxx[0]=max(maxx[0],x);\n }\n\n rep(i,n){\n D x,z;\n cin >> x >> z;\n p[1][i] = P(x,z);\n minx[1]=min(minx[1],x);\n maxx[1]=max(maxx[1],x);\n }\n\n D ans = 0;\n for(D i=-100;i<100;i+=1){\n if(minx[0]<=i+0.5 && i+0.5<=maxx[0]){\n\tif(minx[1]<=i+0.5 && i+0.5<=maxx[1]){\n\t ans += f(i)+4*f(i+0.5)+f(i+1);\n\t}\n }\n }\n cout << fixed << setprecision(9) << ans/6 << endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":1328,"score_of_the_acc":-0.3998,"final_rank":8},{"submission_id":"aoj_1313_990797","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nconst int DIV = 500000;\n\nint m, n;\ndouble x1[100], y[100], x2[100], z[100];\ndouble mnx, mxx;\n\ndouble solve(double x) {\n double y1 = 0, y2 = 0, z1 = 0, z2 = 0;\n static int px11 = 0, px12 = 0, px21 = 0, px22 = 0;\n rep (ii, m) {\n int i = (px11 + ii) % m;\n if (x1[i] != x1[(i + 1) % m] && x1[i] <= x && x <= x1[(i + 1) % m]) {\n y1 = y[i] + (y[(i + 1) % m] - y[i]) / (x1[(i + 1) % m] - x1[i]) * (x - x1[i]);\n px11 = i;\n break;\n }\n }\n rep (ii, m) {\n int i = (px12 - ii + m) % m;\n if (x1[i] != x1[(i + 1) % m] && x1[(i + 1) % m] <= x && x <= x1[i]) {\n y2 = y[i] + (y[(i + 1) % m] - y[i]) / (x1[(i + 1) % m] - x1[i]) * (x - x1[i]);\n px12 = i;\n break;\n }\n }\n rep (ii, n) {\n int i = (px21 + ii) % n;\n if (x2[i] != x2[(i + 1) % n] && x2[i] <= x && x <= x2[(i + 1) % n]) {\n z1 = z[i] + (z[(i + 1) % n] - z[i]) / (x2[(i + 1) % n] - x2[i]) * (x - x2[i]);\n px21 = i;\n break;\n }\n }\n rep (ii, n) {\n int i = (px22 - ii + n) % n;\n if (x2[i] != x2[(i + 1) % n] && x2[(i + 1) % n] <= x && x <= x2[i]) {\n z2 = z[i] + (z[(i + 1) % n] - z[i]) / (x2[(i + 1) % n] - x2[i]) * (x - x2[i]);\n px22 = i;\n break;\n }\n }\n return (y2 - y1) * (z2 - z1);\n}\n\ndouble simpson(double l, double r, double f(double), int k = 1){\n double h = (r - l) / (2 * k);\n double fo = 0, fe = 0;\n for(int i = 1; i <= 2 * k - 3; i += 2){\n fo += f(l + h * i);\n fe += f(l + h * (i + 1));\n }\n return (f(l) + f(r) + 4 * (fo + f(r - h)) + 2 * fe) * h / 3;\n}\n\nint main() {\n while (true) {\n cin >> m >> n;\n if (m == 0 && n == 0) break;\n rep (i, m) cin >> x1[i] >> y[i];\n rep (i, n) cin >> x2[i] >> z[i];\n double mnx = max(*min_element(x1, x1 + m), *min_element(x2, x2 + n));\n double mxx = min(*max_element(x1, x1 + m), *max_element(x2, x2 + n));\n printf(\"%.12lf\\n\", simpson(mnx, mxx, solve, DIV));\n }\n}","accuracy":1,"time_ms":5610,"memory_kb":1248,"score_of_the_acc":-1.3553,"final_rank":15},{"submission_id":"aoj_1313_802145","code_snippet":"#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\nconst double EPS = 1e-8;\ntypedef pair<long double, long double> P;\nvector<P> vp1;\nvector<P> vp2;\n\nlong double width(long double x, const vector<P>& v){\n long double top = -1e8, bottom = 1e8;\n REP(i, v.size()){\n P p1 = v[i], p2 = v[(i + 1) % v.size()];\n if(abs(p1.first - p2.first) < EPS){\n if(abs(p1.first - x) < EPS){\n top = max(top, p1.second);\n top = max(top, p2.second);\n bottom = min(bottom, p1.second);\n bottom = min(bottom, p2.second);\n }\n continue;\n }\n if(p1.first > p2.first) swap(p1, p2);\n if(p1.first - EPS < x && x < p2.first + EPS){\n long double ratio = (x - p1.first) / (p2.first - p1.first);\n long double y = p1.second + ratio * (p2.second - p1.second);\n top = max(top, y);\n bottom = min(bottom, y);\n }\n }\n return max(0.0L, top - bottom);\n}\nlong double f(long double x){\n long double w = width(x, vp1) * width(x, vp2);\n return w;\n}\n\nlong double simpson(long double l, long double r, int N){\n long double h = (r - l) / (2 * N); \n long double S = f(l) + f(r);\n for(int i = 1; i < 2 * N; i += 2){\n S += 4.0 * f(l + h * i);\n }\n for(int i = 2; i < 2 * N; i += 2){\n S += 2.0 * f(l + h * i);\n }\n return S * h / 3.0;\n}\n\n\nint main(){\n int M, N;\n while(cin >> M >> N && M){\n vp1.resize(M);\n vp2.resize(N);\n REP(i, M) cin >> vp1[i].first >> vp1[i].second;\n REP(i, N) cin >> vp2[i].first >> vp2[i].second;\n long double left1 = vp1[0].first, right1 = vp1[0].first;\n long double left2 = vp2[0].first, right2 = vp2[0].first;\n REP(i, M) left1 = min(left1, vp1[i].first);\n REP(i, N) left2 = min(left2, vp2[i].first);\n REP(i, M) right1 = max(right1, vp1[i].first);\n REP(i, N) right2 = max(right2, vp2[i].first);\n vector<long double> vx;\n long double left = max(left1, left2), right = min(right1, right2);\n vx.push_back(left); vx.push_back(right);\n REP(i, M) if(left < vp1[i].first && vp1[i].first < right) vx.push_back(vp1[i].first);\n REP(i, N) if(left < vp2[i].first && vp2[i].first < right) vx.push_back(vp2[i].first);\n long double S = 0;\n sort(vx.begin(), vx.end());\n REP(i, vx.size() - 1){\n S += simpson(vx[i], vx[i + 1], 100);\n }\n printf(\"%.16Lf\\n\", S);\n }\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":1272,"score_of_the_acc":-0.4208,"final_rank":9},{"submission_id":"aoj_1313_350388","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\ntypedef pair<double, double> pdd;\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n};\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\nstruct C {\n P p; double r;\n C(const P &p, double r) : p(p), r(r) { }\n};\n\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\nbool intersectLS(const L &l, const L &s) {\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\n}\nP crosspoint(const L &l, const L &m) {\n double A = cross(l[1] - l[0], m[1] - m[0]);\n double B = cross(l[1] - l[0], l[1] - m[0]);\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\n return m[0] + B / A * (m[1] - m[0]);\n}\n\ndouble width(int *X, int *Y, int n, double x) {\n double lb = INF, ub = -INF;\n L l = L(P(x,0), P(x,1));\n REP(i, n) {\n L s = L(P(X[i], Y[i]), P(X[(i+1)%n], Y[(i+1)%n]));\n if (intersectLS(l, s)) {\n P p = crosspoint(l, s);\n double y = p.imag();\n lb = min(lb, y);\n ub = max(ub, y);\n }\n }\n return max(0.0, ub-lb);\n}\nint main() {\n int m, n;\n while(cin >> m >> n, m||n) {\n int X1[m], Y1[m], X2[n], Z2[n];\n REP(i, m) cin >> X1[i] >> Y1[i];\n REP(i, n) cin >> X2[i] >> Z2[i];\n int min1 = *min_element(X1, X1+m), max1 = *max_element(X1, X1+m);\n int min2 = *min_element(X2, X2+n), max2 = *max_element(X2, X2+n);\n vector<int> xs;\n REP(i, m) xs.push_back(X1[i]);\n REP(i, n) xs.push_back(X2[i]);\n sort(ALL(xs));\n\n double res = 0;\n REP(i, xs.size()-1) {\n double a = xs[i], b = xs[i+1], c = (a+b)/2;\n if (min1 <= c && c <= max1 && min2 <= c && c<= max2) {\n double fa = width(X1, Y1, m, a) * width(X2, Z2, n, a);\n double fb = width(X1, Y1, m, b) * width(X2, Z2, n, b);\n double fc = width(X1, Y1, m, c) * width(X2, Z2, n, c);\n res += (b-a) / 6 * (fa + 4*fc + fb);\n }\n }\n printf(\"%.10f\\n\", res);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":968,"score_of_the_acc":-0.2882,"final_rank":2},{"submission_id":"aoj_1313_152809","code_snippet":"#include<complex>\n#include<vector>\n#include<iostream>\n#include<stack>\n#include<cmath>\n#include<map>\n\nenum CCW{FRONT=0x01,RIGHT=0x02,BACK=0x04,LEFT=0x08,OVER=0x10};\nenum CIRCLE_RELATION{CIRCLE_SAME=0x01,CIRCLE_CONTAIN=0x02,\n\t\t CIRCLE_NO_CROSS=0x04,CIRCLE_ONE_CROSS=0x08,\n\t\t CIRCLE_ONE_INSIDE_CROSS=0x10,CIRCLE_TWO_CROSS=0x20};\n#define sc second\n#define fr first\n\n#define REP(i,n) for(int i = 0; i < (int)(n); ++i)\n\nusing namespace std;\n\ntypedef double elem;\ntypedef complex<elem> point, vec;\ntypedef pair<point, point> line, hline, seg, pp;\n\nconst double infty = 1e40;\nconst double eps = 1.0e-8;\nconst double pi = acos(-1.0);\npoint base(0,0);\n\n// lZ\ninline elem sq(elem a){ return a*a; }\ninline elem cq(elem a){ return a*a*a; }\n\n// pxÏ·\nelem rad(elem deg){ return (deg/180)*pi; }\nelem deg(elem rad){ return (rad*180)/pi; }\n\n// ®¬_Ìô¢AÈÇ\nbool eq(elem a, elem b){ return abs(a-b) < eps; }\nbool eqv(vec a, vec b){ return eq( abs(b-a),0); }\n\n// _Iy[^\nbool far(point a, point b){ return abs(b-a)>0; }\nbool near(point a, point b){ return abs(b-a)<=0; }\nelem dot(vec a, vec b){ return (a.real() * b.real() + a.imag() * b.imag() ); }\nelem cross(vec a, vec b){ return ( a.real() * b.imag() - a.imag() * b.real() ); }\n\n// a©çbÜÅvñèÌpxAàpA]ñ]\nelem varg(vec a, vec b){\n elem ret=arg(a)-arg(b);\n if(ret<0)ret+=2*pi;\n if(ret>2*pi)ret-=2*pi;\n if(eq(ret,2*pi))ret=0;\n return ret;\n}\nelem varg2(vec a, vec b){\n elem ret = varg(a,b);\n if(ret>pi)return 2*pi-ret;\n return ret;\n}\nelem arg(vec a, vec b){ return acos( dot(a,b) / ( abs(a) * abs(b) ) ); }\npoint rot(point p, elem theta){ return p * polar((elem)1.0, theta); }\npoint rotdeg(point p, elem deg){ return p * polar((elem)1.0, rad(deg)); }\npoint proj(line l, point p){\n double t=dot(p-l.first,l.first-l.second)/abs(l.first-l.second);\n return l.first + t*(l.first-l.second);\n}\npoint reflect(line l, point p){ return p+2.0*(proj(l,p)-p); }\n\n// ñ_Ô£A¼üÆ_ÌÅZ£AüªÆ_ÌÅZ£\nelem dist(point a, point b){ return abs(a-b); }\nelem dist_l(line l, point x){ return abs(cross(l.sc-l.fr,x-l.fr)) / abs(l.sc-l.fr); }\nelem dist_seg(seg s, point x)\n{\n if( dot(s.sc-s.fr,x-s.fr)<0 ) return abs(x-s.fr);\n if( dot(s.fr-s.sc,x-s.sc)<0 ) return abs(x-s.sc);\n return dist_l(s,x);\n}\n\n// PÊxNgA@üxNgAPÊ@üxNg\nvec uvec(vec a){ return a / abs(a); }\nvec nmr(vec a){ return a * vec(0,-1); }\nvec nml(vec a){ return a * vec(0,1); }\nvec unmr(vec a){ return uvec( nmr(a) ); }\nvec unml(vec a){ return uvec( nml(a) ); }\n\n// ¼ðA½s»è\nbool orth(point a1, point a2, point b1, point b2){ return eq( dot( a2 - a1, b2 - b1 ), 0 ); }\nbool orth(vec v1, vec v2){ return eq( dot(v1, v2), 0 ); }\nbool prll(point a1, point a2, point b1, point b2){ return eq( cross( a2 - a1, b2 - b1 ), 0 ); }\nbool prll(vec v1, vec v2){ return eq( cross(v1, v2), 0 ); }\n\n// CCW oXg¾ªA¸xÉæé\ninline int ccw(const point &a, point b, point x){\n b -= a;\n x -= a;\n if( eq(cross(b,x),0.0) && dot(b,x) < 0 ) return BACK;\n if( eq(cross(b,x),0.0) && abs(b) < abs(x) ) return FRONT;\n if( eq(cross(b,x),0.0) ) return OVER;\n if( cross(b,x) > 0 ) return LEFT;\n if( cross(b,x) < 0 ) return RIGHT;\n}\n\n// üªg£\nline expandLine(line l, elem mag){\n line ret = l;\n vec vf(l.first - l.second);\n vec vs(l.second - l.first);\n ret.first = l.second + mag * vf;\n ret.second = l.first + mag * vs;\n return ret;\n}\n\n// üªÌð·»è\ninline bool intersectedSS(const seg &a, const seg &b)\n{\n int cwaf=ccw(a.fr,a.sc,b.fr);\n int cwbf=ccw(b.fr,b.sc,a.fr);\n int cwas=ccw(a.fr,a.sc,b.sc);\n int cwbs=ccw(b.fr,b.sc,a.sc);\n if( cwaf==OVER || cwas==OVER || cwbf==OVER || cwbs==OVER ) return true;\n return ( cwaf | cwas ) == (LEFT|RIGHT) && ( cwbf | cwbs ) == (LEFT|RIGHT);\n}\n\n// ¼üÌð·»è\nbool intersectedLL(line a, line b){ return !eq( cross(a.sc-a.fr,b.sc-b.fr), 0.0 ); }\n\n// ð_vZ\npoint intersectionSS(seg a, seg b)\n{\n elem d1 = dist_l(b,a.fr);\n elem d2 = dist_l(b,a.sc);\n return a.fr + ( d1 / (d1 + d2 ) ) * (a.sc-a.fr);\n}\npoint intersectionLL(line a, line b)\n{\n vec va = a.sc - a.fr;\n vec vb = b.sc - b.fr;\n return a.fr + va * ( cross(vb, b.fr - a.fr) / cross(vb,va) );\n}\n\n// üªð_êÅ\nbool intersectionLL(line a, line b, point &ret){\n return intersectedLL( a, b ) ? ret = intersectionLL( a, b ), true : false;\n}\nbool intersectionLH(line a, hline b, point &ret){\n point tmp;\n return intersectionLL(a,b,tmp) ? ( ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret=tmp, true : false ) : false;\n}\nbool intersectionLS(line l, seg s, point &ret){\n point tmp;\n return intersectionLL(l,s,tmp) ? ( ccw(s.fr,s.sc,tmp)&OVER ? ret=tmp, true : false ) : false;\n}\nbool intersectionHH(hline a, hline b, point &ret){\n point tmp;\n return intersectionLL(a,b,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT)&&ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\n}\nbool intersectionHS(hline a, seg s, point &ret){\n point tmp;\n return intersectionLS(a,s,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\n}\nbool intersectionSS(seg a, seg b, point &ret){\n return intersectedSS(a,b) ? ret = intersectionSS(a,b), true : false;\n}\n\npair<int, pair<double,double> > getLH(double x, const vector<point> &v)\n{\n point a,b;\n int cnt=0;\n line l(point(x,0),point(x,1));\n for(int i = 0; i < (int)v.size(); ++i){\n point is;\n if( intersectionLS( l, seg(v[i],v[(i+1)%v.size()]), is ) ){\n if(cnt==0){\n\ta = is;\n\t++cnt;\n }else if( far(is,a) ){\n\tb = is;\n\t++cnt;\n }\n }\n }\n if(cnt==1)b=a;\n if( a.imag() > b.imag() ) swap( a, b );\n return make_pair( cnt, make_pair(a.imag(), b.imag() ) );\n}\n\nstruct point3{\n double x,y,z;\n point3(double x, double y, double z):x(x),y(y),z(z){}\n point3 operator-(const point3 &t){\n return point3(x-t.x,y-t.y,z-t.z);\n }\n point3 operator+(const point3 &t){\n return point3(x+t.x,y+t.y,z+t.z);\n }\n};\n\nostream &operator<<(ostream &oss, const point3 &t)\n{\n oss << '('<<t.x <<','<< t.y<<','<<t.z<<')';\n return oss;\n}\n\ndouble dot3(point3 a, point3 b){\n return a.x*b.x + a.y*b.y + a.z*b.z;\n}\npoint3 cross3(point3 a, point3 b){\n return point3(a.y*b.z-b.y*a.z, a.z*b.x-b.z*a.x, a.x*b.y-b.x*a.y);\n}\n\ndouble tetrahedronVolume(point3 a, point3 b, point3 c, point3 d)\n{\n point3 A=b-a;\n point3 B=c-a;\n point3 C=d-a;\n return abs(dot3(A,cross3(B,C))/6);\n}\ndouble getVolume( const vector<point3> &V1, const vector<point3> &V2 )\n{\n double ret=0;\n vector<point3> v1 = V1;\n vector<point3> v2 = V2;\n if( v2.size() < v1.size() ){\n swap( v1, v2 );\n }\n if(v1.size()==1){\n if(v2.size()==2){\n ret = 0;\n }else if(v2.size()==4){\n ret+=tetrahedronVolume(v1[0],v2[0],v2[1],v2[2]);\n ret+=tetrahedronVolume(v1[0],v2[2],v2[3],v2[0]);\n }\n }else if(v1.size()==2){\n if(v2.size()==2){\n ret = tetrahedronVolume(v1[0],v1[1],v2[0],v2[1]);\n }else{\n if(eq(v1[0].y,v1[1].y)){\n\tret += tetrahedronVolume( v1[1],v1[0],v2[1],v2[2] );\n\tret += tetrahedronVolume( v1[0],v2[0],v2[1],v2[2] );\n\tret += tetrahedronVolume( v1[0],v2[2],v2[3],v2[0] );\n }else{\n\tret += tetrahedronVolume( v1[1],v1[0],v2[2],v2[3] );\n\tret += tetrahedronVolume( v1[0],v2[0],v2[1],v2[2] );\n\tret += tetrahedronVolume( v1[0],v2[2],v2[3],v2[0] );\n }\n }\n }else{\n ret += tetrahedronVolume( v1[1],v1[0],v2[1],v1[2] );\n ret += tetrahedronVolume( v2[0],v1[0],v2[3],v2[1] );\n ret += tetrahedronVolume( v1[3],v1[0],v1[2],v2[3] );\n\n ret += tetrahedronVolume( v2[2],v2[3],v2[1],v1[2] );\n ret += tetrahedronVolume( v1[0],v1[2],v2[1],v2[3] );\n }\n return ret;\n}\n\nint main()\n{\n int m,n;\n while(scanf(\"%d%d\", &m, &n) && m && n){\n double x,y;\n double res = 0;\n vector<point> P1;\n vector<point> P2;\n int minx1=1000,maxx1=-1000;\n int minx2=1000,maxx2=-1000;\n map<int,pair<double,double> > vx;\n for(int i = 0; i < m; ++i){\n scanf(\"%lf%lf\", &x, &y);\n P1.push_back(point(x,y));\n vx[(int)x]=make_pair(0,0);\n minx1 = min( (int)x, minx1 );\n maxx1 = max( (int)x, maxx1 );\n }\n for(int i = 0; i < n; ++i){\n scanf(\"%lf%lf\", &x, &y);\n P2.push_back(point(x,y));\n minx2 = min( (int)x, minx2 );\n maxx2 = max( (int)x, maxx2 );\n vx[(int)x]=make_pair(0,0);\n }\n retry:;\n for(map<int,pair<double,double> >::iterator itm = vx.begin(); itm != vx.end(); ++itm){\n pair<int, pair<double,double > > LH = getLH( itm->first, P1);\n if( !( minx1 <= itm->first && itm->first <= maxx1 &&\n\t minx2 <= itm->first && itm->first <= maxx2 ) ){\n\tvx.erase(itm);\n\tgoto retry;\n }\n if( LH.first == 0 ){\n\tvx.erase(itm);\n\tgoto retry;\n }else{\n\titm->second = LH.second;\n }\n }\n vector< vector<point3> > V;\n for(map<int,pair<double,double> >::iterator itm = vx.begin(); itm != vx.end(); ++itm){\n vector<point3> vpx;\n double x = itm->first;\n double y1 = itm->second.first;\n double y2 = itm->second.second;\n\n if( eq(y1,y2) ){\n\tpair<int,pair<double,double> > Z = getLH( x, P2 );\n\tdouble z1 = Z.second.first;\n\tdouble z2 = Z.second.second;\n\tif( eq(z1,z2) ){\n\t vpx.push_back( point3( x,y1,z1 ) );\n\t}else{\n\t vpx.push_back( point3( x,y1,z1 ) );\n\t vpx.push_back( point3( x,y1,z2 ) );\n\t}\n }else{\n\tpair<int,pair<double,double> > Z = getLH( x, P2 );\n\tdouble z1 = Z.second.first;\n\tdouble z2 = Z.second.second;\n\tif( eq(z1,z2) ){\n\t vpx.push_back( point3( x,y1,z1 ) );\n\t vpx.push_back( point3( x,y2,z1 ) );\n\t}else{\n\t vpx.push_back( point3( x,y1,z1 ) );\n\t vpx.push_back( point3( x,y1,z2 ) );\n\t vpx.push_back( point3( x,y2,z2 ) );\n\t vpx.push_back( point3( x,y2,z1 ) );\n\t}\n }\n \n /*\n for(int i = 0; i < (int)vpx.size(); ++i){\n\tcout << vpx[i] << ' ';\n }\n cout << endl;\n */\n\n V.push_back( vpx );\n }\n for(int i = 0; i < (int)V.size()-1; ++i){\n //cout << i << ' ' << i+1 << endl;\n res += getVolume(V[i], V[i+1]);\n }\n printf(\"%.13lf\\n\", res);\n //return 0;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0018,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1313_6066782\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\n#define double long double\\n\\nconst double eps = 1e-9;\\n\\n// Geometry Library\\n// written by okuraofvegetable\\n\\n#define pb push_back\\n#define DOUBLE_INF 1e50\\n#define Points vector<Point>\\n\\n#define EQ(a, b) (abs((a) - (b)) < eps)\\n#define GT(a, b) ((a) > (b))\\n#define GE(a, b) (GT(a, b) || EQ(a, b))\\n#define LT(a, b) ((a) < (b))\\n#define LE(a, b) (LT(a, b) || EQ(a, b))\\n\\ninline double add(double a, double b) {\\n if (abs(a + b) < eps * (abs(a) + abs(b))) return 0;\\n return a + b;\\n}\\n\\n// --------------------- Point -----------------------\\n\\n#define Vector Point\\nstruct Point {\\n double x, y;\\n Point() {}\\n Point(double x, double y) : x(x), y(y) {}\\n Point operator+(Point p) { return Point(add(x, p.x), add(y, p.y)); }\\n Point operator-(Point p) { return Point(add(x, -p.x), add(y, -p.y)); }\\n Point operator*(double d) { return Point(x * d, y * d); }\\n Point operator/(double d) { return Point(x / d, y / d); }\\n double dot(Point p) { return add(x * p.x, y * p.y); }\\n double det(Point p) { return add(x * p.y, -y * p.x); }\\n double norm() { return sqrt(x * x + y * y); }\\n double norm2() { return x * x + y * y; }\\n double dist(Point p) { return ((*this) - p).norm(); }\\n double dist2(Point p) { return sq(x - p.x) + sq(y - p.y); }\\n double arg() { return atan2(y, x); } // [-PI,PI]\\n double arg(Vector v) { return v.arg() - arg(); } // henkaku\\n double angle(Vector v) { // [0,PI]\\n return acos(cos(arg(v)));\\n }\\n Vector normalize() { return (*this) * (1.0 / norm()); }\\n Point vert() { return Point(y, -x); }\\n\\n // Signed area of triange (0,0) (x,y) (p.x,p.y)\\n double area(Point p) { return (x * p.y - p.x * y) / 2.0; }\\n friend istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }\\n friend ostream &operator<<(ostream &os, const Point &p) {\\n return os << '(' << p.x << ',' << p.y << ')';\\n }\\n};\\n\\nPoint divide_rate(Point a, Point b, double A, double B) {\\n assert(!EQ(A + B, 0.0));\\n return (a * B + b * A) * (1.0 / (A + B));\\n}\\n\\nVector polar(double len, double arg) {\\n return Vector(cos(arg) * len, sin(arg) * len);\\n}\\n\\n// Direction a -> b -> c\\n// verified AOJ CGL_1_C\\nenum { COUNTER_CLOCKWISE, CLOCKWISE, ONLINE_BACK, ONLINE_FRONT, ON_SEGMENT };\\nint ccw(Point a, Point b, Point c) {\\n Vector p = b - a;\\n Vector q = c - a;\\n if (p.det(q) > 0.0) return COUNTER_CLOCKWISE; // counter clockwise\\n if (p.det(q) < 0.0) return CLOCKWISE; // clockwise\\n if (p.dot(q) < 0.0) return ONLINE_BACK; // c--a--b online_back\\n if (p.norm() < q.norm()) return ONLINE_FRONT; // a--b--c online_front\\n return ON_SEGMENT; // a--c--b on_segment\\n}\\n\\n// --------------------- Line ------------------------\\nstruct Line {\\n Point a, b;\\n Line() {}\\n Line(Point a, Point b) : a(a), b(b) {}\\n bool on(Point q) { return EQ((a - q).det(b - q), 0.0); }\\n // following 2 functions verified AOJ CGL_2_A\\n bool is_parallel(Line l) { return EQ((a - b).det(l.a - l.b), 0.0); }\\n bool is_orthogonal(Line l) { return EQ((a - b).dot(l.a - l.b), 0.0); }\\n Point intersection(Line l) {\\n assert(!is_parallel(l));\\n return a + (b - a) * ((l.b - l.a).det(l.a - a) / (l.b - l.a).det(b - a));\\n }\\n // Projection of p to this line\\n // verified AOJ CGL_1_A\\n Point projection(Point p) {\\n return (b - a) * ((b - a).dot(p - a) / (b - a).norm2()) + a;\\n }\\n double distance(Point p) {\\n Point q = projection(p);\\n return p.dist(q);\\n }\\n // Reflection point of p onto this line\\n // verified AOJ CGL_1_B\\n Point refl(Point p) {\\n Point proj = projection(p);\\n return p + ((proj - p) * 2.0);\\n }\\n bool left(Point p) {\\n if ((p - a).det(b - a) > 0.0)\\n return true;\\n else\\n return false;\\n }\\n friend istream &operator>>(istream &is, Line &l) { return is >> l.a >> l.b; }\\n friend ostream &operator<<(ostream &os, const Line &l) {\\n return os << l.a << \\\" -> \\\" << l.b;\\n }\\n};\\n\\n// ------------------- Segment ----------------------\\nstruct Segment {\\n Point a, b;\\n Segment() {}\\n Segment(Point a, Point b) : a(a), b(b) {}\\n Line line() { return Line(a, b); }\\n bool on(Point q) {\\n return (EQ((a - q).det(b - q), 0.0) && LE((a - q).dot(b - q), 0.0));\\n }\\n // verified AOJ CGL_2_B\\n bool is_intersect(Segment s) {\\n if (line().is_parallel(s.line())) {\\n if (on(s.a) || on(s.b)) return true;\\n if (s.on(a) || s.on(b)) return true;\\n return false;\\n }\\n Point p = line().intersection(s.line());\\n if (on(p) && s.on(p))\\n return true;\\n else\\n return false;\\n }\\n bool is_intersect(Line l) {\\n if (line().is_parallel(l)) {\\n if (l.on(a) || l.on(b))\\n return true;\\n else\\n return false;\\n }\\n Point p = line().intersection(l);\\n if (on(p))\\n return true;\\n else\\n return false;\\n }\\n // following 2 distance functions are verified at AOJ CGL_2_D\\n double distance(Point p) {\\n double res = DOUBLE_INF;\\n Point q = line().projection(p);\\n if (on(q)) res = min(res, p.dist(q));\\n res = min(res, min(p.dist(a), p.dist(b)));\\n return res;\\n }\\n double distance(Segment s) {\\n if (is_intersect(s)) return 0.0;\\n double res = DOUBLE_INF;\\n res = min(res, s.distance(a));\\n res = min(res, s.distance(b));\\n res = min(res, this->distance(s.a));\\n res = min(res, this->distance(s.b));\\n return res;\\n }\\n friend istream &operator>>(istream &is, Segment &s) {\\n return is >> s.a >> s.b;\\n }\\n friend ostream &operator<<(ostream &os, const Segment &s) {\\n return os << s.a << \\\" -> \\\" << s.b;\\n }\\n};\\n\\ntypedef vector<Point> Polygon;\\n\\nbool solve() {\\n int m, n;\\n cin >> m >> n;\\n if (n == 0 && m == 0) return false;\\n Polygon a(m), b(n);\\n cin >> a >> b;\\n\\n double a_x_max = -200, b_x_max = -200;\\n double a_x_min = 200, b_x_min = 200;\\n\\n for (int i = 0; i < m; i++) {\\n chmax(a_x_max, a[i].x);\\n chmin(a_x_min, a[i].x);\\n }\\n\\n for (int i = 0; i < n; i++) {\\n chmax(b_x_max, b[i].x);\\n chmin(b_x_min, b[i].x);\\n }\\n\\n // if (a_x_max - eps < b_x_min || b_x_max - eps < a_x_min) {\\n // cout << 0.0 << endl;\\n // return true;\\n // }\\n\\n auto intersection_length = [&](const Polygon &pol, const Line &l) {\\n vector<Point> ps;\\n for (int i = 0; i < pol.size(); i++) {\\n Segment seg(pol[i], pol[(i + 1) % pol.size()]);\\n if (seg.a.x < l.a.x && seg.b.x < l.a.x) continue;\\n if (seg.a.x > l.a.x && seg.b.x > l.a.x) continue;\\n // if (seg.line().is_parallel(l) && EQ(pol[i].x, l.a.x)) return -1.0;\\n if (seg.line().is_parallel(l)) continue;\\n if (!seg.is_intersect(l)) continue;\\n Point inter = seg.line().intersection(l);\\n bool is_new = true;\\n for (auto &p : ps) {\\n if ((p - inter).norm() < eps) is_new = false;\\n }\\n if (is_new) ps.push_back(inter);\\n }\\n assert(ps.size() <= 2);\\n dmp(ps);\\n if (ps.size() == 2) return (ps[0] - ps[1]).norm();\\n return (double)0.0;\\n };\\n\\n auto f = [&](double x) {\\n // cerr << fixed << setprecision(20) << x << endl;\\n Line l(Point(x, 0), Point(x, 1));\\n auto len_a = intersection_length(a, l);\\n if (EQ(len_a, 0.0)) return (double)0.0;\\n auto len_b = intersection_length(b, l);\\n if (EQ(len_b, 0.0)) return (double)0.0;\\n dmp(x, len_a, len_b);\\n return len_a * len_b;\\n };\\n\\n double ans = 0.0;\\n double s = -100, step = 1.0;\\n while (s + step <= 105) {\\n double mid = s + step / 2.0;\\n if (a_x_min <= mid && mid <= a_x_max && b_x_min <= mid && mid <= b_x_max) {\\n double p = f(s), q = f(mid), r = f(s + step);\\n ans += (p + 4.0 * q + r) * step / 6.0;\\n }\\n s += step;\\n }\\n cout << ans << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n while (solve()) {}\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.9988,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1313_6066758\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\n#define double long double\\n\\nconst double eps = 1e-9;\\n\\n// Geometry Library\\n// written by okuraofvegetable\\n\\n#define pb push_back\\n#define DOUBLE_INF 1e50\\n#define Points vector<Point>\\n\\n#define EQ(a, b) (abs((a) - (b)) < eps)\\n#define GT(a, b) ((a) > (b))\\n#define GE(a, b) (GT(a, b) || EQ(a, b))\\n#define LT(a, b) ((a) < (b))\\n#define LE(a, b) (LT(a, b) || EQ(a, b))\\n\\ninline double add(double a, double b) {\\n if (abs(a + b) < eps * (abs(a) + abs(b))) return 0;\\n return a + b;\\n}\\n\\n// --------------------- Point -----------------------\\n\\n#define Vector Point\\nstruct Point {\\n double x, y;\\n Point() {}\\n Point(double x, double y) : x(x), y(y) {}\\n Point operator+(Point p) { return Point(add(x, p.x), add(y, p.y)); }\\n Point operator-(Point p) { return Point(add(x, -p.x), add(y, -p.y)); }\\n Point operator*(double d) { return Point(x * d, y * d); }\\n Point operator/(double d) { return Point(x / d, y / d); }\\n double dot(Point p) { return add(x * p.x, y * p.y); }\\n double det(Point p) { return add(x * p.y, -y * p.x); }\\n double norm() { return sqrt(x * x + y * y); }\\n double norm2() { return x * x + y * y; }\\n double dist(Point p) { return ((*this) - p).norm(); }\\n double dist2(Point p) { return sq(x - p.x) + sq(y - p.y); }\\n double arg() { return atan2(y, x); } // [-PI,PI]\\n double arg(Vector v) { return v.arg() - arg(); } // henkaku\\n double angle(Vector v) { // [0,PI]\\n return acos(cos(arg(v)));\\n }\\n Vector normalize() { return (*this) * (1.0 / norm()); }\\n Point vert() { return Point(y, -x); }\\n\\n // Signed area of triange (0,0) (x,y) (p.x,p.y)\\n double area(Point p) { return (x * p.y - p.x * y) / 2.0; }\\n friend istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }\\n friend ostream &operator<<(ostream &os, const Point &p) {\\n return os << '(' << p.x << ',' << p.y << ')';\\n }\\n};\\n\\nPoint divide_rate(Point a, Point b, double A, double B) {\\n assert(!EQ(A + B, 0.0));\\n return (a * B + b * A) * (1.0 / (A + B));\\n}\\n\\nVector polar(double len, double arg) {\\n return Vector(cos(arg) * len, sin(arg) * len);\\n}\\n\\n// Direction a -> b -> c\\n// verified AOJ CGL_1_C\\nenum { COUNTER_CLOCKWISE, CLOCKWISE, ONLINE_BACK, ONLINE_FRONT, ON_SEGMENT };\\nint ccw(Point a, Point b, Point c) {\\n Vector p = b - a;\\n Vector q = c - a;\\n if (p.det(q) > 0.0) return COUNTER_CLOCKWISE; // counter clockwise\\n if (p.det(q) < 0.0) return CLOCKWISE; // clockwise\\n if (p.dot(q) < 0.0) return ONLINE_BACK; // c--a--b online_back\\n if (p.norm() < q.norm()) return ONLINE_FRONT; // a--b--c online_front\\n return ON_SEGMENT; // a--c--b on_segment\\n}\\n\\n// --------------------- Line ------------------------\\nstruct Line {\\n Point a, b;\\n Line() {}\\n Line(Point a, Point b) : a(a), b(b) {}\\n bool on(Point q) { return EQ((a - q).det(b - q), 0.0); }\\n // following 2 functions verified AOJ CGL_2_A\\n bool is_parallel(Line l) { return EQ((a - b).det(l.a - l.b), 0.0); }\\n bool is_orthogonal(Line l) { return EQ((a - b).dot(l.a - l.b), 0.0); }\\n Point intersection(Line l) {\\n assert(!is_parallel(l));\\n return a + (b - a) * ((l.b - l.a).det(l.a - a) / (l.b - l.a).det(b - a));\\n }\\n // Projection of p to this line\\n // verified AOJ CGL_1_A\\n Point projection(Point p) {\\n return (b - a) * ((b - a).dot(p - a) / (b - a).norm2()) + a;\\n }\\n double distance(Point p) {\\n Point q = projection(p);\\n return p.dist(q);\\n }\\n // Reflection point of p onto this line\\n // verified AOJ CGL_1_B\\n Point refl(Point p) {\\n Point proj = projection(p);\\n return p + ((proj - p) * 2.0);\\n }\\n bool left(Point p) {\\n if ((p - a).det(b - a) > 0.0)\\n return true;\\n else\\n return false;\\n }\\n friend istream &operator>>(istream &is, Line &l) { return is >> l.a >> l.b; }\\n friend ostream &operator<<(ostream &os, const Line &l) {\\n return os << l.a << \\\" -> \\\" << l.b;\\n }\\n};\\n\\n// ------------------- Segment ----------------------\\nstruct Segment {\\n Point a, b;\\n Segment() {}\\n Segment(Point a, Point b) : a(a), b(b) {}\\n Line line() { return Line(a, b); }\\n bool on(Point q) {\\n return (EQ((a - q).det(b - q), 0.0) && LE((a - q).dot(b - q), 0.0));\\n }\\n // verified AOJ CGL_2_B\\n bool is_intersect(Segment s) {\\n if (line().is_parallel(s.line())) {\\n if (on(s.a) || on(s.b)) return true;\\n if (s.on(a) || s.on(b)) return true;\\n return false;\\n }\\n Point p = line().intersection(s.line());\\n if (on(p) && s.on(p))\\n return true;\\n else\\n return false;\\n }\\n bool is_intersect(Line l) {\\n if (line().is_parallel(l)) {\\n if (l.on(a) || l.on(b))\\n return true;\\n else\\n return false;\\n }\\n Point p = line().intersection(l);\\n if (on(p))\\n return true;\\n else\\n return false;\\n }\\n // following 2 distance functions are verified at AOJ CGL_2_D\\n double distance(Point p) {\\n double res = DOUBLE_INF;\\n Point q = line().projection(p);\\n if (on(q)) res = min(res, p.dist(q));\\n res = min(res, min(p.dist(a), p.dist(b)));\\n return res;\\n }\\n double distance(Segment s) {\\n if (is_intersect(s)) return 0.0;\\n double res = DOUBLE_INF;\\n res = min(res, s.distance(a));\\n res = min(res, s.distance(b));\\n res = min(res, this->distance(s.a));\\n res = min(res, this->distance(s.b));\\n return res;\\n }\\n friend istream &operator>>(istream &is, Segment &s) {\\n return is >> s.a >> s.b;\\n }\\n friend ostream &operator<<(ostream &os, const Segment &s) {\\n return os << s.a << \\\" -> \\\" << s.b;\\n }\\n};\\n\\ntypedef vector<Point> Polygon;\\n\\nbool solve() {\\n int m, n;\\n cin >> m >> n;\\n if (n == 0 && m == 0) return false;\\n Polygon a(m), b(n);\\n cin >> a >> b;\\n\\n double a_x_max = -200, b_x_max = -200;\\n double a_x_min = 200, b_x_min = 200;\\n\\n for (int i = 0; i < m; i++) {\\n chmax(a_x_max, a[i].x);\\n chmin(a_x_min, a[i].x);\\n }\\n\\n for (int i = 0; i < n; i++) {\\n chmax(b_x_max, b[i].x);\\n chmin(b_x_min, b[i].x);\\n }\\n\\n // if (a_x_max - eps < b_x_min || b_x_max - eps < a_x_min) {\\n // cout << 0.0 << endl;\\n // return true;\\n // }\\n\\n auto intersection_length = [&](const Polygon &pol, const Line &l) {\\n vector<Point> ps;\\n for (int i = 0; i < pol.size(); i++) {\\n Segment seg(pol[i], pol[(i + 1) % pol.size()]);\\n if (seg.a.x < l.a.x && seg.b.x < l.a.x) continue;\\n if (seg.a.x > l.a.x && seg.b.x > l.a.x) continue;\\n // if (seg.line().is_parallel(l) && EQ(pol[i].x, l.a.x)) return -1.0;\\n if (seg.line().is_parallel(l)) continue;\\n if (!seg.is_intersect(l)) continue;\\n Point inter = seg.line().intersection(l);\\n bool is_new = true;\\n for (auto &p : ps) {\\n if ((p - inter).norm() < eps) is_new = false;\\n }\\n if (is_new) ps.push_back(inter);\\n }\\n assert(ps.size() <= 2);\\n dmp(ps);\\n if (ps.size() == 2) return (ps[0] - ps[1]).norm();\\n return (double)0.0;\\n };\\n\\n auto f = [&](double x) {\\n // cerr << fixed << setprecision(20) << x << endl;\\n Line l(Point(x, 0), Point(x, 1));\\n auto len_a = intersection_length(a, l);\\n if (EQ(len_a, 0.0)) return (double)0.0;\\n auto len_b = intersection_length(b, l);\\n if (EQ(len_b, 0.0)) return (double)0.0;\\n dmp(x, len_a, len_b);\\n return len_a * len_b;\\n };\\n\\n double ans = 0.0;\\n double s = -100, step = 1.0;\\n while (s + step <= 105) {\\n double mid = s + step / 2.0;\\n if (a_x_min <= mid && mid <= a_x_max && b_x_min <= mid && mid <= b_x_max) {\\n double p = f(s), q = f(s + step / 2.0), r = f(s + step);\\n ans += (p + 4.0 * q + r) * step / 6.0;\\n }\\n s += step;\\n }\\n cout << ans << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n while (solve()) {}\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -1,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1313_3978161\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<typename F>\\nstruct Point {\\n F x, y;\\n Point(F x = 0, F y = 0) : x(x), y(y) {}\\n bool operator<(const Point &oth) const {\\n return x == oth.x ? y < oth.y : x < oth.x;\\n }\\n Point operator-(const Point &oth) const {\\n return Point(x - oth.x, y - oth.y);\\n }\\n};\\n\\ntemplate<typename F>\\nusing Polygon = vector<Point<F>>;\\n\\ntemplate<typename F>\\nPolygon<F> upperConvexHull(Polygon<F> P) {\\n reverse(P.begin(), P.end());\\n rotate(P.begin(), min_element(P.begin(), P.end(), [](Point<F> a, Point<F> b) {\\n return a.x == b.x ? a.y > b.y : a.x < b.x;\\n }), P.end());\\n int n = P.size();\\n Polygon<F> ret = {P[0]};\\n for (int i = 1; i < n; ++i) {\\n auto dir = P[i] - P[i - 1];\\n if (dir.x > 0) ret.push_back(P[i]);\\n }\\n return ret;\\n}\\n\\ntemplate<typename F>\\nPolygon<F> lowerConvexHull(Polygon<F> P) {\\n rotate(P.begin(), min_element(P.begin(), P.end()), P.end());\\n int n = P.size();\\n Polygon<F> ret = {P[0]};\\n for (int i = 1; i < n; ++i) {\\n auto dir = P[i] - P[i - 1];\\n if (dir.x > 0) ret.push_back(P[i]);\\n }\\n return ret;\\n}\\n\\ntemplate<typename F>\\ndouble getLen(F x, Polygon<F> U, Polygon<F> L) {\\n int i = upper_bound(U.begin(), U.end(), Point<F>(x, -1e9)) - U.begin();\\n int j = upper_bound(L.begin(), L.end(), Point<F>(x, -1e9)) - L.begin();\\n if (i == U.size() or j == L.size()) return 0;\\n if (i == 0 and U[i].x > x) return 0;\\n if (j == 0 and L[j].x > x) return 0;\\n auto getY = [&](double x, int i, Polygon<F> P) -> double {\\n if (i == 0) return P[i].y;\\n return P[i].y - (double) (P[i].y - P[i - 1].y) / \\n (P[i].x - P[i - 1].x) * \\n (P[i].x - x);\\n };\\n return getY(x, i, U) - getY(x, j, L);\\n}\\n\\n\\ntemplate<typename Double>\\nclass Integration {\\n Double ALPHA = sqrt((5 - sqrt(40. / 7))) / 3, WA = (322 + sqrt(11830)) / 900;\\n Double W0 = 128. / 225.;\\n Double BETA = sqrt((5 + sqrt(40. / 7))) / 3, WB = (322 - sqrt(11830)) / 900;\\n function<Double(Double)> f;\\n Double quadrature(Double l, Double r) {\\n auto m = (l + r) / 2, len = r - m;\\n return (f(m - ALPHA * len) * WA + f(m - BETA * len) * WB + f(m) * W0 +\\n f(m + ALPHA * len) * WA + f(m + BETA * len) * WB) * len;\\n }\\n Double askArea(Double l, Double r, Double exceptArea) {\\n Double m = (l + r) / 2, L = quadrature(l, m), R = quadrature(m, r);\\n if (abs(L + R - exceptArea) < 1e-10)\\n return L + R;\\n else return askArea(l, m, L) + askArea(m, r, R);\\n }\\npublic:\\n Integration(function<Double(Double)> func) : f(func) {}\\n Double intergal(Double l, Double r, int piece = 10) {\\n Double ans = 0;\\n for (Double dx = (r - l) / piece, i = 0; i < piece; ++i) {\\n auto cur = l + dx * i;\\n ans += askArea(cur, cur + dx, quadrature(cur, cur + dx));\\n }\\n return ans;\\n }\\n};\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(0);\\n int n, m; \\n while (cin >> n >> m and n and m) {\\n Polygon<double> Z, Y;\\n vector<int> Xs;\\n for (int i = 0; i < n; ++i) {\\n int x, y; cin >> x >> y;\\n Z.emplace_back(x, y);\\n Xs.emplace_back(x);\\n }\\n for (int i = 0; i < m; ++i) {\\n int x, y; cin >> x >> y;\\n Y.emplace_back(x, y);\\n Xs.emplace_back(x);\\n }\\n sort(Xs.begin(), Xs.end());\\n Xs.erase(unique(Xs.begin(), Xs.end()), Xs.end());\\n Polygon<double> UZ = upperConvexHull(Z);\\n Polygon<double> LZ = lowerConvexHull(Z);\\n Polygon<double> UY = upperConvexHull(Y);\\n Polygon<double> LY = lowerConvexHull(Y);\\n double preX = Xs[0];\\n double ans = 0;\\n Integration<double> formula([=](double x) {\\n return getLen(x, UZ, LZ) * getLen(x, UY, LY);\\n });\\n for (int x : Xs) {\\n ans += formula.intergal(preX, x);\\n preX = x;\\n }\\n cout << fixed << setprecision(10) << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.9642,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1313_3042345\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <complex>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <array>\\nusing namespace std;\\nconst double EPS = 1e-10;\\nconst double INF = 1e12;\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return (a.X!=b.X) ? a.X<b.X : a.Y<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\n\\nbool intersectLS(const L& l, const L& s){\\n return cross(l[1]-l[0], s[0]-l[0])*\\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\ndouble getarea(const VP &poly){\\n double ret = 0;\\n for (int i=0; i<(int)poly.size(); i++){ \\n ret += cross(poly[i], poly[(i+1)%poly.size()]);\\n }\\n return ret*0.5;\\n}\\n\\nVP convex_cut(const VP& p, const L& l){\\n VP ret;\\n int n = p.size();\\n for(int i=0; i<n; i++){\\n P curr = p[i];\\n P next = p[(i+1)%n];\\n if(ccw(l[0], l[1], curr) != -1) ret.push_back(curr);\\n if(ccw(l[0], l[1], curr) *ccw(l[0], l[1], next) == -1){\\n ret.push_back(crosspointLL(L(curr, next), l));\\n }\\n }\\n return ret;\\n}\\n\\nstruct c2cut{\\n double z, x[2];\\n c2cut(double z, double xmin, double xmax):z(z),x{xmin, xmax}{}\\n c2cut(){}\\n bool operator <(const c2cut &a){\\n return z < a.z;\\n }\\n bool operator ==(const c2cut &a){\\n return z == a.z;\\n }\\n};\\n\\nint main(){\\n while(1){\\n int m,n;\\n cin >> m >> n;\\n if(n==0) break;\\n \\n VP c1(m), c2(n);\\n for(int i=0; i<m; i++){\\n double x,y;\\n cin >> x >> y;\\n c1[i] = P(x, y);\\n }\\n for(int i=0; i<n; i++){\\n double x,z;\\n cin >> x >> z;\\n c2[i] = P(x, z);\\n }\\n \\n vector<c2cut> cz(n);\\n for(int i=0; i<n; i++){\\n double z = c2[i].Y;\\n L cutline(P(0, z), P(1, z));\\n vector<double> cpx;\\n for(int i=0; i<n; i++){\\n L edge(c2[i], c2[(i+1)%n]);\\n if(!isParallel(cutline, edge) && intersectLS(cutline, edge)){\\n cpx.push_back((crosspointLL(cutline, edge)).X);\\n }\\n }\\n double xmin = *min_element(cpx.begin(), cpx.end());\\n double xmax = *max_element(cpx.begin(), cpx.end());\\n cz[i] = c2cut(z, xmin, xmax);\\n }\\n sort(cz.begin(), cz.end());\\n cz.erase(unique(cz.begin(), cz.end()), cz.end());\\n\\n double ans = 0;\\n for(int i=0; i<(int)cz.size()-1; i++){\\n vector<double> zdiff;\\n for(int d=0; d<2; d++){\\n double x[2] = {cz[i].x[d], cz[i+1].x[d]};\\n if(abs(x[1]-x[0]) < EPS) continue;\\n if(x[0] > x[1]) swap(x[0], x[1]);\\n L cut[2] = {L(P(x[1], 0), P(x[1], 1)), L(P(x[0], 1), P(x[0], 0))};\\n VP p = convex_cut(c1, cut[0]);\\n p = convex_cut(p, cut[1]);\\n for(int j=0; j<(int)p.size(); j++){\\n double xdiff = abs(p[j].X -cz[i].x[d]);\\n zdiff.push_back((cz[i+1].z -cz[i].z) *xdiff/(x[1]-x[0]));\\n }\\n }\\n for(int d=0; d<2; d++){\\n int xmax = cz[i+d].x[1];\\n int xmin = cz[i+d].x[0];\\n L cut[2] = {L(P(xmax, 0), P(xmax, 1)), L(P(xmin, 1), P(xmin, 0))};\\n VP p = convex_cut(c1, cut[0]);\\n p = convex_cut(p, cut[1]);\\n if(!p.empty()){\\n zdiff.push_back((cz[i+1].z -cz[i].z) *d);\\n }\\n }\\n sort(zdiff.begin(), zdiff.end());\\n zdiff.erase(unique(zdiff.begin(), zdiff.end()), zdiff.end());\\n\\n for(int j=0; j<(int)zdiff.size()-1; j++){\\n double z[3];\\n z[0] = cz[i].z +zdiff[j];\\n z[2] = cz[i].z +zdiff[j+1];\\n z[1] = (z[0] +z[2])/2;\\n double area[3];\\n for(int k=0; k<3; k++){\\n L cutline(P(0, z[k]), P(1, z[k]));\\n vector<double> cpx;\\n for(int i=0; i<n; i++){\\n L edge(c2[i], c2[(i+1)%n]);\\n if(!isParallel(cutline, edge) && intersectLS(cutline, edge)){\\n cpx.push_back((crosspointLL(cutline, edge)).X);\\n }\\n }\\n double xmin = *min_element(cpx.begin(), cpx.end());\\n double xmax = *max_element(cpx.begin(), cpx.end());\\n L cut[2] = {L(P(xmax, 0), P(xmax, 1)), L(P(xmin, 1), P(xmin, 0))};\\n VP con = convex_cut(c1, cut[0]);\\n con = convex_cut(con, cut[1]);\\n area[k] = getarea(con);\\n }\\n ans += (z[2] -z[0])/6 *(area[0] +4*area[1] +area[2]);\\n }\\n }\\n\\n cout << fixed << setprecision(10);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.9489,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1313_2423083\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define ll long long\\n#define INF 1000000005\\n#define MOD 1000000007\\n#define EPS 1e-10\\n#define rep(i,n) for(int i=0;i<(int)n;++i)\\n#define each(a, b) for(auto (a): (b))\\n#define all(v) (v).begin(),(v).end()\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define show(x) cout <<#x<<\\\" = \\\"<<(x)<<endl\\n#define spair(p) cout <<#p<<\\\": \\\"<<p.fi<<\\\" \\\"<<p.se<<endl\\n#define svec(v) cout<<#v<<\\\":\\\";rep(kbrni,v.size())cout<<\\\" \\\"<<v[kbrni];cout<<endl\\n#define sset(s) cout<<#s<<\\\":\\\";each(kbrni,s)cout <<\\\" \\\"<<kbrni;cout<<endl\\n\\nusing namespace std;\\n\\ntypedef complex<double> C;\\ntypedef pair<int,int>P;\\n\\nnamespace std\\n{\\n bool operator < (const C a, const C b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\nstruct L : public vector<C>\\n{\\n L(const C a, const C b) {\\n push_back(a); push_back(b);\\n }\\n};\\n\\nbool eq(double a,double b)\\n{\\n return (-EPS<a-b&&a-b<EPS);\\n}\\n\\nbool eq(C c1,C c2)\\n{\\n return (eq(c1.real(),c2.real()) && eq(c1.imag(),c2.imag()));\\n}\\n\\n//?????¶??????sqrt\\ndouble Sqrt(double x)\\n{\\n if(x<0) return 0;\\n else return sqrt(x);\\n}\\n\\n//??£??????\\nC normalize(C c)\\n{\\n return c / abs(c);\\n}\\n\\n//?§????(rad)\\ndouble getarg(C a,C b){\\n return arg(b*conj(a));\\n}\\n\\n//??????\\ndouble cross(const C a, const C b)\\n{\\n return imag(conj(a)*b);\\n}\\n//??????\\ndouble dot(const C a, const C b)\\n{\\n return real(conj(a)*b);\\n}\\n\\nint ccw(C a, C b, C c)\\n{\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0;\\n}\\n//??´???????????????????????????(????????´??????True)\\nbool intersectLL(const L &l, const L &m)\\n{\\n return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;\\n}\\n//??´?????¨?????????????????????(????????±??????????????¨??????)\\nbool intersectLS(const L &l, const L &s)\\n{\\n return cross(l[1]-l[0], s[0]-l[0]) * cross(l[1]-l[0], s[1]-l[0]) < EPS;\\n}\\n//??´?????¨????????????(??±???)??????\\nbool intersectLP(const L &l, const C p)\\n{\\n return abs(cross(l[1]-p, l[0]-p)) < EPS;\\n}\\n//??????????????????????????????(????????±??????????????¨??????)\\nbool intersectSS(const L &s, const L &t)\\n{\\n return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 && ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;\\n}\\n//????????¨????????????(??±???)??????\\nbool intersectSP(const L &s, const C p)\\n{\\n return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS;\\n}\\n//???p?????´???l???????°???±\\nC projection(const L &l, const C p)\\n{\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\n}\\n//???p?????´???l????????¨??????????§°?§????\\nC reflection(const L &l, const C p)\\n{\\n return p + (projection(l, p) - p)*2.0;\\n}\\n//?????¨??´???????????¢\\ndouble distanceLP(const L &l, const C p)\\n{\\n return abs(p - projection(l, p));\\n}\\n//??´?????¨??´???????????¢\\ndouble distanceLL(const L &l, const L &m)\\n{\\n return intersectLL(l, m) ? 0 : distanceLP(l, m[0]);\\n}\\n//??´?????¨??????????????¢\\ndouble distanceLS(const L &l, const L &s)\\n{\\n if (intersectLS(l, s)) return 0;\\n return min(distanceLP(l, s[0]), distanceLP(l, s[1]));\\n}\\n//????????¨???????????¢\\ndouble distanceSP(const L &s, const C p)\\n{\\n const C r = projection(s, p);\\n if (intersectSP(s, r)) return abs(r - p);\\n return min(abs(s[0] - p), abs(s[1] - p));\\n}\\n//????????¨??????????????¢\\ndouble distanceSS(const L &s, const L &t)\\n{\\n if (intersectSS(s, t)) return 0;\\n return min(min(distanceSP(s, t[0]), distanceSP(s, t[1])),min(distanceSP(t, s[0]), distanceSP(t, s[1])));\\n}\\n//??´???????????????????????????\\nC crosspointLL(const L &l, const L &m)\\n{\\n double A = cross(l[1] - l[0], m[1] - m[0]);\\n double B = cross(l[1] - l[0], l[1] - m[0]);\\n //????????´????????¨???\\n if(abs(A) < EPS && abs(B) < EPS){\\n return m[0];\\n }\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n//?????¨??´????????????\\ndouble gettime(C c1,C c2)\\n{\\n return (dot(c1,c2) < 0 ? -1.0 : 1.0 ) * abs(c2) / abs(c1);\\n}\\n//?????¨??´????????????\\nvector<C> crosspointCL(C c1,double r1,L l)\\n{\\n C a=l[0], b=l[1];\\n vector<C> res;\\n C base=b-a, target=projection(L(a,b),c1);\\n double length=abs(base), h=abs(c1-target);\\n base/=length;\\n if(r1+EPS<h) return res;\\n double w=Sqrt(r1*r1-h*h);\\n double LL=gettime(normalize(b-a),target-a)-w,RR=LL+w*2.0;\\n res.push_back(a+base*LL);\\n if(eq(LL,RR)) return res;\\n res.push_back(a+base*RR);\\n return res;\\n}\\n//?????¨???????????????\\nvector<C> crosspointCS(C c1,double r1,L s)\\n{\\n vector<C> tmp=crosspointCL(c1,r1,s);\\n vector<C> res;\\n rep(i,tmp.size()){\\n if(eq(abs(s[1]-s[0]),abs(s[0]-tmp[i])+abs(s[1]-tmp[i]))){\\n res.push_back(tmp[i]);\\n }\\n }\\n return res;\\n}\\n//?????????????????????\\nL crosspointCC(const C c1, const double r1, const C c2, const double r2)\\n{\\n C a = conj(c2-c1), b = (r2*r2-r1*r1-(c2-c1)*conj(c2-c1)), c = r1*r1*(c2-c1);\\n C d = b*b-4.0*a*c;\\n C z1 = (-b+sqrt(d))/(2.0*a)+c1, z2 = (-b-sqrt(d))/(2.0*a)+c1;\\n return L(z1, z2);\\n}\\n//?????¨????§???¢?????±?????¨????????¢???\\ndouble getarea(C c1,double r1,C a,C b)\\n{\\n C va=c1-a,vb=c1-b;\\n double A=abs(va),B=abs(vb);\\n double f=cross(va,vb),d=distanceSP(L(a,b),c1),res=0;\\n if(eq(f,0.0)) return 0;\\n if(A < r1+EPS && B < r1+EPS) return f*0.5;\\n if(d>r1-EPS) return r1*r1*M_PI*getarg(va,vb)/(2.0*M_PI);\\n vector<C> u=crosspointCS(c1,r1,L(a,b));\\n u.insert(u.begin(),a),u.push_back(b);\\n for(int i=0;i+1<(int)u.size();i++){\\n res+=getarea(c1,r1,u[i],u[i+1]);\\n }\\n return res;\\n}\\ndouble getcrossarea(vector<C> t,C c1,double r1)\\n{\\n int n=t.size();\\n if(n<3) return 0;\\n double res=0;\\n rep(i,n){\\n C a=t[i], b=t[(i+1)%n];\\n res += getarea(c1,r1,a,b);\\n }\\n return res;\\n}\\n//??????????±???????\\nvector<C> convex_hull(vector<C> ps)\\n{\\n int n = ps.size(), k = 0;\\n sort(ps.begin(), ps.end());\\n vector<C> ch(2*n);\\n for (int i = 0; i < n; ch[k++] = ps[i++]){\\n while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) k--;\\n }\\n for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]){\\n while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) k--;\\n }\\n ch.resize(k-1);\\n return ch;\\n}\\n//?????§??????\\nbool isconvex(const vector<C> &ps)\\n{\\n rep(i,ps.size()){\\n if (ccw(ps[(i+ps.size()-1) % ps.size()],ps[i],ps[(i+1) % ps.size()])) return false;\\n }\\n return true;\\n}\\n//????§???¢?????¢???\\ndouble area(const vector<C> &ps)\\n{\\n double A = 0;\\n rep(i,ps.size()){\\n A += cross(ps[i],ps[(i+1) % ps.size()]);\\n }\\n return A / 2.0;\\n}\\n//???????§???¢?????´?????§???????????????????????´????????¢\\nvector<C> convex_cut(const vector<C> &ps, const L &l)\\n{\\n vector<C> Q;\\n rep(i,ps.size()){\\n C A = ps[i], B = ps[(i+1)%ps.size()];\\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\\n Q.push_back(crosspointLL(L(A, B),l));\\n }\\n return Q;\\n}\\n//??????????§???¢???????????????????????????(0??????????????????,1?????????,2???????????????)\\nint contains(const vector<C>& ps, const C p)\\n{\\n bool flag = false;\\n rep(i,ps.size()) {\\n C a = ps[i] - p, b = ps[(i+1)%ps.size()] - p;\\n if (imag(a) > imag(b)) swap(a, b);\\n if (imag(a) <= 0 && 0 < imag(b)){\\n if (cross(a, b) < 0) flag = !flag;\\n }\\n if (cross(a, b) == 0 && dot(a, b) <= 0) return 1;\\n }\\n return flag ? 2 : 0;\\n}\\n//???????§???¢?????´???????±???????(?????£????????????)\\n//maxi,maxj?????????????????¨??????\\ndouble convex_diameter(const vector<C> &ps)\\n{\\n const int n = ps.size();\\n int is = 0, js = 0;\\n for (int i = 1; i < n; ++i) {\\n if (imag(ps[i]) > imag(ps[is])) is = i;\\n if (imag(ps[i]) < imag(ps[js])) js = i;\\n }\\n double maxd = abs(ps[is]-ps[js]);\\n int i, maxi, j, maxj;\\n i = maxi = is;\\n j = maxj = js;\\n do{\\n if (cross(ps[(i+1)%ps.size()]-ps[i],ps[(j+1)%ps.size()]-ps[j]) >= 0) j = (j+1) % n;\\n else i = (i+1) % n;\\n if (abs(ps[i]-ps[j]) > maxd) {\\n maxd = abs(ps[i]-ps[j]);\\n maxi = i; maxj = j;\\n }\\n } while (i != is || j != js);\\n return maxd;\\n}\\n\\nbool compyx(C c1,C c2)\\n{\\n return c1.imag() != c2.imag() ? c1.imag() < c2.imag() : c1.real() < c2.real();\\n}\\n\\n//????????????????±???????\\ndouble closest_pair(C *a, int n)\\n{\\n if(n<=1) return INF;\\n int m=n/2;\\n double x=a[m].real();\\n double d=min(closest_pair(a,m),closest_pair(a+m,n-m));\\n inplace_merge(a,a+m,a+n,compyx);\\n vector<C> b;\\n rep(i,n){\\n if(abs(x-a[i].real())>=d) continue;\\n rep(j,b.size()){\\n C dp=a[i]-b[b.size()-1-j];\\n if(dp.imag()>=d) break;\\n d=min(d,abs(dp));\\n }\\n b.push_back(a[i]);\\n }\\n return d;\\n}\\ndouble compute_shortest(C *a,int n)\\n{\\n sort(a,a+n);\\n return closest_pair(a,n);\\n}\\n//2??????????????¢????????????(????????????2??????????????±?????\\\\????????°)\\nint getstateCC(C c1,double r1,C c2,double r2)\\n{\\n double d=abs(c1-c2);\\n if(d>r1+r2+EPS)return 4;\\n if(d>r1+r2-EPS)return 3;\\n if(d>abs(r1-r2)+EPS)return 2;\\n if(d>abs(r1-r2)-EPS)return 1;\\n return 0;\\n}\\n//?????????????????\\\\???????????????????????\\\\???\\nC gettangentCP_(C c1,double r1,C p,int flg){\\n C base=c1-p;\\n double w=Sqrt(norm(base)-r1*r1);\\n C s=p+base*C(w,r1 * flg)/norm(base)*w;\\n return s;\\n}\\n//????????????????????\\\\???\\nvector<L> gettangentCP(C c1,double r1,C p){\\n vector<L> res;\\n C s=gettangentCP_(c1,r1,p,1);\\n C t=gettangentCP_(c1,r1,p,-1);\\n //??????????????¨??????????????´???\\n if(eq(s,t)){\\n res.push_back(L(s,s+(c1-p)*C(0,1)));\\n }else{\\n res.push_back(L(p,s));\\n res.push_back(L(p,t));\\n }\\n return res;\\n}\\n\\n//2????????±????????\\\\???????±???????\\nL getintangent(C c1,double r1,C c2,double r2,double flg)\\n{\\n C base=c2-c1;\\n double w=r1+r2;\\n double h=Sqrt(norm(base)-w*w);\\n C k=base*C(w,h*flg)/norm(base);\\n return L(c1+k*r1,c2-k*r2);\\n}\\n//2????????±????????\\\\???????±???????\\nL getouttangent(C c1,double r1,C c2,double r2,double flg)\\n{\\n C base=c2-c1;\\n double h=r2-r1;\\n double w=Sqrt(norm(base)-h*h);\\n C k=base*C(w,h*flg)/norm(base)*C(0,flg);\\n return L(c1+k*r1,c2+k*r2);\\n}\\n//2????????±?????\\\\???????±???????(?????´??????????????????????????????????????\\\\???)\\nvector<L> gettangentCC(C c1,double r1,C c2,double r2)\\n{\\n vector<L> res;\\n double d=abs(c1-c2);\\n if(d>r1+r2+EPS) res.push_back(getintangent(c1,r1,c2,r2,1));\\n if(d>r1+r2-EPS) res.push_back(getintangent(c1,r1,c2,r2,-1));\\n if(d>abs(r1-r2)+EPS) res.push_back(getouttangent(c1,r1,c2,r2,1));\\n if(d>abs(r1-r2)-EPS) res.push_back(getouttangent(c1,r1,c2,r2,-1));\\n return res;\\n}\\n\\ndouble width(vector<P> vec,int n,double x)\\n{\\n double lb = INF,ub = -INF;\\n rep(i,n){\\n L hoge(C(vec[i].fi,vec[i].se),C(vec[(i+1)%n].fi,vec[(i+1)%n].se));\\n L cri(C(x,101),C(x,-101));\\n if(intersectLS(cri,hoge)){\\n C res = crosspointLL(cri,hoge);\\n lb = min(lb,res.imag());\\n ub = max(ub,res.imag());\\n }\\n }\\n return max(0.0,ub-lb);\\n}\\n\\nint main()\\n{\\n while(1){\\n int n,m;\\n cin >> m >> n;\\n if(n == 0 && m == 0){\\n break;\\n }\\n vector<P> v1,v2;\\n vector<int> ax;\\n rep(i,m){\\n int x,y;\\n cin >> x >> y;\\n v1.pb(P(x,y));\\n ax.pb(x);\\n }\\n rep(i,n){\\n int x,y;\\n cin >> x >> y;\\n v2.pb(P(x,y));\\n ax.pb(x);\\n }\\n sort(all(ax));\\n ax.erase(unique(all(ax)),ax.end());\\n int mn1 = (*min_element(all(v1))).fi;\\n int mx1 = (*max_element(all(v1))).fi;\\n int mn2 = (*min_element(all(v2))).fi;\\n int mx2 = (*max_element(all(v2))).fi;\\n double res = 0.0;\\n rep(i,ax.size()-1){\\n double a = ax[i],b = ax[i+1],c = (a+b)/2;\\n if(mn1 <= c && c <= mx1 && mn2 <= c && c <= mx2){\\n double fa = width(v1,m,a) * width(v2,n,a);\\n double fb = width(v1,m,b) * width(v2,n,b);\\n double fc = width(v1,m,c) * width(v2,n,c);\\n res += (b - a) / 6 * (fa + 4*fc + fb);\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",res);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.9222,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1313_2040628\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef double dbl;\\n#define double long double\\ntypedef complex<double> P;\\ntypedef vector<P> G;\\n#define REP(i,n) for(int i = 0 ; i < n ; i++)\\ndouble eps = 1e-11;\\ndouble EPS = eps;\\n\\nbool eq(double a,double b){\\n\\treturn fabs(a-b) < eps;\\n}\\n\\ndouble cross(P a,P b) { return imag(conj(a)*b); }\\ndouble dot(P a,P b) { return real(conj(a)*b);}\\n\\nvector<P> ps1,ps2;\\n//??´???\\nstruct L : public vector<P> {\\n\\tL(P a,P b) {\\n\\t\\tpush_back(a); push_back(b);\\n\\t}\\n\\t\\n};\\nint ccw(P a, P b, P c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > 0) return +1;\\t// a ??? b ??§???????¨??????????????????? b ??? c(???)\\n\\tif (cross(b, c) < 0) return -1;\\t// a ??? b ??§????¨??????????????????? b ??? c(???)\\n\\tif (dot(b, c) < 0) return +2; \\t// a???b??§????????????a??????????¶???????b???c(c--a--b)\\n\\tif (norm(b) < norm(c)) return -2;\\t// a???b??§????????????b???c(a--b--c)\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t// a???b??§????????????b???c(????????? b == c)\\n}\\n \\n\\n\\nP crosspoint(const L &l, const L &m) {\\n\\tdouble A = cross(l[1] - l[0], m[1] - m[0]);\\n\\tdouble B = cross(l[1] - l[0], l[1] - m[0]);\\n\\tif (abs(A) < EPS && abs(B) < EPS) return m[0];\\n\\treturn m[0] + B / A * (m[1] - m[0]);\\n}\\n \\n \\n// ???????§???¢???????????????????§???¢???????????´?????§????????????\\n//???????????´?????????????????´?????????????????´?????????????????¨?????????????????¨?????????????????????????????¨????????????????????????\\n#define curr(P, i) P[(i) % P.size()]\\n#define next(P, i) P[(i+1)%P.size()]\\n#define prev(P, i) P[(i+P.size()-1) % P.size()]\\nG convex_cut(const G& poly, const L& l) {\\n G Q;\\n for (int i = 0; i < poly.size(); ++i) {\\n P A = curr(poly, i), B = next(poly, i);\\n if (ccw(l[0], l[1], A) != -1) Q.push_back(A);\\n if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)\\n Q.push_back(crosspoint(L(A, B), l));\\n }\\n return Q;\\n}\\n\\n// ????´?????§???¢?????¢??????\\\"2???\\\"????±??????? O(n)\\ndouble area2(const G& poly) {\\n\\tdouble A = 0;\\n\\tREP(i,poly.size()) A += cross(curr(poly, i), next(poly, i));\\n\\treturn abs(A);\\n}\\n\\n\\nvector<double> ux;\\n\\nP in(){\\n\\tdouble x,y;\\n\\tcin >> x >> y;\\n\\t\\n\\treturn P(x,y);\\n}\\npair<double,double> seg(const vector<P> &ps,double x){\\n\\tdouble mi = 1e9, ma = -1e9;\\n\\tauto reflesh = [&mi,&ma](double y){\\n\\t\\tmi = min(mi,y);\\n\\t\\tma = max(ma,y);\\n\\t};\\n\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\tP a = ps[i];\\n\\t\\tP b = ps[(i+1)%ps.size()];\\n\\t\\tif( a.real() > b.real() ) swap(a,b);\\n\\t\\tif( eq(a.real(),x) ) reflesh(a.imag());\\n\\t\\tif( eq(b.real(),x) ) reflesh(b.imag());\\n\\t\\tif( a.real() + eps < x and x < b.real() - eps ){\\n\\t\\t\\treflesh(a.imag() + (x - a.real()) * (b.imag() - a.imag()) / (b.real()-a.real()));\\n\\t\\t}\\n\\t}\\n\\tif( ma < mi ) return {0.0,0.0};\\n\\treturn {mi,ma};\\n}\\n\\ndouble S(double l,double r){\\n\\tif( r <= l ) return 0;\\n\\tG g1 = convex_cut(ps1,L(P(l,0),P(l,-1)));\\n\\tG g2 = convex_cut(g1,L(P(r,0),P(r,+1)));\\n\\t\\n\\treturn area2(g2) / 2;\\n\\t\\n}\\n\\ndouble Vf(double z){\\n\\tauto p = seg(ps2,z);\\n\\treturn S(p.first,p.second);\\n}\\n\\ndouble Vs(double l,double r){\\n\\treturn (r-l)/6*(Vf(l)+4*Vf((l+r)/2)+Vf(r));\\n}\\n\\ndouble V(double l,double r,int k=6){\\n\\tif( l >= r ) return 0;\\n\\tdouble m = (l+r)/2;\\n\\tdouble a = Vs(l,m);\\n\\tdouble b = Vs(m,r);\\n\\tdouble c = Vs(l,r);\\n\\tif( ( k <= 0) and eq(a+b,c) ){\\n\\t\\treturn c;\\n\\t}else{\\n\\t\\treturn V(l,m,k-1) + V(m,r,k-1);\\n\\t}\\t\\n}\\n\\nint main(){\\n\\tint m,n;\\n\\twhile(cin >> m >> n && m ){\\n\\t\\t\\n\\t\\tps1.clear();\\n\\t\\tps2.clear();\\n\\t\\tux.clear();\\n\\t\\tfor(int i = 0 ; i < m ; i++){\\n\\t\\t\\tps1.push_back(in());\\n\\t\\t\\tux.push_back(ps1.back().real());\\n\\t\\t}\\n\\n\\t\\tvector<double> uz;\\n\\t\\tfor(int i = 0 ; i < n ; i++){\\n\\t\\t\\tps2.push_back(in());\\n\\t\\t\\tps2.back() = P(ps2.back().imag(),ps2.back().real());\\n\\t\\t\\tuz.push_back(ps2.back().real());\\n\\n\\t\\t}\\n\\t\\t\\n\\t\\tsort(uz.begin(),uz.end());\\n\\t\\tsort(ux.begin(),ux.end());\\n\\t\\tdouble vans = 0;\\n\\t\\t//for( auto z : uz ) cout << z << \\\" \\\"; cout << endl;\\n\\t\\t//for( auto x : ux ) cout << x << \\\" \\\"; cout << endl;\\n\\t\\tfor(int i = 0 ; i+1 < uz.size() ; i++)\\n\\t\\t\\tif( uz[i] != uz[i+1] )\\n\\t\\t\\t\\tvans += V(uz[i],uz[i+1]);\\n\\t\\tprintf(\\\"%.8lf\\\\n\\\",(dbl)vans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5650,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -1.9408,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1313_1195725\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <cstring>\\n#include <functional>\\n#include <cmath>\\n#include <complex>\\n#include <cassert>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define show(x) cout << #x << \\\" \\\" << x << endl\\ntypedef long double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\ntypedef vector<P> Pol;\\nD eps=1e-11,Eps=1e-9;\\nD cro(P a,P b){return imag(conj(a)*b);}\\nint ccw(P a,P b,P c){\\n\\tif(cro(b-a,c-a)>eps) return 1;\\n\\tif(cro(b-a,c-a)<-eps) return -1;\\n\\tif(abs(abs(a-c)+abs(c-b)-abs(a-b))<eps) return 0;\\n\\tif(abs(abs(a-b)+abs(c-b)-abs(a-c))<eps) return -2;\\n\\treturn 2;\\n}\\nbool iLS(L l,L s){\\n\\tif(abs(cro(l.fs-l.sc,s.fs-s.sc))<eps) return 0;\\n\\treturn cro(l.sc-l.fs,s.fs-l.fs)*cro(l.sc-l.fs,s.sc-l.fs)<eps;\\n}\\nP intLL(L a,L b){\\n\\tD t=cro(a.sc-a.fs,a.sc-b.fs)/cro(a.sc-a.fs,b.sc-b.fs);\\n\\treturn b.fs+t*(b.sc-b.fs);\\n}\\nint M,N;\\nPol a,b;\\nD rec(D x){\\n\\tL l=L(P(x,0),P(x,1));\\n\\tPol inters;\\n\\trep(j,M){\\n\\t\\tL e=L(a[j],a[(j+1)%M]);\\n\\t\\tif(iLS(l,e)) inters.pb(intLL(l,e));\\n\\t}\\n\\tif(inters.size()<=1) return -1;\\n\\tD leny=0;\\n\\tfor(P p:inters) for(P q:inters) leny=max(leny,abs(p-q));\\n\\tinters.clear();\\n\\trep(j,N){\\n\\t\\tL e=L(b[j],b[(j+1)%N]);\\n\\t\\tif(iLS(l,e)) inters.pb(intLL(l,e));\\n\\t}\\n\\tif(inters.size()<=1) return -1;\\n\\tD lenz=0;\\n\\tfor(P p:inters) for(P q:inters) lenz=max(lenz,abs(p-q));\\n\\treturn leny*lenz;\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>M>>N;\\n\\t\\tif(M==0) break;\\n\\t\\ta.clear(),b.clear();\\n\\t\\tvector<D> xs;\\n\\t\\tD ans=0;\\n\\t\\trep(i,M){\\n\\t\\t\\tD x,y;\\n\\t\\t\\tcin>>x>>y;\\n\\t\\t\\ta.pb(P(x,y));\\n\\t\\t\\txs.pb(x-Eps);\\n\\t\\t\\txs.pb(x+Eps);\\n\\t\\t}\\n\\t\\trep(i,N){\\n\\t\\t\\tD x,y;\\n\\t\\t\\tcin>>x>>y;\\n\\t\\t\\tb.pb(P(x,y));\\n\\t\\t\\txs.pb(x-Eps);\\n\\t\\t\\txs.pb(x+Eps);\\n\\t\\t}\\n\\t\\tsort(all(xs));\\n\\t\\trep(i,xs.size()-1){\\n\\t\\t\\tif(rec(xs[i])<-eps||rec(xs[i])<-eps) continue;\\n\\t\\t\\tans+=(xs[i+1]-xs[i])/6.0*(rec(xs[i])+4.0*rec((xs[i+1]+xs[i])/2)+rec(xs[i+1]));\\n\\t\\t}\\n\\t\\tprintf(\\\"%.4f\\\\n\\\",(double)ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1308,\n \"score_of_the_acc\": -0.3975,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1313_1156580\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <assert.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nnamespace geom{\\n#define X real()\\n#define Y imag()\\n#define at(i) ((*this)[i])\\n#define SELF (*this)\\n\\tenum {TRUE = 1, FALSE = 0, BORDER = -1};\\n\\ttypedef int BOOL;\\n\\ttypedef long double R;\\n\\tconst R INF = 1e8;\\n\\tR EPS = 1e-12;\\n\\tconst R PI = 3.1415926535897932384626;\\n\\tinline int sig(const R &x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n\\tinline BOOL less(const R &x, const R &y) {return sig(x-y) ? x < y : BORDER;}\\n\\ttypedef complex<R> P;\\n\\tinline R norm(const P &p){return p.X*p.X+p.Y*p.Y;}\\n\\tinline R inp(const P& a, const P& b){return (conj(a)*b).X;}\\n\\tinline R outp(const P& a, const P& b){return (conj(a)*b).Y;}\\n\\tinline P unit(const P& p){return p/abs(p);}\\n\\tinline P proj(const P &s, const P &t){return t*inp(s, t)/norm(t);}\\n\\tinline int ccw(const P &s, const P &t, const P &p, int adv=0){\\n\\t\\tint res = sig(outp(t-s, p-s));\\n\\t\\tif(res || !adv) return res;\\n\\t\\tif(sig(inp(t-s, p-s)) < 0) return -2;\\t// p-s-t\\n\\t\\tif(sig(inp(s-t, p-t)) < 0) return 2;\\t// s-t-p\\n\\t\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// s-p-t\\n\\t}\\n\\t\\n\\t\\n\\tstruct L : public vector<P>{\\t// line\\n\\t\\tL(const P &p1, const P &p2){this->push_back(p1);this->push_back(p2);}\\n\\t\\tL(){}\\n\\t\\tP dir()const {return at(1) - at(0);}\\n\\t};\\n\\tstruct S : public L{\\t// segment\\n\\t\\tS(const P &p1, const P &p2):L(p1, p2){}\\n\\t\\tS(){}\\n\\t};\\n\\tstruct G : public vector<P>{\\n\\t\\tG(size_type size=0):vector(size){}\\n\\t\\tS edge(int i)const {return S(at(i), at(i+1 == size() ? 0 : i+1));}\\n\\t};\\n\\tBOOL intersect(const S &s, const S &t){\\n\\t\\tconst int p = ccw(t[0], t[1], s[0], 1) * ccw(t[0], t[1], s[1], 1);\\n\\t\\tconst int q = ccw(s[0], s[1], t[0], 1) * ccw(s[0], s[1], t[1], 1);\\n\\t\\treturn (p>0||q>0) ? FALSE : (!p||!q) ? BORDER : TRUE;\\n\\t}\\n\\tBOOL intersect(const S &s, const L &l){\\n\\t\\treturn (sig(outp(l.dir(), s[0]-l[0])) * sig(outp(l.dir(), s[1]-l[0])) <= 0);\\n\\t}\\n\\tinline P crosspoint(const L &l, const L &m){\\n\\t\\tR A = outp(l.dir(), m.dir()), B = outp(l.dir(), l[1] - m[0]);\\n\\t\\tif(!sig(abs(A)) && !sig(abs(B))) return m[0]; // same line\\n\\t\\tif(abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n\\t\\treturn m[0] + B / A * (m[1] - m[0]);\\n\\t}\\n\\n\\ttemplate<class Func> R simpson(R s, R t, Func func){\\n\\t\\treturn (t-s)/6*(func(s+2*EPS) + func(t-2*EPS) + 4*func((s+t)*(R).5));\\n\\t}\\n#undef SELF\\n#undef at\\n}\\n\\nusing namespace geom;\\n\\nint f = 0;\\nnamespace std{\\n\\tbool operator<(const P &a, const P &b){return sig(a.X-b.X) ? a.X < b.X : a.Y+EPS < b.Y;}\\n\\tbool operator==(const P &a, const P &b){return abs(a-b) < EPS;}\\n\\tistream& operator>>(istream &is, P &p){R x,y;is>>x>>y;p=P(x, y);return is;}\\n\\tistream& operator>>(istream &is, L &l){l.resize(2);return is >> l[0] >> l[1];}\\n}\\n\\nint n, m;\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\twhile(cin >> m >> n, n){\\n\\t\\tG g1(m), g2(n);\\n\\t\\tvector<R> x;\\n\\t\\tREP(i, m){\\n\\t\\t\\tcin >> g1[i];\\n\\t\\t\\tx.push_back(g1[i].X);\\n\\t\\t}\\n\\t\\tREP(i, n){\\n\\t\\t\\tcin >> g2[i];\\n\\t\\t\\tx.push_back(g2[i].X);\\n\\t\\t}\\n\\t\\tsort(ALL(x));UNIQUE(x);\\n\\t\\t\\n\\t\\tauto width = [&](const G &g, R x){\\n\\t\\t\\tL l(P(x, 0), P(x, 1));\\n\\t\\t\\tR b = INF, u = -INF;\\n\\t\\t\\tREP(i, g.size()){\\n\\t\\t\\t\\tif(sig(g.edge(i).dir().X) && intersect(g.edge(i), l)){\\n\\t\\t\\t\\t\\tP p = crosspoint(g.edge(i), l);\\n\\t\\t\\t\\t\\tb = min(b, p.Y);\\n\\t\\t\\t\\t\\tu = max(u, p.Y);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max<R>(0, u-b);\\n\\t\\t};\\n\\t\\tauto area = [&](R x){\\n\\t\\t\\treturn width(g1, x) * width(g2, x);\\n\\t\\t};\\n\\t\\t\\n\\t\\tR ans = 0;\\n\\t\\tREP(i, (int)x.size()-1){\\n\\t\\t\\tans += simpson(x[i], x[i+1], area);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10f\\\\n\\\", (double)ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1308,\n \"score_of_the_acc\": -0.3851,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1313_1113794\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define EQ(a,b) (abs((a)-(b)) < EPS)\\n#define fs first\\n#define sc second\\nusing namespace std;\\ntypedef double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\n\\nconst D EPS = 1e-8;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\\n }\\n bool operator==(const P &a, const P &b){return EQ(a,b);}\\n}\\n\\ninline D dot(P x, P y){return real(conj(x)*y);}\\ninline D cross(P x, P y){return imag(conj(x)*y);}\\n\\ninline int ccw(P a,P b,P c){\\n b -= a;c -= a;\\n if (cross(b,c)>EPS) return 1; //counter clockwise\\n if (cross(b,c)<-EPS) return -1; //clockwise\\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\\n return 0; //on segment\\n}\\n\\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\\n\\ninline bool is_cp(L a,L b){\\n if(para(a,b))return false;\\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\\n return false;\\n}\\n\\ninline P line_cp(L a,L b){\\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\\n}\\n\\nvector<P> p[2];\\ninline D len(D x, int id){\\n L l = L( P(x,-1000), P(x,1000) );\\n vector<P> res;\\n rep(i,p[id].size()){\\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\\n if(is_cp(a,l)){\\n P cp = line_cp(a,l);\\n if(!EQ(cp,p[id][i]))res.push_back(cp);\\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\\n res.push_back(a.sc);\\n }\\n }\\n\\n if(res.size()<2)return 0;\\n return abs(res[0]-res[1]);\\n}\\n\\ninline D f(D x){\\n return len(x/2,0) * len(x/2,1);\\n}\\n\\nint main(){\\n int m,n;\\n while(cin >> m >> n, m){\\n int minx[2], maxx[2];\\n p[0].resize(m); p[1].resize(n);\\n minx[0] = minx[1] = 1000;\\n maxx[0] = maxx[1] = -1000;\\n\\n rep(i,m){\\n int x,y;\\n cin >> x >> y;\\n p[0][i] = P(x,y);\\n minx[0]=min(minx[0],x);\\n maxx[0]=max(maxx[0],x);\\n }\\n\\n rep(i,n){\\n int x,z;\\n cin >> x >> z;\\n p[1][i] = P(x,z);\\n minx[1]=min(minx[1],x);\\n maxx[1]=max(maxx[1],x);\\n }\\n\\n D ans = 0;\\n for(D i=-199;i<200;i+=2){\\n if(2*minx[0]<=i && i<=2*maxx[0]){\\n\\tif(2*minx[1]<=i && i<=2*maxx[1]){\\n\\t ans += f(i-1)+4*f(i)+f(i+1);\\n\\t}\\n }\\n }\\n cout << fixed << setprecision(9) << ans/6 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1288,\n \"score_of_the_acc\": -0.3758,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1313_1113792\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define EQ(a,b) (abs((a)-(b)) < EPS)\\n#define fs first\\n#define sc second\\nusing namespace std;\\ntypedef double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\n\\nconst D EPS = 1e-8;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\\n }\\n bool operator==(const P &a, const P &b){return EQ(a,b);}\\n}\\n\\ninline D dot(P x, P y){return real(conj(x)*y);}\\ninline D cross(P x, P y){return imag(conj(x)*y);}\\n\\nint ccw(P a,P b,P c){\\n b -= a;c -= a;\\n if (cross(b,c)>EPS) return 1; //counter clockwise\\n if (cross(b,c)<-EPS) return -1; //clockwise\\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\\n return 0; //on segment\\n}\\n\\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\\n\\ninline bool is_cp(L a,L b){\\n if(para(a,b))return false;\\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\\n return false;\\n}\\n\\ninline P line_cp(L a,L b){\\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\\n}\\n\\nvector<P> p[2];\\ninline D len(D x, int id){\\n L l = L( P(x,-1000), P(x,1000) );\\n vector<P> res;\\n rep(i,p[id].size()){\\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\\n if(is_cp(a,l)){\\n P cp = line_cp(a,l);\\n if(!EQ(cp,p[id][i]))res.push_back(cp);\\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\\n res.push_back(a.sc);\\n }\\n }\\n\\n if(res.size()<2)return 0;\\n return abs(res[0]-res[1]);\\n}\\n\\ninline D f(D x){\\n return len(x/2,0) * len(x/2,1);\\n}\\n\\nint main(){\\n int m,n;\\n while(cin >> m >> n, m){\\n int minx[2], maxx[2];\\n p[0].resize(m); p[1].resize(n);\\n minx[0] = minx[1] = 1000;\\n maxx[0] = maxx[1] = -1000;\\n\\n rep(i,m){\\n int x,y;\\n cin >> x >> y;\\n p[0][i] = P(x,y);\\n minx[0]=min(minx[0],x);\\n maxx[0]=max(maxx[0],x);\\n }\\n\\n rep(i,n){\\n int x,z;\\n cin >> x >> z;\\n p[1][i] = P(x,z);\\n minx[1]=min(minx[1],x);\\n maxx[1]=max(maxx[1],x);\\n }\\n\\n D ans = 0;\\n for(D i=-199;i<200;i+=2){\\n if(2*minx[0]<=i && i<=2*maxx[0]){\\n\\tif(2*minx[1]<=i && i<=2*maxx[1]){\\n\\t ans += f(i-1)+4*f(i)+f(i+1);\\n\\t}\\n }\\n }\\n cout << fixed << setprecision(9) << ans/6 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1284,\n \"score_of_the_acc\": -0.3764,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1313_1113791\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define EQ(a,b) (abs((a)-(b)) < EPS)\\n#define fs first\\n#define sc second\\nusing namespace std;\\ntypedef double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\n\\nconst D EPS = 1e-8;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\\n }\\n bool operator==(const P &a, const P &b){return EQ(a,b);}\\n}\\n\\ninline D dot(P x, P y){return real(conj(x)*y);}\\ninline D cross(P x, P y){return imag(conj(x)*y);}\\n\\nint ccw(P a,P b,P c){\\n b -= a;c -= a;\\n if (cross(b,c)>EPS) return 1; //counter clockwise\\n if (cross(b,c)<-EPS) return -1; //clockwise\\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\\n return 0; //on segment\\n}\\n\\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\\n\\ninline bool is_cp(L a,L b){\\n if(para(a,b))return false;\\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\\n return false;\\n}\\n\\ninline P line_cp(L a,L b){\\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\\n}\\n\\nvector<P> p[2];\\ninline D len(D x, int id){\\n L l = L( P(x,-1000), P(x,1000) );\\n vector<P> res;\\n rep(i,p[id].size()){\\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\\n if(is_cp(a,l)){\\n P cp = line_cp(a,l);\\n if(!EQ(cp,p[id][i]))res.push_back(cp);\\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\\n res.push_back(a.sc);\\n }\\n }\\n\\n if(res.size()<2)return 0;\\n return abs(res[0]-res[1]);\\n}\\n\\ninline D f(D x){\\n return len(x,0) * len(x,1);\\n}\\n\\nint main(){\\n int m,n;\\n while(cin >> m >> n, m){\\n D minx[2], maxx[2];\\n p[0].resize(m); p[1].resize(n);\\n minx[0] = minx[1] = 1000;\\n maxx[0] = maxx[1] = -1000;\\n\\n rep(i,m){\\n D x,y;\\n cin >> x >> y;\\n p[0][i] = P(x,y);\\n minx[0]=min(minx[0],x);\\n maxx[0]=max(maxx[0],x);\\n }\\n\\n rep(i,n){\\n D x,z;\\n cin >> x >> z;\\n p[1][i] = P(x,z);\\n minx[1]=min(minx[1],x);\\n maxx[1]=max(maxx[1],x);\\n }\\n\\n D ans = 0;\\n for(D i=-100;i<100;i+=1){\\n if(minx[0]<=i+0.5 && i+0.5<=maxx[0]){\\n\\tif(minx[1]<=i+0.5 && i+0.5<=maxx[1]){\\n\\t ans += f(i)+4*f(i+0.5)+f(i+1);\\n\\t}\\n }\\n }\\n cout << fixed << setprecision(9) << ans/6 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1320,\n \"score_of_the_acc\": -0.385,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1313_1113790\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define all(a) (a).begin(),(a).end()\\n#define EQ(a,b) (abs((a)-(b)) < EPS)\\n#define fs first\\n#define sc second\\nusing namespace std;\\ntypedef long double D;\\ntypedef complex<D> P;\\ntypedef pair<P,P> L;\\n\\nconst D EPS = 1e-8;\\n\\nnamespace std{\\n bool operator<(const P &a,const P &b){\\n return EQ(real(a),real(b))?imag(a)<imag(b):real(a)<real(b);\\n }\\n bool operator==(const P &a, const P &b){return EQ(a,b);}\\n}\\n\\ninline D dot(P x, P y){return real(conj(x)*y);}\\ninline D cross(P x, P y){return imag(conj(x)*y);}\\n\\nint ccw(P a,P b,P c){\\n b -= a;c -= a;\\n if (cross(b,c)>EPS) return 1; //counter clockwise\\n if (cross(b,c)<-EPS) return -1; //clockwise\\n if (dot(b, c)<-EPS) return 2; //c--a--b on line\\n if (abs(b)+EPS<abs(c)) return -2; //a--b--c on line\\n return 0; //on segment\\n}\\n\\ninline bool para(L a,L b){return abs(cross(a.fs-a.sc,b.fs-b.sc))<EPS;}\\n\\ninline bool is_cp(L a,L b){\\n if(para(a,b))return false;\\n if(ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0)\\n if(ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0)return true;\\n return false;\\n}\\n\\ninline P line_cp(L a,L b){\\n return a.fs+(a.sc-a.fs)*cross(b.sc-b.fs,b.fs-a.fs)/cross(b.sc-b.fs,a.sc-a.fs);\\n}\\n\\nvector<P> p[2];\\ninline D len(D x, int id){\\n L l = L( P(x,-1000), P(x,1000) );\\n vector<P> res;\\n rep(i,p[id].size()){\\n L a = L( p[id][i], p[id][(i+1)%p[id].size()] );\\n if(is_cp(a,l)){\\n P cp = line_cp(a,l);\\n if(!EQ(cp,p[id][i]))res.push_back(cp);\\n }else if(para(a,l) && ccw(l.fs,l.sc,a.sc)==0){\\n res.push_back(a.sc);\\n }\\n }\\n\\n if(res.size()<2)return 0;\\n return abs(res[0]-res[1]);\\n}\\n\\ninline D f(D x){\\n return len(x,0) * len(x,1);\\n}\\n\\nint main(){\\n int m,n;\\n while(cin >> m >> n, m){\\n D minx[2], maxx[2];\\n p[0].resize(m); p[1].resize(n);\\n minx[0] = minx[1] = 1000;\\n maxx[0] = maxx[1] = -1000;\\n\\n rep(i,m){\\n D x,y;\\n cin >> x >> y;\\n p[0][i] = P(x,y);\\n minx[0]=min(minx[0],x);\\n maxx[0]=max(maxx[0],x);\\n }\\n\\n rep(i,n){\\n D x,z;\\n cin >> x >> z;\\n p[1][i] = P(x,z);\\n minx[1]=min(minx[1],x);\\n maxx[1]=max(maxx[1],x);\\n }\\n\\n D ans = 0;\\n for(D i=-100;i<100;i+=1){\\n if(minx[0]<=i+0.5 && i+0.5<=maxx[0]){\\n\\tif(minx[1]<=i+0.5 && i+0.5<=maxx[1]){\\n\\t ans += f(i)+4*f(i+0.5)+f(i+1);\\n\\t}\\n }\\n }\\n cout << fixed << setprecision(9) << ans/6 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 1328,\n \"score_of_the_acc\": -0.3998,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1313_990797\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\n\\nconst int DIV = 500000;\\n\\nint m, n;\\ndouble x1[100], y[100], x2[100], z[100];\\ndouble mnx, mxx;\\n\\ndouble solve(double x) {\\n double y1 = 0, y2 = 0, z1 = 0, z2 = 0;\\n static int px11 = 0, px12 = 0, px21 = 0, px22 = 0;\\n rep (ii, m) {\\n int i = (px11 + ii) % m;\\n if (x1[i] != x1[(i + 1) % m] && x1[i] <= x && x <= x1[(i + 1) % m]) {\\n y1 = y[i] + (y[(i + 1) % m] - y[i]) / (x1[(i + 1) % m] - x1[i]) * (x - x1[i]);\\n px11 = i;\\n break;\\n }\\n }\\n rep (ii, m) {\\n int i = (px12 - ii + m) % m;\\n if (x1[i] != x1[(i + 1) % m] && x1[(i + 1) % m] <= x && x <= x1[i]) {\\n y2 = y[i] + (y[(i + 1) % m] - y[i]) / (x1[(i + 1) % m] - x1[i]) * (x - x1[i]);\\n px12 = i;\\n break;\\n }\\n }\\n rep (ii, n) {\\n int i = (px21 + ii) % n;\\n if (x2[i] != x2[(i + 1) % n] && x2[i] <= x && x <= x2[(i + 1) % n]) {\\n z1 = z[i] + (z[(i + 1) % n] - z[i]) / (x2[(i + 1) % n] - x2[i]) * (x - x2[i]);\\n px21 = i;\\n break;\\n }\\n }\\n rep (ii, n) {\\n int i = (px22 - ii + n) % n;\\n if (x2[i] != x2[(i + 1) % n] && x2[(i + 1) % n] <= x && x <= x2[i]) {\\n z2 = z[i] + (z[(i + 1) % n] - z[i]) / (x2[(i + 1) % n] - x2[i]) * (x - x2[i]);\\n px22 = i;\\n break;\\n }\\n }\\n return (y2 - y1) * (z2 - z1);\\n}\\n\\ndouble simpson(double l, double r, double f(double), int k = 1){\\n double h = (r - l) / (2 * k);\\n double fo = 0, fe = 0;\\n for(int i = 1; i <= 2 * k - 3; i += 2){\\n fo += f(l + h * i);\\n fe += f(l + h * (i + 1));\\n }\\n return (f(l) + f(r) + 4 * (fo + f(r - h)) + 2 * fe) * h / 3;\\n}\\n\\nint main() {\\n while (true) {\\n cin >> m >> n;\\n if (m == 0 && n == 0) break;\\n rep (i, m) cin >> x1[i] >> y[i];\\n rep (i, n) cin >> x2[i] >> z[i];\\n double mnx = max(*min_element(x1, x1 + m), *min_element(x2, x2 + n));\\n double mxx = min(*max_element(x1, x1 + m), *max_element(x2, x2 + n));\\n printf(\\\"%.12lf\\\\n\\\", simpson(mnx, mxx, solve, DIV));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5610,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -1.3553,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1313_802145\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\n\\nusing namespace std;\\n\\nconst double EPS = 1e-8;\\ntypedef pair<long double, long double> P;\\nvector<P> vp1;\\nvector<P> vp2;\\n\\nlong double width(long double x, const vector<P>& v){\\n long double top = -1e8, bottom = 1e8;\\n REP(i, v.size()){\\n P p1 = v[i], p2 = v[(i + 1) % v.size()];\\n if(abs(p1.first - p2.first) < EPS){\\n if(abs(p1.first - x) < EPS){\\n top = max(top, p1.second);\\n top = max(top, p2.second);\\n bottom = min(bottom, p1.second);\\n bottom = min(bottom, p2.second);\\n }\\n continue;\\n }\\n if(p1.first > p2.first) swap(p1, p2);\\n if(p1.first - EPS < x && x < p2.first + EPS){\\n long double ratio = (x - p1.first) / (p2.first - p1.first);\\n long double y = p1.second + ratio * (p2.second - p1.second);\\n top = max(top, y);\\n bottom = min(bottom, y);\\n }\\n }\\n return max(0.0L, top - bottom);\\n}\\nlong double f(long double x){\\n long double w = width(x, vp1) * width(x, vp2);\\n return w;\\n}\\n\\nlong double simpson(long double l, long double r, int N){\\n long double h = (r - l) / (2 * N); \\n long double S = f(l) + f(r);\\n for(int i = 1; i < 2 * N; i += 2){\\n S += 4.0 * f(l + h * i);\\n }\\n for(int i = 2; i < 2 * N; i += 2){\\n S += 2.0 * f(l + h * i);\\n }\\n return S * h / 3.0;\\n}\\n\\n\\nint main(){\\n int M, N;\\n while(cin >> M >> N && M){\\n vp1.resize(M);\\n vp2.resize(N);\\n REP(i, M) cin >> vp1[i].first >> vp1[i].second;\\n REP(i, N) cin >> vp2[i].first >> vp2[i].second;\\n long double left1 = vp1[0].first, right1 = vp1[0].first;\\n long double left2 = vp2[0].first, right2 = vp2[0].first;\\n REP(i, M) left1 = min(left1, vp1[i].first);\\n REP(i, N) left2 = min(left2, vp2[i].first);\\n REP(i, M) right1 = max(right1, vp1[i].first);\\n REP(i, N) right2 = max(right2, vp2[i].first);\\n vector<long double> vx;\\n long double left = max(left1, left2), right = min(right1, right2);\\n vx.push_back(left); vx.push_back(right);\\n REP(i, M) if(left < vp1[i].first && vp1[i].first < right) vx.push_back(vp1[i].first);\\n REP(i, N) if(left < vp2[i].first && vp2[i].first < right) vx.push_back(vp2[i].first);\\n long double S = 0;\\n sort(vx.begin(), vx.end());\\n REP(i, vx.size() - 1){\\n S += simpson(vx[i], vx[i + 1], 100);\\n }\\n printf(\\\"%.16Lf\\\\n\\\", S);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.4208,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1313_350388\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <cstdio>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <valarray>\\n#include <bitset>\\n#include <stack>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int INF = 1<<29;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8;\\ntypedef pair<double, double> pdd;\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n};\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\nstruct C {\\n P p; double r;\\n C(const P &p, double r) : p(p), r(r) { }\\n};\\n\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0;\\n}\\nbool intersectLS(const L &l, const L &s) {\\n return cross(l[1]-l[0], s[0]-l[0])* // s[0] is left of l\\n cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l\\n}\\nP crosspoint(const L &l, const L &m) {\\n double A = cross(l[1] - l[0], m[1] - m[0]);\\n double B = cross(l[1] - l[0], l[1] - m[0]);\\n if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line\\n if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!\\n return m[0] + B / A * (m[1] - m[0]);\\n}\\n\\ndouble width(int *X, int *Y, int n, double x) {\\n double lb = INF, ub = -INF;\\n L l = L(P(x,0), P(x,1));\\n REP(i, n) {\\n L s = L(P(X[i], Y[i]), P(X[(i+1)%n], Y[(i+1)%n]));\\n if (intersectLS(l, s)) {\\n P p = crosspoint(l, s);\\n double y = p.imag();\\n lb = min(lb, y);\\n ub = max(ub, y);\\n }\\n }\\n return max(0.0, ub-lb);\\n}\\nint main() {\\n int m, n;\\n while(cin >> m >> n, m||n) {\\n int X1[m], Y1[m], X2[n], Z2[n];\\n REP(i, m) cin >> X1[i] >> Y1[i];\\n REP(i, n) cin >> X2[i] >> Z2[i];\\n int min1 = *min_element(X1, X1+m), max1 = *max_element(X1, X1+m);\\n int min2 = *min_element(X2, X2+n), max2 = *max_element(X2, X2+n);\\n vector<int> xs;\\n REP(i, m) xs.push_back(X1[i]);\\n REP(i, n) xs.push_back(X2[i]);\\n sort(ALL(xs));\\n\\n double res = 0;\\n REP(i, xs.size()-1) {\\n double a = xs[i], b = xs[i+1], c = (a+b)/2;\\n if (min1 <= c && c <= max1 && min2 <= c && c<= max2) {\\n double fa = width(X1, Y1, m, a) * width(X2, Z2, n, a);\\n double fb = width(X1, Y1, m, b) * width(X2, Z2, n, b);\\n double fc = width(X1, Y1, m, c) * width(X2, Z2, n, c);\\n res += (b-a) / 6 * (fa + 4*fc + fb);\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\", res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 968,\n \"score_of_the_acc\": -0.2882,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1313_152809\",\n \"code_snippet\": \"#include<complex>\\n#include<vector>\\n#include<iostream>\\n#include<stack>\\n#include<cmath>\\n#include<map>\\n\\nenum CCW{FRONT=0x01,RIGHT=0x02,BACK=0x04,LEFT=0x08,OVER=0x10};\\nenum CIRCLE_RELATION{CIRCLE_SAME=0x01,CIRCLE_CONTAIN=0x02,\\n\\t\\t CIRCLE_NO_CROSS=0x04,CIRCLE_ONE_CROSS=0x08,\\n\\t\\t CIRCLE_ONE_INSIDE_CROSS=0x10,CIRCLE_TWO_CROSS=0x20};\\n#define sc second\\n#define fr first\\n\\n#define REP(i,n) for(int i = 0; i < (int)(n); ++i)\\n\\nusing namespace std;\\n\\ntypedef double elem;\\ntypedef complex<elem> point, vec;\\ntypedef pair<point, point> line, hline, seg, pp;\\n\\nconst double infty = 1e40;\\nconst double eps = 1.0e-8;\\nconst double pi = acos(-1.0);\\npoint base(0,0);\\n\\n// lZ\\ninline elem sq(elem a){ return a*a; }\\ninline elem cq(elem a){ return a*a*a; }\\n\\n// pxÏ·\\nelem rad(elem deg){ return (deg/180)*pi; }\\nelem deg(elem rad){ return (rad*180)/pi; }\\n\\n// ®¬_Ìô¢AÈÇ\\nbool eq(elem a, elem b){ return abs(a-b) < eps; }\\nbool eqv(vec a, vec b){ return eq( abs(b-a),0); }\\n\\n// _Iy[^\\nbool far(point a, point b){ return abs(b-a)>0; }\\nbool near(point a, point b){ return abs(b-a)<=0; }\\nelem dot(vec a, vec b){ return (a.real() * b.real() + a.imag() * b.imag() ); }\\nelem cross(vec a, vec b){ return ( a.real() * b.imag() - a.imag() * b.real() ); }\\n\\n// a©çbÜÅvñèÌpxAàpA]ñ]\\nelem varg(vec a, vec b){\\n elem ret=arg(a)-arg(b);\\n if(ret<0)ret+=2*pi;\\n if(ret>2*pi)ret-=2*pi;\\n if(eq(ret,2*pi))ret=0;\\n return ret;\\n}\\nelem varg2(vec a, vec b){\\n elem ret = varg(a,b);\\n if(ret>pi)return 2*pi-ret;\\n return ret;\\n}\\nelem arg(vec a, vec b){ return acos( dot(a,b) / ( abs(a) * abs(b) ) ); }\\npoint rot(point p, elem theta){ return p * polar((elem)1.0, theta); }\\npoint rotdeg(point p, elem deg){ return p * polar((elem)1.0, rad(deg)); }\\npoint proj(line l, point p){\\n double t=dot(p-l.first,l.first-l.second)/abs(l.first-l.second);\\n return l.first + t*(l.first-l.second);\\n}\\npoint reflect(line l, point p){ return p+2.0*(proj(l,p)-p); }\\n\\n// ñ_Ô£A¼üÆ_ÌÅZ£AüªÆ_ÌÅZ£\\nelem dist(point a, point b){ return abs(a-b); }\\nelem dist_l(line l, point x){ return abs(cross(l.sc-l.fr,x-l.fr)) / abs(l.sc-l.fr); }\\nelem dist_seg(seg s, point x)\\n{\\n if( dot(s.sc-s.fr,x-s.fr)<0 ) return abs(x-s.fr);\\n if( dot(s.fr-s.sc,x-s.sc)<0 ) return abs(x-s.sc);\\n return dist_l(s,x);\\n}\\n\\n// PÊxNgA@üxNgAPÊ@üxNg\\nvec uvec(vec a){ return a / abs(a); }\\nvec nmr(vec a){ return a * vec(0,-1); }\\nvec nml(vec a){ return a * vec(0,1); }\\nvec unmr(vec a){ return uvec( nmr(a) ); }\\nvec unml(vec a){ return uvec( nml(a) ); }\\n\\n// ¼ðA½s»è\\nbool orth(point a1, point a2, point b1, point b2){ return eq( dot( a2 - a1, b2 - b1 ), 0 ); }\\nbool orth(vec v1, vec v2){ return eq( dot(v1, v2), 0 ); }\\nbool prll(point a1, point a2, point b1, point b2){ return eq( cross( a2 - a1, b2 - b1 ), 0 ); }\\nbool prll(vec v1, vec v2){ return eq( cross(v1, v2), 0 ); }\\n\\n// CCW oXg¾ªA¸xÉæé\\ninline int ccw(const point &a, point b, point x){\\n b -= a;\\n x -= a;\\n if( eq(cross(b,x),0.0) && dot(b,x) < 0 ) return BACK;\\n if( eq(cross(b,x),0.0) && abs(b) < abs(x) ) return FRONT;\\n if( eq(cross(b,x),0.0) ) return OVER;\\n if( cross(b,x) > 0 ) return LEFT;\\n if( cross(b,x) < 0 ) return RIGHT;\\n}\\n\\n// üªg£\\nline expandLine(line l, elem mag){\\n line ret = l;\\n vec vf(l.first - l.second);\\n vec vs(l.second - l.first);\\n ret.first = l.second + mag * vf;\\n ret.second = l.first + mag * vs;\\n return ret;\\n}\\n\\n// üªÌð·»è\\ninline bool intersectedSS(const seg &a, const seg &b)\\n{\\n int cwaf=ccw(a.fr,a.sc,b.fr);\\n int cwbf=ccw(b.fr,b.sc,a.fr);\\n int cwas=ccw(a.fr,a.sc,b.sc);\\n int cwbs=ccw(b.fr,b.sc,a.sc);\\n if( cwaf==OVER || cwas==OVER || cwbf==OVER || cwbs==OVER ) return true;\\n return ( cwaf | cwas ) == (LEFT|RIGHT) && ( cwbf | cwbs ) == (LEFT|RIGHT);\\n}\\n\\n// ¼üÌð·»è\\nbool intersectedLL(line a, line b){ return !eq( cross(a.sc-a.fr,b.sc-b.fr), 0.0 ); }\\n\\n// ð_vZ\\npoint intersectionSS(seg a, seg b)\\n{\\n elem d1 = dist_l(b,a.fr);\\n elem d2 = dist_l(b,a.sc);\\n return a.fr + ( d1 / (d1 + d2 ) ) * (a.sc-a.fr);\\n}\\npoint intersectionLL(line a, line b)\\n{\\n vec va = a.sc - a.fr;\\n vec vb = b.sc - b.fr;\\n return a.fr + va * ( cross(vb, b.fr - a.fr) / cross(vb,va) );\\n}\\n\\n// üªð_êÅ\\nbool intersectionLL(line a, line b, point &ret){\\n return intersectedLL( a, b ) ? ret = intersectionLL( a, b ), true : false;\\n}\\nbool intersectionLH(line a, hline b, point &ret){\\n point tmp;\\n return intersectionLL(a,b,tmp) ? ( ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret=tmp, true : false ) : false;\\n}\\nbool intersectionLS(line l, seg s, point &ret){\\n point tmp;\\n return intersectionLL(l,s,tmp) ? ( ccw(s.fr,s.sc,tmp)&OVER ? ret=tmp, true : false ) : false;\\n}\\nbool intersectionHH(hline a, hline b, point &ret){\\n point tmp;\\n return intersectionLL(a,b,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT)&&ccw(b.fr,b.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\\n}\\nbool intersectionHS(hline a, seg s, point &ret){\\n point tmp;\\n return intersectionLS(a,s,tmp) ? ( ccw(a.fr,a.sc,tmp)&(OVER|FRONT) ? ret = tmp, true : false ) : false;\\n}\\nbool intersectionSS(seg a, seg b, point &ret){\\n return intersectedSS(a,b) ? ret = intersectionSS(a,b), true : false;\\n}\\n\\npair<int, pair<double,double> > getLH(double x, const vector<point> &v)\\n{\\n point a,b;\\n int cnt=0;\\n line l(point(x,0),point(x,1));\\n for(int i = 0; i < (int)v.size(); ++i){\\n point is;\\n if( intersectionLS( l, seg(v[i],v[(i+1)%v.size()]), is ) ){\\n if(cnt==0){\\n\\ta = is;\\n\\t++cnt;\\n }else if( far(is,a) ){\\n\\tb = is;\\n\\t++cnt;\\n }\\n }\\n }\\n if(cnt==1)b=a;\\n if( a.imag() > b.imag() ) swap( a, b );\\n return make_pair( cnt, make_pair(a.imag(), b.imag() ) );\\n}\\n\\nstruct point3{\\n double x,y,z;\\n point3(double x, double y, double z):x(x),y(y),z(z){}\\n point3 operator-(const point3 &t){\\n return point3(x-t.x,y-t.y,z-t.z);\\n }\\n point3 operator+(const point3 &t){\\n return point3(x+t.x,y+t.y,z+t.z);\\n }\\n};\\n\\nostream &operator<<(ostream &oss, const point3 &t)\\n{\\n oss << '('<<t.x <<','<< t.y<<','<<t.z<<')';\\n return oss;\\n}\\n\\ndouble dot3(point3 a, point3 b){\\n return a.x*b.x + a.y*b.y + a.z*b.z;\\n}\\npoint3 cross3(point3 a, point3 b){\\n return point3(a.y*b.z-b.y*a.z, a.z*b.x-b.z*a.x, a.x*b.y-b.x*a.y);\\n}\\n\\ndouble tetrahedronVolume(point3 a, point3 b, point3 c, point3 d)\\n{\\n point3 A=b-a;\\n point3 B=c-a;\\n point3 C=d-a;\\n return abs(dot3(A,cross3(B,C))/6);\\n}\\ndouble getVolume( const vector<point3> &V1, const vector<point3> &V2 )\\n{\\n double ret=0;\\n vector<point3> v1 = V1;\\n vector<point3> v2 = V2;\\n if( v2.size() < v1.size() ){\\n swap( v1, v2 );\\n }\\n if(v1.size()==1){\\n if(v2.size()==2){\\n ret = 0;\\n }else if(v2.size()==4){\\n ret+=tetrahedronVolume(v1[0],v2[0],v2[1],v2[2]);\\n ret+=tetrahedronVolume(v1[0],v2[2],v2[3],v2[0]);\\n }\\n }else if(v1.size()==2){\\n if(v2.size()==2){\\n ret = tetrahedronVolume(v1[0],v1[1],v2[0],v2[1]);\\n }else{\\n if(eq(v1[0].y,v1[1].y)){\\n\\tret += tetrahedronVolume( v1[1],v1[0],v2[1],v2[2] );\\n\\tret += tetrahedronVolume( v1[0],v2[0],v2[1],v2[2] );\\n\\tret += tetrahedronVolume( v1[0],v2[2],v2[3],v2[0] );\\n }else{\\n\\tret += tetrahedronVolume( v1[1],v1[0],v2[2],v2[3] );\\n\\tret += tetrahedronVolume( v1[0],v2[0],v2[1],v2[2] );\\n\\tret += tetrahedronVolume( v1[0],v2[2],v2[3],v2[0] );\\n }\\n }\\n }else{\\n ret += tetrahedronVolume( v1[1],v1[0],v2[1],v1[2] );\\n ret += tetrahedronVolume( v2[0],v1[0],v2[3],v2[1] );\\n ret += tetrahedronVolume( v1[3],v1[0],v1[2],v2[3] );\\n\\n ret += tetrahedronVolume( v2[2],v2[3],v2[1],v1[2] );\\n ret += tetrahedronVolume( v1[0],v1[2],v2[1],v2[3] );\\n }\\n return ret;\\n}\\n\\nint main()\\n{\\n int m,n;\\n while(scanf(\\\"%d%d\\\", &m, &n) && m && n){\\n double x,y;\\n double res = 0;\\n vector<point> P1;\\n vector<point> P2;\\n int minx1=1000,maxx1=-1000;\\n int minx2=1000,maxx2=-1000;\\n map<int,pair<double,double> > vx;\\n for(int i = 0; i < m; ++i){\\n scanf(\\\"%lf%lf\\\", &x, &y);\\n P1.push_back(point(x,y));\\n vx[(int)x]=make_pair(0,0);\\n minx1 = min( (int)x, minx1 );\\n maxx1 = max( (int)x, maxx1 );\\n }\\n for(int i = 0; i < n; ++i){\\n scanf(\\\"%lf%lf\\\", &x, &y);\\n P2.push_back(point(x,y));\\n minx2 = min( (int)x, minx2 );\\n maxx2 = max( (int)x, maxx2 );\\n vx[(int)x]=make_pair(0,0);\\n }\\n retry:;\\n for(map<int,pair<double,double> >::iterator itm = vx.begin(); itm != vx.end(); ++itm){\\n pair<int, pair<double,double > > LH = getLH( itm->first, P1);\\n if( !( minx1 <= itm->first && itm->first <= maxx1 &&\\n\\t minx2 <= itm->first && itm->first <= maxx2 ) ){\\n\\tvx.erase(itm);\\n\\tgoto retry;\\n }\\n if( LH.first == 0 ){\\n\\tvx.erase(itm);\\n\\tgoto retry;\\n }else{\\n\\titm->second = LH.second;\\n }\\n }\\n vector< vector<point3> > V;\\n for(map<int,pair<double,double> >::iterator itm = vx.begin(); itm != vx.end(); ++itm){\\n vector<point3> vpx;\\n double x = itm->first;\\n double y1 = itm->second.first;\\n double y2 = itm->second.second;\\n\\n if( eq(y1,y2) ){\\n\\tpair<int,pair<double,double> > Z = getLH( x, P2 );\\n\\tdouble z1 = Z.second.first;\\n\\tdouble z2 = Z.second.second;\\n\\tif( eq(z1,z2) ){\\n\\t vpx.push_back( point3( x,y1,z1 ) );\\n\\t}else{\\n\\t vpx.push_back( point3( x,y1,z1 ) );\\n\\t vpx.push_back( point3( x,y1,z2 ) );\\n\\t}\\n }else{\\n\\tpair<int,pair<double,double> > Z = getLH( x, P2 );\\n\\tdouble z1 = Z.second.first;\\n\\tdouble z2 = Z.second.second;\\n\\tif( eq(z1,z2) ){\\n\\t vpx.push_back( point3( x,y1,z1 ) );\\n\\t vpx.push_back( point3( x,y2,z1 ) );\\n\\t}else{\\n\\t vpx.push_back( point3( x,y1,z1 ) );\\n\\t vpx.push_back( point3( x,y1,z2 ) );\\n\\t vpx.push_back( point3( x,y2,z2 ) );\\n\\t vpx.push_back( point3( x,y2,z1 ) );\\n\\t}\\n }\\n \\n /*\\n for(int i = 0; i < (int)vpx.size(); ++i){\\n\\tcout << vpx[i] << ' ';\\n }\\n cout << endl;\\n */\\n\\n V.push_back( vpx );\\n }\\n for(int i = 0; i < (int)V.size()-1; ++i){\\n //cout << i << ' ' << i+1 << endl;\\n res += getVolume(V[i], V[i+1]);\\n }\\n printf(\\\"%.13lf\\\\n\\\", res);\\n //return 0;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0018,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":765,"cells":{"group_id":{"kind":"string","value":"aoj_1316_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nThe Sorcerer's Donut\nYour master went to the town for a day. You could have a relaxed day without hearing his\nscolding. But he ordered you to make donuts dough by the evening. Loving donuts so much, he\ncan't live without eating tens of donuts everyday. What a chore for such a beautiful day.\nBut last week, you overheard a magic spell that your master was using. It was the time to\ntry. You casted the spell on a broomstick sitting on a corner of the kitchen. With a flash of\nlights, the broom sprouted two arms and two legs, and became alive. You ordered him, then he\nbrought flour from the storage, and started kneading dough. The spell worked, and how fast he\nkneaded it!\nA few minutes later, there was a tall pile of dough on the kitchen table. That was enough for\nthe next week. \\OK, stop now.\" You ordered. But he didn't stop. Help! You didn't know the\nspell to stop him! Soon the kitchen table was filled with hundreds of pieces of dough, and he\nstill worked as fast as he could. If you could not stop him now, you would be choked in the\nkitchen filled with pieces of dough.\nWait, didn't your master write his spells on his notebooks? You went to his den, and found the\nnotebook that recorded the spell of cessation.\nBut it was not the end of the story. The spell written in the notebook is not easily read by\nothers. He used a plastic model of a donut as a notebook for recording the spell. He split the\nsurface of the donut-shaped model into square mesh (Figure B.1), and filled with the letters\n(Figure B.2). He hid the spell so carefully that the pattern on the surface looked meaningless.\nBut you knew that he wrote the pattern so that the spell \"appears\" more than once (see the next\nparagraph for the precise conditions). The spell was not necessarily written in the left-to-right\ndirection, but any of the 8 directions, namely left-to-right, right-to-left, top-down, bottom-up,\nand the 4 diagonal directions.\nYou should be able to find the spell as the longest string that appears more than once. Here,\na string is considered to appear more than once if there are square sequences having the string\non the donut that satisfy the following conditions.\nEach square sequence does not overlap itself. (Two square sequences can share some squares.)\nThe square sequences start from different squares, and/or go to different directions.\nFigure B.1: The Sorcerer's Donut Before\nFilled with Letters, Showing the Mesh and 8\nPossible Spell Directions\nFigure B.2: The Sorcerer's Donut After Filled\nwith Letters\nNote that a palindrome (i.e., a string that is the same whether you read it backwards or forwards)\nthat satisfies the first condition \"appears\" twice.\nThe pattern on the donut is given as a matrix of letters as follows.\nABCD\nEFGH\nIJKL\nNote that the surface of the donut has no ends; the top and bottom sides, and the left and right\nsides of the pattern are respectively connected. There can be square sequences longer than both\nthe vertical and horizontal lengths of the patt\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1316_11047140","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<int, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\n\nll mod = 998244353;\nconst ll INF = 1e18;\n\nifstream in;\nofstream out;\n\nint main(int argc, char** argv) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n if(argc > 2) {\n in.open(argv[1]);\n cin.rdbuf(in.rdbuf());\n out.open(argv[2]);\n cout.rdbuf(out.rdbuf());\n }\n\n while(1) {\n ll h, w;\n cin >> h >> w;\n if(h == 0) break;\n\n vector<string> v(h);\n for(auto& x : v) cin >> x;\n\n map<string, ll> mp;\n\n vector<a2> dir = {\n {1, 0}, {-1, 0}, {0, 1}, {0, -1},\n {1, 1}, {1, -1}, {-1, 1}, {-1, -1},\n };\n for(int i = 0; i < h; i++) {\n for(int j = 0; j < w; j++) {\n for(auto [dx, dy] : dir) {\n ll p = (i + h + dx) % h, q = (j + w + dy) % w;\n string s(1, v[i][j]);\n while(p != i || q != j) {\n s.push_back(v[p][q]);\n mp[s]++;\n p = (p + h + dx) % h, q = (q + w + dy) % w;\n }\n }\n }\n }\n\n ll len = 0;\n string ans;\n for(auto [s, cnt] : mp) {\n if(cnt > 1) {\n if(chmax(len, s.size())) {\n ans = s;\n }\n }\n }\n\n if(len == 0) {\n cout << 0 << endl;\n } else {\n cout << ans << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":30080,"score_of_the_acc":-0.9452,"final_rank":5},{"submission_id":"aoj_1316_10946406","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <map>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 40;\nconst int dx[] = {1, -1, 0, 0 , 1, 1, -1, -1},\n\t \t dy[] = {0, 0, 1, -1, 1, -1, 1, -1};\n\nint n, m, ml, cnt;\nchar donut[maxn][maxn];\nstring ans[2000];\nmap<string, int> mp;\n\nint main()\n{\n#ifdef LOCAL\n\tfreopen(\"B.in\", \"r\", stdin);\n#endif\n\twhile(scanf(\"%d%d\", &n, &m) != EOF) {\n\t\tif(n == 0 && m == 0)\tbreak;\n\t\tml = cnt = 0;\n\t\tmp.clear();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tscanf(\"%s\", donut[i]);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) \n\t\t\t\tfor(int k = 0; k < 8; k++) {\n\t\t\t\t\tstring tmp = \"\";\n\t\t\t\t\tint nx = i, ny = j;\n\t\t\t\t\tdo{\n\t\t\t\t\t\ttmp += donut[nx][ny];\n\t\t\t\t\t\tif(tmp.size() >= 2 && tmp.size() >= ml) {\n\t\t\t\t\t\t\tif(!mp[tmp])\tmp.insert(pair <string, int> (tmp, 1));\t\n\t\t\t\t\t\t\telse if(tmp.size() == ml && mp[tmp] == 1) \n\t\t\t\t\t\t\t\tans[cnt++] = tmp;\n\t\t\t\t\t\t\telse if(tmp.size() > ml) {\n\t\t\t\t\t\t\t\tml = tmp.size();\n\t\t\t\t\t\t\t\tcnt = 0;\n\t\t\t\t\t\t\t\tans[cnt++] = tmp;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmp[tmp]++;\t\t\t\t\t\t\n\t\t\t\t\t\tnx = (nx+dx[k]+n)%n;\n\t\t\t\t\t\tny = (ny+dy[k]+m)%m;\n\t\t\t\t\t}while(nx != i || ny != j);\t\n//\t\t\t\t\tcout << tmp << endl;\t\n\t\t\t\t\t/*\n\t\t\t\t\tif(!mp[tmp])\tmp.insert(pair <string, int> (tmp, 1));\t\n\t\t\t\t\telse {\n\t\t\t\t\t\tif(tmp.size() == ml && mp[tmp] == 1) {\n\t\t\t\t\t\t\tans[cnt++] = tmp;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(tmp.size() > ml) {\n\t\t\t\t\t\t\tml = tmp.size();\n\t\t\t\t\t\t\tcnt = 0;\n\t\t\t\t\t\t\tans[cnt++] = tmp;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmp[tmp]++;\n\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t}\n\t\tsort(ans, ans+cnt);\n\t\tif(cnt)\tprintf(\"%s\\n\", ans[0].c_str());\n\t\telse\tprintf(\"0\\n\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":410,"memory_kb":30120,"score_of_the_acc":-1.0171,"final_rank":16},{"submission_id":"aoj_1316_10885614","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\nint dx[] = {-1,-1,-1,0,0,1,1,1};\nint dy[] = {-1,0,1,-1,1,-1,0,1};\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int h,w;cin >> h >> w;\n if(!h)break;\n vector<string> s(h);cin >> s;\n string res = \"0\";\n unordered_set<string> st;\n rep(i,0,h)rep(j,0,w)rep(dir,0,8){\n string t = \"\";\n t += s[i][j];\n int ni = (i+dy[dir]+h)%h,nj = (j+dx[dir]+w)%w;\n while(ni != i || nj != j){\n t += s[ni][nj];\n if(st.count(t)){\n if(sz(t) > sz(res))res = t;\n else if(sz(t) == sz(res)){\n if(t < res)res = t;\n }\n }else st.insert(t);\n ni = (ni+dy[dir]+h)%h,nj = (nj+dx[dir]+w)%w;\n }\n }\n cout << res << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":29480,"score_of_the_acc":-0.9423,"final_rank":4},{"submission_id":"aoj_1316_10538817","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #include \"Src/Number/IntegerDivision.hpp\"\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// #include \"Src/Algebra/Group/AdditiveGroup.hpp\"\n// #include \"Src/DataStructure/FenwickTree/FenwickTree.hpp\"\n// #include \"Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\n#include <set>\nint H, W;\nstd::string S[10];\nbool solve() {\n std::cin >> H >> W;\n if (H == 0 and W == 0) return false;\n for (int i = 0 ; i < H ; i++) std::cin >> S[i];\n std::vector<std::string> app;\n for (int sy = 0 ; sy < H ; sy++) for (int sx = 0 ; sx < W ; sx++) {\n for (int dy = -1 ; dy <= 1 ; dy++) for (int dx = -1 ; dx <= 1 ; dx++) if (dy != 0 or dx != 0) {\n std::set<std::pair<int, int>> vis;\n std::string T;\n for (int d = 0 ; ; d++) {\n const int py = ((sy + d * dy) % H + H) % H;\n const int px = ((sx + d * dx) % W + W) % W;\n if (vis.contains(std::pair{py, px})) break;\n vis.insert({py, px});\n T += S[py][px];\n if (T.size() >= 2u) app.push_back(T);\n }\n }\n }\n ranges::sort(app);\n std::vector<std::string> multiple;\n for (int i = 0, j = 0 ; i < std::ssize(app) ; i = j) {\n while (j < std::ssize(app) and app[i] == app[j]) j++;\n if (j - i >= 2) multiple.push_back(app[i]);\n }\n std::vector<std::string> ans;\n for (int i = 0 ; i < std::ssize(multiple) ; i++) {\n auto it = ranges::lower_bound(multiple.begin() + i + 1, multiple.end(), multiple[i]);\n if (it == multiple.end() or it->size() < multiple[i].size() or it->substr(0, multiple[i].size()) != multiple[i])\n ans.push_back(multiple[i]);\n }\n if (ans.empty()) std::cout << 0 << '\\n';\n else {\n int idx = 0;\n for (int i = 1 ; i < std::ssize(ans) ; i++) if (ans[idx].size() < ans[i].size()) idx = i;\n std::cout << ans[idx] << '\\n';\n }\n return true;\n}\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n while (solve()) std::cout.flush();\n}","accuracy":1,"time_ms":290,"memory_kb":31208,"score_of_the_acc":-1.0015,"final_rank":14},{"submission_id":"aoj_1316_9599420","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vector<vector<char>> C(N,vector<char>(M));\n rep(i,0,N) rep(j,0,M) cin >> C[i][j];\\\n map<string,int> mp;\n rep(i,0,N) {\n rep(j,0,M) {\n rep(dx,-1,2) {\n rep(dy,-1,2) {\n if (dx==0 && dy==0) continue;\n vector<vector<bool>> used(N,vector<bool>(M,false));\n int PX = i, PY = j;\n string Cur = \"\";\n while(1) {\n if (used[PX][PY]) break;\n Cur += C[PX][PY];\n used[PX][PY] = true;\n PX = (PX + N + dx) % N;\n PY = (PY + M + dy) % M;\n }\n for (int k = 2; k <= Cur.size(); k++) {\n mp[Cur.substr(0,k)]++;\n }\n }\n }\n }\n }\n vector<string> S;\n for (auto it = mp.begin(); it != mp.end(); it++) {\n if (it->second >= 2) S.push_back(it->first);\n }\n string ANS = \"\";\n rep(i,0,S.size()) {\n if (ANS.size() < S[i].size()) ANS = S[i];\n else if (ANS.size() == S[i].size() && ANS > S[i]) ANS = S[i];\n }\n if (ANS == \"\") cout << 0 << endl;\n else cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":290,"memory_kb":32496,"score_of_the_acc":-1.0456,"final_rank":19},{"submission_id":"aoj_1316_7909539","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int H, W; cin >> H >> W;\n if (H == 0 and W == 0) return false;\n vector<vector<char>> G(H, vector<char>(W));\n for (auto& g : G) for (auto& x : g) cin >> x;\n\n auto get = [&](int sy, int sx, int dy, int dx) -> string {\n vector<vector<bool>> used(H, vector<bool>(W, false));\n int ny = sy, nx = sx;\n string res{};\n while (!used.at(ny).at(nx)) {\n res += G[ny][nx];\n used[ny][nx] = true;\n ny += dy; ny = (ny + H) % H;\n nx += dx; nx = (nx + W) % W;\n }\n return res;\n };\n \n /*\n cout << get(4, 5, -1, 1) << endl;\n exit(0);\n */\n\n map<string, int> mp{};\n\n for (int sy = 0 ; sy < H ; sy++) {\n for (int sx = 0 ; sx < W ; sx++) {\n for (int dy = -1 ; dy <= 1 ; dy++) {\n for (int dx = -1 ; dx <= 1 ; dx++) {\n if (dy == 0 and dx == 0) continue;\n string s = get(sy, sx, dy, dx);\n for (size_t len = 2 ; len <= s.size() ; len++) {\n mp[s.substr(0, len)]++;\n }\n }\n }\n }\n }\n\n string ans{};\n for (const auto& [s, cnt] : mp) {\n if (cnt < 2) continue;\n if (ans.size() > s.size()) continue;\n if (ans.size() == s.size()) {\n ans = min(ans, s);\n }\n else {\n ans = s;\n }\n }\n\n if (ans.empty()) {\n cout << 0 << endl;\n }\n else {\n cout << ans << endl;\n }\n\n return true;\n}\n \n\nint main() {\n while (solve()) ;\n}","accuracy":1,"time_ms":300,"memory_kb":29820,"score_of_the_acc":-0.9584,"final_rank":8},{"submission_id":"aoj_1316_7136181","code_snippet":"// author: hanyu\n#include <bits/stdc++.h>\nusing namespace std;\n\nvector<int> di = {0, -1, -1, -1, 0, 1, 1, 1}, dj = {1, 1, 0, -1, -1, -1, 0, 1};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int h, w;\n cin >> h >> w;\n if (h + w == 0) break;\n\n vector<string> x(h);\n for (int i = 0; i < h; i++) cin >> x[i];\n\n map<string, int> mp;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n for (int way = 0; way < 8; way++) {\n string s = \"\";\n int nowi = i, nowj = j;\n vector<vector<int>> visit(h, vector<int>(w, 0));\n while (true) {\n if (visit[nowi][nowj] == 1) break;\n visit[nowi][nowj] = 1;\n s += x[nowi][nowj];\n if (s.size() >= 2) mp[s]++;\n nowi += di[way];\n nowj += dj[way];\n if (nowi < 0) nowi += h;\n if (nowi >= h) nowi -= h;\n if (nowj < 0) nowj += w;\n if (nowj >= w) nowj -= w;\n }\n }\n }\n }\n\n string answer = \"\";\n for (auto i : mp) {\n if (i.second <= 1) continue;\n if (i.first.size() > answer.size()) answer = i.first;\n }\n\n if (answer == \"\") cout << 0 << endl;\n else cout << answer << endl;\n }\n}","accuracy":1,"time_ms":300,"memory_kb":29768,"score_of_the_acc":-0.9566,"final_rank":6},{"submission_id":"aoj_1316_6779082","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> pll;\ntypedef vector<ll> vll;\ntypedef vector<pll> vpll;\n#define mp make_pair\n#define pb push_back\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define rrep(i,l,r) for(int i=l;i<=r;i++)\n#define chmin(a,b) a=min(a,b)\n#define chmax(a,b) a=max(a,b)\n#define all(x) x.begin(),x.end()\n#define unq(x) sort(all(x));x.erase(unique(all(x)),x.end())\n//#define mod 1000000007\n#define mod 998244353\n//ll mod;\n#define ad(a,b) a=(a+b)%mod;\n#define mul(a,b) a=a*b%mod;\nvoid readv(vector<ll> &a,ll n){\n\trep(i,n){\n\t\tll x;\n\t\tcin>>x;\n\t\ta.push_back(x);\n\t}\n}\nvoid outv(vector<ll> &a,ll n){\n\trep(i,n){\n\t\tif(i>0)cout<<\" \";\n\t\tcout<<a[i];\n\t}\n\tcout<<\"\\n\";\n}\nll po(ll x,ll y){\n\tll res=1;\n\tfor(;y;y>>=1){\n\t\tif(y&1)res=res*x%mod;\n\t\tx=x*x%mod;\n\t}\n\treturn res;\n}\nll gcd(ll a,ll b){\n\treturn (b?gcd(b,a%b):a);\n}\n#define FACMAX 200010\nll fac[FACMAX],inv[FACMAX],ivf[FACMAX];\nvoid initfac(){\n\tfac[0]=ivf[0]=inv[1]=1;\n\tfor(ll i=1;i<FACMAX;i++)fac[i]=fac[i-1]*i%mod;\n\tfor(ll i=1;i<FACMAX;i++){\n\t\tif(i>1)inv[i]=(mod-mod/i*inv[mod%i]%mod)%mod;\n\t\tivf[i]=po(fac[i],mod-2);\n\t}\n}\nll P(ll n,ll k){\n\tif(n<0||n<k)return 0;\n\treturn fac[n]*ivf[n-k]%mod;\n}\nll C(ll n,ll k){\n\tif(k<0||n<k)return 0;\n\treturn fac[n]*ivf[n-k]%mod*ivf[k]%mod;\n}\nll H(ll n,ll k){\n\treturn C(n+k-1,k);\n}\n\nll dx[]={1,1,1,0,0,-1,-1,-1};\nll dy[]={1,0,-1,1,-1,1,0,-1};\nll h,w;\nchar c[10][20];\nvoid solve(){\n\tvector<string> v;\n\trep(i,h)rep(j,w){\n\t\trep(dir,8){\n\t\t\tbool vis[10][20];\n\t\t\trep(i,h)rep(j,w)vis[i][j]=0;\n\t\t\tstring s;\n\t\t\tll x=i,y=j;\n\t\t\twhile(!vis[x][y]){\n\t\t\t\tvis[x][y]=1;\n\t\t\t\ts.pb(c[x][y]);\n\t\t\t\tv.pb(s);\n\t\t\t\tx=(x+dx[dir]+h)%h;\n\t\t\t\ty=(y+dy[dir]+w)%w;\n\t\t\t}\n\t\t}\n\t}\n\tsort(all(v));\n\tstring res=\"0\";\n\trep(i,v.size()-1){\n\t\tif(v[i]==v[i+1]){\n\t\t\tbool ok=0;\n\t\t\tif(res.size()<v[i].size())ok=1;\n\t\t\tif(res.size()==v[i].size()&&res>v[i])ok=1;\n\t\t\tif(ok)res=v[i];\n\t\t}\n\t}\n\tcout<<res<<endl;\n}\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\twhile(1){\n\t\tcin>>h>>w;\n\t\tif(h==0&&w==0)break;\n\t\trep(i,h)rep(j,w)cin>>c[i][j];\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":230,"memory_kb":32580,"score_of_the_acc":-1.022,"final_rank":17},{"submission_id":"aoj_1316_6385527","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef long double ld;\ntypedef pair<ll, ll> pint;\n#define rep(i, n) for(ll i = 0; i < (ll)n; i++)\n#define ALL(v) (v).begin(), (v).end()\nconst ll MOD = 1000000007;\nconst ll INF = 1e16;\nll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\nll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\n\nint main() {\n while(1) {\n ll H, W; cin >> H >> W;\n if(H == 0 && W == 0) break;\n vector<string> V(H);\n rep(i, H) cin >> V[i];\n map<string, ll> mp;\n rep(i, H) {\n rep(j, W) {\n rep(k, 8) {\n ll nx = j;\n ll ny = i;\n string S = \"\";\n S += V[ny][nx];\n while(1) {\n nx = (nx+dx[k]+W)%W;\n ny = (ny+dy[k]+H)%H;\n if(i == ny && j == nx) break;\n S += V[ny][nx];\n mp[S]++;\n }\n }\n }\n }\n vector<string> ans;\n ll sz = 0;\n for(auto c: mp) if(c.second > 1) sz = max(sz, (ll)c.first.size());\n for(auto c: mp) if(c.second > 1 && sz == (ll)c.first.size()) ans.push_back(c.first);\n if(ans.size() == 0) cout << 0 << \"\\n\";\n else {\n \n sort(ALL(ans));\n cout << ans[0] << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":380,"memory_kb":29996,"score_of_the_acc":-0.9996,"final_rank":12},{"submission_id":"aoj_1316_6331349","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint h, w;\n\twhile(cin >> h >> w){\n\t\tif(!h)return 0;\n\t\tvector<string> A(h);\n\t\tfor(auto &&s:A)cin >> s;\n\t\tmap<string,int> mp;\n\t\tauto safe=[&](int &y,int &x){\n\t\t\tif(y>=h)y-=h;\n\t\t\tif(x>=w)x-=w;\n\t\t\tif(y<0)y+=h;\n\t\t\tif(x<0)x+=w;\n\t\t};\n\t\tauto f=[&](int y,int x,int dy,int dx){\n\t\t\tstring ans;\n\t\t\tans+=A[y][x];\n\t\t\tint cy=y+dy,cx=x+dx;\n\t\t\tsafe(cy,cx);\n\t\t\twhile(cy!=y||cx!=x){\n\t\t\t\tans+=A[cy][cx];\n\t\t\t\tcy+=dy,cx+=dx;\n\t\t\t\tsafe(cy,cx);\n mp[ans]++;\n\t\t\t}\n\t\t};\n\t\tfor(int y=0;y<h;y++){\n\t\t\tfor(int x=0;x<w;x++){\n\t\t\t\tfor(int dy=-1;dy<=1;dy++){\n\t\t\t\t\tfor(int dx=-1;dx<=1;dx++){\n\t\t\t\t\t\tif(dy==0&&dx==0)continue;\n\t\t\t\t\t\tf(y,x,dy,dx);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint maxv=0;\n\t\tstring ans;\n\t\tfor(auto p:mp){\n if(p.second==1)continue;\n\t\t\tif(p.first.size()>maxv){\n\t\t\t\tmaxv=p.first.size();\n\t\t\t\tans=p.first;\n\t\t\t}else if(p.first.size()==maxv){\n\t\t\t\tans=min(ans,p.first);\n\t\t\t}\n\t\t}\n if(ans.empty())ans=\"0\";\n\t\tcout << ans << '\\n';\n\t}\n}","accuracy":1,"time_ms":300,"memory_kb":29972,"score_of_the_acc":-0.9636,"final_rank":9},{"submission_id":"aoj_1316_6219734","code_snippet":"#include <stdio.h>\n#include <string>\n#include <unordered_map>\nusing namespace std;\n\nchar pat[16][32], vis[16][32];\nint dxy[8][2] = { {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1} };\nunordered_map<string, int> u;\n\nvoid clearmat(char* s, int h, int w, int ww) {\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) s[i * ww + j] = 0;\n }\n}\n\nint main(void) {\n int h, w, x, y;\n string s;\n while (1) {\n scanf(\"%d %d\", &h, &w);\n if (h == 0) break;\n for (int i = 0; i < h; i++) {\n scanf(\"%s\", pat[i]);\n }\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n for (int d = 0; d < 8; d++) {\n x = i, y = j;\n s = \"\";\n while (!vis[x][y]) {\n vis[x][y] = 1;\n s += pat[x][y];\n if (s.length() > 1) {\n if (u.find(s) == u.end()) u.insert(pair<string, int>(s, 1));\n else u[s]++;\n }\n x += dxy[d][0];\n y += dxy[d][1];\n if (x < 0) x += h;\n if (x >= h) x -= h;\n if (y < 0) y += w;\n if (y >= w) y -= w;\n }\n clearmat((char*)vis, h, w, 32);\n }\n }\n }\n\n s = \"\";\n for (auto i : u) {\n if (i.second > 1) {\n if (i.first.length() > s.length()) s = i.first;\n else if (i.first.length() == s.length() && s.compare(i.first) > 0) s = i.first;\n }\n }\n u.clear();\n if (s.length() < 2) printf(\"0\\n\");\n else printf(\"%s\\n\", s.c_str());\n }\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":28644,"score_of_the_acc":-0.9181,"final_rank":2},{"submission_id":"aoj_1316_6196047","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define ALL(x) x.begin(), x.end()\n\nint dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nint dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nint main() {\n int H, W;\n while (cin >> H >> W) {\n if (H == 0 && W == 0) break;\n vector<string> G(H);\n rep(i, H) cin >> G[i];\n string ans = \"\";\n rep(x1, H) rep(y1, W) rep(x2, H) rep(y2, W) {\n if (G[x1][y1] != G[x2][y2]) continue;\n rep(k1, 8) rep(k2, 8) {\n if (x1 == x2 && y1 == y2 && k1 == k2) continue;\n int nx1 = (x1 + dx[k1] + H) % H, ny1 = (y1 + dy[k1] + W) % W;\n int nx2 = (x2 + dx[k2] + H) % H, ny2 = (y2 + dy[k2] + W) % W;\n if (G[nx1][ny1] != G[nx2][ny2]) continue;\n string s = \"\";\n s += G[x1][y1];\n vector<vector<int>> seen1(H, vector<int>(W)), seen2(H, vector<int>(W));\n seen1[x1][y1] = 1;\n seen2[x2][y2] = 1;\n while (G[nx1][ny1] == G[nx2][ny2] && seen1[nx1][ny1] == 0 && seen2[nx2][ny2] == 0) {\n s += G[nx1][ny1];\n seen1[nx1][ny1] = 1;\n seen2[nx2][ny2] = 1;\n nx1 = (nx1 + dx[k1] + H) % H, ny1 = (ny1 + dy[k1] + W) % W;\n nx2 = (nx2 + dx[k2] + H) % H, ny2 = (ny2 + dy[k2] + W) % W;\n }\n if (ans.size() == 0)\n ans = s;\n else if (ans.size() < s.size() || (ans.size() == s.size() && ans > s))\n ans = s;\n }\n }\n if (ans.size() == 0)\n cout << 0 << '\\n';\n else\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":2450,"memory_kb":3372,"score_of_the_acc":-1,"final_rank":13},{"submission_id":"aoj_1316_6029149","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, a, n) for(int i = a; i < (n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\nconst int INF = 1001001001;\nconst ll LINF = 1001002003004005006ll;\n//const int mod = 1000000007;\n//const int mod = 998244353;\nconst int di[] = {1,1,0,-1,-1,-1,0,1};\nconst int dj[] = {0,1,1,1,0,-1,-1,-1};\n\nint main()\n{\n while(true){\n int h, w;\n cin >> h >> w;\n if(h == 0 && w == 0) return 0;\n vector<string> s(h);\n rep(i, 0, h) cin >> s[i];\n map<string, int> mp;\n string ans;\n auto dfs = [&](auto& f, int si, int sj, int i, int j, int dir, string t) -> void{\n int ni = (i + di[dir] + h)%h;\n int nj = (j + dj[dir] + w)%w;\n mp[t]++;\n if(si == ni && sj == nj) return;\n else f(f, si, sj, ni, nj, dir, t + s[ni][nj]);\n };\n rep(i, 0, h){\n rep(j, 0, w){\n rep(dir, 0, 8){\n string t;\n t += s[i][j];\n dfs(dfs, i, j, i, j, dir, t);\n }\n }\n }\n for(auto i : mp){\n if(i.second >= 2){\n if(ans.size() == i.first.size()) ans = min(ans, i.first);\n else ans = (ans.size() > i.first.size()) ? ans : i.first;\n }\n }\n if(ans.size() <= 1) cout << 0 << endl;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":380,"memory_kb":30216,"score_of_the_acc":-1.0072,"final_rank":15},{"submission_id":"aoj_1316_6029083","code_snippet":"// #include \"atcoder/all\"\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h>\n#include <functional>\n#include <cassert>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing P = pair<ll,ll>;\nconstexpr ll INF = 1e18;\nconstexpr ll LLMAX = 9223372036854775807;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\n// constexpr ll mod = 998244353;\n// 右下左上\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define eol endl\n// ---------------------------------------------------------------------------\n\nbool solve(){\n int H,W;\n cin >> H >> W;\n if(H == 0) return false;\n vector<string> G(H);\n for(int i=0; i<H; i++){\n cin >> G[i];\n }\n set<string> mp;\n int ansL = 0;\n string ansS = \"\";\n for(int i=0; i<H; i++){\n for(int j=0; j<W; j++){\n for(int k=0; k<8; k++){\n int y = i;\n int x = j;\n string now = \"\";\n now += G[y][x];\n y += dy[k];\n x += dx[k];\n y += H;\n x += W;\n y %= H;\n x %= W;\n while(y != i || x != j){\n now += G[y][x];\n if(mp.count(now)){\n if(ansL < now.size()){\n ansL = now.size();\n ansS = now;\n }else if(ansL == now.size()){\n chmin(ansS,now);\n }\n }else{\n mp.emplace(now);\n }\n y += dy[k];\n x += dx[k];\n y += H;\n x += W;\n y %= H;\n x %= W;\n }\n }\n }\n }\n if(ansL <= 1){\n cout << 0 << endl;\n }else{\n cout << ansS << endl;\n }\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":29788,"score_of_the_acc":-0.9573,"final_rank":7},{"submission_id":"aoj_1316_6029006","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nconst int INF = 1e9;\nconst ll inf = 1LL<<60;\n\nvector<int> dx = {0, 1, 1, 1, 0, -1, -1, -1};\nvector<int> dy = {1, 1, 0, -1, -1, -1, 0, 1};\n\nbool solve() {\n int h, w; cin >> h >> w;\n if (h == 0) return false;\n vector<string> s(h);\n for (int i=0; i<h; i++) cin >> s[i];\n vector<string> S;\n for (int i=0; i<h; i++) for (int j=0; j<w; j++) {\n for (int k=0; k<8; k++) {\n string t = \"\";\n t += s[i][j];\n int nx = i, ny = j;\n while (1) {\n nx = (nx + dx[k]);\n ny = (ny + dy[k]);\n if (nx < 0) nx = h-1;\n if (ny < 0) ny = w-1;\n if (nx >= h) nx = 0;\n if (ny >= w) ny = 0;\n if (i == nx && j == ny) break;\n t += s[nx][ny];\n }\n if (t.size() == 1) continue;\n S.push_back(t);\n }\n }\n auto calc = [](string &a, string &b) -> string {\n string res = \"\";\n for (int i=0; i<min(a.size(), b.size()); i++) {\n if (a[i] != b[i]) break;\n res += a[i];\n }\n return res;\n };\n int ma = 2;\n set<string> P;\n for (int i=0; i<S.size(); i++) for (int j=i+1; j<S.size(); j++) {\n string k = calc(S[i], S[j]);\n if (k.size() < ma) continue;\n P.insert(k);\n ma = max(ma, (int)k.size());\n }\n for (auto c : P) if (c.size() == ma) {\n cout << c << endl;\n return true;\n }\n cout << 0 << endl;\n return true;\n}\n\nint main() {\n while (solve());\n}","accuracy":1,"time_ms":180,"memory_kb":3592,"score_of_the_acc":-0.0075,"final_rank":1},{"submission_id":"aoj_1316_6026945","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <utility>\n#include <map>\n\nusing namespace std;\n\nint dx[] = { -1, -1, -1, 0, 0, 0, 1, 1, 1 };\nint dy[] = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };\n\nint main() {\n\tint h, w;\n\twhile (cin >> h >> w, h || w) {\n\t\tvector<string> vs(h);\n\t\tfor (auto& s : vs) cin >> s;\n\t\tvector<map<string, int> > mps(h * w + 1);\n\t\tint ans_len = 0;\n\t\tfor (int x = 0; x < h; ++x) {\n\t\t\tfor (int y = 0; y < w; ++y) {\n\t\t\t\tfor (int i = 0; i < 9; ++i) {\n\t\t\t\t\tstring tmp { vs[x][y] };\n\t\t\t\t\tint nx = x, ny = y;\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tnx = (nx + dx[i] + h) % h;\n\t\t\t\t\t\tny = (ny + dy[i] + w) % w;\n\t\t\t\t\t\tif (x == nx && y == ny) break;\n\t\t\t\t\t\ttmp += vs[nx][ny];\n\t\t\t\t\t\t++mps[tmp.length()][tmp];\n\t\t\t\t\t\tif (mps[tmp.length()][tmp] > 1)\n\t\t\t\t\t\t\tans_len = max(ans_len, (int)tmp.length());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans_len) {\n\t\t\tstring ans(ans_len, 'Z');\n\t\t\tfor (auto& [s, count] : mps[ans_len])\n\t\t\t\tif (count > 1 && ans > s) ans = s;\n\t\t\tcout << ans << endl;\n\t\t} else cout << 0 << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":220,"memory_kb":29704,"score_of_the_acc":-0.9192,"final_rank":3},{"submission_id":"aoj_1316_6025991","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\tint di[] = {-1, -1, -1, 0, 0, +1, +1, +1};\n\tint dj[] = {-1, 0, +1, -1, +1, -1, 0, +1};\n\t\n\twhile(true) {\n\t\tint h,w; cin >> h >> w; if(h == 0) break;\n\t\tvector< string > s(h);\n\t\trep(i,h) cin >> s[i];\n\n\t\tmap<string,int> mp;\n\t\trep(d,8) {\n\t\t\tvector<vector<bool>> used(h, vector<bool> (w, false));\n\t\t\trep(i,h)rep(j,w) {\n\t\t\t\tif(used[i][j]) continue;\n\t\t\t\tint ci = i, cj = j;\n\t\t\t\tstring t = \"\";\n\t\t\t\twhile(!used[ci][cj]) {\n\t\t\t\t\tused[ci][cj] = true;\n\t\t\t\t\tt += s[ci][cj];\n\t\t\t\t\tci = (ci + di[d] + h) % h;\n\t\t\t\t\tcj = (cj + dj[d] + w) % w;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tint N = t.size();\n\t\t\t\tt += t;\n\t\t\t\trep(k,N)for(int c = 2; c <= N; c++)\n\t\t\t\t\tmp[t.substr(k, c)]++;\n\t\t\t}\n\t\t}\n\n\t\tstring ans = \"\";\n\t\tfor(auto e : mp) if(e.second >= 2) {\n\t\t\tstring t = e.first;\n\t\t\tif(t.size() > ans.size()) ans = t;\n\t\t\telse if(t.size() == ans.size()) ans = min(ans, t);\n\t\t}\n\t\tcout << (ans.size() == 0 ? \"0\" : ans) << endl;\n\t}\n}","accuracy":1,"time_ms":320,"memory_kb":29936,"score_of_the_acc":-0.9712,"final_rank":11},{"submission_id":"aoj_1316_5997941","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\nvll dx = { 1,-1,0 };\nvll dy = { 1,-1,0 };\nint main() {\n while (1) {\n ll H, W;\n cin >> H >> W;\n if (H == 0)return 0;\n vector<vector<char>> V(H, vector<char>(W));\n rep(h, H) {\n string S;\n cin >> S;\n rep(w, W)V[h][w] = S[w];\n }\n map<string, ll> M;\n rep(h, H) {\n rep(w, W) {\n rep(i, 8) {\n ll x = h; ll y = w;\n string K = \"\";\n while (1) {\n K += V[x][y];\n x += dx[i / 3]+H;\n y += dy[i % 3]+W;\n x %= H; y %= W;\n M[K]++;\n if (x == h && y == w) {\n \n break;\n }\n }\n }\n }\n }\n ll m = 0;\n string an = \"0\";\n for (auto p : M) {\n if (p.second > 1) {\n if (p.first.size() > an.size()) {\n an = p.first;\n }\n else if (p.first.size() == an.size()) {\n if (p.first < an) {\n an = p.first;\n }\n }\n }\n }\n cout << an << endl;\n }\n}","accuracy":1,"time_ms":310,"memory_kb":30056,"score_of_the_acc":-0.9709,"final_rank":10},{"submission_id":"aoj_1316_5879279","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nconst int di[8] = {-1, -1, 0, 1, 1, 1, 0, -1};\nconst int dj[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nbool solve() {\n int N, M;\n cin >> N >> M;\n if(N == 0) return false;\n vector<string> G(N);\n REP(i, N) cin >> G[i];\n\n map<string, int> cnt;\n REP(si, N) REP(sj, M) {\n set<string> se;\n REP(dir, 8) {\n string s = \"\";\n int ni = si, nj = sj;\n while(1) {\n s += G[ni][nj];\n se.emplace(s);\n ni = (ni + di[dir] + N) % N;\n nj = (nj + dj[dir] + M) % M;\n if(ni == si and nj == sj) break;\n }\n }\n for(auto s : se) cnt[s] += 1;\n }\n string ans = \"\";\n for(const auto& [s, num] : cnt) {\n if(num <= 1) continue;\n if(ans.size() < s.size()) ans = s;\n else if(ans > s) ans = s;\n }\n\n if((int)ans.size() <= 1) cout << \"0\\n\";\n else cout << ans << \"\\n\";\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":490,"memory_kb":30216,"score_of_the_acc":-1.0556,"final_rank":20},{"submission_id":"aoj_1316_5876556","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing P = pair<int,int>;\n\nvoid solve(int H, int W){\n vector<string> vec(H);\n for(int i=0; i<H; i++){\n cin >> vec[i];\n }\n set<string> S;\n string ans = \"\";\n for(int i=0; i<H; i++){\n for(int j=0; j<W; j++){\n for(int a=-1; a<=1; a++){\n for(int b=-1; b<=1; b++){\n if(a == 0 && b == 0){\n continue;\n }\n string add = \"\";\n set<P> p;\n int x = i;\n int y = j;\n while(true){\n if(p.count(P(x,y))){\n break;\n }\n add += vec[x][y];\n p.insert(P(x,y));\n x = (x+a+H)%H;\n y = (y+b+W)%W; \n if(S.count(add)){\n if(add.size() > ans.size()){\n ans = add;\n }\n if(add.size() == ans.size() && add < ans){\n ans = add;\n }\n }\n S.insert(add);\n }\n }\n }\n }\n }\n if(ans.size() <= 1){\n cout << 0 << endl;\n }\n else{\n cout << ans << endl;\n }\n}\n\nint main(){\n while(true){\n int H, W;\n cin >> H >> W;\n if(H == 0){\n break;\n }\n solve(H,W);\n }\n}","accuracy":1,"time_ms":480,"memory_kb":29904,"score_of_the_acc":-1.0405,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1316_11047140\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<int, 2>;\\nusing a3 = array<ll, 3>;\\n\\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\\n\\nll mod = 998244353;\\nconst ll INF = 1e18;\\n\\nifstream in;\\nofstream out;\\n\\nint main(int argc, char** argv) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n if(argc > 2) {\\n in.open(argv[1]);\\n cin.rdbuf(in.rdbuf());\\n out.open(argv[2]);\\n cout.rdbuf(out.rdbuf());\\n }\\n\\n while(1) {\\n ll h, w;\\n cin >> h >> w;\\n if(h == 0) break;\\n\\n vector<string> v(h);\\n for(auto& x : v) cin >> x;\\n\\n map<string, ll> mp;\\n\\n vector<a2> dir = {\\n {1, 0}, {-1, 0}, {0, 1}, {0, -1},\\n {1, 1}, {1, -1}, {-1, 1}, {-1, -1},\\n };\\n for(int i = 0; i < h; i++) {\\n for(int j = 0; j < w; j++) {\\n for(auto [dx, dy] : dir) {\\n ll p = (i + h + dx) % h, q = (j + w + dy) % w;\\n string s(1, v[i][j]);\\n while(p != i || q != j) {\\n s.push_back(v[p][q]);\\n mp[s]++;\\n p = (p + h + dx) % h, q = (q + w + dy) % w;\\n }\\n }\\n }\\n }\\n\\n ll len = 0;\\n string ans;\\n for(auto [s, cnt] : mp) {\\n if(cnt > 1) {\\n if(chmax(len, s.size())) {\\n ans = s;\\n }\\n }\\n }\\n\\n if(len == 0) {\\n cout << 0 << endl;\\n } else {\\n cout << ans << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 30080,\n \"score_of_the_acc\": -0.9452,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1316_10946406\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <string>\\n#include <map>\\n#include <vector>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst int maxn = 40;\\nconst int dx[] = {1, -1, 0, 0 , 1, 1, -1, -1},\\n\\t \\t dy[] = {0, 0, 1, -1, 1, -1, 1, -1};\\n\\nint n, m, ml, cnt;\\nchar donut[maxn][maxn];\\nstring ans[2000];\\nmap<string, int> mp;\\n\\nint main()\\n{\\n#ifdef LOCAL\\n\\tfreopen(\\\"B.in\\\", \\\"r\\\", stdin);\\n#endif\\n\\twhile(scanf(\\\"%d%d\\\", &n, &m) != EOF) {\\n\\t\\tif(n == 0 && m == 0)\\tbreak;\\n\\t\\tml = cnt = 0;\\n\\t\\tmp.clear();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tscanf(\\\"%s\\\", donut[i]);\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) \\n\\t\\t\\t\\tfor(int k = 0; k < 8; k++) {\\n\\t\\t\\t\\t\\tstring tmp = \\\"\\\";\\n\\t\\t\\t\\t\\tint nx = i, ny = j;\\n\\t\\t\\t\\t\\tdo{\\n\\t\\t\\t\\t\\t\\ttmp += donut[nx][ny];\\n\\t\\t\\t\\t\\t\\tif(tmp.size() >= 2 && tmp.size() >= ml) {\\n\\t\\t\\t\\t\\t\\t\\tif(!mp[tmp])\\tmp.insert(pair <string, int> (tmp, 1));\\t\\n\\t\\t\\t\\t\\t\\t\\telse if(tmp.size() == ml && mp[tmp] == 1) \\n\\t\\t\\t\\t\\t\\t\\t\\tans[cnt++] = tmp;\\n\\t\\t\\t\\t\\t\\t\\telse if(tmp.size() > ml) {\\n\\t\\t\\t\\t\\t\\t\\t\\tml = tmp.size();\\n\\t\\t\\t\\t\\t\\t\\t\\tcnt = 0;\\n\\t\\t\\t\\t\\t\\t\\t\\tans[cnt++] = tmp;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tmp[tmp]++;\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tnx = (nx+dx[k]+n)%n;\\n\\t\\t\\t\\t\\t\\tny = (ny+dy[k]+m)%m;\\n\\t\\t\\t\\t\\t}while(nx != i || ny != j);\\t\\n//\\t\\t\\t\\t\\tcout << tmp << endl;\\t\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\tif(!mp[tmp])\\tmp.insert(pair <string, int> (tmp, 1));\\t\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tif(tmp.size() == ml && mp[tmp] == 1) {\\n\\t\\t\\t\\t\\t\\t\\tans[cnt++] = tmp;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if(tmp.size() > ml) {\\n\\t\\t\\t\\t\\t\\t\\tml = tmp.size();\\n\\t\\t\\t\\t\\t\\t\\tcnt = 0;\\n\\t\\t\\t\\t\\t\\t\\tans[cnt++] = tmp;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tmp[tmp]++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t*/\\n\\t\\t\\t\\t}\\n\\t\\tsort(ans, ans+cnt);\\n\\t\\tif(cnt)\\tprintf(\\\"%s\\\\n\\\", ans[0].c_str());\\n\\t\\telse\\tprintf(\\\"0\\\\n\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 30120,\n \"score_of_the_acc\": -1.0171,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1316_10885614\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\nint dx[] = {-1,-1,-1,0,0,1,1,1};\\nint dy[] = {-1,0,1,-1,1,-1,0,1};\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int h,w;cin >> h >> w;\\n if(!h)break;\\n vector<string> s(h);cin >> s;\\n string res = \\\"0\\\";\\n unordered_set<string> st;\\n rep(i,0,h)rep(j,0,w)rep(dir,0,8){\\n string t = \\\"\\\";\\n t += s[i][j];\\n int ni = (i+dy[dir]+h)%h,nj = (j+dx[dir]+w)%w;\\n while(ni != i || nj != j){\\n t += s[ni][nj];\\n if(st.count(t)){\\n if(sz(t) > sz(res))res = t;\\n else if(sz(t) == sz(res)){\\n if(t < res)res = t;\\n }\\n }else st.insert(t);\\n ni = (ni+dy[dir]+h)%h,nj = (nj+dx[dir]+w)%w;\\n }\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 29480,\n \"score_of_the_acc\": -0.9423,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1316_10538817\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n#include <tuple>\\n#include <ranges>\\nnamespace ranges = std::ranges;\\nnamespace views = std::views;\\n// #include \\\"Src/Number/IntegerDivision.hpp\\\"\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// #include \\\"Src/Algebra/Group/AdditiveGroup.hpp\\\"\\n// #include \\\"Src/DataStructure/FenwickTree/FenwickTree.hpp\\\"\\n// #include \\\"Src/DataStructure/SegmentTree/SegmentTree.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\n#include <set>\\nint H, W;\\nstd::string S[10];\\nbool solve() {\\n std::cin >> H >> W;\\n if (H == 0 and W == 0) return false;\\n for (int i = 0 ; i < H ; i++) std::cin >> S[i];\\n std::vector<std::string> app;\\n for (int sy = 0 ; sy < H ; sy++) for (int sx = 0 ; sx < W ; sx++) {\\n for (int dy = -1 ; dy <= 1 ; dy++) for (int dx = -1 ; dx <= 1 ; dx++) if (dy != 0 or dx != 0) {\\n std::set<std::pair<int, int>> vis;\\n std::string T;\\n for (int d = 0 ; ; d++) {\\n const int py = ((sy + d * dy) % H + H) % H;\\n const int px = ((sx + d * dx) % W + W) % W;\\n if (vis.contains(std::pair{py, px})) break;\\n vis.insert({py, px});\\n T += S[py][px];\\n if (T.size() >= 2u) app.push_back(T);\\n }\\n }\\n }\\n ranges::sort(app);\\n std::vector<std::string> multiple;\\n for (int i = 0, j = 0 ; i < std::ssize(app) ; i = j) {\\n while (j < std::ssize(app) and app[i] == app[j]) j++;\\n if (j - i >= 2) multiple.push_back(app[i]);\\n }\\n std::vector<std::string> ans;\\n for (int i = 0 ; i < std::ssize(multiple) ; i++) {\\n auto it = ranges::lower_bound(multiple.begin() + i + 1, multiple.end(), multiple[i]);\\n if (it == multiple.end() or it->size() < multiple[i].size() or it->substr(0, multiple[i].size()) != multiple[i])\\n ans.push_back(multiple[i]);\\n }\\n if (ans.empty()) std::cout << 0 << '\\\\n';\\n else {\\n int idx = 0;\\n for (int i = 1 ; i < std::ssize(ans) ; i++) if (ans[idx].size() < ans[i].size()) idx = i;\\n std::cout << ans[idx] << '\\\\n';\\n }\\n return true;\\n}\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n while (solve()) std::cout.flush();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 31208,\n \"score_of_the_acc\": -1.0015,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1316_9599420\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vector<vector<char>> C(N,vector<char>(M));\\n rep(i,0,N) rep(j,0,M) cin >> C[i][j];\\\\\\n map<string,int> mp;\\n rep(i,0,N) {\\n rep(j,0,M) {\\n rep(dx,-1,2) {\\n rep(dy,-1,2) {\\n if (dx==0 && dy==0) continue;\\n vector<vector<bool>> used(N,vector<bool>(M,false));\\n int PX = i, PY = j;\\n string Cur = \\\"\\\";\\n while(1) {\\n if (used[PX][PY]) break;\\n Cur += C[PX][PY];\\n used[PX][PY] = true;\\n PX = (PX + N + dx) % N;\\n PY = (PY + M + dy) % M;\\n }\\n for (int k = 2; k <= Cur.size(); k++) {\\n mp[Cur.substr(0,k)]++;\\n }\\n }\\n }\\n }\\n }\\n vector<string> S;\\n for (auto it = mp.begin(); it != mp.end(); it++) {\\n if (it->second >= 2) S.push_back(it->first);\\n }\\n string ANS = \\\"\\\";\\n rep(i,0,S.size()) {\\n if (ANS.size() < S[i].size()) ANS = S[i];\\n else if (ANS.size() == S[i].size() && ANS > S[i]) ANS = S[i];\\n }\\n if (ANS == \\\"\\\") cout << 0 << endl;\\n else cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 32496,\n \"score_of_the_acc\": -1.0456,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1316_7909539\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int H, W; cin >> H >> W;\\n if (H == 0 and W == 0) return false;\\n vector<vector<char>> G(H, vector<char>(W));\\n for (auto& g : G) for (auto& x : g) cin >> x;\\n\\n auto get = [&](int sy, int sx, int dy, int dx) -> string {\\n vector<vector<bool>> used(H, vector<bool>(W, false));\\n int ny = sy, nx = sx;\\n string res{};\\n while (!used.at(ny).at(nx)) {\\n res += G[ny][nx];\\n used[ny][nx] = true;\\n ny += dy; ny = (ny + H) % H;\\n nx += dx; nx = (nx + W) % W;\\n }\\n return res;\\n };\\n \\n /*\\n cout << get(4, 5, -1, 1) << endl;\\n exit(0);\\n */\\n\\n map<string, int> mp{};\\n\\n for (int sy = 0 ; sy < H ; sy++) {\\n for (int sx = 0 ; sx < W ; sx++) {\\n for (int dy = -1 ; dy <= 1 ; dy++) {\\n for (int dx = -1 ; dx <= 1 ; dx++) {\\n if (dy == 0 and dx == 0) continue;\\n string s = get(sy, sx, dy, dx);\\n for (size_t len = 2 ; len <= s.size() ; len++) {\\n mp[s.substr(0, len)]++;\\n }\\n }\\n }\\n }\\n }\\n\\n string ans{};\\n for (const auto& [s, cnt] : mp) {\\n if (cnt < 2) continue;\\n if (ans.size() > s.size()) continue;\\n if (ans.size() == s.size()) {\\n ans = min(ans, s);\\n }\\n else {\\n ans = s;\\n }\\n }\\n\\n if (ans.empty()) {\\n cout << 0 << endl;\\n }\\n else {\\n cout << ans << endl;\\n }\\n\\n return true;\\n}\\n \\n\\nint main() {\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 29820,\n \"score_of_the_acc\": -0.9584,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1316_7136181\",\n \"code_snippet\": \"// author: hanyu\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<int> di = {0, -1, -1, -1, 0, 1, 1, 1}, dj = {1, 1, 0, -1, -1, -1, 0, 1};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n int h, w;\\n cin >> h >> w;\\n if (h + w == 0) break;\\n\\n vector<string> x(h);\\n for (int i = 0; i < h; i++) cin >> x[i];\\n\\n map<string, int> mp;\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n for (int way = 0; way < 8; way++) {\\n string s = \\\"\\\";\\n int nowi = i, nowj = j;\\n vector<vector<int>> visit(h, vector<int>(w, 0));\\n while (true) {\\n if (visit[nowi][nowj] == 1) break;\\n visit[nowi][nowj] = 1;\\n s += x[nowi][nowj];\\n if (s.size() >= 2) mp[s]++;\\n nowi += di[way];\\n nowj += dj[way];\\n if (nowi < 0) nowi += h;\\n if (nowi >= h) nowi -= h;\\n if (nowj < 0) nowj += w;\\n if (nowj >= w) nowj -= w;\\n }\\n }\\n }\\n }\\n\\n string answer = \\\"\\\";\\n for (auto i : mp) {\\n if (i.second <= 1) continue;\\n if (i.first.size() > answer.size()) answer = i.first;\\n }\\n\\n if (answer == \\\"\\\") cout << 0 << endl;\\n else cout << answer << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 29768,\n \"score_of_the_acc\": -0.9566,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1316_6779082\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<ll> vll;\\ntypedef vector<pll> vpll;\\n#define mp make_pair\\n#define pb push_back\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define rrep(i,l,r) for(int i=l;i<=r;i++)\\n#define chmin(a,b) a=min(a,b)\\n#define chmax(a,b) a=max(a,b)\\n#define all(x) x.begin(),x.end()\\n#define unq(x) sort(all(x));x.erase(unique(all(x)),x.end())\\n//#define mod 1000000007\\n#define mod 998244353\\n//ll mod;\\n#define ad(a,b) a=(a+b)%mod;\\n#define mul(a,b) a=a*b%mod;\\nvoid readv(vector<ll> &a,ll n){\\n\\trep(i,n){\\n\\t\\tll x;\\n\\t\\tcin>>x;\\n\\t\\ta.push_back(x);\\n\\t}\\n}\\nvoid outv(vector<ll> &a,ll n){\\n\\trep(i,n){\\n\\t\\tif(i>0)cout<<\\\" \\\";\\n\\t\\tcout<<a[i];\\n\\t}\\n\\tcout<<\\\"\\\\n\\\";\\n}\\nll po(ll x,ll y){\\n\\tll res=1;\\n\\tfor(;y;y>>=1){\\n\\t\\tif(y&1)res=res*x%mod;\\n\\t\\tx=x*x%mod;\\n\\t}\\n\\treturn res;\\n}\\nll gcd(ll a,ll b){\\n\\treturn (b?gcd(b,a%b):a);\\n}\\n#define FACMAX 200010\\nll fac[FACMAX],inv[FACMAX],ivf[FACMAX];\\nvoid initfac(){\\n\\tfac[0]=ivf[0]=inv[1]=1;\\n\\tfor(ll i=1;i<FACMAX;i++)fac[i]=fac[i-1]*i%mod;\\n\\tfor(ll i=1;i<FACMAX;i++){\\n\\t\\tif(i>1)inv[i]=(mod-mod/i*inv[mod%i]%mod)%mod;\\n\\t\\tivf[i]=po(fac[i],mod-2);\\n\\t}\\n}\\nll P(ll n,ll k){\\n\\tif(n<0||n<k)return 0;\\n\\treturn fac[n]*ivf[n-k]%mod;\\n}\\nll C(ll n,ll k){\\n\\tif(k<0||n<k)return 0;\\n\\treturn fac[n]*ivf[n-k]%mod*ivf[k]%mod;\\n}\\nll H(ll n,ll k){\\n\\treturn C(n+k-1,k);\\n}\\n\\nll dx[]={1,1,1,0,0,-1,-1,-1};\\nll dy[]={1,0,-1,1,-1,1,0,-1};\\nll h,w;\\nchar c[10][20];\\nvoid solve(){\\n\\tvector<string> v;\\n\\trep(i,h)rep(j,w){\\n\\t\\trep(dir,8){\\n\\t\\t\\tbool vis[10][20];\\n\\t\\t\\trep(i,h)rep(j,w)vis[i][j]=0;\\n\\t\\t\\tstring s;\\n\\t\\t\\tll x=i,y=j;\\n\\t\\t\\twhile(!vis[x][y]){\\n\\t\\t\\t\\tvis[x][y]=1;\\n\\t\\t\\t\\ts.pb(c[x][y]);\\n\\t\\t\\t\\tv.pb(s);\\n\\t\\t\\t\\tx=(x+dx[dir]+h)%h;\\n\\t\\t\\t\\ty=(y+dy[dir]+w)%w;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(all(v));\\n\\tstring res=\\\"0\\\";\\n\\trep(i,v.size()-1){\\n\\t\\tif(v[i]==v[i+1]){\\n\\t\\t\\tbool ok=0;\\n\\t\\t\\tif(res.size()<v[i].size())ok=1;\\n\\t\\t\\tif(res.size()==v[i].size()&&res>v[i])ok=1;\\n\\t\\t\\tif(ok)res=v[i];\\n\\t\\t}\\n\\t}\\n\\tcout<<res<<endl;\\n}\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\twhile(1){\\n\\t\\tcin>>h>>w;\\n\\t\\tif(h==0&&w==0)break;\\n\\t\\trep(i,h)rep(j,w)cin>>c[i][j];\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 32580,\n \"score_of_the_acc\": -1.022,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1316_6385527\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef long double ld;\\ntypedef pair<ll, ll> pint;\\n#define rep(i, n) for(ll i = 0; i < (ll)n; i++)\\n#define ALL(v) (v).begin(), (v).end()\\nconst ll MOD = 1000000007;\\nconst ll INF = 1e16;\\nll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};\\nll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\n\\nint main() {\\n while(1) {\\n ll H, W; cin >> H >> W;\\n if(H == 0 && W == 0) break;\\n vector<string> V(H);\\n rep(i, H) cin >> V[i];\\n map<string, ll> mp;\\n rep(i, H) {\\n rep(j, W) {\\n rep(k, 8) {\\n ll nx = j;\\n ll ny = i;\\n string S = \\\"\\\";\\n S += V[ny][nx];\\n while(1) {\\n nx = (nx+dx[k]+W)%W;\\n ny = (ny+dy[k]+H)%H;\\n if(i == ny && j == nx) break;\\n S += V[ny][nx];\\n mp[S]++;\\n }\\n }\\n }\\n }\\n vector<string> ans;\\n ll sz = 0;\\n for(auto c: mp) if(c.second > 1) sz = max(sz, (ll)c.first.size());\\n for(auto c: mp) if(c.second > 1 && sz == (ll)c.first.size()) ans.push_back(c.first);\\n if(ans.size() == 0) cout << 0 << \\\"\\\\n\\\";\\n else {\\n \\n sort(ALL(ans));\\n cout << ans[0] << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 29996,\n \"score_of_the_acc\": -0.9996,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1316_6331349\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n\\tint h, w;\\n\\twhile(cin >> h >> w){\\n\\t\\tif(!h)return 0;\\n\\t\\tvector<string> A(h);\\n\\t\\tfor(auto &&s:A)cin >> s;\\n\\t\\tmap<string,int> mp;\\n\\t\\tauto safe=[&](int &y,int &x){\\n\\t\\t\\tif(y>=h)y-=h;\\n\\t\\t\\tif(x>=w)x-=w;\\n\\t\\t\\tif(y<0)y+=h;\\n\\t\\t\\tif(x<0)x+=w;\\n\\t\\t};\\n\\t\\tauto f=[&](int y,int x,int dy,int dx){\\n\\t\\t\\tstring ans;\\n\\t\\t\\tans+=A[y][x];\\n\\t\\t\\tint cy=y+dy,cx=x+dx;\\n\\t\\t\\tsafe(cy,cx);\\n\\t\\t\\twhile(cy!=y||cx!=x){\\n\\t\\t\\t\\tans+=A[cy][cx];\\n\\t\\t\\t\\tcy+=dy,cx+=dx;\\n\\t\\t\\t\\tsafe(cy,cx);\\n mp[ans]++;\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tfor(int y=0;y<h;y++){\\n\\t\\t\\tfor(int x=0;x<w;x++){\\n\\t\\t\\t\\tfor(int dy=-1;dy<=1;dy++){\\n\\t\\t\\t\\t\\tfor(int dx=-1;dx<=1;dx++){\\n\\t\\t\\t\\t\\t\\tif(dy==0&&dx==0)continue;\\n\\t\\t\\t\\t\\t\\tf(y,x,dy,dx);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint maxv=0;\\n\\t\\tstring ans;\\n\\t\\tfor(auto p:mp){\\n if(p.second==1)continue;\\n\\t\\t\\tif(p.first.size()>maxv){\\n\\t\\t\\t\\tmaxv=p.first.size();\\n\\t\\t\\t\\tans=p.first;\\n\\t\\t\\t}else if(p.first.size()==maxv){\\n\\t\\t\\t\\tans=min(ans,p.first);\\n\\t\\t\\t}\\n\\t\\t}\\n if(ans.empty())ans=\\\"0\\\";\\n\\t\\tcout << ans << '\\\\n';\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 29972,\n \"score_of_the_acc\": -0.9636,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1316_6219734\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string>\\n#include <unordered_map>\\nusing namespace std;\\n\\nchar pat[16][32], vis[16][32];\\nint dxy[8][2] = { {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1} };\\nunordered_map<string, int> u;\\n\\nvoid clearmat(char* s, int h, int w, int ww) {\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) s[i * ww + j] = 0;\\n }\\n}\\n\\nint main(void) {\\n int h, w, x, y;\\n string s;\\n while (1) {\\n scanf(\\\"%d %d\\\", &h, &w);\\n if (h == 0) break;\\n for (int i = 0; i < h; i++) {\\n scanf(\\\"%s\\\", pat[i]);\\n }\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n for (int d = 0; d < 8; d++) {\\n x = i, y = j;\\n s = \\\"\\\";\\n while (!vis[x][y]) {\\n vis[x][y] = 1;\\n s += pat[x][y];\\n if (s.length() > 1) {\\n if (u.find(s) == u.end()) u.insert(pair<string, int>(s, 1));\\n else u[s]++;\\n }\\n x += dxy[d][0];\\n y += dxy[d][1];\\n if (x < 0) x += h;\\n if (x >= h) x -= h;\\n if (y < 0) y += w;\\n if (y >= w) y -= w;\\n }\\n clearmat((char*)vis, h, w, 32);\\n }\\n }\\n }\\n\\n s = \\\"\\\";\\n for (auto i : u) {\\n if (i.second > 1) {\\n if (i.first.length() > s.length()) s = i.first;\\n else if (i.first.length() == s.length() && s.compare(i.first) > 0) s = i.first;\\n }\\n }\\n u.clear();\\n if (s.length() < 2) printf(\\\"0\\\\n\\\");\\n else printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 28644,\n \"score_of_the_acc\": -0.9181,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1316_6196047\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(x) x.begin(), x.end()\\n\\nint dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\\nint dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\n\\nint main() {\\n int H, W;\\n while (cin >> H >> W) {\\n if (H == 0 && W == 0) break;\\n vector<string> G(H);\\n rep(i, H) cin >> G[i];\\n string ans = \\\"\\\";\\n rep(x1, H) rep(y1, W) rep(x2, H) rep(y2, W) {\\n if (G[x1][y1] != G[x2][y2]) continue;\\n rep(k1, 8) rep(k2, 8) {\\n if (x1 == x2 && y1 == y2 && k1 == k2) continue;\\n int nx1 = (x1 + dx[k1] + H) % H, ny1 = (y1 + dy[k1] + W) % W;\\n int nx2 = (x2 + dx[k2] + H) % H, ny2 = (y2 + dy[k2] + W) % W;\\n if (G[nx1][ny1] != G[nx2][ny2]) continue;\\n string s = \\\"\\\";\\n s += G[x1][y1];\\n vector<vector<int>> seen1(H, vector<int>(W)), seen2(H, vector<int>(W));\\n seen1[x1][y1] = 1;\\n seen2[x2][y2] = 1;\\n while (G[nx1][ny1] == G[nx2][ny2] && seen1[nx1][ny1] == 0 && seen2[nx2][ny2] == 0) {\\n s += G[nx1][ny1];\\n seen1[nx1][ny1] = 1;\\n seen2[nx2][ny2] = 1;\\n nx1 = (nx1 + dx[k1] + H) % H, ny1 = (ny1 + dy[k1] + W) % W;\\n nx2 = (nx2 + dx[k2] + H) % H, ny2 = (ny2 + dy[k2] + W) % W;\\n }\\n if (ans.size() == 0)\\n ans = s;\\n else if (ans.size() < s.size() || (ans.size() == s.size() && ans > s))\\n ans = s;\\n }\\n }\\n if (ans.size() == 0)\\n cout << 0 << '\\\\n';\\n else\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2450,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1316_6029149\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, a, n) for(int i = a; i < (n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int, int>;\\nconst int INF = 1001001001;\\nconst ll LINF = 1001002003004005006ll;\\n//const int mod = 1000000007;\\n//const int mod = 998244353;\\nconst int di[] = {1,1,0,-1,-1,-1,0,1};\\nconst int dj[] = {0,1,1,1,0,-1,-1,-1};\\n\\nint main()\\n{\\n while(true){\\n int h, w;\\n cin >> h >> w;\\n if(h == 0 && w == 0) return 0;\\n vector<string> s(h);\\n rep(i, 0, h) cin >> s[i];\\n map<string, int> mp;\\n string ans;\\n auto dfs = [&](auto& f, int si, int sj, int i, int j, int dir, string t) -> void{\\n int ni = (i + di[dir] + h)%h;\\n int nj = (j + dj[dir] + w)%w;\\n mp[t]++;\\n if(si == ni && sj == nj) return;\\n else f(f, si, sj, ni, nj, dir, t + s[ni][nj]);\\n };\\n rep(i, 0, h){\\n rep(j, 0, w){\\n rep(dir, 0, 8){\\n string t;\\n t += s[i][j];\\n dfs(dfs, i, j, i, j, dir, t);\\n }\\n }\\n }\\n for(auto i : mp){\\n if(i.second >= 2){\\n if(ans.size() == i.first.size()) ans = min(ans, i.first);\\n else ans = (ans.size() > i.first.size()) ? ans : i.first;\\n }\\n }\\n if(ans.size() <= 1) cout << 0 << endl;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 30216,\n \"score_of_the_acc\": -1.0072,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1316_6029083\",\n \"code_snippet\": \"// #include \\\"atcoder/all\\\"\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nconstexpr ll INF = 1e18;\\nconstexpr ll LLMAX = 9223372036854775807;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\n// constexpr ll mod = 998244353;\\n// 右下左上\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define eol endl\\n// ---------------------------------------------------------------------------\\n\\nbool solve(){\\n int H,W;\\n cin >> H >> W;\\n if(H == 0) return false;\\n vector<string> G(H);\\n for(int i=0; i<H; i++){\\n cin >> G[i];\\n }\\n set<string> mp;\\n int ansL = 0;\\n string ansS = \\\"\\\";\\n for(int i=0; i<H; i++){\\n for(int j=0; j<W; j++){\\n for(int k=0; k<8; k++){\\n int y = i;\\n int x = j;\\n string now = \\\"\\\";\\n now += G[y][x];\\n y += dy[k];\\n x += dx[k];\\n y += H;\\n x += W;\\n y %= H;\\n x %= W;\\n while(y != i || x != j){\\n now += G[y][x];\\n if(mp.count(now)){\\n if(ansL < now.size()){\\n ansL = now.size();\\n ansS = now;\\n }else if(ansL == now.size()){\\n chmin(ansS,now);\\n }\\n }else{\\n mp.emplace(now);\\n }\\n y += dy[k];\\n x += dx[k];\\n y += H;\\n x += W;\\n y %= H;\\n x %= W;\\n }\\n }\\n }\\n }\\n if(ansL <= 1){\\n cout << 0 << endl;\\n }else{\\n cout << ansS << endl;\\n }\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 29788,\n \"score_of_the_acc\": -0.9573,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1316_6029006\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nconst int INF = 1e9;\\nconst ll inf = 1LL<<60;\\n\\nvector<int> dx = {0, 1, 1, 1, 0, -1, -1, -1};\\nvector<int> dy = {1, 1, 0, -1, -1, -1, 0, 1};\\n\\nbool solve() {\\n int h, w; cin >> h >> w;\\n if (h == 0) return false;\\n vector<string> s(h);\\n for (int i=0; i<h; i++) cin >> s[i];\\n vector<string> S;\\n for (int i=0; i<h; i++) for (int j=0; j<w; j++) {\\n for (int k=0; k<8; k++) {\\n string t = \\\"\\\";\\n t += s[i][j];\\n int nx = i, ny = j;\\n while (1) {\\n nx = (nx + dx[k]);\\n ny = (ny + dy[k]);\\n if (nx < 0) nx = h-1;\\n if (ny < 0) ny = w-1;\\n if (nx >= h) nx = 0;\\n if (ny >= w) ny = 0;\\n if (i == nx && j == ny) break;\\n t += s[nx][ny];\\n }\\n if (t.size() == 1) continue;\\n S.push_back(t);\\n }\\n }\\n auto calc = [](string &a, string &b) -> string {\\n string res = \\\"\\\";\\n for (int i=0; i<min(a.size(), b.size()); i++) {\\n if (a[i] != b[i]) break;\\n res += a[i];\\n }\\n return res;\\n };\\n int ma = 2;\\n set<string> P;\\n for (int i=0; i<S.size(); i++) for (int j=i+1; j<S.size(); j++) {\\n string k = calc(S[i], S[j]);\\n if (k.size() < ma) continue;\\n P.insert(k);\\n ma = max(ma, (int)k.size());\\n }\\n for (auto c : P) if (c.size() == ma) {\\n cout << c << endl;\\n return true;\\n }\\n cout << 0 << endl;\\n return true;\\n}\\n\\nint main() {\\n while (solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.0075,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1316_6026945\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <utility>\\n#include <map>\\n\\nusing namespace std;\\n\\nint dx[] = { -1, -1, -1, 0, 0, 0, 1, 1, 1 };\\nint dy[] = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };\\n\\nint main() {\\n\\tint h, w;\\n\\twhile (cin >> h >> w, h || w) {\\n\\t\\tvector<string> vs(h);\\n\\t\\tfor (auto& s : vs) cin >> s;\\n\\t\\tvector<map<string, int> > mps(h * w + 1);\\n\\t\\tint ans_len = 0;\\n\\t\\tfor (int x = 0; x < h; ++x) {\\n\\t\\t\\tfor (int y = 0; y < w; ++y) {\\n\\t\\t\\t\\tfor (int i = 0; i < 9; ++i) {\\n\\t\\t\\t\\t\\tstring tmp { vs[x][y] };\\n\\t\\t\\t\\t\\tint nx = x, ny = y;\\n\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tnx = (nx + dx[i] + h) % h;\\n\\t\\t\\t\\t\\t\\tny = (ny + dy[i] + w) % w;\\n\\t\\t\\t\\t\\t\\tif (x == nx && y == ny) break;\\n\\t\\t\\t\\t\\t\\ttmp += vs[nx][ny];\\n\\t\\t\\t\\t\\t\\t++mps[tmp.length()][tmp];\\n\\t\\t\\t\\t\\t\\tif (mps[tmp.length()][tmp] > 1)\\n\\t\\t\\t\\t\\t\\t\\tans_len = max(ans_len, (int)tmp.length());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans_len) {\\n\\t\\t\\tstring ans(ans_len, 'Z');\\n\\t\\t\\tfor (auto& [s, count] : mps[ans_len])\\n\\t\\t\\t\\tif (count > 1 && ans > s) ans = s;\\n\\t\\t\\tcout << ans << endl;\\n\\t\\t} else cout << 0 << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 29704,\n \"score_of_the_acc\": -0.9192,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1316_6025991\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\n\\tint di[] = {-1, -1, -1, 0, 0, +1, +1, +1};\\n\\tint dj[] = {-1, 0, +1, -1, +1, -1, 0, +1};\\n\\t\\n\\twhile(true) {\\n\\t\\tint h,w; cin >> h >> w; if(h == 0) break;\\n\\t\\tvector< string > s(h);\\n\\t\\trep(i,h) cin >> s[i];\\n\\n\\t\\tmap<string,int> mp;\\n\\t\\trep(d,8) {\\n\\t\\t\\tvector<vector<bool>> used(h, vector<bool> (w, false));\\n\\t\\t\\trep(i,h)rep(j,w) {\\n\\t\\t\\t\\tif(used[i][j]) continue;\\n\\t\\t\\t\\tint ci = i, cj = j;\\n\\t\\t\\t\\tstring t = \\\"\\\";\\n\\t\\t\\t\\twhile(!used[ci][cj]) {\\n\\t\\t\\t\\t\\tused[ci][cj] = true;\\n\\t\\t\\t\\t\\tt += s[ci][cj];\\n\\t\\t\\t\\t\\tci = (ci + di[d] + h) % h;\\n\\t\\t\\t\\t\\tcj = (cj + dj[d] + w) % w;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tint N = t.size();\\n\\t\\t\\t\\tt += t;\\n\\t\\t\\t\\trep(k,N)for(int c = 2; c <= N; c++)\\n\\t\\t\\t\\t\\tmp[t.substr(k, c)]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tstring ans = \\\"\\\";\\n\\t\\tfor(auto e : mp) if(e.second >= 2) {\\n\\t\\t\\tstring t = e.first;\\n\\t\\t\\tif(t.size() > ans.size()) ans = t;\\n\\t\\t\\telse if(t.size() == ans.size()) ans = min(ans, t);\\n\\t\\t}\\n\\t\\tcout << (ans.size() == 0 ? \\\"0\\\" : ans) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 29936,\n \"score_of_the_acc\": -0.9712,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1316_5997941\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\n\\nvll dx = { 1,-1,0 };\\nvll dy = { 1,-1,0 };\\nint main() {\\n while (1) {\\n ll H, W;\\n cin >> H >> W;\\n if (H == 0)return 0;\\n vector<vector<char>> V(H, vector<char>(W));\\n rep(h, H) {\\n string S;\\n cin >> S;\\n rep(w, W)V[h][w] = S[w];\\n }\\n map<string, ll> M;\\n rep(h, H) {\\n rep(w, W) {\\n rep(i, 8) {\\n ll x = h; ll y = w;\\n string K = \\\"\\\";\\n while (1) {\\n K += V[x][y];\\n x += dx[i / 3]+H;\\n y += dy[i % 3]+W;\\n x %= H; y %= W;\\n M[K]++;\\n if (x == h && y == w) {\\n \\n break;\\n }\\n }\\n }\\n }\\n }\\n ll m = 0;\\n string an = \\\"0\\\";\\n for (auto p : M) {\\n if (p.second > 1) {\\n if (p.first.size() > an.size()) {\\n an = p.first;\\n }\\n else if (p.first.size() == an.size()) {\\n if (p.first < an) {\\n an = p.first;\\n }\\n }\\n }\\n }\\n cout << an << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 30056,\n \"score_of_the_acc\": -0.9709,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1316_5879279\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nconst int di[8] = {-1, -1, 0, 1, 1, 1, 0, -1};\\nconst int dj[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\n\\nbool solve() {\\n int N, M;\\n cin >> N >> M;\\n if(N == 0) return false;\\n vector<string> G(N);\\n REP(i, N) cin >> G[i];\\n\\n map<string, int> cnt;\\n REP(si, N) REP(sj, M) {\\n set<string> se;\\n REP(dir, 8) {\\n string s = \\\"\\\";\\n int ni = si, nj = sj;\\n while(1) {\\n s += G[ni][nj];\\n se.emplace(s);\\n ni = (ni + di[dir] + N) % N;\\n nj = (nj + dj[dir] + M) % M;\\n if(ni == si and nj == sj) break;\\n }\\n }\\n for(auto s : se) cnt[s] += 1;\\n }\\n string ans = \\\"\\\";\\n for(const auto& [s, num] : cnt) {\\n if(num <= 1) continue;\\n if(ans.size() < s.size()) ans = s;\\n else if(ans > s) ans = s;\\n }\\n\\n if((int)ans.size() <= 1) cout << \\\"0\\\\n\\\";\\n else cout << ans << \\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 30216,\n \"score_of_the_acc\": -1.0556,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1316_5876556\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing P = pair<int,int>;\\n\\nvoid solve(int H, int W){\\n vector<string> vec(H);\\n for(int i=0; i<H; i++){\\n cin >> vec[i];\\n }\\n set<string> S;\\n string ans = \\\"\\\";\\n for(int i=0; i<H; i++){\\n for(int j=0; j<W; j++){\\n for(int a=-1; a<=1; a++){\\n for(int b=-1; b<=1; b++){\\n if(a == 0 && b == 0){\\n continue;\\n }\\n string add = \\\"\\\";\\n set<P> p;\\n int x = i;\\n int y = j;\\n while(true){\\n if(p.count(P(x,y))){\\n break;\\n }\\n add += vec[x][y];\\n p.insert(P(x,y));\\n x = (x+a+H)%H;\\n y = (y+b+W)%W; \\n if(S.count(add)){\\n if(add.size() > ans.size()){\\n ans = add;\\n }\\n if(add.size() == ans.size() && add < ans){\\n ans = add;\\n }\\n }\\n S.insert(add);\\n }\\n }\\n }\\n }\\n }\\n if(ans.size() <= 1){\\n cout << 0 << endl;\\n }\\n else{\\n cout << ans << endl;\\n }\\n}\\n\\nint main(){\\n while(true){\\n int H, W;\\n cin >> H >> W;\\n if(H == 0){\\n break;\\n }\\n solve(H,W);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 29904,\n \"score_of_the_acc\": -1.0405,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":766,"cells":{"group_id":{"kind":"string","value":"aoj_1314_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nMatrix Calculator\nDr. Jimbo, an applied mathematician, needs to calculate matrices all day for solving his own problems. In his laboratory, he uses an excellent application program for manipulating matrix expressions, however, he cannot use it outside his laboratory because the software consumes much of resources. He wants to manipulate matrices outside, so he needs a small program similar to the excellent application for his handheld computer.\nYour job is to provide him a program that computes expressions of matrices.\nExpressions of matrices are described in a simple language. Its syntax is shown in Table J.1. Note that even a space and a newline have meaningful roles in the syntax.\nThe start symbol of this syntax is program that is defined as a sequence of assignments in Table J.1. Each assignment has a variable on the left hand side of an equal symbol (\"\n=\n\") and an expression of matrices on the right hand side followed by a period and a newline (\nNL\n). It denotes an assignment of the value of the expression to the variable. The variable (var in Table J.1) is indicated by an uppercase Roman letter. The value of the expression (\nexpr\n) is a matrix or a scalar, whose elements are integers. Here, a scalar integer and a 1 × 1 matrix whose only element is the same integer can be used interchangeably.\nAn expression is one or more terms connected by \"\n+\n\" or \"\n-\n\" symbols. A term is one or more factors connected by \"\n*\n\" symbol. These operators (\"\n+\n\", \"\n-\n\", \"\n*\n\") are left associative.\nA factor is either a primary expression (primary) or a \"\n-\n\" symbol followed by a factor. This unary operator \"\n-\n\" is right associative.\nThe meaning of operators are the same as those in the ordinary arithmetic on matrices: Denoting matrices by\nA\nand\nB\n,\nA\n+\nB\n,\nA\n-\nB\n,\nA\n*\nB\n, and -A are defined as the matrix sum, difference, product, and negation. The sizes of\nA\nand\nB\nshould be the same for addition and subtraction. The number of columns of\nA\nand the number of rows of\nB\nshould be the same for multiplication.\nNote that all the operators +, -, * and unary - represent computations of addition, subtraction, multiplication and negation modulo\nM\n= 2\n15\n= 32768, respectively. Thus all the values are nonnegative integers between 0 and 32767, inclusive. For example, the result of an expression 2 - 3 should be 32767, instead of -1.\ninum\nis a non-negative decimal integer less than\nM\n.\nvar\nrepresents the matrix that is assigned to the variable var in the most recent preceding assignment statement of the same variable.\nmatrix\nrepresents a mathematical matrix similar to a 2-dimensional array whose elements are integers. It is denoted by a\nrow-seq\nwith a pair of enclosing square brackets.\nrow-seq\nrepresents a sequence of rows, adjacent two of which are separated by a semicolon. row represents a sequence of expressions, adjacent two of which are separated by a space character.\nFor example,\n[1 2 3;4 5 6]\nrepresents a matrix\n. The first row has three integers separated b\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1314_10908049","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MOD = 32768;\ntypedef vector<int> List;\ntypedef vector<vector<int>> Matrix;\nMatrix variables[26];\n\nMatrix parseExpr(const char*& p);\n\nvoid skip(const char *&p)\n{\n while ( p && *p == ' ' ) p++;\n}\nbool consume(const char *&p, char c)\n{\n if ( *p && *p == c )\n {\n p++;\n return true;\n }\n return false;\n}\nMatrix operator +(const Matrix &A, const Matrix &B)\n{\n int H = A.size(), W = A[0].size();\n Matrix ret(H, List(W));\n for ( int y = 0 ; y < H ; y++ )\n for ( int x = 0 ; x < W ; x++ )\n ret[y][x] = (A[y][x] + B[y][x]) % MOD;\n return ret;\n}\nMatrix operator *(const Matrix &A, const Matrix &B)\n{\n int Ha = A.size(), Wa = A[0].size();\n int Hb = B.size(), Wb = B[0].size();\n\n if ( Ha == 1 && Wa == 1 )\n {\n Matrix ret(Hb, List(Wb));\n for ( int y = 0 ; y < Hb ; y++ )\n for ( int x = 0 ; x < Wb ; x++ )\n ret[y][x] = (A[0][0] * B[y][x]) % MOD;\n return ret;\n }\n if ( Hb == 1 && Wb == 1 )\n {\n Matrix ret(Ha, List(Wa));\n for ( int y = 0 ; y < Ha ; y++ )\n for ( int x = 0 ; x < Wa ; x++ )\n ret[y][x] = (A[y][x] * B[0][0]) % MOD;\n return ret;\n }\n\n Matrix ret(Ha, List(Wb));\n for ( int y = 0 ; y < Ha ; y++ )\n for ( int x = 0 ; x < Wb ; x++ )\n {\n ret[y][x] = 0;\n for ( int t = 0 ; t < Wa ; t ++ )\n ret[y][x] = (ret[y][x] + A[y][t] * B[t][x]) % MOD;\n }\n return ret;\n}\nMatrix operator -(const Matrix &A, const Matrix &B)\n{\n int H = A.size(), W = A[0].size();\n Matrix ret(H, List(W));\n for ( int y = 0 ; y < H ; y++ )\n for ( int x = 0 ; x < W ; x++ )\n ret[y][x] = (A[y][x] - B[y][x]) % MOD;\n return ret;\n}\nMatrix operator -(const Matrix &A)\n{\n int H = A.size(), W = A[0].size();\n Matrix ret(H, List(W));\n for ( int y = 0 ; y < H ; y++ )\n for ( int x = 0 ; x < W ; x++ )\n ret[y][x] = (-A[y][x] + MOD) % MOD;\n return ret;\n}\nMatrix parseInum(const char*& p)\n{\n int val = 0;\n for ( ; isdigit(*p); p++)\n {\n val = val * 10 + (*p - '0');\n val %= MOD;\n }\n return Matrix(1, List(1, val));\n}\nMatrix parseRow(const char*& p)\n{\n Matrix ret = parseExpr(p);\n while ( *p )\n {\n skip(p);\n if ( *p == ']' || *p == ';' ) break;\n auto nxt = parseExpr(p);\n for ( int y = 0 ; y < ret.size() ; y ++ )\n for ( auto n: nxt[y] )\n ret[y].push_back(n);\n }\n return ret;\n}\nMatrix parseRowSeq(const char*& p)\n{\n Matrix ret = parseRow(p);\n while ( *p )\n {\n skip(p);\n if ( *p == ']') break;\n consume(p, ';');\n auto nxt = parseRow(p);\n for (auto &row: nxt) ret.emplace_back(row);\n }\n return ret;\n}\nMatrix Transpose(const Matrix &A)\n{\n int H = A.size(), W = A[0].size();\n Matrix ret(W, List(H));\n for ( int y = 0 ; y < H ; y++ )\n for ( int x = 0 ; x < W ; x++ )\n ret[x][y] = A[y][x];\n return ret;\n}\nMatrix parsePrimary(const char*& p) {\n Matrix ret;\n skip(p);\n if (isdigit(*p))\n ret = parseInum(p);\n else if (isupper(*p))\n ret = variables[*p++ - 'A'];\n else if ( consume(p, '[') )\n ret = parseRowSeq(p), consume(p, ']');\n else if ( consume(p, '(') )\n ret = parseExpr(p), consume(p, ')');\n\n while ( true )\n {\n if (consume(p, '(') ) // INDEXED_PRIMARY\n {\n auto A = parseExpr(p);\n consume(p, ',');\n auto B = parseExpr(p);\n consume(p, ')');\n\n Matrix nxt(A[0].size(), List(B[0].size()));\n for ( int y = 0 ; y < A[0].size() ; y++ )\n for ( int x = 0 ; x < B[0].size() ; x++ )\n nxt[y][x] = ret[ A[0][y] - 1 ][ B[0][x] - 1 ];\n swap(ret, nxt);\n }\n else if ( *p == '\\'') // TRANSPOSED_PRIMARY\n {\n bool isTrans = false;\n while ( consume(p, '\\'') ) isTrans = !isTrans;\n if ( isTrans ) ret = Transpose(ret);\n }\n else break;\n }\n return ret;\n}\n\nMatrix parseFactor(const char*& p) {\n bool neg = false;\n while ( consume(p, '-') ) neg = !neg;\n auto ret = parsePrimary(p);\n return neg ? -ret : ret;\n}\n\nMatrix parseTerm(const char*& p) {\n auto ret = parseFactor(p);\n while (consume(p, '*') ) ret = ret * parseFactor(p);\n return ret;\n}\n\nMatrix parseExpr(const char*& p) {\n auto ret = parseTerm(p);\n while (true) {\n if ( consume(p, '+') ) ret = ret + parseTerm(p);\n else if ( consume(p, '-') ) ret = ret - parseTerm(p);\n else break;\n }\n return ret;\n}\nvoid print(const Matrix &m)\n{\n int H = m.size();\n int W = m[0].size();\n for ( int y = 0 ; y < H ; y++ )\n for ( int x = 0 ; x < W ; x++ )\n cout << ( m[y][x] % MOD + MOD ) % MOD << \" \\n\"[x+1 == W];\n}\nvoid sol(int N) {\n for ( int i = 0 ; i < 26 ; i ++ ) variables[i].clear();\n\n string s;\n for (int i = 0; i < N; i++) {\n getline(cin, s);\n int varIndex = s[0] - 'A';\n while ( !s.empty() && ( s.back() == ' ' || s.back() == '.' ) ) s.pop_back();\n const char* p = s.c_str() + s.find('=') + 1;\n variables[varIndex] = parseExpr(p);\n print(variables[varIndex]);\n }\n}\n\nint main() {\n#ifdef AJAVA_DEBUG\nfreopen(\"output.txt\", \"wt\", stdout);\n#endif\n cin.tie(nullptr)->sync_with_stdio(false);\n int N;\n for ( int i = 0 ; cin >> N && N != 0 ; i ++ )\n {\n cin.ignore();\n sol(N);\n cout << \"-----\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3548,"score_of_the_acc":-0.1001,"final_rank":3},{"submission_id":"aoj_1314_9417335","code_snippet":"#line 1 \"main.cpp\"\n#include<bits/stdc++.h>\n//#pragma GCC target(\"avx,avx2\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n#ifdef LOCAL\n#include <debug.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pll = pair<ll,ll>;\nusing pii = pair<int,int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\nusing vul = vector<ull>;\nusing vpii = vector<pii>;\nusing vvpii = vector<vpii>;\nusing vpll = vector<pll>;\nusing vs = vector<string>;\ntemplate<class T> using pq = priority_queue<T,vector<T>, greater<T>>;\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)\n#define rep2(i, n) for (ll i = 0; i < (n); ++i)\n#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)\n#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)\n#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)\n#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n#define all1(i) begin(i) , end(i)\n#define all2(i,a) begin(i) , begin(i) + a\n#define all3(i,a,b) begin(i) + a , begin(i) + b\n#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\ntemplate<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }\ntemplate<class T> auto min(const T& a){return *min_element(all(a));}\ntemplate<class T> auto max(const T& a){return *max_element(all(a));}\ntemplate<class... Ts> void in(Ts&... t);\n#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)\n#define VEC(type, name, size) vector<type> name(size); in(name)\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\nll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}\nll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nbool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}\nvoid Yes() {cout << \"Yes\\n\";return;}\nvoid No() {cout << \"No\\n\";return;}\nvoid YES() {cout << \"YES\\n\";return;}\nvoid NO() {cout << \"NO\\n\";return;}\ntemplate <typename T>\nT floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}\ntemplate <typename T>\nT ceil(T x, T y) {return floor(x + y - 1, y);}\ntemplate <typename T>\nT bmod(T x, T y) {return x - y * floor(x, y);}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}\nnamespace IO{\n#define VOID(a) decltype(void(a))\nstruct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;\ntemplate<int I> struct P : P<I-1>{};\ntemplate<> struct P<0>{};\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} \n#undef VOID\n}\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }\n#undef unpack\nconstexpr long double PI = 3.141592653589793238462643383279L;\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};\n\n//constexpr int mod = 998244353;\nconstexpr int mod = 1000000007;\ntemplate <typename T> \nstruct Edge {\n\tint from, to;\n\tT cost;\n\tEdge() = default;\n\tEdge(int _to, T _cost) : from(-1), to(_to), cost(_cost) {}\n\tEdge(int _from, int _to, T _cost) : from(_from), to(_to), cost(_cost) {}\n\tbool operator < (const Edge &a) const { return cost < a.cost; }\n\tbool operator > (const Edge &a) const { return cost > a.cost; }\n Edge &operator = (const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, Edge &edge) { return os << edge.to; }\n};\ntemplate <typename T>\nusing Edges = vector<Edge<T>>;\ntemplate <typename T>\nusing Wgraph = vector<Edges<T>>;\nusing Ugraph = vector<vector<int>>;\nUgraph uinput(int N, int M = -1, bool is_directed = false, int origin = 1) {\n Ugraph g(N);\n if (M == -1) M = N - 1;\n while(M--) {\n int a,b;\n cin >> a >> b;\n a -= origin, b -= origin;\n g[a].push_back(b);\n if(!is_directed) g[b].push_back(a);\n }\n return g;\n}\ntemplate <typename T>\nWgraph<T> winput(int N, int M = -1, bool is_directed = false,int origin = 1) {\n Wgraph<T> g(N);\n if (M == -1) M = N - 1;\n while(M--) {\n int a,b;\n T c;\n cin >> a >> b >> c;\n a -= origin, b -= origin;\n g[a].emplace_back(b,c);\n if(!is_directed) g[b].emplace_back(a,c);\n }\n return g;\n}\n#line 2 \"library/modint/barrett-reduction.hpp\"\nstruct Barrett {\n using u32 = unsigned int;\n using i64 = long long;\n using u64 = unsigned long long;\n u32 m;\n u64 im;\n Barrett() : m(), im() {}\n Barrett(int n) : m(n), im(u64(-1) / m + 1) {}\n constexpr inline i64 quo(u64 n) {\n u64 x = u64((__uint128_t(n) * im) >> 64);\n u32 r = n - x * m;\n return m <= r ? x - 1 : x;\n }\n constexpr inline i64 rem(u64 n) {\n u64 x = u64((__uint128_t(n) * im) >> 64);\n u32 r = n - x * m;\n return m <= r ? r + m : r;\n }\n constexpr inline pair<i64, int> quorem(u64 n) {\n u64 x = u64((__uint128_t(n) * im) >> 64);\n u32 r = n - x * m;\n if (m <= r) return {x - 1, r + m};\n return {x, r};\n }\n constexpr inline i64 pow(u64 n, i64 p) {\n u32 a = rem(n), r = m == 1 ? 0 : 1;\n while (p) {\n if (p & 1) r = rem(u64(r) * a);\n a = rem(u64(a) * a);\n p >>= 1;\n }\n return r;\n }\n};\n#line 3 \"library/modint/ArbitaryModint.hpp\"\nstruct ArbitraryModint {\n int x;\n ArbitraryModint():x(0) {}\n ArbitraryModint(int64_t y) {\n int z = y % get_mod();\n if(z < 0) z += get_mod();\n x = z;\n }\n ArbitraryModint &operator+=(const ArbitraryModint &p) {\n if((x += p.x) >= get_mod()) x -= get_mod();\n return *this;\n }\n ArbitraryModint &operator-=(const ArbitraryModint &p) {\n if((x += get_mod() - p.x) >= get_mod()) x -= get_mod();\n return *this;\n }\n ArbitraryModint &operator*=(const ArbitraryModint &p) {\n x = rem((unsigned long long)x * p.x);\n return *this;\n }\n ArbitraryModint &operator/=(const ArbitraryModint &p) {\n *this *= p.inverse();\n return *this;\n }\n ArbitraryModint operator-() const {return ArbitraryModint(-x);};\n ArbitraryModint operator+(const ArbitraryModint &p) const{\n return ArbitraryModint(*this) += p;\n }\n ArbitraryModint operator-(const ArbitraryModint &p) const{\n return ArbitraryModint(*this) -= p;\n }\n ArbitraryModint operator*(const ArbitraryModint &p) const{\n return ArbitraryModint(*this) *= p;\n }\n ArbitraryModint operator/(const ArbitraryModint &p) const {\n return ArbitraryModint(*this) /= p;\n }\n bool operator==(const ArbitraryModint &p) {return x == p.x;}\n bool operator!=(const ArbitraryModint &p) {return x != p.x;}\n ArbitraryModint inverse() const {\n int a = x,b = get_mod(),u = 1,v = 0,t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b,b);\n swap(u -= t * v,v);\n }\n return ArbitraryModint(u);\n }\n ArbitraryModint pow(int64_t n) const {\n ArbitraryModint ret(1),mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os,const ArbitraryModint &p) {\n return os << p.x;\n }\n friend istream &operator>>(istream &is,ArbitraryModint &a) {\n int64_t t;\n is >> t;\n a = ArbitraryModint(t);\n return (is);\n }\n int get() const {return x;}\n inline unsigned int rem(unsigned long long p) {return barrett().rem(p);};\n static inline Barrett &barrett() {\n static Barrett b;\n return b;\n }\n static inline int &get_mod() {\n static int mod = 0;\n return mod;\n }\n static void set_mod(int md) {\n assert(0 < md && md <= (1LL << 30) - 1);\n get_mod() = md;\n barrett() = Barrett(md);\n }\n};\n#line 146 \"main.cpp\"\nusing mint = ArbitraryModint;\nusing vm = vector<mint>;\nusing vvm = vector<vm>;\nusing vvvm = vector<vvm>;\n#line 2 \"library/matrix/matrix.hpp\"\ntemplate <class T>\nstruct Matrix {\n vector<vector<T>> A;\n Matrix() = default;\n Matrix(int n, int m) : A(n, vector<T>(m, T())) {}\n Matrix(int n) : A(n, vector<T>(n, T())){};\n int H() const { return A.size(); }\n int W() const { return A[0].size(); }\n int size() const { return A.size(); }\n inline const vector<T> &operator[](int k) const { return A[k]; }\n inline vector<T> &operator[](int k) { return A[k]; }\n static Matrix I(int n) {\n Matrix mat(n);\n for (int i = 0; i < n; i++) mat[i][i] = 1;\n return (mat);\n }\n Matrix &operator+=(const Matrix &B) {\n int n = H(), m = W();\n assert(n == B.H() && m == B.W());\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\n return (*this);\n }\n Matrix &operator-=(const Matrix &B) {\n int n = H(), m = W();\n assert(n == B.H() && m == B.W());\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\n return (*this);\n }\n Matrix &operator*=(const Matrix &B) {\n int n = H(), m = B.W(), p = W();\n assert(p == B.H());\n vector<vector<T>> C(n, vector<T>(m, T{}));\n for (int i = 0; i < n; i++) {\n for (int k = 0; k < p; k++) {\n if((*this)[i][k] == 0) continue;\n for (int j = 0; j < m; j++) C[i][j] += (*this)[i][k] * B[k][j];\n }\n }\n A.swap(C);\n return (*this);\n }\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(H());\n while (k > 0) {\n if (k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\n bool operator==(const Matrix &B) const {\n assert(H() == B.H() && W() == B.W());\n for (int i = 0; i < H(); i++) for (int j = 0; j < W(); j++) {\n if (A[i][j] != B[i][j]) return false;\n }\n return true;\n }\n bool operator!=(const Matrix &B) const {\n assert(H() == B.H() && W() == B.W());\n for (int i = 0; i < H(); i++) for (int j = 0; j < W(); j++) {\n if (A[i][j] != B[i][j]) return true;\n }\n return false;\n }\n friend ostream &operator<<(ostream &os, const Matrix &p) {\n int n = p.H(), m = p.W();\n for (int i = 0; i < n; i++) {\n os << (i ? \" \" : \"\") << \"[\";\n for (int j = 0; j < m; j++) {\n os << p[i][j] << (j + 1 == m ? \"]\\n\" : \",\");\n }\n }\n return (os);\n }\n T determinant() const {\n Matrix B(*this);\n assert(H() == W());\n T ret = 1;\n for (int i = 0; i < H(); i++) {\n int idx = -1;\n for (int j = i; j < W(); j++) {\n if (B[j][i] != 0) {\n idx = j;\n break;\n }\n }\n if (idx == -1) return 0;\n if (i != idx) {\n ret *= T(-1);\n swap(B[i], B[idx]);\n }\n ret *= B[i][i];\n T inv = T(1) / B[i][i];\n for (int j = 0; j < W(); j++) {\n B[i][j] *= inv;\n }\n for (int j = i + 1; j < H(); j++) {\n T a = B[j][i];\n if (a == 0) continue;\n for (int k = i; k < W(); k++) {\n B[j][k] -= B[i][k] * a;\n }\n }\n }\n return ret;\n }\n};\n#line 151 \"main.cpp\"\nusing T = Matrix<mint>;\nvector<Matrix<mint>> VAR(26);\nT term(string &s,int &id);\nT expression(string &s,int &id);\nT factor(string &s,int &id);\nT primary(string &s,int &id);\nT matrix(string &s,int &id);\nT row_seq(string &s,int &id);\nT row(string &s,int &id);\nmint number(string &s,int &id) {\n mint ret = 0;\n while(isdigit(s[id])) {\n ret *= 10;\n ret += s[id++] - '0';\n }\n return ret;\n}\nT row(string &s,int &id) {\n T ret = expression(s,id);\n //debug(ret,id,s[id],s);\n while(1) {\n if(s[id] == ' ') {\n id++;\n T ret2 = expression(s,id);\n assert(ret.H() == ret2.H());\n T ret3(ret.H(),ret.W() + ret2.W());\n rep(i,ret.H()) {\n rep(j,ret.W()) {\n ret3[i][j] = ret[i][j];\n }\n }\n rep(i,ret2.H()) {\n rep(j,ret2.W()) {\n ret3[i][j + ret.W()] = ret2[i][j];\n }\n }\n swap(ret,ret3);\n }\n else break;\n }\n return ret;\n}\nT row_seq(string &s,int &id) {\n T ret = row(s,id);\n while(1) {\n if(s[id] == ';') {\n id++;\n T ret2 = row(s,id);\n assert(ret.W() == ret2.W());\n T ret3(ret.H() + ret2.H(),ret.W());\n rep(i,ret.H()) {\n rep(j,ret.W()) ret3[i][j] = ret[i][j];\n }\n rep(i,ret2.H()) {\n rep(j,ret2.W()) ret3[i+ret.H()][j] = ret2[i][j];\n }\n swap(ret,ret3);\n }\n else break;\n }\n return ret;\n}\nT matrix(string &s,int &id) {\n assert(s[id] == '[');\n id++;\n T ret = row_seq(s,id);\n //debug(ret);\n assert(s[id] == ']');\n id++;\n return ret;\n}\nT primary(string &s,int &id) {\n T ret;\n\tif(isdigit(s[id])) {\n mint res = number(s,id);\n ret = Matrix<mint>(1);\n ret[0][0] = res;\n }\n else if('A' <= s[id] && s[id] <= 'Z') {\n ret = VAR[s[id] - 'A'];\n id++;\n }\n else if(s[id] == '[') {\n ret = matrix(s,id);\n }\n else if(s[id] == '(') {\n id++;\n ret = expression(s,id);\n assert(s[id] == ')');\n id++;\n }\n while(1) {\n if(s[id] == '(') {\n id++;\n T ret2 = expression(s,id);\n assert(s[id] == ',');\n id++;\n T ret3 = expression(s,id);\n assert(s[id] == ')');\n id++;\n T ret4(ret2.W(),ret3.W());\n rep(i,ret2.W()) {\n rep(j,ret3.W()) {\n ret4[i][j] = ret[ret2[0][i].get() - 1][ret3[0][j].get() - 1];\n }\n }\n swap(ret,ret4);\n }\n else if(s[id] == '\\'') {\n id++;\n T ret2(ret.W(),ret.H());\n rep(i,ret.H()) {\n rep(j,ret.W()) {\n ret2[j][i] = ret[i][j];\n }\n }\n swap(ret,ret2);\n }\n else break;\n }\n return ret;\n}\nT factor(string &s,int &id) {\n\tint co = 1;\n\tT ret;\n\tif(s[id] == '-') {\n\t\tco = -1;\n\t\tid++;\n\t\tret = factor(s,id);\n\t}\n\telse ret = primary(s,id);\n\trep(i,ret.H()) {\n\t\trep(j,ret.W()) {\n\t\t\tret[i][j] *= co;\n\t\t}\n\t}\n\treturn ret;\n}\nT term(string &s,int &id) {\n T ret = factor(s,id);\n while(1) {\n if(s[id] == '*') {\n id++;\n T ret2 = factor(s,id);\n //debug(ret,ret2);\n if(ret.H() == ret.W() && ret.H() == 1) {\n rep(i,ret2.H()) {\n rep(j,ret2.W()) {\n ret2[i][j] *= ret[0][0];\n }\n }\n swap(ret,ret2);\n }\n else if(ret2.H() == ret2.W() && ret2.H() == 1) {\n rep(i,ret.H()) {\n rep(j,ret.W()) {\n ret[i][j] *= ret2[0][0];\n }\n }\n }\n else ret *= ret2;\n }\n else break;\n }\n return ret;\n}\nT expression(string &s,int &id) {\n T ret = term(s,id);\n\twhile(1) {\n\t\tif(s[id] == '+') {\n\t\t\tid++;\n\t\t\tT ret2 = term(s,id);\n\t\t\tret += ret2;\n\t\t}\n\t\telse if(s[id] == '-') {\n\t\t\tid++;\n\t\t\tT ret2 = term(s,id);\n\t\t\tret -= ret2;\n\t\t}\n\t\telse break;\n\t}\n return ret;\n}\n\nint main() {\n\tmint::set_mod(32768);\n string s,t;\n\twhile(1) {\n\t\tgetline(cin,t);\n int x = stoi(t);\n\t\tif(x == 0) break;\n\t\twhile(x--) {\n\t\t\tgetline(cin,s);\n\t\t\tint p = s[0] - 'A';\n\t\t\tint id = 2;\n T ret = expression(s,id);\n VAR[p] = ret;\n rep(i,ret.H()) {\n rep(j,ret.W()) {\n cout << ret[i][j] << \" \\n\"[j == ret.W() - 1];\n }\n }\n\t\t}\n cout << \"-----\\n\";\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3760,"score_of_the_acc":-0.1329,"final_rank":11},{"submission_id":"aoj_1314_8458258","code_snippet":"#include <bits/stdc++.h>\n\nstruct Matrix {\n static constexpr int MOD = 32768;\n std::vector<std::vector<int>> data;\n\n Matrix() {}\n explicit Matrix(int value): data(1, std::vector<int>(1, value)) {}\n explicit Matrix(int n, int m): data(n, std::vector<int>(m)) {}\n\n std::pair<int, int> size() const {\n return {data.size(), data.front().size()};\n }\n\n friend std::ostream& operator<<(std::ostream& os, const Matrix& mat) {\n auto [n, m] = mat.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n os << mat.data[i][j];\n if (j + 1 != m) {\n os << ' ';\n }\n }\n if (i + 1 != n) {\n os << '\\n';\n }\n }\n return os;\n }\n\n bool is_scalar() const {\n return data.size() == 1 && data.front().size() == 1;\n }\n\n friend Matrix operator+(const Matrix& lhs, const Matrix& rhs) {\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\n if (lhs.is_scalar()) {\n return lhs.data.front().front() + rhs;\n } else {\n return rhs.data.front().front() + lhs;\n }\n }\n\n auto [n, m] = lhs.size();\n\n Matrix res(lhs);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] += rhs.data[i][j];\n res.data[i][j] %= MOD;\n }\n }\n\n return res;\n }\n\n friend Matrix operator-(const Matrix& lhs, const Matrix& rhs) {\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\n if (lhs.is_scalar()) {\n return lhs.data.front().front() - rhs;\n } else {\n return rhs.data.front().front() - lhs;\n }\n }\n\n auto [n, m] = lhs.size();\n\n Matrix res(lhs);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] -= rhs.data[i][j];\n res.data[i][j] = (res.data[i][j] + MOD) % MOD;\n }\n }\n\n return res;\n }\n\n friend Matrix operator*(const Matrix& lhs, const Matrix& rhs) {\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\n if (lhs.is_scalar()) {\n return lhs.data.front().front() * rhs;\n } else {\n return rhs.data.front().front() * lhs;\n }\n }\n\n auto [n, m] = lhs.size();\n int l = rhs.data.front().size();\n\n Matrix res(n, l);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n for (int k = 0; k < l; k++) {\n res.data[i][k] += lhs.data[i][j] * rhs.data[j][k];\n res.data[i][k] %= MOD;\n }\n }\n }\n\n return res;\n }\n\n friend Matrix operator+(int value, const Matrix& rhs) {\n auto [n, m] = rhs.size();\n auto res(rhs);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] += value;\n res.data[i][j] %= MOD;\n }\n }\n return res;\n }\n\n friend Matrix operator-(int value, const Matrix& rhs) {\n auto [n, m] = rhs.size();\n auto res(rhs);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] -= value;\n res.data[i][j] = (res.data[i][j] + MOD) % MOD;\n }\n }\n return res;\n }\n\n friend Matrix operator*(int value, const Matrix& rhs) {\n auto [n, m] = rhs.size();\n auto res(rhs);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] *= value;\n res.data[i][j] %= MOD;\n }\n }\n return res;\n }\n\n Matrix operator-() {\n auto [n, m] = size();\n auto res(*this);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res.data[i][j] = (MOD - res.data[i][j]) % MOD;\n }\n }\n return res;\n }\n\n Matrix transpose() {\n auto [n, m] = size();\n Matrix mat(m, n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n mat.data[j][i] = data[i][j];\n }\n }\n return mat;\n }\n\n Matrix operator()(const Matrix& lhs, const Matrix& rhs) {\n auto [n, m] = size();\n auto [n1, m1] = lhs.size();\n auto [n2, m2] = rhs.size();\n Matrix mat(m1, m2);\n\n for (int i = 0; i < n1; i++) {\n for (int j = 0; j < m1; j++) {}\n }\n\n for (int i = 0; i < n2; i++) {\n for (int j = 0; j < m2; j++) {}\n }\n\n for (int i = 0; i < m1; i++) {\n for (int j = 0; j < m2; j++) {\n mat.data[i][j] = data[lhs.data[0][i] - 1][rhs.data[0][j] - 1];\n }\n }\n\n return mat;\n }\n\n Matrix add_row(const Matrix& mat) {\n auto [n1, m1] = size();\n auto [n2, m2] = mat.size();\n\n Matrix res(n1 + n2, m1);\n for (int i = 0; i < n1; i++) {\n for (int j = 0; j < m1; j++) {\n res.data[i][j] = data[i][j];\n }\n }\n\n for (int i = 0; i < n2; i++) {\n for (int j = 0; j < m1; j++) {\n res.data[i + n1][j] = mat.data[i][j];\n }\n }\n\n return res;\n }\n\n Matrix add_column(const Matrix& mat) {\n auto [n1, m1] = size();\n auto [n2, m2] = mat.size();\n Matrix res(n1, m1 + m2);\n for (int i = 0; i < n1; i++) {\n for (int j = 0; j < m1; j++) {\n res.data[i][j] = data[i][j];\n }\n }\n\n for (int i = 0; i < n2; i++) {\n for (int j = 0; j < m2; j++) {\n res.data[i][j + m1] = mat.data[i][j];\n }\n }\n\n return res;\n }\n};\n\nstruct Parser {\n using Iter = std::string::const_iterator&;\n std::vector<std::string> lines;\n std::string line;\n std::map<char, Matrix> database;\n\n void consume(Iter it, char c) {\n it++;\n }\n\n Parser(const std::vector<std::string>& s): lines(s) {}\n\n std::vector<Matrix> parse() {\n std::vector<Matrix> mats;\n for (int i = 0; i < (int)lines.size(); i++) {\n line = lines[i];\n auto it = line.cbegin();\n auto [var, mat] = assignment(it);\n\n mats.push_back(mat);\n database[var] = mat;\n }\n return mats;\n }\n\n std::pair<char, Matrix> assignment(Iter it) {\n char assignment_var = *it;\n consume(it, assignment_var);\n consume(it, '=');\n Matrix res = expr(it);\n consume(it, '.');\n return {assignment_var, res};\n }\n\n Matrix var(Iter it) {\n char c = *it;\n consume(it, c);\n return database[c];\n }\n\n Matrix expr(Iter it) {\n Matrix res = term(it);\n while (it != line.end() && (*it == '+' || *it == '-')) {\n if (*it == '+') {\n consume(it, '+');\n res = res + term(it);\n } else {\n consume(it, '-');\n res = res - term(it);\n }\n }\n return res;\n }\n\n Matrix term(Iter it) {\n Matrix res = factor(it);\n while (it != line.end() && *it == '*') {\n consume(it, '*');\n res = res * factor(it);\n }\n return res;\n }\n\n Matrix factor(Iter it) {\n bool inv = false;\n while (it != line.end() && *it == '-') {\n consume(it, '-');\n inv ^= true;\n }\n Matrix res = primary(it);\n if (inv) {\n res = -res;\n }\n return res;\n }\n\n Matrix primary(Iter it) {\n Matrix res;\n if (std::isdigit(*it)) {\n res = inum(it);\n } else if (std::isupper(*it)) {\n res = var(it);\n } else if (*it == '[') {\n res = matrix(it);\n } else if (*it == '(') {\n consume(it, '(');\n res = expr(it);\n consume(it, ')');\n }\n\n while (it != line.end() && (*it == '(' || *it == '\\'')) {\n if (*it == '(') {\n res = indexed_primary(it, res);\n } else if (*it == '\\'') {\n res = transposed_primary(it, res);\n }\n }\n\n return res;\n }\n\n Matrix indexed_primary(Iter it, Matrix mat) {\n consume(it, '(');\n Matrix lhs = expr(it);\n consume(it, ',');\n Matrix rhs = expr(it);\n consume(it, ')');\n\n return mat(lhs, rhs);\n }\n\n Matrix transposed_primary(Iter it, Matrix mat) {\n consume(it, '\\'');\n return mat.transpose();\n }\n\n Matrix matrix(Iter it) {\n consume(it, '[');\n Matrix res = row_seq(it);\n consume(it, ']');\n return res;\n }\n\n Matrix row_seq(Iter it) {\n Matrix res = row(it);\n while (it != line.end() && *it == ';') {\n consume(it, ';');\n res = res.add_row(row(it));\n }\n return res;\n }\n\n Matrix row(Iter it) {\n Matrix res = expr(it);\n while (it != line.end() && *it == ' ') {\n consume(it, ' ');\n res = res.add_column(expr(it));\n }\n return res;\n }\n\n Matrix inum(Iter it) {\n int res = digit(it);\n while (it != line.end() && std::isdigit(*it)) {\n res = 10 * res + digit(it);\n }\n return Matrix(res);\n }\n\n int digit(Iter it) {\n char res = *it;\n consume(it, res);\n return res - '0';\n }\n};\n\nint main() {\n int n;\n while (std::cin >> n) {\n if (n == 0) break;\n std::cin.ignore();\n std::vector<std::string> lines(n);\n for (int i = 0; i < n; i++) {\n std::getline(std::cin, lines[i]);\n }\n Parser parser(lines);\n auto mats = parser.parse();\n for (auto mat: mats) {\n std::cout << mat << std::endl;\n }\n std::cout << \"-----\" << std::endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3664,"score_of_the_acc":-0.118,"final_rank":6},{"submission_id":"aoj_1314_8033955","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef __int128_t lll;\ntypedef long double ld;\ntypedef pair<ll, ll> pl;\ntypedef tuple<ll, ll, ll> tt;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<vvl> vvvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<vvd> vvvd;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<vvc> vvvc;\ntypedef vector<pl> vp;\ntypedef vector<tt> vt;\ntypedef vector<string> vs;\n\nconst ll INF = 1000000010;\nconst ll INFL = INF * INF;\nconst ld epsilon = 1e-10;\n\n#define ovl(a, b, c, d, e, ...) e\n#define pb push_back\n#define eb emplace_back\n#define MP make_pair\n#define DEBUG(...) DEBUG_(#__VA_ARGS__, __VA_ARGS__)\n#define REP1(i, r) for (int i = 0; i < (r); i++)\n#define REP2(i, l, r) for (int i = (l); i < (r); i++)\n#define REP3(i, l, r, d) for (int i = (l); i < (r); i += (d))\n#define REP(...) ovl(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)\n#define RREP1(i, r) for (int i = (r)-1; i >= 0; i--)\n#define RREP2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define RREP3(i, l, r, d) for (int i = (r)-1; i >= (l); i -= (d))\n#define RREP(...) ovl(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define EACH1(x, a) for (auto &x : a)\n#define EACH2(x, y, a) for (auto &[x, y] : a)\n#define EACH3(x, y, z, a) for (auto &[x, y, z] : a)\n#define EACH(...) ovl(__VA_ARGS__, EACH3, EACH2, EACH1)(__VA_ARGS__)\n#define ALL(x) begin(x), end(x)\n#define RALL(x) (x).rbegin(), (x).rend()\n#define sz(x) (ll) x.size()\n#define LB(a, x) (lower_bound(ALL(a), x) - a.begin())\n#define UB(a, x) (upper_bound(ALL(a), x) - a.begin())\n#define FLG(x, i) (((x) >> (i)) & 1)\n#define CNTBIT(x) __builtin_popcountll(x)\n#define IN(x, a, b) ((a) <= (x) && (x) < (b))\n#define int ll\n\ntemplate <class T>\nvoid DEBUG_(string_view name, const T &a) {\n cerr << name << \": \" << a << endl;\n}\n\ntemplate <class T>\nvoid DEBUG_(string_view name, const vector<T> &a) {\n cerr << name << \": \";\n REP(i, sz(a)) cerr << a[i] << \" \";\n cerr << endl;\n}\n\ntemplate <class T, class U>\nbool chmax(T &x, const U &y) {\n return x < y ? x = y, 1 : 0;\n}\ntemplate <class T, class U>\nbool chmin(T &x, const U &y) {\n return x > y ? x = y, 1 : 0;\n}\n\n//-----------------------------------------------------------------------\n\ntypedef string::const_iterator State;\ntypedef vector<vector<int>> Mat;\n\nconstexpr int MOD = 1 << 15;\n\nMat matadd(const Mat &m1, const Mat &m2) {\n assert(m1.size() == m2.size() && m1[0].size() == m2[0].size());\n Mat m3 = m1;\n REP(h, (int)m1.size())\n REP(w, (int)m1[0].size()) {\n m3[h][w] += m2[h][w];\n m3[h][w] %= MOD;\n }\n return m3;\n}\n\nMat matsub(const Mat &m1, const Mat &m2) {\n assert(m1.size() == m2.size() && m1[0].size() == m2[0].size());\n Mat m3 = m1;\n REP(h, (int)m1.size())\n REP(w, (int)m1[0].size()) {\n m3[h][w] += MOD - m2[h][w] % MOD;\n m3[h][w] %= MOD;\n }\n return m3;\n}\n\nMat matmul(const Mat &m1, const Mat &m2) {\n if (int(m1.size()) == 1 && int(m1[0].size()) == 1) {\n Mat m3 = m2;\n REP(h, int(m3.size()))\n REP(w, int(m3[0].size())) {\n m3[h][w] *= m1[0][0];\n m3[h][w] %= MOD;\n }\n return m3;\n } else if (int(m2.size()) == 1 && int(m2[0].size()) == 1) {\n Mat m3 = m1;\n REP(h, int(m3.size()))\n REP(w, int(m3[0].size())) {\n m3[h][w] *= m2[0][0];\n m3[h][w] %= MOD;\n }\n return m3;\n } else {\n assert(m1[0].size() == m2.size());\n Mat m3(m1.size(), vl(m2[0].size(), 0));\n REP(i, (int)m1.size())\n REP(j, (int)m2[0].size())\n REP(k, (int)m1[0].size()) {\n m3[i][j] += m1[i][k] * m2[k][j] % MOD;\n m3[i][j] %= MOD;\n }\n return m3;\n }\n}\n\nMat unary_minus(const Mat &m) {\n Mat m3 = m;\n REP(h, (int)m.size())\n REP(w, (int)m[0].size()) { m3[h][w] = MOD - m[h][w]; }\n return m3;\n}\n\nMat mattranspose(const Mat &m) {\n Mat m3(m[0].size(), vl(m.size()));\n REP(h, (int)m.size())\n REP(w, (int)m[0].size()) { m3[w][h] = m[h][w]; }\n return m3;\n}\n\nMat matindex(const Mat &p, const Mat &m1, const Mat &m2) {\n assert((int)m1.size() == 1 && (int)m2.size() == 1);\n Mat m3(m1[0].size(), vl(m2[0].size()));\n REP(h, (int)m1[0].size())\n REP(w, (int)m2[0].size()) { m3[h][w] = p[m1[0][h] - 1][m2[0][w] - 1]; }\n return m3;\n}\n\nmap<string, Mat> store;\n\nMat assignment(State &bein);\nstring var(State &begin);\nMat expr(State &begin);\nMat term(State &begin);\nMat factor(State &begin);\nMat primary(State &begin);\nMat matrix(State &begin);\n\nMat assignment(State &begin) {\n string X = var(begin);\n assert(*begin == '=');\n begin++;\n Mat mat = expr(begin);\n store[X] = mat;\n return mat;\n}\n\nstring var(State &begin) {\n assert('A' <= *begin && *begin <= 'Z');\n string ret(1, *begin);\n begin++;\n return ret;\n}\n\nMat expr(State &begin) {\n Mat mat = term(begin);\n while (*begin != '.') {\n if (*begin == '+') {\n begin++;\n Mat mat2 = term(begin);\n mat = matadd(mat, mat2);\n } else if (*begin == '-') {\n begin++;\n Mat mat2 = term(begin);\n mat = matsub(mat, mat2);\n } else {\n break;\n }\n }\n return mat;\n}\n\nMat term(State &begin) {\n Mat mat = factor(begin);\n while (*begin == '*') {\n begin++;\n Mat mat2 = factor(begin);\n mat = matmul(mat, mat2);\n }\n return mat;\n}\n\nMat factor(State &begin) {\n if (*begin == '-') {\n begin++;\n return unary_minus(factor(begin));\n } else {\n return primary(begin);\n }\n}\n\nint inum(State &begin) {\n int ret = 0;\n while (isdigit(*begin)) {\n ret *= 10;\n ret %= MOD;\n ret += *begin - '0';\n ret %= MOD;\n begin++;\n }\n // DEBUG(*begin);\n return ret;\n}\n\nMat row(State &begin) {\n // DEBUG(\"row\");\n Mat mat = expr(begin);\n // DEBUG(*begin);\n while (*begin == ' ') {\n begin++;\n Mat mat2 = expr(begin);\n // DEBUG(mat2);\n assert(mat.size() == mat2.size());\n REP(h, int(mat.size())) {\n EACH(e, mat2[h]) { mat[h].pb(e); }\n }\n }\n return mat;\n}\n\nMat rowseq(State &begin) {\n Mat mat = row(begin);\n while (*begin == ';') {\n begin++;\n Mat mat2 = row(begin);\n EACH(r, mat2) { mat.pb(r); }\n }\n return mat;\n}\n\nMat primary_sub(State &begin) {\n if (isdigit(*begin)) {\n return Mat(1, vl(1, inum(begin)));\n }\n if ('A' <= *begin && *begin <= 'Z') {\n Mat ret = store[string(1, *begin)];\n begin++;\n return ret;\n }\n if (*begin == '[') {\n begin++;\n Mat mat = rowseq(begin);\n assert(*begin == ']');\n begin++;\n return mat;\n }\n if (*begin == '(') {\n begin++;\n Mat mat = expr(begin);\n assert(*begin == ')');\n begin++;\n return mat;\n }\n assert(false);\n}\n\nMat primary(State &begin) {\n Mat p = primary_sub(begin);\n while (*begin == '(' || *begin == '\\'') {\n if (*begin == '(') {\n begin++;\n Mat mat1 = expr(begin);\n assert(*begin == ',');\n begin++;\n Mat mat2 = expr(begin);\n assert(*begin == ')');\n begin++;\n p = matindex(p, mat1, mat2);\n } else {\n begin++;\n p = mattranspose(p);\n }\n }\n return p;\n}\n\nvector<Mat> solve(int N) {\n store.clear();\n vector<Mat> mats;\n REP(i, N) {\n string S;\n getline(cin, S);\n // DEBUG(S);\n State begin = S.begin();\n Mat mat = assignment(begin);\n // DEBUG(\"mat\");\n // EACH(m, mat) { DEBUG(m); }\n mats.pb(mat);\n }\n return mats;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(15);\n\n vector<vector<Mat>> answers;\n while (true) {\n string n;\n getline(cin, n);\n State begin = n.begin();\n int N = inum(begin);\n if (N == 0) break;\n // DEBUG(N);\n vector<Mat> answer = solve(N);\n answers.pb(answer);\n }\n\n EACH(as, answers) {\n EACH(a, as) {\n REP(h, (int)a.size()) {\n REP(w, (int)a[h].size()) {\n cout << a[h][w] << (w == int(a[h].size()) - 1 ? \"\" : \" \");\n }\n cout << endl;\n }\n }\n cout << \"-----\" << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4312,"score_of_the_acc":-0.2182,"final_rank":19},{"submission_id":"aoj_1314_8019671","code_snippet":"#pragma region ngng628_library\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n unsigned int umod() const { return _m; }\n\n unsigned int mul(unsigned int a, unsigned int b) const {\n\n unsigned long long z = a;\n z *= b;\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\nusing mint = atcoder::static_modint<32768>;\n#include <bits/stdc++.h>\n#define int Int\n#define float Float\n#define overload3(_1,_2,_3,name,...) name\n#define _step(n) _rep(_,n)\n#define _rep(i,n) _repr(i,0,n)\n#define _repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)\n#define rep(...) overload3(__VA_ARGS__, _repr, _rep, _step)(__VA_ARGS__)\n#define _reps(i,n) _reprs(i,1,n)\n#define _reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)\n#define reps(...) overload3(__VA_ARGS__, _reprs, _reps)(__VA_ARGS__)\n#define rrep(i,n) for(int i=(int)(n)-1; i>=0; --i)\n#define rreps(i,n) for(int i=(n); i>0; --i)\n#define all(v) std::begin(v), std::end(v)\n#define rall(v) std::rbegin(v), std::rend(v)\n#define pb push_back\n#define eb emplace_back\n#define len(v) ssize(std::size(v))\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\nusing namespace std;\nusing Int = long long;\nusing Float = long double;\nusing int32 = int32_t;\nusing int64 = int64_t;\nusing uint32 = uint32_t;\nusing uint64 = uint64_t;\nusing usize = size_t;\nusing ssize = ptrdiff_t;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using MaxHeap = priority_queue<T>;\ntemplate<class T> using MinHeap = priority_queue<T, vec<T>, greater<T>>;\nusing pii = pair<int, int>;\nusing vi = vec<int>;\nusing vvi = vec<vi>;\nusing vvvi = vec<vvi>;\nusing vb = basic_string<bool>;\nusing vvb = vec<vb>;\nusing vvvb = vec<vvb>;\nconstexpr int OO = (1LL<<62)-(1LL<<31);\ntemplate<class T> string join(const vec<T>& v){ stringstream s; for (T t : v) s << ' ' << t; return s.str().substr(1); }\ntemplate<class T> ostream& operator <<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }\ntemplate<class T> ostream& operator <<(ostream& os, const vec<vec<T>>& v){\n rep (i, len(v)) if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? \"\\n\" : \"\");\n return os;\n}\ntemplate<class T, class U> ostream& operator <<(ostream& os, const pair<T, U>& p){ return os << p.first << ' ' << p.second; }\ntemplate<class T, class U, class V>\nostream& operator <<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << \" \" << get<1>(t) << \" \" << get<2>(t); }\nstruct Scanner {\n Scanner() = default;\n int nextInt(int o = 0) const {\n char c = skip();\n int r = c - '0', sgn = 1;\n if (c == '-') sgn = -1, r = gc() & 0xf;\n else if (c == '+') r = gc() & 0xf;\n while (!isspace(c = gc())) r = 10 * r + (c & 0xf);\n return sgn * r + o;\n }\n string nextLine() const { char c; string r; while ((c = gc()) != '\\n') r.pb(c); return r; }\nprivate:\n char skip() const { char c; while (isspace(c = getchar())) {} return c; }\n inline char gc() const { return getchar(); }\n} sc;\nistream& operator >>(istream& is, mint& r){ int t; is >> t; r = t; return is; }\nostream& operator <<(ostream& os, const mint& r){ return os << r.val(); }\nmint operator\"\" _mod_m(unsigned long long n) { return n; }\nusing vm = vec<mint>;\nusing vvm = vec<vm>;\nusing vvvm = vec<vvm>;\n# pragma endregion ngng628_library\n\ntemplate <class T>\nstruct Matrix {\n // コンストラクタ\n Matrix() : m(vec<vec<T>>()) {}\n Matrix(int n) : m(vec<vec<T>>(n, vec<T>(n))) {}\n Matrix(int h, int w) : m(vec<vec<T>>(h, vec<T>(w, 0))) {}\n Matrix(int h, int w, T d) : m(vec<vec<T>>(h, vec<T>(w, d))){}\n Matrix(const vec<vec<T>>& _m) : m(_m){}\n\n // 単位行列\n const static Matrix Identity(const int n) {\n Matrix mat(n);\n rep (i, n) mat[i][i] = T(1);\n return mat;\n }\n\n // 要素アクセス\n vec<T> operator[](const int i) const { return m[i]; }\n vec<T>& operator[](const int i) { return m[i]; }\n T operator ()(const int i, const int j) const { return m[i][j]; }\n T& operator ()(const int i, const int j) { return m[i][j]; }\n\n // ゲッター\n [[nodiscard]] constexpr int n_rows() const { return len(m); }\n [[nodiscard]] constexpr int n_cols() const { return len(m[0]); }\n\n // 行・列の拡張\n void resize(const int h, const int w) { m.resize(h, w, T()); }\n void push_back_row(const vec<T>& v) { m.push_back(v); }\n void push_back_col(const vec<T>& v) { rep (i, n_rows()) m[i].push_back(v[i]); }\n void pop_back_row() { m.pop_back(); }\n void pop_back_col() { rep (i, n_rows()) m[i].pop_back(); }\n\n // 四則演算とべき乗\n Matrix& operator +=(const Matrix& other) {\n const int r = n_rows();\n const int c = n_cols();\n assert(r == other.n_rows() and c == other.n_cols());\n rep (i, r) rep (j, c) (*this)(i, j) += other(i, j);\n return *this;\n }\n Matrix& operator -=(const Matrix& other) {\n const int r = n_rows();\n const int c = n_cols();\n assert(r == other.n_rows() and c == other.n_cols());\n rep (i, r) rep (j, c) (*this)(i, j) -= other(i, j);\n return *this;\n }\n Matrix& operator *=(const Matrix& other) {\n const int r = n_rows(), c = other.n_cols(), p = n_cols();\n assert(p == other.n_rows());\n vec<vec<T>> v(r, vec<T>(c, T(0)));\n rep (i, r) rep (j, c) rep (k, p) v[i][j] = (v[i][j] + (*this)(i, k) * other(k, j));\n m.swap(v);\n return *this;\n }\n Matrix& operator ^=(int n) {\n Matrix res = Matrix::Identity(n_rows());\n Matrix x = *this;\n while (n > 0) {\n if (n & 1) res *= x;\n x *= x;\n n >>= 1;\n }\n swap(m, res.m);\n return *this;\n }\n\n friend Matrix operator +(const Matrix& a, const Matrix& b) { return Matrix(a) += b; }\n friend Matrix operator -(const Matrix& a, const Matrix& b) { return Matrix(a) -= b; }\n friend Matrix operator *(const Matrix& a, const Matrix& b) { return Matrix(a) *= b; }\n friend Matrix operator ^(const Matrix& a, const int n) { return Matrix(a) ^= n; }\n\n // スカラー倍\n Matrix& operator *=(T k) { rep (i, n_rows()) rep (j, n_cols()) (*this)(i, j) *= k; return *this; }\n Matrix& operator /=(T k) { rep (i, n_rows()) rep (j, n_cols()) (*this)(i, j) /= k; return *this; }\n friend Matrix operator *(const Matrix& a, const T b) { return Matrix(a) *= b; }\n friend Matrix operator *(const T a, const Matrix& b) { return Matrix(b) *= a; }\n friend Matrix operator /(const Matrix& a, const T b) { return Matrix(a) /= b; }\n\n // 単項演算子\n Matrix operator -() const { Matrix mat(n_rows(), n_cols()); rep (i, n_rows()) rep (j, n_cols()) mat(i, j) = -this->m[i][j]; return mat; }\n Matrix operator +() const { return *this; }\n\n // 累乗\n Matrix pow(int n) { return (*this) ^ n; }\n friend Matrix pow(const Matrix& mat, int n) { return mat.pow(n); }\n\n // 行列式 （T型が体であるときのみ対応）\n T det() {\n assert(n_rows() == n_cols());\n Matrix mat(*this);\n T ret = 1;\n rep (i, n_cols()) {\n int idx = -1;\n rep (j, i, n_cols()) {\n if (mat(j, i) != T(0)) idx = j;\n }\n if (idx == -1) return 0;\n if (i != idx) {\n ret *= -1;\n swap(mat[i], mat[idx]);\n }\n ret *= mat(i, i);\n T v = mat(i, i);\n rep (j, n_cols()) mat(i, j) /= v;\n rep (j, i + 1, n_cols()) {\n T a = mat(j, i);\n rep (k, n_cols()) mat(j, k) -= mat(i, k) * a;\n }\n }\n return ret;\n }\n friend T det(const Matrix& mat) { return mat.det(); }\n\n // 転置行列\n Matrix transposed() const {\n Matrix mat(n_cols(), n_rows());\n rep (i, n_rows()) {\n rep (j, n_cols()) {\n mat(j, i) = m[i][j];\n }\n }\n return mat;\n }\n friend T transposed(const Matrix& mat) { return mat.transposed(); }\n\n // 行のスライス\n Matrix selected_rows(const vector<int>& indices) {\n vector<vector<T>> acc;\n for (int i : indices) {\n acc.push_back(m[i]);\n }\n return Matrix(acc);\n }\n\n // 列のスライス\n Matrix selected_cols(const vector<int>& indices) {\n vector<vector<T>> acc;\n Matrix mt = transposed();\n for (int j : indices) {\n acc.push_back(mt[j]);\n }\n return Matrix(acc).transposed();\n }\n\n // 行列を横に合体させる\n //\n // ```\n // [1, 2; 3, 4].row_concat([5, 6, 7; 8, 9, 10]) # => [1, 2, 5, 6; 3, 4, 8, 9, 10]\n // ```\n Matrix row_concat(const Matrix& other) {\n assert(n_rows() == other.n_rows());\n Matrix ret(n_rows(), n_cols() + other.n_cols());\n const int w = n_cols();\n rep (i, n_rows()) {\n rep (j, w) ret(i, j) = m[i][j];\n rep (j, other.n_cols()) ret(i, w + j) = other[i][j];\n }\n return ret;\n }\n\n // 行列を縦に合体させる\n //\n // ```\n // [1, 2; 3, 4].row_concat([5, 6; 7, 8; 9, 10]) # => [1, 2; 3, 4; 5, 6; 7, 8; 9, 10]\n // ```\n Matrix col_concat(const Matrix& other) {\n assert(n_cols() == other.n_cols());\n Matrix ret(n_rows() + other.n_rows(), n_cols());\n const int h = n_rows();\n rep (i, h) {\n rep (j, n_cols()) ret(i, j) = m[i][j];\n }\n rep (i, other.n_rows()) {\n rep (j, other.n_cols()) ret(h + i, j) = other[i][j];\n }\n return ret;\n }\n\n // 入出力\n friend ostream& operator <<(ostream& os, const Matrix& mat){\n rep (i, mat.n_rows()) {\n rep (j, mat.n_cols()) {\n if (j != 0) os << ' ';\n os << mat(i, j);\n }\n if (i != mat.n_rows() - 1) os << '\\n';\n }\n return os;\n }\n\nprivate:\n vec<vec<T>> m;\n};\n\nusing M = Matrix<mint>;\n\nstruct Parser {\n map<char, M> mp;\n vector<string> s;\n int line;\n string::const_iterator it;\n\n Parser() = default;\n\n Parser(const vector<string>& _s) : s(_s) {\n }\n\n void parse() {\n const int n = len(s);\n rep (i, 0, n) {\n line = i;\n it = s[i].begin();\n program();\n }\n }\n\n void program() {\n char var = *it++;\n assert(*it++ == '=');\n\n M res = expr();\n assert(*it++ == '.');\n\n mp[var] = res;\n cout << res << endl;\n }\n\n M expr() {\n M acc = term();\n while (*it == '+' || *it == '-') {\n char op = *it++;\n M other = term();\n if (op == '+') {\n acc += other;\n }\n else {\n acc -= other;\n }\n }\n return acc;\n }\n\n M term() {\n M acc = factor();\n while (*it == '*') {\n assert(*it++ == '*');\n M other = factor();\n if (isnumber(acc) && isnumber(other)) {\n acc *= other;\n }\n else if (isnumber(acc) && not isnumber(other)) {\n acc = acc(0, 0) * other;\n }\n else if (not isnumber(acc) && isnumber(other)) {\n acc *= other(0, 0);\n }\n else {\n assert(not isnumber(acc) && not isnumber(other));\n acc *= other;\n }\n }\n return acc;\n }\n\n M factor() {\n if (*it == '-') {\n assert(*it++ == '-');\n M ret = factor();\n return -ret;\n }\n return primary();\n }\n\n M primary() {\n M ret;\n if (isdigit(*it)) {\n mint val = inum();\n ret = M(1, 1, val);\n }\n else if (isalpha(*it)) {\n ret = mp[*it++];\n }\n else if (*it == '(') {\n assert(*it++ == '(');\n ret = expr();\n assert(*it++ == ')');\n }\n else {\n assert(*it == '[');\n ret = matrix();\n }\n\n while (*it == '(' || *it == '\\'') {\n if (*it == '(') {\n assert(*it++ == '(');\n M is = expr();\n assert(*it++ == ',');\n M js = expr();\n assert(*it++ == ')');\n assert(is.n_rows() == 1);\n assert(js.n_rows() == 1);\n {\n vector<int> indices;\n rep (j, 0, is.n_cols()) {\n indices.push_back(is(0, j).val() - 1);\n }\n ret = ret.selected_rows(indices);\n }\n {\n vector<int> indices;\n rep (j, 0, js.n_cols()) {\n indices.push_back(js(0, j).val() - 1);\n }\n ret = ret.selected_cols(indices);\n }\n }\n else if (*it == '\\'') {\n assert(*it++ == '\\'');\n ret = ret.transposed();\n }\n }\n return ret;\n }\n\n M matrix() {\n assert(*it++ == '[');\n M row = row_seq();\n assert(*it++ == ']');\n return row;\n }\n\n M row_seq() {\n M acc = row();\n while (*it == ';') {\n assert(*it++ == ';');\n M other = row();\n acc = acc.col_concat(other);\n }\n return acc;\n }\n\n M row() {\n M acc = expr();\n while (*it == ' ') {\n assert(*it++ == ' ');\n M other = expr();\n acc = acc.row_concat(other);\n }\n return acc;\n }\n\n bool isnumber(const M& mat) {\n return mat.n_rows() == 1 && mat.n_cols() == 1;\n }\n\n mint inum() {\n mint ret = 0;\n for (; isdigit(*it); ++it) {\n ret = 10*ret + (*it - '0');\n }\n return ret;\n }\n};\n\nint32 main() {\n while (true) {\n auto n = sc.nextInt();\n if (!n) break;\n vector<string> s(n);\n for (string& si : s) si = sc.nextLine();\n Parser(s).parse();\n cout << \"-----\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3608,"score_of_the_acc":-0.1094,"final_rank":4},{"submission_id":"aoj_1314_7983042","code_snippet":"#include <string.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <chrono>\n#include <ciso646>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define REP3(i, l, r, s) \\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\n i += rep3_s)\n#define REP2(i, l, r) REP3(i, l, r, 1)\n#define REP1(i, n) REP2(i, 0, n)\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\n\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define RREP3(i, l, r, s) \\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\n i -= rrep3_s)\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\n#define RREP1(i, n) RREP2(i, 0, n)\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\n#define rrepin(i, l, r) \\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\n\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace rklib {\n\n// a <- max(a, b)\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// a <- min(a, b)\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// if a < 0: a <- b\n// else: a <- min(a, b)\ntemplate <class T>\nbool chmin_non_negative(T &a, const T &b) {\n if (a < 0 || a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// floor(num / den)\ntemplate <class T>\nT div_floor(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num >= 0 ? num / den : (num + 1) / den - 1;\n}\n\n// ceil(num / den)\ntemplate <class T>\nT div_ceil(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num <= 0 ? num / den : (num - 1) / den + 1;\n}\n\nnamespace internal {\n\ntemplate <class T>\nT remainder_count(T r, T b, T m) {\n return r / m * b + std::min(b, r % m);\n}\n\n} // namespace internal\n\n// Number of integer x s.t.\n// - x in [l, r)\n// - x mod m in [a, b)\ntemplate <class T>\nT remainder_count(T l, T r, T a, T b, T m) {\n assert(l >= 0);\n assert(m >= 1);\n\n if (l >= r || a >= b) return 0;\n if (m <= a || b < 0) return 0;\n chmax(a, T(0));\n chmin(b, m);\n\n auto res = internal::remainder_count(r, b, m);\n if (l >= 1) res -= internal::remainder_count(l, b, m);\n if (a >= 1) res -= internal::remainder_count(r, a, m);\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\n\n return res;\n}\n\n} // namespace rklib\n\n\nusing namespace std;\nusing namespace rklib;\n\nusing lint = long long;\nusing ulint = unsigned long long;\nusing pii = pair<int, int>;\nusing pll = pair<lint, lint>;\n\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <assert.h>\n\n#include <vector>\n\nnamespace rklib {\n\ntemplate <class T>\nstruct Matrix {\n std::vector<std::vector<T>> a;\n\n Matrix() : a(1, std::vector<T>(1, 0)) {}\n Matrix(int n, int m) : a(n, std::vector<T>(m, 0)) {}\n Matrix(int n) : a(n, std::vector<T>(n, 0)) {}\n\n int height() const { return a.size(); }\n int width() const { return a[0].size(); }\n\n inline const std::vector<T> &operator[](int i) const { return a[i]; }\n inline std::vector<T> &operator[](int i) { return a[i]; }\n\n static Matrix id(int n) {\n Matrix res(n);\n for (int i = 0; i < n; i++) res[i][i] = 1;\n return res;\n }\n\n Matrix &operator*=(const Matrix &b) {\n assert(width() == b.height());\n std::vector<std::vector<T>> c(height(), std::vector<T>(b.width()));\n for (int i = 0; i < height(); ++i) {\n for (int k = 0; k < b.height(); ++k) {\n for (int j = 0; j < b.width(); ++j) {\n c[i][j] += a[i][k] * b[k][j];\n }\n }\n }\n a.swap(c);\n return *this;\n }\n\n Matrix pow(long long n) const {\n auto x = (*this), res = id(height());\n while (n) {\n if (n & 1) {\n res *= x;\n --n;\n } else {\n x *= x;\n n >>= 1;\n }\n }\n return res;\n }\n\n Matrix operator*(const Matrix &b) const { return Matrix(*this) *= b; }\n\n std::vector<T> operator*(const std::vector<T> &v) {\n assert(width() == (int)v.size());\n std::vector<T> res(height(), 0);\n for (int i = 0; i < height(); ++i) {\n for (int j = 0; j < width(); ++j) {\n res[i] += a[i][j] * v[j];\n }\n }\n return res;\n }\n\n Matrix transposed() {\n Matrix res(this->width(), this->height());\n for (size_t i = 0; i < this->height(); i++) {\n for (size_t j = 0; j < this->width(); j++) {\n res[j][i] = this->a[i][j];\n }\n }\n return res;\n }\n};\n\ntemplate <class T>\nstd::pair<int, bool> gauss_jordan(Matrix<T> &a) {\n int rnk = 0;\n bool swp = false;\n for (int j = 0; j < a.width(); ++j) {\n int pivot = -1;\n for (int i = rnk; i < a.height(); ++i) {\n if (a[i][j] != 0) {\n pivot = i;\n break;\n }\n }\n if (pivot < 0) continue;\n swap(a[pivot], a[rnk]);\n if (pivot != rnk) swp ^= true;\n for (int i = 0; i < a.height(); ++i) {\n if (i != rnk && a[i][j] != 0) {\n auto coef = a[i][j] / a[rnk][j];\n for (int k = j; k < a.width(); ++k) {\n a[i][k] -= a[rnk][k] * coef;\n }\n }\n }\n ++rnk;\n }\n return {rnk, swp};\n}\n\ntemplate <class T>\nT determinant(Matrix<T> a) {\n auto [rnk, swp] = gauss_jordan(a);\n if (rnk < a.height()) return 0;\n T res = 1;\n for (int i = 0; i < a.height(); ++i) res *= a[i][i];\n if (swp) res = -res;\n return res;\n}\n\ntemplate <class T>\nstd::pair<std::vector<T>, std::vector<std::vector<T>>>\nsystem_of_linear_equations(Matrix<T> a, const std::vector<T> &b) {\n assert(a.height() == (int)b.size());\n Matrix<T> aug(a.height(), a.width() + 1);\n for (int i = 0; i < a.height(); ++i) {\n for (int j = 0; j < a.width(); ++j) {\n aug[i][j] = a[i][j];\n }\n aug[i][a.width()] = b[i];\n }\n\n auto rnk = gauss_jordan(a).first, rnk_aug = gauss_jordan(aug).first;\n\n std::vector<T> solution;\n std::vector<std::vector<T>> kernel;\n if (rnk < rnk_aug) return {solution, kernel};\n\n solution.resize(a.width(), 0);\n std::vector<bool> used(a.width(), false);\n std::vector<int> pos(rnk);\n for (int i = 0; i < rnk; ++i) {\n for (int j = 0; j < a.width(); ++j) {\n if (aug[i][j] != 0) {\n solution[j] = aug[i][a.width()] / aug[i][j];\n used[j] = true;\n pos[i] = j;\n break;\n }\n }\n }\n for (int j = 0; j < a.width(); ++j) {\n if (!used[j]) {\n std::vector<T> v(a.width(), 0);\n v[j] = 1;\n for (int i = 0; i < rnk; ++i) {\n v[pos[i]] = -aug[i][j] / aug[i][pos[i]];\n }\n kernel.push_back(v);\n }\n }\n return {solution, kernel};\n}\n\n} // namespace rklib\n\n\nusing mint = atcoder::modint;\nusing mat = Matrix<mint>;\n\nmat var(string &s, int &idx);\nmat expr(string &s, int &idx);\nmat term(string &s, int &idx);\nmat factor(string &s, int &idx);\nmat primary(string &s, int &idx);\nmat matrix(string &s, int &idx);\nmat row_seq(string &s, int &idx);\nmat row(string &s, int &idx);\nmat inum(string &s, int &idx);\n\nmat vars[26];\n\nmat var(string &s, int &idx) {\n auto res = vars[s[idx] - 'A'];\n ++idx;\n return res;\n}\nmat expr(string &s, int &idx) {\n auto res = term(s, idx);\n while (idx < int(s.size()) && (s[idx] == '+' || s[idx] == '-')) {\n auto op = s[idx];\n ++idx;\n auto tmp = term(s, idx);\n if (op == '+') {\n rep(i, res.height()) rep(j, res.width()) res[i][j] += tmp[i][j];\n } else {\n rep(i, res.height()) rep(j, res.width()) res[i][j] -= tmp[i][j];\n }\n }\n return res;\n}\nmat term(string &s, int &idx) {\n auto res = factor(s, idx);\n while (idx < int(s.size()) && s[idx] == '*') {\n ++idx;\n auto tmp = factor(s, idx);\n if (res.height() == 1 && res.width() == 1) {\n auto coef = res[0][0];\n res = tmp;\n rep(i, res.height()) rep(j, res.width()) res[i][j] *= coef;\n } else if (tmp.height() == 1 && tmp.width() == 1) {\n auto coef = tmp[0][0];\n rep(i, res.height()) rep(j, res.width()) res[i][j] *= coef;\n } else {\n res = res * tmp;\n }\n }\n return res;\n}\nmat factor(string &s, int &idx) {\n if (s[idx] == '-') {\n ++idx;\n auto res = factor(s, idx);\n rep(i, res.height()) rep(j, res.width()) res[i][j] = -res[i][j];\n return res;\n }\n return primary(s, idx);\n}\nmat primary(string &s, int &idx) {\n mat res;\n if (isdigit(s[idx])) {\n res = inum(s, idx);\n } else if ('A' <= s[idx] && s[idx] <= 'Z') {\n res = var(s, idx);\n } else if (s[idx] == '[') {\n res = matrix(s, idx);\n } else {\n ++idx;\n res = expr(s, idx);\n ++idx;\n }\n while (idx < s.size() && (s[idx] == '\\'' || s[idx] == '(')) {\n if (s[idx] == '\\'') {\n ++idx;\n res = res.transposed();\n } else {\n ++idx;\n auto A = expr(s, idx);\n ++idx;\n auto B = expr(s, idx);\n ++idx;\n mat tmp(A.width(), B.width());\n rep(i, A.width()) rep(j, B.width()) {\n tmp[i][j] = res[A[0][i].val() - 1][B[0][j].val() - 1];\n }\n res = tmp;\n }\n }\n return res;\n}\nmat matrix(string &s, int &idx) {\n ++idx;\n auto res = row_seq(s, idx);\n ++idx;\n return res;\n}\nmat row_seq(string &s, int &idx) {\n auto res = row(s, idx);\n while (idx < int(s.size()) && s[idx] == ';') {\n ++idx;\n auto tmp = row(s, idx);\n mat res2(res.height() + tmp.height(), res.width());\n rep(j, res.width()) {\n rep(i, res.height()) res2[i][j] = res[i][j];\n rep(i, tmp.height()) res2[i + res.height()][j] = tmp[i][j];\n }\n res = res2;\n }\n return res;\n}\nmat row(string &s, int &idx) {\n auto res = expr(s, idx);\n while (idx < int(s.size()) && s[idx] == ' ') {\n ++idx;\n auto tmp = expr(s, idx);\n mat res2(res.height(), res.width() + tmp.width());\n rep(i, res.height()) {\n rep(j, res.width()) res2[i][j] = res[i][j];\n rep(j, tmp.width()) res2[i][j + res.width()] = tmp[i][j];\n }\n res = res2;\n }\n return res;\n}\nmat inum(string &s, int &idx) {\n mat res(1, 1);\n mint tmp = 0;\n while (idx < int(s.size()) && isdigit(s[idx])) {\n tmp = tmp * 10 + (s[idx] - '0');\n ++idx;\n }\n\n res[0][0] = tmp;\n return res;\n}\n\nint main() {\n mint::set_mod(32768);\n\n while (true) {\n string s;\n getline(cin, s);\n int n = stoi(s);\n if (n == 0) break;\n rep(_, n) {\n getline(cin, s);\n int idx = 0;\n\n auto c = s[idx];\n idx += 2;\n auto ans = expr(s, idx);\n vars[c - 'A'] = ans;\n\n rep(i, ans.height()) {\n rep(j, ans.width()) {\n cout << ans[i][j].val();\n if (j == ans.width() - 1) {\n cout << \"\\n\";\n } else {\n cout << \" \";\n }\n }\n }\n }\n puts(\"-----\");\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3776,"score_of_the_acc":-0.1354,"final_rank":13},{"submission_id":"aoj_1314_6027674","code_snippet":"#include <bits/stdc++.h>\n#define _overload3(_1, _2, _3, name, ...) name\n#define _rep(i, n) repi(i, 0, n)\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\n#define ALL(x) x.begin(), x.end()\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\nusing namespace std;\nrandom_device rnd;\nmt19937 mt(rnd());\nusing ll = long long;\nusing lld = long double;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing PII = pair<int, int>;\nconst int IINF = 1 << 30;\nconst ll INF = 1ll << 60;\nconst ll MOD = 32768;\n\nusing Matrix = vector<vector<int>>;\n\nstring code;\n\nvoid program(int &pos);\nvoid assign(int &pos);\nMatrix expr(int &pos);\nMatrix term(int &pos);\nMatrix factor(int &pos);\nMatrix primary(int &pos);\nMatrix indexed_primary(int &pos);\nMatrix transposed_primary(int &pos);\nMatrix matrix(int &pos);\nMatrix row_seq(int &pos);\nMatrix inum(int &pos);\nint digit(int &pos);\nmap<char, Matrix> var;\n\nvoid debug(int pos)\n{\n cerr << pos << \" \" << code.size() << endl;\n rep(i, pos, code.size())\n {\n cout << code[i];\n }\n cout << endl;\n}\nvoid print(Matrix &mat)\n{\n for (auto r : mat)\n {\n rep(j, r.size())\n {\n auto elem = r[j];\n cout << elem << (j == r.size() - 1 ? \"\" : \" \");\n }\n cout << endl;\n }\n}\n\nvoid addsub(Matrix &a, Matrix &b, char op)\n{\n assert(a.size() == b.size());\n assert(a[0].size() == b[0].size());\n rep(i, a.size())\n {\n rep(j, a[0].size())\n {\n\n a[i][j] += (op == '+' ? 1 : -1) * b[i][j];\n a[i][j] += MOD;\n a[i][j] %= MOD;\n }\n }\n}\nMatrix trans(Matrix &a)\n{\n Matrix ret(a[0].size(), vector<int>(a.size()));\n rep(i, a.size()) rep(j, a[0].size())\n {\n ret[j][i] = a[i][j];\n }\n return ret;\n}\nMatrix mul(Matrix a, Matrix b)\n{\n\n if (a[0].size() == b.size())\n {\n Matrix c(a.size(), vector<int>(b[0].size(), 0));\n rep(i, a.size())\n {\n rep(j, b[0].size())\n {\n rep(k, a[0].size())\n {\n c[i][j] += a[i][k] * b[k][j];\n c[i][j] %= MOD;\n }\n }\n }\n return c;\n }\n else if (a.size() == 1 && a[0].size() == 1)\n {\n Matrix c(b.size(), vector<int>(b[0].size(), 0));\n rep(i, b.size())\n {\n rep(j, b[0].size())\n {\n c[i][j] = b[i][j] * a[0][0];\n c[i][j] %= MOD;\n }\n }\n return c;\n }\n else\n {\n assert(b.size() == 1 && b[0].size() == 1);\n Matrix c(a.size(), vector<int>(a[0].size(), 0));\n rep(i, a.size())\n {\n rep(j, a[0].size())\n {\n c[i][j] = a[i][j] * b[0][0];\n c[i][j] %= MOD;\n }\n }\n return c;\n }\n}\n\nint digit(int &pos)\n{\n assert(isdigit(code[pos]));\n return code[pos++] - '0';\n}\n\nMatrix inum(int &pos)\n{\n Matrix ret(1);\n int num = 0;\n while (isdigit(code[pos]))\n {\n num = num * 10 + digit(pos);\n }\n ret[0].push_back(num);\n return ret;\n}\n\nvoid fill(Matrix &ret, Matrix mat, int r, int c)\n{\n rep(i, mat.size())\n {\n rep(j, mat[0].size())\n {\n if (mat[i][j] != -1)\n {\n ret[r + i][c + j] = mat[i][j];\n }\n }\n }\n}\n\nvoid shrink(Matrix &mat)\n{\n assert(!mat.back().empty());\n while (mat.back()[0] == -1)\n {\n mat.pop_back();\n assert(!mat.empty());\n assert(!mat.back().empty());\n }\n rep(i, mat.size())\n {\n assert(!mat[i].empty());\n while (mat[i].back() == -1)\n {\n mat[i].pop_back();\n assert(!mat[i].empty());\n }\n }\n}\n\nMatrix row_seq(int &pos)\n{\n Matrix ret(128, vector<int>(128, -1));\n // debug(pos);\n Matrix m = expr(pos);\n // debug(pos);\n int r = 0, c = 0;\n int width = -1;\n fill(ret, m, r, c);\n while (ret[r][c] != -1)\n c++;\n // debug(pos);\n\n while (code[pos] == ';' || code[pos] == ' ')\n {\n if (code[pos] == ' ')\n {\n pos++;\n // m = expr(pos);\n // fill(ret, m, r, c);\n // while (ret[r][c] != -1)\n // c++;\n }\n else\n {\n pos++;\n if (width == -1)\n width = c;\n else\n assert(width == c);\n c = 0;\n r++;\n while (ret[r][c] != -1)\n {\n c++;\n if (c == width)\n {\n c = 0;\n r++;\n }\n }\n }\n\n m = expr(pos);\n fill(ret, m, r, c);\n while (ret[r][c] != -1)\n c++;\n }\n // print(ret);\n shrink(ret);\n // print(ret);\n return ret;\n}\n\nMatrix matrix(int &pos)\n{\n assert(code[pos] == '[');\n pos++;\n auto ret = row_seq(pos);\n // cerr << code[pos] << endl;\n assert(code[pos] == ']');\n pos++;\n return ret;\n}\n\nMatrix primary(int &pos)\n{\n Matrix ret;\n if (isdigit(code[pos]))\n {\n ret = inum(pos);\n }\n else if (code[pos] == '[')\n {\n ret = matrix(pos);\n }\n else if (code[pos] == '(')\n {\n pos++;\n ret = expr(pos);\n assert(code[pos] == ')');\n pos++;\n }\n else\n {\n ret = var[code[pos]];\n pos++;\n }\n while (code[pos] == '(' || code[pos] == '\\'')\n {\n\n if (code[pos] == '(')\n {\n pos++;\n auto rows = expr(pos);\n assert(code[pos] == ',');\n pos++;\n auto cols = expr(pos);\n assert(rows.size() == 1);\n assert(cols.size() == 1);\n assert(code[pos] == ')');\n pos++;\n Matrix tmp(128, vector<int>(128, -1));\n rep(i, rows[0].size())\n {\n rep(j, cols[0].size())\n {\n tmp[i][j] = ret[rows[0][i] - 1][cols[0][j] - 1];\n }\n }\n ret = tmp;\n shrink(ret);\n }\n else if (code[pos] == '\\'')\n {\n pos++;\n ret = trans(ret);\n }\n }\n\n return ret;\n}\n\nMatrix expr(int &pos)\n{\n Matrix ret = term(pos);\n while (code[pos] == '+' || code[pos] == '-')\n {\n char op = code[pos];\n pos++;\n Matrix m = term(pos);\n addsub(ret, m, op);\n }\n return ret;\n}\n\nMatrix term(int &pos)\n{\n Matrix ret = factor(pos);\n while (code[pos] == '*')\n {\n pos++;\n Matrix m = factor(pos);\n ret = mul(ret, m);\n }\n return ret;\n}\n\nMatrix factor(int &pos)\n{\n if (code[pos] == '-')\n {\n pos++;\n Matrix ret = factor(pos);\n rep(i, ret.size())\n {\n rep(j, ret[0].size())\n {\n ret[i][j] = MOD - ret[i][j];\n }\n }\n return ret;\n }\n return primary(pos);\n}\n\nvoid program(int &pos)\n{\n while (pos < code.size())\n {\n assign(pos);\n }\n}\n\nvoid assign(int &pos)\n{\n char v = code[pos];\n pos++;\n assert(code[pos] == '=');\n pos++;\n var[v] = expr(pos);\n print(var[v]);\n // debug(pos);\n assert(code[pos] == '.');\n pos++;\n}\n\nvoid solve(int n)\n{\n code = \"\";\n rep(i, n)\n {\n string s;\n getline(cin, s);\n code += s;\n }\n // cerr << code << endl;\n int pos = 0;\n program(pos);\n cout << \"-----\" << endl;\n}\n\nint main()\n{\n int n;\n while (cin >> n, cin.ignore(), n)\n {\n solve(n);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3988,"score_of_the_acc":-0.1681,"final_rank":16},{"submission_id":"aoj_1314_6025039","code_snippet":"/*\n ∫ ∫ ∫\n ノヽ\n （＿ ）\n （＿ ）\n（＿＿＿＿＿＿ ）\n ヽ(´･ω･)ﾉ \n | /\n UU\n*/\n#pragma region macro\n#include <iostream>\n#include <string>\n#include <algorithm>\n#include <cctype>\n#include <vector>\n#include <cassert>\n#include <cmath>\n#include <utility>\n#include <tuple>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\ntypedef long long int64;\nusing namespace std;\ntypedef vector<int> vi;\nconst int MOD = 1<<15;\nconst int64 INF = 1LL << 62;\nconst int inf = 1<<30;\nconst char bn = '\\n';\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define ALL(obj) (obj).begin(), (obj).end() //コンテナじゃないと使えない!!\n#define debug(x) cerr << #x << \": \" << (x) << \"\\n\";\n#define mp make_pair\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T> &V){\n int N = V.size();\n REP(i,N){\n os << V[i];\n if (i!=N-1) os << \" \";\n }\n os << \"\\n\";\n return os;\n}\ntemplate <typename T,typename S>\nostream& operator<<(ostream& os, pair<T,S> const&P){\n os << \"(\";\n os << P.first;\n os << \" , \";\n os << P.second;\n os << \")\";\n return os;\n}\ntemplate <typename T,typename S,typename U>\nostream& operator<<(ostream& os, tuple<T,S,U> const& P){\n os << \"(\";\n os << get<0>(P);\n os << \", \";\n os << get<1>(P);\n os << \", \";\n os << get<2>(P);\n os << \")\";\n return os;\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, set<T> &S){\n auto it=S.begin();\n while(it!=S.end()){\n os << *it;\n os << \" \";\n it++;\n }\n os << \"\\n\";\n return os;\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, deque<T> &q){\n for(auto it=q.begin();it<q.end();it++){\n os<<*it;\n os<<\" \";\n }\n os<<endl;\n return os;\n}\ntemplate <typename T,typename S>\nostream& operator<<(ostream& os, map<T,S> const&M){\n for(auto e:M){\n os<<e;\n }\n os<<endl;\n return os;\n}\nvector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};\n#pragma endregion\n//fixed<<setprecision(10)<<ans<<endl;\n\n\nint64 pow(int a,int b,int mod){\n vector<bool> bit;\n for(b=b;b>0;b>>=1){\n bit.push_back(b&1);\n }\n vector<int64> fac(bit.size()); fac[0] = a;\n int64 res = 1;\n for(int i=1;i<bit.size();i++){\n fac[i] = (fac[i-1] * fac[i-1])%mod;\n }\n for(int i=0;i<bit.size();i++){\n if(bit[i]) res*=fac[i];\n res%=mod;\n }\n return res;\n}\n\n\n//mint\nstruct mint {\n int64 x;\n mint(int64 x=0):x((x+2*MOD)%MOD){}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= MOD) x -= MOD;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += MOD-a.x) >= MOD) x -= MOD;\n return *this;\n }\n mint& operator*=(const mint a) {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint operator+(const mint a) const {\n mint res(*this);\n return res+=a;\n }\n mint operator-(const mint a) const {\n mint res(*this);\n return res-=a;\n }\n mint operator*(const mint a) const {\n mint res(*this);\n return res*=a;\n }\n mint pow(int64 t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime MOD\n mint inv() const {\n return pow(MOD-2);\n }\n mint& operator/=(const mint a) {\n return (*this) *= a.inv();\n }\n mint operator/(const mint a) const {\n mint res(*this);\n return res/=a;\n }\n};\nostream& operator<<(ostream& os, mint a){\n os << a.x;\n return os;\n}\n\ntemplate <typename T>\nstruct Matrix{\n vector<vector<T>> matrix_data;\n Matrix(){}\n Matrix(const vector<vector<T>>& matrix_data):matrix_data(matrix_data){}\n Matrix(const T& val):matrix_data(vector<vector<T>>(1, vector<T>(1, val))){} //1*1の行列\n\n //単位行列\n Matrix<T> Identity(size_t N){\n vector<vector<T>> res(N,vector<T>(N,0));\n for(size_t i=0; i<N; i++) res[i][i]=1;\n return Matrix<T>(res);\n }\n\n //累乗O(N^3 log k)\n Matrix<T> power(int64 k){\n Matrix<T> res = Matrix::Identity(matrix_data.size());\n Matrix<T> tmp = *this;\n\n while(k){\n if(k&1){res *= tmp;}\n tmp *= tmp;\n k >>= 1LL;\n }\n return res;\n }\n\n void add_row(Matrix<T> const& A){\n assert(A.matrix_data[0].size() == matrix_data[0].size());\n \n for(auto row:A.matrix_data){\n matrix_data.emplace_back(row);\n }\n }\n\n void add_column(Matrix<T> const& A){\n assert(A.matrix_data.size() == matrix_data.size());\n \n REP(i, A.matrix_data.size()){\n for(auto v:A.matrix_data[i]){\n matrix_data[i].emplace_back(v);\n } \n }\n }\n\n Matrix<T> transpose(){\n vector<vector<T>> res(matrix_data[0].size(), vector<T>(matrix_data.size()));\n REP(i, matrix_data.size()){\n REP(j, matrix_data[0].size()){\n res[j][i] = matrix_data[i][j];\n }\n }\n\n return Matrix<T>(res);\n }\n\n\n};\n\ntemplate <typename T>\nMatrix<T> operator+(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\n assert(mat_a.matrix_data.size() == mat_b.matrix_data.size());\n assert(mat_a.matrix_data[0].size() == mat_b.matrix_data[0].size());\n size_t A = mat_a.matrix_data.size();\n size_t B = mat_b.matrix_data[0].size();\n\n Matrix<T> res = mat_a;\n \n for(size_t i=0; i<A; i++){\n for(size_t j=0; j<B; j++){\n res.matrix_data[i][j] += mat_b.matrix_data[i][j];\n }\n }\n\n return res;\n}\n\ntemplate <typename T>\nMatrix<T>& operator+=(Matrix<T>& mat_a, Matrix<T>& mat_b){\n mat_a = mat_a+mat_b;\n return mat_a;\n}\n\ntemplate <typename T>\nMatrix<T> operator-(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\n assert(mat_a.matrix_data.size() == mat_b.matrix_data.size());\n assert(mat_a.matrix_data[0].size() == mat_b.matrix_data[0].size());\n size_t A = mat_a.matrix_data.size();\n size_t B = mat_b.matrix_data[0].size();\n\n Matrix<T> res = mat_a;\n \n for(size_t i=0; i<A; i++){\n for(size_t j=0; j<B; j++){\n res.matrix_data[i][j] -= mat_b.matrix_data[i][j];\n }\n }\n\n return res;\n}\n\ntemplate <typename T>\nMatrix<T>& operator-=(Matrix<T>& mat_a, Matrix<T>& mat_b){\n mat_a = mat_a-mat_b;\n return mat_a;\n}\n\ntemplate <typename T>\nbool is_scalar_(Matrix<T> const& A){\n return A.matrix_data.size() == 1 and A.matrix_data[0].size() == 1;\n}\n\ntemplate <typename T>\nMatrix<T> operator*(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\n if( is_scalar_(mat_a) ){\n return mat_a.matrix_data[0][0].x * mat_b;\n }else if( is_scalar_(mat_b) ){\n return mat_b.matrix_data[0][0].x * mat_a;\n\n }\n size_t A = mat_a.matrix_data.size();\n size_t B = mat_b.matrix_data.size();\n assert(B > 0);\n size_t C = mat_b.matrix_data[0].size();\n\n Matrix<T> res(vector<vector<T>>(A,vector<T>(C,0)));\n \n for(size_t i=0; i<A; i++){\n assert(mat_a.matrix_data[i].size() == B);\n for(size_t j=0; j<C; j++){\n for(size_t k=0; k<B; k++){\n res.matrix_data[i][j] += mat_a.matrix_data[i][k] * mat_b.matrix_data[k][j];\n }\n }\n }\n\n return res;\n}\n\ntemplate <typename T>\nMatrix<T> operator*(const int& val, const Matrix<T>& mat_a){\n Matrix<T> res = mat_a;\n for(auto&& row: res.matrix_data){\n for(auto&& a:row) a *= val;\n }\n \n return res;\n}\n\ntemplate <typename T>\nMatrix<T>& operator*=(Matrix<T>& mat_a, Matrix<T>& mat_b){\n mat_a = mat_a*mat_b;\n return mat_a;\n}\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const Matrix<T>& M){\n REP(i,M.matrix_data.size()){\n REP(j,M.matrix_data[0].size()){\n os << M.matrix_data[i][j];\n if(j!=M.matrix_data[0].size()-1) os<<\" \";\n }\n os << \"\\n\";\n }\n return os;\n}\n\n\n\nmap<char, Matrix<mint>> matrix_dict;\n\n// 構文解析\n/*\n 構文解析でよくあるバグは次の二つです。\n - begin++をし忘れる\n - getlineとcinの混合\n*/\n\n\ntypedef string::const_iterator State;\nclass ParseError {};\n\n// beginがexpectedを指していたらbeginを一つ進める。\nvoid consume(State &begin, char expected) {\n if (*begin == expected) {\n begin++;\n } else {\n cerr << \"Expected '\" << expected << \"' but got '\" << *begin << \"'\"\n << endl;\n cerr << \"Rest string is '\";\n while (*begin) {\n cerr << *begin++;\n }\n cerr << \"'\" << endl;\n throw ParseError();\n }\n}\nvoid print_rest_string(State begin){\n cerr << \"Rest string is '\";\n while (*begin) {\n cerr << *begin++;\n }\n cerr << \"'\" << endl;\n}\n\nbool is_capital(char C){\n return 'A' <= C and C <= 'Z';\n}\n\nMatrix<mint> expression(State &begin);\nMatrix<mint> term(State &begin);\nMatrix<mint> factor(State &begin);\nMatrix<mint> primary(State &begin);\nMatrix<mint> matrix(State &begin);\nMatrix<mint> row(State &begin);\nMatrix<mint> number(State &begin);\n\n// 四則演算の式をパースして、その評価結果を返す。\nMatrix<mint> expression(State &begin){\n Matrix<mint> res = term(begin);\n\n while(true){\n if(*begin == '+'){\n consume(begin, '+');\n auto tmp = term(begin);\n res += tmp;\n }else if(*begin == '-'){\n consume(begin, '-');\n auto tmp = term(begin);\n res -= tmp;\n }else{\n break;\n }\n }\n\n return res;\n}\n\n// 乗算除算の式をパースして、その評価結果を返す。\nMatrix<mint> term(State &begin){\n Matrix<mint> res = factor(begin);\n \n while(true){\n if(*begin == '*'){\n consume(begin, '*');\n auto tmp = factor(begin);\n res *= tmp;\n }else{\n break;\n }\n }\n\n return res;\n}\n\nMatrix<mint> factor(State &begin){\n Matrix<mint> res;\n if(*begin == '-'){\n consume(begin, '-');\n auto tmp = factor(begin);\n res = (-1) * tmp ;\n }else{\n res = primary(begin);\n }\n return res;\n}\n\nMatrix<mint> primary(State &begin){\n Matrix<mint> res;\n if( isdigit(*begin) ){\n res = number(begin);\n }else if( is_capital(*begin) ){\n res = matrix_dict[*begin++];\n }else if( *begin == '[' ){\n res = matrix(begin);\n }else if( *begin == '(' ){\n consume(begin, '(');\n res = expression(begin);\n consume(begin, ')');\n }else{\n assert(false);\n }\n\n while(true){\n if(*begin == '('){\n consume(begin, '(');\n Matrix<mint> expr1 = expression(begin);\n consume(begin, ',');\n Matrix<mint> expr2 = expression(begin);\n consume(begin, ')');\n\n assert(expr1.matrix_data.size()==1);\n assert(expr2.matrix_data.size()==1);\n\n vector<vector<mint>> res_vec(expr1.matrix_data[0].size(), vector<mint>(expr2.matrix_data[0].size(), 0 ) );\n REP(i, expr1.matrix_data[0].size()){\n REP(j, expr2.matrix_data[0].size()){\n res_vec[i][j] = res.matrix_data[ expr1.matrix_data[0][i].x-1 ][ expr2.matrix_data[0][j].x-1 ];\n }\n }\n res = Matrix<mint>( res_vec );\n }else if(*begin == '\\''){\n consume(begin, '\\'');\n res = res.transpose();\n }else break;\n\n }\n return res;\n}\n\nMatrix<mint> matrix(State &begin){\n consume(begin, '[');\n\n Matrix<mint> res = row(begin);\n\n while(true){\n if(*begin == ';'){\n consume(begin, ';');\n res.add_row( row(begin) );\n }else break;\n }\n\n consume(begin, ']');\n return res;\n}\n\nMatrix<mint> row(State &begin){\n Matrix<mint> res = expression(begin);\n\n while(true){\n if(*begin == ' '){\n consume(begin, ' ');\n res.add_column( expression(begin) );\n }else break;\n }\n\n return res;\n}\n\n// 数字の列をパースして、その数を返す。\nMatrix<mint> number(State &begin){\n int val = 0;\n while(isdigit(*begin)){\n val *= 10;\n val += *begin - '0';\n begin++;\n }\n\n Matrix<mint> res(val);\n return res;\n}\n\nvoid solve(string S){\n State begin = S.begin();\n char var = *begin++;\n consume(begin, '=');\n\n Matrix<mint> ans = expression(begin);\n consume(begin, '.');\n matrix_dict[var] = ans;\n cout << ans;\n}\n\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N;\n string tmp;\n while(getline(cin, tmp)){\n N = stoi(tmp);\n if(N==0) break;\n REP(_, N){\n string S; getline(cin,S);\n // debug(S)\n solve(S);\n }\n cout << \"-----\" << endl;\n }\n \n}","accuracy":1,"time_ms":10,"memory_kb":4008,"score_of_the_acc":-0.1712,"final_rank":17},{"submission_id":"aoj_1314_6021621","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=205,INF=1<<30;\n\n//modintのみ\n\n// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9\n// (based on AtCoder STL)\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n \n namespace internal {\n \n#ifndef _MSC_VER\n template <class T>\n using is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n \n template <class T>\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n \n#else\n \n template <class T> using is_integral = typename std::is_integral<T>;\n \n template <class T>\n using is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n \n#endif\n \n template <class T>\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n \n template <class T>\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n \n template <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n \n } // namespace internal\n \n} // namespace atcoder\n\n#include <utility>\n\nnamespace atcoder {\n \n namespace internal {\n \n constexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n }\n \n struct barrett {\n unsigned int _m;\n unsigned long long im;\n \n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n \n unsigned int umod() const { return _m; }\n \n unsigned int mul(unsigned int a, unsigned int b) const {\n \n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n };\n \n constexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n }\n \n constexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n }\n template <int n> constexpr bool is_prime = is_prime_constexpr(n);\n \n constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n \n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n \n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n \n \n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n }\n \n constexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n }\n template <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n \n } // namespace internal\n \n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n \n namespace internal {\n \n struct modint_base {};\n struct static_modint_base : modint_base {};\n \n template <class T> using is_modint = std::is_base_of<modint_base, T>;\n template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n \n } // namespace internal\n \n template <int m, std::enable_if_t<(1 <= m)>* = nullptr>\n struct static_modint : internal::static_modint_base {\n using mint = static_modint;\n \n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n \n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n \n unsigned int val() const { return _v; }\n \n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n \n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n \n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n \n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n \n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n \n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n };\n \n template <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n \n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n \n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n \n unsigned int val() const { return _v; }\n \n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n \n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n \n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n \n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n \n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n \n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n };\n template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n \n using modint998244353 = static_modint<998244353>;\n using modint1000000007 = static_modint<1000000007>;\n using modint = dynamic_modint<-1>;\n \n namespace internal {\n \n template <class T>\n using is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n \n template <class T>\n using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n \n template <class> struct is_dynamic_modint : public std::false_type {};\n template <int id>\n struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n \n template <class T>\n using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n \n } // namespace internal\n \n} // namespace atcoder\n\nusing mint=atcoder::modint;\n\nusing mat=vector<vector<mint>>;\nusing vec=vector<mint>;\n\nmat TEN;\n\nmat add(mat &a,mat &b){\n assert(si(a)==si(b));\n assert(si(a[0])==si(b[0]));\n mat c(si(a),vec(si(a[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n c[i][j]=a[i][j]+b[i][j];\n }\n }\n return c;\n}\n\nmat sub(mat &a,mat &b){\n assert(si(a)==si(b));\n assert(si(a[0])==si(b[0]));\n mat c(si(a),vec(si(a[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n c[i][j]=a[i][j]-b[i][j];\n }\n }\n return c;\n}\n\nmat mul(mat &a,mat &b){\n if(si(a[0])==si(b)){\n mat c(si(a),vec(si(b[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n for(int k=0;k<si(a[0]);k++){\n c[i][j]+=a[i][k]*b[k][j];\n }\n }\n }\n return c;\n }else if(si(b)==1&&si(b[0])==1){\n mat c(si(a),vec(si(a[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n c[i][j]=a[i][j]*b[0][0];\n }\n }\n return c;\n }else if(si(a)==1&&si(a[0])==1){\n mat c(si(b),vec(si(b[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n c[i][j]=b[i][j]*a[0][0];\n }\n }\n return c;\n }else{\n assert(false);\n return TEN;\n }\n}\n\nmat neg(mat &a){\n mat c(si(a),vec(si(a[0])));\n for(int i=0;i<si(c);i++){\n for(int j=0;j<si(c[0]);j++){\n c[i][j]=-a[i][j];\n }\n }\n return c;\n}\n\nmap<char,mat> MA;\nstring S;\n\nmat assignment(int &j);\nchar var(int &j);\nmat var2(int &j);\nmat expr(int &j);\nmat term(int &j);\nmat factor(int &j);\nmat primary(int &j);\nmat primary_sub(int &j);\nmat matrix(int &j);\nmat row_seq(int &j);\nmat row(int &j);\nmat inum(int &j);\nmat digit(int &j);\n\nmat assignment(int &j){\n char c=var(j);\n assert(S[j]=='=');\n j++;\n auto res=expr(j);\n assert(S[j]=='.');\n return MA[c]=res;\n}\n\nchar var(int &j){\n char res=S[j];\n j++;\n return res;\n}\n\nmat var2(int &j){\n char c=S[j];\n assert(MA.count(c));\n j++;\n return MA[c];\n}\n\nmat expr(int &j){\n auto res=term(j);\n while(j<si(S)){\n char c=S[j];\n if(c=='+'){\n j++;\n auto X=term(j);\n res=add(res,X);\n }else if(c=='-'){\n j++;\n auto X=term(j);\n res=sub(res,X);\n }else{\n break;\n }\n }\n return res;\n}\n\nmat term(int &j){\n auto res=factor(j);\n while(j<si(S)){\n char c=S[j];\n if(c=='*'){\n j++;\n auto X=factor(j);\n res=mul(res,X);\n }else{\n break;\n }\n }\n return res;\n}\n\nmat factor(int &j){\n if(S[j]=='-'){\n j++;\n auto res=factor(j);\n return neg(res);\n }else{\n return primary(j);\n }\n}\n\nmat primary(int &j){\n auto res=primary_sub(j);\n while(j<si(S)){\n if(S[j]=='('){\n j++;\n auto H=expr(j);\n assert(S[j]==',');\n j++;\n auto W=expr(j);\n assert(S[j]==')');\n j++;\n mat X(si(H[0]),vec(si(W[0])));\n for(int h=0;h<si(H[0]);h++){\n for(int w=0;w<si(W[0]);w++){\n X[h][w]=res[H[0][h].val()-1][W[0][w].val()-1];\n }\n }\n res=X;\n }else if(S[j]=='\\''){\n j++;\n mat X(si(res[0]),vec(si(res)));\n for(int h=0;h<si(res);h++){\n for(int w=0;w<si(res[0]);w++){\n X[w][h]=res[h][w];\n }\n }\n res=X;\n }else{\n break;\n }\n }\n \n return res;\n}\n\nmat primary_sub(int &j){\n if('0'<=S[j]&&S[j]<='9'){\n return inum(j);\n }else if('A'<=S[j]&&S[j]<='Z'){\n return var2(j);\n }else if(S[j]=='['){\n return matrix(j);\n }else if(S[j]=='('){\n j++;\n auto res=expr(j);\n assert(S[j]==')');\n j++;\n return res;\n }else{\n assert(false);\n return TEN;\n }\n}\n\nmat matrix(int &j){\n j++;\n auto res=row_seq(j);\n assert(S[j]==']');\n j++;\n return res;\n}\n\nmat row_seq(int &j){\n auto res=row(j);\n while(j<si(S)){\n if(S[j]==';'){\n j++;\n auto X=row(j);\n for(int h=0;h<si(X);h++) res.push_back(X[h]);\n }else break;\n }\n return res;\n}\n\nmat row(int &j){\n auto res=expr(j);\n while(j<si(S)){\n if(S[j]==' '){\n j++;\n auto X=expr(j);\n for(int h=0;h<si(X);h++){\n for(int w=0;w<si(X[h]);w++){\n res[h].push_back(X[h][w]);\n }\n }\n }else{\n break;\n }\n }\n return res;\n}\n\nmat inum(int &j){\n mat res=digit(j);\n while(j<si(S)){\n if('0'<=S[j]&&S[j]<='9'){\n res=mul(res,TEN);\n auto X=digit(j);\n res=add(res,X);\n }else{\n break;\n }\n }\n return res;\n}\n\nmat digit(int &j){\n mint a=S[j]-'0';\n mat res={{a}};\n j++;\n return res;\n}\n\nint main() {\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n mint::set_mod(32768);\n \n TEN.push_back({});\n TEN.back().push_back(10);\n \n while(1){\n string N;\n getline(cin,N);\n if(N==\"0\") break;\n int NN=stoi(N);\n MA.clear();\n for(int i=0;i<NN;i++){\n getline(cin,S);\n int j=0;\n auto res=assignment(j);\n for(int h=0;h<si(res);h++){\n for(int w=0;w<si(res[h]);w++){\n if(w) cout<<\" \";\n cout<<res[h][w].val();\n }\n cout<<\"\\n\";\n }\n }\n \n cout<<\"-----\\n\";\n }\n \n}","accuracy":1,"time_ms":10,"memory_kb":3672,"score_of_the_acc":-0.1193,"final_rank":7},{"submission_id":"aoj_1314_5998895","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate< class T >\nstruct Matrix {\n vector< vector< T > > A;\n\n Matrix() {}\n\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\n\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\n\n size_t height() const {\n return (A.size());\n }\n\n size_t width() const {\n return (A[0].size());\n }\n\n inline const vector< T > &operator[](int k) const {\n return (A.at(k));\n }\n\n inline vector< T > &operator[](int k) {\n return (A.at(k));\n }\n\n static Matrix I(size_t n) {\n Matrix mat(n);\n for(int i = 0; i < n; i++) mat[i][i] = 1;\n return (mat);\n }\n\n Matrix &operator+=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] += B[i][j];\n return (*this);\n }\n\n Matrix &operator-=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] -= B[i][j];\n return (*this);\n }\n\n Matrix &operator*=(const Matrix &B) {\n if (B.height() == 1 and B.width() == 1){\n auto res = *this * B[0][0];\n this->A = res.A;\n return (*this);\n }\n\n if (this->height() == 1 and this->width() == 1){\n auto res = (*this)[0][0] * B;\n this->A = res.A;\n return (*this);\n }\n\n size_t n = height(), m = B.width(), p = width();\n assert(p == B.height());\n vector< vector< T > > C(n, vector< T >(m, 0));\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n for(int k = 0; k < p; k++)\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\n A.swap(C);\n return (*this);\n }\n\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(height());\n while(k > 0) {\n if(k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n\n Matrix operator+(const Matrix &B) const {\n return (Matrix(*this) += B);\n }\n\n Matrix operator-(const Matrix &B) const {\n return (Matrix(*this) -= B);\n }\n\n Matrix operator*(const Matrix &B) const {\n if (this->height() == 1 and this->width() == 1)\n return (*this)[0][0] * B;\n return (Matrix(*this) *= B);\n }\n\n Matrix operator^(const long long k) const {\n return (Matrix(*this) ^= k);\n }\n\n Matrix operator*(const T &k) const {\n auto res = Matrix(*this);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix operator*(const T &k, const Matrix &p) {\n auto res = Matrix(p);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.width() == rhs.width());\n Matrix res(lhs.height() + rhs.height(), lhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[lhs.height() + i][j] = rhs[i][j];\n }\n\n return res;\n }\n\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.height() == rhs.height());\n Matrix res(lhs.height(), lhs.width() + rhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[i][lhs.width() + j] = rhs[i][j];\n }\n\n return res;\n }\n\n Matrix t(){\n Matrix res(this->width(), this->height());\n for (int i = 0; i < this->height(); i++){\n for (int j = 0; j < this->width(); j++)\n res[j][i] = (*this)[i][j];\n }\n\n return res;\n }\n\n friend ostream &operator<<(ostream &os, Matrix &p) {\n size_t n = p.height(), m = p.width();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < m; j++) {\n os << p[i][j] << (j + 1 == m ? \"\\n\" : \" \");\n }\n }\n return (os);\n }\n\n\n T determinant() {\n Matrix B(*this);\n assert(width() == height());\n T ret = 1;\n for(int i = 0; i < width(); i++) {\n int idx = -1;\n for(int j = i; j < width(); j++) {\n if(B[j][i] != 0) idx = j;\n }\n if(idx == -1) return (0);\n if(i != idx) {\n ret *= -1;\n swap(B[i], B[idx]);\n }\n ret *= B[i][i];\n T vv = B[i][i];\n for(int j = 0; j < width(); j++) {\n B[i][j] /= vv;\n }\n for(int j = i + 1; j < width(); j++) {\n T a = B[j][i];\n for(int k = 0; k < width(); k++) {\n B[j][k] -= B[i][k] * a;\n }\n }\n }\n return (ret);\n }\n};\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n u64 a;\n\n public:\n\n template <class INT>\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n return modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n return modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n return modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n return modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if (a >= Modulus) {\n a -= Modulus;\n }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if (a < rhs.a) {\n a += Modulus;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\n\n constexpr modint& operator++() noexcept {\n *this += modint(1);\n return *this;\n }\n constexpr modint operator++(int) noexcept {\n modint tmp(*this);\n ++(*this);\n return tmp;\n }\n constexpr modint& operator--() noexcept {\n *this -= modint(1);\n return *this;\n }\n constexpr modint operator--(int) noexcept {\n modint tmp(*this);\n --(*this);\n return tmp;\n }\n constexpr modint operator-() const noexcept {\n return modint(0) - *this;\n }\n\n template <std::uint_fast64_t M>\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\n os << rhs.a;\n return os;\n }\n template <std::uint_fast64_t M>\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\n int64_t tmp;\n is >> tmp;\n rhs = modint(tmp);\n return is;\n }\n\n constexpr modint pow(const u64 k) const noexcept {\n if (k == 0)\n return 1;\n if (k % 2 == 0){\n modint res = pow(k / 2);\n return res * res;\n }\n return pow(k - 1) * modint(*this);\n }\n\n template <typename T>\n operator const T (){return a;}\n\n};\n\nusing mint = modint<32768>;\n\nclass Parser{\n string S;\n int pos = 0;\n map<char, Matrix<mint>> vars;\n public:\n Parser(string T) : S(T){}\n\n void set_s(string s){\n S = s;\n pos = 0;\n }\n\n char peek(){\n // if (pos < S.size())\n // cerr << S[pos] << endl;\n return pos < S.size() ? S[pos] : 'a';\n }\n\n bool is_number(char c){\n return '0' <= c and c <= '9';\n }\n\n bool is_A_to_Z(char c){\n return 'A' <= c and c <= 'Z';\n }\n\n void skip_spaces(){\n while (peek() == ' ')\n pos++;\n }\n\n void next(bool state){\n assert(state);\n pos++;\n }\n\n Matrix<mint> assignment(){\n char var_c = var();\n next(peek() == '=');\n vars[var_c] = expr();\n next(peek() == '.');\n \n return vars[var_c];\n }\n\n char var(){\n char res = peek();\n next('A' <= peek() and peek() <= 'Z');\n return res;\n }\n\n Matrix<mint> expr(){\n Matrix<mint> res = term();\n while (peek() == '+' or peek() == '-'){\n if (peek() == '+'){\n pos++;\n res += term();\n } else if (peek() == '-'){\n pos++;\n res -= term();\n }\n }\n return res;\n }\n\n Matrix<mint> term(){\n Matrix<mint> res = factor();\n while (peek() == '*'){\n pos++;\n res *= factor();\n }\n\n return res;\n }\n\n Matrix<mint> factor(){\n if (peek() == '-'){\n pos++;\n return mint(-1) * factor();\n }\n\n return primary();\n }\n\n Matrix<mint> primary(){\n auto res = Matrix<mint>(1, 1);\n res[0][0] = -1;\n if (is_number(peek())){\n res[0][0] = number();\n } else if (is_A_to_Z(peek())){\n auto v = var();\n res = vars[v];\n } else if (peek() == '['){\n res = matrix();\n } else if (peek() == '('){\n pos++;\n res = expr();\n next(peek() == ')');\n }\n\n while (is_index() or peek() == '\\''){\n if (peek() == '\\''){\n pos++;\n res = res.t();\n } else if (is_index()){\n next(peek() == '(');\n auto left = expr();\n next(peek() == ',');\n auto right = expr();\n next(peek() == ')');\n Matrix<mint> res2(left.width(), right.width());\n for (int i = 0; i < left.width(); i++){\n for (int j = 0; j < right.width(); j++)\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\n }\n res = res2;\n }\n }\n\n return res;\n }\n\n bool is_index(){\n if (peek() != '(')\n return false;\n int c = 0;\n for (int i = pos; i < S.size(); i++){\n if (S[i] == '(')\n c++;\n if (S[i] == ')'){\n c--;\n if (c == 0)\n break;\n }\n if (S[i] == ',' and c == 1)\n return true;\n }\n return false;\n }\n\n Matrix<mint> matrix(){\n next(peek() == '[');\n auto res = row_seq();\n next(peek() == ']');\n return res;\n }\n\n Matrix<mint> row_seq(){\n auto res = row();\n while (peek() == ';'){\n pos++;\n res = concat_v(res, row());\n }\n return res;\n }\n\n Matrix<mint> row(){\n auto res = expr();\n while (peek() == ' '){\n pos++;\n res = concat_w(res, expr());\n }\n return res;\n }\n\n mint number(){\n mint res = 0;\n while (is_number(peek())){\n res = res * 10 + peek() - '0';\n pos++;\n }\n return res;\n }\n};\n\nvoid solve(int n){\n string stash;\n getline(cin, stash);\n Parser parser(\"\");\n for (int i = 0; i < n; i++){\n string s;\n getline(cin, s);\n parser.set_s(s);\n auto res = parser.assignment();\n cout << res;\n }\n puts(\"-----\");\n}\n\nint main(){\n int n;\n while (true){\n cin >> n;\n if (n == 0)\n break;\n solve(n);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3952,"score_of_the_acc":-0.1625,"final_rank":15},{"submission_id":"aoj_1314_5998887","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate< class T >\nstruct Matrix {\n vector< vector< T > > A;\n\n Matrix() {}\n\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\n\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\n\n size_t height() const {\n return (A.size());\n }\n\n size_t width() const {\n return (A[0].size());\n }\n\n inline const vector< T > &operator[](int k) const {\n return (A.at(k));\n }\n\n inline vector< T > &operator[](int k) {\n return (A.at(k));\n }\n\n static Matrix I(size_t n) {\n Matrix mat(n);\n for(int i = 0; i < n; i++) mat[i][i] = 1;\n return (mat);\n }\n\n Matrix &operator+=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] += B[i][j];\n return (*this);\n }\n\n Matrix &operator-=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] -= B[i][j];\n return (*this);\n }\n\n Matrix &operator*=(const Matrix &B) {\n if (B.height() == 1 and B.width() == 1){\n auto res = *this * B[0][0];\n this->A = res.A;\n return (*this);\n }\n\n if (this->height() == 1 and this->width() == 1){\n auto res = (*this)[0][0] * B;\n this->A = res.A;\n return (*this);\n }\n\n size_t n = height(), m = B.width(), p = width();\n assert(p == B.height());\n vector< vector< T > > C(n, vector< T >(m, 0));\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n for(int k = 0; k < p; k++)\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\n A.swap(C);\n return (*this);\n }\n\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(height());\n while(k > 0) {\n if(k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n\n Matrix operator+(const Matrix &B) const {\n return (Matrix(*this) += B);\n }\n\n Matrix operator-(const Matrix &B) const {\n return (Matrix(*this) -= B);\n }\n\n Matrix operator*(const Matrix &B) const {\n if (this->height() == 1 and this->width() == 1)\n return (*this)[0][0] * B;\n return (Matrix(*this) *= B);\n }\n\n Matrix operator^(const long long k) const {\n return (Matrix(*this) ^= k);\n }\n\n Matrix operator*(const T &k) const {\n auto res = Matrix(*this);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix operator*(const T &k, const Matrix &p) {\n auto res = Matrix(p);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.width() == rhs.width());\n Matrix res(lhs.height() + rhs.height(), lhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[lhs.height() + i][j] = rhs[i][j];\n }\n\n return res;\n }\n\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.height() == rhs.height());\n Matrix res(lhs.height(), lhs.width() + rhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[i][lhs.width() + j] = rhs[i][j];\n }\n\n return res;\n }\n\n Matrix t(){\n Matrix res(this->width(), this->height());\n for (int i = 0; i < this->height(); i++){\n for (int j = 0; j < this->width(); j++)\n res[j][i] = (*this)[i][j];\n }\n\n return res;\n }\n\n friend ostream &operator<<(ostream &os, Matrix &p) {\n size_t n = p.height(), m = p.width();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < m; j++) {\n os << p[i][j] << (j + 1 == m ? \"\\n\" : \" \");\n }\n }\n return (os);\n }\n\n\n T determinant() {\n Matrix B(*this);\n assert(width() == height());\n T ret = 1;\n for(int i = 0; i < width(); i++) {\n int idx = -1;\n for(int j = i; j < width(); j++) {\n if(B[j][i] != 0) idx = j;\n }\n if(idx == -1) return (0);\n if(i != idx) {\n ret *= -1;\n swap(B[i], B[idx]);\n }\n ret *= B[i][i];\n T vv = B[i][i];\n for(int j = 0; j < width(); j++) {\n B[i][j] /= vv;\n }\n for(int j = i + 1; j < width(); j++) {\n T a = B[j][i];\n for(int k = 0; k < width(); k++) {\n B[j][k] -= B[i][k] * a;\n }\n }\n }\n return (ret);\n }\n};\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n u64 a;\n\n public:\n\n template <class INT>\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n return modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n return modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n return modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n return modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if (a >= Modulus) {\n a -= Modulus;\n }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if (a < rhs.a) {\n a += Modulus;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\n\n constexpr modint& operator++() noexcept {\n *this += modint(1);\n return *this;\n }\n constexpr modint operator++(int) noexcept {\n modint tmp(*this);\n ++(*this);\n return tmp;\n }\n constexpr modint& operator--() noexcept {\n *this -= modint(1);\n return *this;\n }\n constexpr modint operator--(int) noexcept {\n modint tmp(*this);\n --(*this);\n return tmp;\n }\n constexpr modint operator-() const noexcept {\n return modint(0) - *this;\n }\n\n template <std::uint_fast64_t M>\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\n os << rhs.a;\n return os;\n }\n template <std::uint_fast64_t M>\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\n int64_t tmp;\n is >> tmp;\n rhs = modint(tmp);\n return is;\n }\n\n constexpr modint pow(const u64 k) const noexcept {\n if (k == 0)\n return 1;\n if (k % 2 == 0){\n modint res = pow(k / 2);\n return res * res;\n }\n return pow(k - 1) * modint(*this);\n }\n\n template <typename T>\n operator const T (){return a;}\n\n};\n\nusing mint = modint<32768>;\n\nclass Parser{\n string S;\n int pos = 0;\n map<char, Matrix<mint>> vars;\n public:\n Parser(string T) : S(T){}\n\n void set_s(string s){\n S = s;\n pos = 0;\n }\n\n char peek(){\n // if (pos < S.size())\n // cerr << S[pos] << endl;\n return pos < S.size() ? S[pos] : 'a';\n }\n\n bool is_number(char c){\n return '0' <= c and c <= '9';\n }\n\n bool is_A_to_Z(char c){\n return 'A' <= c and c <= 'Z';\n }\n\n void skip_spaces(){\n while (peek() == ' ')\n pos++;\n }\n\n Matrix<mint> assignment(){\n char var_c = var();\n assert(peek() == '=');\n pos++;\n vars[var_c] = expr();\n assert(peek() == '.');\n pos++;\n\n return vars[var_c];\n }\n\n char var(){\n assert('A' <= peek() and peek() <= 'Z');\n char res = peek();\n pos++;\n return res;\n }\n\n Matrix<mint> expr(){\n Matrix<mint> res = term();\n while (peek() == '+' or peek() == '-'){\n if (peek() == '+'){\n pos++;\n res += term();\n } else if (peek() == '-'){\n pos++;\n res -= term();\n }\n }\n return res;\n }\n\n Matrix<mint> term(){\n Matrix<mint> res = factor();\n while (peek() == '*'){\n pos++;\n res *= factor();\n }\n\n return res;\n }\n\n Matrix<mint> factor(){\n if (peek() == '-'){\n pos++;\n return mint(-1) * factor();\n }\n\n return primary();\n }\n\n Matrix<mint> primary(){\n auto res = Matrix<mint>(1, 1);\n res[0][0] = -1;\n if (is_number(peek())){\n res[0][0] = number();\n } else if (is_A_to_Z(peek())){\n auto v = var();\n res = vars[v];\n } else if (peek() == '['){\n res = matrix();\n } else if (peek() == '('){\n pos++;\n res = expr();\n assert(peek() == ')');\n pos++;\n }\n\n while (is_index() or peek() == '\\''){\n if (peek() == '\\''){\n pos++;\n res = res.t();\n } else if (is_index()){\n assert(peek() == '(');\n pos++;\n auto left = expr();\n assert(peek() == ',');\n pos++;\n auto right = expr();\n assert(peek() == ')');\n pos++;\n Matrix<mint> res2(left.width(), right.width());\n for (int i = 0; i < left.width(); i++){\n for (int j = 0; j < right.width(); j++)\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\n }\n res = res2;\n }\n }\n\n return res;\n }\n\n bool is_index(){\n if (peek() != '(')\n return false;\n int c = 0;\n for (int i = pos; i < S.size(); i++){\n if (S[i] == '(')\n c++;\n if (S[i] == ')'){\n c--;\n if (c == 0)\n break;\n }\n if (S[i] == ',' and c == 1)\n return true;\n }\n return false;\n }\n\n Matrix<mint> matrix(){\n assert(peek() == '[');\n pos++;\n auto res = row_seq();\n assert(peek() == ']');\n pos++;\n return res;\n }\n\n Matrix<mint> row_seq(){\n auto res = row();\n while (peek() == ';'){\n pos++;\n res = concat_v(res, row());\n }\n return res;\n }\n\n Matrix<mint> row(){\n auto res = expr();\n while (peek() == ' '){\n pos++;\n res = concat_w(res, expr());\n }\n return res;\n }\n\n mint number(){\n mint res = 0;\n while (is_number(peek())){\n res = res * 10 + peek() - '0';\n pos++;\n }\n return res;\n }\n};\n\nvoid solve(int n){\n string stash;\n getline(cin, stash);\n Parser parser(\"\");\n for (int i = 0; i < n; i++){\n string s;\n getline(cin, s);\n parser.set_s(s);\n auto res = parser.assignment();\n cout << res;\n }\n puts(\"-----\");\n}\n\nint main(){\n int n;\n while (true){\n cin >> n;\n if (n == 0)\n break;\n solve(n);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3784,"score_of_the_acc":-0.1366,"final_rank":14},{"submission_id":"aoj_1314_5998884","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate< class T >\nstruct Matrix {\n vector< vector< T > > A;\n\n Matrix() {}\n\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\n\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\n\n size_t height() const {\n return (A.size());\n }\n\n size_t width() const {\n return (A[0].size());\n }\n\n inline const vector< T > &operator[](int k) const {\n return (A.at(k));\n }\n\n inline vector< T > &operator[](int k) {\n return (A.at(k));\n }\n\n static Matrix I(size_t n) {\n Matrix mat(n);\n for(int i = 0; i < n; i++) mat[i][i] = 1;\n return (mat);\n }\n\n Matrix &operator+=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] += B[i][j];\n return (*this);\n }\n\n Matrix &operator-=(const Matrix &B) {\n size_t n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n (*this)[i][j] -= B[i][j];\n return (*this);\n }\n\n Matrix &operator*=(const Matrix &B) {\n if (B.height() == 1 and B.width() == 1){\n auto res = *this * B[0][0];\n this->A = res.A;\n return (*this);\n }\n\n if (this->height() == 1 and this->width() == 1){\n auto res = (*this)[0][0] * B;\n this->A = res.A;\n return (*this);\n }\n\n size_t n = height(), m = B.width(), p = width();\n assert(p == B.height());\n vector< vector< T > > C(n, vector< T >(m, 0));\n for(int i = 0; i < n; i++)\n for(int j = 0; j < m; j++)\n for(int k = 0; k < p; k++)\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\n A.swap(C);\n return (*this);\n }\n\n Matrix &operator^=(long long k) {\n Matrix B = Matrix::I(height());\n while(k > 0) {\n if(k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n\n Matrix operator+(const Matrix &B) const {\n return (Matrix(*this) += B);\n }\n\n Matrix operator-(const Matrix &B) const {\n return (Matrix(*this) -= B);\n }\n\n Matrix operator*(const Matrix &B) const {\n if (this->height() == 1 and this->width() == 1)\n return (*this)[0][0] * B;\n return (Matrix(*this) *= B);\n }\n\n Matrix operator^(const long long k) const {\n return (Matrix(*this) ^= k);\n }\n\n Matrix operator*(const T &k) const {\n auto res = Matrix(*this);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix operator*(const T &k, const Matrix &p) {\n auto res = Matrix(p);\n for (int i = 0; i < res.height(); i++){\n for (int j = 0; j < res.width(); j++)\n res[i][j] *= k;\n }\n return res;\n }\n\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.width() == rhs.width());\n Matrix res(lhs.height() + rhs.height(), lhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[lhs.height() + i][j] = rhs[i][j];\n }\n\n return res;\n }\n\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\n assert(lhs.height() == rhs.height());\n Matrix res(lhs.height(), lhs.width() + rhs.width());\n for (int i = 0; i < lhs.height(); i++){\n for (int j = 0; j < lhs.width(); j++)\n res[i][j] = lhs[i][j];\n }\n for (int i = 0; i < rhs.height(); i++){\n for (int j = 0; j < rhs.width(); j++)\n res[i][lhs.width() + j] = rhs[i][j];\n }\n\n return res;\n }\n\n Matrix t(){\n Matrix res(this->width(), this->height());\n for (int i = 0; i < this->height(); i++){\n for (int j = 0; j < this->width(); j++)\n res[j][i] = (*this)[i][j];\n }\n\n return res;\n }\n\n friend ostream &operator<<(ostream &os, Matrix &p) {\n size_t n = p.height(), m = p.width();\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < m; j++) {\n os << p[i][j] << (j + 1 == m ? \"\\n\" : \" \");\n }\n }\n return (os);\n }\n\n\n T determinant() {\n Matrix B(*this);\n assert(width() == height());\n T ret = 1;\n for(int i = 0; i < width(); i++) {\n int idx = -1;\n for(int j = i; j < width(); j++) {\n if(B[j][i] != 0) idx = j;\n }\n if(idx == -1) return (0);\n if(i != idx) {\n ret *= -1;\n swap(B[i], B[idx]);\n }\n ret *= B[i][i];\n T vv = B[i][i];\n for(int j = 0; j < width(); j++) {\n B[i][j] /= vv;\n }\n for(int j = i + 1; j < width(); j++) {\n T a = B[j][i];\n for(int k = 0; k < width(); k++) {\n B[j][k] -= B[i][k] * a;\n }\n }\n }\n return (ret);\n }\n};\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n u64 a;\n\n public:\n\n template <class INT>\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n return modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n return modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n return modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n return modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if (a >= Modulus) {\n a -= Modulus;\n }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if (a < rhs.a) {\n a += Modulus;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\n\n constexpr modint& operator++() noexcept {\n *this += modint(1);\n return *this;\n }\n constexpr modint operator++(int) noexcept {\n modint tmp(*this);\n ++(*this);\n return tmp;\n }\n constexpr modint& operator--() noexcept {\n *this -= modint(1);\n return *this;\n }\n constexpr modint operator--(int) noexcept {\n modint tmp(*this);\n --(*this);\n return tmp;\n }\n constexpr modint operator-() const noexcept {\n return modint(0) - *this;\n }\n\n template <std::uint_fast64_t M>\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\n os << rhs.a;\n return os;\n }\n template <std::uint_fast64_t M>\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\n int64_t tmp;\n is >> tmp;\n rhs = modint(tmp);\n return is;\n }\n\n constexpr modint pow(const u64 k) const noexcept {\n if (k == 0)\n return 1;\n if (k % 2 == 0){\n modint res = pow(k / 2);\n return res * res;\n }\n return pow(k - 1) * modint(*this);\n }\n\n template <typename T>\n operator const T (){return a;}\n\n};\n\nusing mint = modint<32768>;\n\nclass Parser{\n string S;\n int pos = 0;\n map<char, Matrix<mint>> vars;\n public:\n Parser(string T) : S(T){}\n\n void set_s(string s){\n S = s;\n pos = 0;\n }\n\n char peek(){\n // if (pos < S.size())\n // cerr << S[pos] << endl;\n return pos < S.size() ? S[pos] : 'a';\n }\n\n bool is_number(char c){\n return '0' <= c and c <= '9';\n }\n\n bool is_A_to_Z(char c){\n return 'A' <= c and c <= 'Z';\n }\n\n void skip_spaces(){\n while (peek() == ' ')\n pos++;\n }\n\n Matrix<mint> assignment(){\n char var_c = var();\n assert(peek() == '=');\n pos++;\n vars[var_c] = expr();\n assert(peek() == '.');\n pos++;\n\n return vars[var_c];\n }\n\n char var(){\n assert('A' <= peek() and peek() <= 'Z');\n char res = peek();\n pos++;\n return res;\n }\n\n Matrix<mint> expr(){\n Matrix<mint> res = term();\n while (peek() == '+' or peek() == '-'){\n if (peek() == '+'){\n pos++;\n res += term();\n } else if (peek() == '-'){\n pos++;\n res -= term();\n }\n }\n return res;\n }\n\n Matrix<mint> term(){\n Matrix<mint> res = factor();\n while (peek() == '*'){\n pos++;\n res *= factor();\n }\n\n return res;\n }\n\n Matrix<mint> factor(){\n if (peek() == '-'){\n pos++;\n return mint(-1) * factor();\n }\n\n return primary();\n }\n\n Matrix<mint> primary(){\n auto res = Matrix<mint>(1, 1);\n res[0][0] = -1;\n if (is_number(peek())){\n res[0][0] = number();\n } else if (is_A_to_Z(peek())){\n auto v = var();\n res = vars[v];\n } else if (peek() == '['){\n res = matrix();\n }\n\n if (!is_index() and peek() == '('){\n pos++;\n res = expr();\n assert(peek() == ')');\n pos++;\n }\n\n while (is_index() or peek() == '\\''){\n if (peek() == '\\''){\n pos++;\n res = res.t();\n } else if (is_index()){\n assert(peek() == '(');\n pos++;\n auto left = expr();\n assert(peek() == ',');\n pos++;\n auto right = expr();\n assert(peek() == ')');\n pos++;\n Matrix<mint> res2(left.width(), right.width());\n for (int i = 0; i < left.width(); i++){\n for (int j = 0; j < right.width(); j++)\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\n }\n res = res2;\n }\n }\n\n return res;\n }\n\n bool is_index(){\n if (peek() != '(')\n return false;\n int c = 0;\n for (int i = pos; i < S.size(); i++){\n if (S[i] == '(')\n c++;\n if (S[i] == ')'){\n c--;\n if (c == 0)\n break;\n }\n if (S[i] == ',' and c == 1)\n return true;\n }\n return false;\n }\n\n Matrix<mint> matrix(){\n assert(peek() == '[');\n pos++;\n auto res = row_seq();\n assert(peek() == ']');\n pos++;\n return res;\n }\n\n Matrix<mint> row_seq(){\n auto res = row();\n while (peek() == ';'){\n pos++;\n res = concat_v(res, row());\n }\n return res;\n }\n\n Matrix<mint> row(){\n auto res = expr();\n while (peek() == ' '){\n pos++;\n res = concat_w(res, expr());\n }\n return res;\n }\n\n mint number(){\n mint res = 0;\n while (is_number(peek())){\n res = res * 10 + peek() - '0';\n pos++;\n }\n return res;\n }\n};\n\nvoid solve(int n){\n string stash;\n getline(cin, stash);\n Parser parser(\"\");\n for (int i = 0; i < n; i++){\n string s;\n getline(cin, s);\n parser.set_s(s);\n auto res = parser.assignment();\n cout << res;\n }\n puts(\"-----\");\n}\n\nint main(){\n int n;\n while (true){\n cin >> n;\n if (n == 0)\n break;\n solve(n);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3708,"score_of_the_acc":-0.1248,"final_rank":9},{"submission_id":"aoj_1314_5955269","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.10.10 10:33:56 */\n\n#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region modint\n\nconst int mod = (1 << 15);\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\tModInt() : x(0) {}\n\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\tModInt &operator+=(const ModInt &p) {\n\t\tif((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p) {\n\t\tif((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\tModInt operator-() const { return ModInt(-x); }\n\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\tbool operator==(const ModInt &p) const { return x == p.x; }\n\tbool operator!=(const ModInt &p) const { return x != p.x; }\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile(b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\tModInt pow(long long n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\tfriend istream &operator>>(istream &is, ModInt &a) {\n\t\tlong long t;\n\t\tis >> t;\n\t\ta = ModInt<mod>(t);\n\t\treturn (is);\n\t}\n\tstatic int get_mod() { return mod; }\n};\nusing mint = ModInt<mod>;\n\n#pragma endregion\n\nstruct matrix {\n\tint row_size, col_size;\n\tVV<mint> mat;\n\n\tmatrix() = default;\n\tmatrix(int h, int w, mint value = 0) : row_size(h), col_size(w), mat(h, V<mint>(w, value)) {}\n\tmatrix(mint val) : row_size(1), col_size(1), mat(1, V<mint>(1, val)) {}\n\tmatrix(VV<mint> m) : row_size(m.size()), col_size(m[0].size()), mat(m) {}\n\n\tV<mint> &operator[](int idx) { return mat[idx]; }\n\n\tmatrix operator+(matrix right) {\n\t\tassert(row_size == right.row_size && col_size == right.col_size);\n\t\tauto ret = mat;\n\t\trep(i, row_size) rep(j, col_size) { ret[i][j] += right[i][j]; }\n\t\treturn ret;\n\t}\n\n\tmatrix operator-(matrix right) {\n\t\tassert(row_size == right.row_size && col_size == right.col_size);\n\t\tauto ret = mat;\n\t\trep(i, row_size) rep(j, col_size) { ret[i][j] -= right[i][j]; }\n\t\treturn ret;\n\t}\n\n\tmatrix operator*(mint right) {\n\t\tauto ret = mat;\n\t\trep(i, row_size) rep(j, col_size) { ret[i][j] *= right; }\n\t\treturn ret;\n\t}\n\n\tmatrix operator*(matrix right) {\n\t\tif(right.row_size + right.col_size == 2) return *(this) * right[0][0];\n\t\tif(row_size + col_size == 2) return right * mat[0][0];\n\t\tassert(col_size == right.row_size);\n\t\tmatrix ret(row_size, right.col_size);\n\t\trep(i, row_size) rep(k, col_size) rep(j, right.col_size) { ret[i][j] += mat[i][k] * right[k][j]; }\n\t\treturn ret;\n\t}\n\n\tmatrix conjugate_side(matrix right) {\n\t\tassert(row_size == right.row_size);\n\t\tVV<mint> ret = mat;\n\t\trep(r, row_size) {\n\t\t\trep(c, right.col_size) { ret[r].push_back(right[r][c]); }\n\t\t}\n\t\treturn matrix(ret);\n\t}\n\n\tmatrix conjugate_bottom(matrix under) {\n\t\tif(col_size != under.col_size) {\n\t\t\tdebug(mat);\n\t\t\tdebug(under.mat);\n\t\t\tdebug(col_size, under.col_size);\n\t\t\tassert(false);\n\t\t}\n\t\tVV<mint> ret = mat;\n\t\tfoa(v, under.mat) { ret.push_back(v); }\n\t\treturn ret;\n\t}\n\n\tmatrix transpose() {\n\t\tmatrix ret(col_size, row_size);\n\t\trep(i, row_size) rep(j, col_size) ret[j][i] = mat[i][j];\n\t\treturn ret;\n\t}\n\n\tvoid print() {\n\t\trep(i, row_size) {\n\t\t\trep(j, col_size) {\n\t\t\t\tcout << mat[i][j];\n\t\t\t\tif(j == col_size - 1) {\n\t\t\t\t\tcout << dl;\n\t\t\t\t} else\n\t\t\t\t\tcout << sp;\n\t\t\t}\n\t\t}\n\t}\n};\n\nstring s;\nstring::iterator it;\nV<matrix> vars(26);\nstruct parser {\n\tparser() { it = s.begin(); }\n\tvoid consume(const char &c) {\n\t\tif(*it == c) {\n\t\t\tit++;\n\t\t\treturn;\n\t\t}\n\t\tdebug(s);\n\t\tdebug(it - s.begin());\n\t\tdebug(\"consumed:\", c);\n\t\tif(it != s.end())\n\t\t\tcerr << \"but in this case\" << '\\'' << *it << '\\'';\n\t\telse\n\t\t\tcerr << \"but in this case, program has ended\";\n\t\tcerr << dl;\n\t\texit(0);\n\t}\n\tmatrix assignment() {\n\t\tint v = var();\n\t\tconsume('=');\n\t\tdebug(\"eq\", v, it - s.begin());\n\t\tmatrix e = expr();\n\t\tdebug(e.mat);\n\t\tconsume('.');\n\t\tassert(it == s.end());\n\t\tvars[v] = e;\n\t\treturn e;\n\t}\n\tmint dig() { return *it++ - '0'; }\n\tmint inum() {\n\t\tmint ret = 0;\n\t\tassert(isdigit(*it));\n\t\twhile(isdigit(*it)) {\n\t\t\tret *= 10;\n\t\t\tret += dig();\n\t\t}\n\t\treturn ret;\n\t}\n\n\tint var() {\n\t\tassert(isalpha(*it));\n\t\treturn *it++ - 'A';\n\t}\n\tmatrix expr() {\n\t\tmatrix ret = term();\n\t\twhile(it != s.end()) {\n\t\t\tif(*it == '+') {\n\t\t\t\tconsume('+');\n\t\t\t\tret = ret + term();\n\t\t\t} else if(*it == '-') {\n\t\t\t\tconsume('-');\n\t\t\t\tret = ret - term();\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tdebug(ret.mat, it - s.begin());\n\t\treturn ret;\n\t}\n\tmatrix term() {\n\t\tmatrix ret = factor();\n\t\twhile(it != s.end() && *it == '*') {\n\t\t\tconsume('*');\n\t\t\tret = ret * factor();\n\t\t}\n\t\tdebug(ret.mat, it - s.begin());\n\t\treturn ret;\n\t}\n\tmatrix factor() {\n\t\tif(*it == '-') {\n\t\t\tconsume('-');\n\t\t\treturn factor() * mint(-1);\n\t\t}\n\t\treturn primary();\n\t}\n\tmatrix primary() {\n\t\tmatrix ret;\n\t\tif(isalpha(*it))\n\t\t\tret = matrix(vars[var()]);\n\t\telse if(isdigit(*it))\n\t\t\tret = inum();\n\t\telse if(*it == '(') {\n\t\t\tconsume('(');\n\t\t\tret = expr();\n\t\t\tconsume(')');\n\t\t} else {\n\t\t\tconsume('[');\n\t\t\tret = row_seq();\n\t\t\tconsume(']');\n\t\t}\n\t\twhile(it != s.end()) {\n\t\t\tif(*it == '\\'') {\n\t\t\t\tconsume('\\'');\n\t\t\t\tret = ret.transpose();\n\t\t\t} else if(*it == '(') {\n\t\t\t\tconsume('(');\n\t\t\t\tmatrix rows = expr();\n\t\t\t\tconsume(',');\n\t\t\t\tmatrix cols = expr();\n\t\t\t\tconsume(')');\n\t\t\t\tassert(rows.row_size == 1);\n\t\t\t\tassert(cols.row_size == 1);\n\t\t\t\tmatrix nxt(rows.col_size, cols.col_size);\n\t\t\t\trep(i, rows.col_size) rep(j, cols.col_size) { nxt[i][j] = ret[(rows[0][i] - 1).x][(cols[0][j] - 1).x]; }\n\t\t\t\tswap(nxt, ret);\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t// mat indexed_primary() {}\n\t// mat transposed_primary() {}\n\tmatrix row_seq() {\n\t\tmatrix ret = row();\n\t\tdebug(ret.mat);\n\t\twhile(it != s.end() && *it == ';') {\n\t\t\tconsume(';');\n\t\t\tret = ret.conjugate_bottom(row());\n\t\t\tdebug(ret.mat);\n\t\t}\n\t\tdebug(ret.mat);\n\t\treturn ret;\n\t}\n\tmatrix row() {\n\t\tmatrix ret = expr();\n\t\twhile(it != s.end() && *it == ' ') {\n\t\t\tconsume(' ');\n\t\t\tret = ret.conjugate_side(expr());\n\t\t}\n\t\tdebug(ret.mat);\n\t\treturn ret;\n\t}\n};\n\nvoid solve(int n) {\n\tcin.ignore();\n\trep(n) {\n\t\tdebug(n);\n\t\tgetline(cin, s);\n\t\tdebug(s);\n\t\tparser ps;\n\t\tps.assignment().print();\n\t}\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n && n) {\n\t\tsolve(n);\n\t\tcout << \"-----\" << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3764,"score_of_the_acc":-0.1335,"final_rank":12},{"submission_id":"aoj_1314_5953886","code_snippet":"#define MOD_TYPE 1\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n//#include <atcoder/all>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\n#if 0\n#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <boost/multiprecision/cpp_int.hpp>\nusing Int = boost::multiprecision::cpp_int;\nusing lld = boost::multiprecision::cpp_dec_float_100;\n#endif\n\n#if 1\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n\n#pragma region Macros\n\nusing ll = long long int;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pld = pair<ld, ld>;\ntemplate <typename Q_type>\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\n#if MOD_TYPE == 1\nconstexpr ll MOD = ll(1e9 + 7);\n#else\n#if MOD_TYPE == 2\nconstexpr ll MOD = 998244353;\n#else\nconstexpr ll MOD = 1000003;\n#endif\n#endif\n\nusing mint = static_modint<MOD>;\nconstexpr int INF = (int)1e9 + 10;\nconstexpr ll LINF = (ll)4e18;\nconstexpr double PI = acos(-1.0);\nconstexpr double EPS = 1e-11;\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\n#define repi(i, n) REPI(i, 0, n)\n#define MP make_pair\n#define MT make_tuple\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << \"\\n\"\n#define all(v) v.begin(), v.end()\n#define NP(v) next_permutation(all(v))\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << setprecision(30) << setiosflags(ios::fixed);\n };\n} io_init;\ntemplate <typename T>\ninline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ninline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ninline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }\ntemplate <typename A, size_t N, typename T>\ninline void Fill(A (&array)[N], const T& val) {\n fill((T*)array, (T*)(array + N), val);\n}\ntemplate <typename T>\nvector<T> compress(vector<T>& v) {\n vector<T> val = v;\n sort(all(val)), val.erase(unique(all(val)), val.end());\n for (auto&& vi : v) vi = lower_bound(all(val), vi) - val.begin();\n return val;\n}\ntemplate <typename T, typename U>\nconstexpr istream& operator>>(istream& is, pair<T, U>& p) noexcept {\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T, typename U>\nconstexpr ostream& operator<<(ostream& os, pair<T, U> p) noexcept {\n os << p.first << \" \" << p.second;\n return os;\n}\nostream& operator<<(ostream& os, mint m) {\n os << m.val();\n return os;\n}\nostream& operator<<(ostream& os, modint m) {\n os << m.val();\n return os;\n}\n\nrandom_device seed_gen;\nmt19937_64 engine(seed_gen());\n\nstruct BiCoef {\n vector<mint> fact_, inv_, finv_;\n BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n for (int i = 2; i < n; i++) {\n fact_[i] = fact_[i - 1] * i;\n inv_[i] = -inv_[MOD % i] * (MOD / i);\n finv_[i] = finv_[i - 1] * inv_[i];\n }\n }\n mint c(ll n, ll k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n - k];\n }\n mint P(ll n, ll k) const noexcept { return c(n, k) * fact_[k]; }\n mint H(ll n, ll k) const noexcept { return c(n + k - 1, k); }\n mint Ch1(ll n, ll k) const noexcept {\n if (n < 0 || k < 0) return 0;\n mint res = 0;\n for (int i = 0; i < n; i++)\n res += c(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);\n return res;\n }\n mint fact(ll n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n mint inv(ll n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n mint finv(ll n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nBiCoef bc(500010);\n\n#pragma endregion\n\ntemplate <typename T>\nvoid icpc(T a) {\n if (!a) exit(0);\n}\ntemplate <typename T, typename U>\nvoid icpc(T a, U end) {\n if (a == end) exit(0);\n}\n\n#pragma region Matrix\n\n// 参考・引用：https://qiita.com/gnbrganchan/items/47118d45b3af9d5ae9a4\n\nusing Type = modint;\n\nstruct Matrix {\n // 行列A\n vector<vector<Type>> A;\n // コンストラクタ:第1引数⇒行数、第2引数⇒列数、第3引数⇒初期値\n Matrix() : A() {}\n Matrix(int h, int w) : A(vector<vector<Type>>(h, vector<Type>(w))) {}\n Matrix(int h, int w, Type d)\n : A(vector<vector<Type>>(h, vector<Type>(w, d))) {}\n Matrix(vector<vector<Type>> A) : A(A) {}\n Matrix(initializer_list<initializer_list<Type>> A) : A(A.begin(), A.end()) {}\n // 添え字アクセス\n vector<Type> operator[](const int i) const { return A[i]; }\n vector<Type>& operator[](const int i) { return A[i]; }\n // 行数・列数\n int r = A.size();\n int c = (A.empty() ? 0 : A[0].size());\n // 行列同士の演算\n Matrix& operator+=(const Matrix& B) {\n assert(c == B.c && r == B.r);\n rep(i, r) rep(j, c) A[i][j] += B[i][j];\n return *this;\n }\n Matrix& operator-=(const Matrix& B) {\n assert(c == B.c && r == B.r);\n rep(i, r) rep(j, c) A[i][j] -= B[i][j];\n return *this;\n }\n Matrix& operator*=(const Matrix& B) {\n if (B.r == 1 and B.c == 1) {\n return (*this) *= B[0][0];\n } else if (r == 1 and c == 1) {\n Type k = A[0][0];\n (*this) = B;\n return (*this) *= k;\n }\n assert(c == B.r);\n Matrix m2(r, B.c, 0);\n rep(i, r) rep(j, B.c) rep(k, c) m2[i][j] += A[i][k] * B[k][j];\n c = B.c;\n rep(i, r) A[i].resize(c);\n rep(i, r) rep(j, c) A[i][j] = m2[i][j];\n return *this;\n }\n Matrix operator+(const Matrix& B) const { return Matrix(*this) += B; }\n Matrix operator-(const Matrix& B) const { return Matrix(*this) -= B; }\n Matrix operator*(const Matrix& B) const { return Matrix(*this) *= B; }\n vector<Type> operator*(const vector<Type>& b) const {\n assert(c == b.size());\n vector<Type> res(r);\n rep(i, r) rep(k, c) res[i] += A[i][k] * b[k];\n return res;\n }\n bool operator==(const Matrix& B) {\n assert(c == B.c && r == B.r);\n bool flg = true;\n rep(i, r) rep(j, c) if (A[i][j] != B[i][j]) flg = false;\n return flg;\n }\n // 行列とスカラの演算\n Matrix& operator+=(const Type& k) {\n rep(i, r) rep(j, c) A[i][j] += k;\n return *this;\n }\n Matrix& operator-=(const Type& k) {\n rep(i, r) rep(j, c) A[i][j] -= k;\n return *this;\n }\n Matrix& operator*=(const Type& k) {\n rep(i, r) rep(j, c) A[i][j] *= k;\n return *this;\n }\n Matrix& operator/=(const Type& k) {\n rep(i, r) rep(j, c) A[i][j] /= k;\n return *this;\n }\n Matrix operator+(const Type& k) const { return Matrix(*this) += k; }\n Matrix operator-(const Type& k) const { return Matrix(*this) -= k; }\n Matrix operator*(const Type& k) const { return Matrix(*this) *= k; }\n Matrix operator/(const Type& k) const { return Matrix(*this) /= k; }\n Matrix operator-() const { return Matrix(*this) *= -1; }\n // 回転（degの数だけ時計回りに90度回転）\n Matrix& rot(int deg) {\n Matrix m2(c, r);\n if (deg == 1 || deg == 3) {\n if (deg == 1) rep(i, r) rep(j, c) m2[j][r - i - 1] = A[i][j];\n if (deg == 3) rep(i, r) rep(j, c) m2[c - j - 1][i] = A[i][j];\n swap(c, r); // 列数と行数を入れ替える\n A.resize(r);\n rep(i, r) A[i].resize(c); //リサイズ\n }\n if (deg == 2) rep(i, r) rep(j, c) m2[r - i - 1][c - j - 1] = A[i][j];\n rep(i, r) rep(j, c) A[i][j] = m2[i][j];\n return *this;\n }\n // 転置\n Matrix& tran() {\n Matrix m2(c, r);\n rep(i, r) rep(j, c) m2[j][i] = A[i][j];\n (*this) = m2;\n return *this;\n }\n // 単位行列\n static Matrix E(int n) {\n Matrix res(n, n);\n rep(i, n) rep(j, n) res[i][j] = i == j;\n return res;\n }\n // 累乗\n Matrix pow(ll n) {\n assert(n >= 0);\n Matrix res = E(r);\n Matrix P = (*this);\n while (n > 0) {\n if (n & 1) res *= P;\n P *= P;\n n >>= 1;\n }\n return res;\n }\n};\n// 出力\nostream& operator<<(ostream& os, Matrix A) noexcept {\n rep(i, A.r) {\n if (i > 0) cout << \"\\n\";\n rep(j, A.c) { cout << A[i][j] << (j + 1 == A.c ? \"\" : \" \"); }\n }\n return os;\n}\n\n#pragma endregion\n\nMatrix A[26];\n\nMatrix var(string&, int&);\nMatrix expr(string&, int&);\nMatrix term(string&, int&);\nMatrix factor(string&, int&);\nMatrix primary(string&, int&);\nMatrix matrix(string&, int&);\nMatrix row_seq(string&, int&);\nMatrix row(string&, int&);\nMatrix inum(string&, int&);\n\nMatrix var(string& s, int& i) {\n assert(isupper(s[i]));\n return A[s[i++] - 'A'];\n}\n\nMatrix expr(string& s, int& i) {\n Matrix S = term(s, i);\n while (i < s.length() and (s[i] == '+' or s[i] == '-')) {\n if (s[i] == '+') {\n i++;\n S += term(s, i);\n } else {\n i++;\n S -= term(s, i);\n }\n }\n return S;\n}\n\nMatrix term(string& s, int& i) {\n Matrix P = factor(s, i);\n while (i < s.length() and s[i] == '*') {\n i++;\n P *= factor(s, i);\n }\n return P;\n}\n\nMatrix factor(string& s, int& i) {\n if (s[i] == '-') {\n i++;\n return -factor(s, i);\n }\n return primary(s, i);\n}\n\n// idnexed, transposed を兼ねる\nMatrix primary(string& s, int& i) {\n Matrix P;\n if (isdigit(s[i])) {\n P = inum(s, i);\n } else if (isupper(s[i])) {\n P = var(s, i);\n } else if (s[i] == '[') {\n P = matrix(s, i);\n } else if (s[i] == '(') {\n i++;\n P = expr(s, i);\n i++;\n }\n while (s[i] == '(' or s[i] == '\\'') {\n if (s[i] == '(') {\n i++;\n Matrix I = expr(s, i);\n assert(s[i++] == ',');\n Matrix J = expr(s, i);\n assert(s[i++] == ')');\n assert(I.r == 1);\n assert(J.r == 1);\n vector<vector<modint>> v;\n Matrix res(I.c, J.c);\n rep(i, I.c) rep(j, J.c) {\n res[i][j] = P.A[I[0][i].val() - 1][J[0][j].val() - 1];\n }\n P = res;\n } else if (s[i] == '\\'') {\n i++;\n P.tran();\n }\n }\n return P;\n}\n\nMatrix matrix(string& s, int& i) {\n assert(s[i++] == '[');\n Matrix res = row_seq(s, i);\n assert(s[i++] == ']');\n return res;\n}\n\nMatrix row_seq(string& s, int& i) {\n Matrix P = row(s, i);\n vector<vector<modint>> v;\n rep(i, P.r) v.push_back(P.A[i]);\n while (i < s.length() and s[i] == ';') {\n i++;\n P = row(s, i);\n assert(v[0].size() == P.c);\n rep(i, P.r) v.push_back(P.A[i]);\n }\n return Matrix(v);\n}\n\nMatrix row(string& s, int& i) {\n Matrix P = expr(s, i);\n vector<vector<modint>> v = P.A;\n while (i < s.length() and s[i] == ' ') {\n i++;\n P = expr(s, i);\n assert(v.size() == P.r);\n rep(i, P.r) {\n rep(j, P.c) { v[i].push_back(P[i][j]); }\n }\n }\n return Matrix(v);\n}\n\n// digit を兼ねる\nMatrix inum(string& s, int& i) {\n modint val = 0;\n while (i < s.length() and isdigit(s[i])) {\n val = val * 10 + s[i] - '0';\n i++;\n }\n return Matrix(1, 1, val);\n}\n\nvoid solve() {\n int n;\n cin >> n;\n cin.ignore();\n icpc(n);\n\n rep(i, n) {\n string s;\n getline(cin, s);\n int num = s[0] - 'A';\n s = s.substr(2);\n s.pop_back();\n int tmp = 0;\n A[num] = expr(s, tmp);\n cout << A[num] << \"\\n\";\n }\n cout << \"-----\\n\";\n}\n\nint main() {\n modint::set_mod(32768);\n while (1) solve();\n}","accuracy":1,"time_ms":100,"memory_kb":9372,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1314_5444999","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nvector<int> getchar_buffer;\nint my_getchar(){\n if(getchar_buffer.size()){\n int res = getchar_buffer.back();\n getchar_buffer.pop_back();\n return res;\n }\n return getchar();\n}\n\nint readInt(){\n int n = 0;\n while(true){\n int c = my_getchar();\n if(c < '0' || '9' < c){\n getchar_buffer.push_back(c);\n break;\n }\n n = n * 10 + (c-'0');\n }\n return n;\n}\n\n\nconst int modmask = 0x7fff;\n\n\nstruct Matrix{\n int H,W;\n vector<int> G;\n Matrix(int h,int w){\n H = h;\n W = w;\n G.assign(H*W,0);\n }\n int* operator[](int y){ return G.data() + (y*W); }\n const int* operator[](int y) const { return G.data() + (y*W); }\n\n void print() const {\n for(int y=0; y<H; y++){\n for(int x=0; x<W; x++){\n if(x) printf(\" \");\n printf(\"%d\",operator[](y)[x]);\n }\n printf(\"\\n\");\n }\n }\n};\n\nMatrix operator+(const Matrix& l, const Matrix& r){\n assert(l.H == r.H);\n assert(l.W == r.W);\n Matrix res(l.H,l.W);\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] + r[y][x]) & modmask;\n return move(res);\n}\nMatrix operator-(const Matrix& l, const Matrix& r){\n assert(l.H == r.H);\n assert(l.W == r.W);\n Matrix res(l.H,l.W);\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] + (modmask+1) - r[y][x]) & modmask;\n return move(res);\n}\nMatrix operator-(const Matrix& r){\n Matrix res(r.H,r.W);\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x] = ((modmask+1) - r[y][x]) & modmask;\n return move(res);\n}\nMatrix operator*(const Matrix& l, const Matrix& r){\n if(l.W == 1 && l.H == 1){\n Matrix res(r.H,r.W);\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x] = (l[0][0] * r[y][x]) & modmask;\n return move(res);\n }\n if(r.W == 1 && r.H == 1){\n Matrix res(l.H,l.W);\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] * r[0][0]) & modmask;\n return move(res);\n }\n assert(l.W == r.H);\n Matrix res(l.H,r.W);\n for(int y=0; y<l.H; y++) for(int j=0; j<l.W; j++) for(int x=0; x<r.W; x++)\n res[y][x] = (res[y][x] + l[y][j] * r[j][x]) & modmask;\n return move(res);\n}\nMatrix matrix_catW(const Matrix& l, const Matrix& r){\n assert(l.H == r.H);\n Matrix res(l.H,l.W+r.W);\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = l[y][x];\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x+l.W] = r[y][x];\n return move(res);\n}\nMatrix matrix_catH(const Matrix& l, const Matrix& r){\n assert(l.W == r.W);\n Matrix res(l.H+r.H,l.W);\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = l[y][x];\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y+l.H][x] = r[y][x];\n return move(res);\n}\nMatrix matrix_trans(const Matrix& l){\n Matrix res(l.W,l.H);\n for(int y=0; y<l.W; y++) for(int x=0; x<l.H; x++) res[y][x] = l[x][y];\n return move(res);\n}\nMatrix matrix_index_primary(const Matrix& l, const Matrix& ipy, const Matrix& ipx){\n assert(ipy.H == 1);\n assert(ipx.H == 1);\n Matrix res(ipy.W,ipx.W);\n for(int y=0; y<ipy.W; y++) for(int x=0; x<ipx.W; x++) res[y][x] = l[ipy[0][y]-1][ipx[0][x]-1];\n return move(res);\n}\n\n\n\nMatrix readExp(const vector<Matrix>& A){\n vector<Matrix> st_operands;\n vector<int> st_operators;\n vector<int> st_primary_state = {0};\n bool prev_primary = false;\n\n auto reduce_operator = [&](int op)->bool{\n if(st_operators.empty()) return false;\n if(st_operators.back() != op) return false;\n st_operators.pop_back();\n //printf(\"reduce_operator(%c)\\n\",(char)op);\n do /* while(0) */ {\n if(op == '['){ break; }\n if(op == '('){ st_primary_state.pop_back(); break; }\n auto r = move(st_operands.back()); st_operands.pop_back();\n if(op == '_'){ st_operands.push_back(-r); continue; }\n auto l = move(st_operands.back()); st_operands.pop_back();\n if(op == ' '){ st_operands.push_back(matrix_catW(l,r)); break; }\n if(op == ';'){ st_operands.push_back(matrix_catH(l,r)); break; }\n if(op == '+'){ st_operands.push_back(l+r); break; }\n if(op == '-'){ st_operands.push_back(l-r); break; }\n if(op == '*'){ st_operands.push_back(l*r); break; }\n if(op == ','){ st_operands.push_back(l*r); break; }\n } while(0);\n return true;\n };\n\n bool done = false;\n while(!done){\n int nxc = my_getchar();\n assert(nxc != '\\n');\n if(nxc == '.'){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n done = true;\n }\n else if(nxc == '('){\n if(prev_primary){\n //printf(\"index primary begins\\n\");\n st_primary_state.push_back(1);\n st_operators.push_back(nxc);\n }\n else{\n st_primary_state.push_back(0);\n st_operators.push_back(nxc);\n }\n prev_primary = false;\n }\n else if(nxc == ','){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n st_primary_state.back() = 2;\n prev_primary = false;\n }\n else if(nxc == ')'){\n if(st_primary_state.back() == 2){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n reduce_operator('(');\n Matrix ipx = move(st_operands.back()); st_operands.pop_back();\n Matrix ipy = move(st_operands.back()); st_operands.pop_back();\n st_operands.back() = matrix_index_primary(st_operands.back(), ipy, ipx);\n prev_primary = true;\n }\n else{\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n reduce_operator('(');\n }\n }\n else if(nxc == ' '){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n while(reduce_operator(' '));\n st_operators.push_back(nxc);\n prev_primary = false;\n }\n else if(nxc == ';'){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n while(reduce_operator(' '));\n while(reduce_operator(';'));\n st_operators.push_back(nxc);\n prev_primary = false;\n }\n else if(nxc == '[') st_operators.push_back(nxc);\n else if(nxc == ']'){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n while(reduce_operator(' '));\n while(reduce_operator(';'));\n reduce_operator('[');\n prev_primary = true;\n }\n else if(nxc == '\\''){\n st_operands.back() = matrix_trans(st_operands.back());\n prev_primary = true;\n }\n else if(nxc == '+'){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n st_operators.push_back(nxc);\n prev_primary = false;\n }\n else if(nxc == '-'){\n if(prev_primary){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n while(reduce_operator('+') || reduce_operator('-'));\n st_operators.push_back(nxc);\n }\n else{\n st_operators.push_back('_');\n }\n prev_primary = false;\n }\n else if(nxc == '*'){\n while(reduce_operator('_'));\n while(reduce_operator('*'));\n st_operators.push_back(nxc);\n prev_primary = false;\n }\n else if('0' <= nxc && nxc <= '9'){\n getchar_buffer.push_back(nxc);\n int nxval = readInt();\n st_operands.push_back(Matrix(1,1));\n st_operands.back()[0][0] = nxval;\n prev_primary = true;\n }\n else if('A' <= nxc && nxc <= 'Z'){\n st_operands.push_back(A[nxc-'A']);\n prev_primary = true;\n }\n /*\n printf(\"############################\\n\");\n for(auto a : st_operands){\n a.print();\n printf(\"- - - - - - - - - - - \\n\");\n }\n for(auto a : st_operators){\n printf(\"%c\",(char)a);\n }\n printf(\"\\n- - - - - - - - - - - \\n\");\n fflush(stdout);\n */\n }\n // printf(\"############################\\n\");\n return move(st_operands.back());\n}\n\n\n\nbool testcase(){\n int n = readInt();\n int newline_after_n = my_getchar(); assert(newline_after_n == '\\n');\n if(n == 0) return false;\n vector<Matrix> A(26,Matrix(1,1));\n for(int i=0; i<n; i++){\n int assign_dst = my_getchar() - 'A';\n int assign_equal = my_getchar(); assert(assign_equal == '=');\n A[assign_dst] = readExp(A);\n A[assign_dst].print();\n int assign_newline = my_getchar(); assert(assign_newline == '\\n');\n }\n printf(\"-----\\n\");\n return true;\n}\n\n\n\nint main(){\n while(testcase());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3608,"score_of_the_acc":-0.1094,"final_rank":4},{"submission_id":"aoj_1314_5379472","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 32768;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\ntypedef complex<ld> Point;\nld dot(Point a, Point b) { return real(conj(a) * b); }\nld cross(Point a, Point b) { return imag(conj(a) * b); }\nnamespace std {\n\tbool operator<(const Point& lhs, const Point& rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nstruct Line {\n\tPoint a, b;\n};\nstruct Circle {\n\tPoint p; ld r;\n};\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//counter clockwise\n\tif (cross(b, c) < -eps)return -1;//clock wise\n\tif (dot(b, c) < 0)return 2;//c--a--b on line\n\tif (norm(b) < norm(c))return -2;//a--b--c on line\n\treturn 0; //a--c--b on line\n}\nbool isis_ss(Line s, Line t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\n\n//点を直線で反転\nPoint rev_lp(Line l, Point p) {\n\tPoint h = proj(l, p);\n\treturn h + h - p;\n}\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\nusing mat = vector<vector<modint>>;\n\nmat memo[26];\n\nmat expr(string& s, int& i);\nmat term(string& s, int& i);\nmat factor(string& s, int& i);\nmat primary(string& s, int& i);\nmat inum(string& s, int& i);\nmat matrix(string& s, int& i);\nmat row_seq(string& s, int& i);\nmat row(string& s, int& i);\n\nmat expr(string& s, int& i) {\n\tmat res = term(s, i);\n\twhile (s[i] == '+' || s[i] == '-') {\n\t\tmodint c = 1; if (s[i] == '-')c = -1;\n\t\ti++;\n\t\tmat nex = term(s, i);\n\t\tassert(res.size() == nex.size() && res[0].size() == nex[0].size());\n\t\trep(i, res.size())rep(j, res[i].size())res[i][j] += c * nex[i][j];\n\t}\n\treturn res;\n}\nmat term(string& s, int& i) {\n\tmat res = factor(s, i);\n\twhile (s[i] == '*') {\n\t\ti++;\n\t\tmat nex = factor(s, i);\n\t\tif (res[0].size() != nex.size()) {\n\t\t\tif (res.size() == 1 && res[0].size() == 1) {\n\t\t\t\tswap(res, nex);\n\t\t\t\trep(i, res.size())rep(j, res[i].size()) {\n\t\t\t\t\tres[i][j] *= nex[0][0];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (nex.size() == 1 && nex[0].size() == 1) {\n\t\t\t\trep(i, res.size())rep(j, res[i].size()) {\n\t\t\t\t\tres[i][j] *= nex[0][0];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tassert(false);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tint n = res.size(), m = nex[0].size();\n\t\t\tmat nres(n, vector<modint>(m));\n\t\t\trep(i, n)rep(j, m) {\n\t\t\t\trep(k, res[i].size()) {\n\t\t\t\t\tnres[i][j] += res[i][k] * nex[k][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tswap(res, nres);\n\t\t}\n\t}\n\treturn res;\n}\nmat factor(string& s, int& i) {\n\tif (s[i] == '-') {\n\t\ti++;\n\t\tmat res = factor(s, i);\n\t\trep(i, res.size())rep(j, res[i].size())res[i][j] *= -1;\n\t\treturn res;\n\t}\n\treturn primary(s, i);\n}\nmat primary(string& s, int& i) {\n\tmat res;\n\tif ('0' <= s[i] && s[i] <= '9') {\n\t\tres = inum(s, i);\n\t}\n\telse if ('A' <= s[i] && s[i] <= 'Z') {\n\t\tres = memo[s[i] - 'A']; i++;\n\t}\n\telse if (s[i] == '[') {\n\t\tres = matrix(s, i);\n\t}\n\telse if (s[i] == '(') {\n\t\ti++;\n\t\tres = expr(s, i);\n\t\ti++;\n\t}\n\telse {\n\t\tcout << s << \" \" << i << \"\\n\";\n\t\tassert(false);\n\t}\n\twhile (s[i] == '(' || s[i] == '\\'') {\n\t\tif (s[i] == '(') {\n\t\t\ti++;\n\t\t\tmat n1 = expr(s, i);\n\t\t\ti++;\n\t\t\tmat n2 = expr(s, i);\n\t\t\ti++;\n\t\t\tassert(n1.size() == 1 && n2.size() == 1);\n\t\t\tint n = n1[0].size();\n\t\t\tint m = n2[0].size();\n\t\t\tmat nres(n, vector<modint>(m));\n\t\t\trep(i, n)rep(j, m) {\n\t\t\t\tint x = n1[0][i] - (modint)1;\n\t\t\t\tint y = n2[0][j] - (modint)1;\n\t\t\t\tassert(x < res.size() && y < res[0].size());\n\t\t\t\tnres[i][j] = res[n1[0][i] - (modint)1][n2[0][j] - (modint)1];\n\t\t\t}\n\t\t\tswap(res, nres);\n\t\t}\n\t\telse {\n\t\t\ti++;\n\t\t\tint n = res.size();\n\t\t\tint m = res[0].size();\n\t\t\tmat nres(m, vector<modint>(n));\n\t\t\trep(i, m)rep(j, n) {\n\t\t\t\tnres[i][j] = res[j][i];\n\t\t\t}\n\t\t\tswap(res, nres);\n\t\t}\n\t}\n\treturn res;\n}\n\n\nmat matrix(string& s, int& i) {\n\ti++;\n\tmat res = row_seq(s, i);\n\ti++;\n\treturn res;\n}\nmat row_seq(string& s, int& i) {\n\tmat res = row(s, i);\n\twhile (s[i] == ';') {\n\t\ti++;\n\t\tmat nex = row(s, i);\n\t\tassert(res[0].size() == nex[0].size());\n\t\trep(j, nex.size())res.push_back(nex[j]);\n\t}\n\treturn res;\n}\nmat row(string& s, int& i) {\n\tmat res = expr(s, i);\n\twhile (s[i] == ' ') {\n\t\ti++;\n\t\tmat nex = expr(s, i);\n\t\tassert(res.size() == nex.size());\n\t\trep(i, res.size()) {\n\t\t\trep(j, nex[i].size()) {\n\t\t\t\tres[i].push_back(nex[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\nmat inum(string& s, int& i) {\n\tmodint val = 0;\n\twhile ('0' <= s[i] && s[i] <= '9') {\n\t\tval = val * (modint)10 + (modint)(s[i] - '0');\n\t\ti++;\n\t}\n\tmat res = { {val} };\n\treturn res;\n}\n\nint n;\nvoid solve() {\n\tstring s;\n\tgetline(cin, s);\n\trep(_, n) {\n\t\tgetline(cin, s);\n\t\tint c = s[0] - 'A';\n\t\ts.erase(s.begin(), s.begin() + 2);\n\t\tint i = 0;\n\t\tmat ans = expr(s, i);\n\t\tmemo[c] = ans;\n\t\trep(i, ans.size()) {\n\t\t\trep(j, ans[i].size()) {\n\t\t\t\tif (j > 0)cout << \" \";\n\t\t\t\tcout << ans[i][j];\n\t\t\t}\n\t\t\tcout << \"\\n\";\n\t\t}\n\t}\n\tcout << \"-----\\n\";\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t;rep(i,t)\n\twhile (cin >> n, n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4048,"score_of_the_acc":-0.1774,"final_rank":18},{"submission_id":"aoj_1314_4973727","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define var auto\n\nconst char newl = '\\n';\n\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) { bool c = a > b; if (c) a = b; return c; }\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) { bool c = a < b; if (c) a = b; return c; }\n\n//BEGIN CUT HERE\ntemplate<typename T, T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T, T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T, T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n//END CUT HERE\n\n//BEGIN CUT HERE\ntemplate<typename K>\nstruct Matrix{\n typedef vector<K> arr;\n typedef vector<arr> mat;\n size_t r, c;\n mat dat;\n\n Matrix(){}\n Matrix(size_t r,size_t c):dat(r,arr(c,K())),r(r),c(c){}\n Matrix(mat dat):dat(dat),r(dat.size()),c(dat[0].size()){}\n\n size_t size() const{return dat.size();}\n bool empty() const{return size()==0;}\n arr& operator[](size_t k){return dat[k];}\n const arr& operator[](size_t k) const {return dat[k];}\n\n const void operator+=(Matrix<K>& b){\n for (int i = 0; i < r; i++){\n for (int j = 0; j < c; j++){\n dat[i][j] += b[i][j];\n }\n }\n }\n const Matrix<K> operator+(Matrix<K>& b){\n var res = Matrix<K>(dat);\n res += b;\n return res;\n }\n const void operator-=(Matrix<K>& b){\n for (int i = 0; i < r; i++){\n for (int j = 0; j < c; j++){\n dat[i][j] -= b[i][j];\n }\n }\n }\n const Matrix<K> operator-(Matrix<K>& b){\n var res = Matrix<K>(dat);\n res -= b;\n return res;\n }\n\n const void operator*=(K& b){\n for (int i = 0; i < r; i++){\n for (int j = 0; j < c; j++){\n dat[i][j] *= b;\n }\n }\n }\n\n static Matrix cross(const Matrix &A,const Matrix &B){\n Matrix res(A.size(),B[0].size());\n for(int i=0;i<(int)A.size();i++)\n for(int j=0;j<(int)B[0].size();j++)\n for(int k=0;k<(int)B.size();k++)\n res[i][j]+=A[i][k]*B[k][j];\n return res;\n }\n\n\n\n Matrix<K> transpose(){\n Matrix<K> res(c, r);\n for (int i = 0; i < r; i++){\n for (int j = 0; j < c; j++){\n res[j][i] = dat[i][j];\n }\n }\n return res;\n }\n};\n//END CUT HERE\n\nusing M = Mint<int, 32768>;\nusing Mat = Matrix<M>;\n\nmap<char, Mat> mats;\n\n//A = expr\npair<char, Mat> assignment(string&, int&);\n//term+term-term+...\nMat expr(string&, int&);\n//primary*primary*...\nMat term(string&, int&);\n//---...\n//num/variable/matrix\n//(transposed or indexed)...\nMat primary(string&, int&);\nMat matrix(string&, int&);\n\npair<char, Mat> assignment(string& s, int& i){\n assert(isalpha(s[i]));\n var variable = s[i];\n i++;\n assert(s[i] == '=');\n i++;\n var value = expr(s, i);\n return pair<char, Mat>(variable, value);\n}\n\nMat expr(string& s, int& i){\n var res = term(s, i);\n while (i < s.size() && (s[i] == '+' || s[i] == '-')){\n var op = s[i];\n i++;\n var nxt = term(s, i);\n res = op == '+' ? res + nxt : res - nxt;\n }\n return res;\n}\n\nMat term(string& s, int& i){\n var res = primary(s, i);\n while (i < s.size() && s[i] == '*'){\n i++;\n var nxt = primary(s, i);\n if (res.r == 1 && res.c == 1){\n nxt *= res.dat[0][0];\n res = nxt;\n }\n else if (nxt.r == 1 && nxt.c == 1){\n res *= nxt.dat[0][0];\n }\n else res = Mat::cross(res, nxt);\n }\n return res;\n}\n\nMat primary(string& s, int& i){\n ll sign = 1;\n while (s[i] == '-'){\n sign *= -1;\n i++;\n }\n Mat res;\n if (isdigit(s[i])){\n ll num = 0;\n while (i < s.size() && isdigit(s[i])){\n num = num * 10 + s[i] - '0';\n i++;\n }\n res = Mat(1, 1);\n res[0][0] = M(num);\n }\n else if (isalpha(s[i])){\n res = mats[s[i]];\n i++;\n }\n else if (s[i] == '('){\n i++;\n res = expr(s, i);\n assert(s[i] == ')'); i++;\n }\n else{\n res = matrix(s, i);\n }\n while (i < s.size()){\n //O(nm) 100*100\n if (s[i] == '\\''){\n res = res.transpose();\n i++;\n continue;\n }\n if (s[i] == '('){\n i++;\n var a = expr(s, i);\n assert(s[i] == ','); i++;\n var b = expr(s, i);\n assert(s[i] == ')'); i++;\n assert(a.r == 1 && b.r == 1);\n\n Mat k(a.c, b.c);\n for (int i = 0; i < k.r; i++){\n for (int j = 0; j < k.c; j++){\n k[i][j] = res[a[0][i].v - 1][b[0][j].v - 1];\n }\n }\n\n res = k;\n continue;\n }\n break;\n }\n for (int i = 0; i < res.r; i++){\n for (int j = 0; j < res.c; j++){\n res[i][j] = res[i][j] * M(sign);\n }\n }\n return res;\n}\n\nMat matrix(string& s, int& i){\n assert(s[i] == '['); i++;\n vector<vector<M>> res;\n while (true){\n int baserow = -1;\n bool isfirst = true;\n while (true){\n var row = expr(s, i);\n if (isfirst){\n baserow = res.size();\n for (int i = 0; i < row.r; i++){\n res.push_back(vector<M>{});\n }\n isfirst = false;\n }\n for (int i = 0; i < row.r; i++){\n for (int j = 0; j < row.c; j++){\n res[baserow + i].emplace_back(row[i][j]);\n }\n }\n if (s[i] == ' '){\n i++;\n continue;\n }\n else break;\n }\n if (s[i] == ';'){\n i++;\n continue;\n }\n else break;\n }\n assert(s[i] == ']'); i++;\n return res;\n}\n\nvoid dump(Mat m){\n for (int i = 0; i < m.r; i++){\n for (int j = 0; j < m.c; j++){\n if (j != 0) cout << \" \";\n cout << m[i][j];\n }\n cout << endl;\n }\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n int n;\n while (cin >> n, n){\n cin.ignore();\n for (int iter = 0; iter < n; iter++){\n string s;\n getline(cin, s);\n int i = 0;\n var [variable, value] = assignment(s, i);\n dump(value);\n mats[variable] = value;\n }\n cout << \"-----\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3672,"score_of_the_acc":-0.1193,"final_rank":7},{"submission_id":"aoj_1314_3179239","code_snippet":"#include <bits/stdc++.h>\n#define MOD 32768LL\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\n\nclass val{\npublic:\n\tmat m;\n\tll v;\n\tint t;\n\tval(){\n\t\tt=0;\n\t\tv=0;\n\t}\n\n\tval(int tt,ll vv){\n\t\tt=tt;\n\t\tv=vv;\n\t}\n\n\tval(mat mm){\n\t\tt=1;\n\t\tm=mm;\n\t\tfor(int i=0;i<m.size();i++){\n\t\t\tfor(int j=0;j<m[0].size();j++){\n\t\t\t\tm[i][j]%=MOD;\n\t\t\t\tif(m[i][j]<0LL)m[i][j]+=MOD;\n\t\t\t}\n\t\t}\n\t}\n\tval(ll vv){\n\t\tv=vv;\n\t\tv%=MOD;\n\t\tif(v<0LL){\n\t\t\tv+=MOD;\n\t\t}\n\t\tt=0;\n\t}\n\tval operator+ (val va){\n\t\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\n\t\t\tva.t=0;\n\t\t\tva.v=va.m[0][0];\n\t\t}\n\t\tif(t==1 && m.size()==1 && m[0].size()==1){\n\t\t\tt=0;\n\t\t\tv=m[0][0];\n\t\t}\n\t\tif(t==0 && va.t==0){\n\t\t\treturn val(va.v+v);\n\t\t}\n\t\tif(t==0 && va.t==1){\n\t\t\tfor(int i=0;i<va.m.size();i++){\n\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\tva.m[i][j]+=v;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(va.m);\n\t\t}\n\t\tif(t==1 && va.t==0){\n\t\t\tfor(int i=0;i<m.size();i++){\n\t\t\t\tfor(int j=0;j<m[0].size();j++){\n\t\t\t\t\tm[i][j]+=va.v;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(m);\n\t\t}\n\t\tif(t==1 && va.t==1){\n\t\t\tfor(int i=0;i<va.m.size();i++){\n\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\tm[i][j]+=va.m[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(m);\n\t\t}\n\t}\n\tval operator- (val va){\n\t\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\n\t\t\tva.t=0;\n\t\t\tva.v=va.m[0][0];\n\t\t}\n\t\tif(t==1 && m.size()==1 && m[0].size()==1){\n\t\t\tt=0;\n\t\t\tv=m[0][0];\n\t\t}\n\t\tif(t==0 && va.t==0){\n\t\t\treturn val(v-va.v);\n\t\t}\n\t\tif(t==0 && va.t==1){\n\t\t\tfor(int i=0;i<va.m.size();i++){\n\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\tva.m[i][j]=v-va.m[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(va.m);\n\t\t}\n\t\tif(t==1 && va.t==0){\n\t\t\tfor(int i=0;i<m.size();i++){\n\t\t\t\tfor(int j=0;j<m[0].size();j++){\n\t\t\t\t\tm[i][j]-=va.v;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(m);\n\t\t}\n\t\tif(t==1 && va.t==1){\n\t\t\tfor(int i=0;i<va.m.size();i++){\n\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\tm[i][j]-=va.m[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(m);\n\t\t}\n\t}\n\tval operator* (val va){\n\t\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\n\t\t\tva.t=0;\n\t\t\tva.v=va.m[0][0];\n\t\t}\n\t\tif(t==1 && m.size()==1 && m[0].size()==1){\n\t\t\tt=0;\n\t\t\tv=m[0][0];\n\t\t}\n\t\tif(t==0 && va.t==0){\n\t\t\treturn val(v*va.v);\n\t\t}\n\t\tif(t==0 && va.t==1){\n\t\t\tfor(int i=0;i<va.m.size();i++){\n\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\tva.m[i][j]=v*va.m[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(va.m);\n\t\t}\n\t\tif(t==1 && va.t==0){\n\t\t\tfor(int i=0;i<m.size();i++){\n\t\t\t\tfor(int j=0;j<m[0].size();j++){\n\t\t\t\t\tm[i][j]*=va.v;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(m);\n\t\t}\n\t\tif(t==1 && va.t==1){\n\t\t\tmat C(m.size(),vec(va.m[0].size()));\n\t\t\tfor(int i=0;i<m.size();i++){\n\t\t\t\tfor(int k=0;k<va.m.size();k++){\n\t\t\t\t\tfor(int j=0;j<va.m[0].size();j++){\n\t\t\t\t\t\tC[i][j]=(C[i][j]+(m[i][k]*va.m[k][j]%MOD))%MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn mat(C);\n\t\t}\n\t}\n};\n\nval v[35];\n\ntypedef string::const_iterator State;\nval expression(State &begin);\n\nint number(State &begin){\n\tint ret=0;\n\twhile(isdigit(*begin)){\n\t\tret*=10;\n\t\tret+=*begin-'0';\n\t\tret%=32768LL;\n\t\tbegin++;\n\t}\n\treturn ret;\n}\n\nval row(State &begin){\n\tval ret=expression(begin);\n\tif(*begin==' '){\n\t\tbegin++;\n\t\tval v2=row(begin);\n\t\t//printf(\"%d %d\\n\",ret.t,v2.t);\n\t\tif(v2.t==0 && ret.t==0){\n\t\t\tret.t=1;\n\t\t\tret.m=mat(1,vec(2));\n\t\t\tret.m[0][0]=ret.v;\n\t\t\tret.m[0][1]=v2.v;\n\t\t}else if(v2.t==0){\n\t\t\tret.m[0].push_back(v2.v);\n\t\t}else if(ret.t==0){\n\t\t\tret.t=1;\n\t\t\tret.m=mat(1,vec(1));\n\t\t\tret.m[0][0]=ret.v;\n\t\t\tfor(int i=0;i<v2.m[0].size();i++){\n\t\t\t\tret.m[0].push_back(v2.m[0][i]);\n\t\t\t}\n\t\t}else if(ret.t==1 && v2.t==1){\n\t\t\t//printf(\"%d %d %d %d\\n\",ret.m.size(),ret.m[0].size(),v2.m.size(),v2.m[0].size());\n\t\t\tfor(int i=0;i<v2.m.size();i++){\n\t\t\t\tfor(int j=0;j<v2.m[i].size();j++){\n\t\t\t\t\tret.m[i].push_back(v2.m[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}else{\n\t\treturn ret;\n\t}\n}\n\nval rowsqr(State &begin){\n\tval ret=row(begin);\n\twhile(1){\n\t\t//cout << \"rs \" << *begin << endl;\n\t\tif(*begin==';'){\n\t\t\tbegin++;\n\t\t\tval v2=rowsqr(begin);\n\t\t\tif(ret.t==0){\n\t\t\t\tret.t=1;\n\t\t\t\tret.m=mat(1,vec(1));\n\t\t\t\tret.m[0][0]=ret.v;\n\t\t\t}\n\t\t\tif(v2.t==0){\n\t\t\t\tret.m.push_back(vec(1,v2.v));\n\t\t\t}else{\n\t\t\t\tfor(int i=0;i<v2.m.size();i++){\n\t\t\t\t\tret.m.push_back(v2.m[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//printf(\"%d %d\\n\",ret.m.size(),ret.m[0].size());\n\t\t}else{\n\t\t\treturn ret;\n\t\t}\n\t}\n\t\n}\n\nval primary(State &begin){\n\tval ret=val(-1,0);\n\twhile(1){\n\t\tif(*begin=='['){\n\t\t\tbegin++;\n\t\t\tret=rowsqr(begin);\n\t\t\tbegin++;\n\t\t}else if((*begin)>='A' && (*begin)<='Z'){\n\t\t\tret=v[(*begin)-'A'];\n\t\t\tbegin++;\n\t\t}else if(*begin=='('){\n\t\t\tbegin++;\n\t\t\tval v1=expression(begin);\n\t\t\tif(*begin==')'){\n\t\t\t\tbegin++;\n\t\t\t\tret=v1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbegin++;\n\t\t\tval v2=expression(begin);\n\t\t\tbegin++;\n\t\t\tval ret2;\n\t\t\tret2.t=1;\n\t\t\tif(ret.t==0){\n\t\t\t\tret.m=mat(1,vec(1,ret.v));\n\t\t\t}\n\t\t\tif(v1.t==0){\n\t\t\t\tv1.m=mat(1,vec(1,v1.v));\n\t\t\t}\n\t\t\tif(v2.t==0){\n\t\t\t\tv2.m=mat(1,vec(1,v2.v));\n\t\t\t}\n\t\t\tret2.m=mat(v1.m[0].size(),vec(v2.m[0].size()));\n\t\t\tfor(int i=0;i<v1.m[0].size();i++){\n\t\t\t\tfor(int j=0;j<v2.m[0].size();j++){\n\t\t\t\t\tret2.m[i][j]=ret.m[v1.m[0][i]-1][v2.m[0][j]-1];\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=ret2;\n\t\t}else if(*begin=='\\''){\n\t\t\tbegin++;\n\t\t\tval ret2;\n\t\t\tret2.t=ret.t;\n\t\t\tif(ret.t==0){\n\t\t\t\tret2.v=ret.v;\n\t\t\t}else if(ret.t==1){\n\t\t\t\tret2.m=mat(ret.m[0].size(),vec(ret.m.size()));\n\t\t\t\tfor(int i=0;i<ret.m.size();i++){\n\t\t\t\t\tfor(int j=0;j<ret.m[0].size();j++){\n\t\t\t\t\t\tret2.m[j][i]=ret.m[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tret=ret2;\n\t\t}else if(isdigit(*begin)){\n\t\t\tret=val(number(begin));\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn ret;\n}\n\nval negation(val ret){\n\tif(ret.t==0){\n\t\tret.v=MOD-ret.v;\n\t\treturn ret;\n\t}else{\n\t\tfor(int i=0;i<ret.m.size();i++){\n\t\t\tfor(int j=0;j<ret.m[i].size();j++){\n\t\t\t\tret.m[i][j]=MOD-ret.m[i][j];\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n}\n\nval factor(State &begin){\n\tif(*begin=='-'){\n\t\tbegin++;\n\t\tval ret=factor(begin);\n\t\treturn negation(ret);\n\t}else{\n\t\treturn primary(begin);\n\t}\n}\n\nval term(State &begin){\n\tval ret=factor(begin);\n\twhile(1){\n\t\tif(*begin=='*'){\n\t\t\tbegin++;\n\t\t\tret=ret*factor(begin);\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn ret;\n}\n\nval expression(State &begin){\n\tval ret=term(begin);\n\twhile(1){\n\t\tif(*begin=='+'){\n\t\t\tbegin++;\n\t\t\tret=ret+term(begin);\n\t\t}else if(*begin=='-'){\n\t\t\tbegin++;\n\t\t\tret=ret-term(begin);\n\t\t}else{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn ret;\n}\n\nint n;\n\nvoid solve(){\n\tfor(int i=0;i<26;i++){\n\t\tv[i].m.clear();\n\t\tv[i].t=0;\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tstring str;\n\t\tgetline(cin,str);\n\t\tState b=str.begin();\n\t\tb++;\n\t\tb++;\n\t\tint pos=str[0]-'A';\n\t\tv[pos]=expression(b);\n\t\tif(v[pos].t==0){\n\t\t\tprintf(\"%lld\\n\",v[pos].v);\n\t\t}else{\n\t\t\tfor(int i=0;i<v[pos].m.size();i++){\n\t\t\t\tfor(int j=0;j<v[pos].m[0].size();j++){\n\t\t\t\t\tprintf(\"%lld%c\",v[pos].m[i][j],j+1==v[pos].m[0].size()?'\\n':' ');\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"-----\\n\");\n}\n\nint main(void){\n\twhile(1){\n\t\tscanf(\"%d%*c\",&n);\n\t\tif(n==0)break;\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3732,"score_of_the_acc":-0.1286,"final_rank":10},{"submission_id":"aoj_1314_3174459","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n//#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define MOD 32768\ntypedef vector<int> V;\ntypedef vector<V> MATRIX;\n\nint N;\nint global_index;\nchar buf[105];\nMATRIX TABLE[26];\n\nMATRIX expr();\n\nMATRIX operator+(const MATRIX &A,const MATRIX &B){\n\n\tint num_row = A.size();\n\tint num_col = A[0].size();\n\n\tMATRIX RET(num_row,V(num_col));\n\n\tfor(int row = 0; row < num_row; row++){\n\t\tfor(int col = 0; col < num_col; col++){\n\t\t\tRET[row][col] = A[row][col]+B[row][col];\n\t\t\tRET[row][col] %= MOD;\n\t\t}\n\t}\n\n\treturn RET;\n}\n\nMATRIX operator-(const MATRIX &A,const MATRIX &B){\n\n\tint num_row = A.size();\n\tint num_col = A[0].size();\n\n\tMATRIX RET(num_row,V(num_col));\n\n\tfor(int row = 0; row < num_row; row++){\n\t\tfor(int col = 0; col < num_col; col++){\n\t\t\tRET[row][col] = A[row][col]-B[row][col];\n\t\t\tRET[row][col] = (RET[row][col]+MOD)%MOD;\n\t\t}\n\t}\n\n\treturn RET;\n}\n\nMATRIX operator*(const MATRIX &A, const MATRIX &B){\n\n\tint num_rowA = A.size();\n\tint num_colA = A[0].size();\n\n\tint num_rowB = B.size();\n\tint num_colB = B[0].size();\n\n\tif(num_rowA == 1 && num_colA == 1){ //Aがスカラー\n\n\t\tMATRIX RET(num_rowB,V(num_colB));\n\n\t\tfor(int row = 0; row < num_rowB; row++){\n\t\t\tfor(int col = 0; col < num_colB; col++){\n\t\t\t\tRET[row][col] = B[row][col]*A[0][0];\n\t\t\t\tRET[row][col] %= MOD;\n\t\t\t}\n\t\t}\n\n\t\treturn RET;\n\n\t}else if(num_rowB == 1 && num_colB == 1){ //Bがスカラー\n\n\t\tMATRIX RET(num_rowA,V(num_colA));\n\n\t\tfor(int row = 0; row < num_rowA; row++){\n\t\t\tfor(int col = 0; col < num_colA; col++){\n\t\t\t\tRET[row][col] = A[row][col]*B[0][0];\n\t\t\t\tRET[row][col] %= MOD;\n\t\t\t}\n\t\t}\n\n\t\treturn RET;\n\n\t}else{\n\n\t\tMATRIX RET(num_rowA,V(num_colB));\n\n\t\tfor(int row = 0; row < num_rowA; row++){\n\t\t\tfor(int col = 0; col < num_colB; col++){\n\t\t\t\tRET[row][col] = 0;\n\t\t\t\tfor(int a = 0; a < num_colA; a++){\n\t\t\t\t\tRET[row][col] += A[row][a]*B[a][col];\n\t\t\t\t\tRET[row][col] %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn RET;\n\t}\n}\n\nMATRIX operator-(const MATRIX &A){\n\n\n\tint num_rowA = A.size();\n\tint num_colA = A[0].size();\n\tMATRIX RET(num_rowA,V(num_colA));\n\n\tfor(int row = 0; row < num_rowA; row++){\n\t\tfor(int col = 0; col < num_colA; col++){\n\t\t\tRET[row][col] = (-A[row][col]+MOD)%MOD;\n\t\t}\n\t}\n\treturn RET;\n}\n\nMATRIX transpose(MATRIX A){\n\n\tint num_row = A[0].size();\n\tint num_col = A.size();\n\n\tMATRIX RET(num_row,V(num_col));\n\n\tfor(int row = 0; row < A.size(); row++){\n\t\tfor(int col = 0; col < A[0].size(); col++){\n\t\t\tRET[col][row] = A[row][col];\n\t\t}\n\t}\n\n\treturn RET;\n}\n\nMATRIX get_row(){\n\n\tMATRIX A = expr();\n\n\twhile(buf[global_index] == ' '){\n\t\tglobal_index++;\n\t\tMATRIX B = expr();\n\t\tfor(int a = 0; a < A.size(); a++){\n\t\t\tA[a].insert(A[a].end(),B[a].begin(),B[a].end());\n\t\t}\n\t}\n\treturn A;\n}\n\n\nMATRIX row_seq(){\n\tMATRIX A = get_row();\n\n\twhile(buf[global_index] == ';'){\n\t\tglobal_index++;\n\t\tMATRIX B = get_row();\n\t\tA.insert(A.end(),B.begin(),B.end());\n\t}\n\n\treturn A;\n}\n\nMATRIX matrix(){\n\n\tglobal_index++;\n\tMATRIX A = row_seq();\n\tglobal_index++;\n\n\treturn A;\n}\n\nMATRIX get_var(){\n\n\tMATRIX RET = TABLE[buf[global_index]-'A'];\n\tglobal_index++;\n\n\treturn RET;\n}\n\nMATRIX inum(){\n\n\tint tmp = 0;\n\n\twhile(buf[global_index] >= '0' && buf[global_index] <= '9'){\n\t\ttmp = 10*tmp+(buf[global_index]-'0');\n\t\ttmp %= MOD;\n\t\tglobal_index++;\n\t}\n\n\tMATRIX RET(1,V(1));\n\n\tRET[0][0] = tmp;\n\n\treturn RET;\n}\n\n\n\nMATRIX primary(){\n\n\tMATRIX A;\n\n\tif(buf[global_index] >= '0' && buf[global_index] <= '9'){\n\n\t\tA = inum();\n\n\t}else if(buf[global_index] >= 'A' && buf[global_index] <= 'Z'){\n\n\t\tA = get_var();\n\n\t}else if(buf[global_index] == '['){\n\n\t\tA = matrix();\n\n\t}else if(buf[global_index] == '('){\n\t\tglobal_index++;\n\t\tA = expr();\n\t\tglobal_index++;\n\t}\n\n\tbool FLG;\n\n\twhile(true){\n\t\tFLG = false;\n\n\t\tif(buf[global_index] == '('){\n\n\t\t\tFLG = true;\n\t\t\tglobal_index++;\n\t\t\tMATRIX B = expr();\n\t\t\tglobal_index++;\n\t\t\tMATRIX C = expr();\n\t\t\tglobal_index++;\n\n\t\t\tint num_row = B[0].size();\n\t\t\tint num_col = C[0].size();\n\n\t\t\tMATRIX TMP(num_row,V(num_col));\n\n\t\t\tfor(int row = 0; row < num_row; row++){\n\t\t\t\tfor(int col = 0; col < num_col; col++){\n\t\t\t\t\tTMP[row][col] = A[B[0][row]-1][C[0][col]-1];\n\t\t\t\t}\n\t\t\t}\n\t\t\tA = TMP;\n\n\t\t}else if(buf[global_index] == '\\''){\n\t\t\tFLG = true;\n\t\t\tglobal_index++;\n\t\t\tA = transpose(A);\n\t\t}\n\n\t\tif(!FLG)break;\n\t}\n\treturn A;\n}\n\n\nMATRIX factor(){\n\n\tif(buf[global_index] == '-'){\n\n\t\tglobal_index++;\n\t\treturn -factor();\n\n\t}else{\n\n\t\treturn primary();\n\t}\n}\n\nMATRIX term(){\n\n\tMATRIX A = factor();\n\n\twhile(buf[global_index] == '*'){\n\t\tglobal_index++;\n\t\tA = A*factor();\n\t}\n\treturn A;\n}\n\nMATRIX expr(){\n\n\tMATRIX A = term();\n\tchar op;\n\n\twhile(buf[global_index] == '+' || buf[global_index] == '-'){\n\n\t\top = buf[global_index++];\n\n\t\tif(op == '+'){\n\n\t\t\tA = A+term();\n\n\t\t}else{\n\n\t\t\tA = A-term();\n\t\t}\n\t}\n\n\treturn A;\n}\n\nvoid assignment(){\n\n\tint type = buf[0]-'A';\n\tglobal_index = 2;\n\tTABLE[type] = expr();\n\n\tglobal_index++;\n}\n\nvoid func(){\n\n\tgetchar();\n\tfor(int loop = 0; loop < N; loop++){\n\t\tfgets(buf,100,stdin);\n\n\t\tassignment();\n\n\t\tMATRIX A = TABLE[buf[0]-'A'];\n\t\tint num_row = A.size();\n\t\tint num_col = A[0].size();\n\n\t\tfor(int row = 0; row < num_row; row++){\n\t\t\tprintf(\"%d\",A[row][0]);\n\t\t\tfor(int col = 1; col < num_col; col++){\n\t\t\t\tprintf(\" %d\",A[row][col]);\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\tprintf(\"-----\\n\");\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.0742,"final_rank":2},{"submission_id":"aoj_1314_2998151","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <map>\n\n#define fprintf(...) void(0)\n\nconst int M=32768;\n\nclass Matrix {\n size_t r=0, c=0;\n std::vector<std::vector<int>> entity;\n \npublic:\n Matrix(): entity(0) {}\n Matrix(int x): r(1), c(1), entity(1, std::vector<int>(1, x)) {}\n Matrix(size_t r, size_t c): r(r), c(c), entity(r, std::vector<int>(c)) {}\n Matrix(const Matrix &oth): r(oth.r), c(oth.c), entity(oth.entity) {}\n Matrix(Matrix &&oth): r(oth.r), c(oth.c), entity(std::move(oth.entity)) {}\n\n Matrix &operator =(const Matrix &oth) {\n r = oth.r;\n c = oth.c;\n entity = oth.entity;\n return *this;\n }\n\n Matrix &operator =(Matrix &&oth) {\n r = oth.r;\n c = oth.c;\n entity = std::move(oth.entity);\n return *this;\n }\n\n Matrix &operator +=(const Matrix &oth) {\n assert(r == oth.r && c == oth.c);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j) {\n entity[i][j] += oth[i][j];\n if (entity[i][j] >= M) entity[i][j] -= M;\n }\n\n return *this;\n }\n\n Matrix operator +(const Matrix &oth) const {\n return Matrix(*this) += oth;\n }\n\n Matrix &operator -=(const Matrix &oth) {\n assert(r == oth.r && c == oth.c);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j) {\n entity[i][j] -= oth[i][j];\n if (entity[i][j] < 0) entity[i][j] += M;\n }\n\n return *this;\n }\n\n Matrix operator -(const Matrix &oth) const {\n return Matrix(*this) -= oth;\n }\n\n Matrix operator *(const Matrix &oth) const {\n if (oth.r == 1 && oth.c == 1) {\n Matrix res(*this);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j)\n res[i][j] = res[i][j]*oth[0][0] % M;\n\n return res;\n }\n if (r == 1 && c == 1) {\n Matrix res(oth);\n for (size_t i=0; i<oth.r; ++i)\n for (size_t j=0; j<oth.c; ++j)\n res[i][j] = res[i][j]*entity[0][0] % M;\n\n return res;\n }\n assert(c == oth.r);\n Matrix res(r, oth.c);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j)\n for (size_t k=0; k<oth.c; ++k) {\n res[i][k] += entity[i][j] * oth[j][k];\n if ((res[i][k] %= M) < 0) res[i][k] += M;\n }\n\n return res;\n }\n\n Matrix &operator *=(const Matrix &oth) {\n Matrix rhs=(*this)*oth;\n return (*this = rhs);\n }\n\n const std::vector<int> &operator [](size_t i) const {\n return entity[i];\n }\n\n std::vector<int> &operator [](size_t i) {\n return entity[i];\n }\n\n Matrix operator [](\n const std::pair<std::vector<int>, std::vector<int>> &ind) const {\n\n size_t ir=ind.first.size(), ic=ind.second.size();\n Matrix res(ir, ic);\n for (size_t i=0; i<ir; ++i)\n for (size_t j=0; j<ic; ++j)\n res[i][j] = entity[ind.first[i]-1][ind.second[j]-1];\n\n return res;\n }\n\n Matrix operator -() const {\n Matrix res(r, c);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j)\n if (entity[i][j])\n res[i][j] = M-entity[i][j];\n\n return res;\n }\n\n Matrix operator ~() const {\n Matrix res(c, r);\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j)\n res[j][i] = entity[i][j];\n\n return res;\n }\n\n size_t row() const {\n return entity.size();\n }\n\n size_t col() const {\n return entity[0].size();\n }\n\n void add_row() {\n entity.emplace_back();\n ++r;\n }\n\n void add_col(size_t i, int x) {\n entity[i].push_back(x);\n if (c < entity[i].size())\n c = entity[i].size();\n }\n\n void output() const {\n for (size_t i=0; i<r; ++i)\n for (size_t j=0; j<c; ++j)\n printf(\"%d%c\", entity[i][j], j+1<c? ' ':'\\n');\n }\n};\n\nMatrix parse(\n const std::string &s, size_t &i, const std::map<char, Matrix> &vars,\n size_t preced=0) {\n\n static const std::vector<std::string> &ops={\"+-\", \"*\"};\n\n fprintf(stderr, \"s[%zu]: %c #%zu\\n\", i, s[i], preced);\n if (preced == ops.size()) {\n if (s[i] == '-') {\n return -parse(s, ++i, vars, preced);\n }\n\n Matrix res;\n if (isdigit(s[i])) {\n int scl=s[i]-'0';\n while (++i < s.length() && isdigit(s[i]))\n scl = scl*10+s[i]-'0';\n if ((scl %= M) < 0) scl += M;\n res = Matrix(scl);\n } else if (isupper(s[i])) {\n res = vars.at(s[i++]);\n } else if (s[i] == '(') {\n res = parse(s, ++i, vars, 0);\n assert(s[i] == ')');\n ++i;\n } else if (s[i] == '[') {\n // tsurai\n ++i;\n size_t r=0, c=0;\n while (s[i] != ']') {\n Matrix tmp=parse(s, i, vars, 0);\n for (size_t ir=0; ir<tmp.row(); ++ir) {\n if (r+ir >= res.row()) res.add_row();\n for (size_t ic=0; ic<tmp.col(); ++ic) {\n // fprintf(stderr, \"r+ir: %zu\\n\", r+ir);\n if (c+ic < res[r+ir].size()) {\n res[r+ir][c+ic] = tmp[ir][ic];\n } else {\n res.add_col(r+ir, tmp[ir][ic]);\n }\n }\n }\n // fprintf(stderr, \"> s[%zu]\\n\", i);\n if (s[i] == ' ') {\n c += tmp.col();\n ++i;\n } else if (s[i] == ';') {\n r = res.row();\n c = 0;\n ++i;\n } else {\n assert(s[i] == ']');\n }\n }\n ++i;\n } else {\n assert(false);\n }\n\n while (s[i] == '\\'' || s[i] == '(') {\n char ch=s[i++];\n if (ch == '\\'') {\n res = ~res;\n } else /* if (ch == '(') */ {\n const std::vector<int> fst=parse(s, i, vars, 0)[0];\n assert(s[i] == ',');\n const std::vector<int> snd=parse(s, ++i, vars, 0)[0];\n assert(s[i] == ')');\n ++i;\n res = res[std::make_pair(fst, snd)];\n }\n }\n // fprintf(stderr, \">> s[%zu]\\n\", i);\n return res;\n }\n\n Matrix lhs=parse(s, i, vars, preced+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\n Matrix rhs=parse(s, ++i, vars, preced+1);\n if (op == '+') {\n lhs += rhs;\n } else if (op == '-') {\n lhs -= rhs;\n } else if (op == '*') {\n lhs *= rhs;\n }\n }\n return lhs;\n}\n\nint testcase_ends() {\n int n;\n scanf(\"%d\", &n);\n if (n == 0) return 1;\n\n std::map<char, Matrix> vars;\n for (int i=0; i<n; ++i) {\n char buf[128];\n scanf(\" %[^\\n]\", buf);\n std::string s=buf;\n fprintf(stderr, \"%s\\n\", s.c_str());\n s.pop_back();\n char lhs=s[0];\n size_t j=2;\n Matrix rhs=parse(s, j, vars);\n //assert(s[j] == '.');\n rhs.output();\n vars[lhs] = rhs;\n }\n printf(\"-----\\n\");\n return 0;\n}\n\nint main() {\n while (!testcase_ends()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":2900,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1314_10908049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int MOD = 32768;\\ntypedef vector<int> List;\\ntypedef vector<vector<int>> Matrix;\\nMatrix variables[26];\\n\\nMatrix parseExpr(const char*& p);\\n\\nvoid skip(const char *&p)\\n{\\n while ( p && *p == ' ' ) p++;\\n}\\nbool consume(const char *&p, char c)\\n{\\n if ( *p && *p == c )\\n {\\n p++;\\n return true;\\n }\\n return false;\\n}\\nMatrix operator +(const Matrix &A, const Matrix &B)\\n{\\n int H = A.size(), W = A[0].size();\\n Matrix ret(H, List(W));\\n for ( int y = 0 ; y < H ; y++ )\\n for ( int x = 0 ; x < W ; x++ )\\n ret[y][x] = (A[y][x] + B[y][x]) % MOD;\\n return ret;\\n}\\nMatrix operator *(const Matrix &A, const Matrix &B)\\n{\\n int Ha = A.size(), Wa = A[0].size();\\n int Hb = B.size(), Wb = B[0].size();\\n\\n if ( Ha == 1 && Wa == 1 )\\n {\\n Matrix ret(Hb, List(Wb));\\n for ( int y = 0 ; y < Hb ; y++ )\\n for ( int x = 0 ; x < Wb ; x++ )\\n ret[y][x] = (A[0][0] * B[y][x]) % MOD;\\n return ret;\\n }\\n if ( Hb == 1 && Wb == 1 )\\n {\\n Matrix ret(Ha, List(Wa));\\n for ( int y = 0 ; y < Ha ; y++ )\\n for ( int x = 0 ; x < Wa ; x++ )\\n ret[y][x] = (A[y][x] * B[0][0]) % MOD;\\n return ret;\\n }\\n\\n Matrix ret(Ha, List(Wb));\\n for ( int y = 0 ; y < Ha ; y++ )\\n for ( int x = 0 ; x < Wb ; x++ )\\n {\\n ret[y][x] = 0;\\n for ( int t = 0 ; t < Wa ; t ++ )\\n ret[y][x] = (ret[y][x] + A[y][t] * B[t][x]) % MOD;\\n }\\n return ret;\\n}\\nMatrix operator -(const Matrix &A, const Matrix &B)\\n{\\n int H = A.size(), W = A[0].size();\\n Matrix ret(H, List(W));\\n for ( int y = 0 ; y < H ; y++ )\\n for ( int x = 0 ; x < W ; x++ )\\n ret[y][x] = (A[y][x] - B[y][x]) % MOD;\\n return ret;\\n}\\nMatrix operator -(const Matrix &A)\\n{\\n int H = A.size(), W = A[0].size();\\n Matrix ret(H, List(W));\\n for ( int y = 0 ; y < H ; y++ )\\n for ( int x = 0 ; x < W ; x++ )\\n ret[y][x] = (-A[y][x] + MOD) % MOD;\\n return ret;\\n}\\nMatrix parseInum(const char*& p)\\n{\\n int val = 0;\\n for ( ; isdigit(*p); p++)\\n {\\n val = val * 10 + (*p - '0');\\n val %= MOD;\\n }\\n return Matrix(1, List(1, val));\\n}\\nMatrix parseRow(const char*& p)\\n{\\n Matrix ret = parseExpr(p);\\n while ( *p )\\n {\\n skip(p);\\n if ( *p == ']' || *p == ';' ) break;\\n auto nxt = parseExpr(p);\\n for ( int y = 0 ; y < ret.size() ; y ++ )\\n for ( auto n: nxt[y] )\\n ret[y].push_back(n);\\n }\\n return ret;\\n}\\nMatrix parseRowSeq(const char*& p)\\n{\\n Matrix ret = parseRow(p);\\n while ( *p )\\n {\\n skip(p);\\n if ( *p == ']') break;\\n consume(p, ';');\\n auto nxt = parseRow(p);\\n for (auto &row: nxt) ret.emplace_back(row);\\n }\\n return ret;\\n}\\nMatrix Transpose(const Matrix &A)\\n{\\n int H = A.size(), W = A[0].size();\\n Matrix ret(W, List(H));\\n for ( int y = 0 ; y < H ; y++ )\\n for ( int x = 0 ; x < W ; x++ )\\n ret[x][y] = A[y][x];\\n return ret;\\n}\\nMatrix parsePrimary(const char*& p) {\\n Matrix ret;\\n skip(p);\\n if (isdigit(*p))\\n ret = parseInum(p);\\n else if (isupper(*p))\\n ret = variables[*p++ - 'A'];\\n else if ( consume(p, '[') )\\n ret = parseRowSeq(p), consume(p, ']');\\n else if ( consume(p, '(') )\\n ret = parseExpr(p), consume(p, ')');\\n\\n while ( true )\\n {\\n if (consume(p, '(') ) // INDEXED_PRIMARY\\n {\\n auto A = parseExpr(p);\\n consume(p, ',');\\n auto B = parseExpr(p);\\n consume(p, ')');\\n\\n Matrix nxt(A[0].size(), List(B[0].size()));\\n for ( int y = 0 ; y < A[0].size() ; y++ )\\n for ( int x = 0 ; x < B[0].size() ; x++ )\\n nxt[y][x] = ret[ A[0][y] - 1 ][ B[0][x] - 1 ];\\n swap(ret, nxt);\\n }\\n else if ( *p == '\\\\'') // TRANSPOSED_PRIMARY\\n {\\n bool isTrans = false;\\n while ( consume(p, '\\\\'') ) isTrans = !isTrans;\\n if ( isTrans ) ret = Transpose(ret);\\n }\\n else break;\\n }\\n return ret;\\n}\\n\\nMatrix parseFactor(const char*& p) {\\n bool neg = false;\\n while ( consume(p, '-') ) neg = !neg;\\n auto ret = parsePrimary(p);\\n return neg ? -ret : ret;\\n}\\n\\nMatrix parseTerm(const char*& p) {\\n auto ret = parseFactor(p);\\n while (consume(p, '*') ) ret = ret * parseFactor(p);\\n return ret;\\n}\\n\\nMatrix parseExpr(const char*& p) {\\n auto ret = parseTerm(p);\\n while (true) {\\n if ( consume(p, '+') ) ret = ret + parseTerm(p);\\n else if ( consume(p, '-') ) ret = ret - parseTerm(p);\\n else break;\\n }\\n return ret;\\n}\\nvoid print(const Matrix &m)\\n{\\n int H = m.size();\\n int W = m[0].size();\\n for ( int y = 0 ; y < H ; y++ )\\n for ( int x = 0 ; x < W ; x++ )\\n cout << ( m[y][x] % MOD + MOD ) % MOD << \\\" \\\\n\\\"[x+1 == W];\\n}\\nvoid sol(int N) {\\n for ( int i = 0 ; i < 26 ; i ++ ) variables[i].clear();\\n\\n string s;\\n for (int i = 0; i < N; i++) {\\n getline(cin, s);\\n int varIndex = s[0] - 'A';\\n while ( !s.empty() && ( s.back() == ' ' || s.back() == '.' ) ) s.pop_back();\\n const char* p = s.c_str() + s.find('=') + 1;\\n variables[varIndex] = parseExpr(p);\\n print(variables[varIndex]);\\n }\\n}\\n\\nint main() {\\n#ifdef AJAVA_DEBUG\\nfreopen(\\\"output.txt\\\", \\\"wt\\\", stdout);\\n#endif\\n cin.tie(nullptr)->sync_with_stdio(false);\\n int N;\\n for ( int i = 0 ; cin >> N && N != 0 ; i ++ )\\n {\\n cin.ignore();\\n sol(N);\\n cout << \\\"-----\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.1001,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1314_9417335\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include<bits/stdc++.h>\\n//#pragma GCC target(\\\"avx,avx2\\\")\\n//#pragma GCC optimize(\\\"O3\\\")\\n//#pragma GCC optimize(\\\"unroll-loops\\\")\\n#ifdef LOCAL\\n#include <debug.hpp>\\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define debug(...) (static_cast<void>(0))\\n#endif\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing pll = pair<ll,ll>;\\nusing pii = pair<int,int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vl>;\\nusing vvvl = vector<vvl>;\\nusing vul = vector<ull>;\\nusing vpii = vector<pii>;\\nusing vvpii = vector<vpii>;\\nusing vpll = vector<pll>;\\nusing vs = vector<string>;\\ntemplate<class T> using pq = priority_queue<T,vector<T>, greater<T>>;\\n#define overload4(_1, _2, _3, _4, name, ...) name\\n#define overload3(a,b,c,name,...) name\\n#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)\\n#define rep2(i, n) for (ll i = 0; i < (n); ++i)\\n#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)\\n#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)\\n#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)\\n#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)\\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\\n#define all1(i) begin(i) , end(i)\\n#define all2(i,a) begin(i) , begin(i) + a\\n#define all3(i,a,b) begin(i) + a , begin(i) + b\\n#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\ntemplate<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }\\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }\\ntemplate<class T> auto min(const T& a){return *min_element(all(a));}\\ntemplate<class T> auto max(const T& a){return *max_element(all(a));}\\ntemplate<class... Ts> void in(Ts&... t);\\n#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)\\n#define VEC(type, name, size) vector<type> name(size); in(name)\\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\\nll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}\\nll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\nbool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}\\nvoid Yes() {cout << \\\"Yes\\\\n\\\";return;}\\nvoid No() {cout << \\\"No\\\\n\\\";return;}\\nvoid YES() {cout << \\\"YES\\\\n\\\";return;}\\nvoid NO() {cout << \\\"NO\\\\n\\\";return;}\\ntemplate <typename T>\\nT floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}\\ntemplate <typename T>\\nT ceil(T x, T y) {return floor(x + y - 1, y);}\\ntemplate <typename T>\\nT bmod(T x, T y) {return x - y * floor(x, y);}\\ntemplate <typename T>\\npair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}\\nnamespace IO{\\n#define VOID(a) decltype(void(a))\\nstruct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;\\ntemplate<int I> struct P : P<I-1>{};\\ntemplate<> struct P<0>{};\\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}\\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} \\n#undef VOID\\n}\\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }\\n#undef unpack\\nconstexpr long double PI = 3.141592653589793238462643383279L;\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};\\n\\n//constexpr int mod = 998244353;\\nconstexpr int mod = 1000000007;\\ntemplate <typename T> \\nstruct Edge {\\n\\tint from, to;\\n\\tT cost;\\n\\tEdge() = default;\\n\\tEdge(int _to, T _cost) : from(-1), to(_to), cost(_cost) {}\\n\\tEdge(int _from, int _to, T _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tbool operator < (const Edge &a) const { return cost < a.cost; }\\n\\tbool operator > (const Edge &a) const { return cost > a.cost; }\\n Edge &operator = (const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, Edge &edge) { return os << edge.to; }\\n};\\ntemplate <typename T>\\nusing Edges = vector<Edge<T>>;\\ntemplate <typename T>\\nusing Wgraph = vector<Edges<T>>;\\nusing Ugraph = vector<vector<int>>;\\nUgraph uinput(int N, int M = -1, bool is_directed = false, int origin = 1) {\\n Ugraph g(N);\\n if (M == -1) M = N - 1;\\n while(M--) {\\n int a,b;\\n cin >> a >> b;\\n a -= origin, b -= origin;\\n g[a].push_back(b);\\n if(!is_directed) g[b].push_back(a);\\n }\\n return g;\\n}\\ntemplate <typename T>\\nWgraph<T> winput(int N, int M = -1, bool is_directed = false,int origin = 1) {\\n Wgraph<T> g(N);\\n if (M == -1) M = N - 1;\\n while(M--) {\\n int a,b;\\n T c;\\n cin >> a >> b >> c;\\n a -= origin, b -= origin;\\n g[a].emplace_back(b,c);\\n if(!is_directed) g[b].emplace_back(a,c);\\n }\\n return g;\\n}\\n#line 2 \\\"library/modint/barrett-reduction.hpp\\\"\\nstruct Barrett {\\n using u32 = unsigned int;\\n using i64 = long long;\\n using u64 = unsigned long long;\\n u32 m;\\n u64 im;\\n Barrett() : m(), im() {}\\n Barrett(int n) : m(n), im(u64(-1) / m + 1) {}\\n constexpr inline i64 quo(u64 n) {\\n u64 x = u64((__uint128_t(n) * im) >> 64);\\n u32 r = n - x * m;\\n return m <= r ? x - 1 : x;\\n }\\n constexpr inline i64 rem(u64 n) {\\n u64 x = u64((__uint128_t(n) * im) >> 64);\\n u32 r = n - x * m;\\n return m <= r ? r + m : r;\\n }\\n constexpr inline pair<i64, int> quorem(u64 n) {\\n u64 x = u64((__uint128_t(n) * im) >> 64);\\n u32 r = n - x * m;\\n if (m <= r) return {x - 1, r + m};\\n return {x, r};\\n }\\n constexpr inline i64 pow(u64 n, i64 p) {\\n u32 a = rem(n), r = m == 1 ? 0 : 1;\\n while (p) {\\n if (p & 1) r = rem(u64(r) * a);\\n a = rem(u64(a) * a);\\n p >>= 1;\\n }\\n return r;\\n }\\n};\\n#line 3 \\\"library/modint/ArbitaryModint.hpp\\\"\\nstruct ArbitraryModint {\\n int x;\\n ArbitraryModint():x(0) {}\\n ArbitraryModint(int64_t y) {\\n int z = y % get_mod();\\n if(z < 0) z += get_mod();\\n x = z;\\n }\\n ArbitraryModint &operator+=(const ArbitraryModint &p) {\\n if((x += p.x) >= get_mod()) x -= get_mod();\\n return *this;\\n }\\n ArbitraryModint &operator-=(const ArbitraryModint &p) {\\n if((x += get_mod() - p.x) >= get_mod()) x -= get_mod();\\n return *this;\\n }\\n ArbitraryModint &operator*=(const ArbitraryModint &p) {\\n x = rem((unsigned long long)x * p.x);\\n return *this;\\n }\\n ArbitraryModint &operator/=(const ArbitraryModint &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n ArbitraryModint operator-() const {return ArbitraryModint(-x);};\\n ArbitraryModint operator+(const ArbitraryModint &p) const{\\n return ArbitraryModint(*this) += p;\\n }\\n ArbitraryModint operator-(const ArbitraryModint &p) const{\\n return ArbitraryModint(*this) -= p;\\n }\\n ArbitraryModint operator*(const ArbitraryModint &p) const{\\n return ArbitraryModint(*this) *= p;\\n }\\n ArbitraryModint operator/(const ArbitraryModint &p) const {\\n return ArbitraryModint(*this) /= p;\\n }\\n bool operator==(const ArbitraryModint &p) {return x == p.x;}\\n bool operator!=(const ArbitraryModint &p) {return x != p.x;}\\n ArbitraryModint inverse() const {\\n int a = x,b = get_mod(),u = 1,v = 0,t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b,b);\\n swap(u -= t * v,v);\\n }\\n return ArbitraryModint(u);\\n }\\n ArbitraryModint pow(int64_t n) const {\\n ArbitraryModint ret(1),mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os,const ArbitraryModint &p) {\\n return os << p.x;\\n }\\n friend istream &operator>>(istream &is,ArbitraryModint &a) {\\n int64_t t;\\n is >> t;\\n a = ArbitraryModint(t);\\n return (is);\\n }\\n int get() const {return x;}\\n inline unsigned int rem(unsigned long long p) {return barrett().rem(p);};\\n static inline Barrett &barrett() {\\n static Barrett b;\\n return b;\\n }\\n static inline int &get_mod() {\\n static int mod = 0;\\n return mod;\\n }\\n static void set_mod(int md) {\\n assert(0 < md && md <= (1LL << 30) - 1);\\n get_mod() = md;\\n barrett() = Barrett(md);\\n }\\n};\\n#line 146 \\\"main.cpp\\\"\\nusing mint = ArbitraryModint;\\nusing vm = vector<mint>;\\nusing vvm = vector<vm>;\\nusing vvvm = vector<vvm>;\\n#line 2 \\\"library/matrix/matrix.hpp\\\"\\ntemplate <class T>\\nstruct Matrix {\\n vector<vector<T>> A;\\n Matrix() = default;\\n Matrix(int n, int m) : A(n, vector<T>(m, T())) {}\\n Matrix(int n) : A(n, vector<T>(n, T())){};\\n int H() const { return A.size(); }\\n int W() const { return A[0].size(); }\\n int size() const { return A.size(); }\\n inline const vector<T> &operator[](int k) const { return A[k]; }\\n inline vector<T> &operator[](int k) { return A[k]; }\\n static Matrix I(int n) {\\n Matrix mat(n);\\n for (int i = 0; i < n; i++) mat[i][i] = 1;\\n return (mat);\\n }\\n Matrix &operator+=(const Matrix &B) {\\n int n = H(), m = W();\\n assert(n == B.H() && m == B.W());\\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n Matrix &operator-=(const Matrix &B) {\\n int n = H(), m = W();\\n assert(n == B.H() && m == B.W());\\n for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n Matrix &operator*=(const Matrix &B) {\\n int n = H(), m = B.W(), p = W();\\n assert(p == B.H());\\n vector<vector<T>> C(n, vector<T>(m, T{}));\\n for (int i = 0; i < n; i++) {\\n for (int k = 0; k < p; k++) {\\n if((*this)[i][k] == 0) continue;\\n for (int j = 0; j < m; j++) C[i][j] += (*this)[i][k] * B[k][j];\\n }\\n }\\n A.swap(C);\\n return (*this);\\n }\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(H());\\n while (k > 0) {\\n if (k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1LL;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\\n Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\\n Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\\n Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\\n bool operator==(const Matrix &B) const {\\n assert(H() == B.H() && W() == B.W());\\n for (int i = 0; i < H(); i++) for (int j = 0; j < W(); j++) {\\n if (A[i][j] != B[i][j]) return false;\\n }\\n return true;\\n }\\n bool operator!=(const Matrix &B) const {\\n assert(H() == B.H() && W() == B.W());\\n for (int i = 0; i < H(); i++) for (int j = 0; j < W(); j++) {\\n if (A[i][j] != B[i][j]) return true;\\n }\\n return false;\\n }\\n friend ostream &operator<<(ostream &os, const Matrix &p) {\\n int n = p.H(), m = p.W();\\n for (int i = 0; i < n; i++) {\\n os << (i ? \\\" \\\" : \\\"\\\") << \\\"[\\\";\\n for (int j = 0; j < m; j++) {\\n os << p[i][j] << (j + 1 == m ? \\\"]\\\\n\\\" : \\\",\\\");\\n }\\n }\\n return (os);\\n }\\n T determinant() const {\\n Matrix B(*this);\\n assert(H() == W());\\n T ret = 1;\\n for (int i = 0; i < H(); i++) {\\n int idx = -1;\\n for (int j = i; j < W(); j++) {\\n if (B[j][i] != 0) {\\n idx = j;\\n break;\\n }\\n }\\n if (idx == -1) return 0;\\n if (i != idx) {\\n ret *= T(-1);\\n swap(B[i], B[idx]);\\n }\\n ret *= B[i][i];\\n T inv = T(1) / B[i][i];\\n for (int j = 0; j < W(); j++) {\\n B[i][j] *= inv;\\n }\\n for (int j = i + 1; j < H(); j++) {\\n T a = B[j][i];\\n if (a == 0) continue;\\n for (int k = i; k < W(); k++) {\\n B[j][k] -= B[i][k] * a;\\n }\\n }\\n }\\n return ret;\\n }\\n};\\n#line 151 \\\"main.cpp\\\"\\nusing T = Matrix<mint>;\\nvector<Matrix<mint>> VAR(26);\\nT term(string &s,int &id);\\nT expression(string &s,int &id);\\nT factor(string &s,int &id);\\nT primary(string &s,int &id);\\nT matrix(string &s,int &id);\\nT row_seq(string &s,int &id);\\nT row(string &s,int &id);\\nmint number(string &s,int &id) {\\n mint ret = 0;\\n while(isdigit(s[id])) {\\n ret *= 10;\\n ret += s[id++] - '0';\\n }\\n return ret;\\n}\\nT row(string &s,int &id) {\\n T ret = expression(s,id);\\n //debug(ret,id,s[id],s);\\n while(1) {\\n if(s[id] == ' ') {\\n id++;\\n T ret2 = expression(s,id);\\n assert(ret.H() == ret2.H());\\n T ret3(ret.H(),ret.W() + ret2.W());\\n rep(i,ret.H()) {\\n rep(j,ret.W()) {\\n ret3[i][j] = ret[i][j];\\n }\\n }\\n rep(i,ret2.H()) {\\n rep(j,ret2.W()) {\\n ret3[i][j + ret.W()] = ret2[i][j];\\n }\\n }\\n swap(ret,ret3);\\n }\\n else break;\\n }\\n return ret;\\n}\\nT row_seq(string &s,int &id) {\\n T ret = row(s,id);\\n while(1) {\\n if(s[id] == ';') {\\n id++;\\n T ret2 = row(s,id);\\n assert(ret.W() == ret2.W());\\n T ret3(ret.H() + ret2.H(),ret.W());\\n rep(i,ret.H()) {\\n rep(j,ret.W()) ret3[i][j] = ret[i][j];\\n }\\n rep(i,ret2.H()) {\\n rep(j,ret2.W()) ret3[i+ret.H()][j] = ret2[i][j];\\n }\\n swap(ret,ret3);\\n }\\n else break;\\n }\\n return ret;\\n}\\nT matrix(string &s,int &id) {\\n assert(s[id] == '[');\\n id++;\\n T ret = row_seq(s,id);\\n //debug(ret);\\n assert(s[id] == ']');\\n id++;\\n return ret;\\n}\\nT primary(string &s,int &id) {\\n T ret;\\n\\tif(isdigit(s[id])) {\\n mint res = number(s,id);\\n ret = Matrix<mint>(1);\\n ret[0][0] = res;\\n }\\n else if('A' <= s[id] && s[id] <= 'Z') {\\n ret = VAR[s[id] - 'A'];\\n id++;\\n }\\n else if(s[id] == '[') {\\n ret = matrix(s,id);\\n }\\n else if(s[id] == '(') {\\n id++;\\n ret = expression(s,id);\\n assert(s[id] == ')');\\n id++;\\n }\\n while(1) {\\n if(s[id] == '(') {\\n id++;\\n T ret2 = expression(s,id);\\n assert(s[id] == ',');\\n id++;\\n T ret3 = expression(s,id);\\n assert(s[id] == ')');\\n id++;\\n T ret4(ret2.W(),ret3.W());\\n rep(i,ret2.W()) {\\n rep(j,ret3.W()) {\\n ret4[i][j] = ret[ret2[0][i].get() - 1][ret3[0][j].get() - 1];\\n }\\n }\\n swap(ret,ret4);\\n }\\n else if(s[id] == '\\\\'') {\\n id++;\\n T ret2(ret.W(),ret.H());\\n rep(i,ret.H()) {\\n rep(j,ret.W()) {\\n ret2[j][i] = ret[i][j];\\n }\\n }\\n swap(ret,ret2);\\n }\\n else break;\\n }\\n return ret;\\n}\\nT factor(string &s,int &id) {\\n\\tint co = 1;\\n\\tT ret;\\n\\tif(s[id] == '-') {\\n\\t\\tco = -1;\\n\\t\\tid++;\\n\\t\\tret = factor(s,id);\\n\\t}\\n\\telse ret = primary(s,id);\\n\\trep(i,ret.H()) {\\n\\t\\trep(j,ret.W()) {\\n\\t\\t\\tret[i][j] *= co;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nT term(string &s,int &id) {\\n T ret = factor(s,id);\\n while(1) {\\n if(s[id] == '*') {\\n id++;\\n T ret2 = factor(s,id);\\n //debug(ret,ret2);\\n if(ret.H() == ret.W() && ret.H() == 1) {\\n rep(i,ret2.H()) {\\n rep(j,ret2.W()) {\\n ret2[i][j] *= ret[0][0];\\n }\\n }\\n swap(ret,ret2);\\n }\\n else if(ret2.H() == ret2.W() && ret2.H() == 1) {\\n rep(i,ret.H()) {\\n rep(j,ret.W()) {\\n ret[i][j] *= ret2[0][0];\\n }\\n }\\n }\\n else ret *= ret2;\\n }\\n else break;\\n }\\n return ret;\\n}\\nT expression(string &s,int &id) {\\n T ret = term(s,id);\\n\\twhile(1) {\\n\\t\\tif(s[id] == '+') {\\n\\t\\t\\tid++;\\n\\t\\t\\tT ret2 = term(s,id);\\n\\t\\t\\tret += ret2;\\n\\t\\t}\\n\\t\\telse if(s[id] == '-') {\\n\\t\\t\\tid++;\\n\\t\\t\\tT ret2 = term(s,id);\\n\\t\\t\\tret -= ret2;\\n\\t\\t}\\n\\t\\telse break;\\n\\t}\\n return ret;\\n}\\n\\nint main() {\\n\\tmint::set_mod(32768);\\n string s,t;\\n\\twhile(1) {\\n\\t\\tgetline(cin,t);\\n int x = stoi(t);\\n\\t\\tif(x == 0) break;\\n\\t\\twhile(x--) {\\n\\t\\t\\tgetline(cin,s);\\n\\t\\t\\tint p = s[0] - 'A';\\n\\t\\t\\tint id = 2;\\n T ret = expression(s,id);\\n VAR[p] = ret;\\n rep(i,ret.H()) {\\n rep(j,ret.W()) {\\n cout << ret[i][j] << \\\" \\\\n\\\"[j == ret.W() - 1];\\n }\\n }\\n\\t\\t}\\n cout << \\\"-----\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.1329,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1314_8458258\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nstruct Matrix {\\n static constexpr int MOD = 32768;\\n std::vector<std::vector<int>> data;\\n\\n Matrix() {}\\n explicit Matrix(int value): data(1, std::vector<int>(1, value)) {}\\n explicit Matrix(int n, int m): data(n, std::vector<int>(m)) {}\\n\\n std::pair<int, int> size() const {\\n return {data.size(), data.front().size()};\\n }\\n\\n friend std::ostream& operator<<(std::ostream& os, const Matrix& mat) {\\n auto [n, m] = mat.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n os << mat.data[i][j];\\n if (j + 1 != m) {\\n os << ' ';\\n }\\n }\\n if (i + 1 != n) {\\n os << '\\\\n';\\n }\\n }\\n return os;\\n }\\n\\n bool is_scalar() const {\\n return data.size() == 1 && data.front().size() == 1;\\n }\\n\\n friend Matrix operator+(const Matrix& lhs, const Matrix& rhs) {\\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\\n if (lhs.is_scalar()) {\\n return lhs.data.front().front() + rhs;\\n } else {\\n return rhs.data.front().front() + lhs;\\n }\\n }\\n\\n auto [n, m] = lhs.size();\\n\\n Matrix res(lhs);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] += rhs.data[i][j];\\n res.data[i][j] %= MOD;\\n }\\n }\\n\\n return res;\\n }\\n\\n friend Matrix operator-(const Matrix& lhs, const Matrix& rhs) {\\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\\n if (lhs.is_scalar()) {\\n return lhs.data.front().front() - rhs;\\n } else {\\n return rhs.data.front().front() - lhs;\\n }\\n }\\n\\n auto [n, m] = lhs.size();\\n\\n Matrix res(lhs);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] -= rhs.data[i][j];\\n res.data[i][j] = (res.data[i][j] + MOD) % MOD;\\n }\\n }\\n\\n return res;\\n }\\n\\n friend Matrix operator*(const Matrix& lhs, const Matrix& rhs) {\\n if (lhs.is_scalar() ^ rhs.is_scalar()) {\\n if (lhs.is_scalar()) {\\n return lhs.data.front().front() * rhs;\\n } else {\\n return rhs.data.front().front() * lhs;\\n }\\n }\\n\\n auto [n, m] = lhs.size();\\n int l = rhs.data.front().size();\\n\\n Matrix res(n, l);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n for (int k = 0; k < l; k++) {\\n res.data[i][k] += lhs.data[i][j] * rhs.data[j][k];\\n res.data[i][k] %= MOD;\\n }\\n }\\n }\\n\\n return res;\\n }\\n\\n friend Matrix operator+(int value, const Matrix& rhs) {\\n auto [n, m] = rhs.size();\\n auto res(rhs);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] += value;\\n res.data[i][j] %= MOD;\\n }\\n }\\n return res;\\n }\\n\\n friend Matrix operator-(int value, const Matrix& rhs) {\\n auto [n, m] = rhs.size();\\n auto res(rhs);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] -= value;\\n res.data[i][j] = (res.data[i][j] + MOD) % MOD;\\n }\\n }\\n return res;\\n }\\n\\n friend Matrix operator*(int value, const Matrix& rhs) {\\n auto [n, m] = rhs.size();\\n auto res(rhs);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] *= value;\\n res.data[i][j] %= MOD;\\n }\\n }\\n return res;\\n }\\n\\n Matrix operator-() {\\n auto [n, m] = size();\\n auto res(*this);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res.data[i][j] = (MOD - res.data[i][j]) % MOD;\\n }\\n }\\n return res;\\n }\\n\\n Matrix transpose() {\\n auto [n, m] = size();\\n Matrix mat(m, n);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n mat.data[j][i] = data[i][j];\\n }\\n }\\n return mat;\\n }\\n\\n Matrix operator()(const Matrix& lhs, const Matrix& rhs) {\\n auto [n, m] = size();\\n auto [n1, m1] = lhs.size();\\n auto [n2, m2] = rhs.size();\\n Matrix mat(m1, m2);\\n\\n for (int i = 0; i < n1; i++) {\\n for (int j = 0; j < m1; j++) {}\\n }\\n\\n for (int i = 0; i < n2; i++) {\\n for (int j = 0; j < m2; j++) {}\\n }\\n\\n for (int i = 0; i < m1; i++) {\\n for (int j = 0; j < m2; j++) {\\n mat.data[i][j] = data[lhs.data[0][i] - 1][rhs.data[0][j] - 1];\\n }\\n }\\n\\n return mat;\\n }\\n\\n Matrix add_row(const Matrix& mat) {\\n auto [n1, m1] = size();\\n auto [n2, m2] = mat.size();\\n\\n Matrix res(n1 + n2, m1);\\n for (int i = 0; i < n1; i++) {\\n for (int j = 0; j < m1; j++) {\\n res.data[i][j] = data[i][j];\\n }\\n }\\n\\n for (int i = 0; i < n2; i++) {\\n for (int j = 0; j < m1; j++) {\\n res.data[i + n1][j] = mat.data[i][j];\\n }\\n }\\n\\n return res;\\n }\\n\\n Matrix add_column(const Matrix& mat) {\\n auto [n1, m1] = size();\\n auto [n2, m2] = mat.size();\\n Matrix res(n1, m1 + m2);\\n for (int i = 0; i < n1; i++) {\\n for (int j = 0; j < m1; j++) {\\n res.data[i][j] = data[i][j];\\n }\\n }\\n\\n for (int i = 0; i < n2; i++) {\\n for (int j = 0; j < m2; j++) {\\n res.data[i][j + m1] = mat.data[i][j];\\n }\\n }\\n\\n return res;\\n }\\n};\\n\\nstruct Parser {\\n using Iter = std::string::const_iterator&;\\n std::vector<std::string> lines;\\n std::string line;\\n std::map<char, Matrix> database;\\n\\n void consume(Iter it, char c) {\\n it++;\\n }\\n\\n Parser(const std::vector<std::string>& s): lines(s) {}\\n\\n std::vector<Matrix> parse() {\\n std::vector<Matrix> mats;\\n for (int i = 0; i < (int)lines.size(); i++) {\\n line = lines[i];\\n auto it = line.cbegin();\\n auto [var, mat] = assignment(it);\\n\\n mats.push_back(mat);\\n database[var] = mat;\\n }\\n return mats;\\n }\\n\\n std::pair<char, Matrix> assignment(Iter it) {\\n char assignment_var = *it;\\n consume(it, assignment_var);\\n consume(it, '=');\\n Matrix res = expr(it);\\n consume(it, '.');\\n return {assignment_var, res};\\n }\\n\\n Matrix var(Iter it) {\\n char c = *it;\\n consume(it, c);\\n return database[c];\\n }\\n\\n Matrix expr(Iter it) {\\n Matrix res = term(it);\\n while (it != line.end() && (*it == '+' || *it == '-')) {\\n if (*it == '+') {\\n consume(it, '+');\\n res = res + term(it);\\n } else {\\n consume(it, '-');\\n res = res - term(it);\\n }\\n }\\n return res;\\n }\\n\\n Matrix term(Iter it) {\\n Matrix res = factor(it);\\n while (it != line.end() && *it == '*') {\\n consume(it, '*');\\n res = res * factor(it);\\n }\\n return res;\\n }\\n\\n Matrix factor(Iter it) {\\n bool inv = false;\\n while (it != line.end() && *it == '-') {\\n consume(it, '-');\\n inv ^= true;\\n }\\n Matrix res = primary(it);\\n if (inv) {\\n res = -res;\\n }\\n return res;\\n }\\n\\n Matrix primary(Iter it) {\\n Matrix res;\\n if (std::isdigit(*it)) {\\n res = inum(it);\\n } else if (std::isupper(*it)) {\\n res = var(it);\\n } else if (*it == '[') {\\n res = matrix(it);\\n } else if (*it == '(') {\\n consume(it, '(');\\n res = expr(it);\\n consume(it, ')');\\n }\\n\\n while (it != line.end() && (*it == '(' || *it == '\\\\'')) {\\n if (*it == '(') {\\n res = indexed_primary(it, res);\\n } else if (*it == '\\\\'') {\\n res = transposed_primary(it, res);\\n }\\n }\\n\\n return res;\\n }\\n\\n Matrix indexed_primary(Iter it, Matrix mat) {\\n consume(it, '(');\\n Matrix lhs = expr(it);\\n consume(it, ',');\\n Matrix rhs = expr(it);\\n consume(it, ')');\\n\\n return mat(lhs, rhs);\\n }\\n\\n Matrix transposed_primary(Iter it, Matrix mat) {\\n consume(it, '\\\\'');\\n return mat.transpose();\\n }\\n\\n Matrix matrix(Iter it) {\\n consume(it, '[');\\n Matrix res = row_seq(it);\\n consume(it, ']');\\n return res;\\n }\\n\\n Matrix row_seq(Iter it) {\\n Matrix res = row(it);\\n while (it != line.end() && *it == ';') {\\n consume(it, ';');\\n res = res.add_row(row(it));\\n }\\n return res;\\n }\\n\\n Matrix row(Iter it) {\\n Matrix res = expr(it);\\n while (it != line.end() && *it == ' ') {\\n consume(it, ' ');\\n res = res.add_column(expr(it));\\n }\\n return res;\\n }\\n\\n Matrix inum(Iter it) {\\n int res = digit(it);\\n while (it != line.end() && std::isdigit(*it)) {\\n res = 10 * res + digit(it);\\n }\\n return Matrix(res);\\n }\\n\\n int digit(Iter it) {\\n char res = *it;\\n consume(it, res);\\n return res - '0';\\n }\\n};\\n\\nint main() {\\n int n;\\n while (std::cin >> n) {\\n if (n == 0) break;\\n std::cin.ignore();\\n std::vector<std::string> lines(n);\\n for (int i = 0; i < n; i++) {\\n std::getline(std::cin, lines[i]);\\n }\\n Parser parser(lines);\\n auto mats = parser.parse();\\n for (auto mat: mats) {\\n std::cout << mat << std::endl;\\n }\\n std::cout << \\\"-----\\\" << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.118,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1314_8033955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef __int128_t lll;\\ntypedef long double ld;\\ntypedef pair<ll, ll> pl;\\ntypedef tuple<ll, ll, ll> tt;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<vvl> vvvl;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef vector<vvd> vvvd;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<vvb> vvvb;\\ntypedef vector<char> vc;\\ntypedef vector<vc> vvc;\\ntypedef vector<vvc> vvvc;\\ntypedef vector<pl> vp;\\ntypedef vector<tt> vt;\\ntypedef vector<string> vs;\\n\\nconst ll INF = 1000000010;\\nconst ll INFL = INF * INF;\\nconst ld epsilon = 1e-10;\\n\\n#define ovl(a, b, c, d, e, ...) e\\n#define pb push_back\\n#define eb emplace_back\\n#define MP make_pair\\n#define DEBUG(...) DEBUG_(#__VA_ARGS__, __VA_ARGS__)\\n#define REP1(i, r) for (int i = 0; i < (r); i++)\\n#define REP2(i, l, r) for (int i = (l); i < (r); i++)\\n#define REP3(i, l, r, d) for (int i = (l); i < (r); i += (d))\\n#define REP(...) ovl(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)\\n#define RREP1(i, r) for (int i = (r)-1; i >= 0; i--)\\n#define RREP2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define RREP3(i, l, r, d) for (int i = (r)-1; i >= (l); i -= (d))\\n#define RREP(...) ovl(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define EACH1(x, a) for (auto &x : a)\\n#define EACH2(x, y, a) for (auto &[x, y] : a)\\n#define EACH3(x, y, z, a) for (auto &[x, y, z] : a)\\n#define EACH(...) ovl(__VA_ARGS__, EACH3, EACH2, EACH1)(__VA_ARGS__)\\n#define ALL(x) begin(x), end(x)\\n#define RALL(x) (x).rbegin(), (x).rend()\\n#define sz(x) (ll) x.size()\\n#define LB(a, x) (lower_bound(ALL(a), x) - a.begin())\\n#define UB(a, x) (upper_bound(ALL(a), x) - a.begin())\\n#define FLG(x, i) (((x) >> (i)) & 1)\\n#define CNTBIT(x) __builtin_popcountll(x)\\n#define IN(x, a, b) ((a) <= (x) && (x) < (b))\\n#define int ll\\n\\ntemplate <class T>\\nvoid DEBUG_(string_view name, const T &a) {\\n cerr << name << \\\": \\\" << a << endl;\\n}\\n\\ntemplate <class T>\\nvoid DEBUG_(string_view name, const vector<T> &a) {\\n cerr << name << \\\": \\\";\\n REP(i, sz(a)) cerr << a[i] << \\\" \\\";\\n cerr << endl;\\n}\\n\\ntemplate <class T, class U>\\nbool chmax(T &x, const U &y) {\\n return x < y ? x = y, 1 : 0;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &x, const U &y) {\\n return x > y ? x = y, 1 : 0;\\n}\\n\\n//-----------------------------------------------------------------------\\n\\ntypedef string::const_iterator State;\\ntypedef vector<vector<int>> Mat;\\n\\nconstexpr int MOD = 1 << 15;\\n\\nMat matadd(const Mat &m1, const Mat &m2) {\\n assert(m1.size() == m2.size() && m1[0].size() == m2[0].size());\\n Mat m3 = m1;\\n REP(h, (int)m1.size())\\n REP(w, (int)m1[0].size()) {\\n m3[h][w] += m2[h][w];\\n m3[h][w] %= MOD;\\n }\\n return m3;\\n}\\n\\nMat matsub(const Mat &m1, const Mat &m2) {\\n assert(m1.size() == m2.size() && m1[0].size() == m2[0].size());\\n Mat m3 = m1;\\n REP(h, (int)m1.size())\\n REP(w, (int)m1[0].size()) {\\n m3[h][w] += MOD - m2[h][w] % MOD;\\n m3[h][w] %= MOD;\\n }\\n return m3;\\n}\\n\\nMat matmul(const Mat &m1, const Mat &m2) {\\n if (int(m1.size()) == 1 && int(m1[0].size()) == 1) {\\n Mat m3 = m2;\\n REP(h, int(m3.size()))\\n REP(w, int(m3[0].size())) {\\n m3[h][w] *= m1[0][0];\\n m3[h][w] %= MOD;\\n }\\n return m3;\\n } else if (int(m2.size()) == 1 && int(m2[0].size()) == 1) {\\n Mat m3 = m1;\\n REP(h, int(m3.size()))\\n REP(w, int(m3[0].size())) {\\n m3[h][w] *= m2[0][0];\\n m3[h][w] %= MOD;\\n }\\n return m3;\\n } else {\\n assert(m1[0].size() == m2.size());\\n Mat m3(m1.size(), vl(m2[0].size(), 0));\\n REP(i, (int)m1.size())\\n REP(j, (int)m2[0].size())\\n REP(k, (int)m1[0].size()) {\\n m3[i][j] += m1[i][k] * m2[k][j] % MOD;\\n m3[i][j] %= MOD;\\n }\\n return m3;\\n }\\n}\\n\\nMat unary_minus(const Mat &m) {\\n Mat m3 = m;\\n REP(h, (int)m.size())\\n REP(w, (int)m[0].size()) { m3[h][w] = MOD - m[h][w]; }\\n return m3;\\n}\\n\\nMat mattranspose(const Mat &m) {\\n Mat m3(m[0].size(), vl(m.size()));\\n REP(h, (int)m.size())\\n REP(w, (int)m[0].size()) { m3[w][h] = m[h][w]; }\\n return m3;\\n}\\n\\nMat matindex(const Mat &p, const Mat &m1, const Mat &m2) {\\n assert((int)m1.size() == 1 && (int)m2.size() == 1);\\n Mat m3(m1[0].size(), vl(m2[0].size()));\\n REP(h, (int)m1[0].size())\\n REP(w, (int)m2[0].size()) { m3[h][w] = p[m1[0][h] - 1][m2[0][w] - 1]; }\\n return m3;\\n}\\n\\nmap<string, Mat> store;\\n\\nMat assignment(State &bein);\\nstring var(State &begin);\\nMat expr(State &begin);\\nMat term(State &begin);\\nMat factor(State &begin);\\nMat primary(State &begin);\\nMat matrix(State &begin);\\n\\nMat assignment(State &begin) {\\n string X = var(begin);\\n assert(*begin == '=');\\n begin++;\\n Mat mat = expr(begin);\\n store[X] = mat;\\n return mat;\\n}\\n\\nstring var(State &begin) {\\n assert('A' <= *begin && *begin <= 'Z');\\n string ret(1, *begin);\\n begin++;\\n return ret;\\n}\\n\\nMat expr(State &begin) {\\n Mat mat = term(begin);\\n while (*begin != '.') {\\n if (*begin == '+') {\\n begin++;\\n Mat mat2 = term(begin);\\n mat = matadd(mat, mat2);\\n } else if (*begin == '-') {\\n begin++;\\n Mat mat2 = term(begin);\\n mat = matsub(mat, mat2);\\n } else {\\n break;\\n }\\n }\\n return mat;\\n}\\n\\nMat term(State &begin) {\\n Mat mat = factor(begin);\\n while (*begin == '*') {\\n begin++;\\n Mat mat2 = factor(begin);\\n mat = matmul(mat, mat2);\\n }\\n return mat;\\n}\\n\\nMat factor(State &begin) {\\n if (*begin == '-') {\\n begin++;\\n return unary_minus(factor(begin));\\n } else {\\n return primary(begin);\\n }\\n}\\n\\nint inum(State &begin) {\\n int ret = 0;\\n while (isdigit(*begin)) {\\n ret *= 10;\\n ret %= MOD;\\n ret += *begin - '0';\\n ret %= MOD;\\n begin++;\\n }\\n // DEBUG(*begin);\\n return ret;\\n}\\n\\nMat row(State &begin) {\\n // DEBUG(\\\"row\\\");\\n Mat mat = expr(begin);\\n // DEBUG(*begin);\\n while (*begin == ' ') {\\n begin++;\\n Mat mat2 = expr(begin);\\n // DEBUG(mat2);\\n assert(mat.size() == mat2.size());\\n REP(h, int(mat.size())) {\\n EACH(e, mat2[h]) { mat[h].pb(e); }\\n }\\n }\\n return mat;\\n}\\n\\nMat rowseq(State &begin) {\\n Mat mat = row(begin);\\n while (*begin == ';') {\\n begin++;\\n Mat mat2 = row(begin);\\n EACH(r, mat2) { mat.pb(r); }\\n }\\n return mat;\\n}\\n\\nMat primary_sub(State &begin) {\\n if (isdigit(*begin)) {\\n return Mat(1, vl(1, inum(begin)));\\n }\\n if ('A' <= *begin && *begin <= 'Z') {\\n Mat ret = store[string(1, *begin)];\\n begin++;\\n return ret;\\n }\\n if (*begin == '[') {\\n begin++;\\n Mat mat = rowseq(begin);\\n assert(*begin == ']');\\n begin++;\\n return mat;\\n }\\n if (*begin == '(') {\\n begin++;\\n Mat mat = expr(begin);\\n assert(*begin == ')');\\n begin++;\\n return mat;\\n }\\n assert(false);\\n}\\n\\nMat primary(State &begin) {\\n Mat p = primary_sub(begin);\\n while (*begin == '(' || *begin == '\\\\'') {\\n if (*begin == '(') {\\n begin++;\\n Mat mat1 = expr(begin);\\n assert(*begin == ',');\\n begin++;\\n Mat mat2 = expr(begin);\\n assert(*begin == ')');\\n begin++;\\n p = matindex(p, mat1, mat2);\\n } else {\\n begin++;\\n p = mattranspose(p);\\n }\\n }\\n return p;\\n}\\n\\nvector<Mat> solve(int N) {\\n store.clear();\\n vector<Mat> mats;\\n REP(i, N) {\\n string S;\\n getline(cin, S);\\n // DEBUG(S);\\n State begin = S.begin();\\n Mat mat = assignment(begin);\\n // DEBUG(\\\"mat\\\");\\n // EACH(m, mat) { DEBUG(m); }\\n mats.pb(mat);\\n }\\n return mats;\\n}\\n\\nsigned main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(15);\\n\\n vector<vector<Mat>> answers;\\n while (true) {\\n string n;\\n getline(cin, n);\\n State begin = n.begin();\\n int N = inum(begin);\\n if (N == 0) break;\\n // DEBUG(N);\\n vector<Mat> answer = solve(N);\\n answers.pb(answer);\\n }\\n\\n EACH(as, answers) {\\n EACH(a, as) {\\n REP(h, (int)a.size()) {\\n REP(w, (int)a[h].size()) {\\n cout << a[h][w] << (w == int(a[h].size()) - 1 ? \\\"\\\" : \\\" \\\");\\n }\\n cout << endl;\\n }\\n }\\n cout << \\\"-----\\\" << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.2182,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1314_8019671\",\n \"code_snippet\": \"#pragma region ngng628_library\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n unsigned int umod() const { return _m; }\\n\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n\\n unsigned long long z = a;\\n z *= b;\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nusing mint = atcoder::static_modint<32768>;\\n#include <bits/stdc++.h>\\n#define int Int\\n#define float Float\\n#define overload3(_1,_2,_3,name,...) name\\n#define _step(n) _rep(_,n)\\n#define _rep(i,n) _repr(i,0,n)\\n#define _repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)\\n#define rep(...) overload3(__VA_ARGS__, _repr, _rep, _step)(__VA_ARGS__)\\n#define _reps(i,n) _reprs(i,1,n)\\n#define _reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)\\n#define reps(...) overload3(__VA_ARGS__, _reprs, _reps)(__VA_ARGS__)\\n#define rrep(i,n) for(int i=(int)(n)-1; i>=0; --i)\\n#define rreps(i,n) for(int i=(n); i>0; --i)\\n#define all(v) std::begin(v), std::end(v)\\n#define rall(v) std::rbegin(v), std::rend(v)\\n#define pb push_back\\n#define eb emplace_back\\n#define len(v) ssize(std::size(v))\\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\\nusing namespace std;\\nusing Int = long long;\\nusing Float = long double;\\nusing int32 = int32_t;\\nusing int64 = int64_t;\\nusing uint32 = uint32_t;\\nusing uint64 = uint64_t;\\nusing usize = size_t;\\nusing ssize = ptrdiff_t;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using MaxHeap = priority_queue<T>;\\ntemplate<class T> using MinHeap = priority_queue<T, vec<T>, greater<T>>;\\nusing pii = pair<int, int>;\\nusing vi = vec<int>;\\nusing vvi = vec<vi>;\\nusing vvvi = vec<vvi>;\\nusing vb = basic_string<bool>;\\nusing vvb = vec<vb>;\\nusing vvvb = vec<vvb>;\\nconstexpr int OO = (1LL<<62)-(1LL<<31);\\ntemplate<class T> string join(const vec<T>& v){ stringstream s; for (T t : v) s << ' ' << t; return s.str().substr(1); }\\ntemplate<class T> ostream& operator <<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }\\ntemplate<class T> ostream& operator <<(ostream& os, const vec<vec<T>>& v){\\n rep (i, len(v)) if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? \\\"\\\\n\\\" : \\\"\\\");\\n return os;\\n}\\ntemplate<class T, class U> ostream& operator <<(ostream& os, const pair<T, U>& p){ return os << p.first << ' ' << p.second; }\\ntemplate<class T, class U, class V>\\nostream& operator <<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << \\\" \\\" << get<1>(t) << \\\" \\\" << get<2>(t); }\\nstruct Scanner {\\n Scanner() = default;\\n int nextInt(int o = 0) const {\\n char c = skip();\\n int r = c - '0', sgn = 1;\\n if (c == '-') sgn = -1, r = gc() & 0xf;\\n else if (c == '+') r = gc() & 0xf;\\n while (!isspace(c = gc())) r = 10 * r + (c & 0xf);\\n return sgn * r + o;\\n }\\n string nextLine() const { char c; string r; while ((c = gc()) != '\\\\n') r.pb(c); return r; }\\nprivate:\\n char skip() const { char c; while (isspace(c = getchar())) {} return c; }\\n inline char gc() const { return getchar(); }\\n} sc;\\nistream& operator >>(istream& is, mint& r){ int t; is >> t; r = t; return is; }\\nostream& operator <<(ostream& os, const mint& r){ return os << r.val(); }\\nmint operator\\\"\\\" _mod_m(unsigned long long n) { return n; }\\nusing vm = vec<mint>;\\nusing vvm = vec<vm>;\\nusing vvvm = vec<vvm>;\\n# pragma endregion ngng628_library\\n\\ntemplate <class T>\\nstruct Matrix {\\n // コンストラクタ\\n Matrix() : m(vec<vec<T>>()) {}\\n Matrix(int n) : m(vec<vec<T>>(n, vec<T>(n))) {}\\n Matrix(int h, int w) : m(vec<vec<T>>(h, vec<T>(w, 0))) {}\\n Matrix(int h, int w, T d) : m(vec<vec<T>>(h, vec<T>(w, d))){}\\n Matrix(const vec<vec<T>>& _m) : m(_m){}\\n\\n // 単位行列\\n const static Matrix Identity(const int n) {\\n Matrix mat(n);\\n rep (i, n) mat[i][i] = T(1);\\n return mat;\\n }\\n\\n // 要素アクセス\\n vec<T> operator[](const int i) const { return m[i]; }\\n vec<T>& operator[](const int i) { return m[i]; }\\n T operator ()(const int i, const int j) const { return m[i][j]; }\\n T& operator ()(const int i, const int j) { return m[i][j]; }\\n\\n // ゲッター\\n [[nodiscard]] constexpr int n_rows() const { return len(m); }\\n [[nodiscard]] constexpr int n_cols() const { return len(m[0]); }\\n\\n // 行・列の拡張\\n void resize(const int h, const int w) { m.resize(h, w, T()); }\\n void push_back_row(const vec<T>& v) { m.push_back(v); }\\n void push_back_col(const vec<T>& v) { rep (i, n_rows()) m[i].push_back(v[i]); }\\n void pop_back_row() { m.pop_back(); }\\n void pop_back_col() { rep (i, n_rows()) m[i].pop_back(); }\\n\\n // 四則演算とべき乗\\n Matrix& operator +=(const Matrix& other) {\\n const int r = n_rows();\\n const int c = n_cols();\\n assert(r == other.n_rows() and c == other.n_cols());\\n rep (i, r) rep (j, c) (*this)(i, j) += other(i, j);\\n return *this;\\n }\\n Matrix& operator -=(const Matrix& other) {\\n const int r = n_rows();\\n const int c = n_cols();\\n assert(r == other.n_rows() and c == other.n_cols());\\n rep (i, r) rep (j, c) (*this)(i, j) -= other(i, j);\\n return *this;\\n }\\n Matrix& operator *=(const Matrix& other) {\\n const int r = n_rows(), c = other.n_cols(), p = n_cols();\\n assert(p == other.n_rows());\\n vec<vec<T>> v(r, vec<T>(c, T(0)));\\n rep (i, r) rep (j, c) rep (k, p) v[i][j] = (v[i][j] + (*this)(i, k) * other(k, j));\\n m.swap(v);\\n return *this;\\n }\\n Matrix& operator ^=(int n) {\\n Matrix res = Matrix::Identity(n_rows());\\n Matrix x = *this;\\n while (n > 0) {\\n if (n & 1) res *= x;\\n x *= x;\\n n >>= 1;\\n }\\n swap(m, res.m);\\n return *this;\\n }\\n\\n friend Matrix operator +(const Matrix& a, const Matrix& b) { return Matrix(a) += b; }\\n friend Matrix operator -(const Matrix& a, const Matrix& b) { return Matrix(a) -= b; }\\n friend Matrix operator *(const Matrix& a, const Matrix& b) { return Matrix(a) *= b; }\\n friend Matrix operator ^(const Matrix& a, const int n) { return Matrix(a) ^= n; }\\n\\n // スカラー倍\\n Matrix& operator *=(T k) { rep (i, n_rows()) rep (j, n_cols()) (*this)(i, j) *= k; return *this; }\\n Matrix& operator /=(T k) { rep (i, n_rows()) rep (j, n_cols()) (*this)(i, j) /= k; return *this; }\\n friend Matrix operator *(const Matrix& a, const T b) { return Matrix(a) *= b; }\\n friend Matrix operator *(const T a, const Matrix& b) { return Matrix(b) *= a; }\\n friend Matrix operator /(const Matrix& a, const T b) { return Matrix(a) /= b; }\\n\\n // 単項演算子\\n Matrix operator -() const { Matrix mat(n_rows(), n_cols()); rep (i, n_rows()) rep (j, n_cols()) mat(i, j) = -this->m[i][j]; return mat; }\\n Matrix operator +() const { return *this; }\\n\\n // 累乗\\n Matrix pow(int n) { return (*this) ^ n; }\\n friend Matrix pow(const Matrix& mat, int n) { return mat.pow(n); }\\n\\n // 行列式 （T型が体であるときのみ対応）\\n T det() {\\n assert(n_rows() == n_cols());\\n Matrix mat(*this);\\n T ret = 1;\\n rep (i, n_cols()) {\\n int idx = -1;\\n rep (j, i, n_cols()) {\\n if (mat(j, i) != T(0)) idx = j;\\n }\\n if (idx == -1) return 0;\\n if (i != idx) {\\n ret *= -1;\\n swap(mat[i], mat[idx]);\\n }\\n ret *= mat(i, i);\\n T v = mat(i, i);\\n rep (j, n_cols()) mat(i, j) /= v;\\n rep (j, i + 1, n_cols()) {\\n T a = mat(j, i);\\n rep (k, n_cols()) mat(j, k) -= mat(i, k) * a;\\n }\\n }\\n return ret;\\n }\\n friend T det(const Matrix& mat) { return mat.det(); }\\n\\n // 転置行列\\n Matrix transposed() const {\\n Matrix mat(n_cols(), n_rows());\\n rep (i, n_rows()) {\\n rep (j, n_cols()) {\\n mat(j, i) = m[i][j];\\n }\\n }\\n return mat;\\n }\\n friend T transposed(const Matrix& mat) { return mat.transposed(); }\\n\\n // 行のスライス\\n Matrix selected_rows(const vector<int>& indices) {\\n vector<vector<T>> acc;\\n for (int i : indices) {\\n acc.push_back(m[i]);\\n }\\n return Matrix(acc);\\n }\\n\\n // 列のスライス\\n Matrix selected_cols(const vector<int>& indices) {\\n vector<vector<T>> acc;\\n Matrix mt = transposed();\\n for (int j : indices) {\\n acc.push_back(mt[j]);\\n }\\n return Matrix(acc).transposed();\\n }\\n\\n // 行列を横に合体させる\\n //\\n // ```\\n // [1, 2; 3, 4].row_concat([5, 6, 7; 8, 9, 10]) # => [1, 2, 5, 6; 3, 4, 8, 9, 10]\\n // ```\\n Matrix row_concat(const Matrix& other) {\\n assert(n_rows() == other.n_rows());\\n Matrix ret(n_rows(), n_cols() + other.n_cols());\\n const int w = n_cols();\\n rep (i, n_rows()) {\\n rep (j, w) ret(i, j) = m[i][j];\\n rep (j, other.n_cols()) ret(i, w + j) = other[i][j];\\n }\\n return ret;\\n }\\n\\n // 行列を縦に合体させる\\n //\\n // ```\\n // [1, 2; 3, 4].row_concat([5, 6; 7, 8; 9, 10]) # => [1, 2; 3, 4; 5, 6; 7, 8; 9, 10]\\n // ```\\n Matrix col_concat(const Matrix& other) {\\n assert(n_cols() == other.n_cols());\\n Matrix ret(n_rows() + other.n_rows(), n_cols());\\n const int h = n_rows();\\n rep (i, h) {\\n rep (j, n_cols()) ret(i, j) = m[i][j];\\n }\\n rep (i, other.n_rows()) {\\n rep (j, other.n_cols()) ret(h + i, j) = other[i][j];\\n }\\n return ret;\\n }\\n\\n // 入出力\\n friend ostream& operator <<(ostream& os, const Matrix& mat){\\n rep (i, mat.n_rows()) {\\n rep (j, mat.n_cols()) {\\n if (j != 0) os << ' ';\\n os << mat(i, j);\\n }\\n if (i != mat.n_rows() - 1) os << '\\\\n';\\n }\\n return os;\\n }\\n\\nprivate:\\n vec<vec<T>> m;\\n};\\n\\nusing M = Matrix<mint>;\\n\\nstruct Parser {\\n map<char, M> mp;\\n vector<string> s;\\n int line;\\n string::const_iterator it;\\n\\n Parser() = default;\\n\\n Parser(const vector<string>& _s) : s(_s) {\\n }\\n\\n void parse() {\\n const int n = len(s);\\n rep (i, 0, n) {\\n line = i;\\n it = s[i].begin();\\n program();\\n }\\n }\\n\\n void program() {\\n char var = *it++;\\n assert(*it++ == '=');\\n\\n M res = expr();\\n assert(*it++ == '.');\\n\\n mp[var] = res;\\n cout << res << endl;\\n }\\n\\n M expr() {\\n M acc = term();\\n while (*it == '+' || *it == '-') {\\n char op = *it++;\\n M other = term();\\n if (op == '+') {\\n acc += other;\\n }\\n else {\\n acc -= other;\\n }\\n }\\n return acc;\\n }\\n\\n M term() {\\n M acc = factor();\\n while (*it == '*') {\\n assert(*it++ == '*');\\n M other = factor();\\n if (isnumber(acc) && isnumber(other)) {\\n acc *= other;\\n }\\n else if (isnumber(acc) && not isnumber(other)) {\\n acc = acc(0, 0) * other;\\n }\\n else if (not isnumber(acc) && isnumber(other)) {\\n acc *= other(0, 0);\\n }\\n else {\\n assert(not isnumber(acc) && not isnumber(other));\\n acc *= other;\\n }\\n }\\n return acc;\\n }\\n\\n M factor() {\\n if (*it == '-') {\\n assert(*it++ == '-');\\n M ret = factor();\\n return -ret;\\n }\\n return primary();\\n }\\n\\n M primary() {\\n M ret;\\n if (isdigit(*it)) {\\n mint val = inum();\\n ret = M(1, 1, val);\\n }\\n else if (isalpha(*it)) {\\n ret = mp[*it++];\\n }\\n else if (*it == '(') {\\n assert(*it++ == '(');\\n ret = expr();\\n assert(*it++ == ')');\\n }\\n else {\\n assert(*it == '[');\\n ret = matrix();\\n }\\n\\n while (*it == '(' || *it == '\\\\'') {\\n if (*it == '(') {\\n assert(*it++ == '(');\\n M is = expr();\\n assert(*it++ == ',');\\n M js = expr();\\n assert(*it++ == ')');\\n assert(is.n_rows() == 1);\\n assert(js.n_rows() == 1);\\n {\\n vector<int> indices;\\n rep (j, 0, is.n_cols()) {\\n indices.push_back(is(0, j).val() - 1);\\n }\\n ret = ret.selected_rows(indices);\\n }\\n {\\n vector<int> indices;\\n rep (j, 0, js.n_cols()) {\\n indices.push_back(js(0, j).val() - 1);\\n }\\n ret = ret.selected_cols(indices);\\n }\\n }\\n else if (*it == '\\\\'') {\\n assert(*it++ == '\\\\'');\\n ret = ret.transposed();\\n }\\n }\\n return ret;\\n }\\n\\n M matrix() {\\n assert(*it++ == '[');\\n M row = row_seq();\\n assert(*it++ == ']');\\n return row;\\n }\\n\\n M row_seq() {\\n M acc = row();\\n while (*it == ';') {\\n assert(*it++ == ';');\\n M other = row();\\n acc = acc.col_concat(other);\\n }\\n return acc;\\n }\\n\\n M row() {\\n M acc = expr();\\n while (*it == ' ') {\\n assert(*it++ == ' ');\\n M other = expr();\\n acc = acc.row_concat(other);\\n }\\n return acc;\\n }\\n\\n bool isnumber(const M& mat) {\\n return mat.n_rows() == 1 && mat.n_cols() == 1;\\n }\\n\\n mint inum() {\\n mint ret = 0;\\n for (; isdigit(*it); ++it) {\\n ret = 10*ret + (*it - '0');\\n }\\n return ret;\\n }\\n};\\n\\nint32 main() {\\n while (true) {\\n auto n = sc.nextInt();\\n if (!n) break;\\n vector<string> s(n);\\n for (string& si : s) si = sc.nextLine();\\n Parser(s).parse();\\n cout << \\\"-----\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.1094,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1314_7983042\",\n \"code_snippet\": \"#include <string.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cfloat>\\n#include <chrono>\\n#include <ciso646>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define REP3(i, l, r, s) \\\\\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\\\\n i += rep3_s)\\n#define REP2(i, l, r) REP3(i, l, r, 1)\\n#define REP1(i, n) REP2(i, 0, n)\\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\\n\\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define RREP3(i, l, r, s) \\\\\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\\\\n i -= rrep3_s)\\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\\n#define RREP1(i, n) RREP2(i, 0, n)\\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\\n#define rrepin(i, l, r) \\\\\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace rklib {\\n\\n// a <- max(a, b)\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// a <- min(a, b)\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// if a < 0: a <- b\\n// else: a <- min(a, b)\\ntemplate <class T>\\nbool chmin_non_negative(T &a, const T &b) {\\n if (a < 0 || a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// floor(num / den)\\ntemplate <class T>\\nT div_floor(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num >= 0 ? num / den : (num + 1) / den - 1;\\n}\\n\\n// ceil(num / den)\\ntemplate <class T>\\nT div_ceil(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num <= 0 ? num / den : (num - 1) / den + 1;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nT remainder_count(T r, T b, T m) {\\n return r / m * b + std::min(b, r % m);\\n}\\n\\n} // namespace internal\\n\\n// Number of integer x s.t.\\n// - x in [l, r)\\n// - x mod m in [a, b)\\ntemplate <class T>\\nT remainder_count(T l, T r, T a, T b, T m) {\\n assert(l >= 0);\\n assert(m >= 1);\\n\\n if (l >= r || a >= b) return 0;\\n if (m <= a || b < 0) return 0;\\n chmax(a, T(0));\\n chmin(b, m);\\n\\n auto res = internal::remainder_count(r, b, m);\\n if (l >= 1) res -= internal::remainder_count(l, b, m);\\n if (a >= 1) res -= internal::remainder_count(r, a, m);\\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\\n\\n return res;\\n}\\n\\n} // namespace rklib\\n\\n\\nusing namespace std;\\nusing namespace rklib;\\n\\nusing lint = long long;\\nusing ulint = unsigned long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<lint, lint>;\\n\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <assert.h>\\n\\n#include <vector>\\n\\nnamespace rklib {\\n\\ntemplate <class T>\\nstruct Matrix {\\n std::vector<std::vector<T>> a;\\n\\n Matrix() : a(1, std::vector<T>(1, 0)) {}\\n Matrix(int n, int m) : a(n, std::vector<T>(m, 0)) {}\\n Matrix(int n) : a(n, std::vector<T>(n, 0)) {}\\n\\n int height() const { return a.size(); }\\n int width() const { return a[0].size(); }\\n\\n inline const std::vector<T> &operator[](int i) const { return a[i]; }\\n inline std::vector<T> &operator[](int i) { return a[i]; }\\n\\n static Matrix id(int n) {\\n Matrix res(n);\\n for (int i = 0; i < n; i++) res[i][i] = 1;\\n return res;\\n }\\n\\n Matrix &operator*=(const Matrix &b) {\\n assert(width() == b.height());\\n std::vector<std::vector<T>> c(height(), std::vector<T>(b.width()));\\n for (int i = 0; i < height(); ++i) {\\n for (int k = 0; k < b.height(); ++k) {\\n for (int j = 0; j < b.width(); ++j) {\\n c[i][j] += a[i][k] * b[k][j];\\n }\\n }\\n }\\n a.swap(c);\\n return *this;\\n }\\n\\n Matrix pow(long long n) const {\\n auto x = (*this), res = id(height());\\n while (n) {\\n if (n & 1) {\\n res *= x;\\n --n;\\n } else {\\n x *= x;\\n n >>= 1;\\n }\\n }\\n return res;\\n }\\n\\n Matrix operator*(const Matrix &b) const { return Matrix(*this) *= b; }\\n\\n std::vector<T> operator*(const std::vector<T> &v) {\\n assert(width() == (int)v.size());\\n std::vector<T> res(height(), 0);\\n for (int i = 0; i < height(); ++i) {\\n for (int j = 0; j < width(); ++j) {\\n res[i] += a[i][j] * v[j];\\n }\\n }\\n return res;\\n }\\n\\n Matrix transposed() {\\n Matrix res(this->width(), this->height());\\n for (size_t i = 0; i < this->height(); i++) {\\n for (size_t j = 0; j < this->width(); j++) {\\n res[j][i] = this->a[i][j];\\n }\\n }\\n return res;\\n }\\n};\\n\\ntemplate <class T>\\nstd::pair<int, bool> gauss_jordan(Matrix<T> &a) {\\n int rnk = 0;\\n bool swp = false;\\n for (int j = 0; j < a.width(); ++j) {\\n int pivot = -1;\\n for (int i = rnk; i < a.height(); ++i) {\\n if (a[i][j] != 0) {\\n pivot = i;\\n break;\\n }\\n }\\n if (pivot < 0) continue;\\n swap(a[pivot], a[rnk]);\\n if (pivot != rnk) swp ^= true;\\n for (int i = 0; i < a.height(); ++i) {\\n if (i != rnk && a[i][j] != 0) {\\n auto coef = a[i][j] / a[rnk][j];\\n for (int k = j; k < a.width(); ++k) {\\n a[i][k] -= a[rnk][k] * coef;\\n }\\n }\\n }\\n ++rnk;\\n }\\n return {rnk, swp};\\n}\\n\\ntemplate <class T>\\nT determinant(Matrix<T> a) {\\n auto [rnk, swp] = gauss_jordan(a);\\n if (rnk < a.height()) return 0;\\n T res = 1;\\n for (int i = 0; i < a.height(); ++i) res *= a[i][i];\\n if (swp) res = -res;\\n return res;\\n}\\n\\ntemplate <class T>\\nstd::pair<std::vector<T>, std::vector<std::vector<T>>>\\nsystem_of_linear_equations(Matrix<T> a, const std::vector<T> &b) {\\n assert(a.height() == (int)b.size());\\n Matrix<T> aug(a.height(), a.width() + 1);\\n for (int i = 0; i < a.height(); ++i) {\\n for (int j = 0; j < a.width(); ++j) {\\n aug[i][j] = a[i][j];\\n }\\n aug[i][a.width()] = b[i];\\n }\\n\\n auto rnk = gauss_jordan(a).first, rnk_aug = gauss_jordan(aug).first;\\n\\n std::vector<T> solution;\\n std::vector<std::vector<T>> kernel;\\n if (rnk < rnk_aug) return {solution, kernel};\\n\\n solution.resize(a.width(), 0);\\n std::vector<bool> used(a.width(), false);\\n std::vector<int> pos(rnk);\\n for (int i = 0; i < rnk; ++i) {\\n for (int j = 0; j < a.width(); ++j) {\\n if (aug[i][j] != 0) {\\n solution[j] = aug[i][a.width()] / aug[i][j];\\n used[j] = true;\\n pos[i] = j;\\n break;\\n }\\n }\\n }\\n for (int j = 0; j < a.width(); ++j) {\\n if (!used[j]) {\\n std::vector<T> v(a.width(), 0);\\n v[j] = 1;\\n for (int i = 0; i < rnk; ++i) {\\n v[pos[i]] = -aug[i][j] / aug[i][pos[i]];\\n }\\n kernel.push_back(v);\\n }\\n }\\n return {solution, kernel};\\n}\\n\\n} // namespace rklib\\n\\n\\nusing mint = atcoder::modint;\\nusing mat = Matrix<mint>;\\n\\nmat var(string &s, int &idx);\\nmat expr(string &s, int &idx);\\nmat term(string &s, int &idx);\\nmat factor(string &s, int &idx);\\nmat primary(string &s, int &idx);\\nmat matrix(string &s, int &idx);\\nmat row_seq(string &s, int &idx);\\nmat row(string &s, int &idx);\\nmat inum(string &s, int &idx);\\n\\nmat vars[26];\\n\\nmat var(string &s, int &idx) {\\n auto res = vars[s[idx] - 'A'];\\n ++idx;\\n return res;\\n}\\nmat expr(string &s, int &idx) {\\n auto res = term(s, idx);\\n while (idx < int(s.size()) && (s[idx] == '+' || s[idx] == '-')) {\\n auto op = s[idx];\\n ++idx;\\n auto tmp = term(s, idx);\\n if (op == '+') {\\n rep(i, res.height()) rep(j, res.width()) res[i][j] += tmp[i][j];\\n } else {\\n rep(i, res.height()) rep(j, res.width()) res[i][j] -= tmp[i][j];\\n }\\n }\\n return res;\\n}\\nmat term(string &s, int &idx) {\\n auto res = factor(s, idx);\\n while (idx < int(s.size()) && s[idx] == '*') {\\n ++idx;\\n auto tmp = factor(s, idx);\\n if (res.height() == 1 && res.width() == 1) {\\n auto coef = res[0][0];\\n res = tmp;\\n rep(i, res.height()) rep(j, res.width()) res[i][j] *= coef;\\n } else if (tmp.height() == 1 && tmp.width() == 1) {\\n auto coef = tmp[0][0];\\n rep(i, res.height()) rep(j, res.width()) res[i][j] *= coef;\\n } else {\\n res = res * tmp;\\n }\\n }\\n return res;\\n}\\nmat factor(string &s, int &idx) {\\n if (s[idx] == '-') {\\n ++idx;\\n auto res = factor(s, idx);\\n rep(i, res.height()) rep(j, res.width()) res[i][j] = -res[i][j];\\n return res;\\n }\\n return primary(s, idx);\\n}\\nmat primary(string &s, int &idx) {\\n mat res;\\n if (isdigit(s[idx])) {\\n res = inum(s, idx);\\n } else if ('A' <= s[idx] && s[idx] <= 'Z') {\\n res = var(s, idx);\\n } else if (s[idx] == '[') {\\n res = matrix(s, idx);\\n } else {\\n ++idx;\\n res = expr(s, idx);\\n ++idx;\\n }\\n while (idx < s.size() && (s[idx] == '\\\\'' || s[idx] == '(')) {\\n if (s[idx] == '\\\\'') {\\n ++idx;\\n res = res.transposed();\\n } else {\\n ++idx;\\n auto A = expr(s, idx);\\n ++idx;\\n auto B = expr(s, idx);\\n ++idx;\\n mat tmp(A.width(), B.width());\\n rep(i, A.width()) rep(j, B.width()) {\\n tmp[i][j] = res[A[0][i].val() - 1][B[0][j].val() - 1];\\n }\\n res = tmp;\\n }\\n }\\n return res;\\n}\\nmat matrix(string &s, int &idx) {\\n ++idx;\\n auto res = row_seq(s, idx);\\n ++idx;\\n return res;\\n}\\nmat row_seq(string &s, int &idx) {\\n auto res = row(s, idx);\\n while (idx < int(s.size()) && s[idx] == ';') {\\n ++idx;\\n auto tmp = row(s, idx);\\n mat res2(res.height() + tmp.height(), res.width());\\n rep(j, res.width()) {\\n rep(i, res.height()) res2[i][j] = res[i][j];\\n rep(i, tmp.height()) res2[i + res.height()][j] = tmp[i][j];\\n }\\n res = res2;\\n }\\n return res;\\n}\\nmat row(string &s, int &idx) {\\n auto res = expr(s, idx);\\n while (idx < int(s.size()) && s[idx] == ' ') {\\n ++idx;\\n auto tmp = expr(s, idx);\\n mat res2(res.height(), res.width() + tmp.width());\\n rep(i, res.height()) {\\n rep(j, res.width()) res2[i][j] = res[i][j];\\n rep(j, tmp.width()) res2[i][j + res.width()] = tmp[i][j];\\n }\\n res = res2;\\n }\\n return res;\\n}\\nmat inum(string &s, int &idx) {\\n mat res(1, 1);\\n mint tmp = 0;\\n while (idx < int(s.size()) && isdigit(s[idx])) {\\n tmp = tmp * 10 + (s[idx] - '0');\\n ++idx;\\n }\\n\\n res[0][0] = tmp;\\n return res;\\n}\\n\\nint main() {\\n mint::set_mod(32768);\\n\\n while (true) {\\n string s;\\n getline(cin, s);\\n int n = stoi(s);\\n if (n == 0) break;\\n rep(_, n) {\\n getline(cin, s);\\n int idx = 0;\\n\\n auto c = s[idx];\\n idx += 2;\\n auto ans = expr(s, idx);\\n vars[c - 'A'] = ans;\\n\\n rep(i, ans.height()) {\\n rep(j, ans.width()) {\\n cout << ans[i][j].val();\\n if (j == ans.width() - 1) {\\n cout << \\\"\\\\n\\\";\\n } else {\\n cout << \\\" \\\";\\n }\\n }\\n }\\n }\\n puts(\\\"-----\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3776,\n \"score_of_the_acc\": -0.1354,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1314_6027674\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define _overload3(_1, _2, _3, name, ...) name\\n#define _rep(i, n) repi(i, 0, n)\\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\\n#define ALL(x) x.begin(), x.end()\\n#define chmax(x, y) x = max(x, y)\\n#define chmin(x, y) x = min(x, y)\\nusing namespace std;\\nrandom_device rnd;\\nmt19937 mt(rnd());\\nusing ll = long long;\\nusing lld = long double;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing PII = pair<int, int>;\\nconst int IINF = 1 << 30;\\nconst ll INF = 1ll << 60;\\nconst ll MOD = 32768;\\n\\nusing Matrix = vector<vector<int>>;\\n\\nstring code;\\n\\nvoid program(int &pos);\\nvoid assign(int &pos);\\nMatrix expr(int &pos);\\nMatrix term(int &pos);\\nMatrix factor(int &pos);\\nMatrix primary(int &pos);\\nMatrix indexed_primary(int &pos);\\nMatrix transposed_primary(int &pos);\\nMatrix matrix(int &pos);\\nMatrix row_seq(int &pos);\\nMatrix inum(int &pos);\\nint digit(int &pos);\\nmap<char, Matrix> var;\\n\\nvoid debug(int pos)\\n{\\n cerr << pos << \\\" \\\" << code.size() << endl;\\n rep(i, pos, code.size())\\n {\\n cout << code[i];\\n }\\n cout << endl;\\n}\\nvoid print(Matrix &mat)\\n{\\n for (auto r : mat)\\n {\\n rep(j, r.size())\\n {\\n auto elem = r[j];\\n cout << elem << (j == r.size() - 1 ? \\\"\\\" : \\\" \\\");\\n }\\n cout << endl;\\n }\\n}\\n\\nvoid addsub(Matrix &a, Matrix &b, char op)\\n{\\n assert(a.size() == b.size());\\n assert(a[0].size() == b[0].size());\\n rep(i, a.size())\\n {\\n rep(j, a[0].size())\\n {\\n\\n a[i][j] += (op == '+' ? 1 : -1) * b[i][j];\\n a[i][j] += MOD;\\n a[i][j] %= MOD;\\n }\\n }\\n}\\nMatrix trans(Matrix &a)\\n{\\n Matrix ret(a[0].size(), vector<int>(a.size()));\\n rep(i, a.size()) rep(j, a[0].size())\\n {\\n ret[j][i] = a[i][j];\\n }\\n return ret;\\n}\\nMatrix mul(Matrix a, Matrix b)\\n{\\n\\n if (a[0].size() == b.size())\\n {\\n Matrix c(a.size(), vector<int>(b[0].size(), 0));\\n rep(i, a.size())\\n {\\n rep(j, b[0].size())\\n {\\n rep(k, a[0].size())\\n {\\n c[i][j] += a[i][k] * b[k][j];\\n c[i][j] %= MOD;\\n }\\n }\\n }\\n return c;\\n }\\n else if (a.size() == 1 && a[0].size() == 1)\\n {\\n Matrix c(b.size(), vector<int>(b[0].size(), 0));\\n rep(i, b.size())\\n {\\n rep(j, b[0].size())\\n {\\n c[i][j] = b[i][j] * a[0][0];\\n c[i][j] %= MOD;\\n }\\n }\\n return c;\\n }\\n else\\n {\\n assert(b.size() == 1 && b[0].size() == 1);\\n Matrix c(a.size(), vector<int>(a[0].size(), 0));\\n rep(i, a.size())\\n {\\n rep(j, a[0].size())\\n {\\n c[i][j] = a[i][j] * b[0][0];\\n c[i][j] %= MOD;\\n }\\n }\\n return c;\\n }\\n}\\n\\nint digit(int &pos)\\n{\\n assert(isdigit(code[pos]));\\n return code[pos++] - '0';\\n}\\n\\nMatrix inum(int &pos)\\n{\\n Matrix ret(1);\\n int num = 0;\\n while (isdigit(code[pos]))\\n {\\n num = num * 10 + digit(pos);\\n }\\n ret[0].push_back(num);\\n return ret;\\n}\\n\\nvoid fill(Matrix &ret, Matrix mat, int r, int c)\\n{\\n rep(i, mat.size())\\n {\\n rep(j, mat[0].size())\\n {\\n if (mat[i][j] != -1)\\n {\\n ret[r + i][c + j] = mat[i][j];\\n }\\n }\\n }\\n}\\n\\nvoid shrink(Matrix &mat)\\n{\\n assert(!mat.back().empty());\\n while (mat.back()[0] == -1)\\n {\\n mat.pop_back();\\n assert(!mat.empty());\\n assert(!mat.back().empty());\\n }\\n rep(i, mat.size())\\n {\\n assert(!mat[i].empty());\\n while (mat[i].back() == -1)\\n {\\n mat[i].pop_back();\\n assert(!mat[i].empty());\\n }\\n }\\n}\\n\\nMatrix row_seq(int &pos)\\n{\\n Matrix ret(128, vector<int>(128, -1));\\n // debug(pos);\\n Matrix m = expr(pos);\\n // debug(pos);\\n int r = 0, c = 0;\\n int width = -1;\\n fill(ret, m, r, c);\\n while (ret[r][c] != -1)\\n c++;\\n // debug(pos);\\n\\n while (code[pos] == ';' || code[pos] == ' ')\\n {\\n if (code[pos] == ' ')\\n {\\n pos++;\\n // m = expr(pos);\\n // fill(ret, m, r, c);\\n // while (ret[r][c] != -1)\\n // c++;\\n }\\n else\\n {\\n pos++;\\n if (width == -1)\\n width = c;\\n else\\n assert(width == c);\\n c = 0;\\n r++;\\n while (ret[r][c] != -1)\\n {\\n c++;\\n if (c == width)\\n {\\n c = 0;\\n r++;\\n }\\n }\\n }\\n\\n m = expr(pos);\\n fill(ret, m, r, c);\\n while (ret[r][c] != -1)\\n c++;\\n }\\n // print(ret);\\n shrink(ret);\\n // print(ret);\\n return ret;\\n}\\n\\nMatrix matrix(int &pos)\\n{\\n assert(code[pos] == '[');\\n pos++;\\n auto ret = row_seq(pos);\\n // cerr << code[pos] << endl;\\n assert(code[pos] == ']');\\n pos++;\\n return ret;\\n}\\n\\nMatrix primary(int &pos)\\n{\\n Matrix ret;\\n if (isdigit(code[pos]))\\n {\\n ret = inum(pos);\\n }\\n else if (code[pos] == '[')\\n {\\n ret = matrix(pos);\\n }\\n else if (code[pos] == '(')\\n {\\n pos++;\\n ret = expr(pos);\\n assert(code[pos] == ')');\\n pos++;\\n }\\n else\\n {\\n ret = var[code[pos]];\\n pos++;\\n }\\n while (code[pos] == '(' || code[pos] == '\\\\'')\\n {\\n\\n if (code[pos] == '(')\\n {\\n pos++;\\n auto rows = expr(pos);\\n assert(code[pos] == ',');\\n pos++;\\n auto cols = expr(pos);\\n assert(rows.size() == 1);\\n assert(cols.size() == 1);\\n assert(code[pos] == ')');\\n pos++;\\n Matrix tmp(128, vector<int>(128, -1));\\n rep(i, rows[0].size())\\n {\\n rep(j, cols[0].size())\\n {\\n tmp[i][j] = ret[rows[0][i] - 1][cols[0][j] - 1];\\n }\\n }\\n ret = tmp;\\n shrink(ret);\\n }\\n else if (code[pos] == '\\\\'')\\n {\\n pos++;\\n ret = trans(ret);\\n }\\n }\\n\\n return ret;\\n}\\n\\nMatrix expr(int &pos)\\n{\\n Matrix ret = term(pos);\\n while (code[pos] == '+' || code[pos] == '-')\\n {\\n char op = code[pos];\\n pos++;\\n Matrix m = term(pos);\\n addsub(ret, m, op);\\n }\\n return ret;\\n}\\n\\nMatrix term(int &pos)\\n{\\n Matrix ret = factor(pos);\\n while (code[pos] == '*')\\n {\\n pos++;\\n Matrix m = factor(pos);\\n ret = mul(ret, m);\\n }\\n return ret;\\n}\\n\\nMatrix factor(int &pos)\\n{\\n if (code[pos] == '-')\\n {\\n pos++;\\n Matrix ret = factor(pos);\\n rep(i, ret.size())\\n {\\n rep(j, ret[0].size())\\n {\\n ret[i][j] = MOD - ret[i][j];\\n }\\n }\\n return ret;\\n }\\n return primary(pos);\\n}\\n\\nvoid program(int &pos)\\n{\\n while (pos < code.size())\\n {\\n assign(pos);\\n }\\n}\\n\\nvoid assign(int &pos)\\n{\\n char v = code[pos];\\n pos++;\\n assert(code[pos] == '=');\\n pos++;\\n var[v] = expr(pos);\\n print(var[v]);\\n // debug(pos);\\n assert(code[pos] == '.');\\n pos++;\\n}\\n\\nvoid solve(int n)\\n{\\n code = \\\"\\\";\\n rep(i, n)\\n {\\n string s;\\n getline(cin, s);\\n code += s;\\n }\\n // cerr << code << endl;\\n int pos = 0;\\n program(pos);\\n cout << \\\"-----\\\" << endl;\\n}\\n\\nint main()\\n{\\n int n;\\n while (cin >> n, cin.ignore(), n)\\n {\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3988,\n \"score_of_the_acc\": -0.1681,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1314_6025039\",\n \"code_snippet\": \"/*\\n ∫ ∫ ∫\\n ノヽ\\n （＿ ）\\n （＿ ）\\n（＿＿＿＿＿＿ ）\\n ヽ(´･ω･)ﾉ \\n | /\\n UU\\n*/\\n#pragma region macro\\n#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <cctype>\\n#include <vector>\\n#include <cassert>\\n#include <cmath>\\n#include <utility>\\n#include <tuple>\\n#include <map>\\n#include <set>\\n#include <deque>\\n#include <queue>\\ntypedef long long int64;\\nusing namespace std;\\ntypedef vector<int> vi;\\nconst int MOD = 1<<15;\\nconst int64 INF = 1LL << 62;\\nconst int inf = 1<<30;\\nconst char bn = '\\\\n';\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n#define REP(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(obj) (obj).begin(), (obj).end() //コンテナじゃないと使えない!!\\n#define debug(x) cerr << #x << \\\": \\\" << (x) << \\\"\\\\n\\\";\\n#define mp make_pair\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T> &V){\\n int N = V.size();\\n REP(i,N){\\n os << V[i];\\n if (i!=N-1) os << \\\" \\\";\\n }\\n os << \\\"\\\\n\\\";\\n return os;\\n}\\ntemplate <typename T,typename S>\\nostream& operator<<(ostream& os, pair<T,S> const&P){\\n os << \\\"(\\\";\\n os << P.first;\\n os << \\\" , \\\";\\n os << P.second;\\n os << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T,typename S,typename U>\\nostream& operator<<(ostream& os, tuple<T,S,U> const& P){\\n os << \\\"(\\\";\\n os << get<0>(P);\\n os << \\\", \\\";\\n os << get<1>(P);\\n os << \\\", \\\";\\n os << get<2>(P);\\n os << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream& operator<<(ostream& os, set<T> &S){\\n auto it=S.begin();\\n while(it!=S.end()){\\n os << *it;\\n os << \\\" \\\";\\n it++;\\n }\\n os << \\\"\\\\n\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream& operator<<(ostream& os, deque<T> &q){\\n for(auto it=q.begin();it<q.end();it++){\\n os<<*it;\\n os<<\\\" \\\";\\n }\\n os<<endl;\\n return os;\\n}\\ntemplate <typename T,typename S>\\nostream& operator<<(ostream& os, map<T,S> const&M){\\n for(auto e:M){\\n os<<e;\\n }\\n os<<endl;\\n return os;\\n}\\nvector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};\\n#pragma endregion\\n//fixed<<setprecision(10)<<ans<<endl;\\n\\n\\nint64 pow(int a,int b,int mod){\\n vector<bool> bit;\\n for(b=b;b>0;b>>=1){\\n bit.push_back(b&1);\\n }\\n vector<int64> fac(bit.size()); fac[0] = a;\\n int64 res = 1;\\n for(int i=1;i<bit.size();i++){\\n fac[i] = (fac[i-1] * fac[i-1])%mod;\\n }\\n for(int i=0;i<bit.size();i++){\\n if(bit[i]) res*=fac[i];\\n res%=mod;\\n }\\n return res;\\n}\\n\\n\\n//mint\\nstruct mint {\\n int64 x;\\n mint(int64 x=0):x((x+2*MOD)%MOD){}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= MOD) x -= MOD;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += MOD-a.x) >= MOD) x -= MOD;\\n return *this;\\n }\\n mint& operator*=(const mint a) {\\n (x *= a.x) %= MOD;\\n return *this;\\n }\\n mint operator+(const mint a) const {\\n mint res(*this);\\n return res+=a;\\n }\\n mint operator-(const mint a) const {\\n mint res(*this);\\n return res-=a;\\n }\\n mint operator*(const mint a) const {\\n mint res(*this);\\n return res*=a;\\n }\\n mint pow(int64 t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime MOD\\n mint inv() const {\\n return pow(MOD-2);\\n }\\n mint& operator/=(const mint a) {\\n return (*this) *= a.inv();\\n }\\n mint operator/(const mint a) const {\\n mint res(*this);\\n return res/=a;\\n }\\n};\\nostream& operator<<(ostream& os, mint a){\\n os << a.x;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstruct Matrix{\\n vector<vector<T>> matrix_data;\\n Matrix(){}\\n Matrix(const vector<vector<T>>& matrix_data):matrix_data(matrix_data){}\\n Matrix(const T& val):matrix_data(vector<vector<T>>(1, vector<T>(1, val))){} //1*1の行列\\n\\n //単位行列\\n Matrix<T> Identity(size_t N){\\n vector<vector<T>> res(N,vector<T>(N,0));\\n for(size_t i=0; i<N; i++) res[i][i]=1;\\n return Matrix<T>(res);\\n }\\n\\n //累乗O(N^3 log k)\\n Matrix<T> power(int64 k){\\n Matrix<T> res = Matrix::Identity(matrix_data.size());\\n Matrix<T> tmp = *this;\\n\\n while(k){\\n if(k&1){res *= tmp;}\\n tmp *= tmp;\\n k >>= 1LL;\\n }\\n return res;\\n }\\n\\n void add_row(Matrix<T> const& A){\\n assert(A.matrix_data[0].size() == matrix_data[0].size());\\n \\n for(auto row:A.matrix_data){\\n matrix_data.emplace_back(row);\\n }\\n }\\n\\n void add_column(Matrix<T> const& A){\\n assert(A.matrix_data.size() == matrix_data.size());\\n \\n REP(i, A.matrix_data.size()){\\n for(auto v:A.matrix_data[i]){\\n matrix_data[i].emplace_back(v);\\n } \\n }\\n }\\n\\n Matrix<T> transpose(){\\n vector<vector<T>> res(matrix_data[0].size(), vector<T>(matrix_data.size()));\\n REP(i, matrix_data.size()){\\n REP(j, matrix_data[0].size()){\\n res[j][i] = matrix_data[i][j];\\n }\\n }\\n\\n return Matrix<T>(res);\\n }\\n\\n\\n};\\n\\ntemplate <typename T>\\nMatrix<T> operator+(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\\n assert(mat_a.matrix_data.size() == mat_b.matrix_data.size());\\n assert(mat_a.matrix_data[0].size() == mat_b.matrix_data[0].size());\\n size_t A = mat_a.matrix_data.size();\\n size_t B = mat_b.matrix_data[0].size();\\n\\n Matrix<T> res = mat_a;\\n \\n for(size_t i=0; i<A; i++){\\n for(size_t j=0; j<B; j++){\\n res.matrix_data[i][j] += mat_b.matrix_data[i][j];\\n }\\n }\\n\\n return res;\\n}\\n\\ntemplate <typename T>\\nMatrix<T>& operator+=(Matrix<T>& mat_a, Matrix<T>& mat_b){\\n mat_a = mat_a+mat_b;\\n return mat_a;\\n}\\n\\ntemplate <typename T>\\nMatrix<T> operator-(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\\n assert(mat_a.matrix_data.size() == mat_b.matrix_data.size());\\n assert(mat_a.matrix_data[0].size() == mat_b.matrix_data[0].size());\\n size_t A = mat_a.matrix_data.size();\\n size_t B = mat_b.matrix_data[0].size();\\n\\n Matrix<T> res = mat_a;\\n \\n for(size_t i=0; i<A; i++){\\n for(size_t j=0; j<B; j++){\\n res.matrix_data[i][j] -= mat_b.matrix_data[i][j];\\n }\\n }\\n\\n return res;\\n}\\n\\ntemplate <typename T>\\nMatrix<T>& operator-=(Matrix<T>& mat_a, Matrix<T>& mat_b){\\n mat_a = mat_a-mat_b;\\n return mat_a;\\n}\\n\\ntemplate <typename T>\\nbool is_scalar_(Matrix<T> const& A){\\n return A.matrix_data.size() == 1 and A.matrix_data[0].size() == 1;\\n}\\n\\ntemplate <typename T>\\nMatrix<T> operator*(const Matrix<T>& mat_a, const Matrix<T>& mat_b){\\n if( is_scalar_(mat_a) ){\\n return mat_a.matrix_data[0][0].x * mat_b;\\n }else if( is_scalar_(mat_b) ){\\n return mat_b.matrix_data[0][0].x * mat_a;\\n\\n }\\n size_t A = mat_a.matrix_data.size();\\n size_t B = mat_b.matrix_data.size();\\n assert(B > 0);\\n size_t C = mat_b.matrix_data[0].size();\\n\\n Matrix<T> res(vector<vector<T>>(A,vector<T>(C,0)));\\n \\n for(size_t i=0; i<A; i++){\\n assert(mat_a.matrix_data[i].size() == B);\\n for(size_t j=0; j<C; j++){\\n for(size_t k=0; k<B; k++){\\n res.matrix_data[i][j] += mat_a.matrix_data[i][k] * mat_b.matrix_data[k][j];\\n }\\n }\\n }\\n\\n return res;\\n}\\n\\ntemplate <typename T>\\nMatrix<T> operator*(const int& val, const Matrix<T>& mat_a){\\n Matrix<T> res = mat_a;\\n for(auto&& row: res.matrix_data){\\n for(auto&& a:row) a *= val;\\n }\\n \\n return res;\\n}\\n\\ntemplate <typename T>\\nMatrix<T>& operator*=(Matrix<T>& mat_a, Matrix<T>& mat_b){\\n mat_a = mat_a*mat_b;\\n return mat_a;\\n}\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const Matrix<T>& M){\\n REP(i,M.matrix_data.size()){\\n REP(j,M.matrix_data[0].size()){\\n os << M.matrix_data[i][j];\\n if(j!=M.matrix_data[0].size()-1) os<<\\\" \\\";\\n }\\n os << \\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\n\\n\\nmap<char, Matrix<mint>> matrix_dict;\\n\\n// 構文解析\\n/*\\n 構文解析でよくあるバグは次の二つです。\\n - begin++をし忘れる\\n - getlineとcinの混合\\n*/\\n\\n\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\n// beginがexpectedを指していたらbeginを一つ進める。\\nvoid consume(State &begin, char expected) {\\n if (*begin == expected) {\\n begin++;\\n } else {\\n cerr << \\\"Expected '\\\" << expected << \\\"' but got '\\\" << *begin << \\\"'\\\"\\n << endl;\\n cerr << \\\"Rest string is '\\\";\\n while (*begin) {\\n cerr << *begin++;\\n }\\n cerr << \\\"'\\\" << endl;\\n throw ParseError();\\n }\\n}\\nvoid print_rest_string(State begin){\\n cerr << \\\"Rest string is '\\\";\\n while (*begin) {\\n cerr << *begin++;\\n }\\n cerr << \\\"'\\\" << endl;\\n}\\n\\nbool is_capital(char C){\\n return 'A' <= C and C <= 'Z';\\n}\\n\\nMatrix<mint> expression(State &begin);\\nMatrix<mint> term(State &begin);\\nMatrix<mint> factor(State &begin);\\nMatrix<mint> primary(State &begin);\\nMatrix<mint> matrix(State &begin);\\nMatrix<mint> row(State &begin);\\nMatrix<mint> number(State &begin);\\n\\n// 四則演算の式をパースして、その評価結果を返す。\\nMatrix<mint> expression(State &begin){\\n Matrix<mint> res = term(begin);\\n\\n while(true){\\n if(*begin == '+'){\\n consume(begin, '+');\\n auto tmp = term(begin);\\n res += tmp;\\n }else if(*begin == '-'){\\n consume(begin, '-');\\n auto tmp = term(begin);\\n res -= tmp;\\n }else{\\n break;\\n }\\n }\\n\\n return res;\\n}\\n\\n// 乗算除算の式をパースして、その評価結果を返す。\\nMatrix<mint> term(State &begin){\\n Matrix<mint> res = factor(begin);\\n \\n while(true){\\n if(*begin == '*'){\\n consume(begin, '*');\\n auto tmp = factor(begin);\\n res *= tmp;\\n }else{\\n break;\\n }\\n }\\n\\n return res;\\n}\\n\\nMatrix<mint> factor(State &begin){\\n Matrix<mint> res;\\n if(*begin == '-'){\\n consume(begin, '-');\\n auto tmp = factor(begin);\\n res = (-1) * tmp ;\\n }else{\\n res = primary(begin);\\n }\\n return res;\\n}\\n\\nMatrix<mint> primary(State &begin){\\n Matrix<mint> res;\\n if( isdigit(*begin) ){\\n res = number(begin);\\n }else if( is_capital(*begin) ){\\n res = matrix_dict[*begin++];\\n }else if( *begin == '[' ){\\n res = matrix(begin);\\n }else if( *begin == '(' ){\\n consume(begin, '(');\\n res = expression(begin);\\n consume(begin, ')');\\n }else{\\n assert(false);\\n }\\n\\n while(true){\\n if(*begin == '('){\\n consume(begin, '(');\\n Matrix<mint> expr1 = expression(begin);\\n consume(begin, ',');\\n Matrix<mint> expr2 = expression(begin);\\n consume(begin, ')');\\n\\n assert(expr1.matrix_data.size()==1);\\n assert(expr2.matrix_data.size()==1);\\n\\n vector<vector<mint>> res_vec(expr1.matrix_data[0].size(), vector<mint>(expr2.matrix_data[0].size(), 0 ) );\\n REP(i, expr1.matrix_data[0].size()){\\n REP(j, expr2.matrix_data[0].size()){\\n res_vec[i][j] = res.matrix_data[ expr1.matrix_data[0][i].x-1 ][ expr2.matrix_data[0][j].x-1 ];\\n }\\n }\\n res = Matrix<mint>( res_vec );\\n }else if(*begin == '\\\\''){\\n consume(begin, '\\\\'');\\n res = res.transpose();\\n }else break;\\n\\n }\\n return res;\\n}\\n\\nMatrix<mint> matrix(State &begin){\\n consume(begin, '[');\\n\\n Matrix<mint> res = row(begin);\\n\\n while(true){\\n if(*begin == ';'){\\n consume(begin, ';');\\n res.add_row( row(begin) );\\n }else break;\\n }\\n\\n consume(begin, ']');\\n return res;\\n}\\n\\nMatrix<mint> row(State &begin){\\n Matrix<mint> res = expression(begin);\\n\\n while(true){\\n if(*begin == ' '){\\n consume(begin, ' ');\\n res.add_column( expression(begin) );\\n }else break;\\n }\\n\\n return res;\\n}\\n\\n// 数字の列をパースして、その数を返す。\\nMatrix<mint> number(State &begin){\\n int val = 0;\\n while(isdigit(*begin)){\\n val *= 10;\\n val += *begin - '0';\\n begin++;\\n }\\n\\n Matrix<mint> res(val);\\n return res;\\n}\\n\\nvoid solve(string S){\\n State begin = S.begin();\\n char var = *begin++;\\n consume(begin, '=');\\n\\n Matrix<mint> ans = expression(begin);\\n consume(begin, '.');\\n matrix_dict[var] = ans;\\n cout << ans;\\n}\\n\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int N;\\n string tmp;\\n while(getline(cin, tmp)){\\n N = stoi(tmp);\\n if(N==0) break;\\n REP(_, N){\\n string S; getline(cin,S);\\n // debug(S)\\n solve(S);\\n }\\n cout << \\\"-----\\\" << endl;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.1712,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1314_6021621\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=205,INF=1<<30;\\n\\n//modintのみ\\n\\n// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9\\n// (based on AtCoder STL)\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n \\n namespace internal {\\n \\n#ifndef _MSC_VER\\n template <class T>\\n using is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n \\n template <class T>\\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n \\n#else\\n \\n template <class T> using is_integral = typename std::is_integral<T>;\\n \\n template <class T>\\n using is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n \\n#endif\\n \\n template <class T>\\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n \\n template <class T>\\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n \\n template <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n \\n } // namespace internal\\n \\n} // namespace atcoder\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n \\n namespace internal {\\n \\n constexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n }\\n \\n struct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n \\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n \\n unsigned int umod() const { return _m; }\\n \\n unsigned int mul(unsigned int a, unsigned int b) const {\\n \\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n };\\n \\n constexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n }\\n \\n constexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n }\\n template <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n \\n constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n \\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n \\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n \\n \\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n }\\n \\n constexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n }\\n template <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n \\n } // namespace internal\\n \\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n \\n namespace internal {\\n \\n struct modint_base {};\\n struct static_modint_base : modint_base {};\\n \\n template <class T> using is_modint = std::is_base_of<modint_base, T>;\\n template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n \\n } // namespace internal\\n \\n template <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\n struct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n \\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n \\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n \\n unsigned int val() const { return _v; }\\n \\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n \\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n \\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n \\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n \\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n \\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n };\\n \\n template <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n \\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n \\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n \\n unsigned int val() const { return _v; }\\n \\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n \\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n \\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n \\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n \\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n \\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n };\\n template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n \\n using modint998244353 = static_modint<998244353>;\\n using modint1000000007 = static_modint<1000000007>;\\n using modint = dynamic_modint<-1>;\\n \\n namespace internal {\\n \\n template <class T>\\n using is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n \\n template <class T>\\n using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n \\n template <class> struct is_dynamic_modint : public std::false_type {};\\n template <int id>\\n struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n \\n template <class T>\\n using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n \\n } // namespace internal\\n \\n} // namespace atcoder\\n\\nusing mint=atcoder::modint;\\n\\nusing mat=vector<vector<mint>>;\\nusing vec=vector<mint>;\\n\\nmat TEN;\\n\\nmat add(mat &a,mat &b){\\n assert(si(a)==si(b));\\n assert(si(a[0])==si(b[0]));\\n mat c(si(a),vec(si(a[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n c[i][j]=a[i][j]+b[i][j];\\n }\\n }\\n return c;\\n}\\n\\nmat sub(mat &a,mat &b){\\n assert(si(a)==si(b));\\n assert(si(a[0])==si(b[0]));\\n mat c(si(a),vec(si(a[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n c[i][j]=a[i][j]-b[i][j];\\n }\\n }\\n return c;\\n}\\n\\nmat mul(mat &a,mat &b){\\n if(si(a[0])==si(b)){\\n mat c(si(a),vec(si(b[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n for(int k=0;k<si(a[0]);k++){\\n c[i][j]+=a[i][k]*b[k][j];\\n }\\n }\\n }\\n return c;\\n }else if(si(b)==1&&si(b[0])==1){\\n mat c(si(a),vec(si(a[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n c[i][j]=a[i][j]*b[0][0];\\n }\\n }\\n return c;\\n }else if(si(a)==1&&si(a[0])==1){\\n mat c(si(b),vec(si(b[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n c[i][j]=b[i][j]*a[0][0];\\n }\\n }\\n return c;\\n }else{\\n assert(false);\\n return TEN;\\n }\\n}\\n\\nmat neg(mat &a){\\n mat c(si(a),vec(si(a[0])));\\n for(int i=0;i<si(c);i++){\\n for(int j=0;j<si(c[0]);j++){\\n c[i][j]=-a[i][j];\\n }\\n }\\n return c;\\n}\\n\\nmap<char,mat> MA;\\nstring S;\\n\\nmat assignment(int &j);\\nchar var(int &j);\\nmat var2(int &j);\\nmat expr(int &j);\\nmat term(int &j);\\nmat factor(int &j);\\nmat primary(int &j);\\nmat primary_sub(int &j);\\nmat matrix(int &j);\\nmat row_seq(int &j);\\nmat row(int &j);\\nmat inum(int &j);\\nmat digit(int &j);\\n\\nmat assignment(int &j){\\n char c=var(j);\\n assert(S[j]=='=');\\n j++;\\n auto res=expr(j);\\n assert(S[j]=='.');\\n return MA[c]=res;\\n}\\n\\nchar var(int &j){\\n char res=S[j];\\n j++;\\n return res;\\n}\\n\\nmat var2(int &j){\\n char c=S[j];\\n assert(MA.count(c));\\n j++;\\n return MA[c];\\n}\\n\\nmat expr(int &j){\\n auto res=term(j);\\n while(j<si(S)){\\n char c=S[j];\\n if(c=='+'){\\n j++;\\n auto X=term(j);\\n res=add(res,X);\\n }else if(c=='-'){\\n j++;\\n auto X=term(j);\\n res=sub(res,X);\\n }else{\\n break;\\n }\\n }\\n return res;\\n}\\n\\nmat term(int &j){\\n auto res=factor(j);\\n while(j<si(S)){\\n char c=S[j];\\n if(c=='*'){\\n j++;\\n auto X=factor(j);\\n res=mul(res,X);\\n }else{\\n break;\\n }\\n }\\n return res;\\n}\\n\\nmat factor(int &j){\\n if(S[j]=='-'){\\n j++;\\n auto res=factor(j);\\n return neg(res);\\n }else{\\n return primary(j);\\n }\\n}\\n\\nmat primary(int &j){\\n auto res=primary_sub(j);\\n while(j<si(S)){\\n if(S[j]=='('){\\n j++;\\n auto H=expr(j);\\n assert(S[j]==',');\\n j++;\\n auto W=expr(j);\\n assert(S[j]==')');\\n j++;\\n mat X(si(H[0]),vec(si(W[0])));\\n for(int h=0;h<si(H[0]);h++){\\n for(int w=0;w<si(W[0]);w++){\\n X[h][w]=res[H[0][h].val()-1][W[0][w].val()-1];\\n }\\n }\\n res=X;\\n }else if(S[j]=='\\\\''){\\n j++;\\n mat X(si(res[0]),vec(si(res)));\\n for(int h=0;h<si(res);h++){\\n for(int w=0;w<si(res[0]);w++){\\n X[w][h]=res[h][w];\\n }\\n }\\n res=X;\\n }else{\\n break;\\n }\\n }\\n \\n return res;\\n}\\n\\nmat primary_sub(int &j){\\n if('0'<=S[j]&&S[j]<='9'){\\n return inum(j);\\n }else if('A'<=S[j]&&S[j]<='Z'){\\n return var2(j);\\n }else if(S[j]=='['){\\n return matrix(j);\\n }else if(S[j]=='('){\\n j++;\\n auto res=expr(j);\\n assert(S[j]==')');\\n j++;\\n return res;\\n }else{\\n assert(false);\\n return TEN;\\n }\\n}\\n\\nmat matrix(int &j){\\n j++;\\n auto res=row_seq(j);\\n assert(S[j]==']');\\n j++;\\n return res;\\n}\\n\\nmat row_seq(int &j){\\n auto res=row(j);\\n while(j<si(S)){\\n if(S[j]==';'){\\n j++;\\n auto X=row(j);\\n for(int h=0;h<si(X);h++) res.push_back(X[h]);\\n }else break;\\n }\\n return res;\\n}\\n\\nmat row(int &j){\\n auto res=expr(j);\\n while(j<si(S)){\\n if(S[j]==' '){\\n j++;\\n auto X=expr(j);\\n for(int h=0;h<si(X);h++){\\n for(int w=0;w<si(X[h]);w++){\\n res[h].push_back(X[h][w]);\\n }\\n }\\n }else{\\n break;\\n }\\n }\\n return res;\\n}\\n\\nmat inum(int &j){\\n mat res=digit(j);\\n while(j<si(S)){\\n if('0'<=S[j]&&S[j]<='9'){\\n res=mul(res,TEN);\\n auto X=digit(j);\\n res=add(res,X);\\n }else{\\n break;\\n }\\n }\\n return res;\\n}\\n\\nmat digit(int &j){\\n mint a=S[j]-'0';\\n mat res={{a}};\\n j++;\\n return res;\\n}\\n\\nint main() {\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n mint::set_mod(32768);\\n \\n TEN.push_back({});\\n TEN.back().push_back(10);\\n \\n while(1){\\n string N;\\n getline(cin,N);\\n if(N==\\\"0\\\") break;\\n int NN=stoi(N);\\n MA.clear();\\n for(int i=0;i<NN;i++){\\n getline(cin,S);\\n int j=0;\\n auto res=assignment(j);\\n for(int h=0;h<si(res);h++){\\n for(int w=0;w<si(res[h]);w++){\\n if(w) cout<<\\\" \\\";\\n cout<<res[h][w].val();\\n }\\n cout<<\\\"\\\\n\\\";\\n }\\n }\\n \\n cout<<\\\"-----\\\\n\\\";\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.1193,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1314_5998895\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntemplate< class T >\\nstruct Matrix {\\n vector< vector< T > > A;\\n\\n Matrix() {}\\n\\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\\n\\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\\n\\n size_t height() const {\\n return (A.size());\\n }\\n\\n size_t width() const {\\n return (A[0].size());\\n }\\n\\n inline const vector< T > &operator[](int k) const {\\n return (A.at(k));\\n }\\n\\n inline vector< T > &operator[](int k) {\\n return (A.at(k));\\n }\\n\\n static Matrix I(size_t n) {\\n Matrix mat(n);\\n for(int i = 0; i < n; i++) mat[i][i] = 1;\\n return (mat);\\n }\\n\\n Matrix &operator+=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator-=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator*=(const Matrix &B) {\\n if (B.height() == 1 and B.width() == 1){\\n auto res = *this * B[0][0];\\n this->A = res.A;\\n return (*this);\\n }\\n\\n if (this->height() == 1 and this->width() == 1){\\n auto res = (*this)[0][0] * B;\\n this->A = res.A;\\n return (*this);\\n }\\n\\n size_t n = height(), m = B.width(), p = width();\\n assert(p == B.height());\\n vector< vector< T > > C(n, vector< T >(m, 0));\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n for(int k = 0; k < p; k++)\\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\\n A.swap(C);\\n return (*this);\\n }\\n\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(height());\\n while(k > 0) {\\n if(k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1LL;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n\\n Matrix operator+(const Matrix &B) const {\\n return (Matrix(*this) += B);\\n }\\n\\n Matrix operator-(const Matrix &B) const {\\n return (Matrix(*this) -= B);\\n }\\n\\n Matrix operator*(const Matrix &B) const {\\n if (this->height() == 1 and this->width() == 1)\\n return (*this)[0][0] * B;\\n return (Matrix(*this) *= B);\\n }\\n\\n Matrix operator^(const long long k) const {\\n return (Matrix(*this) ^= k);\\n }\\n\\n Matrix operator*(const T &k) const {\\n auto res = Matrix(*this);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix operator*(const T &k, const Matrix &p) {\\n auto res = Matrix(p);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.width() == rhs.width());\\n Matrix res(lhs.height() + rhs.height(), lhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[lhs.height() + i][j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.height() == rhs.height());\\n Matrix res(lhs.height(), lhs.width() + rhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[i][lhs.width() + j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n Matrix t(){\\n Matrix res(this->width(), this->height());\\n for (int i = 0; i < this->height(); i++){\\n for (int j = 0; j < this->width(); j++)\\n res[j][i] = (*this)[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend ostream &operator<<(ostream &os, Matrix &p) {\\n size_t n = p.height(), m = p.width();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < m; j++) {\\n os << p[i][j] << (j + 1 == m ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n }\\n return (os);\\n }\\n\\n\\n T determinant() {\\n Matrix B(*this);\\n assert(width() == height());\\n T ret = 1;\\n for(int i = 0; i < width(); i++) {\\n int idx = -1;\\n for(int j = i; j < width(); j++) {\\n if(B[j][i] != 0) idx = j;\\n }\\n if(idx == -1) return (0);\\n if(i != idx) {\\n ret *= -1;\\n swap(B[i], B[idx]);\\n }\\n ret *= B[i][i];\\n T vv = B[i][i];\\n for(int j = 0; j < width(); j++) {\\n B[i][j] /= vv;\\n }\\n for(int j = i + 1; j < width(); j++) {\\n T a = B[j][i];\\n for(int k = 0; k < width(); k++) {\\n B[j][k] -= B[i][k] * a;\\n }\\n }\\n }\\n return (ret);\\n }\\n};\\n\\ntemplate <std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\n u64 a;\\n\\n public:\\n\\n template <class INT>\\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept {\\n return modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n return modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n return modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n return modint(*this) /= rhs;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if (a >= Modulus) {\\n a -= Modulus;\\n }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if (a < rhs.a) {\\n a += Modulus;\\n }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr modint &operator/=(modint rhs) noexcept {\\n u64 exp = Modulus - 2;\\n while (exp) {\\n if (exp % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n exp /= 2;\\n }\\n return *this;\\n }\\n\\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\\n\\n constexpr modint& operator++() noexcept {\\n *this += modint(1);\\n return *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint tmp(*this);\\n ++(*this);\\n return tmp;\\n }\\n constexpr modint& operator--() noexcept {\\n *this -= modint(1);\\n return *this;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint tmp(*this);\\n --(*this);\\n return tmp;\\n }\\n constexpr modint operator-() const noexcept {\\n return modint(0) - *this;\\n }\\n\\n template <std::uint_fast64_t M>\\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\\n os << rhs.a;\\n return os;\\n }\\n template <std::uint_fast64_t M>\\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\\n int64_t tmp;\\n is >> tmp;\\n rhs = modint(tmp);\\n return is;\\n }\\n\\n constexpr modint pow(const u64 k) const noexcept {\\n if (k == 0)\\n return 1;\\n if (k % 2 == 0){\\n modint res = pow(k / 2);\\n return res * res;\\n }\\n return pow(k - 1) * modint(*this);\\n }\\n\\n template <typename T>\\n operator const T (){return a;}\\n\\n};\\n\\nusing mint = modint<32768>;\\n\\nclass Parser{\\n string S;\\n int pos = 0;\\n map<char, Matrix<mint>> vars;\\n public:\\n Parser(string T) : S(T){}\\n\\n void set_s(string s){\\n S = s;\\n pos = 0;\\n }\\n\\n char peek(){\\n // if (pos < S.size())\\n // cerr << S[pos] << endl;\\n return pos < S.size() ? S[pos] : 'a';\\n }\\n\\n bool is_number(char c){\\n return '0' <= c and c <= '9';\\n }\\n\\n bool is_A_to_Z(char c){\\n return 'A' <= c and c <= 'Z';\\n }\\n\\n void skip_spaces(){\\n while (peek() == ' ')\\n pos++;\\n }\\n\\n void next(bool state){\\n assert(state);\\n pos++;\\n }\\n\\n Matrix<mint> assignment(){\\n char var_c = var();\\n next(peek() == '=');\\n vars[var_c] = expr();\\n next(peek() == '.');\\n \\n return vars[var_c];\\n }\\n\\n char var(){\\n char res = peek();\\n next('A' <= peek() and peek() <= 'Z');\\n return res;\\n }\\n\\n Matrix<mint> expr(){\\n Matrix<mint> res = term();\\n while (peek() == '+' or peek() == '-'){\\n if (peek() == '+'){\\n pos++;\\n res += term();\\n } else if (peek() == '-'){\\n pos++;\\n res -= term();\\n }\\n }\\n return res;\\n }\\n\\n Matrix<mint> term(){\\n Matrix<mint> res = factor();\\n while (peek() == '*'){\\n pos++;\\n res *= factor();\\n }\\n\\n return res;\\n }\\n\\n Matrix<mint> factor(){\\n if (peek() == '-'){\\n pos++;\\n return mint(-1) * factor();\\n }\\n\\n return primary();\\n }\\n\\n Matrix<mint> primary(){\\n auto res = Matrix<mint>(1, 1);\\n res[0][0] = -1;\\n if (is_number(peek())){\\n res[0][0] = number();\\n } else if (is_A_to_Z(peek())){\\n auto v = var();\\n res = vars[v];\\n } else if (peek() == '['){\\n res = matrix();\\n } else if (peek() == '('){\\n pos++;\\n res = expr();\\n next(peek() == ')');\\n }\\n\\n while (is_index() or peek() == '\\\\''){\\n if (peek() == '\\\\''){\\n pos++;\\n res = res.t();\\n } else if (is_index()){\\n next(peek() == '(');\\n auto left = expr();\\n next(peek() == ',');\\n auto right = expr();\\n next(peek() == ')');\\n Matrix<mint> res2(left.width(), right.width());\\n for (int i = 0; i < left.width(); i++){\\n for (int j = 0; j < right.width(); j++)\\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\\n }\\n res = res2;\\n }\\n }\\n\\n return res;\\n }\\n\\n bool is_index(){\\n if (peek() != '(')\\n return false;\\n int c = 0;\\n for (int i = pos; i < S.size(); i++){\\n if (S[i] == '(')\\n c++;\\n if (S[i] == ')'){\\n c--;\\n if (c == 0)\\n break;\\n }\\n if (S[i] == ',' and c == 1)\\n return true;\\n }\\n return false;\\n }\\n\\n Matrix<mint> matrix(){\\n next(peek() == '[');\\n auto res = row_seq();\\n next(peek() == ']');\\n return res;\\n }\\n\\n Matrix<mint> row_seq(){\\n auto res = row();\\n while (peek() == ';'){\\n pos++;\\n res = concat_v(res, row());\\n }\\n return res;\\n }\\n\\n Matrix<mint> row(){\\n auto res = expr();\\n while (peek() == ' '){\\n pos++;\\n res = concat_w(res, expr());\\n }\\n return res;\\n }\\n\\n mint number(){\\n mint res = 0;\\n while (is_number(peek())){\\n res = res * 10 + peek() - '0';\\n pos++;\\n }\\n return res;\\n }\\n};\\n\\nvoid solve(int n){\\n string stash;\\n getline(cin, stash);\\n Parser parser(\\\"\\\");\\n for (int i = 0; i < n; i++){\\n string s;\\n getline(cin, s);\\n parser.set_s(s);\\n auto res = parser.assignment();\\n cout << res;\\n }\\n puts(\\\"-----\\\");\\n}\\n\\nint main(){\\n int n;\\n while (true){\\n cin >> n;\\n if (n == 0)\\n break;\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -0.1625,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1314_5998887\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntemplate< class T >\\nstruct Matrix {\\n vector< vector< T > > A;\\n\\n Matrix() {}\\n\\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\\n\\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\\n\\n size_t height() const {\\n return (A.size());\\n }\\n\\n size_t width() const {\\n return (A[0].size());\\n }\\n\\n inline const vector< T > &operator[](int k) const {\\n return (A.at(k));\\n }\\n\\n inline vector< T > &operator[](int k) {\\n return (A.at(k));\\n }\\n\\n static Matrix I(size_t n) {\\n Matrix mat(n);\\n for(int i = 0; i < n; i++) mat[i][i] = 1;\\n return (mat);\\n }\\n\\n Matrix &operator+=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator-=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator*=(const Matrix &B) {\\n if (B.height() == 1 and B.width() == 1){\\n auto res = *this * B[0][0];\\n this->A = res.A;\\n return (*this);\\n }\\n\\n if (this->height() == 1 and this->width() == 1){\\n auto res = (*this)[0][0] * B;\\n this->A = res.A;\\n return (*this);\\n }\\n\\n size_t n = height(), m = B.width(), p = width();\\n assert(p == B.height());\\n vector< vector< T > > C(n, vector< T >(m, 0));\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n for(int k = 0; k < p; k++)\\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\\n A.swap(C);\\n return (*this);\\n }\\n\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(height());\\n while(k > 0) {\\n if(k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1LL;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n\\n Matrix operator+(const Matrix &B) const {\\n return (Matrix(*this) += B);\\n }\\n\\n Matrix operator-(const Matrix &B) const {\\n return (Matrix(*this) -= B);\\n }\\n\\n Matrix operator*(const Matrix &B) const {\\n if (this->height() == 1 and this->width() == 1)\\n return (*this)[0][0] * B;\\n return (Matrix(*this) *= B);\\n }\\n\\n Matrix operator^(const long long k) const {\\n return (Matrix(*this) ^= k);\\n }\\n\\n Matrix operator*(const T &k) const {\\n auto res = Matrix(*this);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix operator*(const T &k, const Matrix &p) {\\n auto res = Matrix(p);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.width() == rhs.width());\\n Matrix res(lhs.height() + rhs.height(), lhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[lhs.height() + i][j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.height() == rhs.height());\\n Matrix res(lhs.height(), lhs.width() + rhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[i][lhs.width() + j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n Matrix t(){\\n Matrix res(this->width(), this->height());\\n for (int i = 0; i < this->height(); i++){\\n for (int j = 0; j < this->width(); j++)\\n res[j][i] = (*this)[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend ostream &operator<<(ostream &os, Matrix &p) {\\n size_t n = p.height(), m = p.width();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < m; j++) {\\n os << p[i][j] << (j + 1 == m ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n }\\n return (os);\\n }\\n\\n\\n T determinant() {\\n Matrix B(*this);\\n assert(width() == height());\\n T ret = 1;\\n for(int i = 0; i < width(); i++) {\\n int idx = -1;\\n for(int j = i; j < width(); j++) {\\n if(B[j][i] != 0) idx = j;\\n }\\n if(idx == -1) return (0);\\n if(i != idx) {\\n ret *= -1;\\n swap(B[i], B[idx]);\\n }\\n ret *= B[i][i];\\n T vv = B[i][i];\\n for(int j = 0; j < width(); j++) {\\n B[i][j] /= vv;\\n }\\n for(int j = i + 1; j < width(); j++) {\\n T a = B[j][i];\\n for(int k = 0; k < width(); k++) {\\n B[j][k] -= B[i][k] * a;\\n }\\n }\\n }\\n return (ret);\\n }\\n};\\n\\ntemplate <std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\n u64 a;\\n\\n public:\\n\\n template <class INT>\\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept {\\n return modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n return modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n return modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n return modint(*this) /= rhs;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if (a >= Modulus) {\\n a -= Modulus;\\n }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if (a < rhs.a) {\\n a += Modulus;\\n }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr modint &operator/=(modint rhs) noexcept {\\n u64 exp = Modulus - 2;\\n while (exp) {\\n if (exp % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n exp /= 2;\\n }\\n return *this;\\n }\\n\\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\\n\\n constexpr modint& operator++() noexcept {\\n *this += modint(1);\\n return *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint tmp(*this);\\n ++(*this);\\n return tmp;\\n }\\n constexpr modint& operator--() noexcept {\\n *this -= modint(1);\\n return *this;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint tmp(*this);\\n --(*this);\\n return tmp;\\n }\\n constexpr modint operator-() const noexcept {\\n return modint(0) - *this;\\n }\\n\\n template <std::uint_fast64_t M>\\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\\n os << rhs.a;\\n return os;\\n }\\n template <std::uint_fast64_t M>\\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\\n int64_t tmp;\\n is >> tmp;\\n rhs = modint(tmp);\\n return is;\\n }\\n\\n constexpr modint pow(const u64 k) const noexcept {\\n if (k == 0)\\n return 1;\\n if (k % 2 == 0){\\n modint res = pow(k / 2);\\n return res * res;\\n }\\n return pow(k - 1) * modint(*this);\\n }\\n\\n template <typename T>\\n operator const T (){return a;}\\n\\n};\\n\\nusing mint = modint<32768>;\\n\\nclass Parser{\\n string S;\\n int pos = 0;\\n map<char, Matrix<mint>> vars;\\n public:\\n Parser(string T) : S(T){}\\n\\n void set_s(string s){\\n S = s;\\n pos = 0;\\n }\\n\\n char peek(){\\n // if (pos < S.size())\\n // cerr << S[pos] << endl;\\n return pos < S.size() ? S[pos] : 'a';\\n }\\n\\n bool is_number(char c){\\n return '0' <= c and c <= '9';\\n }\\n\\n bool is_A_to_Z(char c){\\n return 'A' <= c and c <= 'Z';\\n }\\n\\n void skip_spaces(){\\n while (peek() == ' ')\\n pos++;\\n }\\n\\n Matrix<mint> assignment(){\\n char var_c = var();\\n assert(peek() == '=');\\n pos++;\\n vars[var_c] = expr();\\n assert(peek() == '.');\\n pos++;\\n\\n return vars[var_c];\\n }\\n\\n char var(){\\n assert('A' <= peek() and peek() <= 'Z');\\n char res = peek();\\n pos++;\\n return res;\\n }\\n\\n Matrix<mint> expr(){\\n Matrix<mint> res = term();\\n while (peek() == '+' or peek() == '-'){\\n if (peek() == '+'){\\n pos++;\\n res += term();\\n } else if (peek() == '-'){\\n pos++;\\n res -= term();\\n }\\n }\\n return res;\\n }\\n\\n Matrix<mint> term(){\\n Matrix<mint> res = factor();\\n while (peek() == '*'){\\n pos++;\\n res *= factor();\\n }\\n\\n return res;\\n }\\n\\n Matrix<mint> factor(){\\n if (peek() == '-'){\\n pos++;\\n return mint(-1) * factor();\\n }\\n\\n return primary();\\n }\\n\\n Matrix<mint> primary(){\\n auto res = Matrix<mint>(1, 1);\\n res[0][0] = -1;\\n if (is_number(peek())){\\n res[0][0] = number();\\n } else if (is_A_to_Z(peek())){\\n auto v = var();\\n res = vars[v];\\n } else if (peek() == '['){\\n res = matrix();\\n } else if (peek() == '('){\\n pos++;\\n res = expr();\\n assert(peek() == ')');\\n pos++;\\n }\\n\\n while (is_index() or peek() == '\\\\''){\\n if (peek() == '\\\\''){\\n pos++;\\n res = res.t();\\n } else if (is_index()){\\n assert(peek() == '(');\\n pos++;\\n auto left = expr();\\n assert(peek() == ',');\\n pos++;\\n auto right = expr();\\n assert(peek() == ')');\\n pos++;\\n Matrix<mint> res2(left.width(), right.width());\\n for (int i = 0; i < left.width(); i++){\\n for (int j = 0; j < right.width(); j++)\\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\\n }\\n res = res2;\\n }\\n }\\n\\n return res;\\n }\\n\\n bool is_index(){\\n if (peek() != '(')\\n return false;\\n int c = 0;\\n for (int i = pos; i < S.size(); i++){\\n if (S[i] == '(')\\n c++;\\n if (S[i] == ')'){\\n c--;\\n if (c == 0)\\n break;\\n }\\n if (S[i] == ',' and c == 1)\\n return true;\\n }\\n return false;\\n }\\n\\n Matrix<mint> matrix(){\\n assert(peek() == '[');\\n pos++;\\n auto res = row_seq();\\n assert(peek() == ']');\\n pos++;\\n return res;\\n }\\n\\n Matrix<mint> row_seq(){\\n auto res = row();\\n while (peek() == ';'){\\n pos++;\\n res = concat_v(res, row());\\n }\\n return res;\\n }\\n\\n Matrix<mint> row(){\\n auto res = expr();\\n while (peek() == ' '){\\n pos++;\\n res = concat_w(res, expr());\\n }\\n return res;\\n }\\n\\n mint number(){\\n mint res = 0;\\n while (is_number(peek())){\\n res = res * 10 + peek() - '0';\\n pos++;\\n }\\n return res;\\n }\\n};\\n\\nvoid solve(int n){\\n string stash;\\n getline(cin, stash);\\n Parser parser(\\\"\\\");\\n for (int i = 0; i < n; i++){\\n string s;\\n getline(cin, s);\\n parser.set_s(s);\\n auto res = parser.assignment();\\n cout << res;\\n }\\n puts(\\\"-----\\\");\\n}\\n\\nint main(){\\n int n;\\n while (true){\\n cin >> n;\\n if (n == 0)\\n break;\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.1366,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1314_5998884\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntemplate< class T >\\nstruct Matrix {\\n vector< vector< T > > A;\\n\\n Matrix() {}\\n\\n Matrix(size_t n, size_t m) : A(n, vector< T >(m, 0)) {}\\n\\n Matrix(size_t n) : A(n, vector< T >(n, 0)) {};\\n\\n size_t height() const {\\n return (A.size());\\n }\\n\\n size_t width() const {\\n return (A[0].size());\\n }\\n\\n inline const vector< T > &operator[](int k) const {\\n return (A.at(k));\\n }\\n\\n inline vector< T > &operator[](int k) {\\n return (A.at(k));\\n }\\n\\n static Matrix I(size_t n) {\\n Matrix mat(n);\\n for(int i = 0; i < n; i++) mat[i][i] = 1;\\n return (mat);\\n }\\n\\n Matrix &operator+=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] += B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator-=(const Matrix &B) {\\n size_t n = height(), m = width();\\n assert(n == B.height() && m == B.width());\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n (*this)[i][j] -= B[i][j];\\n return (*this);\\n }\\n\\n Matrix &operator*=(const Matrix &B) {\\n if (B.height() == 1 and B.width() == 1){\\n auto res = *this * B[0][0];\\n this->A = res.A;\\n return (*this);\\n }\\n\\n if (this->height() == 1 and this->width() == 1){\\n auto res = (*this)[0][0] * B;\\n this->A = res.A;\\n return (*this);\\n }\\n\\n size_t n = height(), m = B.width(), p = width();\\n assert(p == B.height());\\n vector< vector< T > > C(n, vector< T >(m, 0));\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < m; j++)\\n for(int k = 0; k < p; k++)\\n C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);\\n A.swap(C);\\n return (*this);\\n }\\n\\n Matrix &operator^=(long long k) {\\n Matrix B = Matrix::I(height());\\n while(k > 0) {\\n if(k & 1) B *= *this;\\n *this *= *this;\\n k >>= 1LL;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n\\n Matrix operator+(const Matrix &B) const {\\n return (Matrix(*this) += B);\\n }\\n\\n Matrix operator-(const Matrix &B) const {\\n return (Matrix(*this) -= B);\\n }\\n\\n Matrix operator*(const Matrix &B) const {\\n if (this->height() == 1 and this->width() == 1)\\n return (*this)[0][0] * B;\\n return (Matrix(*this) *= B);\\n }\\n\\n Matrix operator^(const long long k) const {\\n return (Matrix(*this) ^= k);\\n }\\n\\n Matrix operator*(const T &k) const {\\n auto res = Matrix(*this);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix operator*(const T &k, const Matrix &p) {\\n auto res = Matrix(p);\\n for (int i = 0; i < res.height(); i++){\\n for (int j = 0; j < res.width(); j++)\\n res[i][j] *= k;\\n }\\n return res;\\n }\\n\\n friend Matrix concat_v(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.width() == rhs.width());\\n Matrix res(lhs.height() + rhs.height(), lhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[lhs.height() + i][j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend Matrix concat_w(const Matrix &lhs, const Matrix &rhs){\\n assert(lhs.height() == rhs.height());\\n Matrix res(lhs.height(), lhs.width() + rhs.width());\\n for (int i = 0; i < lhs.height(); i++){\\n for (int j = 0; j < lhs.width(); j++)\\n res[i][j] = lhs[i][j];\\n }\\n for (int i = 0; i < rhs.height(); i++){\\n for (int j = 0; j < rhs.width(); j++)\\n res[i][lhs.width() + j] = rhs[i][j];\\n }\\n\\n return res;\\n }\\n\\n Matrix t(){\\n Matrix res(this->width(), this->height());\\n for (int i = 0; i < this->height(); i++){\\n for (int j = 0; j < this->width(); j++)\\n res[j][i] = (*this)[i][j];\\n }\\n\\n return res;\\n }\\n\\n friend ostream &operator<<(ostream &os, Matrix &p) {\\n size_t n = p.height(), m = p.width();\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < m; j++) {\\n os << p[i][j] << (j + 1 == m ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n }\\n return (os);\\n }\\n\\n\\n T determinant() {\\n Matrix B(*this);\\n assert(width() == height());\\n T ret = 1;\\n for(int i = 0; i < width(); i++) {\\n int idx = -1;\\n for(int j = i; j < width(); j++) {\\n if(B[j][i] != 0) idx = j;\\n }\\n if(idx == -1) return (0);\\n if(i != idx) {\\n ret *= -1;\\n swap(B[i], B[idx]);\\n }\\n ret *= B[i][i];\\n T vv = B[i][i];\\n for(int j = 0; j < width(); j++) {\\n B[i][j] /= vv;\\n }\\n for(int j = i + 1; j < width(); j++) {\\n T a = B[j][i];\\n for(int k = 0; k < width(); k++) {\\n B[j][k] -= B[i][k] * a;\\n }\\n }\\n }\\n return (ret);\\n }\\n};\\n\\ntemplate <std::uint_fast64_t Modulus> class modint {\\n using u64 = std::uint_fast64_t;\\n u64 a;\\n\\n public:\\n\\n template <class INT>\\n constexpr modint(const INT x = 0) noexcept : a(x >= 0 ? x % Modulus : x % int_fast64_t(Modulus) + Modulus) {}\\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\\n constexpr u64 &value() noexcept { return a; }\\n constexpr const u64 &value() const noexcept { return a; }\\n constexpr modint operator+(const modint rhs) const noexcept {\\n return modint(*this) += rhs;\\n }\\n constexpr modint operator-(const modint rhs) const noexcept {\\n return modint(*this) -= rhs;\\n }\\n constexpr modint operator*(const modint rhs) const noexcept {\\n return modint(*this) *= rhs;\\n }\\n constexpr modint operator/(const modint rhs) const noexcept {\\n return modint(*this) /= rhs;\\n }\\n constexpr modint &operator+=(const modint rhs) noexcept {\\n a += rhs.a;\\n if (a >= Modulus) {\\n a -= Modulus;\\n }\\n return *this;\\n }\\n constexpr modint &operator-=(const modint rhs) noexcept {\\n if (a < rhs.a) {\\n a += Modulus;\\n }\\n a -= rhs.a;\\n return *this;\\n }\\n constexpr modint &operator*=(const modint rhs) noexcept {\\n a = a * rhs.a % Modulus;\\n return *this;\\n }\\n constexpr modint &operator/=(modint rhs) noexcept {\\n u64 exp = Modulus - 2;\\n while (exp) {\\n if (exp % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n exp /= 2;\\n }\\n return *this;\\n }\\n\\n constexpr bool operator<(const modint& rhs) const noexcept {return this->a < rhs.a;}\\n constexpr bool operator>(const modint& rhs) const noexcept {return rhs < *this;}\\n constexpr bool operator<=(const modint& rhs) const noexcept {return !(*this > rhs);}\\n constexpr bool operator>=(const modint& rhs) const noexcept {return !(*this < rhs);}\\n constexpr bool operator==(const modint& rhs) const noexcept {return this->a == rhs.a;}\\n constexpr bool operator!=(const modint& rhs) const noexcept {return !(*this == rhs);}\\n\\n constexpr modint& operator++() noexcept {\\n *this += modint(1);\\n return *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint tmp(*this);\\n ++(*this);\\n return tmp;\\n }\\n constexpr modint& operator--() noexcept {\\n *this -= modint(1);\\n return *this;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint tmp(*this);\\n --(*this);\\n return tmp;\\n }\\n constexpr modint operator-() const noexcept {\\n return modint(0) - *this;\\n }\\n\\n template <std::uint_fast64_t M>\\n friend constexpr std::ostream& operator<<(std::ostream& os, const modint<M>& rhs) noexcept {\\n os << rhs.a;\\n return os;\\n }\\n template <std::uint_fast64_t M>\\n friend constexpr std::istream& operator>>(std::istream& is, modint<M>& rhs) noexcept {\\n int64_t tmp;\\n is >> tmp;\\n rhs = modint(tmp);\\n return is;\\n }\\n\\n constexpr modint pow(const u64 k) const noexcept {\\n if (k == 0)\\n return 1;\\n if (k % 2 == 0){\\n modint res = pow(k / 2);\\n return res * res;\\n }\\n return pow(k - 1) * modint(*this);\\n }\\n\\n template <typename T>\\n operator const T (){return a;}\\n\\n};\\n\\nusing mint = modint<32768>;\\n\\nclass Parser{\\n string S;\\n int pos = 0;\\n map<char, Matrix<mint>> vars;\\n public:\\n Parser(string T) : S(T){}\\n\\n void set_s(string s){\\n S = s;\\n pos = 0;\\n }\\n\\n char peek(){\\n // if (pos < S.size())\\n // cerr << S[pos] << endl;\\n return pos < S.size() ? S[pos] : 'a';\\n }\\n\\n bool is_number(char c){\\n return '0' <= c and c <= '9';\\n }\\n\\n bool is_A_to_Z(char c){\\n return 'A' <= c and c <= 'Z';\\n }\\n\\n void skip_spaces(){\\n while (peek() == ' ')\\n pos++;\\n }\\n\\n Matrix<mint> assignment(){\\n char var_c = var();\\n assert(peek() == '=');\\n pos++;\\n vars[var_c] = expr();\\n assert(peek() == '.');\\n pos++;\\n\\n return vars[var_c];\\n }\\n\\n char var(){\\n assert('A' <= peek() and peek() <= 'Z');\\n char res = peek();\\n pos++;\\n return res;\\n }\\n\\n Matrix<mint> expr(){\\n Matrix<mint> res = term();\\n while (peek() == '+' or peek() == '-'){\\n if (peek() == '+'){\\n pos++;\\n res += term();\\n } else if (peek() == '-'){\\n pos++;\\n res -= term();\\n }\\n }\\n return res;\\n }\\n\\n Matrix<mint> term(){\\n Matrix<mint> res = factor();\\n while (peek() == '*'){\\n pos++;\\n res *= factor();\\n }\\n\\n return res;\\n }\\n\\n Matrix<mint> factor(){\\n if (peek() == '-'){\\n pos++;\\n return mint(-1) * factor();\\n }\\n\\n return primary();\\n }\\n\\n Matrix<mint> primary(){\\n auto res = Matrix<mint>(1, 1);\\n res[0][0] = -1;\\n if (is_number(peek())){\\n res[0][0] = number();\\n } else if (is_A_to_Z(peek())){\\n auto v = var();\\n res = vars[v];\\n } else if (peek() == '['){\\n res = matrix();\\n }\\n\\n if (!is_index() and peek() == '('){\\n pos++;\\n res = expr();\\n assert(peek() == ')');\\n pos++;\\n }\\n\\n while (is_index() or peek() == '\\\\''){\\n if (peek() == '\\\\''){\\n pos++;\\n res = res.t();\\n } else if (is_index()){\\n assert(peek() == '(');\\n pos++;\\n auto left = expr();\\n assert(peek() == ',');\\n pos++;\\n auto right = expr();\\n assert(peek() == ')');\\n pos++;\\n Matrix<mint> res2(left.width(), right.width());\\n for (int i = 0; i < left.width(); i++){\\n for (int j = 0; j < right.width(); j++)\\n res2[i][j] = res[left[0][i] - 1][right[0][j] - 1];\\n }\\n res = res2;\\n }\\n }\\n\\n return res;\\n }\\n\\n bool is_index(){\\n if (peek() != '(')\\n return false;\\n int c = 0;\\n for (int i = pos; i < S.size(); i++){\\n if (S[i] == '(')\\n c++;\\n if (S[i] == ')'){\\n c--;\\n if (c == 0)\\n break;\\n }\\n if (S[i] == ',' and c == 1)\\n return true;\\n }\\n return false;\\n }\\n\\n Matrix<mint> matrix(){\\n assert(peek() == '[');\\n pos++;\\n auto res = row_seq();\\n assert(peek() == ']');\\n pos++;\\n return res;\\n }\\n\\n Matrix<mint> row_seq(){\\n auto res = row();\\n while (peek() == ';'){\\n pos++;\\n res = concat_v(res, row());\\n }\\n return res;\\n }\\n\\n Matrix<mint> row(){\\n auto res = expr();\\n while (peek() == ' '){\\n pos++;\\n res = concat_w(res, expr());\\n }\\n return res;\\n }\\n\\n mint number(){\\n mint res = 0;\\n while (is_number(peek())){\\n res = res * 10 + peek() - '0';\\n pos++;\\n }\\n return res;\\n }\\n};\\n\\nvoid solve(int n){\\n string stash;\\n getline(cin, stash);\\n Parser parser(\\\"\\\");\\n for (int i = 0; i < n; i++){\\n string s;\\n getline(cin, s);\\n parser.set_s(s);\\n auto res = parser.assignment();\\n cout << res;\\n }\\n puts(\\\"-----\\\");\\n}\\n\\nint main(){\\n int n;\\n while (true){\\n cin >> n;\\n if (n == 0)\\n break;\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.1248,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1314_5955269\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.10.10 10:33:56 */\\n\\n#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region modint\\n\\nconst int mod = (1 << 15);\\n\\ntemplate <int mod>\\nstruct ModInt {\\n\\tint x;\\n\\tModInt() : x(0) {}\\n\\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\tModInt &operator+=(const ModInt &p) {\\n\\t\\tif((x += p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p) {\\n\\t\\tif((x += mod - p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p) {\\n\\t\\tx = (int)(1LL * x * p.x % mod);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p) {\\n\\t\\t*this *= p.inverse();\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt operator-() const { return ModInt(-x); }\\n\\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\tbool operator==(const ModInt &p) const { return x == p.x; }\\n\\tbool operator!=(const ModInt &p) const { return x != p.x; }\\n\\tModInt inverse() const {\\n\\t\\tint a = x, b = mod, u = 1, v = 0, t;\\n\\t\\twhile(b > 0) {\\n\\t\\t\\tt = a / b;\\n\\t\\t\\tswap(a -= t * b, b);\\n\\t\\t\\tswap(u -= t * v, v);\\n\\t\\t}\\n\\t\\treturn ModInt(u);\\n\\t}\\n\\tModInt pow(long long n) const {\\n\\t\\tModInt ret(1), mul(x);\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n\\tfriend istream &operator>>(istream &is, ModInt &a) {\\n\\t\\tlong long t;\\n\\t\\tis >> t;\\n\\t\\ta = ModInt<mod>(t);\\n\\t\\treturn (is);\\n\\t}\\n\\tstatic int get_mod() { return mod; }\\n};\\nusing mint = ModInt<mod>;\\n\\n#pragma endregion\\n\\nstruct matrix {\\n\\tint row_size, col_size;\\n\\tVV<mint> mat;\\n\\n\\tmatrix() = default;\\n\\tmatrix(int h, int w, mint value = 0) : row_size(h), col_size(w), mat(h, V<mint>(w, value)) {}\\n\\tmatrix(mint val) : row_size(1), col_size(1), mat(1, V<mint>(1, val)) {}\\n\\tmatrix(VV<mint> m) : row_size(m.size()), col_size(m[0].size()), mat(m) {}\\n\\n\\tV<mint> &operator[](int idx) { return mat[idx]; }\\n\\n\\tmatrix operator+(matrix right) {\\n\\t\\tassert(row_size == right.row_size && col_size == right.col_size);\\n\\t\\tauto ret = mat;\\n\\t\\trep(i, row_size) rep(j, col_size) { ret[i][j] += right[i][j]; }\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tmatrix operator-(matrix right) {\\n\\t\\tassert(row_size == right.row_size && col_size == right.col_size);\\n\\t\\tauto ret = mat;\\n\\t\\trep(i, row_size) rep(j, col_size) { ret[i][j] -= right[i][j]; }\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tmatrix operator*(mint right) {\\n\\t\\tauto ret = mat;\\n\\t\\trep(i, row_size) rep(j, col_size) { ret[i][j] *= right; }\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tmatrix operator*(matrix right) {\\n\\t\\tif(right.row_size + right.col_size == 2) return *(this) * right[0][0];\\n\\t\\tif(row_size + col_size == 2) return right * mat[0][0];\\n\\t\\tassert(col_size == right.row_size);\\n\\t\\tmatrix ret(row_size, right.col_size);\\n\\t\\trep(i, row_size) rep(k, col_size) rep(j, right.col_size) { ret[i][j] += mat[i][k] * right[k][j]; }\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tmatrix conjugate_side(matrix right) {\\n\\t\\tassert(row_size == right.row_size);\\n\\t\\tVV<mint> ret = mat;\\n\\t\\trep(r, row_size) {\\n\\t\\t\\trep(c, right.col_size) { ret[r].push_back(right[r][c]); }\\n\\t\\t}\\n\\t\\treturn matrix(ret);\\n\\t}\\n\\n\\tmatrix conjugate_bottom(matrix under) {\\n\\t\\tif(col_size != under.col_size) {\\n\\t\\t\\tdebug(mat);\\n\\t\\t\\tdebug(under.mat);\\n\\t\\t\\tdebug(col_size, under.col_size);\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t\\tVV<mint> ret = mat;\\n\\t\\tfoa(v, under.mat) { ret.push_back(v); }\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tmatrix transpose() {\\n\\t\\tmatrix ret(col_size, row_size);\\n\\t\\trep(i, row_size) rep(j, col_size) ret[j][i] = mat[i][j];\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tvoid print() {\\n\\t\\trep(i, row_size) {\\n\\t\\t\\trep(j, col_size) {\\n\\t\\t\\t\\tcout << mat[i][j];\\n\\t\\t\\t\\tif(j == col_size - 1) {\\n\\t\\t\\t\\t\\tcout << dl;\\n\\t\\t\\t\\t} else\\n\\t\\t\\t\\t\\tcout << sp;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nstring s;\\nstring::iterator it;\\nV<matrix> vars(26);\\nstruct parser {\\n\\tparser() { it = s.begin(); }\\n\\tvoid consume(const char &c) {\\n\\t\\tif(*it == c) {\\n\\t\\t\\tit++;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tdebug(s);\\n\\t\\tdebug(it - s.begin());\\n\\t\\tdebug(\\\"consumed:\\\", c);\\n\\t\\tif(it != s.end())\\n\\t\\t\\tcerr << \\\"but in this case\\\" << '\\\\'' << *it << '\\\\'';\\n\\t\\telse\\n\\t\\t\\tcerr << \\\"but in this case, program has ended\\\";\\n\\t\\tcerr << dl;\\n\\t\\texit(0);\\n\\t}\\n\\tmatrix assignment() {\\n\\t\\tint v = var();\\n\\t\\tconsume('=');\\n\\t\\tdebug(\\\"eq\\\", v, it - s.begin());\\n\\t\\tmatrix e = expr();\\n\\t\\tdebug(e.mat);\\n\\t\\tconsume('.');\\n\\t\\tassert(it == s.end());\\n\\t\\tvars[v] = e;\\n\\t\\treturn e;\\n\\t}\\n\\tmint dig() { return *it++ - '0'; }\\n\\tmint inum() {\\n\\t\\tmint ret = 0;\\n\\t\\tassert(isdigit(*it));\\n\\t\\twhile(isdigit(*it)) {\\n\\t\\t\\tret *= 10;\\n\\t\\t\\tret += dig();\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tint var() {\\n\\t\\tassert(isalpha(*it));\\n\\t\\treturn *it++ - 'A';\\n\\t}\\n\\tmatrix expr() {\\n\\t\\tmatrix ret = term();\\n\\t\\twhile(it != s.end()) {\\n\\t\\t\\tif(*it == '+') {\\n\\t\\t\\t\\tconsume('+');\\n\\t\\t\\t\\tret = ret + term();\\n\\t\\t\\t} else if(*it == '-') {\\n\\t\\t\\t\\tconsume('-');\\n\\t\\t\\t\\tret = ret - term();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(ret.mat, it - s.begin());\\n\\t\\treturn ret;\\n\\t}\\n\\tmatrix term() {\\n\\t\\tmatrix ret = factor();\\n\\t\\twhile(it != s.end() && *it == '*') {\\n\\t\\t\\tconsume('*');\\n\\t\\t\\tret = ret * factor();\\n\\t\\t}\\n\\t\\tdebug(ret.mat, it - s.begin());\\n\\t\\treturn ret;\\n\\t}\\n\\tmatrix factor() {\\n\\t\\tif(*it == '-') {\\n\\t\\t\\tconsume('-');\\n\\t\\t\\treturn factor() * mint(-1);\\n\\t\\t}\\n\\t\\treturn primary();\\n\\t}\\n\\tmatrix primary() {\\n\\t\\tmatrix ret;\\n\\t\\tif(isalpha(*it))\\n\\t\\t\\tret = matrix(vars[var()]);\\n\\t\\telse if(isdigit(*it))\\n\\t\\t\\tret = inum();\\n\\t\\telse if(*it == '(') {\\n\\t\\t\\tconsume('(');\\n\\t\\t\\tret = expr();\\n\\t\\t\\tconsume(')');\\n\\t\\t} else {\\n\\t\\t\\tconsume('[');\\n\\t\\t\\tret = row_seq();\\n\\t\\t\\tconsume(']');\\n\\t\\t}\\n\\t\\twhile(it != s.end()) {\\n\\t\\t\\tif(*it == '\\\\'') {\\n\\t\\t\\t\\tconsume('\\\\'');\\n\\t\\t\\t\\tret = ret.transpose();\\n\\t\\t\\t} else if(*it == '(') {\\n\\t\\t\\t\\tconsume('(');\\n\\t\\t\\t\\tmatrix rows = expr();\\n\\t\\t\\t\\tconsume(',');\\n\\t\\t\\t\\tmatrix cols = expr();\\n\\t\\t\\t\\tconsume(')');\\n\\t\\t\\t\\tassert(rows.row_size == 1);\\n\\t\\t\\t\\tassert(cols.row_size == 1);\\n\\t\\t\\t\\tmatrix nxt(rows.col_size, cols.col_size);\\n\\t\\t\\t\\trep(i, rows.col_size) rep(j, cols.col_size) { nxt[i][j] = ret[(rows[0][i] - 1).x][(cols[0][j] - 1).x]; }\\n\\t\\t\\t\\tswap(nxt, ret);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t// mat indexed_primary() {}\\n\\t// mat transposed_primary() {}\\n\\tmatrix row_seq() {\\n\\t\\tmatrix ret = row();\\n\\t\\tdebug(ret.mat);\\n\\t\\twhile(it != s.end() && *it == ';') {\\n\\t\\t\\tconsume(';');\\n\\t\\t\\tret = ret.conjugate_bottom(row());\\n\\t\\t\\tdebug(ret.mat);\\n\\t\\t}\\n\\t\\tdebug(ret.mat);\\n\\t\\treturn ret;\\n\\t}\\n\\tmatrix row() {\\n\\t\\tmatrix ret = expr();\\n\\t\\twhile(it != s.end() && *it == ' ') {\\n\\t\\t\\tconsume(' ');\\n\\t\\t\\tret = ret.conjugate_side(expr());\\n\\t\\t}\\n\\t\\tdebug(ret.mat);\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nvoid solve(int n) {\\n\\tcin.ignore();\\n\\trep(n) {\\n\\t\\tdebug(n);\\n\\t\\tgetline(cin, s);\\n\\t\\tdebug(s);\\n\\t\\tparser ps;\\n\\t\\tps.assignment().print();\\n\\t}\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n && n) {\\n\\t\\tsolve(n);\\n\\t\\tcout << \\\"-----\\\" << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3764,\n \"score_of_the_acc\": -0.1335,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1314_5953886\",\n \"code_snippet\": \"#define MOD_TYPE 1\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//#include <atcoder/all>\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\n#if 0\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing Int = boost::multiprecision::cpp_int;\\nusing lld = boost::multiprecision::cpp_dec_float_100;\\n#endif\\n\\n#if 1\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n\\n#pragma region Macros\\n\\nusing ll = long long int;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pld = pair<ld, ld>;\\ntemplate <typename Q_type>\\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\\n\\n#if MOD_TYPE == 1\\nconstexpr ll MOD = ll(1e9 + 7);\\n#else\\n#if MOD_TYPE == 2\\nconstexpr ll MOD = 998244353;\\n#else\\nconstexpr ll MOD = 1000003;\\n#endif\\n#endif\\n\\nusing mint = static_modint<MOD>;\\nconstexpr int INF = (int)1e9 + 10;\\nconstexpr ll LINF = (ll)4e18;\\nconstexpr double PI = acos(-1.0);\\nconstexpr double EPS = 1e-11;\\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\\n\\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\\n#define repi(i, n) REPI(i, 0, n)\\n#define MP make_pair\\n#define MT make_tuple\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define possible(n) cout << ((n) ? \\\"possible\\\" : \\\"impossible\\\") << \\\"\\\\n\\\"\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << \\\"\\\\n\\\"\\n#define Yay(n) cout << ((n) ? \\\"Yay!\\\" : \\\":(\\\") << \\\"\\\\n\\\"\\n#define all(v) v.begin(), v.end()\\n#define NP(v) next_permutation(all(v))\\n#define dbg(x) cerr << #x << \\\":\\\" << x << \\\"\\\\n\\\";\\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\\n\\nstruct io_init {\\n io_init() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << setprecision(30) << setiosflags(ios::fixed);\\n };\\n} io_init;\\ntemplate <typename T>\\ninline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ninline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ninline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }\\ntemplate <typename A, size_t N, typename T>\\ninline void Fill(A (&array)[N], const T& val) {\\n fill((T*)array, (T*)(array + N), val);\\n}\\ntemplate <typename T>\\nvector<T> compress(vector<T>& v) {\\n vector<T> val = v;\\n sort(all(val)), val.erase(unique(all(val)), val.end());\\n for (auto&& vi : v) vi = lower_bound(all(val), vi) - val.begin();\\n return val;\\n}\\ntemplate <typename T, typename U>\\nconstexpr istream& operator>>(istream& is, pair<T, U>& p) noexcept {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nconstexpr ostream& operator<<(ostream& os, pair<T, U> p) noexcept {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\nostream& operator<<(ostream& os, mint m) {\\n os << m.val();\\n return os;\\n}\\nostream& operator<<(ostream& os, modint m) {\\n os << m.val();\\n return os;\\n}\\n\\nrandom_device seed_gen;\\nmt19937_64 engine(seed_gen());\\n\\nstruct BiCoef {\\n vector<mint> fact_, inv_, finv_;\\n BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\\n for (int i = 2; i < n; i++) {\\n fact_[i] = fact_[i - 1] * i;\\n inv_[i] = -inv_[MOD % i] * (MOD / i);\\n finv_[i] = finv_[i - 1] * inv_[i];\\n }\\n }\\n mint c(ll n, ll k) const noexcept {\\n if (n < k || n < 0 || k < 0) return 0;\\n return fact_[n] * finv_[k] * finv_[n - k];\\n }\\n mint P(ll n, ll k) const noexcept { return c(n, k) * fact_[k]; }\\n mint H(ll n, ll k) const noexcept { return c(n + k - 1, k); }\\n mint Ch1(ll n, ll k) const noexcept {\\n if (n < 0 || k < 0) return 0;\\n mint res = 0;\\n for (int i = 0; i < n; i++)\\n res += c(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);\\n return res;\\n }\\n mint fact(ll n) const noexcept {\\n if (n < 0) return 0;\\n return fact_[n];\\n }\\n mint inv(ll n) const noexcept {\\n if (n < 0) return 0;\\n return inv_[n];\\n }\\n mint finv(ll n) const noexcept {\\n if (n < 0) return 0;\\n return finv_[n];\\n }\\n};\\n\\nBiCoef bc(500010);\\n\\n#pragma endregion\\n\\ntemplate <typename T>\\nvoid icpc(T a) {\\n if (!a) exit(0);\\n}\\ntemplate <typename T, typename U>\\nvoid icpc(T a, U end) {\\n if (a == end) exit(0);\\n}\\n\\n#pragma region Matrix\\n\\n// 参考・引用：https://qiita.com/gnbrganchan/items/47118d45b3af9d5ae9a4\\n\\nusing Type = modint;\\n\\nstruct Matrix {\\n // 行列A\\n vector<vector<Type>> A;\\n // コンストラクタ:第1引数⇒行数、第2引数⇒列数、第3引数⇒初期値\\n Matrix() : A() {}\\n Matrix(int h, int w) : A(vector<vector<Type>>(h, vector<Type>(w))) {}\\n Matrix(int h, int w, Type d)\\n : A(vector<vector<Type>>(h, vector<Type>(w, d))) {}\\n Matrix(vector<vector<Type>> A) : A(A) {}\\n Matrix(initializer_list<initializer_list<Type>> A) : A(A.begin(), A.end()) {}\\n // 添え字アクセス\\n vector<Type> operator[](const int i) const { return A[i]; }\\n vector<Type>& operator[](const int i) { return A[i]; }\\n // 行数・列数\\n int r = A.size();\\n int c = (A.empty() ? 0 : A[0].size());\\n // 行列同士の演算\\n Matrix& operator+=(const Matrix& B) {\\n assert(c == B.c && r == B.r);\\n rep(i, r) rep(j, c) A[i][j] += B[i][j];\\n return *this;\\n }\\n Matrix& operator-=(const Matrix& B) {\\n assert(c == B.c && r == B.r);\\n rep(i, r) rep(j, c) A[i][j] -= B[i][j];\\n return *this;\\n }\\n Matrix& operator*=(const Matrix& B) {\\n if (B.r == 1 and B.c == 1) {\\n return (*this) *= B[0][0];\\n } else if (r == 1 and c == 1) {\\n Type k = A[0][0];\\n (*this) = B;\\n return (*this) *= k;\\n }\\n assert(c == B.r);\\n Matrix m2(r, B.c, 0);\\n rep(i, r) rep(j, B.c) rep(k, c) m2[i][j] += A[i][k] * B[k][j];\\n c = B.c;\\n rep(i, r) A[i].resize(c);\\n rep(i, r) rep(j, c) A[i][j] = m2[i][j];\\n return *this;\\n }\\n Matrix operator+(const Matrix& B) const { return Matrix(*this) += B; }\\n Matrix operator-(const Matrix& B) const { return Matrix(*this) -= B; }\\n Matrix operator*(const Matrix& B) const { return Matrix(*this) *= B; }\\n vector<Type> operator*(const vector<Type>& b) const {\\n assert(c == b.size());\\n vector<Type> res(r);\\n rep(i, r) rep(k, c) res[i] += A[i][k] * b[k];\\n return res;\\n }\\n bool operator==(const Matrix& B) {\\n assert(c == B.c && r == B.r);\\n bool flg = true;\\n rep(i, r) rep(j, c) if (A[i][j] != B[i][j]) flg = false;\\n return flg;\\n }\\n // 行列とスカラの演算\\n Matrix& operator+=(const Type& k) {\\n rep(i, r) rep(j, c) A[i][j] += k;\\n return *this;\\n }\\n Matrix& operator-=(const Type& k) {\\n rep(i, r) rep(j, c) A[i][j] -= k;\\n return *this;\\n }\\n Matrix& operator*=(const Type& k) {\\n rep(i, r) rep(j, c) A[i][j] *= k;\\n return *this;\\n }\\n Matrix& operator/=(const Type& k) {\\n rep(i, r) rep(j, c) A[i][j] /= k;\\n return *this;\\n }\\n Matrix operator+(const Type& k) const { return Matrix(*this) += k; }\\n Matrix operator-(const Type& k) const { return Matrix(*this) -= k; }\\n Matrix operator*(const Type& k) const { return Matrix(*this) *= k; }\\n Matrix operator/(const Type& k) const { return Matrix(*this) /= k; }\\n Matrix operator-() const { return Matrix(*this) *= -1; }\\n // 回転（degの数だけ時計回りに90度回転）\\n Matrix& rot(int deg) {\\n Matrix m2(c, r);\\n if (deg == 1 || deg == 3) {\\n if (deg == 1) rep(i, r) rep(j, c) m2[j][r - i - 1] = A[i][j];\\n if (deg == 3) rep(i, r) rep(j, c) m2[c - j - 1][i] = A[i][j];\\n swap(c, r); // 列数と行数を入れ替える\\n A.resize(r);\\n rep(i, r) A[i].resize(c); //リサイズ\\n }\\n if (deg == 2) rep(i, r) rep(j, c) m2[r - i - 1][c - j - 1] = A[i][j];\\n rep(i, r) rep(j, c) A[i][j] = m2[i][j];\\n return *this;\\n }\\n // 転置\\n Matrix& tran() {\\n Matrix m2(c, r);\\n rep(i, r) rep(j, c) m2[j][i] = A[i][j];\\n (*this) = m2;\\n return *this;\\n }\\n // 単位行列\\n static Matrix E(int n) {\\n Matrix res(n, n);\\n rep(i, n) rep(j, n) res[i][j] = i == j;\\n return res;\\n }\\n // 累乗\\n Matrix pow(ll n) {\\n assert(n >= 0);\\n Matrix res = E(r);\\n Matrix P = (*this);\\n while (n > 0) {\\n if (n & 1) res *= P;\\n P *= P;\\n n >>= 1;\\n }\\n return res;\\n }\\n};\\n// 出力\\nostream& operator<<(ostream& os, Matrix A) noexcept {\\n rep(i, A.r) {\\n if (i > 0) cout << \\\"\\\\n\\\";\\n rep(j, A.c) { cout << A[i][j] << (j + 1 == A.c ? \\\"\\\" : \\\" \\\"); }\\n }\\n return os;\\n}\\n\\n#pragma endregion\\n\\nMatrix A[26];\\n\\nMatrix var(string&, int&);\\nMatrix expr(string&, int&);\\nMatrix term(string&, int&);\\nMatrix factor(string&, int&);\\nMatrix primary(string&, int&);\\nMatrix matrix(string&, int&);\\nMatrix row_seq(string&, int&);\\nMatrix row(string&, int&);\\nMatrix inum(string&, int&);\\n\\nMatrix var(string& s, int& i) {\\n assert(isupper(s[i]));\\n return A[s[i++] - 'A'];\\n}\\n\\nMatrix expr(string& s, int& i) {\\n Matrix S = term(s, i);\\n while (i < s.length() and (s[i] == '+' or s[i] == '-')) {\\n if (s[i] == '+') {\\n i++;\\n S += term(s, i);\\n } else {\\n i++;\\n S -= term(s, i);\\n }\\n }\\n return S;\\n}\\n\\nMatrix term(string& s, int& i) {\\n Matrix P = factor(s, i);\\n while (i < s.length() and s[i] == '*') {\\n i++;\\n P *= factor(s, i);\\n }\\n return P;\\n}\\n\\nMatrix factor(string& s, int& i) {\\n if (s[i] == '-') {\\n i++;\\n return -factor(s, i);\\n }\\n return primary(s, i);\\n}\\n\\n// idnexed, transposed を兼ねる\\nMatrix primary(string& s, int& i) {\\n Matrix P;\\n if (isdigit(s[i])) {\\n P = inum(s, i);\\n } else if (isupper(s[i])) {\\n P = var(s, i);\\n } else if (s[i] == '[') {\\n P = matrix(s, i);\\n } else if (s[i] == '(') {\\n i++;\\n P = expr(s, i);\\n i++;\\n }\\n while (s[i] == '(' or s[i] == '\\\\'') {\\n if (s[i] == '(') {\\n i++;\\n Matrix I = expr(s, i);\\n assert(s[i++] == ',');\\n Matrix J = expr(s, i);\\n assert(s[i++] == ')');\\n assert(I.r == 1);\\n assert(J.r == 1);\\n vector<vector<modint>> v;\\n Matrix res(I.c, J.c);\\n rep(i, I.c) rep(j, J.c) {\\n res[i][j] = P.A[I[0][i].val() - 1][J[0][j].val() - 1];\\n }\\n P = res;\\n } else if (s[i] == '\\\\'') {\\n i++;\\n P.tran();\\n }\\n }\\n return P;\\n}\\n\\nMatrix matrix(string& s, int& i) {\\n assert(s[i++] == '[');\\n Matrix res = row_seq(s, i);\\n assert(s[i++] == ']');\\n return res;\\n}\\n\\nMatrix row_seq(string& s, int& i) {\\n Matrix P = row(s, i);\\n vector<vector<modint>> v;\\n rep(i, P.r) v.push_back(P.A[i]);\\n while (i < s.length() and s[i] == ';') {\\n i++;\\n P = row(s, i);\\n assert(v[0].size() == P.c);\\n rep(i, P.r) v.push_back(P.A[i]);\\n }\\n return Matrix(v);\\n}\\n\\nMatrix row(string& s, int& i) {\\n Matrix P = expr(s, i);\\n vector<vector<modint>> v = P.A;\\n while (i < s.length() and s[i] == ' ') {\\n i++;\\n P = expr(s, i);\\n assert(v.size() == P.r);\\n rep(i, P.r) {\\n rep(j, P.c) { v[i].push_back(P[i][j]); }\\n }\\n }\\n return Matrix(v);\\n}\\n\\n// digit を兼ねる\\nMatrix inum(string& s, int& i) {\\n modint val = 0;\\n while (i < s.length() and isdigit(s[i])) {\\n val = val * 10 + s[i] - '0';\\n i++;\\n }\\n return Matrix(1, 1, val);\\n}\\n\\nvoid solve() {\\n int n;\\n cin >> n;\\n cin.ignore();\\n icpc(n);\\n\\n rep(i, n) {\\n string s;\\n getline(cin, s);\\n int num = s[0] - 'A';\\n s = s.substr(2);\\n s.pop_back();\\n int tmp = 0;\\n A[num] = expr(s, tmp);\\n cout << A[num] << \\\"\\\\n\\\";\\n }\\n cout << \\\"-----\\\\n\\\";\\n}\\n\\nint main() {\\n modint::set_mod(32768);\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 9372,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1314_5444999\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\nvector<int> getchar_buffer;\\nint my_getchar(){\\n if(getchar_buffer.size()){\\n int res = getchar_buffer.back();\\n getchar_buffer.pop_back();\\n return res;\\n }\\n return getchar();\\n}\\n\\nint readInt(){\\n int n = 0;\\n while(true){\\n int c = my_getchar();\\n if(c < '0' || '9' < c){\\n getchar_buffer.push_back(c);\\n break;\\n }\\n n = n * 10 + (c-'0');\\n }\\n return n;\\n}\\n\\n\\nconst int modmask = 0x7fff;\\n\\n\\nstruct Matrix{\\n int H,W;\\n vector<int> G;\\n Matrix(int h,int w){\\n H = h;\\n W = w;\\n G.assign(H*W,0);\\n }\\n int* operator[](int y){ return G.data() + (y*W); }\\n const int* operator[](int y) const { return G.data() + (y*W); }\\n\\n void print() const {\\n for(int y=0; y<H; y++){\\n for(int x=0; x<W; x++){\\n if(x) printf(\\\" \\\");\\n printf(\\\"%d\\\",operator[](y)[x]);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n }\\n};\\n\\nMatrix operator+(const Matrix& l, const Matrix& r){\\n assert(l.H == r.H);\\n assert(l.W == r.W);\\n Matrix res(l.H,l.W);\\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] + r[y][x]) & modmask;\\n return move(res);\\n}\\nMatrix operator-(const Matrix& l, const Matrix& r){\\n assert(l.H == r.H);\\n assert(l.W == r.W);\\n Matrix res(l.H,l.W);\\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] + (modmask+1) - r[y][x]) & modmask;\\n return move(res);\\n}\\nMatrix operator-(const Matrix& r){\\n Matrix res(r.H,r.W);\\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x] = ((modmask+1) - r[y][x]) & modmask;\\n return move(res);\\n}\\nMatrix operator*(const Matrix& l, const Matrix& r){\\n if(l.W == 1 && l.H == 1){\\n Matrix res(r.H,r.W);\\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x] = (l[0][0] * r[y][x]) & modmask;\\n return move(res);\\n }\\n if(r.W == 1 && r.H == 1){\\n Matrix res(l.H,l.W);\\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = (l[y][x] * r[0][0]) & modmask;\\n return move(res);\\n }\\n assert(l.W == r.H);\\n Matrix res(l.H,r.W);\\n for(int y=0; y<l.H; y++) for(int j=0; j<l.W; j++) for(int x=0; x<r.W; x++)\\n res[y][x] = (res[y][x] + l[y][j] * r[j][x]) & modmask;\\n return move(res);\\n}\\nMatrix matrix_catW(const Matrix& l, const Matrix& r){\\n assert(l.H == r.H);\\n Matrix res(l.H,l.W+r.W);\\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = l[y][x];\\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y][x+l.W] = r[y][x];\\n return move(res);\\n}\\nMatrix matrix_catH(const Matrix& l, const Matrix& r){\\n assert(l.W == r.W);\\n Matrix res(l.H+r.H,l.W);\\n for(int y=0; y<l.H; y++) for(int x=0; x<l.W; x++) res[y][x] = l[y][x];\\n for(int y=0; y<r.H; y++) for(int x=0; x<r.W; x++) res[y+l.H][x] = r[y][x];\\n return move(res);\\n}\\nMatrix matrix_trans(const Matrix& l){\\n Matrix res(l.W,l.H);\\n for(int y=0; y<l.W; y++) for(int x=0; x<l.H; x++) res[y][x] = l[x][y];\\n return move(res);\\n}\\nMatrix matrix_index_primary(const Matrix& l, const Matrix& ipy, const Matrix& ipx){\\n assert(ipy.H == 1);\\n assert(ipx.H == 1);\\n Matrix res(ipy.W,ipx.W);\\n for(int y=0; y<ipy.W; y++) for(int x=0; x<ipx.W; x++) res[y][x] = l[ipy[0][y]-1][ipx[0][x]-1];\\n return move(res);\\n}\\n\\n\\n\\nMatrix readExp(const vector<Matrix>& A){\\n vector<Matrix> st_operands;\\n vector<int> st_operators;\\n vector<int> st_primary_state = {0};\\n bool prev_primary = false;\\n\\n auto reduce_operator = [&](int op)->bool{\\n if(st_operators.empty()) return false;\\n if(st_operators.back() != op) return false;\\n st_operators.pop_back();\\n //printf(\\\"reduce_operator(%c)\\\\n\\\",(char)op);\\n do /* while(0) */ {\\n if(op == '['){ break; }\\n if(op == '('){ st_primary_state.pop_back(); break; }\\n auto r = move(st_operands.back()); st_operands.pop_back();\\n if(op == '_'){ st_operands.push_back(-r); continue; }\\n auto l = move(st_operands.back()); st_operands.pop_back();\\n if(op == ' '){ st_operands.push_back(matrix_catW(l,r)); break; }\\n if(op == ';'){ st_operands.push_back(matrix_catH(l,r)); break; }\\n if(op == '+'){ st_operands.push_back(l+r); break; }\\n if(op == '-'){ st_operands.push_back(l-r); break; }\\n if(op == '*'){ st_operands.push_back(l*r); break; }\\n if(op == ','){ st_operands.push_back(l*r); break; }\\n } while(0);\\n return true;\\n };\\n\\n bool done = false;\\n while(!done){\\n int nxc = my_getchar();\\n assert(nxc != '\\\\n');\\n if(nxc == '.'){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n done = true;\\n }\\n else if(nxc == '('){\\n if(prev_primary){\\n //printf(\\\"index primary begins\\\\n\\\");\\n st_primary_state.push_back(1);\\n st_operators.push_back(nxc);\\n }\\n else{\\n st_primary_state.push_back(0);\\n st_operators.push_back(nxc);\\n }\\n prev_primary = false;\\n }\\n else if(nxc == ','){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n st_primary_state.back() = 2;\\n prev_primary = false;\\n }\\n else if(nxc == ')'){\\n if(st_primary_state.back() == 2){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n reduce_operator('(');\\n Matrix ipx = move(st_operands.back()); st_operands.pop_back();\\n Matrix ipy = move(st_operands.back()); st_operands.pop_back();\\n st_operands.back() = matrix_index_primary(st_operands.back(), ipy, ipx);\\n prev_primary = true;\\n }\\n else{\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n reduce_operator('(');\\n }\\n }\\n else if(nxc == ' '){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n while(reduce_operator(' '));\\n st_operators.push_back(nxc);\\n prev_primary = false;\\n }\\n else if(nxc == ';'){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n while(reduce_operator(' '));\\n while(reduce_operator(';'));\\n st_operators.push_back(nxc);\\n prev_primary = false;\\n }\\n else if(nxc == '[') st_operators.push_back(nxc);\\n else if(nxc == ']'){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n while(reduce_operator(' '));\\n while(reduce_operator(';'));\\n reduce_operator('[');\\n prev_primary = true;\\n }\\n else if(nxc == '\\\\''){\\n st_operands.back() = matrix_trans(st_operands.back());\\n prev_primary = true;\\n }\\n else if(nxc == '+'){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n st_operators.push_back(nxc);\\n prev_primary = false;\\n }\\n else if(nxc == '-'){\\n if(prev_primary){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n while(reduce_operator('+') || reduce_operator('-'));\\n st_operators.push_back(nxc);\\n }\\n else{\\n st_operators.push_back('_');\\n }\\n prev_primary = false;\\n }\\n else if(nxc == '*'){\\n while(reduce_operator('_'));\\n while(reduce_operator('*'));\\n st_operators.push_back(nxc);\\n prev_primary = false;\\n }\\n else if('0' <= nxc && nxc <= '9'){\\n getchar_buffer.push_back(nxc);\\n int nxval = readInt();\\n st_operands.push_back(Matrix(1,1));\\n st_operands.back()[0][0] = nxval;\\n prev_primary = true;\\n }\\n else if('A' <= nxc && nxc <= 'Z'){\\n st_operands.push_back(A[nxc-'A']);\\n prev_primary = true;\\n }\\n /*\\n printf(\\\"############################\\\\n\\\");\\n for(auto a : st_operands){\\n a.print();\\n printf(\\\"- - - - - - - - - - - \\\\n\\\");\\n }\\n for(auto a : st_operators){\\n printf(\\\"%c\\\",(char)a);\\n }\\n printf(\\\"\\\\n- - - - - - - - - - - \\\\n\\\");\\n fflush(stdout);\\n */\\n }\\n // printf(\\\"############################\\\\n\\\");\\n return move(st_operands.back());\\n}\\n\\n\\n\\nbool testcase(){\\n int n = readInt();\\n int newline_after_n = my_getchar(); assert(newline_after_n == '\\\\n');\\n if(n == 0) return false;\\n vector<Matrix> A(26,Matrix(1,1));\\n for(int i=0; i<n; i++){\\n int assign_dst = my_getchar() - 'A';\\n int assign_equal = my_getchar(); assert(assign_equal == '=');\\n A[assign_dst] = readExp(A);\\n A[assign_dst].print();\\n int assign_newline = my_getchar(); assert(assign_newline == '\\\\n');\\n }\\n printf(\\\"-----\\\\n\\\");\\n return true;\\n}\\n\\n\\n\\nint main(){\\n while(testcase());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.1094,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1314_5379472\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 32768;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\ntypedef complex<ld> Point;\\nld dot(Point a, Point b) { return real(conj(a) * b); }\\nld cross(Point a, Point b) { return imag(conj(a) * b); }\\nnamespace std {\\n\\tbool operator<(const Point& lhs, const Point& rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nstruct Line {\\n\\tPoint a, b;\\n};\\nstruct Circle {\\n\\tPoint p; ld r;\\n};\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//counter clockwise\\n\\tif (cross(b, c) < -eps)return -1;//clock wise\\n\\tif (dot(b, c) < 0)return 2;//c--a--b on line\\n\\tif (norm(b) < norm(c))return -2;//a--b--c on line\\n\\treturn 0; //a--c--b on line\\n}\\nbool isis_ss(Line s, Line t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\n\\n//点を直線で反転\\nPoint rev_lp(Line l, Point p) {\\n\\tPoint h = proj(l, p);\\n\\treturn h + h - p;\\n}\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n\\nusing mat = vector<vector<modint>>;\\n\\nmat memo[26];\\n\\nmat expr(string& s, int& i);\\nmat term(string& s, int& i);\\nmat factor(string& s, int& i);\\nmat primary(string& s, int& i);\\nmat inum(string& s, int& i);\\nmat matrix(string& s, int& i);\\nmat row_seq(string& s, int& i);\\nmat row(string& s, int& i);\\n\\nmat expr(string& s, int& i) {\\n\\tmat res = term(s, i);\\n\\twhile (s[i] == '+' || s[i] == '-') {\\n\\t\\tmodint c = 1; if (s[i] == '-')c = -1;\\n\\t\\ti++;\\n\\t\\tmat nex = term(s, i);\\n\\t\\tassert(res.size() == nex.size() && res[0].size() == nex[0].size());\\n\\t\\trep(i, res.size())rep(j, res[i].size())res[i][j] += c * nex[i][j];\\n\\t}\\n\\treturn res;\\n}\\nmat term(string& s, int& i) {\\n\\tmat res = factor(s, i);\\n\\twhile (s[i] == '*') {\\n\\t\\ti++;\\n\\t\\tmat nex = factor(s, i);\\n\\t\\tif (res[0].size() != nex.size()) {\\n\\t\\t\\tif (res.size() == 1 && res[0].size() == 1) {\\n\\t\\t\\t\\tswap(res, nex);\\n\\t\\t\\t\\trep(i, res.size())rep(j, res[i].size()) {\\n\\t\\t\\t\\t\\tres[i][j] *= nex[0][0];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (nex.size() == 1 && nex[0].size() == 1) {\\n\\t\\t\\t\\trep(i, res.size())rep(j, res[i].size()) {\\n\\t\\t\\t\\t\\tres[i][j] *= nex[0][0];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tassert(false);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint n = res.size(), m = nex[0].size();\\n\\t\\t\\tmat nres(n, vector<modint>(m));\\n\\t\\t\\trep(i, n)rep(j, m) {\\n\\t\\t\\t\\trep(k, res[i].size()) {\\n\\t\\t\\t\\t\\tnres[i][j] += res[i][k] * nex[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tswap(res, nres);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\nmat factor(string& s, int& i) {\\n\\tif (s[i] == '-') {\\n\\t\\ti++;\\n\\t\\tmat res = factor(s, i);\\n\\t\\trep(i, res.size())rep(j, res[i].size())res[i][j] *= -1;\\n\\t\\treturn res;\\n\\t}\\n\\treturn primary(s, i);\\n}\\nmat primary(string& s, int& i) {\\n\\tmat res;\\n\\tif ('0' <= s[i] && s[i] <= '9') {\\n\\t\\tres = inum(s, i);\\n\\t}\\n\\telse if ('A' <= s[i] && s[i] <= 'Z') {\\n\\t\\tres = memo[s[i] - 'A']; i++;\\n\\t}\\n\\telse if (s[i] == '[') {\\n\\t\\tres = matrix(s, i);\\n\\t}\\n\\telse if (s[i] == '(') {\\n\\t\\ti++;\\n\\t\\tres = expr(s, i);\\n\\t\\ti++;\\n\\t}\\n\\telse {\\n\\t\\tcout << s << \\\" \\\" << i << \\\"\\\\n\\\";\\n\\t\\tassert(false);\\n\\t}\\n\\twhile (s[i] == '(' || s[i] == '\\\\'') {\\n\\t\\tif (s[i] == '(') {\\n\\t\\t\\ti++;\\n\\t\\t\\tmat n1 = expr(s, i);\\n\\t\\t\\ti++;\\n\\t\\t\\tmat n2 = expr(s, i);\\n\\t\\t\\ti++;\\n\\t\\t\\tassert(n1.size() == 1 && n2.size() == 1);\\n\\t\\t\\tint n = n1[0].size();\\n\\t\\t\\tint m = n2[0].size();\\n\\t\\t\\tmat nres(n, vector<modint>(m));\\n\\t\\t\\trep(i, n)rep(j, m) {\\n\\t\\t\\t\\tint x = n1[0][i] - (modint)1;\\n\\t\\t\\t\\tint y = n2[0][j] - (modint)1;\\n\\t\\t\\t\\tassert(x < res.size() && y < res[0].size());\\n\\t\\t\\t\\tnres[i][j] = res[n1[0][i] - (modint)1][n2[0][j] - (modint)1];\\n\\t\\t\\t}\\n\\t\\t\\tswap(res, nres);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\ti++;\\n\\t\\t\\tint n = res.size();\\n\\t\\t\\tint m = res[0].size();\\n\\t\\t\\tmat nres(m, vector<modint>(n));\\n\\t\\t\\trep(i, m)rep(j, n) {\\n\\t\\t\\t\\tnres[i][j] = res[j][i];\\n\\t\\t\\t}\\n\\t\\t\\tswap(res, nres);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\n\\nmat matrix(string& s, int& i) {\\n\\ti++;\\n\\tmat res = row_seq(s, i);\\n\\ti++;\\n\\treturn res;\\n}\\nmat row_seq(string& s, int& i) {\\n\\tmat res = row(s, i);\\n\\twhile (s[i] == ';') {\\n\\t\\ti++;\\n\\t\\tmat nex = row(s, i);\\n\\t\\tassert(res[0].size() == nex[0].size());\\n\\t\\trep(j, nex.size())res.push_back(nex[j]);\\n\\t}\\n\\treturn res;\\n}\\nmat row(string& s, int& i) {\\n\\tmat res = expr(s, i);\\n\\twhile (s[i] == ' ') {\\n\\t\\ti++;\\n\\t\\tmat nex = expr(s, i);\\n\\t\\tassert(res.size() == nex.size());\\n\\t\\trep(i, res.size()) {\\n\\t\\t\\trep(j, nex[i].size()) {\\n\\t\\t\\t\\tres[i].push_back(nex[i][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\nmat inum(string& s, int& i) {\\n\\tmodint val = 0;\\n\\twhile ('0' <= s[i] && s[i] <= '9') {\\n\\t\\tval = val * (modint)10 + (modint)(s[i] - '0');\\n\\t\\ti++;\\n\\t}\\n\\tmat res = { {val} };\\n\\treturn res;\\n}\\n\\nint n;\\nvoid solve() {\\n\\tstring s;\\n\\tgetline(cin, s);\\n\\trep(_, n) {\\n\\t\\tgetline(cin, s);\\n\\t\\tint c = s[0] - 'A';\\n\\t\\ts.erase(s.begin(), s.begin() + 2);\\n\\t\\tint i = 0;\\n\\t\\tmat ans = expr(s, i);\\n\\t\\tmemo[c] = ans;\\n\\t\\trep(i, ans.size()) {\\n\\t\\t\\trep(j, ans[i].size()) {\\n\\t\\t\\t\\tif (j > 0)cout << \\\" \\\";\\n\\t\\t\\t\\tcout << ans[i][j];\\n\\t\\t\\t}\\n\\t\\t\\tcout << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t}\\n\\tcout << \\\"-----\\\\n\\\";\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t;rep(i,t)\\n\\twhile (cin >> n, n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4048,\n \"score_of_the_acc\": -0.1774,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1314_4973727\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define var auto\\n\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b) { bool c = a > b; if (c) a = b; return c; }\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b) { bool c = a < b; if (c) a = b; return c; }\\n\\n//BEGIN CUT HERE\\ntemplate<typename T, T MOD = 1000000007>\\nstruct Mint{\\n static constexpr T mod = MOD;\\n T v;\\n Mint():v(0){}\\n Mint(signed v):v(v){}\\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\\n\\n Mint pow(long long k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n\\n static Mint add_identity(){return Mint(0);}\\n static Mint mul_identity(){return Mint(1);}\\n\\n Mint inv(){return pow(MOD-2);}\\n\\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n\\n Mint operator+(Mint a) const{return Mint(v)+=a;}\\n Mint operator-(Mint a) const{return Mint(v)-=a;}\\n Mint operator*(Mint a) const{return Mint(v)*=a;}\\n Mint operator/(Mint a) const{return Mint(v)/=a;}\\n\\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n bool operator <(const Mint a)const{return v <a.v;}\\n\\n static Mint comb(long long n,int k){\\n Mint num(1),dom(1);\\n for(int i=0;i<k;i++){\\n num*=Mint(n-i);\\n dom*=Mint(i+1);\\n }\\n return num/dom;\\n }\\n};\\ntemplate<typename T, T MOD> constexpr T Mint<T, MOD>::mod;\\ntemplate<typename T, T MOD>\\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\\n//END CUT HERE\\n\\n//BEGIN CUT HERE\\ntemplate<typename K>\\nstruct Matrix{\\n typedef vector<K> arr;\\n typedef vector<arr> mat;\\n size_t r, c;\\n mat dat;\\n\\n Matrix(){}\\n Matrix(size_t r,size_t c):dat(r,arr(c,K())),r(r),c(c){}\\n Matrix(mat dat):dat(dat),r(dat.size()),c(dat[0].size()){}\\n\\n size_t size() const{return dat.size();}\\n bool empty() const{return size()==0;}\\n arr& operator[](size_t k){return dat[k];}\\n const arr& operator[](size_t k) const {return dat[k];}\\n\\n const void operator+=(Matrix<K>& b){\\n for (int i = 0; i < r; i++){\\n for (int j = 0; j < c; j++){\\n dat[i][j] += b[i][j];\\n }\\n }\\n }\\n const Matrix<K> operator+(Matrix<K>& b){\\n var res = Matrix<K>(dat);\\n res += b;\\n return res;\\n }\\n const void operator-=(Matrix<K>& b){\\n for (int i = 0; i < r; i++){\\n for (int j = 0; j < c; j++){\\n dat[i][j] -= b[i][j];\\n }\\n }\\n }\\n const Matrix<K> operator-(Matrix<K>& b){\\n var res = Matrix<K>(dat);\\n res -= b;\\n return res;\\n }\\n\\n const void operator*=(K& b){\\n for (int i = 0; i < r; i++){\\n for (int j = 0; j < c; j++){\\n dat[i][j] *= b;\\n }\\n }\\n }\\n\\n static Matrix cross(const Matrix &A,const Matrix &B){\\n Matrix res(A.size(),B[0].size());\\n for(int i=0;i<(int)A.size();i++)\\n for(int j=0;j<(int)B[0].size();j++)\\n for(int k=0;k<(int)B.size();k++)\\n res[i][j]+=A[i][k]*B[k][j];\\n return res;\\n }\\n\\n\\n\\n Matrix<K> transpose(){\\n Matrix<K> res(c, r);\\n for (int i = 0; i < r; i++){\\n for (int j = 0; j < c; j++){\\n res[j][i] = dat[i][j];\\n }\\n }\\n return res;\\n }\\n};\\n//END CUT HERE\\n\\nusing M = Mint<int, 32768>;\\nusing Mat = Matrix<M>;\\n\\nmap<char, Mat> mats;\\n\\n//A = expr\\npair<char, Mat> assignment(string&, int&);\\n//term+term-term+...\\nMat expr(string&, int&);\\n//primary*primary*...\\nMat term(string&, int&);\\n//---...\\n//num/variable/matrix\\n//(transposed or indexed)...\\nMat primary(string&, int&);\\nMat matrix(string&, int&);\\n\\npair<char, Mat> assignment(string& s, int& i){\\n assert(isalpha(s[i]));\\n var variable = s[i];\\n i++;\\n assert(s[i] == '=');\\n i++;\\n var value = expr(s, i);\\n return pair<char, Mat>(variable, value);\\n}\\n\\nMat expr(string& s, int& i){\\n var res = term(s, i);\\n while (i < s.size() && (s[i] == '+' || s[i] == '-')){\\n var op = s[i];\\n i++;\\n var nxt = term(s, i);\\n res = op == '+' ? res + nxt : res - nxt;\\n }\\n return res;\\n}\\n\\nMat term(string& s, int& i){\\n var res = primary(s, i);\\n while (i < s.size() && s[i] == '*'){\\n i++;\\n var nxt = primary(s, i);\\n if (res.r == 1 && res.c == 1){\\n nxt *= res.dat[0][0];\\n res = nxt;\\n }\\n else if (nxt.r == 1 && nxt.c == 1){\\n res *= nxt.dat[0][0];\\n }\\n else res = Mat::cross(res, nxt);\\n }\\n return res;\\n}\\n\\nMat primary(string& s, int& i){\\n ll sign = 1;\\n while (s[i] == '-'){\\n sign *= -1;\\n i++;\\n }\\n Mat res;\\n if (isdigit(s[i])){\\n ll num = 0;\\n while (i < s.size() && isdigit(s[i])){\\n num = num * 10 + s[i] - '0';\\n i++;\\n }\\n res = Mat(1, 1);\\n res[0][0] = M(num);\\n }\\n else if (isalpha(s[i])){\\n res = mats[s[i]];\\n i++;\\n }\\n else if (s[i] == '('){\\n i++;\\n res = expr(s, i);\\n assert(s[i] == ')'); i++;\\n }\\n else{\\n res = matrix(s, i);\\n }\\n while (i < s.size()){\\n //O(nm) 100*100\\n if (s[i] == '\\\\''){\\n res = res.transpose();\\n i++;\\n continue;\\n }\\n if (s[i] == '('){\\n i++;\\n var a = expr(s, i);\\n assert(s[i] == ','); i++;\\n var b = expr(s, i);\\n assert(s[i] == ')'); i++;\\n assert(a.r == 1 && b.r == 1);\\n\\n Mat k(a.c, b.c);\\n for (int i = 0; i < k.r; i++){\\n for (int j = 0; j < k.c; j++){\\n k[i][j] = res[a[0][i].v - 1][b[0][j].v - 1];\\n }\\n }\\n\\n res = k;\\n continue;\\n }\\n break;\\n }\\n for (int i = 0; i < res.r; i++){\\n for (int j = 0; j < res.c; j++){\\n res[i][j] = res[i][j] * M(sign);\\n }\\n }\\n return res;\\n}\\n\\nMat matrix(string& s, int& i){\\n assert(s[i] == '['); i++;\\n vector<vector<M>> res;\\n while (true){\\n int baserow = -1;\\n bool isfirst = true;\\n while (true){\\n var row = expr(s, i);\\n if (isfirst){\\n baserow = res.size();\\n for (int i = 0; i < row.r; i++){\\n res.push_back(vector<M>{});\\n }\\n isfirst = false;\\n }\\n for (int i = 0; i < row.r; i++){\\n for (int j = 0; j < row.c; j++){\\n res[baserow + i].emplace_back(row[i][j]);\\n }\\n }\\n if (s[i] == ' '){\\n i++;\\n continue;\\n }\\n else break;\\n }\\n if (s[i] == ';'){\\n i++;\\n continue;\\n }\\n else break;\\n }\\n assert(s[i] == ']'); i++;\\n return res;\\n}\\n\\nvoid dump(Mat m){\\n for (int i = 0; i < m.r; i++){\\n for (int j = 0; j < m.c; j++){\\n if (j != 0) cout << \\\" \\\";\\n cout << m[i][j];\\n }\\n cout << endl;\\n }\\n}\\n\\nsigned main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n int n;\\n while (cin >> n, n){\\n cin.ignore();\\n for (int iter = 0; iter < n; iter++){\\n string s;\\n getline(cin, s);\\n int i = 0;\\n var [variable, value] = assignment(s, i);\\n dump(value);\\n mats[variable] = value;\\n }\\n cout << \\\"-----\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.1193,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1314_3179239\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 32768LL\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef vector<ll> vec;\\ntypedef vector<vec> mat;\\n\\nclass val{\\npublic:\\n\\tmat m;\\n\\tll v;\\n\\tint t;\\n\\tval(){\\n\\t\\tt=0;\\n\\t\\tv=0;\\n\\t}\\n\\n\\tval(int tt,ll vv){\\n\\t\\tt=tt;\\n\\t\\tv=vv;\\n\\t}\\n\\n\\tval(mat mm){\\n\\t\\tt=1;\\n\\t\\tm=mm;\\n\\t\\tfor(int i=0;i<m.size();i++){\\n\\t\\t\\tfor(int j=0;j<m[0].size();j++){\\n\\t\\t\\t\\tm[i][j]%=MOD;\\n\\t\\t\\t\\tif(m[i][j]<0LL)m[i][j]+=MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tval(ll vv){\\n\\t\\tv=vv;\\n\\t\\tv%=MOD;\\n\\t\\tif(v<0LL){\\n\\t\\t\\tv+=MOD;\\n\\t\\t}\\n\\t\\tt=0;\\n\\t}\\n\\tval operator+ (val va){\\n\\t\\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\\n\\t\\t\\tva.t=0;\\n\\t\\t\\tva.v=va.m[0][0];\\n\\t\\t}\\n\\t\\tif(t==1 && m.size()==1 && m[0].size()==1){\\n\\t\\t\\tt=0;\\n\\t\\t\\tv=m[0][0];\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==0){\\n\\t\\t\\treturn val(va.v+v);\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==1){\\n\\t\\t\\tfor(int i=0;i<va.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\tva.m[i][j]+=v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(va.m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==0){\\n\\t\\t\\tfor(int i=0;i<m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<m[0].size();j++){\\n\\t\\t\\t\\t\\tm[i][j]+=va.v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==1){\\n\\t\\t\\tfor(int i=0;i<va.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\tm[i][j]+=va.m[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(m);\\n\\t\\t}\\n\\t}\\n\\tval operator- (val va){\\n\\t\\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\\n\\t\\t\\tva.t=0;\\n\\t\\t\\tva.v=va.m[0][0];\\n\\t\\t}\\n\\t\\tif(t==1 && m.size()==1 && m[0].size()==1){\\n\\t\\t\\tt=0;\\n\\t\\t\\tv=m[0][0];\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==0){\\n\\t\\t\\treturn val(v-va.v);\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==1){\\n\\t\\t\\tfor(int i=0;i<va.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\tva.m[i][j]=v-va.m[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(va.m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==0){\\n\\t\\t\\tfor(int i=0;i<m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<m[0].size();j++){\\n\\t\\t\\t\\t\\tm[i][j]-=va.v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==1){\\n\\t\\t\\tfor(int i=0;i<va.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\tm[i][j]-=va.m[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(m);\\n\\t\\t}\\n\\t}\\n\\tval operator* (val va){\\n\\t\\tif(va.t==1 && va.m.size()==1 && va.m[0].size()==1){\\n\\t\\t\\tva.t=0;\\n\\t\\t\\tva.v=va.m[0][0];\\n\\t\\t}\\n\\t\\tif(t==1 && m.size()==1 && m[0].size()==1){\\n\\t\\t\\tt=0;\\n\\t\\t\\tv=m[0][0];\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==0){\\n\\t\\t\\treturn val(v*va.v);\\n\\t\\t}\\n\\t\\tif(t==0 && va.t==1){\\n\\t\\t\\tfor(int i=0;i<va.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\tva.m[i][j]=v*va.m[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(va.m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==0){\\n\\t\\t\\tfor(int i=0;i<m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<m[0].size();j++){\\n\\t\\t\\t\\t\\tm[i][j]*=va.v;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(m);\\n\\t\\t}\\n\\t\\tif(t==1 && va.t==1){\\n\\t\\t\\tmat C(m.size(),vec(va.m[0].size()));\\n\\t\\t\\tfor(int i=0;i<m.size();i++){\\n\\t\\t\\t\\tfor(int k=0;k<va.m.size();k++){\\n\\t\\t\\t\\t\\tfor(int j=0;j<va.m[0].size();j++){\\n\\t\\t\\t\\t\\t\\tC[i][j]=(C[i][j]+(m[i][k]*va.m[k][j]%MOD))%MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn mat(C);\\n\\t\\t}\\n\\t}\\n};\\n\\nval v[35];\\n\\ntypedef string::const_iterator State;\\nval expression(State &begin);\\n\\nint number(State &begin){\\n\\tint ret=0;\\n\\twhile(isdigit(*begin)){\\n\\t\\tret*=10;\\n\\t\\tret+=*begin-'0';\\n\\t\\tret%=32768LL;\\n\\t\\tbegin++;\\n\\t}\\n\\treturn ret;\\n}\\n\\nval row(State &begin){\\n\\tval ret=expression(begin);\\n\\tif(*begin==' '){\\n\\t\\tbegin++;\\n\\t\\tval v2=row(begin);\\n\\t\\t//printf(\\\"%d %d\\\\n\\\",ret.t,v2.t);\\n\\t\\tif(v2.t==0 && ret.t==0){\\n\\t\\t\\tret.t=1;\\n\\t\\t\\tret.m=mat(1,vec(2));\\n\\t\\t\\tret.m[0][0]=ret.v;\\n\\t\\t\\tret.m[0][1]=v2.v;\\n\\t\\t}else if(v2.t==0){\\n\\t\\t\\tret.m[0].push_back(v2.v);\\n\\t\\t}else if(ret.t==0){\\n\\t\\t\\tret.t=1;\\n\\t\\t\\tret.m=mat(1,vec(1));\\n\\t\\t\\tret.m[0][0]=ret.v;\\n\\t\\t\\tfor(int i=0;i<v2.m[0].size();i++){\\n\\t\\t\\t\\tret.m[0].push_back(v2.m[0][i]);\\n\\t\\t\\t}\\n\\t\\t}else if(ret.t==1 && v2.t==1){\\n\\t\\t\\t//printf(\\\"%d %d %d %d\\\\n\\\",ret.m.size(),ret.m[0].size(),v2.m.size(),v2.m[0].size());\\n\\t\\t\\tfor(int i=0;i<v2.m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<v2.m[i].size();j++){\\n\\t\\t\\t\\t\\tret.m[i].push_back(v2.m[i][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}else{\\n\\t\\treturn ret;\\n\\t}\\n}\\n\\nval rowsqr(State &begin){\\n\\tval ret=row(begin);\\n\\twhile(1){\\n\\t\\t//cout << \\\"rs \\\" << *begin << endl;\\n\\t\\tif(*begin==';'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tval v2=rowsqr(begin);\\n\\t\\t\\tif(ret.t==0){\\n\\t\\t\\t\\tret.t=1;\\n\\t\\t\\t\\tret.m=mat(1,vec(1));\\n\\t\\t\\t\\tret.m[0][0]=ret.v;\\n\\t\\t\\t}\\n\\t\\t\\tif(v2.t==0){\\n\\t\\t\\t\\tret.m.push_back(vec(1,v2.v));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfor(int i=0;i<v2.m.size();i++){\\n\\t\\t\\t\\t\\tret.m.push_back(v2.m[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//printf(\\\"%d %d\\\\n\\\",ret.m.size(),ret.m[0].size());\\n\\t\\t}else{\\n\\t\\t\\treturn ret;\\n\\t\\t}\\n\\t}\\n\\t\\n}\\n\\nval primary(State &begin){\\n\\tval ret=val(-1,0);\\n\\twhile(1){\\n\\t\\tif(*begin=='['){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret=rowsqr(begin);\\n\\t\\t\\tbegin++;\\n\\t\\t}else if((*begin)>='A' && (*begin)<='Z'){\\n\\t\\t\\tret=v[(*begin)-'A'];\\n\\t\\t\\tbegin++;\\n\\t\\t}else if(*begin=='('){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tval v1=expression(begin);\\n\\t\\t\\tif(*begin==')'){\\n\\t\\t\\t\\tbegin++;\\n\\t\\t\\t\\tret=v1;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tbegin++;\\n\\t\\t\\tval v2=expression(begin);\\n\\t\\t\\tbegin++;\\n\\t\\t\\tval ret2;\\n\\t\\t\\tret2.t=1;\\n\\t\\t\\tif(ret.t==0){\\n\\t\\t\\t\\tret.m=mat(1,vec(1,ret.v));\\n\\t\\t\\t}\\n\\t\\t\\tif(v1.t==0){\\n\\t\\t\\t\\tv1.m=mat(1,vec(1,v1.v));\\n\\t\\t\\t}\\n\\t\\t\\tif(v2.t==0){\\n\\t\\t\\t\\tv2.m=mat(1,vec(1,v2.v));\\n\\t\\t\\t}\\n\\t\\t\\tret2.m=mat(v1.m[0].size(),vec(v2.m[0].size()));\\n\\t\\t\\tfor(int i=0;i<v1.m[0].size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<v2.m[0].size();j++){\\n\\t\\t\\t\\t\\tret2.m[i][j]=ret.m[v1.m[0][i]-1][v2.m[0][j]-1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tret=ret2;\\n\\t\\t}else if(*begin=='\\\\''){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tval ret2;\\n\\t\\t\\tret2.t=ret.t;\\n\\t\\t\\tif(ret.t==0){\\n\\t\\t\\t\\tret2.v=ret.v;\\n\\t\\t\\t}else if(ret.t==1){\\n\\t\\t\\t\\tret2.m=mat(ret.m[0].size(),vec(ret.m.size()));\\n\\t\\t\\t\\tfor(int i=0;i<ret.m.size();i++){\\n\\t\\t\\t\\t\\tfor(int j=0;j<ret.m[0].size();j++){\\n\\t\\t\\t\\t\\t\\tret2.m[j][i]=ret.m[i][j];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tret=ret2;\\n\\t\\t}else if(isdigit(*begin)){\\n\\t\\t\\tret=val(number(begin));\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nval negation(val ret){\\n\\tif(ret.t==0){\\n\\t\\tret.v=MOD-ret.v;\\n\\t\\treturn ret;\\n\\t}else{\\n\\t\\tfor(int i=0;i<ret.m.size();i++){\\n\\t\\t\\tfor(int j=0;j<ret.m[i].size();j++){\\n\\t\\t\\t\\tret.m[i][j]=MOD-ret.m[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n}\\n\\nval factor(State &begin){\\n\\tif(*begin=='-'){\\n\\t\\tbegin++;\\n\\t\\tval ret=factor(begin);\\n\\t\\treturn negation(ret);\\n\\t}else{\\n\\t\\treturn primary(begin);\\n\\t}\\n}\\n\\nval term(State &begin){\\n\\tval ret=factor(begin);\\n\\twhile(1){\\n\\t\\tif(*begin=='*'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret=ret*factor(begin);\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nval expression(State &begin){\\n\\tval ret=term(begin);\\n\\twhile(1){\\n\\t\\tif(*begin=='+'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret=ret+term(begin);\\n\\t\\t}else if(*begin=='-'){\\n\\t\\t\\tbegin++;\\n\\t\\t\\tret=ret-term(begin);\\n\\t\\t}else{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nint n;\\n\\nvoid solve(){\\n\\tfor(int i=0;i<26;i++){\\n\\t\\tv[i].m.clear();\\n\\t\\tv[i].t=0;\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tstring str;\\n\\t\\tgetline(cin,str);\\n\\t\\tState b=str.begin();\\n\\t\\tb++;\\n\\t\\tb++;\\n\\t\\tint pos=str[0]-'A';\\n\\t\\tv[pos]=expression(b);\\n\\t\\tif(v[pos].t==0){\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\",v[pos].v);\\n\\t\\t}else{\\n\\t\\t\\tfor(int i=0;i<v[pos].m.size();i++){\\n\\t\\t\\t\\tfor(int j=0;j<v[pos].m[0].size();j++){\\n\\t\\t\\t\\t\\tprintf(\\\"%lld%c\\\",v[pos].m[i][j],j+1==v[pos].m[0].size()?'\\\\n':' ');\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"-----\\\\n\\\");\\n}\\n\\nint main(void){\\n\\twhile(1){\\n\\t\\tscanf(\\\"%d%*c\\\",&n);\\n\\t\\tif(n==0)break;\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3732,\n \"score_of_the_acc\": -0.1286,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1314_3174459\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n//#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define MOD 32768\\ntypedef vector<int> V;\\ntypedef vector<V> MATRIX;\\n\\nint N;\\nint global_index;\\nchar buf[105];\\nMATRIX TABLE[26];\\n\\nMATRIX expr();\\n\\nMATRIX operator+(const MATRIX &A,const MATRIX &B){\\n\\n\\tint num_row = A.size();\\n\\tint num_col = A[0].size();\\n\\n\\tMATRIX RET(num_row,V(num_col));\\n\\n\\tfor(int row = 0; row < num_row; row++){\\n\\t\\tfor(int col = 0; col < num_col; col++){\\n\\t\\t\\tRET[row][col] = A[row][col]+B[row][col];\\n\\t\\t\\tRET[row][col] %= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\treturn RET;\\n}\\n\\nMATRIX operator-(const MATRIX &A,const MATRIX &B){\\n\\n\\tint num_row = A.size();\\n\\tint num_col = A[0].size();\\n\\n\\tMATRIX RET(num_row,V(num_col));\\n\\n\\tfor(int row = 0; row < num_row; row++){\\n\\t\\tfor(int col = 0; col < num_col; col++){\\n\\t\\t\\tRET[row][col] = A[row][col]-B[row][col];\\n\\t\\t\\tRET[row][col] = (RET[row][col]+MOD)%MOD;\\n\\t\\t}\\n\\t}\\n\\n\\treturn RET;\\n}\\n\\nMATRIX operator*(const MATRIX &A, const MATRIX &B){\\n\\n\\tint num_rowA = A.size();\\n\\tint num_colA = A[0].size();\\n\\n\\tint num_rowB = B.size();\\n\\tint num_colB = B[0].size();\\n\\n\\tif(num_rowA == 1 && num_colA == 1){ //Aがスカラー\\n\\n\\t\\tMATRIX RET(num_rowB,V(num_colB));\\n\\n\\t\\tfor(int row = 0; row < num_rowB; row++){\\n\\t\\t\\tfor(int col = 0; col < num_colB; col++){\\n\\t\\t\\t\\tRET[row][col] = B[row][col]*A[0][0];\\n\\t\\t\\t\\tRET[row][col] %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn RET;\\n\\n\\t}else if(num_rowB == 1 && num_colB == 1){ //Bがスカラー\\n\\n\\t\\tMATRIX RET(num_rowA,V(num_colA));\\n\\n\\t\\tfor(int row = 0; row < num_rowA; row++){\\n\\t\\t\\tfor(int col = 0; col < num_colA; col++){\\n\\t\\t\\t\\tRET[row][col] = A[row][col]*B[0][0];\\n\\t\\t\\t\\tRET[row][col] %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn RET;\\n\\n\\t}else{\\n\\n\\t\\tMATRIX RET(num_rowA,V(num_colB));\\n\\n\\t\\tfor(int row = 0; row < num_rowA; row++){\\n\\t\\t\\tfor(int col = 0; col < num_colB; col++){\\n\\t\\t\\t\\tRET[row][col] = 0;\\n\\t\\t\\t\\tfor(int a = 0; a < num_colA; a++){\\n\\t\\t\\t\\t\\tRET[row][col] += A[row][a]*B[a][col];\\n\\t\\t\\t\\t\\tRET[row][col] %= MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn RET;\\n\\t}\\n}\\n\\nMATRIX operator-(const MATRIX &A){\\n\\n\\n\\tint num_rowA = A.size();\\n\\tint num_colA = A[0].size();\\n\\tMATRIX RET(num_rowA,V(num_colA));\\n\\n\\tfor(int row = 0; row < num_rowA; row++){\\n\\t\\tfor(int col = 0; col < num_colA; col++){\\n\\t\\t\\tRET[row][col] = (-A[row][col]+MOD)%MOD;\\n\\t\\t}\\n\\t}\\n\\treturn RET;\\n}\\n\\nMATRIX transpose(MATRIX A){\\n\\n\\tint num_row = A[0].size();\\n\\tint num_col = A.size();\\n\\n\\tMATRIX RET(num_row,V(num_col));\\n\\n\\tfor(int row = 0; row < A.size(); row++){\\n\\t\\tfor(int col = 0; col < A[0].size(); col++){\\n\\t\\t\\tRET[col][row] = A[row][col];\\n\\t\\t}\\n\\t}\\n\\n\\treturn RET;\\n}\\n\\nMATRIX get_row(){\\n\\n\\tMATRIX A = expr();\\n\\n\\twhile(buf[global_index] == ' '){\\n\\t\\tglobal_index++;\\n\\t\\tMATRIX B = expr();\\n\\t\\tfor(int a = 0; a < A.size(); a++){\\n\\t\\t\\tA[a].insert(A[a].end(),B[a].begin(),B[a].end());\\n\\t\\t}\\n\\t}\\n\\treturn A;\\n}\\n\\n\\nMATRIX row_seq(){\\n\\tMATRIX A = get_row();\\n\\n\\twhile(buf[global_index] == ';'){\\n\\t\\tglobal_index++;\\n\\t\\tMATRIX B = get_row();\\n\\t\\tA.insert(A.end(),B.begin(),B.end());\\n\\t}\\n\\n\\treturn A;\\n}\\n\\nMATRIX matrix(){\\n\\n\\tglobal_index++;\\n\\tMATRIX A = row_seq();\\n\\tglobal_index++;\\n\\n\\treturn A;\\n}\\n\\nMATRIX get_var(){\\n\\n\\tMATRIX RET = TABLE[buf[global_index]-'A'];\\n\\tglobal_index++;\\n\\n\\treturn RET;\\n}\\n\\nMATRIX inum(){\\n\\n\\tint tmp = 0;\\n\\n\\twhile(buf[global_index] >= '0' && buf[global_index] <= '9'){\\n\\t\\ttmp = 10*tmp+(buf[global_index]-'0');\\n\\t\\ttmp %= MOD;\\n\\t\\tglobal_index++;\\n\\t}\\n\\n\\tMATRIX RET(1,V(1));\\n\\n\\tRET[0][0] = tmp;\\n\\n\\treturn RET;\\n}\\n\\n\\n\\nMATRIX primary(){\\n\\n\\tMATRIX A;\\n\\n\\tif(buf[global_index] >= '0' && buf[global_index] <= '9'){\\n\\n\\t\\tA = inum();\\n\\n\\t}else if(buf[global_index] >= 'A' && buf[global_index] <= 'Z'){\\n\\n\\t\\tA = get_var();\\n\\n\\t}else if(buf[global_index] == '['){\\n\\n\\t\\tA = matrix();\\n\\n\\t}else if(buf[global_index] == '('){\\n\\t\\tglobal_index++;\\n\\t\\tA = expr();\\n\\t\\tglobal_index++;\\n\\t}\\n\\n\\tbool FLG;\\n\\n\\twhile(true){\\n\\t\\tFLG = false;\\n\\n\\t\\tif(buf[global_index] == '('){\\n\\n\\t\\t\\tFLG = true;\\n\\t\\t\\tglobal_index++;\\n\\t\\t\\tMATRIX B = expr();\\n\\t\\t\\tglobal_index++;\\n\\t\\t\\tMATRIX C = expr();\\n\\t\\t\\tglobal_index++;\\n\\n\\t\\t\\tint num_row = B[0].size();\\n\\t\\t\\tint num_col = C[0].size();\\n\\n\\t\\t\\tMATRIX TMP(num_row,V(num_col));\\n\\n\\t\\t\\tfor(int row = 0; row < num_row; row++){\\n\\t\\t\\t\\tfor(int col = 0; col < num_col; col++){\\n\\t\\t\\t\\t\\tTMP[row][col] = A[B[0][row]-1][C[0][col]-1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tA = TMP;\\n\\n\\t\\t}else if(buf[global_index] == '\\\\''){\\n\\t\\t\\tFLG = true;\\n\\t\\t\\tglobal_index++;\\n\\t\\t\\tA = transpose(A);\\n\\t\\t}\\n\\n\\t\\tif(!FLG)break;\\n\\t}\\n\\treturn A;\\n}\\n\\n\\nMATRIX factor(){\\n\\n\\tif(buf[global_index] == '-'){\\n\\n\\t\\tglobal_index++;\\n\\t\\treturn -factor();\\n\\n\\t}else{\\n\\n\\t\\treturn primary();\\n\\t}\\n}\\n\\nMATRIX term(){\\n\\n\\tMATRIX A = factor();\\n\\n\\twhile(buf[global_index] == '*'){\\n\\t\\tglobal_index++;\\n\\t\\tA = A*factor();\\n\\t}\\n\\treturn A;\\n}\\n\\nMATRIX expr(){\\n\\n\\tMATRIX A = term();\\n\\tchar op;\\n\\n\\twhile(buf[global_index] == '+' || buf[global_index] == '-'){\\n\\n\\t\\top = buf[global_index++];\\n\\n\\t\\tif(op == '+'){\\n\\n\\t\\t\\tA = A+term();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tA = A-term();\\n\\t\\t}\\n\\t}\\n\\n\\treturn A;\\n}\\n\\nvoid assignment(){\\n\\n\\tint type = buf[0]-'A';\\n\\tglobal_index = 2;\\n\\tTABLE[type] = expr();\\n\\n\\tglobal_index++;\\n}\\n\\nvoid func(){\\n\\n\\tgetchar();\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\t\\tfgets(buf,100,stdin);\\n\\n\\t\\tassignment();\\n\\n\\t\\tMATRIX A = TABLE[buf[0]-'A'];\\n\\t\\tint num_row = A.size();\\n\\t\\tint num_col = A[0].size();\\n\\n\\t\\tfor(int row = 0; row < num_row; row++){\\n\\t\\t\\tprintf(\\\"%d\\\",A[row][0]);\\n\\t\\t\\tfor(int col = 1; col < num_col; col++){\\n\\t\\t\\t\\tprintf(\\\" %d\\\",A[row][col]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"-----\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.0742,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1314_2998151\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <map>\\n\\n#define fprintf(...) void(0)\\n\\nconst int M=32768;\\n\\nclass Matrix {\\n size_t r=0, c=0;\\n std::vector<std::vector<int>> entity;\\n \\npublic:\\n Matrix(): entity(0) {}\\n Matrix(int x): r(1), c(1), entity(1, std::vector<int>(1, x)) {}\\n Matrix(size_t r, size_t c): r(r), c(c), entity(r, std::vector<int>(c)) {}\\n Matrix(const Matrix &oth): r(oth.r), c(oth.c), entity(oth.entity) {}\\n Matrix(Matrix &&oth): r(oth.r), c(oth.c), entity(std::move(oth.entity)) {}\\n\\n Matrix &operator =(const Matrix &oth) {\\n r = oth.r;\\n c = oth.c;\\n entity = oth.entity;\\n return *this;\\n }\\n\\n Matrix &operator =(Matrix &&oth) {\\n r = oth.r;\\n c = oth.c;\\n entity = std::move(oth.entity);\\n return *this;\\n }\\n\\n Matrix &operator +=(const Matrix &oth) {\\n assert(r == oth.r && c == oth.c);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j) {\\n entity[i][j] += oth[i][j];\\n if (entity[i][j] >= M) entity[i][j] -= M;\\n }\\n\\n return *this;\\n }\\n\\n Matrix operator +(const Matrix &oth) const {\\n return Matrix(*this) += oth;\\n }\\n\\n Matrix &operator -=(const Matrix &oth) {\\n assert(r == oth.r && c == oth.c);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j) {\\n entity[i][j] -= oth[i][j];\\n if (entity[i][j] < 0) entity[i][j] += M;\\n }\\n\\n return *this;\\n }\\n\\n Matrix operator -(const Matrix &oth) const {\\n return Matrix(*this) -= oth;\\n }\\n\\n Matrix operator *(const Matrix &oth) const {\\n if (oth.r == 1 && oth.c == 1) {\\n Matrix res(*this);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j)\\n res[i][j] = res[i][j]*oth[0][0] % M;\\n\\n return res;\\n }\\n if (r == 1 && c == 1) {\\n Matrix res(oth);\\n for (size_t i=0; i<oth.r; ++i)\\n for (size_t j=0; j<oth.c; ++j)\\n res[i][j] = res[i][j]*entity[0][0] % M;\\n\\n return res;\\n }\\n assert(c == oth.r);\\n Matrix res(r, oth.c);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j)\\n for (size_t k=0; k<oth.c; ++k) {\\n res[i][k] += entity[i][j] * oth[j][k];\\n if ((res[i][k] %= M) < 0) res[i][k] += M;\\n }\\n\\n return res;\\n }\\n\\n Matrix &operator *=(const Matrix &oth) {\\n Matrix rhs=(*this)*oth;\\n return (*this = rhs);\\n }\\n\\n const std::vector<int> &operator [](size_t i) const {\\n return entity[i];\\n }\\n\\n std::vector<int> &operator [](size_t i) {\\n return entity[i];\\n }\\n\\n Matrix operator [](\\n const std::pair<std::vector<int>, std::vector<int>> &ind) const {\\n\\n size_t ir=ind.first.size(), ic=ind.second.size();\\n Matrix res(ir, ic);\\n for (size_t i=0; i<ir; ++i)\\n for (size_t j=0; j<ic; ++j)\\n res[i][j] = entity[ind.first[i]-1][ind.second[j]-1];\\n\\n return res;\\n }\\n\\n Matrix operator -() const {\\n Matrix res(r, c);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j)\\n if (entity[i][j])\\n res[i][j] = M-entity[i][j];\\n\\n return res;\\n }\\n\\n Matrix operator ~() const {\\n Matrix res(c, r);\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j)\\n res[j][i] = entity[i][j];\\n\\n return res;\\n }\\n\\n size_t row() const {\\n return entity.size();\\n }\\n\\n size_t col() const {\\n return entity[0].size();\\n }\\n\\n void add_row() {\\n entity.emplace_back();\\n ++r;\\n }\\n\\n void add_col(size_t i, int x) {\\n entity[i].push_back(x);\\n if (c < entity[i].size())\\n c = entity[i].size();\\n }\\n\\n void output() const {\\n for (size_t i=0; i<r; ++i)\\n for (size_t j=0; j<c; ++j)\\n printf(\\\"%d%c\\\", entity[i][j], j+1<c? ' ':'\\\\n');\\n }\\n};\\n\\nMatrix parse(\\n const std::string &s, size_t &i, const std::map<char, Matrix> &vars,\\n size_t preced=0) {\\n\\n static const std::vector<std::string> &ops={\\\"+-\\\", \\\"*\\\"};\\n\\n fprintf(stderr, \\\"s[%zu]: %c #%zu\\\\n\\\", i, s[i], preced);\\n if (preced == ops.size()) {\\n if (s[i] == '-') {\\n return -parse(s, ++i, vars, preced);\\n }\\n\\n Matrix res;\\n if (isdigit(s[i])) {\\n int scl=s[i]-'0';\\n while (++i < s.length() && isdigit(s[i]))\\n scl = scl*10+s[i]-'0';\\n if ((scl %= M) < 0) scl += M;\\n res = Matrix(scl);\\n } else if (isupper(s[i])) {\\n res = vars.at(s[i++]);\\n } else if (s[i] == '(') {\\n res = parse(s, ++i, vars, 0);\\n assert(s[i] == ')');\\n ++i;\\n } else if (s[i] == '[') {\\n // tsurai\\n ++i;\\n size_t r=0, c=0;\\n while (s[i] != ']') {\\n Matrix tmp=parse(s, i, vars, 0);\\n for (size_t ir=0; ir<tmp.row(); ++ir) {\\n if (r+ir >= res.row()) res.add_row();\\n for (size_t ic=0; ic<tmp.col(); ++ic) {\\n // fprintf(stderr, \\\"r+ir: %zu\\\\n\\\", r+ir);\\n if (c+ic < res[r+ir].size()) {\\n res[r+ir][c+ic] = tmp[ir][ic];\\n } else {\\n res.add_col(r+ir, tmp[ir][ic]);\\n }\\n }\\n }\\n // fprintf(stderr, \\\"> s[%zu]\\\\n\\\", i);\\n if (s[i] == ' ') {\\n c += tmp.col();\\n ++i;\\n } else if (s[i] == ';') {\\n r = res.row();\\n c = 0;\\n ++i;\\n } else {\\n assert(s[i] == ']');\\n }\\n }\\n ++i;\\n } else {\\n assert(false);\\n }\\n\\n while (s[i] == '\\\\'' || s[i] == '(') {\\n char ch=s[i++];\\n if (ch == '\\\\'') {\\n res = ~res;\\n } else /* if (ch == '(') */ {\\n const std::vector<int> fst=parse(s, i, vars, 0)[0];\\n assert(s[i] == ',');\\n const std::vector<int> snd=parse(s, ++i, vars, 0)[0];\\n assert(s[i] == ')');\\n ++i;\\n res = res[std::make_pair(fst, snd)];\\n }\\n }\\n // fprintf(stderr, \\\">> s[%zu]\\\\n\\\", i);\\n return res;\\n }\\n\\n Matrix lhs=parse(s, i, vars, preced+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\\n Matrix rhs=parse(s, ++i, vars, preced+1);\\n if (op == '+') {\\n lhs += rhs;\\n } else if (op == '-') {\\n lhs -= rhs;\\n } else if (op == '*') {\\n lhs *= rhs;\\n }\\n }\\n return lhs;\\n}\\n\\nint testcase_ends() {\\n int n;\\n scanf(\\\"%d\\\", &n);\\n if (n == 0) return 1;\\n\\n std::map<char, Matrix> vars;\\n for (int i=0; i<n; ++i) {\\n char buf[128];\\n scanf(\\\" %[^\\\\n]\\\", buf);\\n std::string s=buf;\\n fprintf(stderr, \\\"%s\\\\n\\\", s.c_str());\\n s.pop_back();\\n char lhs=s[0];\\n size_t j=2;\\n Matrix rhs=parse(s, j, vars);\\n //assert(s[j] == '.');\\n rhs.output();\\n vars[lhs] = rhs;\\n }\\n printf(\\\"-----\\\\n\\\");\\n return 0;\\n}\\n\\nint main() {\\n while (!testcase_ends()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2900,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":767,"cells":{"group_id":{"kind":"string","value":"aoj_1318_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nLong Distance Taxi\nA taxi driver, Nakamura, was so delighted because he got a passenger who wanted to go to a\ncity thousands of kilometers away. However, he had a problem. As you may know, most taxis in\nJapan run on liquefied petroleum gas (LPG) because it is cheaper than gasoline. There are more\nthan 50,000 gas stations in the country, but less than one percent of them sell LPG. Although\nthe LPG tank of his car was full, the tank capacity is limited and his car runs 10 kilometer per\nliter, so he may not be able to get to the destination without filling the tank on the way. He\nknew all the locations of LPG stations.\nYour task is to write a program that finds the best way from the current location to the destination without running out of gas.\nInput\nThe input consists of several datasets, and each dataset is in the following format.\nN M cap\nsrc dest\nc\n1,1\nc\n1,2\nd\n1\nc\n2,1\nc\n2,2\nd\n2\n.\n.\n.\nc\nN,1\nc\nN,2\nd\nN\ns\n1\ns\n2\n.\n.\n.\ns\nM\nThe first line of a dataset contains three integers (\nN, M, cap\n), where\nN\nis the number of roads\n(1 ≤\nN\n≤ 3000),\nM\nis the number of LPG stations (1≤\nM\n≤ 300), and\ncap\nis the tank capacity\n(1 ≤\ncap\n≤ 200) in liter. The next line contains the name of the current city (\nsrc\n) and the name\nof the destination city (\ndest\n). The destination city is always different from the current city.\nThe following\nN\nlines describe roads that connect cities. The road i (1 ≤\ni\n≤ N) connects two\ndifferent cities\nc\ni,1\nand\nc\ni,2\nwith an integer distance\nd\ni\n(0 <\nd\ni\n≤ 2000) in kilometer, and he can\ngo from either city to the other. You can assume that no two different roads connect the same\npair of cities. The columns are separated by a single space. The next\nM\nlines (\ns\n1\n,\ns\n2\n,...,\ns\nM\n) indicate the names of the cities with LPG station. \nYou can assume that a city with LPG station has at least one road.\nThe name of a city has no more than 15 characters. Only English alphabet ('A' to 'Z' and 'a'\nto 'z', case sensitive) is allowed for the name.\nA line with three zeros terminates the input.\nOutput\nFor each dataset, output a line containing the length (in kilometer) of the shortest possible\njourney from the current city to the destination city. If Nakamura cannot reach the destination,\noutput \"-1\" (without quotation marks). You must not output any other characters.\nThe actual tank capacity is usually a little bit larger than that on the specification sheet, so\nyou can assume that he can reach a city even when the remaining amount of the gas becomes\nexactly zero. In addition, you can always fill the tank at the destination so you do not have to\nworry about the return trip.\nSample Input\n6 3 34\nTokyo Kyoto\nTokyo Niigata 335\nTokyo Shizuoka 174\nShizuoka Nagoya 176\nNagoya Kyoto 195\nToyama Niigata 215\nToyama Kyoto 296\nNagoya\nNiigata\nToyama\n6 3 30\nTokyo Kyoto\nTokyo Niigata 335\nTokyo Shizuoka 174\nShizuoka Nagoya 176\nNagoya Kyoto 195\nToyama Niigata 215\nToyama Kyoto 296\nNagoya\nNiigata\nToyama\n0 0 0\nOutput for the Sample Input\n846\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1318_10849725","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <queue>\n#include <map>\n#include <string>\n#include <cstring>\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 6000;\nconst int maxm = 6090;\nconst int inf = ~0u >> 2;\n\nstruct Edge{\n\tint v, w;\n\tEdge() {}\n\tEdge(int v, int w) {\n\t\tthis->v = v;\tthis->w = w;\n\t}\n};\n\nint n, m, gas, ncnt;\nvector<int> gast;\nvector<Edge> g1[maxn], g2[maxm];\nmap<string, int> mp;\n\nvoid addNode(string s)\n{\n\tif(!mp[s])\tmp[s] = ++ncnt;\n}\n\nvoid addEdge(int u, int v, int w)\n{\n\tg1[u].push_back(Edge(v, w));\n\tg1[v].push_back(Edge(u, w));\n}\n\nvoid spfa(int x, int dis[], vector<Edge> g[])\n{\n\tqueue<int> q;\n\tbool inqueue[maxn];\n\tmemset(inqueue, 0, sizeof(inqueue));\n\tinqueue[x] = 1;\tq.push(x); dis[x] = 0;\n\twhile(!q.empty()) {\n\t\tint tmp = q.front();\tq.pop();\tinqueue[tmp] = false;\n\t\tfor(int i = 0; i < g[tmp].size(); i++) {\n\t\t\tint v = g[tmp][i].v, w = g[tmp][i].w;\n\t\t\tif(dis[tmp]+w < dis[v]) {\n\t\t\t\tdis[v] = dis[tmp]+w;\n\t\t\t\tif(!inqueue[v]) {\n\t\t\t\t\tq.push(v);\n\t\t\t\t\tinqueue[v] = true;;\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t}\t\n}\n\nint main()\n{\n#ifdef LOCAL\n\tfreopen(\"D.in\", \"r\", stdin);\n#endif\n\twhile(scanf(\"%d%d%d\", &m, &n, &gas) != EOF) {\n\t\tif(m == 0 && n == 0)\tbreak;\n\t\tncnt = 0;\n\t\tchar stmp[maxm], estmp[maxm]; \n\t\tgast.clear();\n\t\tmp.clear();\n\t\tfor(int i = 0; i < maxn; i++)\tg1[i].clear();\n\t\tfor(int i = 0; i < maxm; i++)\tg2[i].clear();\n\t\tscanf(\"%s%s\", stmp, estmp);\n\t\taddNode(stmp);\taddNode(estmp);\n\t\tfor(int i = 0; i < m; i++) {\n\t\t\tint w;\n\t\t\tscanf(\"%s%s%d\", stmp, estmp, &w);\n\t\t\taddNode(stmp);\taddNode(estmp);\n\t\t\taddEdge(mp[stmp], mp[estmp], w);\n\t\t}\n\t\tgast.push_back(1);\tgast.push_back(2);\n\t\tfor(int i = 1; i <= n; i++) {\n\t\t//if one vertex is unique, ignore it\n\t\t\tscanf(\"%s\", stmp);\n\t\t\tif(mp[stmp])\tgast.push_back(mp[stmp]);\n\t\t}\n\t\t//calc single-point shortest path for every gas station and set-up point\n\t\t//rebuild a graph with vertices including stations and beginning and end point\n\t\tfor(int i = 0; i < gast.size(); i++) {\n\t\t\tint x = gast[i];\n\t\t\tint dis[maxn];\n\t\t\tfill(dis, dis+ncnt+1, inf);\n\t\t\tspfa(x, dis, g1);\n\t\t\tfor(int j = 0; j < gast.size(); j++)\n\t\t\t\tif(dis[gast[j]] <= gas*10) \tg2[i].push_back(Edge(j, dis[gast[j]]));\n\t\t}\n\t\tint dis[maxm];\n\t\tfill(dis, dis+gast.size()+1, inf);\n\t\tspfa(0, dis, g2);\t\n\t\tprintf(\"%d\\n\", dis[1] != inf ? dis[1] : -1);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":5488,"score_of_the_acc":-0.0165,"final_rank":1},{"submission_id":"aoj_1318_10730467","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<cmath>\n#include<vector>\n#define inf 0x3f3f3f3f\n#define Inf 0x3FFFFFFFFFFFFFFFLL\n#define eps 1e-9\n#define pi acos(-1.0)\nusing namespace std;\ntypedef long long ll;\nconst int maxn=3000+10;\nmap<string,int>mp;\nstruct Edge\n{\n int v,w,next;\n Edge(){}\n Edge(int v,int w,int next):v(v),w(w),next(next){}\n}edges[maxn<<2];\nint head[maxn<<1],d[maxn<<1][2010],nEdge;\nbool flag[maxn<<1],inq[maxn<<1][2010];\nvoid AddEdges(int u,int v,int w)\n{\n edges[++nEdge]=Edge(v,w,head[u]);\n head[u]=nEdge;\n edges[++nEdge]=Edge(u,w,head[v]);\n head[v]=nEdge;\n}\nint spfa(int s,int t,int cap)\n{\n memset(d,0x3f,sizeof(d));\n memset(inq,0,sizeof(inq));\n cap*=10;\n d[s][cap]=0;\n queue<pair<int,int> >q;\n q.push(make_pair(s,cap));\n pair<int,int>pii;\n int u,st;\n while(!q.empty())\n {\n pii=q.front();q.pop();\n u=pii.first;st=pii.second;\n inq[u][st]=false;\n for(int k=head[u];k!=-1;k=edges[k].next)\n {\n int v=edges[k].v;\n int cost=edges[k].w;\n if(st>=cost&&d[v][st-cost]>d[u][st]+cost)\n {\n d[v][st-cost]=d[u][st]+cost;\n if(!inq[v][st-cost]) {inq[v][st-cost]=true;q.push(make_pair(v,st-cost));}\n }\n if(flag[u])\n {\n if(cap>=cost&&d[v][cap-cost]>d[u][st]+cost)\n {\n d[v][cap-cost]=d[u][st]+cost;\n if(!inq[v][cap-cost]) {inq[v][cap-cost]=true;q.push(make_pair(v,cap-cost));}\n }\n }\n }\n }\n int res=inf;\n for(int i=0;i<=cap;++i)\n res=min(res,d[t][i]);\n return res==inf?-1:res;\n}\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n //freopen(\"out.txt\",\"w\",stdout);\n char str[30],str2[30];\n int n,m,s,t,cap,N;\n while(~scanf(\"%d%d%d\",&n,&m,&cap))\n {\n if(n==0&&m==0&&cap==0) break;\n mp.clear();\n N=0;\n scanf(\"%s\",str);\n s=mp[(string)str]=++N;\n scanf(\"%s\",str);\n t=mp[(string)str]=++N;\n memset(head,0xff,sizeof(head));\n nEdge=-1;\n memset(flag,0,sizeof(flag));\n int u,v,w;\n for(int i=0;i<n;++i)\n {\n scanf(\"%s%s%d\",str,str2,&w);\n if(mp[(string)str]) u=mp[(string)str];\n else u=mp[(string)str]=++N;\n if(mp[(string)str2]) v=mp[(string)str2];\n else v=mp[(string)str2]=++N;\n AddEdges(u,v,w);\n }\n for(int i=0;i<m;++i)\n {\n scanf(\"%s\",str);\n flag[mp[(string)str]]=true;\n }\n int ans=spfa(s,t,cap);\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":420,"memory_kb":75740,"score_of_the_acc":-0.7621,"final_rank":11},{"submission_id":"aoj_1318_10730466","code_snippet":"#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <cmath>\n#include <string>\n#include <cctype>\n#include <vector>\n#include <cstdio>\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\ntypedef long long LL;\n\n\nconst int oo=INT_MAX>>1;\nstruct node{\n\tint u,x,w;\n\tnode(int _u,int _x,int _w){\n\t\tu=_u; x=_x; w=_w;\n\t}\n\tbool operator<(const node &t)const{\n\t\treturn w>t.w;\n\t}\n};\npriority_queue<node> Q;\nvector< pair<int,int> > a[13000];\nint dis[6007][2007],N;\nbool vis[6007][2007],b[6100];\nmap<string,int> mm;\n\nint get(string s){\n\tif (mm[s]) return mm[s];\n\tmm[s]=++N; a[N].clear();\n\treturn N;\n}\n\nint main(){\n\tint M,c,lim,u,v,d,i,j;\n\twhile (scanf(\"%d%d%d\",&M,&c,&lim), M || c || lim){\n\t\tlim*=10;\n\t\tchar s[100],t[100];\n\t\tmm.clear(); N=0;\n\t\tscanf(\"%s%s\",s,t); get(s); get(t);\n\t\twhile (M--){\n\t\t\tscanf(\"%s%s%d\",s,t,&d);\n\t\t\tu=get(s); v=get(t);\n\t\t\ta[u].push_back(make_pair(v,d)); a[v].push_back(make_pair(u,d));\n\t\t}\n\t\tfor (i=1;i<=N;i++){\n\t\t\tb[i]=0;\n\t\t\tfor (j=0;j<=lim;j++){\n\t\t\t\tdis[i][j]=oo; vis[i][j]=0;\n\t\t\t}\n\t\t}\n\t\twhile (c--){\n\t\t\tscanf(\"%s\",s); b[get(s)]=1;\n\t\t}\n\t\tdis[1][lim]=0;\n\t\tQ.push(node(1,lim,0));\n\t\tint x,y;\n\t\twhile (!Q.empty()){\n\t\t\tu=Q.top().u; x=Q.top().x; Q.pop();\n\t\t\tif (vis[u][x]) continue;\n\t\t\tvis[u][x]=1;\n\t\t\tfor (vector< pair<int,int> >::iterator ii=a[u].begin();ii!=a[u].end();ii++){\n\t\t\t\tv=ii->first; d=ii->second;\n\t\t\t\tif (d>x) continue;\n\t\t\t\ty=b[v]?lim:x-d;\n\t\t\t\tif (dis[u][x]+d<dis[v][y]){\n\t\t\t\t\tdis[v][y]=dis[u][x]+d;\n\t\t\t\t\tQ.push(node(v,y,dis[v][y]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=oo;\n\t\tfor (i=0;i<=lim;i++){\n\t\t\tans=min(ans,dis[2][i]);\n\t\t}\n\t\tprintf(\"%d\\n\",ans==oo?-1:ans);\n\t}\n}","accuracy":1,"time_ms":610,"memory_kb":88728,"score_of_the_acc":-0.923,"final_rank":14},{"submission_id":"aoj_1318_10730415","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <set>\n#include <vector>\n#include <string>\n#include <stack>\n#include <bitset>\n#define INF 0x3f3f3f3f\n#define eps 1e-8\n#define FI first\n#define SE second\nusing namespace std;\ntypedef long long LL;\nconst int maxn=6005;\nint n,m,C;\nmap <string,int> mp;\nmap <string,int>::iterator it;\nint head[maxn];\nstruct Edge\n{\n int next,to,len;\n}ed[maxn*2];\nint ecnt,label;\n\ninline void init()\n{\n ecnt=label=0;\n memset(head,-1,sizeof(head));\n mp.clear();\n}\n\ninline void addedge(int u,int v,int l)\n{\n ed[ecnt].next=head[u];\n ed[ecnt].to=v;\n ed[ecnt].len=l;\n head[u]=ecnt++;\n}\n\ninline int add(char *s)\n{\n it=mp.find(s);\n if(it!=mp.end()) return it->second;\n mp.insert(make_pair(s,label));\n return label++;\n}\n\nchar s1[25],s2[25];\nstruct Node\n{\n int u,c,dis;\n inline Node() {}\n inline Node(int _u,int _c,int _dis)\n {\n u=_u; c=_c; dis=_dis;\n }\n bool operator <(const Node &a)const\n {\n return dis>a.dis;\n }\n};\npriority_queue <Node> Q;\n\nint dp[6005][2005];\nbool done[6005][2005];\nbool LPG[6005];\ninline int Dijkstra(int S,int T)\n{\n while(!Q.empty()) Q.pop();\n C*=10;\n for(int i=0;i<label;++i) for(int j=0;j<=C;++j)\n {\n dp[i][j]=INF;\n done[i][j]=0;\n }\n dp[S][C]=0;\n Q.push(Node(S,C,0));\n Node t;\n while(!Q.empty())\n {\n t=Q.top(); Q.pop();\n if(t.u==T) return t.dis;\n if(done[t.u][t.c]) continue;\n for(int e=head[t.u];~e;e=ed[e].next)\n {\n int v=ed[e].to;\n if(t.c<ed[e].len) continue;\n int nc=t.c-ed[e].len;\n if(LPG[v]) nc=C;\n if(dp[v][nc]>t.dis+ed[e].len)\n {\n dp[v][nc]=t.dis+ed[e].len;\n Q.push(Node(v,nc,dp[v][nc]));\n }\n }\n }\n return -1;\n}\n\nint main()\n{\n while(scanf(\"%d%d%d\",&n,&m,&C)&&n)\n {\n init();\n scanf(\"%s%s\",s1,s2);\n int S=add(s1),T=add(s2);\n for(int i=0;i<n;++i)\n {\n int d;\n scanf(\"%s%s%d\",s1,s2,&d);\n if(d>C*10) continue;\n int u=add(s1),v=add(s2);\n addedge(u,v,d);\n addedge(v,u,d);\n }\n memset(LPG,0,sizeof(LPG));\n for(int i=0;i<m;++i)\n {\n scanf(\"%s\",s1);\n LPG[add(s1)]=1;\n }\n printf(\"%d\\n\",Dijkstra(S,T));\n }\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":87140,"score_of_the_acc":-0.8956,"final_rank":13},{"submission_id":"aoj_1318_10584241","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst long long INF = 4e18;\n\nint main() {\n while (true) {\n int N, M, cap;\n if (!(cin >> N >> M >> cap) || (N == 0 && M == 0 && cap == 0)) break;\n string srcName, dstName; cin >> srcName >> dstName;\n\n unordered_map<string, int> id;\n vector<vector<pair<int,int>>> g;\n\n auto getID = [&](const string& s) -> int {\n auto it = id.find(s);\n if (it != id.end()) return it->second;\n int idx = id.size();\n id[s] = idx;\n g.emplace_back();\n return idx;\n };\n\n for (int i = 0; i < N; ++i) {\n string a, b; int d; cin >> a >> b >> d;\n int u = getID(a), v = getID(b);\n g[u].push_back({v,d});\n g[v].push_back({u,d});\n }\n\n vector<int> station;\n station.reserve(M+2);\n station.push_back(getID(srcName));\n int dstID = getID(dstName);\n if (dstID != station[0]) station.push_back(dstID);\n\n for (int i = 0; i < M; ++i) {\n string s; cin >> s;\n int idS = getID(s);\n if (idS != station[0] && idS != dstID) station.push_back(idS);\n }\n\n int R = cap * 10;\n int K = station.size();\n vector<vector<long long>> meta(K, vector<long long>(K, INF));\n\n auto dijkstra_cut = [&](int start){\n vector<long long> dist(g.size(), INF);\n using P=pair<long long,int>; priority_queue<P, vector<P>, greater<P>> pq;\n dist[start]=0; pq.push({0,start});\n while(!pq.empty()){\n auto [d,u]=pq.top(); pq.pop();\n if(d!=dist[u] || d>R) continue;\n for(auto [v,w]:g[u]){\n if(d+w<dist[v] && d+w<=R){\n dist[v]=d+w; pq.push({dist[v],v});\n }\n }\n }\n return dist;\n };\n\n vector<vector<long long>> allDist;\n for(int i=0;i<K;++i) allDist.push_back(dijkstra_cut(station[i]));\n\n for(int i=0;i<K;++i)\n for(int j=0;j<K;++j)\n if(allDist[i][station[j]]<=R)\n meta[i][j]=allDist[i][station[j]];\n\n vector<long long> dmeta(K,INF);\n using P=pair<long long,int>; priority_queue<P,vector<P>,greater<P>> pq;\n dmeta[0]=0; pq.push({0,0});\n while(!pq.empty()){\n auto [d,u]=pq.top(); pq.pop();\n if(d!=dmeta[u]) continue;\n for(int v=0;v<K;++v)\n if(meta[u][v]<INF && d+meta[u][v]<dmeta[v]){\n dmeta[v]=d+meta[u][v];\n pq.push({dmeta[v],v});\n }\n }\n\n long long ans = dmeta[1];\n cout << (ans==INF?-1:ans) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":11340,"score_of_the_acc":-0.0798,"final_rank":5},{"submission_id":"aoj_1318_10584197","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 4e18;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int N, M, cap;\n if (!(cin >> N >> M >> cap) || (N == 0 && M == 0 && cap == 0)) break;\n string srcName, dstName; cin >> srcName >> dstName;\n\n unordered_map<string, int> id;\n vector<vector<pair<int,int>>> g; // id -> {next, dist}\n\n auto getID = [&](const string& s) -> int {\n auto it = id.find(s);\n if (it != id.end()) return it->second;\n int idx = id.size();\n id[s] = idx;\n g.emplace_back();\n return idx;\n };\n\n for (int i = 0; i < N; ++i) {\n string a, b; int d; cin >> a >> b >> d;\n int u = getID(a), v = getID(b);\n g[u].push_back({v,d});\n g[v].push_back({u,d});\n }\n\n vector<int> station;\n station.reserve(M+2);\n station.push_back(getID(srcName));\n int dstID = getID(dstName);\n if (dstID != station[0]) station.push_back(dstID);\n\n for (int i = 0; i < M; ++i) {\n string s; cin >> s;\n int idS = getID(s);\n if (idS != station[0] && idS != dstID) station.push_back(idS);\n }\n\n int R = cap * 10;\n int K = station.size();\n vector<vector<ll>> meta(K, vector<ll>(K, INF));\n\n auto dijkstra_cut = [&](int start){\n vector<ll> dist(g.size(), INF);\n using P=pair<ll,int>; priority_queue<P, vector<P>, greater<P>> pq;\n dist[start]=0; pq.push({0,start});\n while(!pq.empty()){\n auto [d,u]=pq.top(); pq.pop();\n if(d!=dist[u] || d>R) continue;\n for(auto [v,w]:g[u]){\n if(d+w<dist[v] && d+w<=R){\n dist[v]=d+w; pq.push({dist[v],v});\n }\n }\n }\n return dist;\n };\n\n vector<vector<ll>> allDist;\n for(int i=0;i<K;++i) allDist.push_back(dijkstra_cut(station[i]));\n\n for(int i=0;i<K;++i)\n for(int j=0;j<K;++j)\n if(allDist[i][station[j]]<=R)\n meta[i][j]=allDist[i][station[j]];\n\n vector<ll> dmeta(K,INF);\n using P=pair<ll,int>; priority_queue<P,vector<P>,greater<P>> pq;\n dmeta[0]=0; pq.push({0,0});\n while(!pq.empty()){\n auto [d,u]=pq.top(); pq.pop();\n if(d!=dmeta[u]) continue;\n for(int v=0;v<K;++v)\n if(meta[u][v]<INF && d+meta[u][v]<dmeta[v]){\n dmeta[v]=d+meta[u][v];\n pq.push({dmeta[v],v});\n }\n }\n\n ll ans = dmeta[1];\n cout << (ans==INF?-1:ans) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":11464,"score_of_the_acc":-0.0744,"final_rank":4},{"submission_id":"aoj_1318_10292082","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (true)\n {\n ll n, m, cap;\n cin >> n >> m >> cap;\n if (n == 0)\n {\n break;\n }\n string S, G;\n cin >> S >> G;\n set<string> st;\n st.insert(S);\n st.insert(G);\n vector<string> a(n), b(n);\n vector<ll> c(n);\n rep(i, 0, n)\n {\n cin >> a[i] >> b[i] >> c[i];\n st.insert(a[i]);\n st.insert(b[i]);\n }\n ll C = 0;\n map<string, ll> mp;\n for (auto i : st)\n {\n mp[i] = C;\n C++;\n }\n vector<vector<pair<ll, ll>>> g(C);\n rep(i, 0, n)\n {\n g[mp[a[i]]].push_back(pr(mp[b[i]], c[i]));\n g[mp[b[i]]].push_back(pr(mp[a[i]], c[i]));\n }\n vector<bool> sta(C);\n rep(i, 0, m)\n {\n string x;\n cin >> x;\n sta[mp[x]] = true;\n }\n vector<vector<ll>> d(C, vector<ll>(cap * 10 + 1, inf));\n d[mp[S]][cap * 10] = 0;\n using T = pair<ll, pair<ll, ll>>;\n priority_queue<T, vector<T>, greater<T>> que;\n que.push(pr(0, pr(mp[S], cap * 10)));\n while (!que.empty())\n {\n ll X = que.top().first;\n ll Y = que.top().second.first;\n ll Z = que.top().second.second;\n que.pop();\n if (d[Y][Z] != X)\n {\n continue;\n }\n rep(i, 0, g[Y].size())\n {\n ll nxt = g[Y][i].first;\n ll cost = g[Y][i].second;\n if (Z >= cost)\n {\n if (sta[nxt])\n {\n if (d[nxt][cap * 10] > X + cost)\n {\n d[nxt][cap * 10] = X + cost;\n que.push(pr(d[nxt][cap * 10], pr(nxt, cap * 10)));\n }\n }\n else\n {\n if (d[nxt][Z - cost] > X + cost)\n {\n d[nxt][Z - cost] = X + cost;\n que.push(pr(d[nxt][Z - cost], pr(nxt, Z - cost)));\n }\n }\n }\n }\n }\n ll ans = inf;\n rep(i, 0, cap * 10 + 1)\n {\n chmin(ans, d[mp[G]][i]);\n }\n if (ans == inf)\n {\n cout << -1 << endl;\n }\n else\n {\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":1160,"memory_kb":101768,"score_of_the_acc":-1.1439,"final_rank":16},{"submission_id":"aoj_1318_10060827","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n\nmap<string,int> MP;\nvector<vector<array<int,2>>> G;\nint rt(string S){\n if(!MP.count(S)){\n MP[S]=MP.size();\n G.push_back({});\n }\n return MP[S];\n}\n\nvoid solve(int N,int M,int C){\n MP.clear();\n G.clear();\n string s,t;\n cin>>s>>t;\n int S=rt(s),T=rt(t);\n rep(i,N){\n cin>>s>>t;\n int U=rt(s),V=rt(t),d;\n cin>>d;\n G[U].push_back({V,d});\n G[V].push_back({U,d});\n }\n set<int> LP;\n rep(i,M){\n string s;\n cin>>s;\n LP.insert(rt(s));\n }\n\n N=MP.size();\n vector<vector<ll>> D(N,vector<ll>(C*10+1,1e18));\n D[S][0]=0;\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> Q;\n Q.push({0,S,0});\n vector<vector<bool>> seen(N,vector<bool>(C*10+1,0));\n ll an=1e18;\n while(!Q.empty()){\n auto p=Q.top();\n Q.pop();\n if(seen[p[1]][p[2]])continue;\n seen[p[1]][p[2]]=1;\n if(p[1]==T)an=min(an,p[0]);\n for(auto [v,d]:G[p[1]]){\n ll nc=p[2]+d,nd=p[0]+d;\n if(nc>C*10)continue;\n if(LP.count(v))nc=0;\n if(seen[v][nc])continue;\n if(D[v][nc]>nd){\n D[v][nc]=nd;\n Q.push({nd,v,nc});\n }\n }\n }\n cout<<(an<1e17?an:-1)<<endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N,M,C;\n while(cin>>N>>M>>C,N+M+C!=0)solve(N,M,C);\n}","accuracy":1,"time_ms":1380,"memory_kb":101432,"score_of_the_acc":-1.1769,"final_rank":18},{"submission_id":"aoj_1318_10060819","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,s,t) for(int i=s;i<t;i++)\n\nusing vi = vector<int>;\n\nint rt(map<string,int> &MP,string S,vector<vector<array<int,2>>> &G){\n if(!MP.count(S)){\n MP[S]=MP.size();\n G.push_back({});\n }\n return MP[S];\n}\n\nvoid solve(int N,int M,int C){\n map<string,int> MP;\n vector<vector<array<int,2>>> G;\n string s,t;\n cin>>s>>t;\n int S=rt(MP,s,G),T=rt(MP,t,G);\n rep(i,N){\n string u,v;\n cin>>u>>v;\n int U=rt(MP,u,G),V=rt(MP,v,G),d;\n cin>>d;\n G[U].push_back({V,d});\n G[V].push_back({U,d});\n }\n set<int> LP;\n rep(i,M){\n string s;\n cin>>s;\n LP.insert(rt(MP,s,G));\n }\n\n N=MP.size();\n vector<vector<ll>> D(N,vector<ll>(C*10+1,1e18));\n D[S][0]=0;\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> Q;\n Q.push({0,S,0});\n vector<vector<bool>> seen(N,vector<bool>(C*10+1,0));\n while(!Q.empty()){\n auto p=Q.top();\n Q.pop();\n if(seen[p[1]][p[2]])continue;\n seen[p[1]][p[2]]=1;\n for(auto [v,d]:G[p[1]]){\n ll nc=p[2]+d;\n if(nc>C*10)continue;\n ll nd=p[0]+d;\n if(LP.count(v))nc=0;\n if(seen[v][nc])continue;\n if(D[v][nc]>nd){\n D[v][nc]=nd;\n Q.push({nd,v,nc});\n }\n }\n }\n ll an=1e18;\n rep(i,C*10+1)an=min(an,D[T][i]);\n cout<<(an<1e17?an:-1)<<endl;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int N,M,C;\n while(cin>>N>>M>>C,N+M+C!=0)solve(N,M,C);\n}","accuracy":1,"time_ms":1400,"memory_kb":102336,"score_of_the_acc":-1.1892,"final_rank":19},{"submission_id":"aoj_1318_9684304","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct UnionFind{\n vector<int> par; int n;\n UnionFind(){}\n UnionFind(int _n):par(_n,-1),n(_n){}\n int root(int x){return par[x]<0?x:par[x]=root(par[x]);}\n bool same(int x,int y){return root(x)==root(y);}\n int size(int x){return -par[root(x)];}\n bool unite(int x,int y){\n x=root(x),y=root(y); if(x==y)return false;\n if(size(x)>size(y))swap(x,y);\n par[y]+=par[x]; par[x]=y; n--; return true;\n }\n};\n\n/**\n * @brief Union Find\n */\n\nvector<int> MakeDist(vector<vector<pair<int,int>>>& G, int S) {\n int N = G.size();\n vector<int> DP(N,inf);\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\n DP[S] = 0;\n PQ.push({0,S});\n while(!PQ.empty()) {\n auto [D,P] = PQ.top();\n PQ.pop();\n if (DP[P] < D) continue;\n for (auto E : G[P]) {\n int NP = E.first, ND = E.second + D;\n if (chmin(DP[NP],ND)) {\n PQ.push({ND,NP});\n }\n }\n }\n return DP;\n}\n\nint main() {\nwhile(1) {\n int M, K, L;\n cin >> M >> K >> L;\n if (M == 0) return 0;\n L *= 10;\n map<string,int> mp;\n int Cur = 0;\n string S;\n cin >> S;\n mp[S] = 0;\n cin >> S;\n mp[S] = 1;\n Cur = 2;\n vector<int> A(M), B(M), D(M);\n rep(i,0,M) {\n string T;\n cin >> S >> T >> D[i];\n if (mp.count(S)) A[i] = mp[S];\n else mp[S] = A[i] = Cur, Cur++;\n if (mp.count(T)) B[i] = mp[T];\n else mp[T] = B[i] = Cur, Cur++;\n }\n vector<int> C(K+2);\n rep(i,0,K) {\n cin >> S;\n if (mp.count(S)) C[i] = mp[S];\n else mp[S] = C[i] = Cur, Cur++;\n }\n C[K] = 0,C[K+1] = 1;\n UNIQUE(C);\n int N = Cur;\n K = C.size();\n vector<vector<pair<int,int>>> G(N);\n rep(i,0,M) G[A[i]].push_back({B[i],D[i]}), G[B[i]].push_back({A[i],D[i]});\n vector<vector<int>> Dist(K,vector<int>(K,inf));\n rep(i,0,K) {\n vector<int> DP = MakeDist(G,C[i]);\n rep(j,0,K) {\n Dist[i][j] = DP[C[j]];\n }\n }\n rep(i,0,K) {\n rep(j,0,K) {\n if (Dist[i][j] > L) Dist[i][j] = inf;\n }\n }\n rep(k,0,K) {\n rep(i,0,K) {\n rep(j,0,K) {\n chmin(Dist[i][j], Dist[i][k] + Dist[k][j]);\n }\n }\n }\n cout << (Dist[0][1] == inf ? -1 : Dist[0][1]) << endl;\n}\n}","accuracy":1,"time_ms":640,"memory_kb":4004,"score_of_the_acc":-0.0825,"final_rank":6},{"submission_id":"aoj_1318_9563459","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nclass Node {\n public:\n\tstring city;\n\tint gas; // [deciliter]\n\tint dist;\n\n\tNode(const string& city, const int& gas, const int& dist)\n\t\t: city(city), gas(gas), dist(dist) {};\n\n\tbool operator<(const Node& b) const {\n\t\treturn (this->dist > b.dist);\n\t}\n};\n\n// cap [deciliter]\nll ShortestWay(const int& cap, const string& src, const string& dest, map<string, map<string, int>>& adjacents, map<string, bool>& has_station) {\n\tll ans = -1;\n\n\tmap<string, map<int, ll>> dist;\n\tdist[src][cap] = 0;\n\tmap<string, map<int, bool>> done;\n\tpriority_queue<Node> que;\n\tque.emplace(src, cap, 0);\n\n\twhile (!que.empty()) {\n\t\tNode node = que.top();\n\t\tque.pop();\n\t\tif (node.city == dest) {\n\t\t\tans = dist[node.city][node.gas];\n\t\t\tbreak;\n\t\t}\n\t\tdone[node.city][node.gas] = true;\n\n\t\tfor (const auto& adjacent : adjacents[node.city]) {\n\t\t\tint adjacent_gas = node.gas - adjacent.second;\n\t\t\tif (adjacent_gas < 0) continue;\n\t\t\tif (has_station[adjacent.first]) adjacent_gas = cap;\n\t\t\tif (done[adjacent.first][adjacent_gas]) continue;\n\t\t\tll adjacent_dist = node.dist + adjacent.second;\n\n\t\t\tbool dismiss = false;\n\t\t\tfor (const auto& gas_and_dist : dist[adjacent.first]) {\n\t\t\t\tif (adjacent_gas <= gas_and_dist.first and adjacent_dist >= gas_and_dist.second) dismiss = true;\n\t\t\t}\n\t\t\tif (dismiss) continue;\n\n\t\t\tdist[adjacent.first][adjacent_gas] = adjacent_dist;\n\t\t\tque.emplace(adjacent.first, adjacent_gas, adjacent_dist);\n\t\t}\n\t}\n\n\treturn ans;\n}\n\nbool solve() {\n\tint n, m, cap;\n\tcin >> n >> m >> cap;\n\tif (n == 0) return false;\n\tstring src, dest;\n\tcin >> src >> dest;\n\tmap<string, map<string, int>> adjacents;\n\tfor (int i = 0; i < n; i++) {\n\t\tstring c1, c2;\n\t\tint d;\n\t\tcin >> c1 >> c2 >> d;\n\t\tadjacents[c1][c2] = adjacents[c2][c1] = d;\n\t}\n\tmap<string, bool> has_station;\n\tfor (int i = 0; i < m; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\t\thas_station[s] = true;\n\t}\n\n\tcout << ShortestWay(cap * 10, src, dest, adjacents, has_station) << endl;\n\n\treturn true;\n}\n\nint main(void) {\n\twhile (solve());\n\treturn 0;\n}","accuracy":1,"time_ms":6200,"memory_kb":104212,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1318_8994680","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\n// g <- pair < v , cost > \ntemplate < class T >\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {\n T INF = numeric_limits< T >::max();\n vector<T> dist(graph.size(), INF);\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\n q.push({dist[s] = T(0), s});\n while(!q.empty()){\n auto [uc, ui] = q.top(); q.pop();\n if(uc != dist[ui]) continue;\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \n q.push({dist[vi] = uc + vc, vi});\n }\n return dist;\n}\n\nint solve(int N, int M, int cap) {\n cap *= 10;\n\n map<string, int> mp;\n int sz = 0;\n auto ID = [&](string s) {\n if(!mp.count(s)) mp[s] = sz++;\n return mp[s];\n };\n int src = [&] { string s = in(); return ID(s); }();\n int dst = [&] { string s = in(); return ID(s); }();\n vector<vector<pair<int,int>>> G(N + N);\n for(int i : rep(N)) {\n string s = in(), t = in(); int d = in();\n int u = ID(s), v = ID(t);\n G[u].push_back({v, d});\n G[v].push_back({u, d});\n }\n vector<bool> station(N + N, false);\n for(int i : rep(M)) {\n string s = in();\n station[ID(s)] = true;\n }\n\n const int INF = 1e9;\n vector dist(N + N, vector(cap + 1, INF));\n heap_min<tuple<int,int,int>> q;\n q.push({dist[src][cap] = 0, src, cap});\n while(not q.empty()) {\n auto [ud, ui, uc] = q.top(); q.pop();\n if(dist[ui][uc] < ud) continue;\n for(auto [vi, d] : G[ui]) {\n if(0 <= uc - d) {\n int vc = station[vi] ? cap : uc - d;\n if(chmin(dist[vi][vc], ud + d)) q.push({ud + d, vi, vc});\n }\n }\n }\n\n int ans = INF;\n for(int c = 0; c <= cap; c++) chmin(ans, dist[dst][c]);\n return ans < INF ? ans : -1;\n}\n\nint main() {\n while(true) {\n int N = in(), M = in(), cap = in();\n if(make_tuple(N, M, cap) == make_tuple(0, 0, 0)) return 0;\n print(solve(N, M, cap));\n }\n}","accuracy":1,"time_ms":1100,"memory_kb":77356,"score_of_the_acc":-0.8904,"final_rank":12},{"submission_id":"aoj_1318_8475146","code_snippet":"// #define _GLIBCXX_DEBUG\n#pragma GCC optimize(\"O2,no-stack-protector,unroll-loops,fast-math\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\n#define each(e, v) for (auto& e : v)\n#define MM << \" \" <<\n#define pb push_back\n#define eb emplace_back\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\n int n = v.size();\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (v.empty()) cout << '\\n';\n}\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\ntemplate <typename T> bool chmax(T& x, const T& y) {\n return (x < y) ? (x = y, true) : false;\n}\ntemplate <typename T> bool chmin(T& x, const T& y) {\n return (x > y) ? (x = y, true) : false;\n}\ntemplate <class T>\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T> using maxheap = std::priority_queue<T>;\ntemplate <typename T> int lb(const vector<T>& v, T x) {\n return lower_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> int ub(const vector<T>& v, T x) {\n return upper_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> void rearrange(vector<T>& v) {\n sort(begin(v), end(v));\n v.erase(unique(begin(v), end(v)), end(v));\n}\n\n// __int128_t gcd(__int128_t a, __int128_t b) {\n// if (a == 0)\n// return b;\n// if (b == 0)\n// return a;\n// __int128_t cnt = a % b;\n// while (cnt != 0) {\n// a = b;\n// b = cnt;\n// cnt = a % b;\n// }\n// return b;\n// }\n\nstruct Union_Find_Tree {\n vector<int> data;\n const int n;\n int cnt;\n \n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\n \n int root(int x) {\n if (data[x] < 0) return x;\n return data[x] = root(data[x]);\n }\n \n int operator[](int i) { return root(i); }\n \n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (data[x] > data[y]) swap(x, y);\n data[x] += data[y], data[y] = x;\n cnt--;\n return true;\n }\n \n int size(int x) { return -data[root(x)]; }\n \n int count() { return cnt; };\n \n bool same(int x, int y) { return root(x) == root(y); }\n \n void clear() {\n cnt = n;\n fill(begin(data), end(data), -1);\n }\n};\n\ntemplate <int mod> struct Mod_Int {\n int x;\n\n Mod_Int() : x(0) {}\n\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n static int get_mod() { return mod; }\n\n Mod_Int& operator+=(const Mod_Int& p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator-=(const Mod_Int& p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator*=(const Mod_Int& p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n\n Mod_Int& operator/=(const Mod_Int& p) {\n *this *= p.inverse();\n return *this;\n }\n\n Mod_Int& operator++() { return *this += Mod_Int(1); }\n\n Mod_Int operator++(int) {\n Mod_Int tmp = *this;\n ++*this;\n return tmp;\n }\n\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\n\n Mod_Int operator--(int) {\n Mod_Int tmp = *this;\n --*this;\n return tmp;\n }\n\n Mod_Int operator-() const { return Mod_Int(-x); }\n\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\n\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\n\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\n\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\n\n bool operator==(const Mod_Int& p) const { return x == p.x; }\n\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\n\n Mod_Int inverse() const {\n assert(*this != Mod_Int(0));\n return pow(mod - 2);\n }\n\n Mod_Int pow(long long k) const {\n Mod_Int now = *this, ret = 1;\n for (; k > 0; k >>= 1, now *= now) {\n if (k & 1) ret *= now;\n }\n return ret;\n }\n\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\n return os << p.x;\n }\n\n friend istream& operator>>(istream& is, Mod_Int& p) {\n long long a;\n is >> a;\n p = Mod_Int<mod>(a);\n return is;\n }\n};\n\nll mpow2(ll x, ll n, ll mod) {\n ll ans = 1;\n x %= mod;\n while (n != 0) {\n if (n & 1) ans = ans * x % mod;\n x = x * x % mod;\n n = n >> 1;\n }\n ans %= mod;\n return ans;\n}\n\ntemplate <typename T> T modinv(T a, const T& m) {\n T b = m, u = 1, v = 0;\n while (b > 0) {\n T t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return u >= 0 ? u % m : (m - (-u) % m) % m;\n}\n\nll divide_int(ll a, ll b) {\n if (b < 0) a = -a, b = -b;\n return (a >= 0 ? a / b : (a - b + 1) / b);\n}\n\n// const int MOD = 1000000007;\nconst int MOD = 998244353;\nusing mint = Mod_Int<MOD>;\n\n// ----- library -------\n// ----- library -------\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (1) {\n int m, k, c;\n cin >> m >> k >> c;\n c *= 10;\n if (!m)\n break;\n string sa, sb;\n cin >> sa >> sb;\n vector<string> su(m), sv(m), ss(k);\n vector<int> d(m);\n rep(i, m) cin >> su[i] >> sv[i] >> d[i];\n rep(i, k) cin >> ss[i];\n vector<string> ls{sa, sb};\n rep(i, m) ls.eb(su[i]), ls.eb(sv[i]);\n rep(i, k) ls.eb(ss[i]);\n rearrange(ls);\n int a, b;\n vector<int> u(m), v(m), s(k);\n a = lb(ls, sa), b = lb(ls, sb);\n rep(i, m) u[i] = lb(ls, su[i]), v[i] = lb(ls, sv[i]);\n rep(i, k) s[i] = lb(ls, ss[i]);\n int n = sz(ls);\n vector<vector<pii>> g(n);\n vector<int> f(n, 0);\n rep(i, m) g[u[i]].eb(v[i], d[i]), g[v[i]].eb(u[i], d[i]);\n rep(i, k) f[s[i]] = 1;\n minheap<pair<int, pii>> que;\n vector<vector<int>> mi(n, vector<int>(c + 1, 1e9));\n mi[a][c] = 0, que.emplace(0, pair(a, c));\n while (sz(que)) {\n auto [nd, nij] = que.top();\n que.pop();\n auto [ni, nj] = nij;\n if (mi[ni][nj] != nd)\n continue;\n for (auto [nv, cost] : g[ni]) {\n if (nj < cost)\n continue;\n int rest = (f[nv] ? c : nj - cost);\n if (chmin(mi[nv][rest], nd + cost))\n que.emplace(nd + cost, pair(nv, rest));\n }\n }\n int ans = 1e9;\n rep(j, c + 1) chmin(ans, mi[b][j]);\n cout << (ans < 1e8 ? ans : -1) << '\\n';\n }\n}","accuracy":1,"time_ms":1010,"memory_kb":52020,"score_of_the_acc":-0.6227,"final_rank":10},{"submission_id":"aoj_1318_8390116","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nstruct edge {\n\tint to, cost;\n};\n\nstruct state {\n\tint pos, rem, cost;\n\tbool operator<(const state& s) const {\n\t\treturn cost > s.cost;\n\t}\n};\n\nint solve(int N, int M, int C, const string& src, const string& dst, const vector<string>& A, const vector<string>& B, const vector<int>& D, const vector<string>& S) {\n\tvector<string> cities;\n\tcities.push_back(src);\n\tcities.push_back(dst);\n\tcities.insert(cities.end(), A.begin(), A.end());\n\tcities.insert(cities.end(), B.begin(), B.end());\n\tcities.insert(cities.end(), S.begin(), S.end());\n\tsort(cities.begin(), cities.end());\n\tcities.erase(unique(cities.begin(), cities.end()), cities.end());\n\tint V = cities.size();\n\tvector<vector<edge> > G(V);\n\tfor (int i = 0; i < N; i++) {\n\t\tint va = lower_bound(cities.begin(), cities.end(), A[i]) - cities.begin();\n\t\tint vb = lower_bound(cities.begin(), cities.end(), B[i]) - cities.begin();\n\t\tG[va].push_back(edge{vb, D[i]});\n\t\tG[vb].push_back(edge{va, D[i]});\n\t}\n\tint vs = lower_bound(cities.begin(), cities.end(), src) - cities.begin();\n\tint vg = lower_bound(cities.begin(), cities.end(), dst) - cities.begin();\n\tvector<bool> station(V, false);\n\tfor (int i = 0; i < M; i++) {\n\t\tint pos = lower_bound(cities.begin(), cities.end(), S[i]) - cities.begin();\n\t\tstation[pos] = true;\n\t}\n\tvector<vector<int> > dist(V, vector<int>(C + 1, INF));\n\tpriority_queue<state> que;\n\tvector<vector<bool> > vis(V, vector<bool>(C + 1, false));\n\tdist[vs][C] = 0;\n\tque.push(state{vs, C, 0});\n\twhile (!que.empty()) {\n\t\tstate s = que.top();\n\t\tque.pop();\n\t\tif (!vis[s.pos][s.rem]) {\n\t\t\tvis[s.pos][s.rem] = true;\n\t\t\tfor (edge e : G[s.pos]) {\n\t\t\t\tint nrem = s.rem - e.cost;\n\t\t\t\tif (nrem >= 0) {\n\t\t\t\t\tif (station[e.to]) {\n\t\t\t\t\t\tnrem = C;\n\t\t\t\t\t}\n\t\t\t\t\tif (dist[e.to][nrem] > s.cost + e.cost) {\n\t\t\t\t\t\tdist[e.to][nrem] = s.cost + e.cost;\n\t\t\t\t\t\tque.push(state{e.to, nrem, dist[e.to][nrem]});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = *min_element(dist[vg].begin(), dist[vg].end());\n\treturn ans;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\twhile (true) {\n\t\tint N, M, C;\n\t\tcin >> N >> M >> C;\n\t\tif (N == 0 && M == 0 && C == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tC *= 10;\n\t\tstring src, dst;\n\t\tcin >> src >> dst;\n\t\tvector<string> A(N), B(N);\n\t\tvector<int> D(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> A[i] >> B[i] >> D[i];\n\t\t}\n\t\tvector<string> S(M);\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tcin >> S[i];\n\t\t}\n\t\tint ans = solve(N, M, C, src, dst, A, B, D, S);\n\t\tcout << (ans != INF ? ans : -1) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":660,"memory_kb":54632,"score_of_the_acc":-0.591,"final_rank":8},{"submission_id":"aoj_1318_6736548","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\ntemplate <typename T>\nstruct Edge {\n int from, to;\n T weight;\n Edge() = default;\n Edge(int to, T weight) : from(-1), to(to), weight(weight) {}\n Edge(int from, int to, T weight) : from(from), to(to), weight(weight) {}\n};\n\n\ntemplate <typename T>\nstd::vector<T> dijkstra(const std::vector<std::vector<Edge<T>>>& G, int s) {\n std::vector<T> dist(G.size(), std::numeric_limits<T>::max());\n dist[s] = 0;\n using P = std::pair<T, int>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> pq;\n pq.emplace(0, s);\n\n while (!pq.empty()) {\n T d;\n int v;\n std::tie(d, v) = pq.top();\n pq.pop();\n if (dist[v] < d) continue;\n for (auto& e : G[v]) {\n if (dist[e.to] > d + e.weight) {\n dist[e.to] = d + e.weight;\n pq.emplace(dist[e.to], e.to);\n }\n }\n }\n\n return dist;\n}\n\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int N, M, cap;\n cin >> N >> M >> cap;\n if (N == 0) break;\n string src, dest;\n cin >> src >> dest;\n vector<vector<Edge<int>>> G;\n map<string, int> idx;\n rep(_,0,N) {\n string su, sv;\n int d;\n cin >> su >> sv >> d;\n int u, v;\n if (idx.count(su)) u = idx[su];\n else {\n u = idx.size();\n idx[su] = u;\n G.emplace_back();\n }\n if (idx.count(sv)) v = idx[sv];\n else {\n v = idx.size();\n idx[sv] = v;\n G.emplace_back();\n }\n G[u].push_back({v, d});\n G[v].push_back({u, d});\n }\n int V = G.size();\n if (!idx.count(src) || !idx.count(dest)) {\n cout << -1 << endl;\n continue;\n }\n vector<int> stations;\n rep(i,0,M) {\n string s;\n cin >> s;\n stations.push_back(idx[s]);\n }\n stations.push_back(idx[src]);\n stations.push_back(idx[dest]);\n vector<vector<Edge<int>>> G2(V);\n for (int s : stations) {\n auto dist = dijkstra(G, s);\n for (int t : stations) {\n if (dist[t] <= cap * 10) G2[s].push_back({t, dist[t]});\n }\n }\n auto dist = dijkstra(G2, idx[src]);\n int ans = dist[idx[dest]];\n cout << (ans < 1e9 ? ans : -1) << endl;\n }\n}","accuracy":1,"time_ms":280,"memory_kb":5496,"score_of_the_acc":-0.038,"final_rank":3},{"submission_id":"aoj_1318_6722793","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N, M, cap;\n while (cin >> N >> M >> cap, !(N == 0 and M == 0 and cap == 0)) {\n V<string> SS;\n string src, dst;\n cin >> src >> dst;\n SS.push_back(src);\n SS.push_back(dst);\n V<string> c1(N), c2(N);\n V<int> d(N);\n rep(i, N) {\n cin >> c1[i] >> c2[i] >> d[i];\n SS.push_back(c1[i]);\n SS.push_back(c2[i]);\n }\n V<string> S(M);\n rep(i, M) {\n cin >> S[i];\n SS.push_back(S[i]);\n }\n sort(SS.begin(), SS.end());\n SS.erase(unique(SS.begin(), SS.end()), SS.end());\n int NV = SS.size();\n V<V<pair<int, ll>>> G(NV);\n rep(i, N) {\n int a = lower_bound(SS.begin(), SS.end(), c1[i]) - SS.begin();\n int b = lower_bound(SS.begin(), SS.end(), c2[i]) - SS.begin();\n G[a].push_back({b, d[i]});\n G[b].push_back({a, d[i]});\n }\n V<int> gas(NV, 0);\n rep(i, M) {\n int a = lower_bound(SS.begin(), SS.end(), S[i]) - SS.begin();\n gas[a] = 1;\n }\n const ll INF = 1LL << 60;\n cap *= 10;\n V<V<ll>> dist(NV, V<ll>(cap + 1, INF));\n int s = lower_bound(SS.begin(), SS.end(), src) - SS.begin();\n int g = lower_bound(SS.begin(), SS.end(), dst) - SS.begin();\n dist[s][cap] = 0;\n priority_queue<tuple<ll, int, int>> que;\n que.push({0, s, cap});\n bool ok = false;\n while (!que.empty()) {\n auto [d, cv, ccap] = que.top();\n que.pop();\n d = -d;\n if (cv == g) {\n cout << d << '\\n';\n ok = true;\n break;\n }\n if (dist[cv][ccap] != d) continue;\n if (gas[cv] and ccap < cap) {\n dist[cv][cap] = d;\n que.push({-d, cv, cap});\n }\n for (auto [nex, cost] : G[cv]) {\n if (ccap >= cost) {\n if (dist[nex][ccap - cost] > d + cost) {\n dist[nex][ccap - cost] = d + cost;\n que.push({-(d + cost), nex, ccap - cost});\n }\n }\n }\n }\n if (!ok) cout << -1 << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":1430,"memory_kb":97808,"score_of_the_acc":-1.149,"final_rank":17},{"submission_id":"aoj_1318_6673027","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n using type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n using type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[value % 10];\n value /= 10;\n } while (value != 0);\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n __int128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n if (s[0] == '-') ret = -ret;\n return ret;\n}\n__uint128_t parse_u128(std::string& s) {\n __uint128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n std::string s;\n in >> s;\n v = parse_i128(s);\n return in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n std::string s;\n in >> s;\n v = parse_u128(s);\n return in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n (std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n std::string res;\n if (bit_num >= 0) {\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n } else {\n for (; val; val >>= 1) res += '0' + (val & 1);\n std::reverse(res.begin(), res.end());\n }\n return res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n std::vector<T> res;\n for (; val; val /= base) res.push_back(val % base);\n if (res.empty()) res.push_back(T{ 0 });\n return res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n auto res = digits_low_to_high(val, base);\n std::reverse(res.begin(), res.end());\n return res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n std::ostringstream ss;\n for (auto it = v.begin(); it != v.end();) {\n ss << *it;\n if (++it != v.end()) ss << sep;\n }\n ss << end;\n return ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_{};\n\n// ! code from here\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace suisen {\ntemplate <typename T>\nclass CoordinateCompressorBuilder {\n public:\n struct Compressor {\n public:\n static constexpr int absent = -1;\n\n // default constructor\n Compressor() : _xs(std::vector<T>{}) {}\n // Construct from strictly sorted vector\n Compressor(const std::vector<T> &xs) : _xs(xs) {\n assert(is_strictly_sorted(xs));\n }\n\n // Return the number of distinct keys.\n int size() const {\n return _xs.size();\n }\n // Check if the element is registered.\n bool has_key(const T &e) const {\n return std::binary_search(_xs.begin(), _xs.end(), e);\n }\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\n int comp(const T &e, int default_value = absent) const {\n const int res = min_geq_index(e);\n return res != size() and _xs[res] == e ? res : default_value;\n }\n // Restore the element from the index.\n T decomp(const int compressed_index) const {\n return _xs[compressed_index];\n }\n // Compress the element. Equivalent to call `comp(e)`\n int operator[](const T &e) const {\n return comp(e);\n }\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\n T min_gt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\n T min_geq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\n T max_lt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\n T max_leq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\n int min_gt_index(const T &e) const {\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\n int min_geq_index(const T &e) const {\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\n int max_lt_index(const T &e) const {\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\n }\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\n int max_leq_index(const T &e) const {\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\n }\n private:\n std::vector<T> _xs;\n static bool is_strictly_sorted(const std::vector<T> &v) {\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\n }\n };\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n CoordinateCompressorBuilder(const int n, Gen generator) {\n reserve(n);\n for (int i = 0; i < n; ++i) push(generator(i));\n }\n // Attempt to preallocate enough memory for specified number of elements.\n void reserve(int n) {\n _xs.reserve(n);\n }\n // Add data.\n void push(const T &first) {\n _xs.push_back(first);\n }\n // Add data.\n void push(T &&first) {\n _xs.push_back(std::move(first));\n }\n // Add data in the range of [first, last). \n template <typename Iterator>\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\n }\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\n template <typename Iterable>\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\n push(iterable.begin(), iterable.end());\n }\n // Add data.\n template <typename ...Args>\n void emplace(Args &&...args) {\n _xs.emplace_back(std::forward<Args>(args)...);\n }\n // Build compressor.\n auto build() {\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\n return Compressor {_xs};\n }\n // Build compressor from vector.\n static auto build(const std::vector<T> &xs) {\n return CoordinateCompressorBuilder(xs).build();\n }\n // Build compressor from vector.\n static auto build(std::vector<T> &&xs) {\n return CoordinateCompressorBuilder(std::move(xs)).build();\n }\n // Build compressor from generator.\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n static auto build(const int n, Gen generator) {\n return CoordinateCompressorBuilder<T>(n, generator).build();\n }\n private:\n std::vector<T> _xs;\n};\n\n} // namespace suisen\n\nlong long solve(int n, int c, int s, int t, vector<tuple<int, int, int>> edges, vector<int> st) {\n vector<int8_t> gs(n, false);\n for (auto e : st) {\n gs[e] = true;\n }\n\n vector<vector<pair<int, int>>> g(n);\n for (auto [u, v, w] : edges) {\n g[u].emplace_back(v, w);\n g[v].emplace_back(u, w);\n }\n\n vector d(n, vector<long long>(c + 1, numeric_limits<long long>::max()));\n pq_greater<tuple<long long, int, int>> pq;\n pq.emplace(d[s][c] = 0, s, c);\n while (pq.size()) {\n auto [dvx, v, x] = pq.top();\n pq.pop();\n if (dvx != d[v][x]) continue;\n for (auto [nv, w] : g[v]) if (w <= x) {\n int nx = gs[nv] ? c : x - w;\n if (chmin(d[nv][nx], dvx + w)) {\n pq.emplace(d[nv][nx], nv, nx);\n }\n }\n }\n\n long long ans = *min_element(all(d[t]));\n if (ans == numeric_limits<long long>::max()) return -1;\n return ans;\n}\n\nint main() {\n while (true) {\n input(int, n, m, c);\n if (n == 0 and m == 0 and c == 0) break;;\n\n c *= 10;\n input(string, s, t);\n vector<tuple<string, string, int>> edges(n);\n read(edges);\n vector<string> st(m);\n read(st);\n\n CoordinateCompressorBuilder<string> builder;\n builder.push(s);\n builder.push(t);\n\n for (auto& [u, v, w] : edges) {\n builder.push(u);\n builder.push(v);\n }\n for (auto& x : st) {\n builder.push(x);\n }\n auto cmp = builder.build();\n\n int si = cmp[s], ti = cmp[t];\n vector<tuple<int, int, int>> es;\n for (auto& [u, v, w] : edges) {\n es.emplace_back(cmp[u], cmp[v], w);\n }\n vector<int> sts;\n for (auto& x : st) {\n sts.push_back(cmp[x]);\n }\n print(solve(cmp.size(), c, si, ti, es, sts));\n }\n\n return 0;\n}","accuracy":1,"time_ms":1200,"memory_kb":98244,"score_of_the_acc":-1.1154,"final_rank":15},{"submission_id":"aoj_1318_6605348","code_snippet":"#include <stdio.h>\n#include <string>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#define INF 1012345678\nusing namespace std;\n\nchar buff1[32], buff2[32];\nunordered_map<string, vector<pair<string, int>>> ed;\nvector<pair<int, int>> edn[6144], edn2[6144];\nunordered_map<string, int> nodenm;\nint distn[6144], visn[6144];\nunordered_set<string> city, lpg;\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;\n\nvoid dijk(int src, int n, int m, int cap) {\n int node, d;\n for (int i = 1; i <= n; i++) {\n distn[i] = cap + 1;\n visn[i] = 0;\n }\n \n while (pq.size()) pq.pop();\n pq.push({ 0, src });\n while (pq.size()) {\n node = pq.top().second;\n d = pq.top().first;\n pq.pop();\n if (visn[node]) continue;\n else visn[node] = 1;\n for (auto& i : edn[node]) {\n if (d + i.second < distn[i.first]) {\n distn[i.first] = d + i.second;\n pq.push({ distn[i.first], i.first });\n }\n }\n }\n\n for (int i = 1; i <= m; i++) {\n if (distn[i] <= cap) {\n edn2[src].push_back({ i, distn[i] });\n }\n }\n}\n\nint dijk2(int src, int dest, int n) {\n int node;\n int d;\n for (int i = 1; i <= n; i++) {\n distn[i] = INF;\n visn[i] = 0;\n }\n\n while (pq.size()) pq.pop();\n pq.push({ 0, src });\n while (pq.size()) {\n node = pq.top().second;\n d = pq.top().first;\n pq.pop();\n if (node == dest) return d;\n if (visn[node]) continue;\n else visn[node] = 1;\n for (auto& i : edn2[node]) {\n if (d + i.second < distn[i.first]) {\n distn[i.first] = d + i.second;\n pq.push({ distn[i.first], i.first });\n }\n }\n }\n\n return -1;\n}\n\nint main(void) {\n string src, dest;\n int n, m, cap, x;\n while (1) {\n scanf(\"%d %d %d\", &n, &m, &cap);\n if (n == 0 && m == 0 && cap == 0) break;\n else cap *= 10;\n scanf(\"%s %s\", buff1, buff2);\n src = buff1, dest = buff2;\n for (int i = 0; i < n; i++) {\n scanf(\"%s %s %d\", buff1, buff2, &x);\n if (ed.find(buff1) == ed.end()) ed.insert({ buff1, {{buff2, x}} });\n else ed[buff1].push_back({ buff2, x });\n if (ed.find(buff2) == ed.end()) ed.insert({ buff2, {{buff1, x}} });\n else ed[buff2].push_back({ buff1, x });\n if (city.find(buff1) == city.end()) city.insert(buff1);\n if (city.find(buff2) == city.end()) city.insert(buff2);\n }\n for (int i = 0; i < m; i++) {\n scanf(\"%s\", buff1);\n lpg.insert(buff1);\n }\n lpg.insert(src);\n lpg.insert(dest);\n nodenm.insert({ src, 1 });\n nodenm.insert({ dest, 2 });\n m = 2;\n for (auto& i : lpg) {\n if (i == src || i == dest) continue;\n nodenm.insert({ i, ++m });\n }\n n = m;\n for (auto& i : city) {\n if (lpg.find(i) != lpg.end()) continue;\n nodenm.insert({ i, ++n });\n }\n for (auto& i : ed) {\n for (auto& j : i.second) {\n edn[nodenm[i.first]].push_back({nodenm[j.first], j.second});\n }\n }\n\n\n for (int i = 1; i <= m; i++) {\n dijk(i, n, m, cap);\n }\n printf(\"%d\\n\", dijk2(1, 2, m));\n\n\n city.clear();\n lpg.clear();\n ed.clear();\n for (int i = 1; i <= n; i++) {\n edn[i].clear();\n edn2[i].clear();\n }\n nodenm.clear();\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":6128,"score_of_the_acc":-0.0294,"final_rank":2},{"submission_id":"aoj_1318_6605184","code_snippet":"#include <stdio.h>\n#include <string>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#define INF 1012345678\nusing namespace std;\n\nchar buff1[32], buff2[32];\nunordered_map<string, vector<pair<string, int>>> ed, ed2;\nunordered_map<string, int> dist;\nunordered_set<string> city, lpg, vis;\npriority_queue<pair<int, string>, vector<pair<int, string>>, greater<>> pq;\n\nvoid dijk(string src, string node, int cap) {\n int d;\n dist.clear();\n vis.clear();\n for (auto& i : city) dist.insert({ i, cap + 1 });\n pq.push({ 0, src });\n while (pq.size()) {\n node = pq.top().second;\n d = pq.top().first;\n pq.pop();\n if (vis.find(node) != vis.end()) continue;\n else vis.insert(node);\n for (auto& i : ed[node]) {\n if (d + i.second < dist[i.first]) {\n dist[i.first] = d + i.second;\n pq.push({ dist[i.first], i.first });\n }\n }\n }\n\n for (auto& i : dist) {\n if (i.second <= cap && lpg.find(i.first) != lpg.end()) {\n if (ed2.find(src) == ed2.end()) ed2.insert({ src, {{i.first, i.second}} });\n else ed2[src].push_back({ i.first, i.second });\n }\n }\n}\n\nint dijk2(string src, string dest) {\n string node;\n int d;\n dist.clear();\n vis.clear();\n for (auto& i : lpg) dist.insert({ i, INF });\n pq.push({ 0, src });\n while (pq.size()) {\n node = pq.top().second;\n d = pq.top().first;\n pq.pop();\n if (node == dest) return d;\n if (vis.find(node) != vis.end()) continue;\n else vis.insert(node);\n for (auto& i : ed2[node]) {\n if (d + i.second < dist[i.first]) {\n dist[i.first] = d + i.second;\n pq.push({ dist[i.first], i.first });\n }\n }\n }\n\n return -1;\n}\n\nint main(void) {\n string src, dest;\n int n, m, cap, x;\n while (1) {\n scanf(\"%d %d %d\", &n, &m, &cap);\n if (n == 0 && m == 0 && cap == 0) break;\n else cap *= 10;\n scanf(\"%s %s\", buff1, buff2);\n src = buff1, dest = buff2;\n for (int i = 0; i < n; i++) {\n scanf(\"%s %s %d\", buff1, buff2, &x);\n if (ed.find(buff1) == ed.end()) ed.insert({ buff1, {{buff2, x}} });\n else ed[buff1].push_back({ buff2, x });\n if (ed.find(buff2) == ed.end()) ed.insert({ buff2, {{buff1, x}} });\n else ed[buff2].push_back({ buff1, x });\n if (city.find(buff1) == city.end()) city.insert(buff1);\n if (city.find(buff2) == city.end()) city.insert(buff2);\n }\n for (int i = 0; i < m; i++) {\n scanf(\"%s\", buff1);\n lpg.insert(buff1);\n }\n lpg.insert(src);\n lpg.insert(dest);\n for (auto& i : lpg) {\n dijk(i, i, cap);\n }\n printf(\"%d\\n\", dijk2(src, dest));\n\n\n city.clear();\n lpg.clear();\n dist.clear();\n vis.clear();\n ed.clear();\n ed2.clear();\n }\n return 0;\n}","accuracy":1,"time_ms":1790,"memory_kb":9008,"score_of_the_acc":-0.3222,"final_rank":7},{"submission_id":"aoj_1318_6176860","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int inf = 1 << 30;\n\nstruct abc{\n string a;\n string b;\n int c;\n};\n\nstruct nc{\n int npos;\n int c;\n};\n\nstruct HQ{\n int d;\n int pos;\n int cap;\n \n bool operator<(const HQ& right) const{\n return d > right.d;\n }\n};\n\nint main(void){\n int n, m, cap;\n while(1){\n cin >> n >> m >> cap;\n if(n == 0) break;\n string s, g;\n cin >> s >> g;\n set<string> city;\n city.insert(s);\n city.insert(g);\n vector<abc> E(n);\n for(int i = 0; i < n; i++){\n cin >> E[i].a >> E[i].b >> E[i].c;\n city.insert(E[i].a);\n city.insert(E[i].b);\n }\n map<string, int> mp;\n int x = 0;\n for(auto c: city){\n mp[c] = x;\n x++;\n }\n set<int> se;\n for(int i = 0; i < m; i++){\n string tmp;\n cin >> tmp;\n se.insert(mp[tmp]);\n }\n int ss = mp[s];\n int gg = mp[g];\n se.insert(gg);\n int l = city.size();\n vector<vector<nc>> edges(l, vector<nc>());\n for(auto tmp: E){\n edges[mp[tmp.a]].push_back({mp[tmp.b], tmp.c});\n edges[mp[tmp.b]].push_back({mp[tmp.a], tmp.c});\n }\n cap *= 10;\n vector<vector<int>> dist(l, vector<int>(cap + 1, inf));\n dist[ss][cap] = 0;\n priority_queue<HQ> hq;\n hq.push({0, ss, cap});\n int d, pos, cc, npos, c, nc, nd;\n while(!hq.empty()){\n auto tmp = hq.top();\n d = tmp.d;\n pos = tmp.pos;\n cc = tmp.cap;\n hq.pop();\n if(se.count(pos) && cc != cap){\n if(dist[pos][cap] > d){\n dist[pos][cap] = d;\n hq.push({d, pos, cap});\n }\n continue;\n }\n \n for(auto tmp2: edges[pos]){\n npos = tmp2.npos;\n c = tmp2.c;\n if(c > cc) continue;\n nc = cc - c;\n nd = d + c;\n if(dist[npos][nc] > nd){\n dist[npos][nc] = nd;\n hq.push({nd, npos, nc});\n }\n }\n }\n if(dist[gg][cap] == inf) cout << \"-1\\n\";\n else cout << dist[gg][cap] << \"\\n\";\n }\n \n}","accuracy":1,"time_ms":960,"memory_kb":52472,"score_of_the_acc":-0.619,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_1318_10849725\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst int maxn = 6000;\\nconst int maxm = 6090;\\nconst int inf = ~0u >> 2;\\n\\nstruct Edge{\\n\\tint v, w;\\n\\tEdge() {}\\n\\tEdge(int v, int w) {\\n\\t\\tthis->v = v;\\tthis->w = w;\\n\\t}\\n};\\n\\nint n, m, gas, ncnt;\\nvector<int> gast;\\nvector<Edge> g1[maxn], g2[maxm];\\nmap<string, int> mp;\\n\\nvoid addNode(string s)\\n{\\n\\tif(!mp[s])\\tmp[s] = ++ncnt;\\n}\\n\\nvoid addEdge(int u, int v, int w)\\n{\\n\\tg1[u].push_back(Edge(v, w));\\n\\tg1[v].push_back(Edge(u, w));\\n}\\n\\nvoid spfa(int x, int dis[], vector<Edge> g[])\\n{\\n\\tqueue<int> q;\\n\\tbool inqueue[maxn];\\n\\tmemset(inqueue, 0, sizeof(inqueue));\\n\\tinqueue[x] = 1;\\tq.push(x); dis[x] = 0;\\n\\twhile(!q.empty()) {\\n\\t\\tint tmp = q.front();\\tq.pop();\\tinqueue[tmp] = false;\\n\\t\\tfor(int i = 0; i < g[tmp].size(); i++) {\\n\\t\\t\\tint v = g[tmp][i].v, w = g[tmp][i].w;\\n\\t\\t\\tif(dis[tmp]+w < dis[v]) {\\n\\t\\t\\t\\tdis[v] = dis[tmp]+w;\\n\\t\\t\\t\\tif(!inqueue[v]) {\\n\\t\\t\\t\\t\\tq.push(v);\\n\\t\\t\\t\\t\\tinqueue[v] = true;;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\t\\n\\t\\t}\\n\\t}\\t\\n}\\n\\nint main()\\n{\\n#ifdef LOCAL\\n\\tfreopen(\\\"D.in\\\", \\\"r\\\", stdin);\\n#endif\\n\\twhile(scanf(\\\"%d%d%d\\\", &m, &n, &gas) != EOF) {\\n\\t\\tif(m == 0 && n == 0)\\tbreak;\\n\\t\\tncnt = 0;\\n\\t\\tchar stmp[maxm], estmp[maxm]; \\n\\t\\tgast.clear();\\n\\t\\tmp.clear();\\n\\t\\tfor(int i = 0; i < maxn; i++)\\tg1[i].clear();\\n\\t\\tfor(int i = 0; i < maxm; i++)\\tg2[i].clear();\\n\\t\\tscanf(\\\"%s%s\\\", stmp, estmp);\\n\\t\\taddNode(stmp);\\taddNode(estmp);\\n\\t\\tfor(int i = 0; i < m; i++) {\\n\\t\\t\\tint w;\\n\\t\\t\\tscanf(\\\"%s%s%d\\\", stmp, estmp, &w);\\n\\t\\t\\taddNode(stmp);\\taddNode(estmp);\\n\\t\\t\\taddEdge(mp[stmp], mp[estmp], w);\\n\\t\\t}\\n\\t\\tgast.push_back(1);\\tgast.push_back(2);\\n\\t\\tfor(int i = 1; i <= n; i++) {\\n\\t\\t//if one vertex is unique, ignore it\\n\\t\\t\\tscanf(\\\"%s\\\", stmp);\\n\\t\\t\\tif(mp[stmp])\\tgast.push_back(mp[stmp]);\\n\\t\\t}\\n\\t\\t//calc single-point shortest path for every gas station and set-up point\\n\\t\\t//rebuild a graph with vertices including stations and beginning and end point\\n\\t\\tfor(int i = 0; i < gast.size(); i++) {\\n\\t\\t\\tint x = gast[i];\\n\\t\\t\\tint dis[maxn];\\n\\t\\t\\tfill(dis, dis+ncnt+1, inf);\\n\\t\\t\\tspfa(x, dis, g1);\\n\\t\\t\\tfor(int j = 0; j < gast.size(); j++)\\n\\t\\t\\t\\tif(dis[gast[j]] <= gas*10) \\tg2[i].push_back(Edge(j, dis[gast[j]]));\\n\\t\\t}\\n\\t\\tint dis[maxm];\\n\\t\\tfill(dis, dis+gast.size()+1, inf);\\n\\t\\tspfa(0, dis, g2);\\t\\n\\t\\tprintf(\\\"%d\\\\n\\\", dis[1] != inf ? dis[1] : -1);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 5488,\n \"score_of_the_acc\": -0.0165,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1318_10730467\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<stack>\\n#include<cmath>\\n#include<vector>\\n#define inf 0x3f3f3f3f\\n#define Inf 0x3FFFFFFFFFFFFFFFLL\\n#define eps 1e-9\\n#define pi acos(-1.0)\\nusing namespace std;\\ntypedef long long ll;\\nconst int maxn=3000+10;\\nmap<string,int>mp;\\nstruct Edge\\n{\\n int v,w,next;\\n Edge(){}\\n Edge(int v,int w,int next):v(v),w(w),next(next){}\\n}edges[maxn<<2];\\nint head[maxn<<1],d[maxn<<1][2010],nEdge;\\nbool flag[maxn<<1],inq[maxn<<1][2010];\\nvoid AddEdges(int u,int v,int w)\\n{\\n edges[++nEdge]=Edge(v,w,head[u]);\\n head[u]=nEdge;\\n edges[++nEdge]=Edge(u,w,head[v]);\\n head[v]=nEdge;\\n}\\nint spfa(int s,int t,int cap)\\n{\\n memset(d,0x3f,sizeof(d));\\n memset(inq,0,sizeof(inq));\\n cap*=10;\\n d[s][cap]=0;\\n queue<pair<int,int> >q;\\n q.push(make_pair(s,cap));\\n pair<int,int>pii;\\n int u,st;\\n while(!q.empty())\\n {\\n pii=q.front();q.pop();\\n u=pii.first;st=pii.second;\\n inq[u][st]=false;\\n for(int k=head[u];k!=-1;k=edges[k].next)\\n {\\n int v=edges[k].v;\\n int cost=edges[k].w;\\n if(st>=cost&&d[v][st-cost]>d[u][st]+cost)\\n {\\n d[v][st-cost]=d[u][st]+cost;\\n if(!inq[v][st-cost]) {inq[v][st-cost]=true;q.push(make_pair(v,st-cost));}\\n }\\n if(flag[u])\\n {\\n if(cap>=cost&&d[v][cap-cost]>d[u][st]+cost)\\n {\\n d[v][cap-cost]=d[u][st]+cost;\\n if(!inq[v][cap-cost]) {inq[v][cap-cost]=true;q.push(make_pair(v,cap-cost));}\\n }\\n }\\n }\\n }\\n int res=inf;\\n for(int i=0;i<=cap;++i)\\n res=min(res,d[t][i]);\\n return res==inf?-1:res;\\n}\\nint main()\\n{\\n //freopen(\\\"in.txt\\\",\\\"r\\\",stdin);\\n //freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n char str[30],str2[30];\\n int n,m,s,t,cap,N;\\n while(~scanf(\\\"%d%d%d\\\",&n,&m,&cap))\\n {\\n if(n==0&&m==0&&cap==0) break;\\n mp.clear();\\n N=0;\\n scanf(\\\"%s\\\",str);\\n s=mp[(string)str]=++N;\\n scanf(\\\"%s\\\",str);\\n t=mp[(string)str]=++N;\\n memset(head,0xff,sizeof(head));\\n nEdge=-1;\\n memset(flag,0,sizeof(flag));\\n int u,v,w;\\n for(int i=0;i<n;++i)\\n {\\n scanf(\\\"%s%s%d\\\",str,str2,&w);\\n if(mp[(string)str]) u=mp[(string)str];\\n else u=mp[(string)str]=++N;\\n if(mp[(string)str2]) v=mp[(string)str2];\\n else v=mp[(string)str2]=++N;\\n AddEdges(u,v,w);\\n }\\n for(int i=0;i<m;++i)\\n {\\n scanf(\\\"%s\\\",str);\\n flag[mp[(string)str]]=true;\\n }\\n int ans=spfa(s,t,cap);\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 75740,\n \"score_of_the_acc\": -0.7621,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1318_10730466\",\n \"code_snippet\": \"#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <cmath>\\n#include <string>\\n#include <cctype>\\n#include <vector>\\n#include <cstdio>\\n#include <climits>\\n#include <cstdlib>\\n#include <cstring>\\n#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\ntypedef long long LL;\\n\\n\\nconst int oo=INT_MAX>>1;\\nstruct node{\\n\\tint u,x,w;\\n\\tnode(int _u,int _x,int _w){\\n\\t\\tu=_u; x=_x; w=_w;\\n\\t}\\n\\tbool operator<(const node &t)const{\\n\\t\\treturn w>t.w;\\n\\t}\\n};\\npriority_queue<node> Q;\\nvector< pair<int,int> > a[13000];\\nint dis[6007][2007],N;\\nbool vis[6007][2007],b[6100];\\nmap<string,int> mm;\\n\\nint get(string s){\\n\\tif (mm[s]) return mm[s];\\n\\tmm[s]=++N; a[N].clear();\\n\\treturn N;\\n}\\n\\nint main(){\\n\\tint M,c,lim,u,v,d,i,j;\\n\\twhile (scanf(\\\"%d%d%d\\\",&M,&c,&lim), M || c || lim){\\n\\t\\tlim*=10;\\n\\t\\tchar s[100],t[100];\\n\\t\\tmm.clear(); N=0;\\n\\t\\tscanf(\\\"%s%s\\\",s,t); get(s); get(t);\\n\\t\\twhile (M--){\\n\\t\\t\\tscanf(\\\"%s%s%d\\\",s,t,&d);\\n\\t\\t\\tu=get(s); v=get(t);\\n\\t\\t\\ta[u].push_back(make_pair(v,d)); a[v].push_back(make_pair(u,d));\\n\\t\\t}\\n\\t\\tfor (i=1;i<=N;i++){\\n\\t\\t\\tb[i]=0;\\n\\t\\t\\tfor (j=0;j<=lim;j++){\\n\\t\\t\\t\\tdis[i][j]=oo; vis[i][j]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (c--){\\n\\t\\t\\tscanf(\\\"%s\\\",s); b[get(s)]=1;\\n\\t\\t}\\n\\t\\tdis[1][lim]=0;\\n\\t\\tQ.push(node(1,lim,0));\\n\\t\\tint x,y;\\n\\t\\twhile (!Q.empty()){\\n\\t\\t\\tu=Q.top().u; x=Q.top().x; Q.pop();\\n\\t\\t\\tif (vis[u][x]) continue;\\n\\t\\t\\tvis[u][x]=1;\\n\\t\\t\\tfor (vector< pair<int,int> >::iterator ii=a[u].begin();ii!=a[u].end();ii++){\\n\\t\\t\\t\\tv=ii->first; d=ii->second;\\n\\t\\t\\t\\tif (d>x) continue;\\n\\t\\t\\t\\ty=b[v]?lim:x-d;\\n\\t\\t\\t\\tif (dis[u][x]+d<dis[v][y]){\\n\\t\\t\\t\\t\\tdis[v][y]=dis[u][x]+d;\\n\\t\\t\\t\\t\\tQ.push(node(v,y,dis[v][y]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans=oo;\\n\\t\\tfor (i=0;i<=lim;i++){\\n\\t\\t\\tans=min(ans,dis[2][i]);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans==oo?-1:ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 88728,\n \"score_of_the_acc\": -0.923,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1318_10730415\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <vector>\\n#include <string>\\n#include <stack>\\n#include <bitset>\\n#define INF 0x3f3f3f3f\\n#define eps 1e-8\\n#define FI first\\n#define SE second\\nusing namespace std;\\ntypedef long long LL;\\nconst int maxn=6005;\\nint n,m,C;\\nmap <string,int> mp;\\nmap <string,int>::iterator it;\\nint head[maxn];\\nstruct Edge\\n{\\n int next,to,len;\\n}ed[maxn*2];\\nint ecnt,label;\\n\\ninline void init()\\n{\\n ecnt=label=0;\\n memset(head,-1,sizeof(head));\\n mp.clear();\\n}\\n\\ninline void addedge(int u,int v,int l)\\n{\\n ed[ecnt].next=head[u];\\n ed[ecnt].to=v;\\n ed[ecnt].len=l;\\n head[u]=ecnt++;\\n}\\n\\ninline int add(char *s)\\n{\\n it=mp.find(s);\\n if(it!=mp.end()) return it->second;\\n mp.insert(make_pair(s,label));\\n return label++;\\n}\\n\\nchar s1[25],s2[25];\\nstruct Node\\n{\\n int u,c,dis;\\n inline Node() {}\\n inline Node(int _u,int _c,int _dis)\\n {\\n u=_u; c=_c; dis=_dis;\\n }\\n bool operator <(const Node &a)const\\n {\\n return dis>a.dis;\\n }\\n};\\npriority_queue <Node> Q;\\n\\nint dp[6005][2005];\\nbool done[6005][2005];\\nbool LPG[6005];\\ninline int Dijkstra(int S,int T)\\n{\\n while(!Q.empty()) Q.pop();\\n C*=10;\\n for(int i=0;i<label;++i) for(int j=0;j<=C;++j)\\n {\\n dp[i][j]=INF;\\n done[i][j]=0;\\n }\\n dp[S][C]=0;\\n Q.push(Node(S,C,0));\\n Node t;\\n while(!Q.empty())\\n {\\n t=Q.top(); Q.pop();\\n if(t.u==T) return t.dis;\\n if(done[t.u][t.c]) continue;\\n for(int e=head[t.u];~e;e=ed[e].next)\\n {\\n int v=ed[e].to;\\n if(t.c<ed[e].len) continue;\\n int nc=t.c-ed[e].len;\\n if(LPG[v]) nc=C;\\n if(dp[v][nc]>t.dis+ed[e].len)\\n {\\n dp[v][nc]=t.dis+ed[e].len;\\n Q.push(Node(v,nc,dp[v][nc]));\\n }\\n }\\n }\\n return -1;\\n}\\n\\nint main()\\n{\\n while(scanf(\\\"%d%d%d\\\",&n,&m,&C)&&n)\\n {\\n init();\\n scanf(\\\"%s%s\\\",s1,s2);\\n int S=add(s1),T=add(s2);\\n for(int i=0;i<n;++i)\\n {\\n int d;\\n scanf(\\\"%s%s%d\\\",s1,s2,&d);\\n if(d>C*10) continue;\\n int u=add(s1),v=add(s2);\\n addedge(u,v,d);\\n addedge(v,u,d);\\n }\\n memset(LPG,0,sizeof(LPG));\\n for(int i=0;i<m;++i)\\n {\\n scanf(\\\"%s\\\",s1);\\n LPG[add(s1)]=1;\\n }\\n printf(\\\"%d\\\\n\\\",Dijkstra(S,T));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 87140,\n \"score_of_the_acc\": -0.8956,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1318_10584241\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst long long INF = 4e18;\\n\\nint main() {\\n while (true) {\\n int N, M, cap;\\n if (!(cin >> N >> M >> cap) || (N == 0 && M == 0 && cap == 0)) break;\\n string srcName, dstName; cin >> srcName >> dstName;\\n\\n unordered_map<string, int> id;\\n vector<vector<pair<int,int>>> g;\\n\\n auto getID = [&](const string& s) -> int {\\n auto it = id.find(s);\\n if (it != id.end()) return it->second;\\n int idx = id.size();\\n id[s] = idx;\\n g.emplace_back();\\n return idx;\\n };\\n\\n for (int i = 0; i < N; ++i) {\\n string a, b; int d; cin >> a >> b >> d;\\n int u = getID(a), v = getID(b);\\n g[u].push_back({v,d});\\n g[v].push_back({u,d});\\n }\\n\\n vector<int> station;\\n station.reserve(M+2);\\n station.push_back(getID(srcName));\\n int dstID = getID(dstName);\\n if (dstID != station[0]) station.push_back(dstID);\\n\\n for (int i = 0; i < M; ++i) {\\n string s; cin >> s;\\n int idS = getID(s);\\n if (idS != station[0] && idS != dstID) station.push_back(idS);\\n }\\n\\n int R = cap * 10;\\n int K = station.size();\\n vector<vector<long long>> meta(K, vector<long long>(K, INF));\\n\\n auto dijkstra_cut = [&](int start){\\n vector<long long> dist(g.size(), INF);\\n using P=pair<long long,int>; priority_queue<P, vector<P>, greater<P>> pq;\\n dist[start]=0; pq.push({0,start});\\n while(!pq.empty()){\\n auto [d,u]=pq.top(); pq.pop();\\n if(d!=dist[u] || d>R) continue;\\n for(auto [v,w]:g[u]){\\n if(d+w<dist[v] && d+w<=R){\\n dist[v]=d+w; pq.push({dist[v],v});\\n }\\n }\\n }\\n return dist;\\n };\\n\\n vector<vector<long long>> allDist;\\n for(int i=0;i<K;++i) allDist.push_back(dijkstra_cut(station[i]));\\n\\n for(int i=0;i<K;++i)\\n for(int j=0;j<K;++j)\\n if(allDist[i][station[j]]<=R)\\n meta[i][j]=allDist[i][station[j]];\\n\\n vector<long long> dmeta(K,INF);\\n using P=pair<long long,int>; priority_queue<P,vector<P>,greater<P>> pq;\\n dmeta[0]=0; pq.push({0,0});\\n while(!pq.empty()){\\n auto [d,u]=pq.top(); pq.pop();\\n if(d!=dmeta[u]) continue;\\n for(int v=0;v<K;++v)\\n if(meta[u][v]<INF && d+meta[u][v]<dmeta[v]){\\n dmeta[v]=d+meta[u][v];\\n pq.push({dmeta[v],v});\\n }\\n }\\n\\n long long ans = dmeta[1];\\n cout << (ans==INF?-1:ans) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 11340,\n \"score_of_the_acc\": -0.0798,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1318_10584197\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = 4e18;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (true) {\\n int N, M, cap;\\n if (!(cin >> N >> M >> cap) || (N == 0 && M == 0 && cap == 0)) break;\\n string srcName, dstName; cin >> srcName >> dstName;\\n\\n unordered_map<string, int> id;\\n vector<vector<pair<int,int>>> g; // id -> {next, dist}\\n\\n auto getID = [&](const string& s) -> int {\\n auto it = id.find(s);\\n if (it != id.end()) return it->second;\\n int idx = id.size();\\n id[s] = idx;\\n g.emplace_back();\\n return idx;\\n };\\n\\n for (int i = 0; i < N; ++i) {\\n string a, b; int d; cin >> a >> b >> d;\\n int u = getID(a), v = getID(b);\\n g[u].push_back({v,d});\\n g[v].push_back({u,d});\\n }\\n\\n vector<int> station;\\n station.reserve(M+2);\\n station.push_back(getID(srcName));\\n int dstID = getID(dstName);\\n if (dstID != station[0]) station.push_back(dstID);\\n\\n for (int i = 0; i < M; ++i) {\\n string s; cin >> s;\\n int idS = getID(s);\\n if (idS != station[0] && idS != dstID) station.push_back(idS);\\n }\\n\\n int R = cap * 10;\\n int K = station.size();\\n vector<vector<ll>> meta(K, vector<ll>(K, INF));\\n\\n auto dijkstra_cut = [&](int start){\\n vector<ll> dist(g.size(), INF);\\n using P=pair<ll,int>; priority_queue<P, vector<P>, greater<P>> pq;\\n dist[start]=0; pq.push({0,start});\\n while(!pq.empty()){\\n auto [d,u]=pq.top(); pq.pop();\\n if(d!=dist[u] || d>R) continue;\\n for(auto [v,w]:g[u]){\\n if(d+w<dist[v] && d+w<=R){\\n dist[v]=d+w; pq.push({dist[v],v});\\n }\\n }\\n }\\n return dist;\\n };\\n\\n vector<vector<ll>> allDist;\\n for(int i=0;i<K;++i) allDist.push_back(dijkstra_cut(station[i]));\\n\\n for(int i=0;i<K;++i)\\n for(int j=0;j<K;++j)\\n if(allDist[i][station[j]]<=R)\\n meta[i][j]=allDist[i][station[j]];\\n\\n vector<ll> dmeta(K,INF);\\n using P=pair<ll,int>; priority_queue<P,vector<P>,greater<P>> pq;\\n dmeta[0]=0; pq.push({0,0});\\n while(!pq.empty()){\\n auto [d,u]=pq.top(); pq.pop();\\n if(d!=dmeta[u]) continue;\\n for(int v=0;v<K;++v)\\n if(meta[u][v]<INF && d+meta[u][v]<dmeta[v]){\\n dmeta[v]=d+meta[u][v];\\n pq.push({dmeta[v],v});\\n }\\n }\\n\\n ll ans = dmeta[1];\\n cout << (ans==INF?-1:ans) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 11464,\n \"score_of_the_acc\": -0.0744,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1318_10292082\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\\n#define Endl endl\\n#define all(a) a.begin(), a.end()\\n#define pr(i, j) make_pair(i, j)\\n#define isin(x, l, r) (l <= x && x < r)\\n#define chmin(a, b) a = min(a, b)\\n#define chmax(a, b) a = max(a, b)\\n#define srt(ar) sort(ar.begin(), ar.end())\\n#define rev(ar) reverse(ar.begin(), ar.end())\\n#define jge(f, s, t) cout << (f ? s : t) << endl\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n#define printar(ar) \\\\\\n do \\\\\\n { \\\\\\n for (auto dbg : ar) \\\\\\n { \\\\\\n cout << dbg << \\\" \\\"; \\\\\\n } \\\\\\n cout << endl; \\\\\\n } while (0)\\nconst ll inf = 1e18;\\nconst ld pi = 3.14159265358979;\\nconst ld eps = 1e-9;\\ntemplate <class T, ll n, ll idx = 0>\\nauto make_vec(const ll (&d)[n], const T &init) noexcept\\n{\\n if constexpr (idx < n)\\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else\\n return init;\\n}\\n\\ntemplate <class T, ll n>\\nauto make_vec(const ll (&d)[n]) noexcept\\n{\\n return make_vec(d, T{});\\n}\\n//////////////// 以下を貼る ////////////////\\ntemplate <class T>\\nsize_t HashCombine(const size_t seed, const T &v)\\n{\\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\\n}\\n/* pair用 */\\ntemplate <class T, class S>\\nstruct std::hash<std::pair<T, S>>\\n{\\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\\n {\\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\\n }\\n};\\n////////////////////////////////////////////\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (true)\\n {\\n ll n, m, cap;\\n cin >> n >> m >> cap;\\n if (n == 0)\\n {\\n break;\\n }\\n string S, G;\\n cin >> S >> G;\\n set<string> st;\\n st.insert(S);\\n st.insert(G);\\n vector<string> a(n), b(n);\\n vector<ll> c(n);\\n rep(i, 0, n)\\n {\\n cin >> a[i] >> b[i] >> c[i];\\n st.insert(a[i]);\\n st.insert(b[i]);\\n }\\n ll C = 0;\\n map<string, ll> mp;\\n for (auto i : st)\\n {\\n mp[i] = C;\\n C++;\\n }\\n vector<vector<pair<ll, ll>>> g(C);\\n rep(i, 0, n)\\n {\\n g[mp[a[i]]].push_back(pr(mp[b[i]], c[i]));\\n g[mp[b[i]]].push_back(pr(mp[a[i]], c[i]));\\n }\\n vector<bool> sta(C);\\n rep(i, 0, m)\\n {\\n string x;\\n cin >> x;\\n sta[mp[x]] = true;\\n }\\n vector<vector<ll>> d(C, vector<ll>(cap * 10 + 1, inf));\\n d[mp[S]][cap * 10] = 0;\\n using T = pair<ll, pair<ll, ll>>;\\n priority_queue<T, vector<T>, greater<T>> que;\\n que.push(pr(0, pr(mp[S], cap * 10)));\\n while (!que.empty())\\n {\\n ll X = que.top().first;\\n ll Y = que.top().second.first;\\n ll Z = que.top().second.second;\\n que.pop();\\n if (d[Y][Z] != X)\\n {\\n continue;\\n }\\n rep(i, 0, g[Y].size())\\n {\\n ll nxt = g[Y][i].first;\\n ll cost = g[Y][i].second;\\n if (Z >= cost)\\n {\\n if (sta[nxt])\\n {\\n if (d[nxt][cap * 10] > X + cost)\\n {\\n d[nxt][cap * 10] = X + cost;\\n que.push(pr(d[nxt][cap * 10], pr(nxt, cap * 10)));\\n }\\n }\\n else\\n {\\n if (d[nxt][Z - cost] > X + cost)\\n {\\n d[nxt][Z - cost] = X + cost;\\n que.push(pr(d[nxt][Z - cost], pr(nxt, Z - cost)));\\n }\\n }\\n }\\n }\\n }\\n ll ans = inf;\\n rep(i, 0, cap * 10 + 1)\\n {\\n chmin(ans, d[mp[G]][i]);\\n }\\n if (ans == inf)\\n {\\n cout << -1 << endl;\\n }\\n else\\n {\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1160,\n \"memory_kb\": 101768,\n \"score_of_the_acc\": -1.1439,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1318_10060827\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n\\nmap<string,int> MP;\\nvector<vector<array<int,2>>> G;\\nint rt(string S){\\n if(!MP.count(S)){\\n MP[S]=MP.size();\\n G.push_back({});\\n }\\n return MP[S];\\n}\\n\\nvoid solve(int N,int M,int C){\\n MP.clear();\\n G.clear();\\n string s,t;\\n cin>>s>>t;\\n int S=rt(s),T=rt(t);\\n rep(i,N){\\n cin>>s>>t;\\n int U=rt(s),V=rt(t),d;\\n cin>>d;\\n G[U].push_back({V,d});\\n G[V].push_back({U,d});\\n }\\n set<int> LP;\\n rep(i,M){\\n string s;\\n cin>>s;\\n LP.insert(rt(s));\\n }\\n\\n N=MP.size();\\n vector<vector<ll>> D(N,vector<ll>(C*10+1,1e18));\\n D[S][0]=0;\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> Q;\\n Q.push({0,S,0});\\n vector<vector<bool>> seen(N,vector<bool>(C*10+1,0));\\n ll an=1e18;\\n while(!Q.empty()){\\n auto p=Q.top();\\n Q.pop();\\n if(seen[p[1]][p[2]])continue;\\n seen[p[1]][p[2]]=1;\\n if(p[1]==T)an=min(an,p[0]);\\n for(auto [v,d]:G[p[1]]){\\n ll nc=p[2]+d,nd=p[0]+d;\\n if(nc>C*10)continue;\\n if(LP.count(v))nc=0;\\n if(seen[v][nc])continue;\\n if(D[v][nc]>nd){\\n D[v][nc]=nd;\\n Q.push({nd,v,nc});\\n }\\n }\\n }\\n cout<<(an<1e17?an:-1)<<endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int N,M,C;\\n while(cin>>N>>M>>C,N+M+C!=0)solve(N,M,C);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1380,\n \"memory_kb\": 101432,\n \"score_of_the_acc\": -1.1769,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1318_10060819\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rep2(i,s,t) for(int i=s;i<t;i++)\\n\\nusing vi = vector<int>;\\n\\nint rt(map<string,int> &MP,string S,vector<vector<array<int,2>>> &G){\\n if(!MP.count(S)){\\n MP[S]=MP.size();\\n G.push_back({});\\n }\\n return MP[S];\\n}\\n\\nvoid solve(int N,int M,int C){\\n map<string,int> MP;\\n vector<vector<array<int,2>>> G;\\n string s,t;\\n cin>>s>>t;\\n int S=rt(MP,s,G),T=rt(MP,t,G);\\n rep(i,N){\\n string u,v;\\n cin>>u>>v;\\n int U=rt(MP,u,G),V=rt(MP,v,G),d;\\n cin>>d;\\n G[U].push_back({V,d});\\n G[V].push_back({U,d});\\n }\\n set<int> LP;\\n rep(i,M){\\n string s;\\n cin>>s;\\n LP.insert(rt(MP,s,G));\\n }\\n\\n N=MP.size();\\n vector<vector<ll>> D(N,vector<ll>(C*10+1,1e18));\\n D[S][0]=0;\\n priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> Q;\\n Q.push({0,S,0});\\n vector<vector<bool>> seen(N,vector<bool>(C*10+1,0));\\n while(!Q.empty()){\\n auto p=Q.top();\\n Q.pop();\\n if(seen[p[1]][p[2]])continue;\\n seen[p[1]][p[2]]=1;\\n for(auto [v,d]:G[p[1]]){\\n ll nc=p[2]+d;\\n if(nc>C*10)continue;\\n ll nd=p[0]+d;\\n if(LP.count(v))nc=0;\\n if(seen[v][nc])continue;\\n if(D[v][nc]>nd){\\n D[v][nc]=nd;\\n Q.push({nd,v,nc});\\n }\\n }\\n }\\n ll an=1e18;\\n rep(i,C*10+1)an=min(an,D[T][i]);\\n cout<<(an<1e17?an:-1)<<endl;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n int N,M,C;\\n while(cin>>N>>M>>C,N+M+C!=0)solve(N,M,C);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 102336,\n \"score_of_the_acc\": -1.1892,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1318_9684304\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct UnionFind{\\n vector<int> par; int n;\\n UnionFind(){}\\n UnionFind(int _n):par(_n,-1),n(_n){}\\n int root(int x){return par[x]<0?x:par[x]=root(par[x]);}\\n bool same(int x,int y){return root(x)==root(y);}\\n int size(int x){return -par[root(x)];}\\n bool unite(int x,int y){\\n x=root(x),y=root(y); if(x==y)return false;\\n if(size(x)>size(y))swap(x,y);\\n par[y]+=par[x]; par[x]=y; n--; return true;\\n }\\n};\\n\\n/**\\n * @brief Union Find\\n */\\n\\nvector<int> MakeDist(vector<vector<pair<int,int>>>& G, int S) {\\n int N = G.size();\\n vector<int> DP(N,inf);\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> PQ;\\n DP[S] = 0;\\n PQ.push({0,S});\\n while(!PQ.empty()) {\\n auto [D,P] = PQ.top();\\n PQ.pop();\\n if (DP[P] < D) continue;\\n for (auto E : G[P]) {\\n int NP = E.first, ND = E.second + D;\\n if (chmin(DP[NP],ND)) {\\n PQ.push({ND,NP});\\n }\\n }\\n }\\n return DP;\\n}\\n\\nint main() {\\nwhile(1) {\\n int M, K, L;\\n cin >> M >> K >> L;\\n if (M == 0) return 0;\\n L *= 10;\\n map<string,int> mp;\\n int Cur = 0;\\n string S;\\n cin >> S;\\n mp[S] = 0;\\n cin >> S;\\n mp[S] = 1;\\n Cur = 2;\\n vector<int> A(M), B(M), D(M);\\n rep(i,0,M) {\\n string T;\\n cin >> S >> T >> D[i];\\n if (mp.count(S)) A[i] = mp[S];\\n else mp[S] = A[i] = Cur, Cur++;\\n if (mp.count(T)) B[i] = mp[T];\\n else mp[T] = B[i] = Cur, Cur++;\\n }\\n vector<int> C(K+2);\\n rep(i,0,K) {\\n cin >> S;\\n if (mp.count(S)) C[i] = mp[S];\\n else mp[S] = C[i] = Cur, Cur++;\\n }\\n C[K] = 0,C[K+1] = 1;\\n UNIQUE(C);\\n int N = Cur;\\n K = C.size();\\n vector<vector<pair<int,int>>> G(N);\\n rep(i,0,M) G[A[i]].push_back({B[i],D[i]}), G[B[i]].push_back({A[i],D[i]});\\n vector<vector<int>> Dist(K,vector<int>(K,inf));\\n rep(i,0,K) {\\n vector<int> DP = MakeDist(G,C[i]);\\n rep(j,0,K) {\\n Dist[i][j] = DP[C[j]];\\n }\\n }\\n rep(i,0,K) {\\n rep(j,0,K) {\\n if (Dist[i][j] > L) Dist[i][j] = inf;\\n }\\n }\\n rep(k,0,K) {\\n rep(i,0,K) {\\n rep(j,0,K) {\\n chmin(Dist[i][j], Dist[i][k] + Dist[k][j]);\\n }\\n }\\n }\\n cout << (Dist[0][1] == inf ? -1 : Dist[0][1]) << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -0.0825,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1318_9563459\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_set>\\n#include <vector>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nclass Node {\\n public:\\n\\tstring city;\\n\\tint gas; // [deciliter]\\n\\tint dist;\\n\\n\\tNode(const string& city, const int& gas, const int& dist)\\n\\t\\t: city(city), gas(gas), dist(dist) {};\\n\\n\\tbool operator<(const Node& b) const {\\n\\t\\treturn (this->dist > b.dist);\\n\\t}\\n};\\n\\n// cap [deciliter]\\nll ShortestWay(const int& cap, const string& src, const string& dest, map<string, map<string, int>>& adjacents, map<string, bool>& has_station) {\\n\\tll ans = -1;\\n\\n\\tmap<string, map<int, ll>> dist;\\n\\tdist[src][cap] = 0;\\n\\tmap<string, map<int, bool>> done;\\n\\tpriority_queue<Node> que;\\n\\tque.emplace(src, cap, 0);\\n\\n\\twhile (!que.empty()) {\\n\\t\\tNode node = que.top();\\n\\t\\tque.pop();\\n\\t\\tif (node.city == dest) {\\n\\t\\t\\tans = dist[node.city][node.gas];\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tdone[node.city][node.gas] = true;\\n\\n\\t\\tfor (const auto& adjacent : adjacents[node.city]) {\\n\\t\\t\\tint adjacent_gas = node.gas - adjacent.second;\\n\\t\\t\\tif (adjacent_gas < 0) continue;\\n\\t\\t\\tif (has_station[adjacent.first]) adjacent_gas = cap;\\n\\t\\t\\tif (done[adjacent.first][adjacent_gas]) continue;\\n\\t\\t\\tll adjacent_dist = node.dist + adjacent.second;\\n\\n\\t\\t\\tbool dismiss = false;\\n\\t\\t\\tfor (const auto& gas_and_dist : dist[adjacent.first]) {\\n\\t\\t\\t\\tif (adjacent_gas <= gas_and_dist.first and adjacent_dist >= gas_and_dist.second) dismiss = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (dismiss) continue;\\n\\n\\t\\t\\tdist[adjacent.first][adjacent_gas] = adjacent_dist;\\n\\t\\t\\tque.emplace(adjacent.first, adjacent_gas, adjacent_dist);\\n\\t\\t}\\n\\t}\\n\\n\\treturn ans;\\n}\\n\\nbool solve() {\\n\\tint n, m, cap;\\n\\tcin >> n >> m >> cap;\\n\\tif (n == 0) return false;\\n\\tstring src, dest;\\n\\tcin >> src >> dest;\\n\\tmap<string, map<string, int>> adjacents;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tstring c1, c2;\\n\\t\\tint d;\\n\\t\\tcin >> c1 >> c2 >> d;\\n\\t\\tadjacents[c1][c2] = adjacents[c2][c1] = d;\\n\\t}\\n\\tmap<string, bool> has_station;\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\thas_station[s] = true;\\n\\t}\\n\\n\\tcout << ShortestWay(cap * 10, src, dest, adjacents, has_station) << endl;\\n\\n\\treturn true;\\n}\\n\\nint main(void) {\\n\\twhile (solve());\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6200,\n \"memory_kb\": 104212,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1318_8994680\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\n// g <- pair < v , cost > \\ntemplate < class T >\\nvector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {\\n T INF = numeric_limits< T >::max();\\n vector<T> dist(graph.size(), INF);\\n priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;\\n q.push({dist[s] = T(0), s});\\n while(!q.empty()){\\n auto [uc, ui] = q.top(); q.pop();\\n if(uc != dist[ui]) continue;\\n for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) \\n q.push({dist[vi] = uc + vc, vi});\\n }\\n return dist;\\n}\\n\\nint solve(int N, int M, int cap) {\\n cap *= 10;\\n\\n map<string, int> mp;\\n int sz = 0;\\n auto ID = [&](string s) {\\n if(!mp.count(s)) mp[s] = sz++;\\n return mp[s];\\n };\\n int src = [&] { string s = in(); return ID(s); }();\\n int dst = [&] { string s = in(); return ID(s); }();\\n vector<vector<pair<int,int>>> G(N + N);\\n for(int i : rep(N)) {\\n string s = in(), t = in(); int d = in();\\n int u = ID(s), v = ID(t);\\n G[u].push_back({v, d});\\n G[v].push_back({u, d});\\n }\\n vector<bool> station(N + N, false);\\n for(int i : rep(M)) {\\n string s = in();\\n station[ID(s)] = true;\\n }\\n\\n const int INF = 1e9;\\n vector dist(N + N, vector(cap + 1, INF));\\n heap_min<tuple<int,int,int>> q;\\n q.push({dist[src][cap] = 0, src, cap});\\n while(not q.empty()) {\\n auto [ud, ui, uc] = q.top(); q.pop();\\n if(dist[ui][uc] < ud) continue;\\n for(auto [vi, d] : G[ui]) {\\n if(0 <= uc - d) {\\n int vc = station[vi] ? cap : uc - d;\\n if(chmin(dist[vi][vc], ud + d)) q.push({ud + d, vi, vc});\\n }\\n }\\n }\\n\\n int ans = INF;\\n for(int c = 0; c <= cap; c++) chmin(ans, dist[dst][c]);\\n return ans < INF ? ans : -1;\\n}\\n\\nint main() {\\n while(true) {\\n int N = in(), M = in(), cap = in();\\n if(make_tuple(N, M, cap) == make_tuple(0, 0, 0)) return 0;\\n print(solve(N, M, cap));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1100,\n \"memory_kb\": 77356,\n \"score_of_the_acc\": -0.8904,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1318_8475146\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG\\n#pragma GCC optimize(\\\"O2,no-stack-protector,unroll-loops,fast-math\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < int(n); i++)\\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\\n#define each(e, v) for (auto& e : v)\\n#define MM << \\\" \\\" <<\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\\n int n = v.size();\\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (v.empty()) cout << '\\\\n';\\n}\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\ntemplate <typename T> bool chmax(T& x, const T& y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\ntemplate <typename T> bool chmin(T& x, const T& y) {\\n return (x > y) ? (x = y, true) : false;\\n}\\ntemplate <class T>\\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T> using maxheap = std::priority_queue<T>;\\ntemplate <typename T> int lb(const vector<T>& v, T x) {\\n return lower_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> int ub(const vector<T>& v, T x) {\\n return upper_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> void rearrange(vector<T>& v) {\\n sort(begin(v), end(v));\\n v.erase(unique(begin(v), end(v)), end(v));\\n}\\n\\n// __int128_t gcd(__int128_t a, __int128_t b) {\\n// if (a == 0)\\n// return b;\\n// if (b == 0)\\n// return a;\\n// __int128_t cnt = a % b;\\n// while (cnt != 0) {\\n// a = b;\\n// b = cnt;\\n// cnt = a % b;\\n// }\\n// return b;\\n// }\\n\\nstruct Union_Find_Tree {\\n vector<int> data;\\n const int n;\\n int cnt;\\n \\n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\\n \\n int root(int x) {\\n if (data[x] < 0) return x;\\n return data[x] = root(data[x]);\\n }\\n \\n int operator[](int i) { return root(i); }\\n \\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n if (data[x] > data[y]) swap(x, y);\\n data[x] += data[y], data[y] = x;\\n cnt--;\\n return true;\\n }\\n \\n int size(int x) { return -data[root(x)]; }\\n \\n int count() { return cnt; };\\n \\n bool same(int x, int y) { return root(x) == root(y); }\\n \\n void clear() {\\n cnt = n;\\n fill(begin(data), end(data), -1);\\n }\\n};\\n\\ntemplate <int mod> struct Mod_Int {\\n int x;\\n\\n Mod_Int() : x(0) {}\\n\\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n static int get_mod() { return mod; }\\n\\n Mod_Int& operator+=(const Mod_Int& p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator-=(const Mod_Int& p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator*=(const Mod_Int& p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n Mod_Int& operator/=(const Mod_Int& p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n Mod_Int& operator++() { return *this += Mod_Int(1); }\\n\\n Mod_Int operator++(int) {\\n Mod_Int tmp = *this;\\n ++*this;\\n return tmp;\\n }\\n\\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\\n\\n Mod_Int operator--(int) {\\n Mod_Int tmp = *this;\\n --*this;\\n return tmp;\\n }\\n\\n Mod_Int operator-() const { return Mod_Int(-x); }\\n\\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\\n\\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\\n\\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\\n\\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\\n\\n bool operator==(const Mod_Int& p) const { return x == p.x; }\\n\\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\\n\\n Mod_Int inverse() const {\\n assert(*this != Mod_Int(0));\\n return pow(mod - 2);\\n }\\n\\n Mod_Int pow(long long k) const {\\n Mod_Int now = *this, ret = 1;\\n for (; k > 0; k >>= 1, now *= now) {\\n if (k & 1) ret *= now;\\n }\\n return ret;\\n }\\n\\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\\n return os << p.x;\\n }\\n\\n friend istream& operator>>(istream& is, Mod_Int& p) {\\n long long a;\\n is >> a;\\n p = Mod_Int<mod>(a);\\n return is;\\n }\\n};\\n\\nll mpow2(ll x, ll n, ll mod) {\\n ll ans = 1;\\n x %= mod;\\n while (n != 0) {\\n if (n & 1) ans = ans * x % mod;\\n x = x * x % mod;\\n n = n >> 1;\\n }\\n ans %= mod;\\n return ans;\\n}\\n\\ntemplate <typename T> T modinv(T a, const T& m) {\\n T b = m, u = 1, v = 0;\\n while (b > 0) {\\n T t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return u >= 0 ? u % m : (m - (-u) % m) % m;\\n}\\n\\nll divide_int(ll a, ll b) {\\n if (b < 0) a = -a, b = -b;\\n return (a >= 0 ? a / b : (a - b + 1) / b);\\n}\\n\\n// const int MOD = 1000000007;\\nconst int MOD = 998244353;\\nusing mint = Mod_Int<MOD>;\\n\\n// ----- library -------\\n// ----- library -------\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (1) {\\n int m, k, c;\\n cin >> m >> k >> c;\\n c *= 10;\\n if (!m)\\n break;\\n string sa, sb;\\n cin >> sa >> sb;\\n vector<string> su(m), sv(m), ss(k);\\n vector<int> d(m);\\n rep(i, m) cin >> su[i] >> sv[i] >> d[i];\\n rep(i, k) cin >> ss[i];\\n vector<string> ls{sa, sb};\\n rep(i, m) ls.eb(su[i]), ls.eb(sv[i]);\\n rep(i, k) ls.eb(ss[i]);\\n rearrange(ls);\\n int a, b;\\n vector<int> u(m), v(m), s(k);\\n a = lb(ls, sa), b = lb(ls, sb);\\n rep(i, m) u[i] = lb(ls, su[i]), v[i] = lb(ls, sv[i]);\\n rep(i, k) s[i] = lb(ls, ss[i]);\\n int n = sz(ls);\\n vector<vector<pii>> g(n);\\n vector<int> f(n, 0);\\n rep(i, m) g[u[i]].eb(v[i], d[i]), g[v[i]].eb(u[i], d[i]);\\n rep(i, k) f[s[i]] = 1;\\n minheap<pair<int, pii>> que;\\n vector<vector<int>> mi(n, vector<int>(c + 1, 1e9));\\n mi[a][c] = 0, que.emplace(0, pair(a, c));\\n while (sz(que)) {\\n auto [nd, nij] = que.top();\\n que.pop();\\n auto [ni, nj] = nij;\\n if (mi[ni][nj] != nd)\\n continue;\\n for (auto [nv, cost] : g[ni]) {\\n if (nj < cost)\\n continue;\\n int rest = (f[nv] ? c : nj - cost);\\n if (chmin(mi[nv][rest], nd + cost))\\n que.emplace(nd + cost, pair(nv, rest));\\n }\\n }\\n int ans = 1e9;\\n rep(j, c + 1) chmin(ans, mi[b][j]);\\n cout << (ans < 1e8 ? ans : -1) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 52020,\n \"score_of_the_acc\": -0.6227,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1318_8390116\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nstruct edge {\\n\\tint to, cost;\\n};\\n\\nstruct state {\\n\\tint pos, rem, cost;\\n\\tbool operator<(const state& s) const {\\n\\t\\treturn cost > s.cost;\\n\\t}\\n};\\n\\nint solve(int N, int M, int C, const string& src, const string& dst, const vector<string>& A, const vector<string>& B, const vector<int>& D, const vector<string>& S) {\\n\\tvector<string> cities;\\n\\tcities.push_back(src);\\n\\tcities.push_back(dst);\\n\\tcities.insert(cities.end(), A.begin(), A.end());\\n\\tcities.insert(cities.end(), B.begin(), B.end());\\n\\tcities.insert(cities.end(), S.begin(), S.end());\\n\\tsort(cities.begin(), cities.end());\\n\\tcities.erase(unique(cities.begin(), cities.end()), cities.end());\\n\\tint V = cities.size();\\n\\tvector<vector<edge> > G(V);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tint va = lower_bound(cities.begin(), cities.end(), A[i]) - cities.begin();\\n\\t\\tint vb = lower_bound(cities.begin(), cities.end(), B[i]) - cities.begin();\\n\\t\\tG[va].push_back(edge{vb, D[i]});\\n\\t\\tG[vb].push_back(edge{va, D[i]});\\n\\t}\\n\\tint vs = lower_bound(cities.begin(), cities.end(), src) - cities.begin();\\n\\tint vg = lower_bound(cities.begin(), cities.end(), dst) - cities.begin();\\n\\tvector<bool> station(V, false);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tint pos = lower_bound(cities.begin(), cities.end(), S[i]) - cities.begin();\\n\\t\\tstation[pos] = true;\\n\\t}\\n\\tvector<vector<int> > dist(V, vector<int>(C + 1, INF));\\n\\tpriority_queue<state> que;\\n\\tvector<vector<bool> > vis(V, vector<bool>(C + 1, false));\\n\\tdist[vs][C] = 0;\\n\\tque.push(state{vs, C, 0});\\n\\twhile (!que.empty()) {\\n\\t\\tstate s = que.top();\\n\\t\\tque.pop();\\n\\t\\tif (!vis[s.pos][s.rem]) {\\n\\t\\t\\tvis[s.pos][s.rem] = true;\\n\\t\\t\\tfor (edge e : G[s.pos]) {\\n\\t\\t\\t\\tint nrem = s.rem - e.cost;\\n\\t\\t\\t\\tif (nrem >= 0) {\\n\\t\\t\\t\\t\\tif (station[e.to]) {\\n\\t\\t\\t\\t\\t\\tnrem = C;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (dist[e.to][nrem] > s.cost + e.cost) {\\n\\t\\t\\t\\t\\t\\tdist[e.to][nrem] = s.cost + e.cost;\\n\\t\\t\\t\\t\\t\\tque.push(state{e.to, nrem, dist[e.to][nrem]});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = *min_element(dist[vg].begin(), dist[vg].end());\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\twhile (true) {\\n\\t\\tint N, M, C;\\n\\t\\tcin >> N >> M >> C;\\n\\t\\tif (N == 0 && M == 0 && C == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tC *= 10;\\n\\t\\tstring src, dst;\\n\\t\\tcin >> src >> dst;\\n\\t\\tvector<string> A(N), B(N);\\n\\t\\tvector<int> D(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> A[i] >> B[i] >> D[i];\\n\\t\\t}\\n\\t\\tvector<string> S(M);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tcin >> S[i];\\n\\t\\t}\\n\\t\\tint ans = solve(N, M, C, src, dst, A, B, D, S);\\n\\t\\tcout << (ans != INF ? ans : -1) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 54632,\n \"score_of_the_acc\": -0.591,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1318_6736548\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\ntemplate <typename T>\\nstruct Edge {\\n int from, to;\\n T weight;\\n Edge() = default;\\n Edge(int to, T weight) : from(-1), to(to), weight(weight) {}\\n Edge(int from, int to, T weight) : from(from), to(to), weight(weight) {}\\n};\\n\\n\\ntemplate <typename T>\\nstd::vector<T> dijkstra(const std::vector<std::vector<Edge<T>>>& G, int s) {\\n std::vector<T> dist(G.size(), std::numeric_limits<T>::max());\\n dist[s] = 0;\\n using P = std::pair<T, int>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> pq;\\n pq.emplace(0, s);\\n\\n while (!pq.empty()) {\\n T d;\\n int v;\\n std::tie(d, v) = pq.top();\\n pq.pop();\\n if (dist[v] < d) continue;\\n for (auto& e : G[v]) {\\n if (dist[e.to] > d + e.weight) {\\n dist[e.to] = d + e.weight;\\n pq.emplace(dist[e.to], e.to);\\n }\\n }\\n }\\n\\n return dist;\\n}\\n\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int N, M, cap;\\n cin >> N >> M >> cap;\\n if (N == 0) break;\\n string src, dest;\\n cin >> src >> dest;\\n vector<vector<Edge<int>>> G;\\n map<string, int> idx;\\n rep(_,0,N) {\\n string su, sv;\\n int d;\\n cin >> su >> sv >> d;\\n int u, v;\\n if (idx.count(su)) u = idx[su];\\n else {\\n u = idx.size();\\n idx[su] = u;\\n G.emplace_back();\\n }\\n if (idx.count(sv)) v = idx[sv];\\n else {\\n v = idx.size();\\n idx[sv] = v;\\n G.emplace_back();\\n }\\n G[u].push_back({v, d});\\n G[v].push_back({u, d});\\n }\\n int V = G.size();\\n if (!idx.count(src) || !idx.count(dest)) {\\n cout << -1 << endl;\\n continue;\\n }\\n vector<int> stations;\\n rep(i,0,M) {\\n string s;\\n cin >> s;\\n stations.push_back(idx[s]);\\n }\\n stations.push_back(idx[src]);\\n stations.push_back(idx[dest]);\\n vector<vector<Edge<int>>> G2(V);\\n for (int s : stations) {\\n auto dist = dijkstra(G, s);\\n for (int t : stations) {\\n if (dist[t] <= cap * 10) G2[s].push_back({t, dist[t]});\\n }\\n }\\n auto dist = dijkstra(G2, idx[src]);\\n int ans = dist[idx[dest]];\\n cout << (ans < 1e9 ? ans : -1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 5496,\n \"score_of_the_acc\": -0.038,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1318_6722793\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N, M, cap;\\n while (cin >> N >> M >> cap, !(N == 0 and M == 0 and cap == 0)) {\\n V<string> SS;\\n string src, dst;\\n cin >> src >> dst;\\n SS.push_back(src);\\n SS.push_back(dst);\\n V<string> c1(N), c2(N);\\n V<int> d(N);\\n rep(i, N) {\\n cin >> c1[i] >> c2[i] >> d[i];\\n SS.push_back(c1[i]);\\n SS.push_back(c2[i]);\\n }\\n V<string> S(M);\\n rep(i, M) {\\n cin >> S[i];\\n SS.push_back(S[i]);\\n }\\n sort(SS.begin(), SS.end());\\n SS.erase(unique(SS.begin(), SS.end()), SS.end());\\n int NV = SS.size();\\n V<V<pair<int, ll>>> G(NV);\\n rep(i, N) {\\n int a = lower_bound(SS.begin(), SS.end(), c1[i]) - SS.begin();\\n int b = lower_bound(SS.begin(), SS.end(), c2[i]) - SS.begin();\\n G[a].push_back({b, d[i]});\\n G[b].push_back({a, d[i]});\\n }\\n V<int> gas(NV, 0);\\n rep(i, M) {\\n int a = lower_bound(SS.begin(), SS.end(), S[i]) - SS.begin();\\n gas[a] = 1;\\n }\\n const ll INF = 1LL << 60;\\n cap *= 10;\\n V<V<ll>> dist(NV, V<ll>(cap + 1, INF));\\n int s = lower_bound(SS.begin(), SS.end(), src) - SS.begin();\\n int g = lower_bound(SS.begin(), SS.end(), dst) - SS.begin();\\n dist[s][cap] = 0;\\n priority_queue<tuple<ll, int, int>> que;\\n que.push({0, s, cap});\\n bool ok = false;\\n while (!que.empty()) {\\n auto [d, cv, ccap] = que.top();\\n que.pop();\\n d = -d;\\n if (cv == g) {\\n cout << d << '\\\\n';\\n ok = true;\\n break;\\n }\\n if (dist[cv][ccap] != d) continue;\\n if (gas[cv] and ccap < cap) {\\n dist[cv][cap] = d;\\n que.push({-d, cv, cap});\\n }\\n for (auto [nex, cost] : G[cv]) {\\n if (ccap >= cost) {\\n if (dist[nex][ccap - cost] > d + cost) {\\n dist[nex][ccap - cost] = d + cost;\\n que.push({-(d + cost), nex, ccap - cost});\\n }\\n }\\n }\\n }\\n if (!ok) cout << -1 << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1430,\n \"memory_kb\": 97808,\n \"score_of_the_acc\": -1.149,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1318_6673027\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n using type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n using type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[value % 10];\\n value /= 10;\\n } while (value != 0);\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n __int128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n if (s[0] == '-') ret = -ret;\\n return ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n __uint128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_i128(s);\\n return in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_u128(s);\\n return in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n (std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n std::string res;\\n if (bit_num >= 0) {\\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n } else {\\n for (; val; val >>= 1) res += '0' + (val & 1);\\n std::reverse(res.begin(), res.end());\\n }\\n return res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n std::vector<T> res;\\n for (; val; val /= base) res.push_back(val % base);\\n if (res.empty()) res.push_back(T{ 0 });\\n return res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n auto res = digits_low_to_high(val, base);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n std::ostringstream ss;\\n for (auto it = v.begin(); it != v.end();) {\\n ss << *it;\\n if (++it != v.end()) ss << sep;\\n }\\n ss << end;\\n return ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_{};\\n\\n// ! code from here\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace suisen {\\ntemplate <typename T>\\nclass CoordinateCompressorBuilder {\\n public:\\n struct Compressor {\\n public:\\n static constexpr int absent = -1;\\n\\n // default constructor\\n Compressor() : _xs(std::vector<T>{}) {}\\n // Construct from strictly sorted vector\\n Compressor(const std::vector<T> &xs) : _xs(xs) {\\n assert(is_strictly_sorted(xs));\\n }\\n\\n // Return the number of distinct keys.\\n int size() const {\\n return _xs.size();\\n }\\n // Check if the element is registered.\\n bool has_key(const T &e) const {\\n return std::binary_search(_xs.begin(), _xs.end(), e);\\n }\\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\\n int comp(const T &e, int default_value = absent) const {\\n const int res = min_geq_index(e);\\n return res != size() and _xs[res] == e ? res : default_value;\\n }\\n // Restore the element from the index.\\n T decomp(const int compressed_index) const {\\n return _xs[compressed_index];\\n }\\n // Compress the element. Equivalent to call `comp(e)`\\n int operator[](const T &e) const {\\n return comp(e);\\n }\\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\\n T min_gt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\\n T min_geq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\\n T max_lt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\\n T max_leq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\\n int min_gt_index(const T &e) const {\\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\\n int min_geq_index(const T &e) const {\\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\\n int max_lt_index(const T &e) const {\\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\\n }\\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\\n int max_leq_index(const T &e) const {\\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\\n }\\n private:\\n std::vector<T> _xs;\\n static bool is_strictly_sorted(const std::vector<T> &v) {\\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\\n }\\n };\\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n CoordinateCompressorBuilder(const int n, Gen generator) {\\n reserve(n);\\n for (int i = 0; i < n; ++i) push(generator(i));\\n }\\n // Attempt to preallocate enough memory for specified number of elements.\\n void reserve(int n) {\\n _xs.reserve(n);\\n }\\n // Add data.\\n void push(const T &first) {\\n _xs.push_back(first);\\n }\\n // Add data.\\n void push(T &&first) {\\n _xs.push_back(std::move(first));\\n }\\n // Add data in the range of [first, last). \\n template <typename Iterator>\\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\\n }\\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\\n template <typename Iterable>\\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\\n push(iterable.begin(), iterable.end());\\n }\\n // Add data.\\n template <typename ...Args>\\n void emplace(Args &&...args) {\\n _xs.emplace_back(std::forward<Args>(args)...);\\n }\\n // Build compressor.\\n auto build() {\\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\\n return Compressor {_xs};\\n }\\n // Build compressor from vector.\\n static auto build(const std::vector<T> &xs) {\\n return CoordinateCompressorBuilder(xs).build();\\n }\\n // Build compressor from vector.\\n static auto build(std::vector<T> &&xs) {\\n return CoordinateCompressorBuilder(std::move(xs)).build();\\n }\\n // Build compressor from generator.\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n static auto build(const int n, Gen generator) {\\n return CoordinateCompressorBuilder<T>(n, generator).build();\\n }\\n private:\\n std::vector<T> _xs;\\n};\\n\\n} // namespace suisen\\n\\nlong long solve(int n, int c, int s, int t, vector<tuple<int, int, int>> edges, vector<int> st) {\\n vector<int8_t> gs(n, false);\\n for (auto e : st) {\\n gs[e] = true;\\n }\\n\\n vector<vector<pair<int, int>>> g(n);\\n for (auto [u, v, w] : edges) {\\n g[u].emplace_back(v, w);\\n g[v].emplace_back(u, w);\\n }\\n\\n vector d(n, vector<long long>(c + 1, numeric_limits<long long>::max()));\\n pq_greater<tuple<long long, int, int>> pq;\\n pq.emplace(d[s][c] = 0, s, c);\\n while (pq.size()) {\\n auto [dvx, v, x] = pq.top();\\n pq.pop();\\n if (dvx != d[v][x]) continue;\\n for (auto [nv, w] : g[v]) if (w <= x) {\\n int nx = gs[nv] ? c : x - w;\\n if (chmin(d[nv][nx], dvx + w)) {\\n pq.emplace(d[nv][nx], nv, nx);\\n }\\n }\\n }\\n\\n long long ans = *min_element(all(d[t]));\\n if (ans == numeric_limits<long long>::max()) return -1;\\n return ans;\\n}\\n\\nint main() {\\n while (true) {\\n input(int, n, m, c);\\n if (n == 0 and m == 0 and c == 0) break;;\\n\\n c *= 10;\\n input(string, s, t);\\n vector<tuple<string, string, int>> edges(n);\\n read(edges);\\n vector<string> st(m);\\n read(st);\\n\\n CoordinateCompressorBuilder<string> builder;\\n builder.push(s);\\n builder.push(t);\\n\\n for (auto& [u, v, w] : edges) {\\n builder.push(u);\\n builder.push(v);\\n }\\n for (auto& x : st) {\\n builder.push(x);\\n }\\n auto cmp = builder.build();\\n\\n int si = cmp[s], ti = cmp[t];\\n vector<tuple<int, int, int>> es;\\n for (auto& [u, v, w] : edges) {\\n es.emplace_back(cmp[u], cmp[v], w);\\n }\\n vector<int> sts;\\n for (auto& x : st) {\\n sts.push_back(cmp[x]);\\n }\\n print(solve(cmp.size(), c, si, ti, es, sts));\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 98244,\n \"score_of_the_acc\": -1.1154,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1318_6605348\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#define INF 1012345678\\nusing namespace std;\\n\\nchar buff1[32], buff2[32];\\nunordered_map<string, vector<pair<string, int>>> ed;\\nvector<pair<int, int>> edn[6144], edn2[6144];\\nunordered_map<string, int> nodenm;\\nint distn[6144], visn[6144];\\nunordered_set<string> city, lpg;\\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq;\\n\\nvoid dijk(int src, int n, int m, int cap) {\\n int node, d;\\n for (int i = 1; i <= n; i++) {\\n distn[i] = cap + 1;\\n visn[i] = 0;\\n }\\n \\n while (pq.size()) pq.pop();\\n pq.push({ 0, src });\\n while (pq.size()) {\\n node = pq.top().second;\\n d = pq.top().first;\\n pq.pop();\\n if (visn[node]) continue;\\n else visn[node] = 1;\\n for (auto& i : edn[node]) {\\n if (d + i.second < distn[i.first]) {\\n distn[i.first] = d + i.second;\\n pq.push({ distn[i.first], i.first });\\n }\\n }\\n }\\n\\n for (int i = 1; i <= m; i++) {\\n if (distn[i] <= cap) {\\n edn2[src].push_back({ i, distn[i] });\\n }\\n }\\n}\\n\\nint dijk2(int src, int dest, int n) {\\n int node;\\n int d;\\n for (int i = 1; i <= n; i++) {\\n distn[i] = INF;\\n visn[i] = 0;\\n }\\n\\n while (pq.size()) pq.pop();\\n pq.push({ 0, src });\\n while (pq.size()) {\\n node = pq.top().second;\\n d = pq.top().first;\\n pq.pop();\\n if (node == dest) return d;\\n if (visn[node]) continue;\\n else visn[node] = 1;\\n for (auto& i : edn2[node]) {\\n if (d + i.second < distn[i.first]) {\\n distn[i.first] = d + i.second;\\n pq.push({ distn[i.first], i.first });\\n }\\n }\\n }\\n\\n return -1;\\n}\\n\\nint main(void) {\\n string src, dest;\\n int n, m, cap, x;\\n while (1) {\\n scanf(\\\"%d %d %d\\\", &n, &m, &cap);\\n if (n == 0 && m == 0 && cap == 0) break;\\n else cap *= 10;\\n scanf(\\\"%s %s\\\", buff1, buff2);\\n src = buff1, dest = buff2;\\n for (int i = 0; i < n; i++) {\\n scanf(\\\"%s %s %d\\\", buff1, buff2, &x);\\n if (ed.find(buff1) == ed.end()) ed.insert({ buff1, {{buff2, x}} });\\n else ed[buff1].push_back({ buff2, x });\\n if (ed.find(buff2) == ed.end()) ed.insert({ buff2, {{buff1, x}} });\\n else ed[buff2].push_back({ buff1, x });\\n if (city.find(buff1) == city.end()) city.insert(buff1);\\n if (city.find(buff2) == city.end()) city.insert(buff2);\\n }\\n for (int i = 0; i < m; i++) {\\n scanf(\\\"%s\\\", buff1);\\n lpg.insert(buff1);\\n }\\n lpg.insert(src);\\n lpg.insert(dest);\\n nodenm.insert({ src, 1 });\\n nodenm.insert({ dest, 2 });\\n m = 2;\\n for (auto& i : lpg) {\\n if (i == src || i == dest) continue;\\n nodenm.insert({ i, ++m });\\n }\\n n = m;\\n for (auto& i : city) {\\n if (lpg.find(i) != lpg.end()) continue;\\n nodenm.insert({ i, ++n });\\n }\\n for (auto& i : ed) {\\n for (auto& j : i.second) {\\n edn[nodenm[i.first]].push_back({nodenm[j.first], j.second});\\n }\\n }\\n\\n\\n for (int i = 1; i <= m; i++) {\\n dijk(i, n, m, cap);\\n }\\n printf(\\\"%d\\\\n\\\", dijk2(1, 2, m));\\n\\n\\n city.clear();\\n lpg.clear();\\n ed.clear();\\n for (int i = 1; i <= n; i++) {\\n edn[i].clear();\\n edn2[i].clear();\\n }\\n nodenm.clear();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 6128,\n \"score_of_the_acc\": -0.0294,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1318_6605184\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#define INF 1012345678\\nusing namespace std;\\n\\nchar buff1[32], buff2[32];\\nunordered_map<string, vector<pair<string, int>>> ed, ed2;\\nunordered_map<string, int> dist;\\nunordered_set<string> city, lpg, vis;\\npriority_queue<pair<int, string>, vector<pair<int, string>>, greater<>> pq;\\n\\nvoid dijk(string src, string node, int cap) {\\n int d;\\n dist.clear();\\n vis.clear();\\n for (auto& i : city) dist.insert({ i, cap + 1 });\\n pq.push({ 0, src });\\n while (pq.size()) {\\n node = pq.top().second;\\n d = pq.top().first;\\n pq.pop();\\n if (vis.find(node) != vis.end()) continue;\\n else vis.insert(node);\\n for (auto& i : ed[node]) {\\n if (d + i.second < dist[i.first]) {\\n dist[i.first] = d + i.second;\\n pq.push({ dist[i.first], i.first });\\n }\\n }\\n }\\n\\n for (auto& i : dist) {\\n if (i.second <= cap && lpg.find(i.first) != lpg.end()) {\\n if (ed2.find(src) == ed2.end()) ed2.insert({ src, {{i.first, i.second}} });\\n else ed2[src].push_back({ i.first, i.second });\\n }\\n }\\n}\\n\\nint dijk2(string src, string dest) {\\n string node;\\n int d;\\n dist.clear();\\n vis.clear();\\n for (auto& i : lpg) dist.insert({ i, INF });\\n pq.push({ 0, src });\\n while (pq.size()) {\\n node = pq.top().second;\\n d = pq.top().first;\\n pq.pop();\\n if (node == dest) return d;\\n if (vis.find(node) != vis.end()) continue;\\n else vis.insert(node);\\n for (auto& i : ed2[node]) {\\n if (d + i.second < dist[i.first]) {\\n dist[i.first] = d + i.second;\\n pq.push({ dist[i.first], i.first });\\n }\\n }\\n }\\n\\n return -1;\\n}\\n\\nint main(void) {\\n string src, dest;\\n int n, m, cap, x;\\n while (1) {\\n scanf(\\\"%d %d %d\\\", &n, &m, &cap);\\n if (n == 0 && m == 0 && cap == 0) break;\\n else cap *= 10;\\n scanf(\\\"%s %s\\\", buff1, buff2);\\n src = buff1, dest = buff2;\\n for (int i = 0; i < n; i++) {\\n scanf(\\\"%s %s %d\\\", buff1, buff2, &x);\\n if (ed.find(buff1) == ed.end()) ed.insert({ buff1, {{buff2, x}} });\\n else ed[buff1].push_back({ buff2, x });\\n if (ed.find(buff2) == ed.end()) ed.insert({ buff2, {{buff1, x}} });\\n else ed[buff2].push_back({ buff1, x });\\n if (city.find(buff1) == city.end()) city.insert(buff1);\\n if (city.find(buff2) == city.end()) city.insert(buff2);\\n }\\n for (int i = 0; i < m; i++) {\\n scanf(\\\"%s\\\", buff1);\\n lpg.insert(buff1);\\n }\\n lpg.insert(src);\\n lpg.insert(dest);\\n for (auto& i : lpg) {\\n dijk(i, i, cap);\\n }\\n printf(\\\"%d\\\\n\\\", dijk2(src, dest));\\n\\n\\n city.clear();\\n lpg.clear();\\n dist.clear();\\n vis.clear();\\n ed.clear();\\n ed2.clear();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 9008,\n \"score_of_the_acc\": -0.3222,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1318_6176860\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int inf = 1 << 30;\\n\\nstruct abc{\\n string a;\\n string b;\\n int c;\\n};\\n\\nstruct nc{\\n int npos;\\n int c;\\n};\\n\\nstruct HQ{\\n int d;\\n int pos;\\n int cap;\\n \\n bool operator<(const HQ& right) const{\\n return d > right.d;\\n }\\n};\\n\\nint main(void){\\n int n, m, cap;\\n while(1){\\n cin >> n >> m >> cap;\\n if(n == 0) break;\\n string s, g;\\n cin >> s >> g;\\n set<string> city;\\n city.insert(s);\\n city.insert(g);\\n vector<abc> E(n);\\n for(int i = 0; i < n; i++){\\n cin >> E[i].a >> E[i].b >> E[i].c;\\n city.insert(E[i].a);\\n city.insert(E[i].b);\\n }\\n map<string, int> mp;\\n int x = 0;\\n for(auto c: city){\\n mp[c] = x;\\n x++;\\n }\\n set<int> se;\\n for(int i = 0; i < m; i++){\\n string tmp;\\n cin >> tmp;\\n se.insert(mp[tmp]);\\n }\\n int ss = mp[s];\\n int gg = mp[g];\\n se.insert(gg);\\n int l = city.size();\\n vector<vector<nc>> edges(l, vector<nc>());\\n for(auto tmp: E){\\n edges[mp[tmp.a]].push_back({mp[tmp.b], tmp.c});\\n edges[mp[tmp.b]].push_back({mp[tmp.a], tmp.c});\\n }\\n cap *= 10;\\n vector<vector<int>> dist(l, vector<int>(cap + 1, inf));\\n dist[ss][cap] = 0;\\n priority_queue<HQ> hq;\\n hq.push({0, ss, cap});\\n int d, pos, cc, npos, c, nc, nd;\\n while(!hq.empty()){\\n auto tmp = hq.top();\\n d = tmp.d;\\n pos = tmp.pos;\\n cc = tmp.cap;\\n hq.pop();\\n if(se.count(pos) && cc != cap){\\n if(dist[pos][cap] > d){\\n dist[pos][cap] = d;\\n hq.push({d, pos, cap});\\n }\\n continue;\\n }\\n \\n for(auto tmp2: edges[pos]){\\n npos = tmp2.npos;\\n c = tmp2.c;\\n if(c > cc) continue;\\n nc = cc - c;\\n nd = d + c;\\n if(dist[npos][nc] > nd){\\n dist[npos][nc] = nd;\\n hq.push({nd, npos, nc});\\n }\\n }\\n }\\n if(dist[gg][cap] == inf) cout << \\\"-1\\\\n\\\";\\n else cout << dist[gg][cap] << \\\"\\\\n\\\";\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 52472,\n \"score_of_the_acc\": -0.619,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":768,"cells":{"group_id":{"kind":"string","value":"aoj_1317_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nWeaker than Planned\nThe committee members of the Kitoshima programming contest had decided to use crypto-graphic software for their secret communication. They had asked a company, Kodai Software,\nto develop cryptographic software that employed a cipher based on highly sophisticated mathematics.\nAccording to reports on IT projects, many projects are not delivered on time, on budget, with\nrequired features and functions. This applied to this case. Kodai Software failed to implement\nthe cipher by the appointed date of delivery, and asked to use a simpler version that employed\na type of substitution cipher for the moment. The committee members got angry and strongly\nrequested to deliver the full specification product, but they unwillingly decided to use this inferior\nproduct for the moment.\nIn what follows, we call the text before encryption, plaintext, and the text after encryption,\nciphertext\n.\nThis simple cipher substitutes letters in the plaintext, and its substitution rule is specified with\na set of pairs. A pair consists of two letters and is unordered, that is, the order of the letters\nin the pair does not matter. A pair (A, B) and a pair (B, A) have the same meaning. In one\nsubstitution rule, one letter can appear in at most one single pair. When a letter in a pair\nappears in the plaintext, the letter is replaced with the other letter in the pair. Letters not\nspecified in any pairs are left as they are.\nFor example, by substituting the plaintext\nABCDEFGHIJKLMNOPQRSTUVWXYZ\nwith the substitution rule {(A, Z), (B, Y)} results in the following ciphertext.\nZYCDEFGHIJKLMNOPQRSTUVWXBA\nThis may be a big chance for us, because the substitution rule seems weak against cracking.\nWe may be able to know communications between committee members. The mission here is to\ndevelop a deciphering program that finds the plaintext messages from given ciphertext messages.\nA ciphertext message is composed of one or more ciphertext words. A ciphertext word is\ngenerated from a plaintext word with a substitution rule. You have a list of candidate words \ncontaining the words that can appear in the plaintext; no other words may appear. Some words\nin the list may not actually be used in the plaintext.\nThere always exists at least one sequence of candidate words from which the given ciphertext\nis obtained by some substitution rule. There may be cases where it is impossible to uniquely\nidentify the plaintext from a given ciphertext and the list of candidate words.\nInput\nThe input consists of multiple datasets, each of which contains a ciphertext message and a list\nof candidate words in the following format.\nn\nword\n1\n.\n.\n.\nword\nn\nsequence\nn\nin the first line is a positive integer, representing the number of candidate words. Each of the\nnext\nn\nlines represents one of the candidate words. The last line, sequence, is a sequence of one\nor more ciphertext words separated by a single space and terminated with a period.\nYou may assume the number of characters in each\nsequ\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1317_7228208","code_snippet":"#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\ntemplate <class T = int>\nusing V = vector<T>;\n\n\n#define repname(a, b, c, d, ...) d\n#define rep(...) repname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i, l, r) for(int i = (l); i < (r); i++)\n#define REP1(i, x) REP2(i, 0, x)\n#define REP0(x) REP1(SPJ, x)\n#define all(v) (v).begin(), (v).end()\n#define sz(v) (int)(v).size()\n\nconstexpr int inf = 1e9;\nconstexpr ll INF = 1e18;\n\ntemplate <class T>\nbool chmin(T &a, const T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T b) {\n\treturn a < b ? a = b, 1 : 0;\n}\n\nvoid solve(int n) {\n\tvector<string> w(n), c;\n\trep(i, n) {\n\t\tcin >> w[i];\n\t}\n\twhile(1) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tc.push_back(s);\n\t\tif(c.back().back() == '.') {\n\t\t\tc.back().pop_back();\n\t\t\tbreak;\n\t\t}\n\t}\n\tint m = sz(c);\n\tvector<vector<string>> lef(21), rig(21);\n\trep(i, n) lef[sz(w[i])].push_back(w[i]);\n\trep(i, m) rig[sz(c[i])].push_back(c[i]);\n\n\n\tvector<vi> res;\n\tauto dfs = [&](auto dfs, vi &used, vi &f) -> void {\n\t\tif(sz(res) > 1) return;\n\t\tint mx = -1, nx = -1;\n\t\trep(i, m) {\n\t\t\tif(used[i]) continue;\n\t\t\tset<char> st;\n\t\t\trep(j, sz(c[i])) {\n\t\t\t\tif(f[c[i][j] - 'A'] == -1) {\n\t\t\t\t\tst.insert(c[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(chmax(mx, sz(st))) {\n\t\t\t\tnx = i;\n\t\t\t}\n\t\t}\n\t\tif(nx == -1) {\n\t\t\tres.push_back(f);\n\t\t\treturn;\n\t\t}\n\t\tauto str = c[nx];\n\t\trep(j, sz(lef[sz(str)])) {\n\t\t\tif(sz(res) > 1) return;\n\t\t\tbool ok = 1;\n\t\t\tauto nf = f;\n\t\t\trep(k, sz(str)) {\n\t\t\t\tauto L = lef[sz(str)][j][k] - 'A';\n\t\t\t\tauto R = str[k] - 'A';\n\t\t\t\tif(nf[L] != -1 and nf[L] != R) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(nf[R] != -1 and nf[R] != L) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tnf[R] = L;\n\t\t\t\tnf[L] = R;\n\t\t\t}\n\t\t\tif(ok) {\n\t\t\t\tauto nu = used;\n\t\t\t\tnu[nx] = 1;\n\t\t\t\tdfs(dfs, nu, nf);\n\t\t\t}\n\t\t}\n\t\treturn;\n\t};\n\n\tvi f(26, -1), used(m);\n\n\tdfs(dfs, used, f);\n\n\tif(sz(res) > 1) {\n\t\tcout << \"-.\\n\";\n\t\treturn;\n\t}\n\tf = res[0];\n\trep(i, m) {\n\t\trep(j, sz(c[i])) {\n\t\t\tauto C = c[i][j] - 'A';\n\t\t\tc[i][j] = 'A' + f[C];\n\t\t}\n\t\tcout << c[i];\n\t\tif(i != m - 1)\n\t\t\tcout << ' ';\n\t\telse\n\t\t\tcout << \".\\n\";\n\t}\n}\n\nint main() {\n\tint n;\n\twhile(cin >> n, n) solve(n);\n}","accuracy":1,"time_ms":7740,"memory_kb":3320,"score_of_the_acc":-1.3226,"final_rank":19},{"submission_id":"aoj_1317_7221184","code_snippet":"#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\ntemplate <class T = int>\nusing V = vector<T>;\n\n\n#define repname(a, b, c, d, ...) d\n#define rep(...) repname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i, l, r) for(int i = (l); i < (r); i++)\n#define REP1(i, x) REP2(i, 0, x)\n#define REP0(x) REP1(SPJ, x)\n#define all(v) (v).begin(), (v).end()\n#define sz(v) (int)(v).size()\n\nconstexpr int inf = 1e9;\nconstexpr ll INF = 1e18;\n\ntemplate <class T>\nbool chmin(T &a, const T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T b) {\n\treturn a < b ? a = b, 1 : 0;\n}\n\nvoid solve(int n) {\n\tvector<string> w(n), c;\n\trep(i, n) {\n\t\tcin >> w[i];\n\t}\n\twhile(1) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tc.push_back(s);\n\t\tif(c.back().back() == '.') {\n\t\t\tc.back().pop_back();\n\t\t\tbreak;\n\t\t}\n\t}\n\tint m = sz(c);\n\tvector<vector<string>> lef(21), rig(21);\n\trep(i, n) lef[sz(w[i])].push_back(w[i]);\n\trep(i, m) rig[sz(c[i])].push_back(c[i]);\n\n\n\tvector<vi> res;\n\tauto dfs = [&](auto dfs, vi &used, vi &f) -> void {\n\t\tif(sz(res) > 1) return;\n\t\tint mx = -1, nx = -1;\n\t\trep(i, m) {\n\t\t\tif(used[i]) continue;\n\t\t\tset<char> st;\n\t\t\trep(j, sz(c[i])) {\n\t\t\t\tif(f[c[i][j] - 'A'] == -1) {\n\t\t\t\t\tst.insert(c[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(chmax(mx, sz(st))) {\n\t\t\t\tnx = i;\n\t\t\t}\n\t\t}\n\t\tif(nx == -1) {\n\t\t\tres.push_back(f);\n\t\t\treturn;\n\t\t}\n\t\tauto str = c[nx];\n\t\trep(j, sz(lef[sz(str)])) {\n\t\t\tif(sz(res) > 1) return;\n\t\t\tbool ok = 1;\n\t\t\tauto nf = f;\n\t\t\trep(k, sz(str)) {\n\t\t\t\tauto L = lef[sz(str)][j][k] - 'A';\n\t\t\t\tauto R = str[k] - 'A';\n\t\t\t\tif(nf[L] != -1 and nf[L] != R) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(nf[R] != -1 and nf[R] != L) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tnf[R] = L;\n\t\t\t\tnf[L] = R;\n\t\t\t}\n\t\t\tif(ok) {\n\t\t\t\tauto nu = used;\n\t\t\t\tnu[nx] = 1;\n\t\t\t\tdfs(dfs, nu, nf);\n\t\t\t}\n\t\t}\n\t\treturn;\n\t};\n\n\tvi f(26, -1), used(m);\n\n\tdfs(dfs, used, f);\n\n\tif(sz(res) > 1) {\n\t\tcout << \"-.\\n\";\n\t\treturn;\n\t}\n\tf = res[0];\n\trep(i, m) {\n\t\trep(j, sz(c[i])) {\n\t\t\tauto C = c[i][j] - 'A';\n\t\t\tc[i][j] = 'A' + f[C];\n\t\t}\n\t\tcout << c[i];\n\t\tif(i != m - 1)\n\t\t\tcout << ' ';\n\t\telse\n\t\t\tcout << \".\\n\";\n\t}\n}\n\nint main() {\n\tint n;\n\twhile(cin >> n, n) solve(n);\n}","accuracy":1,"time_ms":7700,"memory_kb":3392,"score_of_the_acc":-1.3276,"final_rank":20},{"submission_id":"aoj_1317_6774206","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=65;\nconst ll INF=1LL<<62;\n\nvector<string> S,T,use;\nvector<int> syuS,syuT;\nvector<int> pos[MAX];\nvector<string> now,ans;\nmap<char,char> dic;\nbool two=false;\nint rem;\n\nvoid solve(int u){\n if(two) return;\n \n if(si(S)-u<rem) return;\n \n if(u==si(S)){\n for(auto a:now){\n if(si(a)==0) return;\n }\n if(si(ans)){\n two=true;\n }else{\n ans=now;\n }\n \n return;\n }\n \n for(int i=0;i<si(use);i++){\n if(syuS[u]<syuT[i]&&si(now[pos[i][0]])==0) return;\n }\n \n for(int i=0;i<si(use);i++){\n if(si(S[u])!=si(use[i])) continue;\n if(syuS[u]!=syuT[i]) continue;\n if(si(now[pos[i][0]])) continue;\n map<char,char> MA;\n bool ok=true;\n for(int j=0;j<si(S[u]);j++){\n if(MA.count(S[u][j])){\n if(MA[S[u][j]]!=use[i][j]) ok=false;\n }\n if(dic.count(S[u][j])){\n if(dic[S[u][j]]!=use[i][j]) ok=false;\n }else{\n MA[S[u][j]]=use[i][j];\n }\n \n if(MA.count(use[i][j])){\n if(MA[use[i][j]]!=S[u][j]) ok=false;\n }\n if(dic.count(use[i][j])){\n if(dic[use[i][j]]!=S[u][j]) ok=false;\n }else{\n MA[use[i][j]]=S[u][j];\n }\n \n if(!ok) break;\n }\n if(!ok) continue;\n \n //cout<<u<<\" \"<<i<<endl;\n \n for(auto x:MA){\n assert(!dic.count(x.fi));\n dic[x.fi]=x.se;\n //cout<<x.fi<<\" \"<<x.se<<endl;\n }\n \n for(int k:pos[i]){\n now[k]=S[u];\n }\n rem--;\n solve(u+1);\n rem++;\n for(int k:pos[i]){\n now[k]=\"\";\n }\n \n for(auto x:MA){\n dic.erase(x.fi);\n }\n }\n \n solve(u+1);\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N;cin>>N;\n if(N==0) break;\n S.clear();S.resize(N);\n for(int i=0;i<N;i++) cin>>S[i];\n cin.ignore();\n string U;\n getline(cin,U);\n T.clear();T.push_back(\"\");\n for(char c:U){\n if(c==' '){\n T.push_back(\"\");\n }else if('A'<=c&&c<='Z'){\n T.back()+=c;\n }\n }\n \n use=T;\n sort(all(use));\n use.erase(unique(all(use)),use.end());\n \n for(int i=0;i<MAX;i++) pos[i].clear();\n for(int i=0;i<si(T);i++){\n for(int j=0;j<si(use);j++){\n if(T[i]==use[j]) pos[j].push_back(i);\n }\n }\n \n rem=si(use);\n \n sort(all(S),[](auto a,auto b){\n set<char> c1,c2;\n for(char c:a) c1.insert(c);\n for(char c:b) c2.insert(c);\n return si(c1)>si(c2);\n });\n \n two=false;\n ans.clear();\n now.clear();now.resize(si(T));\n dic.clear();\n \n syuS.clear();\n syuT.clear();\n for(int i=0;i<si(S);i++){\n set<char> c1;\n for(char c:S[i]) c1.insert(c);\n syuS.push_back(si(c1));\n }\n for(int i=0;i<si(use);i++){\n set<char> c1;\n for(char c:use[i]) c1.insert(c);\n syuT.push_back(si(c1));\n }\n \n solve(0);\n \n if(two) cout<<\"-.\\n\";\n else{\n for(int i=0;i<si(ans);i++){\n if(i) cout<<\" \";\n cout<<ans[i];\n }\n cout<<\".\\n\";\n }\n \n /*\n for(auto a:S) cout<<a<<\" \";\n cout<<endl;\n for(auto a:use) cout<<a<<\" \";\n cout<<endl;\n for(auto a:T) cout<<a<<\" \";\n cout<<endl;\n for(int a:syuS) cout<<a<<\" \";\n cout<<endl;\n for(int a:syuT) cout<<a<<\" \";\n cout<<endl;\n for(int i=0;i<si(use);i++){\n for(int a:pos[i]) cout<<a<<\" \";\n cout<<endl;\n }\n */\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3332,"score_of_the_acc":-0.3424,"final_rank":14},{"submission_id":"aoj_1317_6390650","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\n#include<complex>\n#include<numeric>\n#include<functional>\n#include<unordered_map>\n#include<unordered_set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,LL> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++){\n if(i)os<<\" \";\n os<<v1[i];\n }\n return os;\n}\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\n os<<p.first<<\" \"<<p.second;\n return os;\n}\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++)is>>v1[i];\n return is;\n}\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\n is>>p.first>>p.second;\n return is;\n}\n\nnamespace sol{\n const int N=26;\n vector<int> vt;\n vector<string> v1,v2;\n vector<char> used;\n vector<int> used2;\n\n bool check(string sa,string sb,int p){\n if(sa.size()!=sb.size())return false;\n for(int i=0;i<sa.size();i++){\n int a=sa[i]-'A',b=sb[i]-'A';\n if(vt[a]==-1 && vt[b]==-1){\n vt[a]=b,vt[b]=a;\n used2[a]=p,used2[b]=p;\n }\n if(vt[a]!=b || vt[b]!=a)return false;\n }\n return true;\n }\n\n void check_rev(int p){\n for(int i=0;i<N;i++){\n if(used2[i]==p)used2[i]=-1,vt[i]=-1;\n }\n }\n\n int dfs(int pos,int max_cnt){\n if(pos==v2.size())return 1;\n int s=0;\n for(int i=0;i<v1.size();i++){\n if(used[i])continue;\n if(!check(v1[i],v2[pos],pos)){\n check_rev(pos);\n continue;\n }\n s+=dfs(pos+1,max_cnt);\n if(s>=max_cnt)return s;\n check_rev(pos);\n }\n return s;\n }\n\n void solve(){\n int n,m;\n int i,j,k;\n int a,b,c;\n while(cin>>n){\n if(n==0)return;\n v1.resize(n);\n cin>>v1;\n string sa,sb;\n vector<int> va;\n vector<string> vs;\n bool flag=false;\n v2.clear();\n while(cin>>sa){\n if(sa.back()=='.'){\n sa.pop_back();\n flag=true;\n }\n vs.push_back(sa);\n for(j=0;j<v2.size();j++){\n if(v2[j]==sa){\n break;\n }\n }\n if(j==v2.size())v2.push_back(sa);\n if(flag)break;\n }\n auto cnt=[](string s1){\n vector<char> v(N,0);\n int s=0;\n for(int i=0;i<s1.size();i++){\n int a=s1[i]-'A';\n if(!v[a])v[a]=1,s++;\n }\n return s;\n };\n sort(v2.begin(),v2.end(),[&](string s1,string s2){\n return cnt(s1)>cnt(s2);\n });\n used.assign(v1.size(),0);\n used2.assign(N,-1);\n vt.assign(N,-1);\n a=dfs(0,2);\n if(a>=2){\n cout<<\"-.\"<<endl;\n continue;\n }\n dfs(0,1);\n for(auto& s:vs){\n for(auto& ca:s){\n a=ca-'A';\n ca='A'+vt[a];\n }\n }\n cout<<vs<<\".\"<<endl;\n }\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n sol::solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.3328,"final_rank":13},{"submission_id":"aoj_1317_5452988","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 1;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nint n;\nvoid solve() {\n\tvector<string> s(n);\n\trep(i, n)cin >> s[i];\n\tvector<string> t;\n\twhile (true) {\n\t\tstring x; cin >> x;\n\t\tif (x.back() == '.') {\n\t\t\tx.pop_back();\n\t\t\tt.push_back(x); break;\n\t\t}\n\t\tt.push_back(x);\n\t}\n\tauto calc = [&](int i, int j)->vector<int> {\n\t\tvector<int> res(26, -1);\n\t\trep(c, s[j].size()) {\n\t\t\tres[s[j][c] - 'A'] = t[i][c] - 'A';\n\t\t\tres[t[i][c] - 'A'] = s[j][c] - 'A';\n\t\t}\n\t\treturn res;\n\t};\n\tint m = t.size();\n\tvector<vector<vector<int>>> b;\n\tb.resize(m);\n\trep(i, m) {\n\t\tb[i].resize(n);\n\t\trep(j, n) {\n\t\t\tb[i][j].resize(m);\n\t\t\tif (s[j].size() != t[i].size())continue;\n\t\t\trep(k, m) {\n\t\t\t\trep(l, n) {\n\t\t\t\t\tbool valid = true;\n\t\t\t\t\tif (t[k].size() != s[l].size())valid = false;\n\t\t\t\t\telse {\n\t\t\t\t\t\tvector<int> vl = calc(i, j);\n\t\t\t\t\t\tvector<int> vr = calc(k, l);\n\t\t\t\t\t\trep(c, 26) {\n\t\t\t\t\t\t\tif (vl[c] >= 0 && vr[c] >= 0 && vl[c] != vr[c])valid = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (valid)b[i][j][k] |= (1 << l);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<int> ori(m);\n\trep(i, m)rep(j, n) {\n\t\tbool valid = true;\n\t\tif (t[i].size() != s[j].size())valid = false;\n\t\telse {\n\t\t\tint alf[26]; rep(c, 26)alf[c] = -1;\n\t\t\trep(c, t[i].size()) {\n\t\t\t\tint a = s[j][c] - 'A';\n\t\t\t\tint b = t[i][c] - 'A';\n\t\t\t\tif (alf[a] >= 0 && alf[a] != b)valid = false;\n\t\t\t\tif (alf[b] >= 0 && alf[b] != a)valid = false;\n\t\t\t\talf[a] = b; alf[b] = a;\n\t\t\t}\n\t\t}\n\t\tif (valid)ori[i] |= (1 << j);\n\t}\n\tvector<int> cur;\n\tstring ans;\n\tfunction<bool(vector<int>, int)> dfs = [&](vector<int> vs, int dep)->bool {\n\t\tif (dep == m) {\n\t\t\tif (ans.empty()) {\n\t\t\t\trep(i, m) {\n\t\t\t\t\tif (i > 0)ans.push_back(' ');\n\t\t\t\t\tans += s[cur[i]];\n\t\t\t\t\tif (i == m - 1)ans.push_back('.');\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans = \"-.\";\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\trep(i, n) {\n\t\t\t\tif (vs[dep] & (1 << i)) {\n\t\t\t\t\tvector<int> cop = vs;\n\t\t\t\t\tbool valid = true;\n\t\t\t\t\tfor (int j = dep + 1; j < m; j++) {\n\t\t\t\t\t\tcop[j] &= b[dep][i][j];\n\t\t\t\t\t\tif (cop[j] == 0)valid = false;\n\t\t\t\t\t}\n\t\t\t\t\tif (valid) {\n\t\t\t\t\t\tcur.push_back(i);\n\t\t\t\t\t\tif (dfs(cop, dep + 1))return true;\n\t\t\t\t\t\tcur.pop_back();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t};\n\tdfs(ori, 0);\n\t//cout << \"ans is \";\n\tcout << ans << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(12);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t;rep(i,t)\n\twhile (cin >> n, n) {\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":220,"memory_kb":3632,"score_of_the_acc":-0.3939,"final_rank":15},{"submission_id":"aoj_1317_5068086","code_snippet":"#include<iostream>\n#include<string>\n#include<set>\n#include<algorithm>\nusing namespace std;\n\nint n, m;\nstring words[20], words2[40], words3[40], ans;\nbool same[40], selected[20];\nchar r[26];\n\nint dfs(int x) {\n if (x == m) {\n ans = \"\";\n for (int i = 0; i < m; i++) {\n for (char c : words3[i]) ans += r[c-'A'];\n if (i == m-1) ans += \".\";\n else ans += \" \";\n }\n return 1;\n }\n if (same[x]) return dfs(x+1);\n char copy[26];\n for (int i = 0; i < 26; i++) copy[i] = r[i];\n int counter = 0;\n for (int i = 0; i < n; i++) if (words[i].length() == words2[x].length()) {\n bool ok = true;\n for (int j = 0; j < words[i].length(); j++) {\n if (r[words[i][j]-'A'] != 0 && r[words[i][j]-'A'] != words2[x][j]) {\n ok = false;\n break;\n }\n if (r[words2[x][j]-'A'] != 0 && r[words2[x][j]-'A'] != words[i][j]) {\n ok = false;\n break;\n }\n r[words[i][j]-'A'] = words2[x][j];\n r[words2[x][j]-'A'] = words[i][j];\n }\n if (ok) {\n selected[i] = true;\n if (x >= 2) {\n for (int p = x+1; p < m; p++) {\n bool ok2 = true;\n for (int k = 0; k < n; k++) if (!selected[k] && words[k].length() == words2[p].length()) {\n bool tmp = true;\n for (int j = 0; j < words[k].length(); j++) {\n if (r[words[k][j]-'A'] != 0 && r[words[k][j]-'A'] != words2[p][j]) {\n tmp = false;\n break;\n }\n if (r[words2[p][j]-'A'] != 0 && r[words2[p][j]-'A'] != words[k][j]) {\n tmp = false;\n break;\n }\n }\n if (tmp) {\n ok2 = true;\n break;\n }\n }\n if (!ok2) {\n ok = false;\n break;\n }\n }\n }\n counter += dfs(x+1);\n if (counter >= 2) break;\n selected[i] = false;\n }\n for (int j = 0; j < 26; j++) r[j] = copy[j];\n }\n for (int j = 0; j < 26; j++) r[j] = copy[j];\n return counter;\n}\n\nbool comp(const string& a, const string& b) {\n set<char> as, bs;\n for (char x : a) as.insert(x);\n for (char x : b) bs.insert(x);\n return as.size() > bs.size();\n}\n\nint main() {\n while (cin >> n, n) {\n for (int i = 0; i < n; i++) cin >> words[i];\n for (m = 0;; m++) {\n cin >> words2[m];\n if (words2[m][words2[m].length() - 1] == '.') {\n words2[m] = words2[m].substr(0, words2[m].length() - 1);\n m++;\n break;\n }\n }\n for (int i = 0; i < m; i++) words3[i] = words2[i];\n sort(words2, words2 + m, comp);\n for (int i = 0; i < m; i++) {\n same[i] = false;\n for (int j = 0; j < i; j++) if (words2[i] == words2[j]) {\n same[i] = true;\n break;\n }\n }\n if (dfs(0) >= 2) cout << \"-.\" << endl;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3000,"score_of_the_acc":-0.2772,"final_rank":7},{"submission_id":"aoj_1317_3655967","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while(cin >> n, n) {\n vector<string> ws(n);\n for(auto& w : ws) cin >> w;\n vector<string> ss = {\"\"};\n while(cin >> ss.back()) {\n if(ss.back().back() == '.') break;\n ss.push_back(\"\");\n }\n ss.back().pop_back(); // period\n const int ss_sz = [&] () { // unique\n set<string> sss(ss.begin(), ss.end());\n return sss.size();\n }();\n\n // long string has strong constraints\n sort(begin(ws), end(ws), [] (string s1, string s2) {\n set<char> ss1(begin(s1), end(s1));\n set<char> ss2(begin(s2), end(s2));\n return make_pair(s1.size(), ss1.size()) > make_pair(s2.size(), ss2.size());\n });\n\n vector<char> m(26, '*'); // map\n vector<int> mcnt(26);\n auto conv = [&] (string s) {\n for(auto& c : s) {\n c = m[c - 'A'];\n }\n return s;\n };\n string ans;\n function<void(int, int)> dfs = [&] (int i, int remain) {\n if(ans == \"-.\") return;\n if(i == n) {\n string tans = conv(ss[0]);\n for(int j = 1; j < (int)ss.size(); ++j) {\n tans += \" \" + conv(ss[j]);\n }\n tans += \".\";\n if(tans.find('*') != string::npos) {\n return;\n } else if(!ans.empty() && ans != tans) {\n ans = \"-.\";\n } else {\n ans = tans;\n }\n return;\n }\n if(n - i - 1 >= remain) {\n dfs(i + 1, remain); // no use\n }\n const auto& w = ws[i];\n for(auto const& s : ss) {\n if(s.size() != w.size()) continue;\n int it = 0;\n for(; it < (int)w.size(); ++it) {\n if((m[s[it] - 'A'] == w[it] && m[w[it] - 'A'] == s[it]) || (m[s[it] - 'A'] == '*' && m[w[it] - 'A'] == '*')) {\n m[s[it] - 'A'] = w[it];\n m[w[it] - 'A'] = s[it];\n ++mcnt[s[it] - 'A'];\n ++mcnt[w[it] - 'A'];\n } else {\n break;\n }\n }\n if(it == (int)w.size()) { // ok\n dfs(i + 1, remain - 1);\n }\n for(int j = 0; j < it; ++j) { // restore\n --mcnt[s[j] - 'A'];\n --mcnt[w[j] - 'A'];\n if(mcnt[s[j] - 'A'] == 0) {\n m[s[j] - 'A'] = m[w[j] - 'A'] = '*';\n }\n }\n }\n };\n dfs(0, ss_sz);\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1010,"memory_kb":3228,"score_of_the_acc":-0.4389,"final_rank":16},{"submission_id":"aoj_1317_3158931","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<char, char> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcountll\n\n#define INF 1e16\n#define mod 1000000007\n\nint n,m;\nstring w[20];\nvector<string> s;\nvector<int> ord;\nint res=0;\nset<P> role[2];\nbool used[26];\nint ccnt[100];\n\nvoid dfs(int i){\n if(i==m){\n res++;\n if(res<2){\n role[res]=role[res-1];\n }\n return ;\n }\n int j=ord[i];\n rep(k,n){\n if(w[k].size()>s[j].size())break;\n if(s[j].size()!=w[k].size())continue;\n bool ok=true;\n vector<P> add;\n rep(l,s[j].size()){\n char c1=s[j][l],c2=w[k][l];\n if(used[c1-'A']!=used[c2-'A']){\n ok=false; break;\n }\n if(used[c1-'A']&&used[c2-'A']&&role[res].find(P(c1,c2))==role[res].end()){\n ok=false; break;\n }\n if(role[res].find(P(c1,c2))==role[res].end()){\n role[res].insert(P(c1,c2)); role[res].insert(P(c2,c1));\n used[c1-'A']=used[c2-'A']=true;\n add.push_back(P(c1,c2));\n }\n }\n if(!ok){\n rep(l,add.size()){\n role[res].erase(P(add[l].fi,add[l].se));\n role[res].erase(P(add[l].se,add[l].fi));\n used[add[l].fi-'A']=false; used[add[l].se-'A']=false;\n }\n continue;\n }\n dfs(i+1);\n if(res==2)return;\n rep(l,add.size()){\n role[res].erase(P(add[l].fi,add[l].se));\n role[res].erase(P(add[l].se,add[l].fi));\n used[add[l].fi-'A']=false; used[add[l].se-'A']=false;\n }\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n while(1){\n cin>>n;\n if(n==0)break;\n s.clear();\n m=0; ord.clear();\n rep(i,n)cin>>w[i];\n sort(w,w+n,[](const string& a,const string& b){ return a.size() < b.size(); });\n while(1){\n ord.push_back(m++);\n string tmp;\n cin>>tmp;\n if(tmp[tmp.size()-1]=='.'){\n s.push_back(tmp.substr(0,tmp.size()-1));\n break;\n }\n s.push_back(tmp);\n }\n rep(i,m){\n set<char> st;\n rep(j,s[i].size())st.insert(s[i][j]);\n ccnt[i]=st.size();\n }\n sort(all(ord),[=](const int& a,const int& b){ return ccnt[a] > ccnt[b]; });\n res=0;\n rep(i,2)role[i].clear();\n memset(used,0,sizeof(used));\n dfs(0);\n if(res==2)cout<<\"-.\"<<endl;\n else{\n string ans=s[0];\n repl(i,1,m)ans+=\" \"+s[i];\n ans+=\".\";\n rep(i,ans.size()){\n for(P p : role[0]){\n if(ans[i]==p.fi){\n ans[i]=p.se;\n break;\n }\n }\n }\n cout<<ans<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3176,"score_of_the_acc":-0.3022,"final_rank":10},{"submission_id":"aoj_1317_2461570","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint n;\nvector<string> w,v;\nvector<string> xyz[30];\nstring s;\nvector<char> vc,ans;\ntypedef pair<int,int> P;\nvector<P> vp;\nvector<int> used;\nint valid;\nvector<int> wc1,wc2;\nvoid dfs(){\n for(int i=0;i<(int)v.size();i++){\n string& t=v[i];\n bool flg=0;\n for(int j=0;j<(int)xyz[t.size()].size();j++){\n string& u=xyz[t.size()][j];\n bool ok=1;\n for(int k=0;k<(int)t.size();k++){\n if(!used[t[k]-'A']) continue;\n if(!used[u[k]-'A']){\n ok=0;\n break;\n }\n ok&=vc[t[k]-'A']==u[k]-'A';\n if(!ok) break;\n }\n //cout<<t<<\" \"<<u<<\":\"<<ok<<endl;\n if(ok){\n flg=1;\n break;\n }\n }\n if(!flg) return;\n }\n int cnt=0;\n for(int i=0;i<26;i++) if(used[vp[i].second]) cnt++;\n //cout<<cnt<<endl;\n //if(cnt>1) return;\n if(cnt==26){\n valid++;\n ans=vc;\n return;\n }\n int x=0;\n while(used[vp[x].second]) x++;\n //cout<<x<<endl;\n if(vp[x].first){\n for(int k=0;k<26;k++){\n if(used[vp[k].second]) continue;\n used[vp[x].second]=used[vp[k].second]=1;\n vc[vp[x].second]=vp[k].second;\n vc[vp[k].second]=vp[x].second;\n //cout<<x<<\" \"<<k<<endl;\n //cout<<(char)(vp[x].second+'A')<<\"<->\"<<(char)(vp[k].second+'A')<<endl;\n dfs();\n if(valid>1) return; \n used[vp[x].second]=used[vp[k].second]=0;\n vc[vp[x].second]=vc[vp[k].second]=0; \n }\n }else{\n used[vp[x].second]=1;\n vc[vp[x].second]=vp[x].second;\n dfs();\n used[vp[x].second]=0;\n vc[vp[x].second]=0;\n }\n}\nsigned main(){\n while(cin>>n,n){\n for(int i=0;i<30;i++) xyz[i].clear(); \n w.resize(n);\n for(int i=0;i<n;i++) cin>>w[i],xyz[w[i].size()].push_back(w[i]);\n cin.ignore();\n getline(cin,s);\n assert(s.back()=='.');\n s.pop_back();\n v.clear();\n for(int i=0;i<(int)s.size();i++){\n string t;\n while(i<(int)s.size()&&s[i]!=' ') t+=s[i++];\n //cout<<t<<endl;\n v.push_back(t);\n }\n vc.clear();\n vc.resize(26,0);\n wc2.clear();\n wc2.resize(26,0);\n for(int i=0;i<(int)v.size();i++)\n for(int j=0;j<(int)v[i].size();j++)\n wc2[v[i][j]-'A']++;\n vp.resize(26);\n for(int i=0;i<26;i++) vp[i]=P(wc2[i],i);\n sort(vp.rbegin(),vp.rend());\n used.clear();\n used.resize(26,0);\n valid=0;\n dfs();\n //cout<<valid<<endl;\n if(valid!=1){\n cout<<\"-.\"<<endl;\n continue;\n }\n //puts(\"found\");\n for(int i=0;i<(int)v.size();i++){\n if(i) cout<<\" \";\n for(int j=0;j<(int)v[i].size();j++){\n //cout<<v[i][j]-'A'<<endl;\n cout<<(char)(ans[v[i][j]-'A']+'A');\n }\n }\n cout<<\".\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3164,"score_of_the_acc":-0.3005,"final_rank":9},{"submission_id":"aoj_1317_2461536","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint n;\nvector<string> w,v;\nvector<string> xyz[30];\nstring s;\nvector<char> vc,ans;\ntypedef pair<int,int> P;\nvector<P> vp;\nvector<int> used;\nint valid;\nvector<int> wc1,wc2;\nvoid dfs(){\n for(int i=0;i<(int)v.size();i++){\n string& t=v[i];\n bool flg=0;\n for(int j=0;j<(int)xyz[t.size()].size();j++){\n string& u=xyz[t.size()][j];\n bool ok=1;\n for(int k=0;k<(int)t.size();k++){\n\tif(!used[t[k]-'A']) continue;\n\tif(!used[u[k]-'A']){\n\t ok=0;\n\t break;\n\t}\n\tok&=vc[t[k]-'A']==u[k]-'A';\n\tif(!ok) break;\n }\n //cout<<t<<\" \"<<u<<\":\"<<ok<<endl;\n if(ok){\n\tflg=1;\n\tbreak;\n }\n }\n if(!flg) return;\n }\n int cnt=0;\n for(int i=0;i<26;i++) if(used[vp[i].second]) cnt++;\n //cout<<cnt<<endl;\n //if(cnt>1) return;\n if(cnt==26){\n valid++;\n ans=vc;\n return;\n }\n int x=0;\n while(used[vp[x].second]) x++;\n //cout<<x<<endl;\n if(vp[x].first){\n for(int k=0;k<26;k++){\n if(used[vp[k].second]) continue;\n used[vp[x].second]=used[vp[k].second]=1;\n vc[vp[x].second]=vp[k].second;\n vc[vp[k].second]=vp[x].second;\n //cout<<x<<\" \"<<k<<endl;\n //cout<<(char)(vp[x].second+'A')<<\"<->\"<<(char)(vp[k].second+'A')<<endl;\n dfs();\n if(valid>1) return; \n used[vp[x].second]=used[vp[k].second]=0;\n vc[vp[x].second]=vc[vp[k].second]=0; \n }\n }else{\n used[vp[x].second]=1;\n vc[vp[x].second]=vp[x].second;\n dfs();\n used[vp[x].second]=0;\n vc[vp[x].second]=0;\n }\n}\nsigned main(){\n while(cin>>n,n){\n for(int i=0;i<30;i++) xyz[i].clear(); \n w.resize(n);\n for(int i=0;i<n;i++) cin>>w[i],xyz[w[i].size()].push_back(w[i]);\n cin.ignore();\n getline(cin,s);\n assert(s.back()=='.');\n s.pop_back();\n v.clear();\n for(int i=0;i<(int)s.size();i++){\n string t;\n while(i<(int)s.size()&&s[i]!=' ') t+=s[i++];\n //cout<<t<<endl;\n v.push_back(t);\n }\n vc.clear();\n vc.resize(26,0);\n wc2.clear();\n wc2.resize(26,0);\n for(int i=0;i<(int)v.size();i++)\n for(int j=0;j<(int)v[i].size();j++)\n\twc2[v[i][j]-'A']++;\n vp.resize(26);\n for(int i=0;i<26;i++) vp[i]=P(wc2[i],i);\n sort(vp.rbegin(),vp.rend());\n used.clear();\n used.resize(26,0);\n valid=0;\n dfs();\n //cout<<valid<<endl;\n if(valid!=1){\n cout<<\"-.\"<<endl;\n continue;\n }\n //puts(\"found\");\n for(int i=0;i<(int)v.size();i++){\n if(i) cout<<\" \";\n for(int j=0;j<(int)v[i].size();j++){\n\t//cout<<v[i][j]-'A'<<endl;\n\tcout<<(char)(ans[v[i][j]-'A']+'A');\n }\n }\n cout<<\".\"<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3180,"score_of_the_acc":-0.3027,"final_rank":11},{"submission_id":"aoj_1317_2290534","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n\nint n;\nvector<string> word;\nvector<string> seq;\nmap<char, int> mp;\nmap<char, char> conv;\nvector< pair<int, char> > ord;\nstring ans;\nint num;\n\nbool check() {\n rep(i, seq.size()) {\n bool flag = false;\n rep(j, word.size()) {\n if(word[j].size() != seq[i].size()) continue;\n bool flag2 = true;\n rep(k, seq[i].size()) {\n\tif(conv[seq[i][k]] == '$') continue;\n\tif(conv[seq[i][k]] != word[j][k]) flag2 = false;\n }\n if(flag2) flag = true;\n }\n if(!flag) return false;\n }\n return true;\n}\n\nvoid dfs(int idx) {\n //for(auto p : conv) {\n //cout << p.first << \" \" << p.second << endl;\n //}\n //cout << check() << endl; \n if(!check()) return;\n if(idx == ord.size()) {\n string tmp = \"\";\n rep(i, seq.size()) {\n if(i) tmp += \" \";\n rep(j, seq[i].size()) {\n\ttmp += conv[seq[i][j]];\n }\n }\n ans = tmp;\n num++;\n return;\n }\n if(conv[ord[idx].second] != '$') {\n dfs(idx+1);\n return;\n }\n ///cout << ord[idx].second << endl;\n rep(i, 26) {\n if(conv[(char)('A'+i)] != '$') continue;\n conv[ord[idx].second] = (char)('A'+i);\n conv[(char)('A'+i)] = ord[idx].second;\n dfs(idx+1);\n if(num > 1) return;\n conv[ord[idx].second] = '$';\n conv[(char)('A'+i)] = '$';\n }\n}\n\nsigned main(){\n while(cin >> n, n) {\n word.clear();\n word.resize(n);\n rep(i, n) cin >> word[i];\n seq.clear();\n while(1) {\n string s;\n cin >> s;\n seq.push_back(s);\n if(s.back() == '.') {\n\tseq[seq.size()-1].pop_back();\n\tbreak;\n }\n }\n ord.clear();\n mp.clear();\n conv.clear();\n rep(i, seq.size()) rep(j, seq[i].size()) {\n if(seq[i][j] == '.') continue;\n mp[seq[i][j]]++;\n }\n for(auto p : mp) {\n ord.push_back(make_pair(p.second, p.first));\n }\n sort(ord.begin(), ord.end(), greater<pair<int, int> >());\n ans = \"-\"; \n rep(i, 26) conv[(char)('A'+i)] = '$';\n conv['.'] = '.';\n num = 0;\n dfs(0);\n //cout << num << endl;\n if(num != 1) ans = \"-\";\n cout << ans + \".\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3196,"score_of_the_acc":-0.314,"final_rank":12},{"submission_id":"aoj_1317_2123640","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<int,string> PP;\n\nset<string> se;\nmap<string,int> m;\nvector<PP> a;\nvector<string> v;\nint ans[26],u[26],uu[100],n,c;\n\nvoid dfs(int k) {\n if(k==a.size()||c>1) {\n for(int i=0; i<26; i++) {\n if(u[i]==-1) continue;\n if(u[u[i]]!=i) return;\n }\n c++;\n for(int i=0; i<26; i++) ans[i]=u[i];\n return;\n }\n string r=a[k].second;\n for(int i=0; i<n; i++) {\n string t=v[i];\n if(uu[i]||r.size()!=t.size()) continue;\n for(int j=0; j<t.size(); j++) {\n if(u[t[j]-'A']!=-1&&u[t[j]-'A']!=r[j]-'A') goto next;\n if(u[r[j]-'A']!=-1&&u[r[j]-'A']!=t[j]-'A') goto next;\n }\n int u2[26];\n for(int j=0; j<26; j++) u2[j]=u[j];\n for(int j=0; j<t.size(); j++) {\n u[t[j]-'A']=r[j]-'A';\n u[r[j]-'A']=t[j]-'A';\n }\n uu[i]=1;\n dfs(k+1);\n uu[i]=0;\n for(int j=0; j<26; j++) u[j]=u2[j];\n next:;\n }\n}\nstring s;\n\nint main() {\n while(cin >> n && n) {\n se.clear();a.clear();m.clear();v.clear();\n for(int i=0; i<n; i++) {\n cin >> s;\n v.push_back(s);\n se.insert(s);\n }\n getline(cin,s);\n getline(cin,s);\n stringstream ss;\n ss << s;\n string r;\n while(ss>>r) {\n if(r[r.size()-1]=='.') r=r.substr(0,r.size()-1);\n m[r]++;\n }\n for(map<string,int>::iterator it=m.begin();it!=m.end();it++) {\n int d[26],cnt=0;memset(d,0,sizeof(d));\n r=it->first;\n for(int i=0; i<r.size(); i++) d[r[i]-'A']++;\n for(int i=0; i<26; i++) if(d[i]) cnt++;\n a.push_back(PP(cnt,it->first));\n }\n sort(a.begin(),a.end(),greater<PP>());\n memset(u,-1,sizeof(u));\n memset(uu,0,sizeof(uu));\n c=0;\n dfs(0);\n if(c==1) {\n for(int i=0; i<s.size(); i++) {\n if(isalpha(s[i])) cout << (char)(ans[s[i]-'A']+'A');\n else cout << s[i];\n }\n cout << endl;\n } else cout << \"-.\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.2976,"final_rank":8},{"submission_id":"aoj_1317_1563938","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<utility>\n#include<algorithm>\n\nusing namespace std;\n\nint ord(char c){\n return c-'A';\n}\n\nvector<pair<char,char> > rec(vector<string> seq,vector<string> word,vector<pair<char,char> > rules,int u){\n if(seq.empty())return rules;\n int mx=-1,x;\n for(int i=0;i<seq.size();i++){\n int t=u;\n int cu=0;\n for(auto e:seq[i]){\n int xx=e-'A';\n if(!(t>>xx&1)){\n\tcu++;\n\tt|=1<<xx;\n }\n }\n if(cu>mx){\n mx=cu;\n x=i;\n }\n }\n vector<pair<char,char> > res;\n for(int j=0;j<word.size();j++){\n auto e=word[j];\n if(seq[x].size()!=e.size())continue;\n vector<pair<char,char> > nr=rules;\n int nu=u;\n for(int i=0;i<e.size();i++){\n int sr=nu>>ord(seq[x][i])&1;\n int wr=nu>>ord(e[i])&1;\n if(sr^wr)goto next;\n if(!sr){\n\tnu|=1<<ord(seq[x][i])|1<<ord(e[i]);\n\tchar l=seq[x][i],h=e[i];\n\tif(h<l){\n\t swap(l,h);\n\t}\n\tnr.emplace_back(l,h);\n }else{\n\tchar l=min(seq[x][i],e[i]);\n\tchar h=max(seq[x][i],e[i]);\n\tif(find(begin(nr),end(nr),make_pair(l,h))==end(nr))goto next;\n }\n }\n {\n vector<string> nseq(begin(seq),begin(seq)+x),nword(begin(word),begin(word)+j);\n nseq.insert(end(nseq),begin(seq)+x+1,end(seq));\n nword.insert(end(nword),begin(word)+j+1,end(word));\n auto r=rec(nseq,nword,nr,nu);\n if(!res.empty()&&!r.empty())throw 0;\n if(!r.empty()){\n\tres=r;\n }\n }\n next:\n ;\n }\n return res;\n}\n\nint main(){\n for(int n;cin>>n,n;){\n vector<string> word(n);\n for(int i=0;i<n;i++){\n cin>>word[i];\n }\n vector<string> seq;\n for(string s;;){\n cin>>s;\n if(s.back()!='.'){\n\tseq.push_back(s);\n }else{\n\tseq.push_back(s.substr(0,s.size()-1));\n\tbreak;\n }\n }\n vector<string> useq=seq,uword=word;\n sort(begin(useq),end(useq));\n sort(begin(uword),end(uword));\n useq.erase(unique(begin(useq),end(useq)),end(useq));\n uword.erase(unique(begin(uword),end(uword)),end(uword));\n try{\n auto r=rec(useq,word,{},0);\n char table[256];\n for(auto e:r){\n\ttable[e.first]=e.second;\n\ttable[e.second]=e.first;\n }\n bool ns=false;\n for(auto e:seq){\n\tif(ns++){\n\t cout<<' ';\n\t}\n\tfor(auto f:e){\n\t cout<<table[f];\n\t}\n }\n cout<<'.'<<endl;\n }catch(...){\n cout<<\"-.\"<<endl;\n }\n }\n}","accuracy":1,"time_ms":5600,"memory_kb":1332,"score_of_the_acc":-0.764,"final_rank":17},{"submission_id":"aoj_1317_1487088","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define fs first\n#define sc second\n#define pb push_back\n#define show(x) cout << #x << \" \" << x << endl\ntypedef pair<string,int> Psi;\ntypedef vector<int> Vi;\nint N;\nvector<string> ss,words[21];\nvector<Psi> vpsi;\nVi ans;\nbool app[26];\nvoid init(){\n\tans.clear();\n\tss.clear();\n\trep(i,21) words[i].clear();\n\tvpsi.clear();\n\trep(i,26) app[i]=0;\n}\nconst bool lencomp(Psi x,Psi y){\n\tstring s=x.fs,t=y.fs;\n\tbool a[26]={},b[26]={};\n\trep(i,s.size()) a[s[i]-'A']=1;\n\trep(i,t.size()) b[t[i]-'A']=1;\n\tint c=0,d=0;\n\trep(i,26) if(a[i]) c++;\n\trep(i,26) if(b[i]) d++;\n\treturn c>d;\n}\ninline bool eq(Vi& a,Vi& b){\n\trep(i,26) if(app[i]&&a[i]!=b[i]) return 0;\n\treturn 1;\n}\nbool dfs(int x,Vi vi){\n\tif(x==ss.size()){\n\t\tif(!ans.empty()&&!eq(ans,vi)) return false;\n\t\tans=vi;\n\t\treturn true;\n\t}\n\tstring s=ss[x];\n\tint L=s.size();\n\tfor(string w:words[L]){\n\t\tVi nvi=vi;\n\t\tbool ok=1;\n\t\trep(i,L){\n\t\t\tif(nvi[s[i]-'A']>=0&&nvi[s[i]-'A']+'A'!=w[i]){\n\t\t\t\tok=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(nvi[w[i]-'A']>=0&&nvi[w[i]-'A']+'A'!=s[i]){\n\t\t\t\tok=0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tnvi[s[i]-'A']=w[i]-'A';\n\t\t\tnvi[w[i]-'A']=s[i]-'A';\n\t\t}\n\t\tif(!ok) continue;\n\t\tif(!dfs(x+1,nvi)) return false;\n\t}\n\treturn true;\n}\nint main(){\n\twhile(true){\n\t\tcin>>N;\n\t\tif(N==0) break;\n\t\tinit();\n\t\trep(i,N){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\twords[s.size()].pb(s);\n\t\t}\n\t\tint I=0;\n\t\twhile(true){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\trep(i,s.size()) if(s[i]!='.') app[s[i]-'A']=1;\n\t\t\tif(s.back()=='.'){\n\t\t\t\tvpsi.pb(Psi(s.substr(0,s.size()-1),I++));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tvpsi.pb(Psi(s,I++));\n\t\t}\n\t\tsort(all(vpsi),lencomp);\n\t\tfor(Psi psi:vpsi) ss.pb(psi.fs);\n\t\tif(dfs(0,Vi(26,-1))&&!ans.empty()){\n\t\t\tvector<string> vst(ss.size());\n\t\t\trep(i,ss.size()) vst[vpsi[i].sc]=ss[i];\n\t\t\trep(i,vst.size()){\n\t\t\t\trep(j,vst[i].size()){\n\t\t\t\t\tcout<<(char)(ans[vst[i][j]-'A']+'A');\n\t\t\t\t}\n\t\t\t\tcout<<(i+1==vst.size()?\".\\n\":\" \");\n\t\t\t}\n\t\t}else{\n\t\t\tputs(\"-.\");\n\t\t}\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":1240,"score_of_the_acc":-0.0291,"final_rank":1},{"submission_id":"aoj_1317_1411895","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MAXN = 21;\nint N;\nstring word[MAXN];\nstring line;\nvector<string> V;\nvector<int> F;\nmap<char, char> ans;\n\nbool ok(const string &x, const string &w, map<char, char> m) {\n if(x.size() != w.size()) return false;\n for(int i = 0; i < x.size(); ++i) {\n if(m.count(x[i]) && m[x[i]] != w[i]) return false;\n if(m.count(w[i]) && m[w[i]] != x[i]) return false;\n m[x[i]] = w[i];\n m[w[i]] = x[i];\n }\n return true;\n}\n\nvoid reg(const string &x, const string &w, map<char, char> &m) {\n for(int i = 0; i < x.size(); ++i) {\n m[x[i]] = w[i];\n m[w[i]] = x[i];\n }\n}\n\nbool update(int k, map<char, char> m) {\n F = vector<int>(V.size());\n for(int i = k; i < V.size(); ++i) {\n for(int j = 0; j < N; ++j) {\n if(ok(V[i], word[j], m)) {\n F[i] |= 1 << j;\n }\n }\n if(!F[i]) return false;\n }\n return true;\n}\n\nvoid rec(int k, map<char, char> m) {\n if(k == V.size()) {\n if(ans.size()) throw 0;\n ans = m;\n return;\n }\n for(int i = 0; i < N; ++i) {\n if(F[k] >> i & 1); else continue;\n map<char, char> nm = m;\n reg(V[k], word[i], nm);\n vector<int> undo = F;\n if(update(k+1, nm)) {\n rec(k+1, nm);\n }\n F = undo;\n }\n}\n\nint main() {\n while(cin >> N && N) {\n for(int i = 0; i < N; ++i) {\n cin >> word[i];\n }\n cin.ignore();\n getline(cin, line);\n stringstream ss(line.substr(0, line.size()-1));\n set<string> ws;\n for(string s; ss >> s; ) ws.insert(s);\n V.clear();\n for(set<string>::iterator it = ws.begin();\n it != ws.end(); ++it) {\n V.push_back(*it);\n }\n update(0, map<char, char>());\n ans = map<char, char>();\n try {\n rec(0, map<char, char>());\n if(ans.empty()) throw 0;\n for(int i = 0; i < line.size(); ++i) {\n if(isalpha(line[i])) cout << ans[line[i]];\n else cout << line[i];\n }\n cout << endl;\n } catch(...) {\n cout << \"-.\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":1368,"score_of_the_acc":-0.0705,"final_rank":5},{"submission_id":"aoj_1317_1097826","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a); i<(b); ++i)\n#define REP(i,n) FOR(i,0,n)\n\nvs dfs(vs &words,vs &c_words,map<char,char> &m,int cur,vs &orig_c_words){\n vs ret;\n if(cur==orig_c_words.size()){\n REP(i,orig_c_words.size()){\n string s;\n REP(j,orig_c_words[i].size()){\n s.push_back(m[orig_c_words[i][j]]);\n }\n ret.push_back(s);\n }\n return ret;\n }\n\n REP(i,words.size()){\n if(words[i].size()==c_words[cur].size()){\n map<char,char> nm(m);\n bool ok=true;\n REP(j,words[i].size()){\n map<char,char>::iterator it_i=nm.find(words[i][j]);\n map<char,char>::iterator it_c=nm.find(c_words[cur][j]);\n bool ei=it_i!=nm.end();\n bool ec=it_c!=nm.end();\n if(ei&&ec){\n if(it_i->second!=c_words[cur][j]||it_c->second!=words[i][j]){\n ok=false;\n break;\n }\n }else if(ei||ec){\n ok=false;\n break;\n }else{\n nm[words[i][j]]=c_words[cur][j];\n nm[c_words[cur][j]]=words[i][j];\n }\n }\n if(ok){\n //cerr<<\"cur:\"<<cur<<endl;\n vs res=dfs(words,c_words,nm,cur+1,orig_c_words);\n //cerr<<\"res:\"<<res.size()<<endl;\n if(res.size()>0){\n if(res.size()==100){\n return vs(100);\n }\n if(ret.size()){\n return vs(100);\n }else{\n ret=res;\n }\n }\n }\n }\n }\n return ret;\n\n}\nbool pred(const string &l,const string &r){\n if(l.size()==r.size()){\n return l>r;\n }else{\n return l.size()>r.size();\n }\n}\nint main(){\n int n;\n while(cin>>n,n){\n vs words(n);\n REP(i,n){\n cin>>words[i];\n }\n string sequence;\n getline(cin,sequence);\n getline(cin,sequence);\n vs c_words;\n int prev=0;\n REP(i,sequence.size()){\n switch(sequence[i]){\n case ' ':\n case '.':\n c_words.push_back(sequence.substr(prev,i-prev));\n prev=i+1;\n break;\n }\n }\n vs orig_c_words(c_words);\n sort(ALL(c_words),pred);\n map<char,char> m;\n vs res=dfs(words,c_words,m,0,orig_c_words);\n if(res.size()&&res.size()<100){\n REP(i,res.size()){\n cout<<res[i]<<(i<res.size()-1?\" \":\"\");\n }\n cout<<\".\"<<endl;\n }else{\n cout<<\"-.\"<<endl;\n }\n }\n}","accuracy":1,"time_ms":160,"memory_kb":1280,"score_of_the_acc":-0.0529,"final_rank":4},{"submission_id":"aoj_1317_1091493","code_snippet":"#include <algorithm>\n#include <array>\n#include <cstdlib>\n#include <functional>\n#include <iostream>\n#include <sstream>\n#include <vector>\nusing namespace std;\n\nconstexpr int MAX_M = 50;\nconstexpr int MAX_LENGTH = 20;\n\nint n, m;\nstring target;\nvector<string> candidates[MAX_LENGTH + 1];\npair<int, string> words[MAX_M];\nvector<char> assign(128, -1);\n\nint cnt;\n\nbool dfs(int idx = 0) {\n\tif(idx == m) {\n\t\tif(++cnt == 1) {\n\t\t\tfor(auto &c : target) {\n\t\t\t\tif(c != ' ') c = assign[c];\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tconst auto &s = words[idx].second;\n\n\tfor(const auto &t : candidates[s.size()]) {\n\t\tauto tmp(assign);\n\n\t\tfor(int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\t\tif(!(tmp[s[i]] == t[i] || (tmp[s[i]] == -1 && tmp[t[i]] == -1))) {\n\t\t\t\tgoto next;\n\t\t\t}\n\n\t\t\ttmp[s[i]] = t[i];\n\t\t\ttmp[t[i]] = s[i];\n\t\t}\n\n\t\tassign.swap(tmp);\n\t\tif(!dfs(idx + 1)) return false;\n\t\tassign = move(tmp);\n\t\t\n\tnext:;\n\t}\n\n\treturn true;\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\twhile(cin >> n && n) {\n\t\tfor_each(begin(candidates), end(candidates), [](vector<string> &v) { v.clear(); });\n\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tstring in;\n\t\t\tcin >> in;\n\n\t\t\tconst int len = in.size();\n\t\t\tcandidates[len].emplace_back(move(in));\n\t\t}\n\n\t\tcin.ignore();\n\t\tgetline(cin, target);\n\t\ttarget = target.substr(0, target.size() - 1);\n\n\t\t{\n\t\t\tstring in;\n\t\t\tistringstream iss(target);\n\n\t\t\tfor(m = 0; iss >> in; ++m) {\n\t\t\t\twords[m].second = in;\n\t\t\t\tin.erase(unique(in.begin(), in.end()), in.end());\n\t\t\t\twords[m].first = in.size();\n\t\t\t}\n\t\t}\n\n\t\tsort(words, words + m, greater<pair<int, string>>());\n\n\t\tcnt = 0;\n\t\tfill(begin(assign), end(assign), -1);\n\t\tdfs();\n\n\t\tcout << (cnt == 1 ? target : \"-\") << \".\\n\";\n\t}\n\n\treturn EXIT_SUCCESS;\n}","accuracy":1,"time_ms":20,"memory_kb":1260,"score_of_the_acc":-0.0319,"final_rank":2},{"submission_id":"aoj_1317_930173","code_snippet":"#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nconst int IINF = INT_MAX;\n\nint n,found,len;\nvector<string> buf[30],seq;\nstring tmp,sequence,answer;\nchar transfer[26];\n\nbool comp(const string& a,const string& b) {\n set<char> A,B;\n rep(i,a.size()) A.insert(a[i]);\n rep(i,b.size()) B.insert(b[i]);\n return A.size() > B.size();\n}\n\nvoid dfs(int cur){\n\n if( found >= 2 ) return;\n\n if( cur >= len ){\n ++found;\n rep(i,answer.size()) if( isupper(answer[i]) ) answer[i] = transfer[answer[i]-'A'];\n return;\n }\n\n int word_size = seq[cur].size();\n\n rep(i,(int)buf[word_size].size()){\n string word = buf[word_size][i];\n\n int *backtrack = new int[word_size+1];\n backtrack[0] = -1; // sentinel\n bool error = false;\n rep(j,word_size){\n if( transfer[word[j]-'A'] == '?' && transfer[seq[cur][j]-'A'] == '?' ) {\n backtrack[j] = 1, backtrack[j+1] = -1;\n transfer[word[j]-'A'] = seq[cur][j];\n transfer[seq[cur][j]-'A'] = word[j];\n } else if( transfer[word[j]-'A'] == seq[cur][j] && transfer[seq[cur][j]-'A'] == word[j] ) {\n backtrack[j] = 0;\n } else {\n backtrack[j] = -1;\n error = true;\n break;\n }\n }\n\n if( !error ) dfs( cur+1 );\n\n int j = 0;\n while( backtrack[j] != -1 && j < word_size) {\n if( backtrack[j] == 1 ) transfer[word[j]-'A'] = transfer[seq[cur][j]-'A'] = '?';\n ++j;\n }\n\n }\n\n}\n\nint main(){\n while( cin >> n, n ){\n seq.clear();\n rep(i,30) buf[i].clear();\n rep(i,n) {\n cin >> tmp;\n buf[(int)tmp.size()].push_back(tmp);\n }\n cin.ignore();\n getline(cin,sequence);\n stringstream ss(sequence.substr(0,(int)sequence.size()-1));\n while( !( ss >> tmp ).fail() ) seq.push_back(tmp);\n sort(seq.begin(),seq.end(),comp);\n\n answer = sequence;\n found = 0, len = (int)seq.size();\n rep(i,26) transfer[i] = '?';\n dfs(0);\n\n cout << ((found==1)?answer:\"-.\") << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":8100,"score_of_the_acc":-1.0026,"final_rank":18},{"submission_id":"aoj_1317_800555","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nchar w1[22][110];\nchar w2[44][110];\nint w1_cnt, w2_cnt;\nint cw[28];\nint aw[28];\nbool ok[44][22];\nint ok_cnt[44];\nbool vis[44];\nint ans;\n\nbool cal_ok(int i, int j) {\n if (strlen(w2[i]) != strlen(w1[j])) return false;\n int tw[28];\n memcpy(tw, cw, sizeof(tw));\n for (int k = 0; w2[i][k]; k++) {\n int c = w2[i][k] - 'A';\n int d = w1[j][k] - 'A';\n if (tw[c] != -1 && tw[c] != w1[j][k]) return false;\n if (tw[d] != -1 && tw[d] != w2[i][k]) return false;\n tw[c] = w1[j][k];\n tw[d] = w2[i][k];\n }\n return true;\n}\nvoid get_ok() {\n memset(ok, 0, sizeof(ok));\n for (int i = 0; i < w2_cnt; i++)\n for (int j = 0; j < w1_cnt; j++) {\n ok[i][j] = cal_ok(i, j);\n if (ok[i][j]) ok_cnt[i]++;\n }\n}\nvoid print_ok() {\n\tfor (int i = 0; i < w2_cnt; i++) {\n\t\tfor (int j = 0; j < w1_cnt; j++) {\n\t\t\tprintf(\"%d \", ok[i][j]);\n\t\t}\n\t\tputs(\"\");\n\t}\n}\n\nint find() {\n int p = -1;\n for (int i = 0; i < w2_cnt; i++) if (!vis[i])\n if (p == -1 || ok_cnt[i] < ok_cnt[p]) p = i;\n return p;\n}\n\nvoid dfs(int u) {\n if (ans > 1) return;\n if (u == -1) {\n ans++;\n memcpy(aw, cw, sizeof(aw));\n return;\n }\n// bool tmp[44][22];\n// int tmp_cnt[44];\n int tw[28];\n// memcpy(tmp, ok, sizeof(tmp));\n// memcpy(tmp_cnt, ok_cnt, sizeof(ok_cnt));\n memcpy(tw, cw, sizeof(tw));\n get_ok();\n for (int i = 0; i < w1_cnt; i++) if (ok[u][i]) {\n vis[u] = true;\n for (int j = 0; w2[u][j]; j++) {\n int c = w2[u][j] - 'A';\n int d = w1[i][j] - 'A';\n cw[c] = w1[i][j];\n cw[d] = w2[u][j];\n }\n dfs(find());\n memcpy(cw, tw, sizeof(tw));\n vis[u] = false;\n get_ok();\n// memcpy(ok_cnt, tmp_cnt, sizeof(tmp_cnt));\n// memcpy(ok, tmp, sizeof(tmp));\n }\n}\n\nvoid work() {\n for (int i = 0; i < w1_cnt; i++)\n scanf(\"%s\", w1[i]);\n w2_cnt = 0;\n while (true) {\n char str[100];\n scanf(\"%s\", str);\n int len = strlen(str);\n if (str[len - 1] == '.') {\n str[--len] = 0;\n strcpy(w2[w2_cnt], str);\n w2_cnt++;\n break;\n } else {\n strcpy(w2[w2_cnt], str);\n w2_cnt++;\n }\n }\n//for (int i = 0; i < w2_cnt; i++) printf(\"%s \", w2[i]); puts(\".....\");\n memset(cw, -1, sizeof(cw));\n get_ok();\n//print_ok();\n memset(vis, 0, sizeof(vis));\n int p = find();\n//printf(\"%d\\n\", p);\n ans = 0;\n dfs(p);\n if (ans > 1) {\n puts(\"-.\");\n return;\n }\n//for (int i = 0; i < 26; i++) printf(\"%d \", aw[i]); puts(\"?\");\n for (int i = 0; i < w2_cnt; i++) {\n for (int j = 0; w2[i][j]; j++) {\n int d = w2[i][j] - 'A';\n printf(\"%c\", aw[d]);\n }\n if (i < w2_cnt - 1) printf(\" \");\n }\n puts(\".\");\n}\n\nint main() {\n while (scanf(\"%d\", &w1_cnt), w1_cnt) {\n work();\n }\n return 0;\n}","accuracy":1,"time_ms":810,"memory_kb":1044,"score_of_the_acc":-0.1035,"final_rank":6},{"submission_id":"aoj_1317_791955","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <cstring>\n#include <sstream>\nusing namespace std;\n\nint n, m;\nstring cand[22];\nvector<string> words;\n\nvector<int> match[82];\nint matchBit[82];\n\nvector<char> ansKey;\nint ansFlg;\n\nbool matches(string a, string b){\n if(a.size() != b.size()) return false;\n char trans[128];\n memset(trans, -1, sizeof(trans));\n for(int i = 0; i < a.size(); i++){\n if(trans[a[i]] != -1 && b[i] != trans[a[i]]) return false;\n if(trans[b[i]] != -1 && a[i] != trans[b[i]]) return false;\n trans[a[i]] = b[i];\n trans[b[i]] = a[i];\n }\n return true;\n}\n\nbool mycmp(const string &a, const string &b){\n set<char> st1;\n for(int i = 0; i < a.size(); i++) st1.insert(a[i]);\n set<char> st2;\n for(int i = 0; i < b.size(); i++) st2.insert(b[i]);\n\n return st1.size() > st2.size();\n}\n\nbool setKey(const string &a, const string &b, vector<char> &key){\n for(int i = 0; i < a.size(); i++){\n if(key[a[i]] != -1 && key[a[i]] != b[i] ||\n key[b[i]] != -1 && key[b[i]] != a[i]){\n return false;\n }\n key[a[i]] = b[i];\n key[b[i]] = a[i];\n }\n return true;\n}\n\nvoid dfs(int idx, int used, vector<char> key){\n if(idx == m){\n if(ansFlg == 1){\n ansFlg = -1;\n }\n else{\n ansFlg = 1;\n ansKey = key;\n }\n return;\n }\n\n for(int i = idx; i < m; i++){\n if((matchBit[i] & used) == matchBit[i]){\n return;\n }\n }\n\n for(int i = 0; i < match[idx].size(); i++){\n int j = match[idx][i];\n if(used & (1 << j)) continue;\n\n vector<char> nextKey = key;\n if(setKey(words[idx], cand[j], nextKey)){\n dfs(idx + 1, used | (1 << j), nextKey);\n if(ansFlg == -1) return;\n }\n }\n}\n\nvoid solve(){\n sort(words.begin(), words.end(), mycmp);\n\n for(int i = 0; i < m; i++){\n match[i].clear();\n matchBit[i] = 0;\n\n for(int j = 0; j < n; j++){\n if(matches(words[i], cand[j])){\n match[i].push_back(j);\n matchBit[i] |= (1 << j);\n }\n }\n }\n\n vector<char> key(128, -1);\n ansFlg = 0;\n dfs(0, 0, key);\n}\n\nint main(){\n while(cin >> n, n){\n for(int i = 0; i < n; i++){\n cin >> cand[i];\n\n for(int j = 0; j < i; j++){\n if(cand[j] == cand[i]){\n i--;\n n--;\n break;\n }\n }\n }\n\n string s;\n getline(cin, s);\n getline(cin, s);\n for(int i = 0; i < s.size(); i++) if(s[i] == '.') s[i] = ' ';\n\n vector<string> raw;\n stringstream ss(s);\n words.clear();\n\n while(ss >> s){\n raw.push_back(s);\n\n bool pushFlg = true;\n for(int i = 0; i < words.size(); i++){\n if(words[i] == s){\n pushFlg = false;\n break;\n }\n }\n if(pushFlg) words.push_back(s);\n }\n m = words.size();\n\n solve();\n\n if(ansFlg == 1){\n for(int i = 0; i < raw.size(); i++){\n if(i != 0) cout << \" \";\n for(int j = 0; j < raw[i].size(); j++){\n cout << ansKey[raw[i][j]];\n }\n }\n cout << \".\" << endl;\n }\n else{\n cout << \"-.\" << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1272,"score_of_the_acc":-0.0323,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1317_7228208\",\n \"code_snippet\": \"#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\ntemplate <class T = int>\\nusing V = vector<T>;\\n\\n\\n#define repname(a, b, c, d, ...) d\\n#define rep(...) repname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i, l, r) for(int i = (l); i < (r); i++)\\n#define REP1(i, x) REP2(i, 0, x)\\n#define REP0(x) REP1(SPJ, x)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(v) (int)(v).size()\\n\\nconstexpr int inf = 1e9;\\nconstexpr ll INF = 1e18;\\n\\ntemplate <class T>\\nbool chmin(T &a, const T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T b) {\\n\\treturn a < b ? a = b, 1 : 0;\\n}\\n\\nvoid solve(int n) {\\n\\tvector<string> w(n), c;\\n\\trep(i, n) {\\n\\t\\tcin >> w[i];\\n\\t}\\n\\twhile(1) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tc.push_back(s);\\n\\t\\tif(c.back().back() == '.') {\\n\\t\\t\\tc.back().pop_back();\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint m = sz(c);\\n\\tvector<vector<string>> lef(21), rig(21);\\n\\trep(i, n) lef[sz(w[i])].push_back(w[i]);\\n\\trep(i, m) rig[sz(c[i])].push_back(c[i]);\\n\\n\\n\\tvector<vi> res;\\n\\tauto dfs = [&](auto dfs, vi &used, vi &f) -> void {\\n\\t\\tif(sz(res) > 1) return;\\n\\t\\tint mx = -1, nx = -1;\\n\\t\\trep(i, m) {\\n\\t\\t\\tif(used[i]) continue;\\n\\t\\t\\tset<char> st;\\n\\t\\t\\trep(j, sz(c[i])) {\\n\\t\\t\\t\\tif(f[c[i][j] - 'A'] == -1) {\\n\\t\\t\\t\\t\\tst.insert(c[i][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(chmax(mx, sz(st))) {\\n\\t\\t\\t\\tnx = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(nx == -1) {\\n\\t\\t\\tres.push_back(f);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tauto str = c[nx];\\n\\t\\trep(j, sz(lef[sz(str)])) {\\n\\t\\t\\tif(sz(res) > 1) return;\\n\\t\\t\\tbool ok = 1;\\n\\t\\t\\tauto nf = f;\\n\\t\\t\\trep(k, sz(str)) {\\n\\t\\t\\t\\tauto L = lef[sz(str)][j][k] - 'A';\\n\\t\\t\\t\\tauto R = str[k] - 'A';\\n\\t\\t\\t\\tif(nf[L] != -1 and nf[L] != R) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(nf[R] != -1 and nf[R] != L) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnf[R] = L;\\n\\t\\t\\t\\tnf[L] = R;\\n\\t\\t\\t}\\n\\t\\t\\tif(ok) {\\n\\t\\t\\t\\tauto nu = used;\\n\\t\\t\\t\\tnu[nx] = 1;\\n\\t\\t\\t\\tdfs(dfs, nu, nf);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\n\\tvi f(26, -1), used(m);\\n\\n\\tdfs(dfs, used, f);\\n\\n\\tif(sz(res) > 1) {\\n\\t\\tcout << \\\"-.\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tf = res[0];\\n\\trep(i, m) {\\n\\t\\trep(j, sz(c[i])) {\\n\\t\\t\\tauto C = c[i][j] - 'A';\\n\\t\\t\\tc[i][j] = 'A' + f[C];\\n\\t\\t}\\n\\t\\tcout << c[i];\\n\\t\\tif(i != m - 1)\\n\\t\\t\\tcout << ' ';\\n\\t\\telse\\n\\t\\t\\tcout << \\\".\\\\n\\\";\\n\\t}\\n}\\n\\nint main() {\\n\\tint n;\\n\\twhile(cin >> n, n) solve(n);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7740,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -1.3226,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1317_7221184\",\n \"code_snippet\": \"#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\ntemplate <class T = int>\\nusing V = vector<T>;\\n\\n\\n#define repname(a, b, c, d, ...) d\\n#define rep(...) repname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i, l, r) for(int i = (l); i < (r); i++)\\n#define REP1(i, x) REP2(i, 0, x)\\n#define REP0(x) REP1(SPJ, x)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(v) (int)(v).size()\\n\\nconstexpr int inf = 1e9;\\nconstexpr ll INF = 1e18;\\n\\ntemplate <class T>\\nbool chmin(T &a, const T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T b) {\\n\\treturn a < b ? a = b, 1 : 0;\\n}\\n\\nvoid solve(int n) {\\n\\tvector<string> w(n), c;\\n\\trep(i, n) {\\n\\t\\tcin >> w[i];\\n\\t}\\n\\twhile(1) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tc.push_back(s);\\n\\t\\tif(c.back().back() == '.') {\\n\\t\\t\\tc.back().pop_back();\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint m = sz(c);\\n\\tvector<vector<string>> lef(21), rig(21);\\n\\trep(i, n) lef[sz(w[i])].push_back(w[i]);\\n\\trep(i, m) rig[sz(c[i])].push_back(c[i]);\\n\\n\\n\\tvector<vi> res;\\n\\tauto dfs = [&](auto dfs, vi &used, vi &f) -> void {\\n\\t\\tif(sz(res) > 1) return;\\n\\t\\tint mx = -1, nx = -1;\\n\\t\\trep(i, m) {\\n\\t\\t\\tif(used[i]) continue;\\n\\t\\t\\tset<char> st;\\n\\t\\t\\trep(j, sz(c[i])) {\\n\\t\\t\\t\\tif(f[c[i][j] - 'A'] == -1) {\\n\\t\\t\\t\\t\\tst.insert(c[i][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(chmax(mx, sz(st))) {\\n\\t\\t\\t\\tnx = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(nx == -1) {\\n\\t\\t\\tres.push_back(f);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tauto str = c[nx];\\n\\t\\trep(j, sz(lef[sz(str)])) {\\n\\t\\t\\tif(sz(res) > 1) return;\\n\\t\\t\\tbool ok = 1;\\n\\t\\t\\tauto nf = f;\\n\\t\\t\\trep(k, sz(str)) {\\n\\t\\t\\t\\tauto L = lef[sz(str)][j][k] - 'A';\\n\\t\\t\\t\\tauto R = str[k] - 'A';\\n\\t\\t\\t\\tif(nf[L] != -1 and nf[L] != R) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(nf[R] != -1 and nf[R] != L) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnf[R] = L;\\n\\t\\t\\t\\tnf[L] = R;\\n\\t\\t\\t}\\n\\t\\t\\tif(ok) {\\n\\t\\t\\t\\tauto nu = used;\\n\\t\\t\\t\\tnu[nx] = 1;\\n\\t\\t\\t\\tdfs(dfs, nu, nf);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\n\\tvi f(26, -1), used(m);\\n\\n\\tdfs(dfs, used, f);\\n\\n\\tif(sz(res) > 1) {\\n\\t\\tcout << \\\"-.\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tf = res[0];\\n\\trep(i, m) {\\n\\t\\trep(j, sz(c[i])) {\\n\\t\\t\\tauto C = c[i][j] - 'A';\\n\\t\\t\\tc[i][j] = 'A' + f[C];\\n\\t\\t}\\n\\t\\tcout << c[i];\\n\\t\\tif(i != m - 1)\\n\\t\\t\\tcout << ' ';\\n\\t\\telse\\n\\t\\t\\tcout << \\\".\\\\n\\\";\\n\\t}\\n}\\n\\nint main() {\\n\\tint n;\\n\\twhile(cin >> n, n) solve(n);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7700,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -1.3276,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1317_6774206\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=65;\\nconst ll INF=1LL<<62;\\n\\nvector<string> S,T,use;\\nvector<int> syuS,syuT;\\nvector<int> pos[MAX];\\nvector<string> now,ans;\\nmap<char,char> dic;\\nbool two=false;\\nint rem;\\n\\nvoid solve(int u){\\n if(two) return;\\n \\n if(si(S)-u<rem) return;\\n \\n if(u==si(S)){\\n for(auto a:now){\\n if(si(a)==0) return;\\n }\\n if(si(ans)){\\n two=true;\\n }else{\\n ans=now;\\n }\\n \\n return;\\n }\\n \\n for(int i=0;i<si(use);i++){\\n if(syuS[u]<syuT[i]&&si(now[pos[i][0]])==0) return;\\n }\\n \\n for(int i=0;i<si(use);i++){\\n if(si(S[u])!=si(use[i])) continue;\\n if(syuS[u]!=syuT[i]) continue;\\n if(si(now[pos[i][0]])) continue;\\n map<char,char> MA;\\n bool ok=true;\\n for(int j=0;j<si(S[u]);j++){\\n if(MA.count(S[u][j])){\\n if(MA[S[u][j]]!=use[i][j]) ok=false;\\n }\\n if(dic.count(S[u][j])){\\n if(dic[S[u][j]]!=use[i][j]) ok=false;\\n }else{\\n MA[S[u][j]]=use[i][j];\\n }\\n \\n if(MA.count(use[i][j])){\\n if(MA[use[i][j]]!=S[u][j]) ok=false;\\n }\\n if(dic.count(use[i][j])){\\n if(dic[use[i][j]]!=S[u][j]) ok=false;\\n }else{\\n MA[use[i][j]]=S[u][j];\\n }\\n \\n if(!ok) break;\\n }\\n if(!ok) continue;\\n \\n //cout<<u<<\\\" \\\"<<i<<endl;\\n \\n for(auto x:MA){\\n assert(!dic.count(x.fi));\\n dic[x.fi]=x.se;\\n //cout<<x.fi<<\\\" \\\"<<x.se<<endl;\\n }\\n \\n for(int k:pos[i]){\\n now[k]=S[u];\\n }\\n rem--;\\n solve(u+1);\\n rem++;\\n for(int k:pos[i]){\\n now[k]=\\\"\\\";\\n }\\n \\n for(auto x:MA){\\n dic.erase(x.fi);\\n }\\n }\\n \\n solve(u+1);\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N;cin>>N;\\n if(N==0) break;\\n S.clear();S.resize(N);\\n for(int i=0;i<N;i++) cin>>S[i];\\n cin.ignore();\\n string U;\\n getline(cin,U);\\n T.clear();T.push_back(\\\"\\\");\\n for(char c:U){\\n if(c==' '){\\n T.push_back(\\\"\\\");\\n }else if('A'<=c&&c<='Z'){\\n T.back()+=c;\\n }\\n }\\n \\n use=T;\\n sort(all(use));\\n use.erase(unique(all(use)),use.end());\\n \\n for(int i=0;i<MAX;i++) pos[i].clear();\\n for(int i=0;i<si(T);i++){\\n for(int j=0;j<si(use);j++){\\n if(T[i]==use[j]) pos[j].push_back(i);\\n }\\n }\\n \\n rem=si(use);\\n \\n sort(all(S),[](auto a,auto b){\\n set<char> c1,c2;\\n for(char c:a) c1.insert(c);\\n for(char c:b) c2.insert(c);\\n return si(c1)>si(c2);\\n });\\n \\n two=false;\\n ans.clear();\\n now.clear();now.resize(si(T));\\n dic.clear();\\n \\n syuS.clear();\\n syuT.clear();\\n for(int i=0;i<si(S);i++){\\n set<char> c1;\\n for(char c:S[i]) c1.insert(c);\\n syuS.push_back(si(c1));\\n }\\n for(int i=0;i<si(use);i++){\\n set<char> c1;\\n for(char c:use[i]) c1.insert(c);\\n syuT.push_back(si(c1));\\n }\\n \\n solve(0);\\n \\n if(two) cout<<\\\"-.\\\\n\\\";\\n else{\\n for(int i=0;i<si(ans);i++){\\n if(i) cout<<\\\" \\\";\\n cout<<ans[i];\\n }\\n cout<<\\\".\\\\n\\\";\\n }\\n \\n /*\\n for(auto a:S) cout<<a<<\\\" \\\";\\n cout<<endl;\\n for(auto a:use) cout<<a<<\\\" \\\";\\n cout<<endl;\\n for(auto a:T) cout<<a<<\\\" \\\";\\n cout<<endl;\\n for(int a:syuS) cout<<a<<\\\" \\\";\\n cout<<endl;\\n for(int a:syuT) cout<<a<<\\\" \\\";\\n cout<<endl;\\n for(int i=0;i<si(use);i++){\\n for(int a:pos[i]) cout<<a<<\\\" \\\";\\n cout<<endl;\\n }\\n */\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.3424,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1317_6390650\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\n#include<complex>\\n#include<numeric>\\n#include<functional>\\n#include<unordered_map>\\n#include<unordered_set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,LL> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++){\\n if(i)os<<\\\" \\\";\\n os<<v1[i];\\n }\\n return os;\\n}\\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\\n os<<p.first<<\\\" \\\"<<p.second;\\n return os;\\n}\\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++)is>>v1[i];\\n return is;\\n}\\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\\n is>>p.first>>p.second;\\n return is;\\n}\\n\\nnamespace sol{\\n const int N=26;\\n vector<int> vt;\\n vector<string> v1,v2;\\n vector<char> used;\\n vector<int> used2;\\n\\n bool check(string sa,string sb,int p){\\n if(sa.size()!=sb.size())return false;\\n for(int i=0;i<sa.size();i++){\\n int a=sa[i]-'A',b=sb[i]-'A';\\n if(vt[a]==-1 && vt[b]==-1){\\n vt[a]=b,vt[b]=a;\\n used2[a]=p,used2[b]=p;\\n }\\n if(vt[a]!=b || vt[b]!=a)return false;\\n }\\n return true;\\n }\\n\\n void check_rev(int p){\\n for(int i=0;i<N;i++){\\n if(used2[i]==p)used2[i]=-1,vt[i]=-1;\\n }\\n }\\n\\n int dfs(int pos,int max_cnt){\\n if(pos==v2.size())return 1;\\n int s=0;\\n for(int i=0;i<v1.size();i++){\\n if(used[i])continue;\\n if(!check(v1[i],v2[pos],pos)){\\n check_rev(pos);\\n continue;\\n }\\n s+=dfs(pos+1,max_cnt);\\n if(s>=max_cnt)return s;\\n check_rev(pos);\\n }\\n return s;\\n }\\n\\n void solve(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n while(cin>>n){\\n if(n==0)return;\\n v1.resize(n);\\n cin>>v1;\\n string sa,sb;\\n vector<int> va;\\n vector<string> vs;\\n bool flag=false;\\n v2.clear();\\n while(cin>>sa){\\n if(sa.back()=='.'){\\n sa.pop_back();\\n flag=true;\\n }\\n vs.push_back(sa);\\n for(j=0;j<v2.size();j++){\\n if(v2[j]==sa){\\n break;\\n }\\n }\\n if(j==v2.size())v2.push_back(sa);\\n if(flag)break;\\n }\\n auto cnt=[](string s1){\\n vector<char> v(N,0);\\n int s=0;\\n for(int i=0;i<s1.size();i++){\\n int a=s1[i]-'A';\\n if(!v[a])v[a]=1,s++;\\n }\\n return s;\\n };\\n sort(v2.begin(),v2.end(),[&](string s1,string s2){\\n return cnt(s1)>cnt(s2);\\n });\\n used.assign(v1.size(),0);\\n used2.assign(N,-1);\\n vt.assign(N,-1);\\n a=dfs(0,2);\\n if(a>=2){\\n cout<<\\\"-.\\\"<<endl;\\n continue;\\n }\\n dfs(0,1);\\n for(auto& s:vs){\\n for(auto& ca:s){\\n a=ca-'A';\\n ca='A'+vt[a];\\n }\\n }\\n cout<<vs<<\\\".\\\"<<endl;\\n }\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n sol::solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.3328,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1317_5452988\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 1;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nint n;\\nvoid solve() {\\n\\tvector<string> s(n);\\n\\trep(i, n)cin >> s[i];\\n\\tvector<string> t;\\n\\twhile (true) {\\n\\t\\tstring x; cin >> x;\\n\\t\\tif (x.back() == '.') {\\n\\t\\t\\tx.pop_back();\\n\\t\\t\\tt.push_back(x); break;\\n\\t\\t}\\n\\t\\tt.push_back(x);\\n\\t}\\n\\tauto calc = [&](int i, int j)->vector<int> {\\n\\t\\tvector<int> res(26, -1);\\n\\t\\trep(c, s[j].size()) {\\n\\t\\t\\tres[s[j][c] - 'A'] = t[i][c] - 'A';\\n\\t\\t\\tres[t[i][c] - 'A'] = s[j][c] - 'A';\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\tint m = t.size();\\n\\tvector<vector<vector<int>>> b;\\n\\tb.resize(m);\\n\\trep(i, m) {\\n\\t\\tb[i].resize(n);\\n\\t\\trep(j, n) {\\n\\t\\t\\tb[i][j].resize(m);\\n\\t\\t\\tif (s[j].size() != t[i].size())continue;\\n\\t\\t\\trep(k, m) {\\n\\t\\t\\t\\trep(l, n) {\\n\\t\\t\\t\\t\\tbool valid = true;\\n\\t\\t\\t\\t\\tif (t[k].size() != s[l].size())valid = false;\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tvector<int> vl = calc(i, j);\\n\\t\\t\\t\\t\\t\\tvector<int> vr = calc(k, l);\\n\\t\\t\\t\\t\\t\\trep(c, 26) {\\n\\t\\t\\t\\t\\t\\t\\tif (vl[c] >= 0 && vr[c] >= 0 && vl[c] != vr[c])valid = false;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (valid)b[i][j][k] |= (1 << l);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<int> ori(m);\\n\\trep(i, m)rep(j, n) {\\n\\t\\tbool valid = true;\\n\\t\\tif (t[i].size() != s[j].size())valid = false;\\n\\t\\telse {\\n\\t\\t\\tint alf[26]; rep(c, 26)alf[c] = -1;\\n\\t\\t\\trep(c, t[i].size()) {\\n\\t\\t\\t\\tint a = s[j][c] - 'A';\\n\\t\\t\\t\\tint b = t[i][c] - 'A';\\n\\t\\t\\t\\tif (alf[a] >= 0 && alf[a] != b)valid = false;\\n\\t\\t\\t\\tif (alf[b] >= 0 && alf[b] != a)valid = false;\\n\\t\\t\\t\\talf[a] = b; alf[b] = a;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (valid)ori[i] |= (1 << j);\\n\\t}\\n\\tvector<int> cur;\\n\\tstring ans;\\n\\tfunction<bool(vector<int>, int)> dfs = [&](vector<int> vs, int dep)->bool {\\n\\t\\tif (dep == m) {\\n\\t\\t\\tif (ans.empty()) {\\n\\t\\t\\t\\trep(i, m) {\\n\\t\\t\\t\\t\\tif (i > 0)ans.push_back(' ');\\n\\t\\t\\t\\t\\tans += s[cur[i]];\\n\\t\\t\\t\\t\\tif (i == m - 1)ans.push_back('.');\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tans = \\\"-.\\\";\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (vs[dep] & (1 << i)) {\\n\\t\\t\\t\\t\\tvector<int> cop = vs;\\n\\t\\t\\t\\t\\tbool valid = true;\\n\\t\\t\\t\\t\\tfor (int j = dep + 1; j < m; j++) {\\n\\t\\t\\t\\t\\t\\tcop[j] &= b[dep][i][j];\\n\\t\\t\\t\\t\\t\\tif (cop[j] == 0)valid = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (valid) {\\n\\t\\t\\t\\t\\t\\tcur.push_back(i);\\n\\t\\t\\t\\t\\t\\tif (dfs(cop, dep + 1))return true;\\n\\t\\t\\t\\t\\t\\tcur.pop_back();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\tdfs(ori, 0);\\n\\t//cout << \\\"ans is \\\";\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(12);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t;rep(i,t)\\n\\twhile (cin >> n, n) {\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.3939,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1317_5068086\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<set>\\n#include<algorithm>\\nusing namespace std;\\n\\nint n, m;\\nstring words[20], words2[40], words3[40], ans;\\nbool same[40], selected[20];\\nchar r[26];\\n\\nint dfs(int x) {\\n if (x == m) {\\n ans = \\\"\\\";\\n for (int i = 0; i < m; i++) {\\n for (char c : words3[i]) ans += r[c-'A'];\\n if (i == m-1) ans += \\\".\\\";\\n else ans += \\\" \\\";\\n }\\n return 1;\\n }\\n if (same[x]) return dfs(x+1);\\n char copy[26];\\n for (int i = 0; i < 26; i++) copy[i] = r[i];\\n int counter = 0;\\n for (int i = 0; i < n; i++) if (words[i].length() == words2[x].length()) {\\n bool ok = true;\\n for (int j = 0; j < words[i].length(); j++) {\\n if (r[words[i][j]-'A'] != 0 && r[words[i][j]-'A'] != words2[x][j]) {\\n ok = false;\\n break;\\n }\\n if (r[words2[x][j]-'A'] != 0 && r[words2[x][j]-'A'] != words[i][j]) {\\n ok = false;\\n break;\\n }\\n r[words[i][j]-'A'] = words2[x][j];\\n r[words2[x][j]-'A'] = words[i][j];\\n }\\n if (ok) {\\n selected[i] = true;\\n if (x >= 2) {\\n for (int p = x+1; p < m; p++) {\\n bool ok2 = true;\\n for (int k = 0; k < n; k++) if (!selected[k] && words[k].length() == words2[p].length()) {\\n bool tmp = true;\\n for (int j = 0; j < words[k].length(); j++) {\\n if (r[words[k][j]-'A'] != 0 && r[words[k][j]-'A'] != words2[p][j]) {\\n tmp = false;\\n break;\\n }\\n if (r[words2[p][j]-'A'] != 0 && r[words2[p][j]-'A'] != words[k][j]) {\\n tmp = false;\\n break;\\n }\\n }\\n if (tmp) {\\n ok2 = true;\\n break;\\n }\\n }\\n if (!ok2) {\\n ok = false;\\n break;\\n }\\n }\\n }\\n counter += dfs(x+1);\\n if (counter >= 2) break;\\n selected[i] = false;\\n }\\n for (int j = 0; j < 26; j++) r[j] = copy[j];\\n }\\n for (int j = 0; j < 26; j++) r[j] = copy[j];\\n return counter;\\n}\\n\\nbool comp(const string& a, const string& b) {\\n set<char> as, bs;\\n for (char x : a) as.insert(x);\\n for (char x : b) bs.insert(x);\\n return as.size() > bs.size();\\n}\\n\\nint main() {\\n while (cin >> n, n) {\\n for (int i = 0; i < n; i++) cin >> words[i];\\n for (m = 0;; m++) {\\n cin >> words2[m];\\n if (words2[m][words2[m].length() - 1] == '.') {\\n words2[m] = words2[m].substr(0, words2[m].length() - 1);\\n m++;\\n break;\\n }\\n }\\n for (int i = 0; i < m; i++) words3[i] = words2[i];\\n sort(words2, words2 + m, comp);\\n for (int i = 0; i < m; i++) {\\n same[i] = false;\\n for (int j = 0; j < i; j++) if (words2[i] == words2[j]) {\\n same[i] = true;\\n break;\\n }\\n }\\n if (dfs(0) >= 2) cout << \\\"-.\\\" << endl;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3000,\n \"score_of_the_acc\": -0.2772,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1317_3655967\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n while(cin >> n, n) {\\n vector<string> ws(n);\\n for(auto& w : ws) cin >> w;\\n vector<string> ss = {\\\"\\\"};\\n while(cin >> ss.back()) {\\n if(ss.back().back() == '.') break;\\n ss.push_back(\\\"\\\");\\n }\\n ss.back().pop_back(); // period\\n const int ss_sz = [&] () { // unique\\n set<string> sss(ss.begin(), ss.end());\\n return sss.size();\\n }();\\n\\n // long string has strong constraints\\n sort(begin(ws), end(ws), [] (string s1, string s2) {\\n set<char> ss1(begin(s1), end(s1));\\n set<char> ss2(begin(s2), end(s2));\\n return make_pair(s1.size(), ss1.size()) > make_pair(s2.size(), ss2.size());\\n });\\n\\n vector<char> m(26, '*'); // map\\n vector<int> mcnt(26);\\n auto conv = [&] (string s) {\\n for(auto& c : s) {\\n c = m[c - 'A'];\\n }\\n return s;\\n };\\n string ans;\\n function<void(int, int)> dfs = [&] (int i, int remain) {\\n if(ans == \\\"-.\\\") return;\\n if(i == n) {\\n string tans = conv(ss[0]);\\n for(int j = 1; j < (int)ss.size(); ++j) {\\n tans += \\\" \\\" + conv(ss[j]);\\n }\\n tans += \\\".\\\";\\n if(tans.find('*') != string::npos) {\\n return;\\n } else if(!ans.empty() && ans != tans) {\\n ans = \\\"-.\\\";\\n } else {\\n ans = tans;\\n }\\n return;\\n }\\n if(n - i - 1 >= remain) {\\n dfs(i + 1, remain); // no use\\n }\\n const auto& w = ws[i];\\n for(auto const& s : ss) {\\n if(s.size() != w.size()) continue;\\n int it = 0;\\n for(; it < (int)w.size(); ++it) {\\n if((m[s[it] - 'A'] == w[it] && m[w[it] - 'A'] == s[it]) || (m[s[it] - 'A'] == '*' && m[w[it] - 'A'] == '*')) {\\n m[s[it] - 'A'] = w[it];\\n m[w[it] - 'A'] = s[it];\\n ++mcnt[s[it] - 'A'];\\n ++mcnt[w[it] - 'A'];\\n } else {\\n break;\\n }\\n }\\n if(it == (int)w.size()) { // ok\\n dfs(i + 1, remain - 1);\\n }\\n for(int j = 0; j < it; ++j) { // restore\\n --mcnt[s[j] - 'A'];\\n --mcnt[w[j] - 'A'];\\n if(mcnt[s[j] - 'A'] == 0) {\\n m[s[j] - 'A'] = m[w[j] - 'A'] = '*';\\n }\\n }\\n }\\n };\\n dfs(0, ss_sz);\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.4389,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1317_3158931\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<char, char> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcountll\\n\\n#define INF 1e16\\n#define mod 1000000007\\n\\nint n,m;\\nstring w[20];\\nvector<string> s;\\nvector<int> ord;\\nint res=0;\\nset<P> role[2];\\nbool used[26];\\nint ccnt[100];\\n\\nvoid dfs(int i){\\n if(i==m){\\n res++;\\n if(res<2){\\n role[res]=role[res-1];\\n }\\n return ;\\n }\\n int j=ord[i];\\n rep(k,n){\\n if(w[k].size()>s[j].size())break;\\n if(s[j].size()!=w[k].size())continue;\\n bool ok=true;\\n vector<P> add;\\n rep(l,s[j].size()){\\n char c1=s[j][l],c2=w[k][l];\\n if(used[c1-'A']!=used[c2-'A']){\\n ok=false; break;\\n }\\n if(used[c1-'A']&&used[c2-'A']&&role[res].find(P(c1,c2))==role[res].end()){\\n ok=false; break;\\n }\\n if(role[res].find(P(c1,c2))==role[res].end()){\\n role[res].insert(P(c1,c2)); role[res].insert(P(c2,c1));\\n used[c1-'A']=used[c2-'A']=true;\\n add.push_back(P(c1,c2));\\n }\\n }\\n if(!ok){\\n rep(l,add.size()){\\n role[res].erase(P(add[l].fi,add[l].se));\\n role[res].erase(P(add[l].se,add[l].fi));\\n used[add[l].fi-'A']=false; used[add[l].se-'A']=false;\\n }\\n continue;\\n }\\n dfs(i+1);\\n if(res==2)return;\\n rep(l,add.size()){\\n role[res].erase(P(add[l].fi,add[l].se));\\n role[res].erase(P(add[l].se,add[l].fi));\\n used[add[l].fi-'A']=false; used[add[l].se-'A']=false;\\n }\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while(1){\\n cin>>n;\\n if(n==0)break;\\n s.clear();\\n m=0; ord.clear();\\n rep(i,n)cin>>w[i];\\n sort(w,w+n,[](const string& a,const string& b){ return a.size() < b.size(); });\\n while(1){\\n ord.push_back(m++);\\n string tmp;\\n cin>>tmp;\\n if(tmp[tmp.size()-1]=='.'){\\n s.push_back(tmp.substr(0,tmp.size()-1));\\n break;\\n }\\n s.push_back(tmp);\\n }\\n rep(i,m){\\n set<char> st;\\n rep(j,s[i].size())st.insert(s[i][j]);\\n ccnt[i]=st.size();\\n }\\n sort(all(ord),[=](const int& a,const int& b){ return ccnt[a] > ccnt[b]; });\\n res=0;\\n rep(i,2)role[i].clear();\\n memset(used,0,sizeof(used));\\n dfs(0);\\n if(res==2)cout<<\\\"-.\\\"<<endl;\\n else{\\n string ans=s[0];\\n repl(i,1,m)ans+=\\\" \\\"+s[i];\\n ans+=\\\".\\\";\\n rep(i,ans.size()){\\n for(P p : role[0]){\\n if(ans[i]==p.fi){\\n ans[i]=p.se;\\n break;\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.3022,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1317_2461570\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint n;\\nvector<string> w,v;\\nvector<string> xyz[30];\\nstring s;\\nvector<char> vc,ans;\\ntypedef pair<int,int> P;\\nvector<P> vp;\\nvector<int> used;\\nint valid;\\nvector<int> wc1,wc2;\\nvoid dfs(){\\n for(int i=0;i<(int)v.size();i++){\\n string& t=v[i];\\n bool flg=0;\\n for(int j=0;j<(int)xyz[t.size()].size();j++){\\n string& u=xyz[t.size()][j];\\n bool ok=1;\\n for(int k=0;k<(int)t.size();k++){\\n if(!used[t[k]-'A']) continue;\\n if(!used[u[k]-'A']){\\n ok=0;\\n break;\\n }\\n ok&=vc[t[k]-'A']==u[k]-'A';\\n if(!ok) break;\\n }\\n //cout<<t<<\\\" \\\"<<u<<\\\":\\\"<<ok<<endl;\\n if(ok){\\n flg=1;\\n break;\\n }\\n }\\n if(!flg) return;\\n }\\n int cnt=0;\\n for(int i=0;i<26;i++) if(used[vp[i].second]) cnt++;\\n //cout<<cnt<<endl;\\n //if(cnt>1) return;\\n if(cnt==26){\\n valid++;\\n ans=vc;\\n return;\\n }\\n int x=0;\\n while(used[vp[x].second]) x++;\\n //cout<<x<<endl;\\n if(vp[x].first){\\n for(int k=0;k<26;k++){\\n if(used[vp[k].second]) continue;\\n used[vp[x].second]=used[vp[k].second]=1;\\n vc[vp[x].second]=vp[k].second;\\n vc[vp[k].second]=vp[x].second;\\n //cout<<x<<\\\" \\\"<<k<<endl;\\n //cout<<(char)(vp[x].second+'A')<<\\\"<->\\\"<<(char)(vp[k].second+'A')<<endl;\\n dfs();\\n if(valid>1) return; \\n used[vp[x].second]=used[vp[k].second]=0;\\n vc[vp[x].second]=vc[vp[k].second]=0; \\n }\\n }else{\\n used[vp[x].second]=1;\\n vc[vp[x].second]=vp[x].second;\\n dfs();\\n used[vp[x].second]=0;\\n vc[vp[x].second]=0;\\n }\\n}\\nsigned main(){\\n while(cin>>n,n){\\n for(int i=0;i<30;i++) xyz[i].clear(); \\n w.resize(n);\\n for(int i=0;i<n;i++) cin>>w[i],xyz[w[i].size()].push_back(w[i]);\\n cin.ignore();\\n getline(cin,s);\\n assert(s.back()=='.');\\n s.pop_back();\\n v.clear();\\n for(int i=0;i<(int)s.size();i++){\\n string t;\\n while(i<(int)s.size()&&s[i]!=' ') t+=s[i++];\\n //cout<<t<<endl;\\n v.push_back(t);\\n }\\n vc.clear();\\n vc.resize(26,0);\\n wc2.clear();\\n wc2.resize(26,0);\\n for(int i=0;i<(int)v.size();i++)\\n for(int j=0;j<(int)v[i].size();j++)\\n wc2[v[i][j]-'A']++;\\n vp.resize(26);\\n for(int i=0;i<26;i++) vp[i]=P(wc2[i],i);\\n sort(vp.rbegin(),vp.rend());\\n used.clear();\\n used.resize(26,0);\\n valid=0;\\n dfs();\\n //cout<<valid<<endl;\\n if(valid!=1){\\n cout<<\\\"-.\\\"<<endl;\\n continue;\\n }\\n //puts(\\\"found\\\");\\n for(int i=0;i<(int)v.size();i++){\\n if(i) cout<<\\\" \\\";\\n for(int j=0;j<(int)v[i].size();j++){\\n //cout<<v[i][j]-'A'<<endl;\\n cout<<(char)(ans[v[i][j]-'A']+'A');\\n }\\n }\\n cout<<\\\".\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.3005,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1317_2461536\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint n;\\nvector<string> w,v;\\nvector<string> xyz[30];\\nstring s;\\nvector<char> vc,ans;\\ntypedef pair<int,int> P;\\nvector<P> vp;\\nvector<int> used;\\nint valid;\\nvector<int> wc1,wc2;\\nvoid dfs(){\\n for(int i=0;i<(int)v.size();i++){\\n string& t=v[i];\\n bool flg=0;\\n for(int j=0;j<(int)xyz[t.size()].size();j++){\\n string& u=xyz[t.size()][j];\\n bool ok=1;\\n for(int k=0;k<(int)t.size();k++){\\n\\tif(!used[t[k]-'A']) continue;\\n\\tif(!used[u[k]-'A']){\\n\\t ok=0;\\n\\t break;\\n\\t}\\n\\tok&=vc[t[k]-'A']==u[k]-'A';\\n\\tif(!ok) break;\\n }\\n //cout<<t<<\\\" \\\"<<u<<\\\":\\\"<<ok<<endl;\\n if(ok){\\n\\tflg=1;\\n\\tbreak;\\n }\\n }\\n if(!flg) return;\\n }\\n int cnt=0;\\n for(int i=0;i<26;i++) if(used[vp[i].second]) cnt++;\\n //cout<<cnt<<endl;\\n //if(cnt>1) return;\\n if(cnt==26){\\n valid++;\\n ans=vc;\\n return;\\n }\\n int x=0;\\n while(used[vp[x].second]) x++;\\n //cout<<x<<endl;\\n if(vp[x].first){\\n for(int k=0;k<26;k++){\\n if(used[vp[k].second]) continue;\\n used[vp[x].second]=used[vp[k].second]=1;\\n vc[vp[x].second]=vp[k].second;\\n vc[vp[k].second]=vp[x].second;\\n //cout<<x<<\\\" \\\"<<k<<endl;\\n //cout<<(char)(vp[x].second+'A')<<\\\"<->\\\"<<(char)(vp[k].second+'A')<<endl;\\n dfs();\\n if(valid>1) return; \\n used[vp[x].second]=used[vp[k].second]=0;\\n vc[vp[x].second]=vc[vp[k].second]=0; \\n }\\n }else{\\n used[vp[x].second]=1;\\n vc[vp[x].second]=vp[x].second;\\n dfs();\\n used[vp[x].second]=0;\\n vc[vp[x].second]=0;\\n }\\n}\\nsigned main(){\\n while(cin>>n,n){\\n for(int i=0;i<30;i++) xyz[i].clear(); \\n w.resize(n);\\n for(int i=0;i<n;i++) cin>>w[i],xyz[w[i].size()].push_back(w[i]);\\n cin.ignore();\\n getline(cin,s);\\n assert(s.back()=='.');\\n s.pop_back();\\n v.clear();\\n for(int i=0;i<(int)s.size();i++){\\n string t;\\n while(i<(int)s.size()&&s[i]!=' ') t+=s[i++];\\n //cout<<t<<endl;\\n v.push_back(t);\\n }\\n vc.clear();\\n vc.resize(26,0);\\n wc2.clear();\\n wc2.resize(26,0);\\n for(int i=0;i<(int)v.size();i++)\\n for(int j=0;j<(int)v[i].size();j++)\\n\\twc2[v[i][j]-'A']++;\\n vp.resize(26);\\n for(int i=0;i<26;i++) vp[i]=P(wc2[i],i);\\n sort(vp.rbegin(),vp.rend());\\n used.clear();\\n used.resize(26,0);\\n valid=0;\\n dfs();\\n //cout<<valid<<endl;\\n if(valid!=1){\\n cout<<\\\"-.\\\"<<endl;\\n continue;\\n }\\n //puts(\\\"found\\\");\\n for(int i=0;i<(int)v.size();i++){\\n if(i) cout<<\\\" \\\";\\n for(int j=0;j<(int)v[i].size();j++){\\n\\t//cout<<v[i][j]-'A'<<endl;\\n\\tcout<<(char)(ans[v[i][j]-'A']+'A');\\n }\\n }\\n cout<<\\\".\\\"<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.3027,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1317_2290534\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n\\nint n;\\nvector<string> word;\\nvector<string> seq;\\nmap<char, int> mp;\\nmap<char, char> conv;\\nvector< pair<int, char> > ord;\\nstring ans;\\nint num;\\n\\nbool check() {\\n rep(i, seq.size()) {\\n bool flag = false;\\n rep(j, word.size()) {\\n if(word[j].size() != seq[i].size()) continue;\\n bool flag2 = true;\\n rep(k, seq[i].size()) {\\n\\tif(conv[seq[i][k]] == '$') continue;\\n\\tif(conv[seq[i][k]] != word[j][k]) flag2 = false;\\n }\\n if(flag2) flag = true;\\n }\\n if(!flag) return false;\\n }\\n return true;\\n}\\n\\nvoid dfs(int idx) {\\n //for(auto p : conv) {\\n //cout << p.first << \\\" \\\" << p.second << endl;\\n //}\\n //cout << check() << endl; \\n if(!check()) return;\\n if(idx == ord.size()) {\\n string tmp = \\\"\\\";\\n rep(i, seq.size()) {\\n if(i) tmp += \\\" \\\";\\n rep(j, seq[i].size()) {\\n\\ttmp += conv[seq[i][j]];\\n }\\n }\\n ans = tmp;\\n num++;\\n return;\\n }\\n if(conv[ord[idx].second] != '$') {\\n dfs(idx+1);\\n return;\\n }\\n ///cout << ord[idx].second << endl;\\n rep(i, 26) {\\n if(conv[(char)('A'+i)] != '$') continue;\\n conv[ord[idx].second] = (char)('A'+i);\\n conv[(char)('A'+i)] = ord[idx].second;\\n dfs(idx+1);\\n if(num > 1) return;\\n conv[ord[idx].second] = '$';\\n conv[(char)('A'+i)] = '$';\\n }\\n}\\n\\nsigned main(){\\n while(cin >> n, n) {\\n word.clear();\\n word.resize(n);\\n rep(i, n) cin >> word[i];\\n seq.clear();\\n while(1) {\\n string s;\\n cin >> s;\\n seq.push_back(s);\\n if(s.back() == '.') {\\n\\tseq[seq.size()-1].pop_back();\\n\\tbreak;\\n }\\n }\\n ord.clear();\\n mp.clear();\\n conv.clear();\\n rep(i, seq.size()) rep(j, seq[i].size()) {\\n if(seq[i][j] == '.') continue;\\n mp[seq[i][j]]++;\\n }\\n for(auto p : mp) {\\n ord.push_back(make_pair(p.second, p.first));\\n }\\n sort(ord.begin(), ord.end(), greater<pair<int, int> >());\\n ans = \\\"-\\\"; \\n rep(i, 26) conv[(char)('A'+i)] = '$';\\n conv['.'] = '.';\\n num = 0;\\n dfs(0);\\n //cout << num << endl;\\n if(num != 1) ans = \\\"-\\\";\\n cout << ans + \\\".\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.314,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1317_2123640\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<int,string> PP;\\n\\nset<string> se;\\nmap<string,int> m;\\nvector<PP> a;\\nvector<string> v;\\nint ans[26],u[26],uu[100],n,c;\\n\\nvoid dfs(int k) {\\n if(k==a.size()||c>1) {\\n for(int i=0; i<26; i++) {\\n if(u[i]==-1) continue;\\n if(u[u[i]]!=i) return;\\n }\\n c++;\\n for(int i=0; i<26; i++) ans[i]=u[i];\\n return;\\n }\\n string r=a[k].second;\\n for(int i=0; i<n; i++) {\\n string t=v[i];\\n if(uu[i]||r.size()!=t.size()) continue;\\n for(int j=0; j<t.size(); j++) {\\n if(u[t[j]-'A']!=-1&&u[t[j]-'A']!=r[j]-'A') goto next;\\n if(u[r[j]-'A']!=-1&&u[r[j]-'A']!=t[j]-'A') goto next;\\n }\\n int u2[26];\\n for(int j=0; j<26; j++) u2[j]=u[j];\\n for(int j=0; j<t.size(); j++) {\\n u[t[j]-'A']=r[j]-'A';\\n u[r[j]-'A']=t[j]-'A';\\n }\\n uu[i]=1;\\n dfs(k+1);\\n uu[i]=0;\\n for(int j=0; j<26; j++) u[j]=u2[j];\\n next:;\\n }\\n}\\nstring s;\\n\\nint main() {\\n while(cin >> n && n) {\\n se.clear();a.clear();m.clear();v.clear();\\n for(int i=0; i<n; i++) {\\n cin >> s;\\n v.push_back(s);\\n se.insert(s);\\n }\\n getline(cin,s);\\n getline(cin,s);\\n stringstream ss;\\n ss << s;\\n string r;\\n while(ss>>r) {\\n if(r[r.size()-1]=='.') r=r.substr(0,r.size()-1);\\n m[r]++;\\n }\\n for(map<string,int>::iterator it=m.begin();it!=m.end();it++) {\\n int d[26],cnt=0;memset(d,0,sizeof(d));\\n r=it->first;\\n for(int i=0; i<r.size(); i++) d[r[i]-'A']++;\\n for(int i=0; i<26; i++) if(d[i]) cnt++;\\n a.push_back(PP(cnt,it->first));\\n }\\n sort(a.begin(),a.end(),greater<PP>());\\n memset(u,-1,sizeof(u));\\n memset(uu,0,sizeof(uu));\\n c=0;\\n dfs(0);\\n if(c==1) {\\n for(int i=0; i<s.size(); i++) {\\n if(isalpha(s[i])) cout << (char)(ans[s[i]-'A']+'A');\\n else cout << s[i];\\n }\\n cout << endl;\\n } else cout << \\\"-.\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.2976,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1317_1563938\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<utility>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint ord(char c){\\n return c-'A';\\n}\\n\\nvector<pair<char,char> > rec(vector<string> seq,vector<string> word,vector<pair<char,char> > rules,int u){\\n if(seq.empty())return rules;\\n int mx=-1,x;\\n for(int i=0;i<seq.size();i++){\\n int t=u;\\n int cu=0;\\n for(auto e:seq[i]){\\n int xx=e-'A';\\n if(!(t>>xx&1)){\\n\\tcu++;\\n\\tt|=1<<xx;\\n }\\n }\\n if(cu>mx){\\n mx=cu;\\n x=i;\\n }\\n }\\n vector<pair<char,char> > res;\\n for(int j=0;j<word.size();j++){\\n auto e=word[j];\\n if(seq[x].size()!=e.size())continue;\\n vector<pair<char,char> > nr=rules;\\n int nu=u;\\n for(int i=0;i<e.size();i++){\\n int sr=nu>>ord(seq[x][i])&1;\\n int wr=nu>>ord(e[i])&1;\\n if(sr^wr)goto next;\\n if(!sr){\\n\\tnu|=1<<ord(seq[x][i])|1<<ord(e[i]);\\n\\tchar l=seq[x][i],h=e[i];\\n\\tif(h<l){\\n\\t swap(l,h);\\n\\t}\\n\\tnr.emplace_back(l,h);\\n }else{\\n\\tchar l=min(seq[x][i],e[i]);\\n\\tchar h=max(seq[x][i],e[i]);\\n\\tif(find(begin(nr),end(nr),make_pair(l,h))==end(nr))goto next;\\n }\\n }\\n {\\n vector<string> nseq(begin(seq),begin(seq)+x),nword(begin(word),begin(word)+j);\\n nseq.insert(end(nseq),begin(seq)+x+1,end(seq));\\n nword.insert(end(nword),begin(word)+j+1,end(word));\\n auto r=rec(nseq,nword,nr,nu);\\n if(!res.empty()&&!r.empty())throw 0;\\n if(!r.empty()){\\n\\tres=r;\\n }\\n }\\n next:\\n ;\\n }\\n return res;\\n}\\n\\nint main(){\\n for(int n;cin>>n,n;){\\n vector<string> word(n);\\n for(int i=0;i<n;i++){\\n cin>>word[i];\\n }\\n vector<string> seq;\\n for(string s;;){\\n cin>>s;\\n if(s.back()!='.'){\\n\\tseq.push_back(s);\\n }else{\\n\\tseq.push_back(s.substr(0,s.size()-1));\\n\\tbreak;\\n }\\n }\\n vector<string> useq=seq,uword=word;\\n sort(begin(useq),end(useq));\\n sort(begin(uword),end(uword));\\n useq.erase(unique(begin(useq),end(useq)),end(useq));\\n uword.erase(unique(begin(uword),end(uword)),end(uword));\\n try{\\n auto r=rec(useq,word,{},0);\\n char table[256];\\n for(auto e:r){\\n\\ttable[e.first]=e.second;\\n\\ttable[e.second]=e.first;\\n }\\n bool ns=false;\\n for(auto e:seq){\\n\\tif(ns++){\\n\\t cout<<' ';\\n\\t}\\n\\tfor(auto f:e){\\n\\t cout<<table[f];\\n\\t}\\n }\\n cout<<'.'<<endl;\\n }catch(...){\\n cout<<\\\"-.\\\"<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5600,\n \"memory_kb\": 1332,\n \"score_of_the_acc\": -0.764,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1317_1487088\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define show(x) cout << #x << \\\" \\\" << x << endl\\ntypedef pair<string,int> Psi;\\ntypedef vector<int> Vi;\\nint N;\\nvector<string> ss,words[21];\\nvector<Psi> vpsi;\\nVi ans;\\nbool app[26];\\nvoid init(){\\n\\tans.clear();\\n\\tss.clear();\\n\\trep(i,21) words[i].clear();\\n\\tvpsi.clear();\\n\\trep(i,26) app[i]=0;\\n}\\nconst bool lencomp(Psi x,Psi y){\\n\\tstring s=x.fs,t=y.fs;\\n\\tbool a[26]={},b[26]={};\\n\\trep(i,s.size()) a[s[i]-'A']=1;\\n\\trep(i,t.size()) b[t[i]-'A']=1;\\n\\tint c=0,d=0;\\n\\trep(i,26) if(a[i]) c++;\\n\\trep(i,26) if(b[i]) d++;\\n\\treturn c>d;\\n}\\ninline bool eq(Vi& a,Vi& b){\\n\\trep(i,26) if(app[i]&&a[i]!=b[i]) return 0;\\n\\treturn 1;\\n}\\nbool dfs(int x,Vi vi){\\n\\tif(x==ss.size()){\\n\\t\\tif(!ans.empty()&&!eq(ans,vi)) return false;\\n\\t\\tans=vi;\\n\\t\\treturn true;\\n\\t}\\n\\tstring s=ss[x];\\n\\tint L=s.size();\\n\\tfor(string w:words[L]){\\n\\t\\tVi nvi=vi;\\n\\t\\tbool ok=1;\\n\\t\\trep(i,L){\\n\\t\\t\\tif(nvi[s[i]-'A']>=0&&nvi[s[i]-'A']+'A'!=w[i]){\\n\\t\\t\\t\\tok=0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tif(nvi[w[i]-'A']>=0&&nvi[w[i]-'A']+'A'!=s[i]){\\n\\t\\t\\t\\tok=0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tnvi[s[i]-'A']=w[i]-'A';\\n\\t\\t\\tnvi[w[i]-'A']=s[i]-'A';\\n\\t\\t}\\n\\t\\tif(!ok) continue;\\n\\t\\tif(!dfs(x+1,nvi)) return false;\\n\\t}\\n\\treturn true;\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>N;\\n\\t\\tif(N==0) break;\\n\\t\\tinit();\\n\\t\\trep(i,N){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\twords[s.size()].pb(s);\\n\\t\\t}\\n\\t\\tint I=0;\\n\\t\\twhile(true){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\trep(i,s.size()) if(s[i]!='.') app[s[i]-'A']=1;\\n\\t\\t\\tif(s.back()=='.'){\\n\\t\\t\\t\\tvpsi.pb(Psi(s.substr(0,s.size()-1),I++));\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tvpsi.pb(Psi(s,I++));\\n\\t\\t}\\n\\t\\tsort(all(vpsi),lencomp);\\n\\t\\tfor(Psi psi:vpsi) ss.pb(psi.fs);\\n\\t\\tif(dfs(0,Vi(26,-1))&&!ans.empty()){\\n\\t\\t\\tvector<string> vst(ss.size());\\n\\t\\t\\trep(i,ss.size()) vst[vpsi[i].sc]=ss[i];\\n\\t\\t\\trep(i,vst.size()){\\n\\t\\t\\t\\trep(j,vst[i].size()){\\n\\t\\t\\t\\t\\tcout<<(char)(ans[vst[i][j]-'A']+'A');\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout<<(i+1==vst.size()?\\\".\\\\n\\\":\\\" \\\");\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tputs(\\\"-.\\\");\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1240,\n \"score_of_the_acc\": -0.0291,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1317_1411895\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int MAXN = 21;\\nint N;\\nstring word[MAXN];\\nstring line;\\nvector<string> V;\\nvector<int> F;\\nmap<char, char> ans;\\n\\nbool ok(const string &x, const string &w, map<char, char> m) {\\n if(x.size() != w.size()) return false;\\n for(int i = 0; i < x.size(); ++i) {\\n if(m.count(x[i]) && m[x[i]] != w[i]) return false;\\n if(m.count(w[i]) && m[w[i]] != x[i]) return false;\\n m[x[i]] = w[i];\\n m[w[i]] = x[i];\\n }\\n return true;\\n}\\n\\nvoid reg(const string &x, const string &w, map<char, char> &m) {\\n for(int i = 0; i < x.size(); ++i) {\\n m[x[i]] = w[i];\\n m[w[i]] = x[i];\\n }\\n}\\n\\nbool update(int k, map<char, char> m) {\\n F = vector<int>(V.size());\\n for(int i = k; i < V.size(); ++i) {\\n for(int j = 0; j < N; ++j) {\\n if(ok(V[i], word[j], m)) {\\n F[i] |= 1 << j;\\n }\\n }\\n if(!F[i]) return false;\\n }\\n return true;\\n}\\n\\nvoid rec(int k, map<char, char> m) {\\n if(k == V.size()) {\\n if(ans.size()) throw 0;\\n ans = m;\\n return;\\n }\\n for(int i = 0; i < N; ++i) {\\n if(F[k] >> i & 1); else continue;\\n map<char, char> nm = m;\\n reg(V[k], word[i], nm);\\n vector<int> undo = F;\\n if(update(k+1, nm)) {\\n rec(k+1, nm);\\n }\\n F = undo;\\n }\\n}\\n\\nint main() {\\n while(cin >> N && N) {\\n for(int i = 0; i < N; ++i) {\\n cin >> word[i];\\n }\\n cin.ignore();\\n getline(cin, line);\\n stringstream ss(line.substr(0, line.size()-1));\\n set<string> ws;\\n for(string s; ss >> s; ) ws.insert(s);\\n V.clear();\\n for(set<string>::iterator it = ws.begin();\\n it != ws.end(); ++it) {\\n V.push_back(*it);\\n }\\n update(0, map<char, char>());\\n ans = map<char, char>();\\n try {\\n rec(0, map<char, char>());\\n if(ans.empty()) throw 0;\\n for(int i = 0; i < line.size(); ++i) {\\n if(isalpha(line[i])) cout << ans[line[i]];\\n else cout << line[i];\\n }\\n cout << endl;\\n } catch(...) {\\n cout << \\\"-.\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 1368,\n \"score_of_the_acc\": -0.0705,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1317_1097826\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(),(a).rend()\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define FOR(i,a,b) for(int i=(a); i<(b); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\nvs dfs(vs &words,vs &c_words,map<char,char> &m,int cur,vs &orig_c_words){\\n vs ret;\\n if(cur==orig_c_words.size()){\\n REP(i,orig_c_words.size()){\\n string s;\\n REP(j,orig_c_words[i].size()){\\n s.push_back(m[orig_c_words[i][j]]);\\n }\\n ret.push_back(s);\\n }\\n return ret;\\n }\\n\\n REP(i,words.size()){\\n if(words[i].size()==c_words[cur].size()){\\n map<char,char> nm(m);\\n bool ok=true;\\n REP(j,words[i].size()){\\n map<char,char>::iterator it_i=nm.find(words[i][j]);\\n map<char,char>::iterator it_c=nm.find(c_words[cur][j]);\\n bool ei=it_i!=nm.end();\\n bool ec=it_c!=nm.end();\\n if(ei&&ec){\\n if(it_i->second!=c_words[cur][j]||it_c->second!=words[i][j]){\\n ok=false;\\n break;\\n }\\n }else if(ei||ec){\\n ok=false;\\n break;\\n }else{\\n nm[words[i][j]]=c_words[cur][j];\\n nm[c_words[cur][j]]=words[i][j];\\n }\\n }\\n if(ok){\\n //cerr<<\\\"cur:\\\"<<cur<<endl;\\n vs res=dfs(words,c_words,nm,cur+1,orig_c_words);\\n //cerr<<\\\"res:\\\"<<res.size()<<endl;\\n if(res.size()>0){\\n if(res.size()==100){\\n return vs(100);\\n }\\n if(ret.size()){\\n return vs(100);\\n }else{\\n ret=res;\\n }\\n }\\n }\\n }\\n }\\n return ret;\\n\\n}\\nbool pred(const string &l,const string &r){\\n if(l.size()==r.size()){\\n return l>r;\\n }else{\\n return l.size()>r.size();\\n }\\n}\\nint main(){\\n int n;\\n while(cin>>n,n){\\n vs words(n);\\n REP(i,n){\\n cin>>words[i];\\n }\\n string sequence;\\n getline(cin,sequence);\\n getline(cin,sequence);\\n vs c_words;\\n int prev=0;\\n REP(i,sequence.size()){\\n switch(sequence[i]){\\n case ' ':\\n case '.':\\n c_words.push_back(sequence.substr(prev,i-prev));\\n prev=i+1;\\n break;\\n }\\n }\\n vs orig_c_words(c_words);\\n sort(ALL(c_words),pred);\\n map<char,char> m;\\n vs res=dfs(words,c_words,m,0,orig_c_words);\\n if(res.size()&&res.size()<100){\\n REP(i,res.size()){\\n cout<<res[i]<<(i<res.size()-1?\\\" \\\":\\\"\\\");\\n }\\n cout<<\\\".\\\"<<endl;\\n }else{\\n cout<<\\\"-.\\\"<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.0529,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1317_1091493\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <cstdlib>\\n#include <functional>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\nusing namespace std;\\n\\nconstexpr int MAX_M = 50;\\nconstexpr int MAX_LENGTH = 20;\\n\\nint n, m;\\nstring target;\\nvector<string> candidates[MAX_LENGTH + 1];\\npair<int, string> words[MAX_M];\\nvector<char> assign(128, -1);\\n\\nint cnt;\\n\\nbool dfs(int idx = 0) {\\n\\tif(idx == m) {\\n\\t\\tif(++cnt == 1) {\\n\\t\\t\\tfor(auto &c : target) {\\n\\t\\t\\t\\tif(c != ' ') c = assign[c];\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\tconst auto &s = words[idx].second;\\n\\n\\tfor(const auto &t : candidates[s.size()]) {\\n\\t\\tauto tmp(assign);\\n\\n\\t\\tfor(int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\t\\tif(!(tmp[s[i]] == t[i] || (tmp[s[i]] == -1 && tmp[t[i]] == -1))) {\\n\\t\\t\\t\\tgoto next;\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmp[s[i]] = t[i];\\n\\t\\t\\ttmp[t[i]] = s[i];\\n\\t\\t}\\n\\n\\t\\tassign.swap(tmp);\\n\\t\\tif(!dfs(idx + 1)) return false;\\n\\t\\tassign = move(tmp);\\n\\t\\t\\n\\tnext:;\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nint main() {\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\twhile(cin >> n && n) {\\n\\t\\tfor_each(begin(candidates), end(candidates), [](vector<string> &v) { v.clear(); });\\n\\n\\t\\tfor(int i = 0; i < n; ++i) {\\n\\t\\t\\tstring in;\\n\\t\\t\\tcin >> in;\\n\\n\\t\\t\\tconst int len = in.size();\\n\\t\\t\\tcandidates[len].emplace_back(move(in));\\n\\t\\t}\\n\\n\\t\\tcin.ignore();\\n\\t\\tgetline(cin, target);\\n\\t\\ttarget = target.substr(0, target.size() - 1);\\n\\n\\t\\t{\\n\\t\\t\\tstring in;\\n\\t\\t\\tistringstream iss(target);\\n\\n\\t\\t\\tfor(m = 0; iss >> in; ++m) {\\n\\t\\t\\t\\twords[m].second = in;\\n\\t\\t\\t\\tin.erase(unique(in.begin(), in.end()), in.end());\\n\\t\\t\\t\\twords[m].first = in.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(words, words + m, greater<pair<int, string>>());\\n\\n\\t\\tcnt = 0;\\n\\t\\tfill(begin(assign), end(assign), -1);\\n\\t\\tdfs();\\n\\n\\t\\tcout << (cnt == 1 ? target : \\\"-\\\") << \\\".\\\\n\\\";\\n\\t}\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1260,\n \"score_of_the_acc\": -0.0319,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1317_930173\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nusing namespace std;\\n\\nconst int IINF = INT_MAX;\\n\\nint n,found,len;\\nvector<string> buf[30],seq;\\nstring tmp,sequence,answer;\\nchar transfer[26];\\n\\nbool comp(const string& a,const string& b) {\\n set<char> A,B;\\n rep(i,a.size()) A.insert(a[i]);\\n rep(i,b.size()) B.insert(b[i]);\\n return A.size() > B.size();\\n}\\n\\nvoid dfs(int cur){\\n\\n if( found >= 2 ) return;\\n\\n if( cur >= len ){\\n ++found;\\n rep(i,answer.size()) if( isupper(answer[i]) ) answer[i] = transfer[answer[i]-'A'];\\n return;\\n }\\n\\n int word_size = seq[cur].size();\\n\\n rep(i,(int)buf[word_size].size()){\\n string word = buf[word_size][i];\\n\\n int *backtrack = new int[word_size+1];\\n backtrack[0] = -1; // sentinel\\n bool error = false;\\n rep(j,word_size){\\n if( transfer[word[j]-'A'] == '?' && transfer[seq[cur][j]-'A'] == '?' ) {\\n backtrack[j] = 1, backtrack[j+1] = -1;\\n transfer[word[j]-'A'] = seq[cur][j];\\n transfer[seq[cur][j]-'A'] = word[j];\\n } else if( transfer[word[j]-'A'] == seq[cur][j] && transfer[seq[cur][j]-'A'] == word[j] ) {\\n backtrack[j] = 0;\\n } else {\\n backtrack[j] = -1;\\n error = true;\\n break;\\n }\\n }\\n\\n if( !error ) dfs( cur+1 );\\n\\n int j = 0;\\n while( backtrack[j] != -1 && j < word_size) {\\n if( backtrack[j] == 1 ) transfer[word[j]-'A'] = transfer[seq[cur][j]-'A'] = '?';\\n ++j;\\n }\\n\\n }\\n\\n}\\n\\nint main(){\\n while( cin >> n, n ){\\n seq.clear();\\n rep(i,30) buf[i].clear();\\n rep(i,n) {\\n cin >> tmp;\\n buf[(int)tmp.size()].push_back(tmp);\\n }\\n cin.ignore();\\n getline(cin,sequence);\\n stringstream ss(sequence.substr(0,(int)sequence.size()-1));\\n while( !( ss >> tmp ).fail() ) seq.push_back(tmp);\\n sort(seq.begin(),seq.end(),comp);\\n\\n answer = sequence;\\n found = 0, len = (int)seq.size();\\n rep(i,26) transfer[i] = '?';\\n dfs(0);\\n\\n cout << ((found==1)?answer:\\\"-.\\\") << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8100,\n \"score_of_the_acc\": -1.0026,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1317_800555\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\nusing namespace std;\\n\\nchar w1[22][110];\\nchar w2[44][110];\\nint w1_cnt, w2_cnt;\\nint cw[28];\\nint aw[28];\\nbool ok[44][22];\\nint ok_cnt[44];\\nbool vis[44];\\nint ans;\\n\\nbool cal_ok(int i, int j) {\\n if (strlen(w2[i]) != strlen(w1[j])) return false;\\n int tw[28];\\n memcpy(tw, cw, sizeof(tw));\\n for (int k = 0; w2[i][k]; k++) {\\n int c = w2[i][k] - 'A';\\n int d = w1[j][k] - 'A';\\n if (tw[c] != -1 && tw[c] != w1[j][k]) return false;\\n if (tw[d] != -1 && tw[d] != w2[i][k]) return false;\\n tw[c] = w1[j][k];\\n tw[d] = w2[i][k];\\n }\\n return true;\\n}\\nvoid get_ok() {\\n memset(ok, 0, sizeof(ok));\\n for (int i = 0; i < w2_cnt; i++)\\n for (int j = 0; j < w1_cnt; j++) {\\n ok[i][j] = cal_ok(i, j);\\n if (ok[i][j]) ok_cnt[i]++;\\n }\\n}\\nvoid print_ok() {\\n\\tfor (int i = 0; i < w2_cnt; i++) {\\n\\t\\tfor (int j = 0; j < w1_cnt; j++) {\\n\\t\\t\\tprintf(\\\"%d \\\", ok[i][j]);\\n\\t\\t}\\n\\t\\tputs(\\\"\\\");\\n\\t}\\n}\\n\\nint find() {\\n int p = -1;\\n for (int i = 0; i < w2_cnt; i++) if (!vis[i])\\n if (p == -1 || ok_cnt[i] < ok_cnt[p]) p = i;\\n return p;\\n}\\n\\nvoid dfs(int u) {\\n if (ans > 1) return;\\n if (u == -1) {\\n ans++;\\n memcpy(aw, cw, sizeof(aw));\\n return;\\n }\\n// bool tmp[44][22];\\n// int tmp_cnt[44];\\n int tw[28];\\n// memcpy(tmp, ok, sizeof(tmp));\\n// memcpy(tmp_cnt, ok_cnt, sizeof(ok_cnt));\\n memcpy(tw, cw, sizeof(tw));\\n get_ok();\\n for (int i = 0; i < w1_cnt; i++) if (ok[u][i]) {\\n vis[u] = true;\\n for (int j = 0; w2[u][j]; j++) {\\n int c = w2[u][j] - 'A';\\n int d = w1[i][j] - 'A';\\n cw[c] = w1[i][j];\\n cw[d] = w2[u][j];\\n }\\n dfs(find());\\n memcpy(cw, tw, sizeof(tw));\\n vis[u] = false;\\n get_ok();\\n// memcpy(ok_cnt, tmp_cnt, sizeof(tmp_cnt));\\n// memcpy(ok, tmp, sizeof(tmp));\\n }\\n}\\n\\nvoid work() {\\n for (int i = 0; i < w1_cnt; i++)\\n scanf(\\\"%s\\\", w1[i]);\\n w2_cnt = 0;\\n while (true) {\\n char str[100];\\n scanf(\\\"%s\\\", str);\\n int len = strlen(str);\\n if (str[len - 1] == '.') {\\n str[--len] = 0;\\n strcpy(w2[w2_cnt], str);\\n w2_cnt++;\\n break;\\n } else {\\n strcpy(w2[w2_cnt], str);\\n w2_cnt++;\\n }\\n }\\n//for (int i = 0; i < w2_cnt; i++) printf(\\\"%s \\\", w2[i]); puts(\\\".....\\\");\\n memset(cw, -1, sizeof(cw));\\n get_ok();\\n//print_ok();\\n memset(vis, 0, sizeof(vis));\\n int p = find();\\n//printf(\\\"%d\\\\n\\\", p);\\n ans = 0;\\n dfs(p);\\n if (ans > 1) {\\n puts(\\\"-.\\\");\\n return;\\n }\\n//for (int i = 0; i < 26; i++) printf(\\\"%d \\\", aw[i]); puts(\\\"?\\\");\\n for (int i = 0; i < w2_cnt; i++) {\\n for (int j = 0; w2[i][j]; j++) {\\n int d = w2[i][j] - 'A';\\n printf(\\\"%c\\\", aw[d]);\\n }\\n if (i < w2_cnt - 1) printf(\\\" \\\");\\n }\\n puts(\\\".\\\");\\n}\\n\\nint main() {\\n while (scanf(\\\"%d\\\", &w1_cnt), w1_cnt) {\\n work();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 1044,\n \"score_of_the_acc\": -0.1035,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1317_791955\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <set>\\n#include <cstring>\\n#include <sstream>\\nusing namespace std;\\n\\nint n, m;\\nstring cand[22];\\nvector<string> words;\\n\\nvector<int> match[82];\\nint matchBit[82];\\n\\nvector<char> ansKey;\\nint ansFlg;\\n\\nbool matches(string a, string b){\\n if(a.size() != b.size()) return false;\\n char trans[128];\\n memset(trans, -1, sizeof(trans));\\n for(int i = 0; i < a.size(); i++){\\n if(trans[a[i]] != -1 && b[i] != trans[a[i]]) return false;\\n if(trans[b[i]] != -1 && a[i] != trans[b[i]]) return false;\\n trans[a[i]] = b[i];\\n trans[b[i]] = a[i];\\n }\\n return true;\\n}\\n\\nbool mycmp(const string &a, const string &b){\\n set<char> st1;\\n for(int i = 0; i < a.size(); i++) st1.insert(a[i]);\\n set<char> st2;\\n for(int i = 0; i < b.size(); i++) st2.insert(b[i]);\\n\\n return st1.size() > st2.size();\\n}\\n\\nbool setKey(const string &a, const string &b, vector<char> &key){\\n for(int i = 0; i < a.size(); i++){\\n if(key[a[i]] != -1 && key[a[i]] != b[i] ||\\n key[b[i]] != -1 && key[b[i]] != a[i]){\\n return false;\\n }\\n key[a[i]] = b[i];\\n key[b[i]] = a[i];\\n }\\n return true;\\n}\\n\\nvoid dfs(int idx, int used, vector<char> key){\\n if(idx == m){\\n if(ansFlg == 1){\\n ansFlg = -1;\\n }\\n else{\\n ansFlg = 1;\\n ansKey = key;\\n }\\n return;\\n }\\n\\n for(int i = idx; i < m; i++){\\n if((matchBit[i] & used) == matchBit[i]){\\n return;\\n }\\n }\\n\\n for(int i = 0; i < match[idx].size(); i++){\\n int j = match[idx][i];\\n if(used & (1 << j)) continue;\\n\\n vector<char> nextKey = key;\\n if(setKey(words[idx], cand[j], nextKey)){\\n dfs(idx + 1, used | (1 << j), nextKey);\\n if(ansFlg == -1) return;\\n }\\n }\\n}\\n\\nvoid solve(){\\n sort(words.begin(), words.end(), mycmp);\\n\\n for(int i = 0; i < m; i++){\\n match[i].clear();\\n matchBit[i] = 0;\\n\\n for(int j = 0; j < n; j++){\\n if(matches(words[i], cand[j])){\\n match[i].push_back(j);\\n matchBit[i] |= (1 << j);\\n }\\n }\\n }\\n\\n vector<char> key(128, -1);\\n ansFlg = 0;\\n dfs(0, 0, key);\\n}\\n\\nint main(){\\n while(cin >> n, n){\\n for(int i = 0; i < n; i++){\\n cin >> cand[i];\\n\\n for(int j = 0; j < i; j++){\\n if(cand[j] == cand[i]){\\n i--;\\n n--;\\n break;\\n }\\n }\\n }\\n\\n string s;\\n getline(cin, s);\\n getline(cin, s);\\n for(int i = 0; i < s.size(); i++) if(s[i] == '.') s[i] = ' ';\\n\\n vector<string> raw;\\n stringstream ss(s);\\n words.clear();\\n\\n while(ss >> s){\\n raw.push_back(s);\\n\\n bool pushFlg = true;\\n for(int i = 0; i < words.size(); i++){\\n if(words[i] == s){\\n pushFlg = false;\\n break;\\n }\\n }\\n if(pushFlg) words.push_back(s);\\n }\\n m = words.size();\\n\\n solve();\\n\\n if(ansFlg == 1){\\n for(int i = 0; i < raw.size(); i++){\\n if(i != 0) cout << \\\" \\\";\\n for(int j = 0; j < raw[i].size(); j++){\\n cout << ansKey[raw[i][j]];\\n }\\n }\\n cout << \\\".\\\" << endl;\\n }\\n else{\\n cout << \\\"-.\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1272,\n \"score_of_the_acc\": -0.0323,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":769,"cells":{"group_id":{"kind":"string","value":"aoj_1322_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nASCII Expression\nMathematical expressions appearing in old papers and old technical articles are printed with typewriter in several lines, where a fixed-width or monospaced font is required to print characters (digits, symbols and spaces). Let us consider the following mathematical expression.\nIt is printed in the following four lines:\n4 2\n( 1 - ---- ) * - 5 + 6\n 2\n 3\nwhere “- 5” indicates unary minus followed by 5. We call such an expression of lines “ASCII expression”.\nFor helping those who want to evaluate ASCII expressions obtained through optical character recognition (OCR) from old papers, your job is to write a program that recognizes the structure of ASCII expressions and computes their values.\nFor the sake of simplicity, you may assume that ASCII expressions are constructed by the following rules. Its syntax is shown in Table H.1.\n(1)\nTerminal symbols are ‘\n0\n’, ‘\n1\n’, ‘\n2\n’, ‘\n3\n’, ‘\n4\n’, ‘\n5\n’, ‘\n6\n’, ‘\n7\n’, ‘\n8\n’, ‘\n9\n’, ‘\n+\n’, ‘\n-\n’, ‘\n*\n’, ‘\n(\n’, ‘\n)\n’, and ‘\n’.\n(2)\nNonterminal symbols are\nexpr\n,\nterm\n,\nfactor\n,\npowexpr\n,\nprimary\n,\nfraction\nand\ndigit\n. The start symbol is\nexpr\n.\n(3)\nA “cell” is a rectangular region of characters that corresponds to a terminal or nonterminal symbol (Figure H.1). In the cell, there are no redundant rows and columns that consist only of space characters. A cell corresponding to a terminal symbol consists of a single character. A cell corresponding to a nonterminal symbol contains cell(s) corresponding to its descendant(s) but never partially overlaps others.\n(4)\nEach cell has a base-line, a top-line, and a bottom-line. The base-lines of child cells of the right-hand side of rules I, II, III, and V should be aligned. Their vertical position defines the base-line position of their left-hand side cell.\nTable H.1: Rules for constructing ASCII expressions (similar to Backus-Naur Form) The box indicates the cell of the terminal or nonterminal symbol that corresponds to a rectan- gular region of characters. Note that each syntactically-needed space character is explicitly\nindicated by the period character denoted by, here.\n(5)\npowexpr\nconsists of a\nprimary\nand an optional\ndigit\n. The\ndigit\nis placed one line above the base-line of the\nprimary cell. They are horizontally adjacent to each other. The base-line of a\npowexpr\nis that of the\nprimary\n.\n(6)\nfraction\nis indicated by three or more consecutive hyphens called “vinculum”. Its dividend expr is placed just above the vinculum, and its divisor expr is placed just beneath it. The number of the hyphens of the vinculum, denoted by\nw\nh\n, is equal to 2 + max(\nw\n1\n,\nw\n2\n), where\nw\n1\nand\nw\n2\nindicate the width of the cell of the dividend and that of the divisor, respectively. These cells are centered, where there are ⌈(\nw\nh\n−\nw\nk\n)/2⌉ space characters to the left and ⌊(\nw\nh\n−\nw\nk\n)/2⌋ space characters to the right, (\nk\n= 1, 2). The base-line of a fraction is at the position of the vinculum.\n(7)\ndigit\nconsists of one character\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1322_5951862","code_snippet":"#define MOD_TYPE 1\n\n#pragma region Macros\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n//#include <atcoder/all>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\n#if 0\n#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <boost/multiprecision/cpp_int.hpp>\nusing Int = boost::multiprecision::cpp_int;\nusing lld = boost::multiprecision::cpp_dec_float_100;\n#endif\n\n#if 1\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n\nusing ll = long long int;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pld = pair<ld, ld>;\ntemplate <typename Q_type>\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\n#if MOD_TYPE == 1\nconstexpr ll MOD = ll(1e9 + 7);\n#else\n#if MOD_TYPE == 2\nconstexpr ll MOD = 998244353;\n#else\nconstexpr ll MOD = 1000003;\n#endif\n#endif\n\nusing mint = static_modint<MOD>;\nconstexpr int INF = (int)1e9 + 10;\nconstexpr ll LINF = (ll)4e18;\nconstexpr double PI = acos(-1.0);\nconstexpr double EPS = 1e-11;\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\n#define repi(i, n) REPI(i, 0, n)\n#define MP make_pair\n#define MT make_tuple\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << \"\\n\"\n#define all(v) v.begin(), v.end()\n#define NP(v) next_permutation(all(v))\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << setprecision(30) << setiosflags(ios::fixed);\n };\n} io_init;\ntemplate <typename T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ninline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }\ntemplate <typename A, size_t N, typename T>\ninline void Fill(A (&array)[N], const T &val) {\n fill((T *)array, (T *)(array + N), val);\n}\ntemplate <typename T>\nvector<T> compress(vector<T> &v) {\n vector<T> val = v;\n sort(all(val)), val.erase(unique(all(val)), val.end());\n for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();\n return val;\n}\ntemplate <typename T, typename U>\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T, typename U>\nconstexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {\n os << p.first << \" \" << p.second;\n return os;\n}\nostream &operator<<(ostream &os, mint m) {\n os << m.val();\n return os;\n}\n\nrandom_device seed_gen;\nmt19937_64 engine(seed_gen());\n\nstruct BiCoef {\n vector<mint> fact_, inv_, finv_;\n BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n for (int i = 2; i < n; i++) {\n fact_[i] = fact_[i - 1] * i;\n inv_[i] = -inv_[MOD % i] * (MOD / i);\n finv_[i] = finv_[i - 1] * inv_[i];\n }\n }\n mint C(ll n, ll k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n - k];\n }\n mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }\n mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }\n mint Ch1(ll n, ll k) const noexcept {\n if (n < 0 || k < 0) return 0;\n mint res = 0;\n for (int i = 0; i < n; i++)\n res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);\n return res;\n }\n mint fact(ll n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n mint inv(ll n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n mint finv(ll n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nBiCoef bc(500010);\n\n#pragma endregion\n\ntemplate <typename T>\nvoid icpc(T a) {\n if (!a) exit(0);\n}\ntemplate <typename T, typename U>\nvoid icpc(T a, U end) {\n if (a == end) exit(0);\n}\n\n// 端のスペースを削除\nvoid clean(vector<string> &s) {\n int n = s.size(), m = s[0].size();\n vector<int> erase_i(n, 0), erase_j(m, 0);\n rep(i, n) {\n bool allspace = true;\n rep(j, m) {\n if (s[i][j] != '.') {\n allspace = false;\n break;\n }\n }\n if (allspace)\n erase_i[i] = 1;\n else\n break;\n }\n for (int i = n - 1; i >= 0; i--) {\n bool allspace = true;\n rep(j, m) {\n if (s[i][j] != '.') {\n allspace = false;\n break;\n }\n }\n if (allspace)\n erase_i[i] = 1;\n else\n break;\n }\n rep(j, m) {\n bool allspace = true;\n rep(i, n) {\n if (s[i][j] != '.') {\n allspace = false;\n break;\n }\n }\n if (allspace)\n erase_j[j] = 1;\n else\n break;\n }\n for (int j = m - 1; j >= 0; j--) {\n bool allspace = true;\n rep(i, n) {\n if (s[i][j] != '.') {\n allspace = false;\n break;\n }\n }\n if (allspace)\n erase_j[j] = 1;\n else\n break;\n }\n\n vector<string> res;\n rep(i, n) {\n if (erase_i[i]) continue;\n res.emplace_back(\"\");\n rep(j, m) {\n if (erase_j[j]) continue;\n res.back().push_back(s[i][j]);\n }\n }\n s = res;\n}\n\n// base の位置 (存在しない場合は-1)\nint find_base(vector<string> s) {\n int n = s.size(), m = s[0].size();\n int Max = 0;\n int base = -1;\n rep(i, n) {\n int Maxi = -1;\n int cnt = 0;\n rep(j, m) {\n if (s[i][j] == '-')\n cnt++;\n else\n cnt = 0;\n if (cnt >= 2) {\n chmax(Maxi, cnt);\n }\n }\n if (chmax(Max, Maxi)) {\n base = i;\n }\n }\n return base;\n}\n\n// 分割\nvector<vector<string>> split(vector<string> &s, vector<int> &pos) {\n int n = s.size(), m = s[0].size();\n vector<vector<string>> res(pos.size() + 1, vector<string>(n));\n rep(i, n) {\n int pi = 0;\n rep(j, m) {\n if (pi < pos.size() and j == pos[pi]) {\n pi++;\n } else {\n res[pi][i].push_back(s[i][j]);\n }\n }\n }\n for (auto &&r : res) clean(r);\n return res;\n}\n\nmodint expr(vector<string>);\nmodint factor(vector<string>);\nmodint powexpr(vector<string>);\nmodint primary(vector<string>);\nmodint fraction(vector<string>);\nmodint digit(vector<string>);\n\nmodint expr_sub(vector<pair<char, modint>> &p) {\n modint prod = 1;\n modint res = 0;\n int sgn = 1;\n for (auto [op, val] : p) {\n if (op == 'n') {\n prod *= val;\n } else if (op == '+') {\n res += prod * sgn;\n prod = 1;\n sgn = 1;\n } else if (op == '-') {\n res += prod * sgn;\n prod = 1;\n sgn = -1;\n }\n }\n res += prod * sgn;\n return res;\n}\n\n// term も兼ねる\nmodint expr(vector<string> s) {\n clean(s);\n int n = s.size(), m = s[0].size();\n\n int base = find_base(s);\n if (base == -1) base = n - 1;\n vector<int> pos = {};\n int blank = 0;\n rep(j, m) {\n bool allspace = true;\n rep(i, n) {\n if (s[i][j] != '.') {\n allspace = false;\n }\n if (s[i][j] == '(') {\n blank++;\n } else if (s[i][j] == ')') {\n blank--;\n }\n }\n if (allspace and blank == 0) pos.emplace_back(j);\n }\n vector<vector<string>> v = split(s, pos);\n\n vector<pair<char, modint>> p(v.size());\n rep(i, v.size()) {\n char op = 'n';\n modint val = 0;\n if (v[i].size() == 1 and v[i][0].size() == 1) { // 演算子 or 数字\n char c = v[i][0][0];\n if (isdigit(c)) {\n val = c - '0';\n } else {\n op = c;\n }\n } else {\n val = factor(v[i]);\n }\n p[i] = {op, val};\n }\n\n // *- と始めの - を圧縮\n vector<pair<char, modint>> q;\n bool minus = false;\n rep(i, p.size()) {\n if (i > 0 and p[i].first == '-' and p[i - 1].first != 'n' or\n i == 0 and p[i].first == '-') {\n minus ^= 1;\n } else {\n if (minus) {\n assert(p[i].first == 'n');\n p[i].second *= -1;\n minus = false;\n }\n q.push_back(p[i]);\n }\n }\n return expr_sub(q);\n}\n\n// 先頭に - が付くものは expr でケアする\nmodint factor(vector<string> s) {\n int n = s.size(), m = s[0].size();\n int base = find_base(s);\n if (base == -1) base = n - 1;\n if (s[base][m - 2] != '-') {\n return powexpr(s);\n }\n return fraction(s);\n}\n\nmodint powexpr(vector<string> s) {\n clean(s);\n int n = s.size(), m = s[0].size();\n\n if (n == 2 and m == 2) {\n modint a = s[1][0] - '0';\n int b = s[0][1] - '0';\n if (b == 0)\n return 1;\n else\n return a.pow(b);\n } else if (n == 1 and m == 1) {\n return s[0][0] - '0';\n }\n int base = find_base(s);\n if (base == -1) base = n - 1;\n if (s[base].back() == ')') {\n return primary(s);\n }\n assert(s[base][m - 2] == ')');\n assert(isdigit(s[base - 1][m - 1]));\n int b = s[base - 1][m - 1] - '0';\n rep(i, n) s[i].pop_back();\n modint a = primary(s);\n if (b == 0)\n return 1;\n else\n return a.pow(b);\n}\n\nmodint primary(vector<string> s) {\n clean(s);\n int n = s.size(), m = s[0].size();\n\n if (n == 1 and m == 1) return digit(s);\n int base = find_base(s);\n if (base == -1) base = n - 1;\n assert(s[base][0] == '(');\n assert(s[base].back() == ')');\n assert(m >= 5);\n vector<string> t(n);\n rep(i, n) { t[i] = s[i].substr(2, m - 4); }\n return expr(t);\n}\n\nmodint fraction(vector<string> s) {\n clean(s);\n int base = find_base(s);\n assert(base != -1);\n vector<string> U, D;\n rep(i, s.size()) {\n if (i < base)\n U.push_back(s[i]);\n else if (i > base)\n D.push_back(s[i]);\n }\n return expr(U) / expr(D);\n}\n\nmodint digit(vector<string> s) {\n clean(s);\n assert(s.size() == 1 and s[0].size() == 1);\n return s[0][0] - '0';\n}\n\nvoid solve() {\n int n;\n cin >> n;\n icpc(n);\n vector<string> s(n);\n rep(i, n) cin >> s[i];\n cout << expr(s).val() << \"\\n\";\n}\n\nint main() {\n modint::set_mod(2011);\n while (1) solve();\n}","accuracy":1,"time_ms":10,"memory_kb":9176,"score_of_the_acc":-0.2647,"final_rank":7},{"submission_id":"aoj_1322_4972605","code_snippet":"#pragma region template\n#include <bits/stdc++.h>\n//#include <boost/multiprecision/cpp_int.hpp>\n// using cpp_int = boost::multiprecision::cpp_int;\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vld = vector<ld>;\nusing vvld = vector<vld>;\nusing vvvld = vector<vvld>;\nusing vs = vector<string>;\nusing pll = pair<ll, ll>;\nusing vp = vector<pll>;\ntemplate <typename T>\nusing pqrev = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)\n#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)\n#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)\n#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)\n#define ALL(a) (a).begin(), (a).end()\n#define SZ(x) ((ll)(x).size())\n#ifdef OJ_LOCAL\n#include \"dump.hpp\"\n#else\n#define dump(...) ((void)0)\n#endif\nconstexpr ll INF = 1e+18;\nconstexpr ld EPS = 1e-12L;\nconstexpr ld PI = 3.14159265358979323846L;\ntemplate <typename T>\nconstexpr T local([[maybe_unused]] const T &lcl, [[maybe_unused]] const T &oj) {\n#ifdef OJ_LOCAL\n return lcl;\n#else\n return oj;\n#endif\n}\ntemplate <typename S, typename T>\nconstexpr bool chmax(S &a, const T &b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename S, typename T>\nconstexpr bool chmin(S &a, const T &b) {\n if (b < a) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T>\nT max(const vector<T> &x) {\n return *max_element(ALL(x));\n}\ntemplate <typename T>\nT min(const vector<T> &x) {\n return *min_element(ALL(x));\n}\ntemplate <typename T>\npair<T, int> argmax(const vector<T> &x) {\n int idx = 0;\n T m = x[0];\n repr(i, 1, SZ(x)) {\n if (chmax(m, x[i])) idx = i;\n }\n return {m, idx};\n}\ntemplate <typename T>\npair<T, int> argmin(const vector<T> &x) {\n int idx = 0;\n T m = x[0];\n repr(i, 1, SZ(x)) {\n if (chmin(m, x[i])) idx = i;\n }\n return {m, idx};\n}\ntemplate <typename T>\nT sum(const vector<T> &x) {\n return accumulate(ALL(x), T(0));\n}\n// last param -> T\ntemplate <typename T>\nvector<T> makev(size_t a, T b) {\n return vector<T>(a, b);\n}\ntemplate <typename... Args>\nauto makev(size_t sz, Args... args) {\n return vector<decltype(makev(args...))>(sz, makev(args...));\n}\n\ntemplate <typename T>\nbool print_(const T &a) {\n cout << a;\n return true;\n}\ntemplate <typename T>\nbool print_(const vector<T> &vec) {\n for (auto &a : vec) {\n cout << a;\n if (&a != &vec.back()) cout << \" \";\n }\n return false;\n}\ntemplate <typename T>\nbool print_(const vector<vector<T>> &vv) {\n for (auto &v : vv) {\n for (auto &a : v) {\n cout << a;\n if (&a != &v.back()) cout << \" \";\n }\n if (&v != &vv.back()) cout << \"\\n\";\n }\n return false;\n}\nvoid print() { cout << \"\\n\"; }\ntemplate <typename Head, typename... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n bool f = print_(head);\n if (sizeof...(tail) != 0) cout << (f ? \" \" : \"\\n\");\n print(forward<Tail>(tail)...);\n}\n#pragma endregion\n\n//*\nconstexpr ll MOD = 1e9 + 7;\n/*/\nconstexpr ll MOD = 998244353;\n//*/\n\n#define PR(f) \\\n do { \\\n cout << ((f) ? \"Yes\" : \"No\") << \"\\n\"; \\\n return; \\\n } while (0)\n\nint n, m;\nvs s;\n\nvoid reduce(int &u, int &l, int &d, int &r){\n //dump(\"reduce\", u, l, d, r);\n repr(i, u, d){\n bool f = 1;\n repr(j, l, r){\n if(s[i][j]!='.'){\n f = 0;\n break;\n }\n }\n if(f) u++;\n else break;\n }\n reprb(i, u, d){\n bool f = 1;\n repr(j, l, r){\n if(s[i][j]!='.'){\n f = 0;\n break;\n }\n }\n if(f) d--;\n else break;\n }\n repr(j, l, r){\n bool f = 1;\n repr(i, u, d){\n if(s[i][j]!='.'){\n f = 0;\n break;\n }\n }\n if(f) l++;\n else break;\n }\n reprb(j, l, r){\n bool f = 1;\n repr(i, u, d){\n if(s[i][j]!='.'){\n f = 0;\n break;\n }\n }\n if(f) r--;\n else break;\n }\n}\n\nconst int M = 2011;\nint inv[M];\nunordered_set<string> endexpr;\n\nint expr(int u, int l, int d, int r, int base);\nint term(int u, int l, int d, int r, int base);\n\nint digit(int u, int l){\n dump(\"digit\", u, l, s[u][l]-'0');\n return s[u][l]-'0';\n}\n\nint primary(int u, int l, int d, int r, int base){\n reduce(u, l, d, r);\n dump(\"primary\", u, l, d, r);\n int ans = 0;\n if(s[base][l]=='('){\n ans = expr(u, l+2, d, r-2, base);\n }else{\n ans = digit(base, l);\n }\n ans += M;\n ans %= M;\n dump(\"primary\", u, l, d, r, ans);\n return ans;\n}\n\nint powexpr(int u, int l, int d, int r, int base){\n reduce(u, l, d, r);\n dump(\"powexpr\", u, l, d, r);\n /*\n if(br(base, l, r)){\n return expr(u, l+2, d, r-2, base);\n }\n */\n int ans = 0;\n if(s[base][r-1]=='.'){\n int b = primary(u, l, d, r-1, base);\n int c = digit(base-1, r-1);\n ans = 1;\n rep(t, c){\n ans *= b;\n ans %= M;\n }\n }else{\n ans = primary(u, l, d, r, base);\n }\n ans += M;\n ans %= M;\n dump(\"powexpr\", u, l, d, r, ans);\n return ans;\n}\n\nint fraction(int u, int l, int d, int r, int base){\n reduce(u, l, d, r);\n dump(\"fraction\", u, l, d, r, base);\n /*\n if(br(base, l, r)){\n return expr(u, l+2, d, r-2, base);\n }\n */\n int ans = 0;\n int nu = u, nl = l+1, nd = base, nr = r-1;\n reduce(nu, nl, nd, nr);\n repr(i, nu, nd){\n if(s[i][nl]!='.'){\n ans = expr(nu, nl, nd, nr, i);\n break;\n }\n }\n nu = base+1, nl = l+1, nd = d, nr = r-1;\n reduce(nu, nl, nd, nr);\n repr(i, nu, nd){\n if(s[i][nl]!='.'){\n ans *= inv[expr(nu, nl, nd, nr, i)];\n break;\n }\n }\n ans += M;\n ans %= M;\n dump(\"fraction\", u, l, d, r, base, ans);\n return ans;\n}\n\nint factor(int u, int l, int d, int r, int base){\n reduce(u, l, d, r);\n dump(\"factor\", u, l, d, r, base);\n /*\n if(br(base, l, r)){\n return expr(u, l+2, d, r-2, base);\n }\n */\n int ans = 0;\n int stk = 0;\n repr(j, l, r){\n if(s[base][j]=='(') stk++;\n if(s[base][j]==')') stk--;\n if(s[base].substr(j, 3)==\".*.\" && !stk){\n ans = term(u, l, d, j, base) * factor(u, j+3, d, r, base);\n break;\n }\n }\n if(s[base].substr(l, 2)==\"--\"){\n ans = fraction(u, l, d, r, base);\n }else if(s[base].substr(l, 2)==\"-.\"){\n ans = -factor(u, l+2, d, r, base);\n }else{\n ans = powexpr(u, l, d, r, base);\n }\n ans += M;\n ans %= M;\n dump(\"factor\", u, l, d, r, ans);\n return ans;\n}\n\nint term(int u, int l, int d, int r, int base){\n reduce(u, l, d, r);\n dump(\"term\", u, l, d, r);\n /*\n if(br(base, l, r)){\n return expr(u, l+2, d, r-2, base);\n }\n */\n int ans = 0;\n int stk = 0;\n repr(j, l, r){\n if(s[base][j]=='(') stk++;\n if(s[base][j]==')') stk--;\n if(s[base].substr(j, 3)==\".*.\" && !stk){\n ans = factor(u, l, d, j, base) * term(u, j+3, d, r, base);\n break;\n }\n if(j==r-1){\n ans = factor(u, l, d, r, base);\n }\n }\n ans += M;\n ans %= M;\n dump(\"term\", u, l, d, r, ans);\n return ans;\n}\n\nint expr(int u, int l, int d, int r, int base){\n assert(l<r);\n reduce(u, l, d, r);\n dump(\"expr\", u, l, d, r);\n /*\n if(br(base, l, r)){\n return expr(u, l+2, d, r-2, base);\n }\n */\n int ans = 0;\n int stk = 0;\n reprb(j, l, r){\n if(s[base][j]==')') stk++;\n if(s[base][j]=='(') stk--;\n if(s[base].substr(j, 3)==\".+.\" && !stk){\n ans = expr(u, l, d, j, base) + term(u, j+3, d, r, base);\n break;\n }\n bool f = 0;\n if(j-2 >= l && endexpr.count(s[base].substr(j-2, 2))){\n f = 1;\n }\n if(j-1 == l && j+1 < r && '0' <= s[base][j-1] && s[base][j-1] <= '9'){\n f = 1;\n }\n //dump(j, f);\n if(s[base].substr(j, 3)==\".-.\" && f && !stk){\n ans = expr(u, l, d, j, base) - term(u, j+3, d, r, base);\n break;\n }\n if(j==l){\n ans = term(u, l, d, r, base);\n }\n }\n ans += M;\n ans %= M;\n dump(\"expr\", u, l, d, r, ans);\n return ans;\n}\n\nvoid solve() {\n endexpr.emplace(\"--\");\n endexpr.emplace(\".0\");\n endexpr.emplace(\".1\");\n endexpr.emplace(\".2\");\n endexpr.emplace(\".3\");\n endexpr.emplace(\".4\");\n endexpr.emplace(\".5\");\n endexpr.emplace(\".6\");\n endexpr.emplace(\".7\");\n endexpr.emplace(\".8\");\n endexpr.emplace(\".9\");\n endexpr.emplace(\".)\");\n endexpr.emplace(\").\");\n endexpr.emplace(\"0.\");\n endexpr.emplace(\"1.\");\n endexpr.emplace(\"2.\");\n endexpr.emplace(\"3.\");\n endexpr.emplace(\"4.\");\n endexpr.emplace(\"5.\");\n endexpr.emplace(\"6.\");\n endexpr.emplace(\"7.\");\n endexpr.emplace(\"8.\");\n endexpr.emplace(\"9.\");\n cin >> n;\n if(!n) exit(0);\n s.resize(n);\n rep(i, n) cin >> s[i];\n m = SZ(s[0]);\n repr(i, 1, M){\n repr(j, 1, M){\n if((i*j)%M==1) inv[i] = j;\n }\n }\n int base = -1;\n rep(i, n){\n if(s[i][0]!='.') base = i;\n }\n print(expr(0, 0, n, m, base));\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n //*\n //solve();\n /*/\n ll _cases;\n cin >> _cases;\n while (_cases--) solve();\n //*/\n while(1) solve();\n}","accuracy":1,"time_ms":420,"memory_kb":3376,"score_of_the_acc":-1.0974,"final_rank":8},{"submission_id":"aoj_1322_3349880","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint power[2011][2011], divis[2011][2011], mod = 2011;\n\nvoid init() {\n\tfor (int i = 0; i < 2011; i++) {\n\t\tpower[i][0] = 1; for (int j = 1; j < 2011; j++) power[i][j] = (power[i][j - 1] * i) % mod;\n\t}\n\tfor (int i = 0; i < 2011 * 2011; i++) divis[i / 2011][i % 2011] = -1;\n\tfor (int i = 0; i < 2011; i++) {\n\t\tfor (int j = 0; j < 2011; j++) {\n\t\t\tif (divis[(i * j) % mod][i] == -1) divis[(i * j) % mod][i] = j;\n\t\t}\n\t}\n}\n\nint modpow(int a, int b) { return power[a][b]; }\nint Div(int a, int b) { return divis[a][b]; }\n\nint solve(vector<string> A) {\n\t/*cout << endl;\n\tfor (int i = 0; i < A.size(); i++) cout << A[i] << endl;\n\tcout << endl;*/\n\n\t// ---------------------------------------- Step 1: 式を圧縮する ---------------------------------\n\tint px = (1 << 30), py = (1 << 30), qx = 0, qy = 0;\n\tfor (int i = 0; i < A.size(); i++) {\n\t\tfor (int j = 0; j < A[0].size(); j++) {\n\t\t\tif (A[i][j] == '.') continue;\n\t\t\tpx = min(px, i); py = min(py, j);\n\t\t\tqx = max(qx, i); qy = max(qy, j);\n\t\t}\n\t}\n\n\t// ---------------------------------------- Step 2: パースする -----------------------------------\n\tvector<string>B;\n\tfor (int i = px; i <= qx; i++) B.push_back(A[i].substr(py, qy - py + 1));\n\n\tint BASE = 0, H = B.size(), W = B[0].size();\n\tfor (int i = 0; i < H; i++) {\n\t\tif (B[i][0] != '.') { BASE = i; }\n\t}\n\n\tif (H == 1 && W == 1) return (B[0][0] - '0');\n\n\tvector<pair<int, int>>vec; int depth = 0; bool IsDiv = false;\n\tfor (int i = 0; i < W; i++) {\n\t\tif (B[BASE][i] == '(') depth++;\n\t\tif (B[BASE][i] == ')') depth--;\n\t\tif (depth == 0) {\n\t\t\tif (B[BASE][i] == '+') vec.push_back(make_pair(i, 1));\n\t\t\tif (B[BASE][i] == '-' && (i != W - 1 && B[BASE][i + 1] != '-') && (i != 0 && B[BASE][i - 1] != '-')) {\n\t\t\t\tbool ok = false;\n\t\t\t\tif (i == 0) ok = true;\n\t\t\t\tif (i >= 2) {\n\t\t\t\t\tif (B[BASE][i - 2] == '+') ok = true;\n\t\t\t\t\tif (B[BASE][i - 2] == '*') ok = true;\n\t\t\t\t\tif (B[BASE][i - 2] == '-' && (i == 2 || B[BASE][i - 3] != '-')) ok = true;\n\t\t\t\t}\n\t\t\t\tif (ok == false) vec.push_back(make_pair(i, 2));\n\t\t\t}\n\t\t\tif (B[BASE][i] == '-') IsDiv = true;\n\t\t}\n\t}\n\n\t// ---------------------------------------- Step 3: '+', '-' が存在する場合 ----------------------\n\tif (vec.size() >= 1) {\n\t\tvector<pair<int, int>>vec3;\n\t\tvec3.push_back(make_pair(-1, 1));\n\t\tfor (int i = 0; i < vec.size(); i++) vec3.push_back(vec[i]);\n\t\tvec3.push_back(make_pair(W, 1));\n\n\t\tbool ok = false; int res = 0;\n\t\tfor (int i = 1; i < vec3.size(); i++) {\n\t\t\tif (vec3[i].first - vec3[i - 1].first == 2) {\n\t\t\t\tif (vec3[i].second == 2) ok ^= true;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvector<string>A3;\n\t\t\t\tfor (int j = 0; j < H; j++) A3.push_back(B[j].substr(vec3[i - 1].first + 1, (vec3[i].first - 1) - (vec3[i - 1].first + 1) + 1));\n\n\t\t\t\tint rem = solve(A3);\n\t\t\t\tif (ok == false) res += rem; else res -= rem;\n\t\t\t\tres += mod; res %= mod;\n\n\t\t\t\tif (vec3[i].second == 1) ok = false;\n\t\t\t\telse ok = true;\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n\t// ---------------------------------------- Step 3.5: マイナスの処理 -----------------------------\n\tif (B[BASE][0] == '-' && (W >= 2 && B[BASE][1] == '.')) {\n\t\tvector<string>A4;\n\t\tfor (int i = 0; i < H; i++) A4.push_back(B[i].substr(1, W - 1));\n\t\tint p1 = solve(A4);\n\t\treturn (mod - p1) % mod;\n\t}\n\n\t// ---------------------------------------- Step 4: パース 2 個目 --------------------------------\n\tvector<int>vec2; depth = 0;\n\tfor (int i = 0; i < W; i++) {\n\t\tif (B[BASE][i] == '(') depth++;\n\t\tif (B[BASE][i] == ')') depth--;\n\t\tif (B[BASE][i] == '*' && depth == 0) vec2.push_back(i);\n\t}\n\n\t// ---------------------------------------- Step 5: '*' が存在する場合 ---------------------------\n\tif (vec2.size() >= 1) {\n\t\tvector<int>vec3; vec3.push_back(-1);\n\t\tfor (int i = 0; i < vec2.size(); i++) vec3.push_back(vec2[i]);\n\t\tvec3.push_back(W);\n\n\t\tint muls = 1;\n\t\tfor (int i = 0; i < vec3.size() - 1; i++) {\n\t\t\tvector<string>A5;\n\t\t\tfor (int j = 0; j < H; j++) A5.push_back(B[j].substr(vec3[i] + 1, (vec3[i + 1] - 1) - (vec3[i] + 1) + 1));\n\t\t\tint ret = solve(A5); muls *= ret; muls %= mod;\n\t\t}\n\t\treturn muls;\n\t}\n\n\t// ---------------------------------------- Step 6: '/' が存在する場合 ---------------------------\n\tif (IsDiv == true) {\n\t\tvector<string>A6a, A6b;\n\t\tfor (int i = 0; i < BASE; i++) A6a.push_back(B[i]);\n\t\tfor (int i = BASE + 1; i < H; i++) A6b.push_back(B[i]);\n\n\t\tint v1 = solve(A6a), v2 = solve(A6b);\n\t\tint rets = Div(v1, v2);\n\t\treturn rets;\n\t}\n\n\t// ---------------------------------------- Step 7: '(' が存在する場合 ---------------------------\n\tif (B[BASE][0] == '(' && B[BASE][W - 1] == ')') {\n\t\tvector<string> A7;\n\t\tfor (int i = 0; i < H; i++) A7.push_back(B[i].substr(1, W - 2));\n\t\treturn solve(A7);\n\t}\n\n\t// ---------------------------------------- Step 8: その他の場合（累乗） -------------------------\n\tint pows = (B[BASE - 1][W - 1] - '0');\n\tvector<string>A8;\n\tfor (int i = 0; i < H; i++) A8.push_back(B[i].substr(0, W - 1));\n\tint C8 = solve(A8);\n\treturn modpow(C8, pows);\n}\n\nint main() {\n\tinit();\n\twhile (true) {\n\t\tint n; cin >> n; if (n == 0) break;\n\t\tvector<string>vec;\n\t\tfor (int i = 0; i < n; i++) { string str; cin >> str; vec.push_back(str); }\n\n\t\tcout << solve(vec) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":34660,"score_of_the_acc":-1.122,"final_rank":9},{"submission_id":"aoj_1322_1060386","code_snippet":"#include<iostream>\n#include<cstring>\n\nusing namespace std;\n\nconst int M=2011;\nint inv[M+1];\nchar g[20][82];\nint cur;\n\nint expr(int,int,int,int);\n\nchar gcic(int c,int t,int b=99){\n for(;t<b;t++){\n if(g[t][c]!='.')return g[t][c];\n }\n return '.';\n}\n\nint sexpr(int t,int l,int b,int r){\n while(gcic(l,t,b)=='.'){\n l++;\n }\n cur=l;\n while(gcic(r-1,t,b)=='.'){\n r--;\n }\n return expr(t,l,b,r);\n}\n\nint factor(int t,int l,int b,int r){\n if(gcic(l,t)=='-'){\n if(gcic(l+1,t,b)=='.'){\n return (M-factor(t,l+2,b,r))%M;\n }else{\n int v;\n for(v=t;g[v][l]!='-';v++);\n int vr;\n for(vr=l;g[v][vr]=='-';vr++);\n int rv=(sexpr(t,l,v,vr)*inv[sexpr(v+1,l,b,vr)])%M;\n cur=vr;\n return rv;\n }\n }else{\n char c=gcic(l,t);\n int prm;\n if(c=='('){\n prm=expr(t,l+2,b,r-2);\n cur+=2;\n }else{\n prm=c-'0';\n cur=l+1;\n }\n char pc=gcic(cur,t,b);\n if(pc=='.'){\n return prm;\n }else{\n int rv=1;\n int p=pc-'0';\n cur++;\n while(p--){\n\trv=rv*prm%M;\n }\n return rv;\n }\n }\n}\n\nint term(int t,int l,int b,int r){\n int rv=factor(t,l,b,r);\n while(gcic(cur+1,t,b)=='*'){\n rv=(rv*factor(t,cur+3,b,r))%M;\n }\n return rv;\n}\n\nint expr(int t,int l,int b,int r){\n int rv=term(t,l,b,r);\n for(;;){\n char op=gcic(cur+1,t,b);\n if(op!='+'&&op!='-')break;\n int f=(op=='+')?1:-1;\n rv=(rv+f*term(t,cur+3,b,r)+M)%M;\n }\n return rv;\n}\n\nint main(){\n for(int i=1;i<=M;i++){\n for(int j=0;j<=M;j++){\n if(i*j%M==1){\n\tinv[i]=j;\n }\n }\n }\n int len;\n for(int n;cin>>n,n;){\n for(int i=0;i<n;i++){\n cin>>g[i];\n len=strlen(g[i]);\n for(int j=len;j<82;j++){\n\tg[i][j]='.';\n }\n }\n cur=0;\n cout<<expr(0,0,n,len)<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1180,"score_of_the_acc":-0.034,"final_rank":4},{"submission_id":"aoj_1322_1013452","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstring S[111];\nint id;\nint N;\nint L;\n\n#define MOD (2011)\n\nint Y[2012];\nvoid init(){\n for(int i=0;i<2011;i++){\n for(int j=0;j<2011;j++){\n if( i * j % MOD == 1 ) Y[i] = j;\n }\n }\n}\nint expr(int top,int bottom);\nint term(int top,int bottom);\nint factor(int top,int bottom);\nint powexpr(int top,int bottom);\nint primary(int top,int bottom);\nint fraction(int top,int bottom);\nint digit(int top,int bottom);\n\nint mod(int a,int m){\n //if( abs(a) < m ) return a;\n int ret = a%m;\n return ret<0?MOD+ret:ret;\n}\n\nint maxpow(int a,int b){\n int x = a;\n int ret = 1;\n while( b > 0 ){\n if( b & 1 ) ret = mod(ret*x,MOD);\n x = mod(x*x,MOD);\n b>>=1;\n }\n return ret;\n}\n\n\n\nint check(int top,int bottom,int index){\n while( index < L ){\n id = index;\n for(int i=top;i<=bottom;i++){\n if( S[i][index] != '.' ) return i;\n }\n ++index;\n }\n return -1;\n}\n\nvoid print(string s,int top,int bottom,int base){\n printf(\"%s top( %d ), bottom( %d ), base( %d ), id ( %d ), S[base][id]= %c \\n\\n\",\n\t s.c_str(),top,bottom,base,id,base==-1?'e':S[base][id]);\n}\n\nint expr(int top,int bottom) {\n int base = check(top,bottom,id); \n //print(\"expr\",top,bottom,base);\n if( base == -1 ) return 2012;\n int t = term(top,bottom);\n while( id < L && S[base][id] == '.' ){\n int tmp_id = id;\n id++;\n if( id < L && (S[base][id] == '+' || S[base][id] == '-') ){\n char op = S[base][id];\n id++;\n if( id < L && S[base][id] == '.' ){\n\tid++;\n\tint r = term(top,bottom);\n\t//print(\"expr return\",top,bottom,base);\n\t//printf(\" t = %d , r = %d\\n\",t,r);\n\tif( op == '+' ) t += r;\n\tif( op == '-' ) t -= r;\n\tt = mod(t,MOD);\n } else {\n\tid = tmp_id;\n\tbreak;\n }\n } else {\n id = tmp_id;\n break;\n }\n }\n return t;\n}\nint term(int top,int bottom) {\n int base = check(top,bottom,id);\n //print(\"term\",top,bottom,base);\n if( base == -1 ) return 2012;\n int t = factor(top,bottom);\n //print(\"term retrun\",top,bottom,base);\n //printf(\"t = %d\\n\",t);\n while( id < L && S[base][id] == '.' ){\n int tmp_id = id;\n id++;\n if( id < L && S[base][id] == '*' ){\n id++;\n if( id < L && S[base][id] == '.' ){\n\tid++;\n\tint r = factor(top,bottom);\n\t//print(\"term multi retrun\",top,bottom,base);\n\t//printf(\"t = %d\\n\",t);\n\tt = mod(t * r , MOD);\n\t//printf(\"r = %d t = %d\\n\",r,t);\n } else {\n\tid = tmp_id;\n\tbreak;\n }\n } else {\n id = tmp_id;\n break;\n }\n }\n return t;\n}\n\nint factor(int top,int bottom){\n int base = check(top,bottom,id);\n //print(\"factor\",top,bottom,base);\n if( base == -1 ) return 2012;\n int tmp_id;\n int t=2012;\n bool f = false;\n tmp_id = id;\n t = powexpr(top,bottom);\n if( t > 2011 ) {\n id = tmp_id;\n t = fraction(top,bottom);\n }\n if( t > 2011 ) {\n id = tmp_id; \n if( id+1 < L && S[base][id] == '-' && S[base][id+1] == '.' ) {\n id +=2;\n f = true;\n t = factor(top,bottom);\n } \n }\n if( f ) t *= -1;\n return mod(t,MOD); \n}\nint powexpr(int top,int bottom){\n int base = check(top,bottom,id);\n //print(\"powexpr\",top,bottom,base);\n if( base == -1 ) return 2012;\n int t = 2012;\n t = primary(top,bottom);\n if ( t == 2012 ) return 2012;\n if( id < L && base >0 && isdigit(S[base-1][id]) ){\n int r = digit(base-1,base-1);\n t = maxpow(t,r);\n //print(\"powexpr return \",top,bottom,base);\n //printf(\"t = %d\\n\",t);\n }\n return t;\n}\n\nint primary(int top,int bottom){\n int base = check(top,bottom,id);\n //print(\"primary\",top,bottom,base);\n if( base == -1 ) return 2012;\n int tmp_id = id;\n int t = digit(top,bottom);\n if ( t == 2012 ){\n id = tmp_id;\n if( id+1 < L && S[base][id] == '(' && S[base][id+1] == '.' ){\n id += 2;\n t = expr(top,bottom);\n if( t == 2012 ) return 2012;\n //print(\"primary return\",top,bottom,base);\n //printf(\"t = %d\\n\",t); \n id +=2;\n } else {\n return t;\n }\n }\n return t;\n}\n\nint fraction(int top,int bottom){\n int base = check(top,bottom,id);\n //print(\"fraction\",top,bottom,base);\n if( base == -1 ) return 2012;\n int t = 2012;\n if( id+2 < L && S[base][id] == '-' && S[base][id+1] == '-' && S[base][id+2] == '-' ){\n id++;\n int tmp_id = id;\n int p = expr(top,base-1);\n id = tmp_id;\n if( p == 2012 ) return 2012;\n int q = expr(base+1,bottom);\n if( q == 2012 ) return 2012;\n id = max(id,tmp_id);\n while( id < L && S[base][id] == '-' ) id++;\n //print(\"fraction return\",top,bottom,base);\n //printf(\"%d * Y[%d] = %d\\n\",p,q,Y[abs(q)]);\n t = mod(p*Y[abs(q)]*(q<0?-1:1),MOD);\n }\n return t;\n}\nint digit(int top,int bottom){\n int base = check( top,bottom,id );\n //print(\"digit\",top,bottom,base);\n if( base == -1 ) return 2012;\n int t=0;\n bool f = false;\n while( id < L && isdigit(S[base][id]) ){\n f = true;\n t *= 10;\n t += S[base][id]-'0';\n id++;\n }\n if( f ) return mod(t,MOD);\n return 2012;\n}\n\n\n\nint main(){\n init();\n while( cin >> N && N ){\n for(int i=0;i<N;i++){\n cin >> S[i];\n }\n id = 0;\n L = (int)S[0].size();\n int res = mod(expr(0,N-1),MOD);\n if( res < 0 ) res = 2011+res;\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1220,"score_of_the_acc":-0.0352,"final_rank":5},{"submission_id":"aoj_1322_657899","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <complex>\n#include <algorithm>\n#include <set>\n#include <map>\n#include <queue>\n#include <string>\n#include <cstring>\n#include <stack>\n#include <cmath>\n#include <iomanip>\n#include <sstream>\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef ll li;\ntypedef pair<int,int> PI;\n#define EPS (1e-10L)\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define REP(i, n) rep (i, n)\n#define F first\n#define S second\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n#define SZ(a) (int)((a).size())\n#define ALL(a) a.begin(),a.end()\n#define CLR(a) memset((a),0,sizeof(a))\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\ntemplate<typename T,typename U> ostream& operator<< (ostream& out, const pair<T,U>& val){return out << \"(\" << val.F << \", \" << val.S << \")\";}\ntemplate<class T> ostream& operator<< (ostream& out, const vector<T>& val){out << \"{\";rep(i,SZ(val)) out << (i?\", \":\"\") << val[i];return out << \"}\";}\nvoid pkuassert(bool t){t=1/t;};\nint dx[]={0,1,0,-1,1,1,-1,-1};\nint dy[]={1,0,-1,0,-1,1,1,-1};\n\nint n;\nstring in[20];\nint inv[3000];\n\nvoid normal(int &x1,int &y1,int &x2,int &y2){\n set<int> x,y;\n for(int i=x1;i<x2;++i)\n for(int j=y1;j<y2;++j){\n if(in[i][j]!='.'){\n x.insert(i);\n y.insert(j);\n }\n }\n x1 = *x.begin();\n x2 = *x.rbegin()+1;\n y1 = *y.begin();\n y2 = *y.rbegin()+1;\n}\n\nint expr(int,int,int,int);\nint term(int,int,int,int);\nint factor(int,int,int,int);\nint powexpr(int,int,int,int);\nint primary(int,int,int,int);\n\nint digit(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n //cout << \"digit \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl; \n int ret=0;\n while(y1<y2 && isdigit(in[x1][y1]))\n ret=(ret*10+in[x1][y1++]-'0')%2011;\n return ret;\n}\n\nint primary(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n //cout << \"primary \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n int base;\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n if(in[base][y1]=='(')\n return expr(x1,y1+1,x2,y2-1);\n return digit(x1,y1,x2,y2);\n}\n\nint fraction(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n int base;\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n int p=expr(base+1,y1,x2,y2);\n int c=expr(x1,y1,base,y2);\n return c*inv[p]%2011;\n}\n\nint powexpr(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n //cout << \"powexpr \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n int base;\n int base2=-1;\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n for(int j=x1;j<x2;++j)\n if(in[j][y2-1]!='.') base2=j;\n //cout << base << ' ' << base2 << endl;\n if(base2==base) return primary(x1,y1,x2,y2);\n\n int idx=y2-1;\n while(idx>=y1 && isdigit(in[base2][idx])) --idx;\n ++idx;\n int di=digit(base2,idx,base2+1,y2);\n int pr=primary(x1,y1,x2,idx);\n //cout << \"pr di \" << pr << ' ' << di << endl;\n int ret=1;\n rep(i,di) ret=(ret*pr)%2011;\n return ret;\n}\n\nint factor(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n //cout << \"factor \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl; \n int ret;\n int base;\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n\n if(in[base][y1]=='-' &&\n y1+1<y2 && in[base][y1+1]=='.')\n return ((-factor(x1,y1+2,x2,y2))%2011+2011)%2011;\n\n if(in[base][y1]=='-' &&\n y1+1<y2 && in[base][y1+1]=='-')\n return fraction(x1,y1,x2,y2);\n\n return powexpr(x1,y1,x2,y2);\n}\n\nint term(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n int ret;\n int base;\n //cout << \"term \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n int idx=-1;\n int pa=0;\n for(int j=y1;j<y2;++j){\n if(in[base][j]=='(') ++pa;\n if(in[base][j]==')') --pa;\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\n in[base][j]=='*' &&\n in[base][j+1]=='.' && pa==0){\n idx=j;\n break; \n }\n }\n \n if(idx!=-1) ret=factor(x1,y1,x2,idx-1);\n else return factor(x1,y1,x2,y2);\n y1 = idx+1;\n while(true){\n\n normal(x1,y1,x2,y2);\n idx=-1;\n int pa=0;\n \n for(int j=y1;j<y2;++j){\n if(in[base][j]=='(') ++pa;\n if(in[base][j]==')') --pa;\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\n in[base][j]=='*' &&\n in[base][j+1]=='.' && pa==0){\n idx=j;\n break;\n }\n }\n \n if(idx!=-1){\n int t=factor(x1,y1,x2,idx-1);\n ret=(ret*t)%2011;\n }else{\n int t=factor(x1,y1,x2,y2);\n ret=(ret*t)%2011;\n return ret;\n }\n y1 = idx+1;\n }\n return ret;\n}\n\nint expr(int x1,int y1,int x2,int y2){\n normal(x1,y1,x2,y2);\n int ret;\n int base;\n /*\n cout << \"expr \" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n for(int i=x1;i<x2;++i){\n for(int j=y1;j<y2;++j) cout << in[i][j];\n cout << endl;\n }\n */\n for(int j=x1;j<x2;++j)\n if(in[j][y1]!='.') base=j;\n int idx=-1;\n int pa=0;\n for(int j=y1;j<y2;++j){\n if(in[base][j]=='(') ++pa;\n if(in[base][j]==')') --pa;\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\n (in[base][j]=='+' ||\n (in[base][j]=='-' &&\n (j-2>=0 && in[base][j-2]!='*' &&\n in[base][j-2]!='+' &&\n (in[base][j-2]!='-' || (j-3>=0 && in[base][j-3]=='-'))))) &&\n in[base][j+1]=='.' && pa==0){\n idx=j;\n break;\n }\n }\n \n if(idx!=-1) ret=term(x1,y1,x2,idx-1);\n else return term(x1,y1,x2,y2);\n y1 = idx+1;\n while(true){\n normal(x1,y1,x2,y2);\n char op=in[base][idx];\n idx=-1;\n int pa=0;\n for(int j=y1;j<y2;++j){\n if(in[base][j]=='(') ++pa;\n if(in[base][j]==')') --pa;\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\n (in[base][j]=='+' ||\n (in[base][j]=='-' &&\n (j-2>=0 && in[base][j-2]!='*' &&\n in[base][j-2]!='+' &&\n (in[base][j-2]!='-' || (j-3>=0 && in[base][j-3]=='-'))))) &&\n in[base][j+1]=='.' && pa==0){\n idx=j;\n break; \n }\n }\n \n if(idx!=-1){\n int t=term(x1,y1,x2,idx-1);\n if(op=='+') ret=(ret+t)%2011;\n else ret=((ret-t)%2011+2011)%2011;\n }\n else{\n int t=term(x1,y1,x2,y2);\n //cout << op << ' ' << t << endl;\n if(op=='+') ret=(ret+t)%2011;\n else ret=((ret-t)%2011+2011)%2011;\n return ret;\n }\n y1 = idx+1; \n }\n return ret;\n}\n\nvoid solve(){\n rep(i, n) cin >> in[i];\n //rep(i, n) cout << in[i] << endl;\n cout << expr(0,0,n,SZ(in[0])) << endl;\n}\n\nint main(int argc, char *argv[])\n{\n rep(i,2011)rep(j,2011) if(i*j%2011==1) inv[i]=j;\n //cout << 4*inv[9] << endl;\n while(cin >> n && n) solve();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1232,"score_of_the_acc":-0.0599,"final_rank":6},{"submission_id":"aoj_1322_423240","code_snippet":"#include <iostream>\n#include <cstring>\n#include <string>\nusing namespace std;\n\nconst int MOD = 2011;\nint inv[2022];\nchar AA[100][100];\nbool visited[100][100];\n\nclass Result\n{\npublic:\n\tint x,y,v;\n\tResult()\n\t{}\n\n\tResult(int x, int y, int v)\n\t\t:x(x),y(y),v(v)\n\t{}\n};\n\nint findexpr(int x, int y, int d)\n{\n\twhile(1) {\n\t\tif(y < 0 || AA[y][x] == '!') break;\n\t\tif(visited[y][x]) break;\n\t\tif(AA[y][x] !='.') return y;\n\n\t\ty += d;\n\t}\n\n\treturn -1;\n}\n\nResult expr(int x, int y);\nResult term(int x, int y);\nResult factor(int x, int y);\nResult powexpr(int x, int y);\nResult primary(int x, int y);\nResult fraction(int x, int y);\nResult digit(int x, int y);\n\nResult expr(int x, int y)\n{\n\tvisited[y][x] = true;\n\tResult a = term(x,y);\n\tx = a.x; y = a.y;\n\n\twhile(AA[y][x+1] == '+' || AA[y][x+1] == '-') {\n\t\tvisited[y][x+1] = true;\n\t\tchar op = AA[y][x+1];\n\n\t\tResult b = term(x + 3, y);\n\t\tx = b.x; y = b.y;\n\t\t\n\t\tif(op == '+') a.v = (a.v + b.v) % MOD;\n\t\tif(op == '-') a.v = (a.v - b.v + MOD) % MOD;\n\t}\n\n\treturn Result(x,y,a.v);\n}\n\nResult term(int x, int y)\n{\n\tvisited[y][x] = true;\n\n\tResult a = factor(x, y);\n\tx = a.x; y = a.y;\n\n\twhile(AA[y][x+1] == '*') {\n\t\tvisited[y][x+1] = true;\n\n\t\tResult b = factor(x + 3, y);\n\t\tx = b.x; y = b.y;\n\t\ta.v *= b.v;\n\t\ta.v %= MOD;\n\t}\n\n\treturn Result(x,y,a.v);\n}\n\nResult factor(int x, int y)\n{\n\tvisited[y][x] = true;\n\n\tResult a;\n\tif(AA[y][x] == '-') {\n\t\tif(AA[y][x+1] == '-') {\n\t\t\ta = fraction(x, y);\n\t\t}\n\t\telse {\n\t\t\ta = factor(x + 2, y);\n\t\t\ta.v = (-a.v + MOD) % MOD;\n\t\t}\n\t}\n\telse {\n\t\ta = powexpr(x, y);\n\t}\n\n\treturn a;\n}\n\nResult powexpr(int x, int y)\n{\n\tvisited[y][x] = true;\n\n\tResult a = primary(x,y);\n\tx = a.x; y = a.y;\n\n\tif(y!=0 && isdigit(AA[y-1][x])) {\n\t\tint pw = AA[y-1][x] - '0';\n\t\tint p = a.v;\n\t\tint res = 1;\n\t\tfor(int i=0; i<pw; i++) {\n\t\t\tres *= p;\n\t\t\tres %= MOD;\n\t\t}\n\n\t\ta.v = res % MOD;\n\t\ta.x += 1;\n\t}\n\n\treturn a;\n}\n\nResult primary(int x, int y)\n{\n\tvisited[y][x] = true;\n\n\tResult a;\n\tif(isdigit(AA[y][x])) {\n\t\ta.v = AA[y][x] - '0';\n\t\ta.x = x + 1;\n\t\ta.y = y;\n\t}\n\telse {\n\t\ta = expr(x + 2,y);\n\t\ta.x += 2;\n\t}\n\n\treturn a;\n}\n\nResult fraction(int x, int y)\n{\n\tbool findTop=false, findBtm=false;\n\tResult t, b;\n\n\tint tx = x;\n\twhile(AA[y][x] == '-') {\n\t\tvisited[y][x] = true;\n\t\tx++;\n\t}\n\n\tx = tx;\n\twhile(AA[y][x] == '-') {\n\t\tif(!findTop) {\n\t\t\tint ty = findexpr(x,y-1,-1);\n\t\t\tif(ty != -1) {\n\t\t\t\tt = expr(x,ty);\n\t\t\t\tfindTop = true;\n\t\t\t}\n\t\t}\n\t\tif(!findBtm) {\n\t\t\tint by = findexpr(x,y+1,1);\n\t\t\tif(by != -1) {\n\t\t\t\tb = expr(x,by);\n\t\t\t\tfindBtm = true;\n\t\t\t}\n\t\t}\n\n\t\tx++;\n\t}\n\n\tResult res;\n\tres.x = x;\n\tres.y = y;\n\tres.v = t.v * inv[b.v] % MOD;\n\n\treturn res;\n}\n\nint main()\n{\n\tfor(int i=1; i<MOD; i++)\n\tfor(int j=1; j<MOD; j++) \n\t\tif(j * i % MOD == 1) inv[i] = j;\n\n\tint N;\n\twhile(cin >> N, N) {\n\t\tmemset(visited, 0, sizeof(visited));\n\t\tfor(int i=0; i<100; i++)\n\t\tfor(int j=0; j<100; j++)\n\t\t\tAA[j][i] = '!';\n\n\t\tfor(int i=0; i<N; i++)\n\t\t\tcin >> AA[i];\n\n\t\tcout << expr(0, findexpr(0,0,1)).v << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1322_413544","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nstatic int INV[2011] = { 0 };\n\nint mod(int x){\n\twhile(x < 0){ x += 2011; }\n\treturn x % 2011;\n}\n\nstruct Result {\n\tint p, v;\n};\n\n#define PARSER_DECL(name) \\\n\tResult name ( \\\n\t\tconst vector<string> &s, int left, int top, int right, int bottom)\n\nPARSER_DECL(expr);\nPARSER_DECL(term);\nPARSER_DECL(factor);\nPARSER_DECL(powexpr);\nPARSER_DECL(primary);\nPARSER_DECL(fraction);\nPARSER_DECL(digit);\n\nint calculateBase(\n\tconst vector<string> &s, int left, int top, int right, int bottom)\n{\n\tfor(int i = left; i < right; ++i){\n\t\tfor(int j = top; j < bottom; ++j){\n\t\t\tif(s[j][i] != '.'){ return j; }\n\t\t}\n\t}\n\treturn -1;\n}\n\nPARSER_DECL(expr){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tResult r = term(s, left, top, right, bottom);\n\tint next = r.p + 1;\n\twhile(next < right && (s[base][next] == '+' || s[base][next] == '-')){\n\t\tr.p += 3;\n\t\tResult q = term(s, r.p, top, right, bottom);\n\t\tif(s[base][next] == '+'){\n\t\t\tr.v = mod(r.v + q.v);\n\t\t}else{\n\t\t\tr.v = mod(r.v - q.v);\n\t\t}\n\t\tr.p = q.p;\n\t\tnext = q.p + 1;\n\t}\n\treturn r;\n}\nPARSER_DECL(term){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tResult r = factor(s, left, top, right, bottom);\n\tint next = r.p + 1;\n\twhile(next < right && s[base][next] == '*'){\n\t\tr.p += 3;\n\t\tResult q = factor(s, r.p, top, right, bottom);\n\t\tr.v = mod(r.v * q.v);\n\t\tr.p = q.p;\n\t\tnext = q.p + 1;\n\t}\n\treturn r;\n}\nPARSER_DECL(factor){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tint numNeg = 0, p = left;\n\twhile(s[base][p] == '-' && s[base][p + 1] == '.'){\n\t\t++numNeg;\n\t\tp += 2;\n\t}\n\tif(s[base][p] == '-'){\n\t\tResult r = fraction(s, p, top, right, bottom);\n\t\tif(numNeg % 2 == 1){ r.v = mod(-r.v); }\n\t\treturn r;\n\t}else{\n\t\tResult r = powexpr(s, p, top, right, bottom);\n\t\tif(numNeg % 2 == 1){ r.v = mod(-r.v); }\n\t\treturn r;\n\t}\n}\nPARSER_DECL(powexpr){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tResult r = primary(s, left, top, right, bottom);\n\tif(base > 0 && r.p < right && isdigit(s[base - 1][r.p])){\n\t\tResult q = digit(s, r.p, top, right, bottom);\n\t\tint v = 1;\n\t\tfor(int i = 0; i < q.v; ++i){ v = mod(v * r.v); }\n\t\tr.v = v;\n\t\tr.p = q.p;\n\t}\n\treturn r;\n}\nPARSER_DECL(primary){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tif(isdigit(s[base][left])){\n\t\tResult r = digit(s, left, top, right, bottom);\n\t\treturn r;\n\t}else{\n\t\tResult r = expr(s, left + 2, top, right, bottom);\n\t\tr.p += 2;\n\t\treturn r;\n\t}\n}\nPARSER_DECL(fraction){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tint length = 0;\n\tfor(int i = left; i < right; ++i, ++length){\n\t\tif(s[base][i] != '-'){ break; }\n\t}\n\tint upperBegin = left;\n\tfor(int i = 0; i < length; ++i, ++upperBegin){\n\t\tbool flag = false;\n\t\tfor(int j = top; j < base; ++j){\n\t\t\tflag = flag || (s[j][upperBegin] != '.');\n\t\t}\n\t\tif(flag){ break; }\n\t}\n\tint lowerBegin = left;\n\tfor(int i = 0; i < length; ++i, ++lowerBegin){\n\t\tbool flag = false;\n\t\tfor(int j = base + 1; j < bottom; ++j){\n\t\t\tflag = flag || (s[j][lowerBegin] != '.');\n\t\t}\n\t\tif(flag){ break; }\n\t}\n\tResult upper = expr(s, upperBegin, top, right, base);\n\tResult lower = expr(s, lowerBegin, base + 1, right, bottom);\n\tResult r;\n\tr.v = mod(upper.v * INV[lower.v]);\n\tr.p = left + length;\n\treturn r;\n}\nPARSER_DECL(digit){\n\tint base = calculateBase(s, left, top, right, bottom);\n\tResult r;\n\tr.v = s[base][left] - '0';\n\tr.p = left + 1;\n\treturn r;\n}\n\nint main(){\n\tfor(int y = 1; y < 2011; ++y){\n\t\tfor(int z = 1; z < 2011; ++z){\n\t\t\tif(z * y % 2011 == 1){ INV[y] = z; }\n\t\t}\n\t}\n\twhile(true){\n\t\tint n;\n\t\tcin >> n;\n\t\tif(n == 0){ break; }\n\t\tvector<string> s(n);\n\t\tfor(int i = 0; i < n; ++i){ cin >> s[i]; }\n\t\tResult r = expr(s, 0, 0, s[0].size(), n);\n\t\tcout << r.v << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1322_304384","code_snippet":"#include<cctype>\n#include<cstdio>\n#include<cassert>\n#include<cstring>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint inv[2011];\nchar E[20][81];\n\nint parse(int t,int l,int b,int r);\nint expr(int &idx,int y,int y1,int y2);\nint term(int &idx,int y,int y1,int y2);\nint factor(int &idx,int y,int y1,int y2);\nint powexpr(int &idx,int y,int y1,int y2);\nint primary(int &idx,int y,int y1,int y2);\nint fraction(int &idx,int y,int y1,int y2);\n\nint expr(int &idx,int y,int y1,int y2){\n\tint a=term(idx,y,y1,y2);\n\twhile(1){\n\t\tchar c=E[y][idx];\n\t\tif(c!='+' && c!='-') break;\n\t\tidx+=2;\n\t\tint b=term(idx,y,y1,y2);\n\t\tif(c=='+') a=(a+b)%2011;\n\t\tif(c=='-') a=(a-b+2011)%2011;\n\t}\n\treturn a;\n}\n\nint term(int &idx,int y,int y1,int y2){\n\tint a=factor(idx,y,y1,y2);\n\twhile(1){\n\t\tchar c=E[y][idx];\n\t\tif(c!='*') break;\n\n\t\tidx+=2;\n\t\tint b=factor(idx,y,y1,y2);\n\t\ta=a*b%2011;\n\t}\n\treturn a;\n}\n\nint factor(int &idx,int y,int y1,int y2){\n\tif(E[y][idx]=='-' && E[y][idx+1]!='-'){\n\t\tidx+=2;\n\t\treturn (-factor(idx,y,y1,y2)+2011)%2011;\n\t}\n\n\tif(E[y][idx]=='-' && E[y][idx+1]=='-'){\n\t\treturn fraction(idx,y,y1,y2);\n\t}\n\n\treturn powexpr(idx,y,y1,y2);\n}\n\nint powexpr(int &idx,int y,int y1,int y2){\n\tint a=primary(idx,y,y1,y2);\n\tif(y>0 && isdigit(E[y-1][idx-1])){\n\t\tint b=E[y-1][idx-1]-'0',c=1;\n\t\trep(i,b) c=c*a%2011;\n\t\ta=c;\n\t\tidx++;\n\t}\n\treturn a;\n}\n\nint primary(int &idx,int y,int y1,int y2){\n\tint a;\n\tif(isdigit(E[y][idx])){\n\t\ta=E[y][idx]-'0';\n\t}\n\telse{\n\t\tidx+=2;\n\t\ta=expr(idx,y,y1,y2);\n\t}\n\tidx+=2;\n\treturn a;\n}\n\nint fraction(int &idx,int y,int y1,int y2){\n\tint x1=idx+1;\n\twhile(E[y][idx]=='-') idx++;\n\tint x2=idx-1;\n\tidx++;\n\treturn parse(y1,x1,y,x2)*inv[parse(y+1,x1,y2,x2)]%2011;\n}\n\nint find_base_line(int t,int l,int b,int r){\n\tfor(int j=l;j<r;j++) for(int i=t;i<b;i++) if(E[i][j]!='.') return i;\n\tassert(0);\n}\n\nint parse(int t,int l,int b,int r){\n\tint y=find_base_line(t,l,b,r);\n\tint idx=l;\n\twhile(E[y][idx]=='.') idx++;\n\treturn expr(idx,y,t,b);\n}\n\nint main(){\n\trep(i,2011) rep(j,2011) if(i*j%2011==1) inv[i]=j;\n\n\tfor(int h;scanf(\"%d\",&h),h;){\n\t\trep(i,h){\n\t\t\trep(j,81) E[i][j]='\\0';\n\t\t\tscanf(\"%s\",E[i]);\n\t\t}\n\t\tprintf(\"%d\\n\",parse(0,0,h,strlen(E[0])));\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1322_5951862\",\n \"code_snippet\": \"#define MOD_TYPE 1\\n\\n#pragma region Macros\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n//#include <atcoder/all>\\n\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\n#if 0\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing Int = boost::multiprecision::cpp_int;\\nusing lld = boost::multiprecision::cpp_dec_float_100;\\n#endif\\n\\n#if 1\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n\\nusing ll = long long int;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pld = pair<ld, ld>;\\ntemplate <typename Q_type>\\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\\n\\n#if MOD_TYPE == 1\\nconstexpr ll MOD = ll(1e9 + 7);\\n#else\\n#if MOD_TYPE == 2\\nconstexpr ll MOD = 998244353;\\n#else\\nconstexpr ll MOD = 1000003;\\n#endif\\n#endif\\n\\nusing mint = static_modint<MOD>;\\nconstexpr int INF = (int)1e9 + 10;\\nconstexpr ll LINF = (ll)4e18;\\nconstexpr double PI = acos(-1.0);\\nconstexpr double EPS = 1e-11;\\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\\n\\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\\n#define repi(i, n) REPI(i, 0, n)\\n#define MP make_pair\\n#define MT make_tuple\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define possible(n) cout << ((n) ? \\\"possible\\\" : \\\"impossible\\\") << \\\"\\\\n\\\"\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << \\\"\\\\n\\\"\\n#define Yay(n) cout << ((n) ? \\\"Yay!\\\" : \\\":(\\\") << \\\"\\\\n\\\"\\n#define all(v) v.begin(), v.end()\\n#define NP(v) next_permutation(all(v))\\n#define dbg(x) cerr << #x << \\\":\\\" << x << \\\"\\\\n\\\";\\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\\n\\nstruct io_init {\\n io_init() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << setprecision(30) << setiosflags(ios::fixed);\\n };\\n} io_init;\\ntemplate <typename T>\\ninline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ninline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ninline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }\\ntemplate <typename A, size_t N, typename T>\\ninline void Fill(A (&array)[N], const T &val) {\\n fill((T *)array, (T *)(array + N), val);\\n}\\ntemplate <typename T>\\nvector<T> compress(vector<T> &v) {\\n vector<T> val = v;\\n sort(all(val)), val.erase(unique(all(val)), val.end());\\n for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();\\n return val;\\n}\\ntemplate <typename T, typename U>\\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nconstexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\nostream &operator<<(ostream &os, mint m) {\\n os << m.val();\\n return os;\\n}\\n\\nrandom_device seed_gen;\\nmt19937_64 engine(seed_gen());\\n\\nstruct BiCoef {\\n vector<mint> fact_, inv_, finv_;\\n BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\\n for (int i = 2; i < n; i++) {\\n fact_[i] = fact_[i - 1] * i;\\n inv_[i] = -inv_[MOD % i] * (MOD / i);\\n finv_[i] = finv_[i - 1] * inv_[i];\\n }\\n }\\n mint C(ll n, ll k) const noexcept {\\n if (n < k || n < 0 || k < 0) return 0;\\n return fact_[n] * finv_[k] * finv_[n - k];\\n }\\n mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }\\n mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }\\n mint Ch1(ll n, ll k) const noexcept {\\n if (n < 0 || k < 0) return 0;\\n mint res = 0;\\n for (int i = 0; i < n; i++)\\n res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);\\n return res;\\n }\\n mint fact(ll n) const noexcept {\\n if (n < 0) return 0;\\n return fact_[n];\\n }\\n mint inv(ll n) const noexcept {\\n if (n < 0) return 0;\\n return inv_[n];\\n }\\n mint finv(ll n) const noexcept {\\n if (n < 0) return 0;\\n return finv_[n];\\n }\\n};\\n\\nBiCoef bc(500010);\\n\\n#pragma endregion\\n\\ntemplate <typename T>\\nvoid icpc(T a) {\\n if (!a) exit(0);\\n}\\ntemplate <typename T, typename U>\\nvoid icpc(T a, U end) {\\n if (a == end) exit(0);\\n}\\n\\n// 端のスペースを削除\\nvoid clean(vector<string> &s) {\\n int n = s.size(), m = s[0].size();\\n vector<int> erase_i(n, 0), erase_j(m, 0);\\n rep(i, n) {\\n bool allspace = true;\\n rep(j, m) {\\n if (s[i][j] != '.') {\\n allspace = false;\\n break;\\n }\\n }\\n if (allspace)\\n erase_i[i] = 1;\\n else\\n break;\\n }\\n for (int i = n - 1; i >= 0; i--) {\\n bool allspace = true;\\n rep(j, m) {\\n if (s[i][j] != '.') {\\n allspace = false;\\n break;\\n }\\n }\\n if (allspace)\\n erase_i[i] = 1;\\n else\\n break;\\n }\\n rep(j, m) {\\n bool allspace = true;\\n rep(i, n) {\\n if (s[i][j] != '.') {\\n allspace = false;\\n break;\\n }\\n }\\n if (allspace)\\n erase_j[j] = 1;\\n else\\n break;\\n }\\n for (int j = m - 1; j >= 0; j--) {\\n bool allspace = true;\\n rep(i, n) {\\n if (s[i][j] != '.') {\\n allspace = false;\\n break;\\n }\\n }\\n if (allspace)\\n erase_j[j] = 1;\\n else\\n break;\\n }\\n\\n vector<string> res;\\n rep(i, n) {\\n if (erase_i[i]) continue;\\n res.emplace_back(\\\"\\\");\\n rep(j, m) {\\n if (erase_j[j]) continue;\\n res.back().push_back(s[i][j]);\\n }\\n }\\n s = res;\\n}\\n\\n// base の位置 (存在しない場合は-1)\\nint find_base(vector<string> s) {\\n int n = s.size(), m = s[0].size();\\n int Max = 0;\\n int base = -1;\\n rep(i, n) {\\n int Maxi = -1;\\n int cnt = 0;\\n rep(j, m) {\\n if (s[i][j] == '-')\\n cnt++;\\n else\\n cnt = 0;\\n if (cnt >= 2) {\\n chmax(Maxi, cnt);\\n }\\n }\\n if (chmax(Max, Maxi)) {\\n base = i;\\n }\\n }\\n return base;\\n}\\n\\n// 分割\\nvector<vector<string>> split(vector<string> &s, vector<int> &pos) {\\n int n = s.size(), m = s[0].size();\\n vector<vector<string>> res(pos.size() + 1, vector<string>(n));\\n rep(i, n) {\\n int pi = 0;\\n rep(j, m) {\\n if (pi < pos.size() and j == pos[pi]) {\\n pi++;\\n } else {\\n res[pi][i].push_back(s[i][j]);\\n }\\n }\\n }\\n for (auto &&r : res) clean(r);\\n return res;\\n}\\n\\nmodint expr(vector<string>);\\nmodint factor(vector<string>);\\nmodint powexpr(vector<string>);\\nmodint primary(vector<string>);\\nmodint fraction(vector<string>);\\nmodint digit(vector<string>);\\n\\nmodint expr_sub(vector<pair<char, modint>> &p) {\\n modint prod = 1;\\n modint res = 0;\\n int sgn = 1;\\n for (auto [op, val] : p) {\\n if (op == 'n') {\\n prod *= val;\\n } else if (op == '+') {\\n res += prod * sgn;\\n prod = 1;\\n sgn = 1;\\n } else if (op == '-') {\\n res += prod * sgn;\\n prod = 1;\\n sgn = -1;\\n }\\n }\\n res += prod * sgn;\\n return res;\\n}\\n\\n// term も兼ねる\\nmodint expr(vector<string> s) {\\n clean(s);\\n int n = s.size(), m = s[0].size();\\n\\n int base = find_base(s);\\n if (base == -1) base = n - 1;\\n vector<int> pos = {};\\n int blank = 0;\\n rep(j, m) {\\n bool allspace = true;\\n rep(i, n) {\\n if (s[i][j] != '.') {\\n allspace = false;\\n }\\n if (s[i][j] == '(') {\\n blank++;\\n } else if (s[i][j] == ')') {\\n blank--;\\n }\\n }\\n if (allspace and blank == 0) pos.emplace_back(j);\\n }\\n vector<vector<string>> v = split(s, pos);\\n\\n vector<pair<char, modint>> p(v.size());\\n rep(i, v.size()) {\\n char op = 'n';\\n modint val = 0;\\n if (v[i].size() == 1 and v[i][0].size() == 1) { // 演算子 or 数字\\n char c = v[i][0][0];\\n if (isdigit(c)) {\\n val = c - '0';\\n } else {\\n op = c;\\n }\\n } else {\\n val = factor(v[i]);\\n }\\n p[i] = {op, val};\\n }\\n\\n // *- と始めの - を圧縮\\n vector<pair<char, modint>> q;\\n bool minus = false;\\n rep(i, p.size()) {\\n if (i > 0 and p[i].first == '-' and p[i - 1].first != 'n' or\\n i == 0 and p[i].first == '-') {\\n minus ^= 1;\\n } else {\\n if (minus) {\\n assert(p[i].first == 'n');\\n p[i].second *= -1;\\n minus = false;\\n }\\n q.push_back(p[i]);\\n }\\n }\\n return expr_sub(q);\\n}\\n\\n// 先頭に - が付くものは expr でケアする\\nmodint factor(vector<string> s) {\\n int n = s.size(), m = s[0].size();\\n int base = find_base(s);\\n if (base == -1) base = n - 1;\\n if (s[base][m - 2] != '-') {\\n return powexpr(s);\\n }\\n return fraction(s);\\n}\\n\\nmodint powexpr(vector<string> s) {\\n clean(s);\\n int n = s.size(), m = s[0].size();\\n\\n if (n == 2 and m == 2) {\\n modint a = s[1][0] - '0';\\n int b = s[0][1] - '0';\\n if (b == 0)\\n return 1;\\n else\\n return a.pow(b);\\n } else if (n == 1 and m == 1) {\\n return s[0][0] - '0';\\n }\\n int base = find_base(s);\\n if (base == -1) base = n - 1;\\n if (s[base].back() == ')') {\\n return primary(s);\\n }\\n assert(s[base][m - 2] == ')');\\n assert(isdigit(s[base - 1][m - 1]));\\n int b = s[base - 1][m - 1] - '0';\\n rep(i, n) s[i].pop_back();\\n modint a = primary(s);\\n if (b == 0)\\n return 1;\\n else\\n return a.pow(b);\\n}\\n\\nmodint primary(vector<string> s) {\\n clean(s);\\n int n = s.size(), m = s[0].size();\\n\\n if (n == 1 and m == 1) return digit(s);\\n int base = find_base(s);\\n if (base == -1) base = n - 1;\\n assert(s[base][0] == '(');\\n assert(s[base].back() == ')');\\n assert(m >= 5);\\n vector<string> t(n);\\n rep(i, n) { t[i] = s[i].substr(2, m - 4); }\\n return expr(t);\\n}\\n\\nmodint fraction(vector<string> s) {\\n clean(s);\\n int base = find_base(s);\\n assert(base != -1);\\n vector<string> U, D;\\n rep(i, s.size()) {\\n if (i < base)\\n U.push_back(s[i]);\\n else if (i > base)\\n D.push_back(s[i]);\\n }\\n return expr(U) / expr(D);\\n}\\n\\nmodint digit(vector<string> s) {\\n clean(s);\\n assert(s.size() == 1 and s[0].size() == 1);\\n return s[0][0] - '0';\\n}\\n\\nvoid solve() {\\n int n;\\n cin >> n;\\n icpc(n);\\n vector<string> s(n);\\n rep(i, n) cin >> s[i];\\n cout << expr(s).val() << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n modint::set_mod(2011);\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9176,\n \"score_of_the_acc\": -0.2647,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1322_4972605\",\n \"code_snippet\": \"#pragma region template\\n#include <bits/stdc++.h>\\n//#include <boost/multiprecision/cpp_int.hpp>\\n// using cpp_int = boost::multiprecision::cpp_int;\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vld = vector<ld>;\\nusing vvld = vector<vld>;\\nusing vvvld = vector<vvld>;\\nusing vs = vector<string>;\\nusing pll = pair<ll, ll>;\\nusing vp = vector<pll>;\\ntemplate <typename T>\\nusing pqrev = priority_queue<T, vector<T>, greater<T>>;\\n#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)\\n#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)\\n#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)\\n#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)\\n#define ALL(a) (a).begin(), (a).end()\\n#define SZ(x) ((ll)(x).size())\\n#ifdef OJ_LOCAL\\n#include \\\"dump.hpp\\\"\\n#else\\n#define dump(...) ((void)0)\\n#endif\\nconstexpr ll INF = 1e+18;\\nconstexpr ld EPS = 1e-12L;\\nconstexpr ld PI = 3.14159265358979323846L;\\ntemplate <typename T>\\nconstexpr T local([[maybe_unused]] const T &lcl, [[maybe_unused]] const T &oj) {\\n#ifdef OJ_LOCAL\\n return lcl;\\n#else\\n return oj;\\n#endif\\n}\\ntemplate <typename S, typename T>\\nconstexpr bool chmax(S &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename S, typename T>\\nconstexpr bool chmin(S &a, const T &b) {\\n if (b < a) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T>\\nT max(const vector<T> &x) {\\n return *max_element(ALL(x));\\n}\\ntemplate <typename T>\\nT min(const vector<T> &x) {\\n return *min_element(ALL(x));\\n}\\ntemplate <typename T>\\npair<T, int> argmax(const vector<T> &x) {\\n int idx = 0;\\n T m = x[0];\\n repr(i, 1, SZ(x)) {\\n if (chmax(m, x[i])) idx = i;\\n }\\n return {m, idx};\\n}\\ntemplate <typename T>\\npair<T, int> argmin(const vector<T> &x) {\\n int idx = 0;\\n T m = x[0];\\n repr(i, 1, SZ(x)) {\\n if (chmin(m, x[i])) idx = i;\\n }\\n return {m, idx};\\n}\\ntemplate <typename T>\\nT sum(const vector<T> &x) {\\n return accumulate(ALL(x), T(0));\\n}\\n// last param -> T\\ntemplate <typename T>\\nvector<T> makev(size_t a, T b) {\\n return vector<T>(a, b);\\n}\\ntemplate <typename... Args>\\nauto makev(size_t sz, Args... args) {\\n return vector<decltype(makev(args...))>(sz, makev(args...));\\n}\\n\\ntemplate <typename T>\\nbool print_(const T &a) {\\n cout << a;\\n return true;\\n}\\ntemplate <typename T>\\nbool print_(const vector<T> &vec) {\\n for (auto &a : vec) {\\n cout << a;\\n if (&a != &vec.back()) cout << \\\" \\\";\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool print_(const vector<vector<T>> &vv) {\\n for (auto &v : vv) {\\n for (auto &a : v) {\\n cout << a;\\n if (&a != &v.back()) cout << \\\" \\\";\\n }\\n if (&v != &vv.back()) cout << \\\"\\\\n\\\";\\n }\\n return false;\\n}\\nvoid print() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head &&head, Tail &&... tail) {\\n bool f = print_(head);\\n if (sizeof...(tail) != 0) cout << (f ? \\\" \\\" : \\\"\\\\n\\\");\\n print(forward<Tail>(tail)...);\\n}\\n#pragma endregion\\n\\n//*\\nconstexpr ll MOD = 1e9 + 7;\\n/*/\\nconstexpr ll MOD = 998244353;\\n//*/\\n\\n#define PR(f) \\\\\\n do { \\\\\\n cout << ((f) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"; \\\\\\n return; \\\\\\n } while (0)\\n\\nint n, m;\\nvs s;\\n\\nvoid reduce(int &u, int &l, int &d, int &r){\\n //dump(\\\"reduce\\\", u, l, d, r);\\n repr(i, u, d){\\n bool f = 1;\\n repr(j, l, r){\\n if(s[i][j]!='.'){\\n f = 0;\\n break;\\n }\\n }\\n if(f) u++;\\n else break;\\n }\\n reprb(i, u, d){\\n bool f = 1;\\n repr(j, l, r){\\n if(s[i][j]!='.'){\\n f = 0;\\n break;\\n }\\n }\\n if(f) d--;\\n else break;\\n }\\n repr(j, l, r){\\n bool f = 1;\\n repr(i, u, d){\\n if(s[i][j]!='.'){\\n f = 0;\\n break;\\n }\\n }\\n if(f) l++;\\n else break;\\n }\\n reprb(j, l, r){\\n bool f = 1;\\n repr(i, u, d){\\n if(s[i][j]!='.'){\\n f = 0;\\n break;\\n }\\n }\\n if(f) r--;\\n else break;\\n }\\n}\\n\\nconst int M = 2011;\\nint inv[M];\\nunordered_set<string> endexpr;\\n\\nint expr(int u, int l, int d, int r, int base);\\nint term(int u, int l, int d, int r, int base);\\n\\nint digit(int u, int l){\\n dump(\\\"digit\\\", u, l, s[u][l]-'0');\\n return s[u][l]-'0';\\n}\\n\\nint primary(int u, int l, int d, int r, int base){\\n reduce(u, l, d, r);\\n dump(\\\"primary\\\", u, l, d, r);\\n int ans = 0;\\n if(s[base][l]=='('){\\n ans = expr(u, l+2, d, r-2, base);\\n }else{\\n ans = digit(base, l);\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"primary\\\", u, l, d, r, ans);\\n return ans;\\n}\\n\\nint powexpr(int u, int l, int d, int r, int base){\\n reduce(u, l, d, r);\\n dump(\\\"powexpr\\\", u, l, d, r);\\n /*\\n if(br(base, l, r)){\\n return expr(u, l+2, d, r-2, base);\\n }\\n */\\n int ans = 0;\\n if(s[base][r-1]=='.'){\\n int b = primary(u, l, d, r-1, base);\\n int c = digit(base-1, r-1);\\n ans = 1;\\n rep(t, c){\\n ans *= b;\\n ans %= M;\\n }\\n }else{\\n ans = primary(u, l, d, r, base);\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"powexpr\\\", u, l, d, r, ans);\\n return ans;\\n}\\n\\nint fraction(int u, int l, int d, int r, int base){\\n reduce(u, l, d, r);\\n dump(\\\"fraction\\\", u, l, d, r, base);\\n /*\\n if(br(base, l, r)){\\n return expr(u, l+2, d, r-2, base);\\n }\\n */\\n int ans = 0;\\n int nu = u, nl = l+1, nd = base, nr = r-1;\\n reduce(nu, nl, nd, nr);\\n repr(i, nu, nd){\\n if(s[i][nl]!='.'){\\n ans = expr(nu, nl, nd, nr, i);\\n break;\\n }\\n }\\n nu = base+1, nl = l+1, nd = d, nr = r-1;\\n reduce(nu, nl, nd, nr);\\n repr(i, nu, nd){\\n if(s[i][nl]!='.'){\\n ans *= inv[expr(nu, nl, nd, nr, i)];\\n break;\\n }\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"fraction\\\", u, l, d, r, base, ans);\\n return ans;\\n}\\n\\nint factor(int u, int l, int d, int r, int base){\\n reduce(u, l, d, r);\\n dump(\\\"factor\\\", u, l, d, r, base);\\n /*\\n if(br(base, l, r)){\\n return expr(u, l+2, d, r-2, base);\\n }\\n */\\n int ans = 0;\\n int stk = 0;\\n repr(j, l, r){\\n if(s[base][j]=='(') stk++;\\n if(s[base][j]==')') stk--;\\n if(s[base].substr(j, 3)==\\\".*.\\\" && !stk){\\n ans = term(u, l, d, j, base) * factor(u, j+3, d, r, base);\\n break;\\n }\\n }\\n if(s[base].substr(l, 2)==\\\"--\\\"){\\n ans = fraction(u, l, d, r, base);\\n }else if(s[base].substr(l, 2)==\\\"-.\\\"){\\n ans = -factor(u, l+2, d, r, base);\\n }else{\\n ans = powexpr(u, l, d, r, base);\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"factor\\\", u, l, d, r, ans);\\n return ans;\\n}\\n\\nint term(int u, int l, int d, int r, int base){\\n reduce(u, l, d, r);\\n dump(\\\"term\\\", u, l, d, r);\\n /*\\n if(br(base, l, r)){\\n return expr(u, l+2, d, r-2, base);\\n }\\n */\\n int ans = 0;\\n int stk = 0;\\n repr(j, l, r){\\n if(s[base][j]=='(') stk++;\\n if(s[base][j]==')') stk--;\\n if(s[base].substr(j, 3)==\\\".*.\\\" && !stk){\\n ans = factor(u, l, d, j, base) * term(u, j+3, d, r, base);\\n break;\\n }\\n if(j==r-1){\\n ans = factor(u, l, d, r, base);\\n }\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"term\\\", u, l, d, r, ans);\\n return ans;\\n}\\n\\nint expr(int u, int l, int d, int r, int base){\\n assert(l<r);\\n reduce(u, l, d, r);\\n dump(\\\"expr\\\", u, l, d, r);\\n /*\\n if(br(base, l, r)){\\n return expr(u, l+2, d, r-2, base);\\n }\\n */\\n int ans = 0;\\n int stk = 0;\\n reprb(j, l, r){\\n if(s[base][j]==')') stk++;\\n if(s[base][j]=='(') stk--;\\n if(s[base].substr(j, 3)==\\\".+.\\\" && !stk){\\n ans = expr(u, l, d, j, base) + term(u, j+3, d, r, base);\\n break;\\n }\\n bool f = 0;\\n if(j-2 >= l && endexpr.count(s[base].substr(j-2, 2))){\\n f = 1;\\n }\\n if(j-1 == l && j+1 < r && '0' <= s[base][j-1] && s[base][j-1] <= '9'){\\n f = 1;\\n }\\n //dump(j, f);\\n if(s[base].substr(j, 3)==\\\".-.\\\" && f && !stk){\\n ans = expr(u, l, d, j, base) - term(u, j+3, d, r, base);\\n break;\\n }\\n if(j==l){\\n ans = term(u, l, d, r, base);\\n }\\n }\\n ans += M;\\n ans %= M;\\n dump(\\\"expr\\\", u, l, d, r, ans);\\n return ans;\\n}\\n\\nvoid solve() {\\n endexpr.emplace(\\\"--\\\");\\n endexpr.emplace(\\\".0\\\");\\n endexpr.emplace(\\\".1\\\");\\n endexpr.emplace(\\\".2\\\");\\n endexpr.emplace(\\\".3\\\");\\n endexpr.emplace(\\\".4\\\");\\n endexpr.emplace(\\\".5\\\");\\n endexpr.emplace(\\\".6\\\");\\n endexpr.emplace(\\\".7\\\");\\n endexpr.emplace(\\\".8\\\");\\n endexpr.emplace(\\\".9\\\");\\n endexpr.emplace(\\\".)\\\");\\n endexpr.emplace(\\\").\\\");\\n endexpr.emplace(\\\"0.\\\");\\n endexpr.emplace(\\\"1.\\\");\\n endexpr.emplace(\\\"2.\\\");\\n endexpr.emplace(\\\"3.\\\");\\n endexpr.emplace(\\\"4.\\\");\\n endexpr.emplace(\\\"5.\\\");\\n endexpr.emplace(\\\"6.\\\");\\n endexpr.emplace(\\\"7.\\\");\\n endexpr.emplace(\\\"8.\\\");\\n endexpr.emplace(\\\"9.\\\");\\n cin >> n;\\n if(!n) exit(0);\\n s.resize(n);\\n rep(i, n) cin >> s[i];\\n m = SZ(s[0]);\\n repr(i, 1, M){\\n repr(j, 1, M){\\n if((i*j)%M==1) inv[i] = j;\\n }\\n }\\n int base = -1;\\n rep(i, n){\\n if(s[i][0]!='.') base = i;\\n }\\n print(expr(0, 0, n, m, base));\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n //*\\n //solve();\\n /*/\\n ll _cases;\\n cin >> _cases;\\n while (_cases--) solve();\\n //*/\\n while(1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -1.0974,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1322_3349880\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\n\\nint power[2011][2011], divis[2011][2011], mod = 2011;\\n\\nvoid init() {\\n\\tfor (int i = 0; i < 2011; i++) {\\n\\t\\tpower[i][0] = 1; for (int j = 1; j < 2011; j++) power[i][j] = (power[i][j - 1] * i) % mod;\\n\\t}\\n\\tfor (int i = 0; i < 2011 * 2011; i++) divis[i / 2011][i % 2011] = -1;\\n\\tfor (int i = 0; i < 2011; i++) {\\n\\t\\tfor (int j = 0; j < 2011; j++) {\\n\\t\\t\\tif (divis[(i * j) % mod][i] == -1) divis[(i * j) % mod][i] = j;\\n\\t\\t}\\n\\t}\\n}\\n\\nint modpow(int a, int b) { return power[a][b]; }\\nint Div(int a, int b) { return divis[a][b]; }\\n\\nint solve(vector<string> A) {\\n\\t/*cout << endl;\\n\\tfor (int i = 0; i < A.size(); i++) cout << A[i] << endl;\\n\\tcout << endl;*/\\n\\n\\t// ---------------------------------------- Step 1: 式を圧縮する ---------------------------------\\n\\tint px = (1 << 30), py = (1 << 30), qx = 0, qy = 0;\\n\\tfor (int i = 0; i < A.size(); i++) {\\n\\t\\tfor (int j = 0; j < A[0].size(); j++) {\\n\\t\\t\\tif (A[i][j] == '.') continue;\\n\\t\\t\\tpx = min(px, i); py = min(py, j);\\n\\t\\t\\tqx = max(qx, i); qy = max(qy, j);\\n\\t\\t}\\n\\t}\\n\\n\\t// ---------------------------------------- Step 2: パースする -----------------------------------\\n\\tvector<string>B;\\n\\tfor (int i = px; i <= qx; i++) B.push_back(A[i].substr(py, qy - py + 1));\\n\\n\\tint BASE = 0, H = B.size(), W = B[0].size();\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tif (B[i][0] != '.') { BASE = i; }\\n\\t}\\n\\n\\tif (H == 1 && W == 1) return (B[0][0] - '0');\\n\\n\\tvector<pair<int, int>>vec; int depth = 0; bool IsDiv = false;\\n\\tfor (int i = 0; i < W; i++) {\\n\\t\\tif (B[BASE][i] == '(') depth++;\\n\\t\\tif (B[BASE][i] == ')') depth--;\\n\\t\\tif (depth == 0) {\\n\\t\\t\\tif (B[BASE][i] == '+') vec.push_back(make_pair(i, 1));\\n\\t\\t\\tif (B[BASE][i] == '-' && (i != W - 1 && B[BASE][i + 1] != '-') && (i != 0 && B[BASE][i - 1] != '-')) {\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tif (i == 0) ok = true;\\n\\t\\t\\t\\tif (i >= 2) {\\n\\t\\t\\t\\t\\tif (B[BASE][i - 2] == '+') ok = true;\\n\\t\\t\\t\\t\\tif (B[BASE][i - 2] == '*') ok = true;\\n\\t\\t\\t\\t\\tif (B[BASE][i - 2] == '-' && (i == 2 || B[BASE][i - 3] != '-')) ok = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ok == false) vec.push_back(make_pair(i, 2));\\n\\t\\t\\t}\\n\\t\\t\\tif (B[BASE][i] == '-') IsDiv = true;\\n\\t\\t}\\n\\t}\\n\\n\\t// ---------------------------------------- Step 3: '+', '-' が存在する場合 ----------------------\\n\\tif (vec.size() >= 1) {\\n\\t\\tvector<pair<int, int>>vec3;\\n\\t\\tvec3.push_back(make_pair(-1, 1));\\n\\t\\tfor (int i = 0; i < vec.size(); i++) vec3.push_back(vec[i]);\\n\\t\\tvec3.push_back(make_pair(W, 1));\\n\\n\\t\\tbool ok = false; int res = 0;\\n\\t\\tfor (int i = 1; i < vec3.size(); i++) {\\n\\t\\t\\tif (vec3[i].first - vec3[i - 1].first == 2) {\\n\\t\\t\\t\\tif (vec3[i].second == 2) ok ^= true;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvector<string>A3;\\n\\t\\t\\t\\tfor (int j = 0; j < H; j++) A3.push_back(B[j].substr(vec3[i - 1].first + 1, (vec3[i].first - 1) - (vec3[i - 1].first + 1) + 1));\\n\\n\\t\\t\\t\\tint rem = solve(A3);\\n\\t\\t\\t\\tif (ok == false) res += rem; else res -= rem;\\n\\t\\t\\t\\tres += mod; res %= mod;\\n\\n\\t\\t\\t\\tif (vec3[i].second == 1) ok = false;\\n\\t\\t\\t\\telse ok = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// ---------------------------------------- Step 3.5: マイナスの処理 -----------------------------\\n\\tif (B[BASE][0] == '-' && (W >= 2 && B[BASE][1] == '.')) {\\n\\t\\tvector<string>A4;\\n\\t\\tfor (int i = 0; i < H; i++) A4.push_back(B[i].substr(1, W - 1));\\n\\t\\tint p1 = solve(A4);\\n\\t\\treturn (mod - p1) % mod;\\n\\t}\\n\\n\\t// ---------------------------------------- Step 4: パース 2 個目 --------------------------------\\n\\tvector<int>vec2; depth = 0;\\n\\tfor (int i = 0; i < W; i++) {\\n\\t\\tif (B[BASE][i] == '(') depth++;\\n\\t\\tif (B[BASE][i] == ')') depth--;\\n\\t\\tif (B[BASE][i] == '*' && depth == 0) vec2.push_back(i);\\n\\t}\\n\\n\\t// ---------------------------------------- Step 5: '*' が存在する場合 ---------------------------\\n\\tif (vec2.size() >= 1) {\\n\\t\\tvector<int>vec3; vec3.push_back(-1);\\n\\t\\tfor (int i = 0; i < vec2.size(); i++) vec3.push_back(vec2[i]);\\n\\t\\tvec3.push_back(W);\\n\\n\\t\\tint muls = 1;\\n\\t\\tfor (int i = 0; i < vec3.size() - 1; i++) {\\n\\t\\t\\tvector<string>A5;\\n\\t\\t\\tfor (int j = 0; j < H; j++) A5.push_back(B[j].substr(vec3[i] + 1, (vec3[i + 1] - 1) - (vec3[i] + 1) + 1));\\n\\t\\t\\tint ret = solve(A5); muls *= ret; muls %= mod;\\n\\t\\t}\\n\\t\\treturn muls;\\n\\t}\\n\\n\\t// ---------------------------------------- Step 6: '/' が存在する場合 ---------------------------\\n\\tif (IsDiv == true) {\\n\\t\\tvector<string>A6a, A6b;\\n\\t\\tfor (int i = 0; i < BASE; i++) A6a.push_back(B[i]);\\n\\t\\tfor (int i = BASE + 1; i < H; i++) A6b.push_back(B[i]);\\n\\n\\t\\tint v1 = solve(A6a), v2 = solve(A6b);\\n\\t\\tint rets = Div(v1, v2);\\n\\t\\treturn rets;\\n\\t}\\n\\n\\t// ---------------------------------------- Step 7: '(' が存在する場合 ---------------------------\\n\\tif (B[BASE][0] == '(' && B[BASE][W - 1] == ')') {\\n\\t\\tvector<string> A7;\\n\\t\\tfor (int i = 0; i < H; i++) A7.push_back(B[i].substr(1, W - 2));\\n\\t\\treturn solve(A7);\\n\\t}\\n\\n\\t// ---------------------------------------- Step 8: その他の場合（累乗） -------------------------\\n\\tint pows = (B[BASE - 1][W - 1] - '0');\\n\\tvector<string>A8;\\n\\tfor (int i = 0; i < H; i++) A8.push_back(B[i].substr(0, W - 1));\\n\\tint C8 = solve(A8);\\n\\treturn modpow(C8, pows);\\n}\\n\\nint main() {\\n\\tinit();\\n\\twhile (true) {\\n\\t\\tint n; cin >> n; if (n == 0) break;\\n\\t\\tvector<string>vec;\\n\\t\\tfor (int i = 0; i < n; i++) { string str; cin >> str; vec.push_back(str); }\\n\\n\\t\\tcout << solve(vec) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 34660,\n \"score_of_the_acc\": -1.122,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1322_1060386\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstring>\\n\\nusing namespace std;\\n\\nconst int M=2011;\\nint inv[M+1];\\nchar g[20][82];\\nint cur;\\n\\nint expr(int,int,int,int);\\n\\nchar gcic(int c,int t,int b=99){\\n for(;t<b;t++){\\n if(g[t][c]!='.')return g[t][c];\\n }\\n return '.';\\n}\\n\\nint sexpr(int t,int l,int b,int r){\\n while(gcic(l,t,b)=='.'){\\n l++;\\n }\\n cur=l;\\n while(gcic(r-1,t,b)=='.'){\\n r--;\\n }\\n return expr(t,l,b,r);\\n}\\n\\nint factor(int t,int l,int b,int r){\\n if(gcic(l,t)=='-'){\\n if(gcic(l+1,t,b)=='.'){\\n return (M-factor(t,l+2,b,r))%M;\\n }else{\\n int v;\\n for(v=t;g[v][l]!='-';v++);\\n int vr;\\n for(vr=l;g[v][vr]=='-';vr++);\\n int rv=(sexpr(t,l,v,vr)*inv[sexpr(v+1,l,b,vr)])%M;\\n cur=vr;\\n return rv;\\n }\\n }else{\\n char c=gcic(l,t);\\n int prm;\\n if(c=='('){\\n prm=expr(t,l+2,b,r-2);\\n cur+=2;\\n }else{\\n prm=c-'0';\\n cur=l+1;\\n }\\n char pc=gcic(cur,t,b);\\n if(pc=='.'){\\n return prm;\\n }else{\\n int rv=1;\\n int p=pc-'0';\\n cur++;\\n while(p--){\\n\\trv=rv*prm%M;\\n }\\n return rv;\\n }\\n }\\n}\\n\\nint term(int t,int l,int b,int r){\\n int rv=factor(t,l,b,r);\\n while(gcic(cur+1,t,b)=='*'){\\n rv=(rv*factor(t,cur+3,b,r))%M;\\n }\\n return rv;\\n}\\n\\nint expr(int t,int l,int b,int r){\\n int rv=term(t,l,b,r);\\n for(;;){\\n char op=gcic(cur+1,t,b);\\n if(op!='+'&&op!='-')break;\\n int f=(op=='+')?1:-1;\\n rv=(rv+f*term(t,cur+3,b,r)+M)%M;\\n }\\n return rv;\\n}\\n\\nint main(){\\n for(int i=1;i<=M;i++){\\n for(int j=0;j<=M;j++){\\n if(i*j%M==1){\\n\\tinv[i]=j;\\n }\\n }\\n }\\n int len;\\n for(int n;cin>>n,n;){\\n for(int i=0;i<n;i++){\\n cin>>g[i];\\n len=strlen(g[i]);\\n for(int j=len;j<82;j++){\\n\\tg[i][j]='.';\\n }\\n }\\n cur=0;\\n cout<<expr(0,0,n,len)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1180,\n \"score_of_the_acc\": -0.034,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1322_1013452\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstring S[111];\\nint id;\\nint N;\\nint L;\\n\\n#define MOD (2011)\\n\\nint Y[2012];\\nvoid init(){\\n for(int i=0;i<2011;i++){\\n for(int j=0;j<2011;j++){\\n if( i * j % MOD == 1 ) Y[i] = j;\\n }\\n }\\n}\\nint expr(int top,int bottom);\\nint term(int top,int bottom);\\nint factor(int top,int bottom);\\nint powexpr(int top,int bottom);\\nint primary(int top,int bottom);\\nint fraction(int top,int bottom);\\nint digit(int top,int bottom);\\n\\nint mod(int a,int m){\\n //if( abs(a) < m ) return a;\\n int ret = a%m;\\n return ret<0?MOD+ret:ret;\\n}\\n\\nint maxpow(int a,int b){\\n int x = a;\\n int ret = 1;\\n while( b > 0 ){\\n if( b & 1 ) ret = mod(ret*x,MOD);\\n x = mod(x*x,MOD);\\n b>>=1;\\n }\\n return ret;\\n}\\n\\n\\n\\nint check(int top,int bottom,int index){\\n while( index < L ){\\n id = index;\\n for(int i=top;i<=bottom;i++){\\n if( S[i][index] != '.' ) return i;\\n }\\n ++index;\\n }\\n return -1;\\n}\\n\\nvoid print(string s,int top,int bottom,int base){\\n printf(\\\"%s top( %d ), bottom( %d ), base( %d ), id ( %d ), S[base][id]= %c \\\\n\\\\n\\\",\\n\\t s.c_str(),top,bottom,base,id,base==-1?'e':S[base][id]);\\n}\\n\\nint expr(int top,int bottom) {\\n int base = check(top,bottom,id); \\n //print(\\\"expr\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int t = term(top,bottom);\\n while( id < L && S[base][id] == '.' ){\\n int tmp_id = id;\\n id++;\\n if( id < L && (S[base][id] == '+' || S[base][id] == '-') ){\\n char op = S[base][id];\\n id++;\\n if( id < L && S[base][id] == '.' ){\\n\\tid++;\\n\\tint r = term(top,bottom);\\n\\t//print(\\\"expr return\\\",top,bottom,base);\\n\\t//printf(\\\" t = %d , r = %d\\\\n\\\",t,r);\\n\\tif( op == '+' ) t += r;\\n\\tif( op == '-' ) t -= r;\\n\\tt = mod(t,MOD);\\n } else {\\n\\tid = tmp_id;\\n\\tbreak;\\n }\\n } else {\\n id = tmp_id;\\n break;\\n }\\n }\\n return t;\\n}\\nint term(int top,int bottom) {\\n int base = check(top,bottom,id);\\n //print(\\\"term\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int t = factor(top,bottom);\\n //print(\\\"term retrun\\\",top,bottom,base);\\n //printf(\\\"t = %d\\\\n\\\",t);\\n while( id < L && S[base][id] == '.' ){\\n int tmp_id = id;\\n id++;\\n if( id < L && S[base][id] == '*' ){\\n id++;\\n if( id < L && S[base][id] == '.' ){\\n\\tid++;\\n\\tint r = factor(top,bottom);\\n\\t//print(\\\"term multi retrun\\\",top,bottom,base);\\n\\t//printf(\\\"t = %d\\\\n\\\",t);\\n\\tt = mod(t * r , MOD);\\n\\t//printf(\\\"r = %d t = %d\\\\n\\\",r,t);\\n } else {\\n\\tid = tmp_id;\\n\\tbreak;\\n }\\n } else {\\n id = tmp_id;\\n break;\\n }\\n }\\n return t;\\n}\\n\\nint factor(int top,int bottom){\\n int base = check(top,bottom,id);\\n //print(\\\"factor\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int tmp_id;\\n int t=2012;\\n bool f = false;\\n tmp_id = id;\\n t = powexpr(top,bottom);\\n if( t > 2011 ) {\\n id = tmp_id;\\n t = fraction(top,bottom);\\n }\\n if( t > 2011 ) {\\n id = tmp_id; \\n if( id+1 < L && S[base][id] == '-' && S[base][id+1] == '.' ) {\\n id +=2;\\n f = true;\\n t = factor(top,bottom);\\n } \\n }\\n if( f ) t *= -1;\\n return mod(t,MOD); \\n}\\nint powexpr(int top,int bottom){\\n int base = check(top,bottom,id);\\n //print(\\\"powexpr\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int t = 2012;\\n t = primary(top,bottom);\\n if ( t == 2012 ) return 2012;\\n if( id < L && base >0 && isdigit(S[base-1][id]) ){\\n int r = digit(base-1,base-1);\\n t = maxpow(t,r);\\n //print(\\\"powexpr return \\\",top,bottom,base);\\n //printf(\\\"t = %d\\\\n\\\",t);\\n }\\n return t;\\n}\\n\\nint primary(int top,int bottom){\\n int base = check(top,bottom,id);\\n //print(\\\"primary\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int tmp_id = id;\\n int t = digit(top,bottom);\\n if ( t == 2012 ){\\n id = tmp_id;\\n if( id+1 < L && S[base][id] == '(' && S[base][id+1] == '.' ){\\n id += 2;\\n t = expr(top,bottom);\\n if( t == 2012 ) return 2012;\\n //print(\\\"primary return\\\",top,bottom,base);\\n //printf(\\\"t = %d\\\\n\\\",t); \\n id +=2;\\n } else {\\n return t;\\n }\\n }\\n return t;\\n}\\n\\nint fraction(int top,int bottom){\\n int base = check(top,bottom,id);\\n //print(\\\"fraction\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int t = 2012;\\n if( id+2 < L && S[base][id] == '-' && S[base][id+1] == '-' && S[base][id+2] == '-' ){\\n id++;\\n int tmp_id = id;\\n int p = expr(top,base-1);\\n id = tmp_id;\\n if( p == 2012 ) return 2012;\\n int q = expr(base+1,bottom);\\n if( q == 2012 ) return 2012;\\n id = max(id,tmp_id);\\n while( id < L && S[base][id] == '-' ) id++;\\n //print(\\\"fraction return\\\",top,bottom,base);\\n //printf(\\\"%d * Y[%d] = %d\\\\n\\\",p,q,Y[abs(q)]);\\n t = mod(p*Y[abs(q)]*(q<0?-1:1),MOD);\\n }\\n return t;\\n}\\nint digit(int top,int bottom){\\n int base = check( top,bottom,id );\\n //print(\\\"digit\\\",top,bottom,base);\\n if( base == -1 ) return 2012;\\n int t=0;\\n bool f = false;\\n while( id < L && isdigit(S[base][id]) ){\\n f = true;\\n t *= 10;\\n t += S[base][id]-'0';\\n id++;\\n }\\n if( f ) return mod(t,MOD);\\n return 2012;\\n}\\n\\n\\n\\nint main(){\\n init();\\n while( cin >> N && N ){\\n for(int i=0;i<N;i++){\\n cin >> S[i];\\n }\\n id = 0;\\n L = (int)S[0].size();\\n int res = mod(expr(0,N-1),MOD);\\n if( res < 0 ) res = 2011+res;\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.0352,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1322_657899\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <complex>\\n#include <algorithm>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <string>\\n#include <cstring>\\n#include <stack>\\n#include <cmath>\\n#include <iomanip>\\n#include <sstream>\\n#include <cassert>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef ll li;\\ntypedef pair<int,int> PI;\\n#define EPS (1e-10L)\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define REP(i, n) rep (i, n)\\n#define F first\\n#define S second\\n#define mp(a,b) make_pair(a,b)\\n#define pb(a) push_back(a)\\n#define SZ(a) (int)((a).size())\\n#define ALL(a) a.begin(),a.end()\\n#define CLR(a) memset((a),0,sizeof(a))\\n#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)\\ntemplate<typename T,typename U> ostream& operator<< (ostream& out, const pair<T,U>& val){return out << \\\"(\\\" << val.F << \\\", \\\" << val.S << \\\")\\\";}\\ntemplate<class T> ostream& operator<< (ostream& out, const vector<T>& val){out << \\\"{\\\";rep(i,SZ(val)) out << (i?\\\", \\\":\\\"\\\") << val[i];return out << \\\"}\\\";}\\nvoid pkuassert(bool t){t=1/t;};\\nint dx[]={0,1,0,-1,1,1,-1,-1};\\nint dy[]={1,0,-1,0,-1,1,1,-1};\\n\\nint n;\\nstring in[20];\\nint inv[3000];\\n\\nvoid normal(int &x1,int &y1,int &x2,int &y2){\\n set<int> x,y;\\n for(int i=x1;i<x2;++i)\\n for(int j=y1;j<y2;++j){\\n if(in[i][j]!='.'){\\n x.insert(i);\\n y.insert(j);\\n }\\n }\\n x1 = *x.begin();\\n x2 = *x.rbegin()+1;\\n y1 = *y.begin();\\n y2 = *y.rbegin()+1;\\n}\\n\\nint expr(int,int,int,int);\\nint term(int,int,int,int);\\nint factor(int,int,int,int);\\nint powexpr(int,int,int,int);\\nint primary(int,int,int,int);\\n\\nint digit(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n //cout << \\\"digit \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl; \\n int ret=0;\\n while(y1<y2 && isdigit(in[x1][y1]))\\n ret=(ret*10+in[x1][y1++]-'0')%2011;\\n return ret;\\n}\\n\\nint primary(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n //cout << \\\"primary \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\\n int base;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n if(in[base][y1]=='(')\\n return expr(x1,y1+1,x2,y2-1);\\n return digit(x1,y1,x2,y2);\\n}\\n\\nint fraction(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n int base;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n int p=expr(base+1,y1,x2,y2);\\n int c=expr(x1,y1,base,y2);\\n return c*inv[p]%2011;\\n}\\n\\nint powexpr(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n //cout << \\\"powexpr \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\\n int base;\\n int base2=-1;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y2-1]!='.') base2=j;\\n //cout << base << ' ' << base2 << endl;\\n if(base2==base) return primary(x1,y1,x2,y2);\\n\\n int idx=y2-1;\\n while(idx>=y1 && isdigit(in[base2][idx])) --idx;\\n ++idx;\\n int di=digit(base2,idx,base2+1,y2);\\n int pr=primary(x1,y1,x2,idx);\\n //cout << \\\"pr di \\\" << pr << ' ' << di << endl;\\n int ret=1;\\n rep(i,di) ret=(ret*pr)%2011;\\n return ret;\\n}\\n\\nint factor(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n //cout << \\\"factor \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl; \\n int ret;\\n int base;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n\\n if(in[base][y1]=='-' &&\\n y1+1<y2 && in[base][y1+1]=='.')\\n return ((-factor(x1,y1+2,x2,y2))%2011+2011)%2011;\\n\\n if(in[base][y1]=='-' &&\\n y1+1<y2 && in[base][y1+1]=='-')\\n return fraction(x1,y1,x2,y2);\\n\\n return powexpr(x1,y1,x2,y2);\\n}\\n\\nint term(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n int ret;\\n int base;\\n //cout << \\\"term \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n int idx=-1;\\n int pa=0;\\n for(int j=y1;j<y2;++j){\\n if(in[base][j]=='(') ++pa;\\n if(in[base][j]==')') --pa;\\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\\n in[base][j]=='*' &&\\n in[base][j+1]=='.' && pa==0){\\n idx=j;\\n break; \\n }\\n }\\n \\n if(idx!=-1) ret=factor(x1,y1,x2,idx-1);\\n else return factor(x1,y1,x2,y2);\\n y1 = idx+1;\\n while(true){\\n\\n normal(x1,y1,x2,y2);\\n idx=-1;\\n int pa=0;\\n \\n for(int j=y1;j<y2;++j){\\n if(in[base][j]=='(') ++pa;\\n if(in[base][j]==')') --pa;\\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\\n in[base][j]=='*' &&\\n in[base][j+1]=='.' && pa==0){\\n idx=j;\\n break;\\n }\\n }\\n \\n if(idx!=-1){\\n int t=factor(x1,y1,x2,idx-1);\\n ret=(ret*t)%2011;\\n }else{\\n int t=factor(x1,y1,x2,y2);\\n ret=(ret*t)%2011;\\n return ret;\\n }\\n y1 = idx+1;\\n }\\n return ret;\\n}\\n\\nint expr(int x1,int y1,int x2,int y2){\\n normal(x1,y1,x2,y2);\\n int ret;\\n int base;\\n /*\\n cout << \\\"expr \\\" << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\\n for(int i=x1;i<x2;++i){\\n for(int j=y1;j<y2;++j) cout << in[i][j];\\n cout << endl;\\n }\\n */\\n for(int j=x1;j<x2;++j)\\n if(in[j][y1]!='.') base=j;\\n int idx=-1;\\n int pa=0;\\n for(int j=y1;j<y2;++j){\\n if(in[base][j]=='(') ++pa;\\n if(in[base][j]==')') --pa;\\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\\n (in[base][j]=='+' ||\\n (in[base][j]=='-' &&\\n (j-2>=0 && in[base][j-2]!='*' &&\\n in[base][j-2]!='+' &&\\n (in[base][j-2]!='-' || (j-3>=0 && in[base][j-3]=='-'))))) &&\\n in[base][j+1]=='.' && pa==0){\\n idx=j;\\n break;\\n }\\n }\\n \\n if(idx!=-1) ret=term(x1,y1,x2,idx-1);\\n else return term(x1,y1,x2,y2);\\n y1 = idx+1;\\n while(true){\\n normal(x1,y1,x2,y2);\\n char op=in[base][idx];\\n idx=-1;\\n int pa=0;\\n for(int j=y1;j<y2;++j){\\n if(in[base][j]=='(') ++pa;\\n if(in[base][j]==')') --pa;\\n if(j-1>=y1 && j+1<y2 && in[base][j-1]=='.' &&\\n (in[base][j]=='+' ||\\n (in[base][j]=='-' &&\\n (j-2>=0 && in[base][j-2]!='*' &&\\n in[base][j-2]!='+' &&\\n (in[base][j-2]!='-' || (j-3>=0 && in[base][j-3]=='-'))))) &&\\n in[base][j+1]=='.' && pa==0){\\n idx=j;\\n break; \\n }\\n }\\n \\n if(idx!=-1){\\n int t=term(x1,y1,x2,idx-1);\\n if(op=='+') ret=(ret+t)%2011;\\n else ret=((ret-t)%2011+2011)%2011;\\n }\\n else{\\n int t=term(x1,y1,x2,y2);\\n //cout << op << ' ' << t << endl;\\n if(op=='+') ret=(ret+t)%2011;\\n else ret=((ret-t)%2011+2011)%2011;\\n return ret;\\n }\\n y1 = idx+1; \\n }\\n return ret;\\n}\\n\\nvoid solve(){\\n rep(i, n) cin >> in[i];\\n //rep(i, n) cout << in[i] << endl;\\n cout << expr(0,0,n,SZ(in[0])) << endl;\\n}\\n\\nint main(int argc, char *argv[])\\n{\\n rep(i,2011)rep(j,2011) if(i*j%2011==1) inv[i]=j;\\n //cout << 4*inv[9] << endl;\\n while(cin >> n && n) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.0599,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1322_423240\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n#include <string>\\nusing namespace std;\\n\\nconst int MOD = 2011;\\nint inv[2022];\\nchar AA[100][100];\\nbool visited[100][100];\\n\\nclass Result\\n{\\npublic:\\n\\tint x,y,v;\\n\\tResult()\\n\\t{}\\n\\n\\tResult(int x, int y, int v)\\n\\t\\t:x(x),y(y),v(v)\\n\\t{}\\n};\\n\\nint findexpr(int x, int y, int d)\\n{\\n\\twhile(1) {\\n\\t\\tif(y < 0 || AA[y][x] == '!') break;\\n\\t\\tif(visited[y][x]) break;\\n\\t\\tif(AA[y][x] !='.') return y;\\n\\n\\t\\ty += d;\\n\\t}\\n\\n\\treturn -1;\\n}\\n\\nResult expr(int x, int y);\\nResult term(int x, int y);\\nResult factor(int x, int y);\\nResult powexpr(int x, int y);\\nResult primary(int x, int y);\\nResult fraction(int x, int y);\\nResult digit(int x, int y);\\n\\nResult expr(int x, int y)\\n{\\n\\tvisited[y][x] = true;\\n\\tResult a = term(x,y);\\n\\tx = a.x; y = a.y;\\n\\n\\twhile(AA[y][x+1] == '+' || AA[y][x+1] == '-') {\\n\\t\\tvisited[y][x+1] = true;\\n\\t\\tchar op = AA[y][x+1];\\n\\n\\t\\tResult b = term(x + 3, y);\\n\\t\\tx = b.x; y = b.y;\\n\\t\\t\\n\\t\\tif(op == '+') a.v = (a.v + b.v) % MOD;\\n\\t\\tif(op == '-') a.v = (a.v - b.v + MOD) % MOD;\\n\\t}\\n\\n\\treturn Result(x,y,a.v);\\n}\\n\\nResult term(int x, int y)\\n{\\n\\tvisited[y][x] = true;\\n\\n\\tResult a = factor(x, y);\\n\\tx = a.x; y = a.y;\\n\\n\\twhile(AA[y][x+1] == '*') {\\n\\t\\tvisited[y][x+1] = true;\\n\\n\\t\\tResult b = factor(x + 3, y);\\n\\t\\tx = b.x; y = b.y;\\n\\t\\ta.v *= b.v;\\n\\t\\ta.v %= MOD;\\n\\t}\\n\\n\\treturn Result(x,y,a.v);\\n}\\n\\nResult factor(int x, int y)\\n{\\n\\tvisited[y][x] = true;\\n\\n\\tResult a;\\n\\tif(AA[y][x] == '-') {\\n\\t\\tif(AA[y][x+1] == '-') {\\n\\t\\t\\ta = fraction(x, y);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\ta = factor(x + 2, y);\\n\\t\\t\\ta.v = (-a.v + MOD) % MOD;\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\ta = powexpr(x, y);\\n\\t}\\n\\n\\treturn a;\\n}\\n\\nResult powexpr(int x, int y)\\n{\\n\\tvisited[y][x] = true;\\n\\n\\tResult a = primary(x,y);\\n\\tx = a.x; y = a.y;\\n\\n\\tif(y!=0 && isdigit(AA[y-1][x])) {\\n\\t\\tint pw = AA[y-1][x] - '0';\\n\\t\\tint p = a.v;\\n\\t\\tint res = 1;\\n\\t\\tfor(int i=0; i<pw; i++) {\\n\\t\\t\\tres *= p;\\n\\t\\t\\tres %= MOD;\\n\\t\\t}\\n\\n\\t\\ta.v = res % MOD;\\n\\t\\ta.x += 1;\\n\\t}\\n\\n\\treturn a;\\n}\\n\\nResult primary(int x, int y)\\n{\\n\\tvisited[y][x] = true;\\n\\n\\tResult a;\\n\\tif(isdigit(AA[y][x])) {\\n\\t\\ta.v = AA[y][x] - '0';\\n\\t\\ta.x = x + 1;\\n\\t\\ta.y = y;\\n\\t}\\n\\telse {\\n\\t\\ta = expr(x + 2,y);\\n\\t\\ta.x += 2;\\n\\t}\\n\\n\\treturn a;\\n}\\n\\nResult fraction(int x, int y)\\n{\\n\\tbool findTop=false, findBtm=false;\\n\\tResult t, b;\\n\\n\\tint tx = x;\\n\\twhile(AA[y][x] == '-') {\\n\\t\\tvisited[y][x] = true;\\n\\t\\tx++;\\n\\t}\\n\\n\\tx = tx;\\n\\twhile(AA[y][x] == '-') {\\n\\t\\tif(!findTop) {\\n\\t\\t\\tint ty = findexpr(x,y-1,-1);\\n\\t\\t\\tif(ty != -1) {\\n\\t\\t\\t\\tt = expr(x,ty);\\n\\t\\t\\t\\tfindTop = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!findBtm) {\\n\\t\\t\\tint by = findexpr(x,y+1,1);\\n\\t\\t\\tif(by != -1) {\\n\\t\\t\\t\\tb = expr(x,by);\\n\\t\\t\\t\\tfindBtm = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tx++;\\n\\t}\\n\\n\\tResult res;\\n\\tres.x = x;\\n\\tres.y = y;\\n\\tres.v = t.v * inv[b.v] % MOD;\\n\\n\\treturn res;\\n}\\n\\nint main()\\n{\\n\\tfor(int i=1; i<MOD; i++)\\n\\tfor(int j=1; j<MOD; j++) \\n\\t\\tif(j * i % MOD == 1) inv[i] = j;\\n\\n\\tint N;\\n\\twhile(cin >> N, N) {\\n\\t\\tmemset(visited, 0, sizeof(visited));\\n\\t\\tfor(int i=0; i<100; i++)\\n\\t\\tfor(int j=0; j<100; j++)\\n\\t\\t\\tAA[j][i] = '!';\\n\\n\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t\\tcin >> AA[i];\\n\\n\\t\\tcout << expr(0, findexpr(0,0,1)).v << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1322_413544\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nstatic int INV[2011] = { 0 };\\n\\nint mod(int x){\\n\\twhile(x < 0){ x += 2011; }\\n\\treturn x % 2011;\\n}\\n\\nstruct Result {\\n\\tint p, v;\\n};\\n\\n#define PARSER_DECL(name) \\\\\\n\\tResult name ( \\\\\\n\\t\\tconst vector<string> &s, int left, int top, int right, int bottom)\\n\\nPARSER_DECL(expr);\\nPARSER_DECL(term);\\nPARSER_DECL(factor);\\nPARSER_DECL(powexpr);\\nPARSER_DECL(primary);\\nPARSER_DECL(fraction);\\nPARSER_DECL(digit);\\n\\nint calculateBase(\\n\\tconst vector<string> &s, int left, int top, int right, int bottom)\\n{\\n\\tfor(int i = left; i < right; ++i){\\n\\t\\tfor(int j = top; j < bottom; ++j){\\n\\t\\t\\tif(s[j][i] != '.'){ return j; }\\n\\t\\t}\\n\\t}\\n\\treturn -1;\\n}\\n\\nPARSER_DECL(expr){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tResult r = term(s, left, top, right, bottom);\\n\\tint next = r.p + 1;\\n\\twhile(next < right && (s[base][next] == '+' || s[base][next] == '-')){\\n\\t\\tr.p += 3;\\n\\t\\tResult q = term(s, r.p, top, right, bottom);\\n\\t\\tif(s[base][next] == '+'){\\n\\t\\t\\tr.v = mod(r.v + q.v);\\n\\t\\t}else{\\n\\t\\t\\tr.v = mod(r.v - q.v);\\n\\t\\t}\\n\\t\\tr.p = q.p;\\n\\t\\tnext = q.p + 1;\\n\\t}\\n\\treturn r;\\n}\\nPARSER_DECL(term){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tResult r = factor(s, left, top, right, bottom);\\n\\tint next = r.p + 1;\\n\\twhile(next < right && s[base][next] == '*'){\\n\\t\\tr.p += 3;\\n\\t\\tResult q = factor(s, r.p, top, right, bottom);\\n\\t\\tr.v = mod(r.v * q.v);\\n\\t\\tr.p = q.p;\\n\\t\\tnext = q.p + 1;\\n\\t}\\n\\treturn r;\\n}\\nPARSER_DECL(factor){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tint numNeg = 0, p = left;\\n\\twhile(s[base][p] == '-' && s[base][p + 1] == '.'){\\n\\t\\t++numNeg;\\n\\t\\tp += 2;\\n\\t}\\n\\tif(s[base][p] == '-'){\\n\\t\\tResult r = fraction(s, p, top, right, bottom);\\n\\t\\tif(numNeg % 2 == 1){ r.v = mod(-r.v); }\\n\\t\\treturn r;\\n\\t}else{\\n\\t\\tResult r = powexpr(s, p, top, right, bottom);\\n\\t\\tif(numNeg % 2 == 1){ r.v = mod(-r.v); }\\n\\t\\treturn r;\\n\\t}\\n}\\nPARSER_DECL(powexpr){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tResult r = primary(s, left, top, right, bottom);\\n\\tif(base > 0 && r.p < right && isdigit(s[base - 1][r.p])){\\n\\t\\tResult q = digit(s, r.p, top, right, bottom);\\n\\t\\tint v = 1;\\n\\t\\tfor(int i = 0; i < q.v; ++i){ v = mod(v * r.v); }\\n\\t\\tr.v = v;\\n\\t\\tr.p = q.p;\\n\\t}\\n\\treturn r;\\n}\\nPARSER_DECL(primary){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tif(isdigit(s[base][left])){\\n\\t\\tResult r = digit(s, left, top, right, bottom);\\n\\t\\treturn r;\\n\\t}else{\\n\\t\\tResult r = expr(s, left + 2, top, right, bottom);\\n\\t\\tr.p += 2;\\n\\t\\treturn r;\\n\\t}\\n}\\nPARSER_DECL(fraction){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tint length = 0;\\n\\tfor(int i = left; i < right; ++i, ++length){\\n\\t\\tif(s[base][i] != '-'){ break; }\\n\\t}\\n\\tint upperBegin = left;\\n\\tfor(int i = 0; i < length; ++i, ++upperBegin){\\n\\t\\tbool flag = false;\\n\\t\\tfor(int j = top; j < base; ++j){\\n\\t\\t\\tflag = flag || (s[j][upperBegin] != '.');\\n\\t\\t}\\n\\t\\tif(flag){ break; }\\n\\t}\\n\\tint lowerBegin = left;\\n\\tfor(int i = 0; i < length; ++i, ++lowerBegin){\\n\\t\\tbool flag = false;\\n\\t\\tfor(int j = base + 1; j < bottom; ++j){\\n\\t\\t\\tflag = flag || (s[j][lowerBegin] != '.');\\n\\t\\t}\\n\\t\\tif(flag){ break; }\\n\\t}\\n\\tResult upper = expr(s, upperBegin, top, right, base);\\n\\tResult lower = expr(s, lowerBegin, base + 1, right, bottom);\\n\\tResult r;\\n\\tr.v = mod(upper.v * INV[lower.v]);\\n\\tr.p = left + length;\\n\\treturn r;\\n}\\nPARSER_DECL(digit){\\n\\tint base = calculateBase(s, left, top, right, bottom);\\n\\tResult r;\\n\\tr.v = s[base][left] - '0';\\n\\tr.p = left + 1;\\n\\treturn r;\\n}\\n\\nint main(){\\n\\tfor(int y = 1; y < 2011; ++y){\\n\\t\\tfor(int z = 1; z < 2011; ++z){\\n\\t\\t\\tif(z * y % 2011 == 1){ INV[y] = z; }\\n\\t\\t}\\n\\t}\\n\\twhile(true){\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\tif(n == 0){ break; }\\n\\t\\tvector<string> s(n);\\n\\t\\tfor(int i = 0; i < n; ++i){ cin >> s[i]; }\\n\\t\\tResult r = expr(s, 0, 0, s[0].size(), n);\\n\\t\\tcout << r.v << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1322_304384\",\n \"code_snippet\": \"#include<cctype>\\n#include<cstdio>\\n#include<cassert>\\n#include<cstring>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint inv[2011];\\nchar E[20][81];\\n\\nint parse(int t,int l,int b,int r);\\nint expr(int &idx,int y,int y1,int y2);\\nint term(int &idx,int y,int y1,int y2);\\nint factor(int &idx,int y,int y1,int y2);\\nint powexpr(int &idx,int y,int y1,int y2);\\nint primary(int &idx,int y,int y1,int y2);\\nint fraction(int &idx,int y,int y1,int y2);\\n\\nint expr(int &idx,int y,int y1,int y2){\\n\\tint a=term(idx,y,y1,y2);\\n\\twhile(1){\\n\\t\\tchar c=E[y][idx];\\n\\t\\tif(c!='+' && c!='-') break;\\n\\t\\tidx+=2;\\n\\t\\tint b=term(idx,y,y1,y2);\\n\\t\\tif(c=='+') a=(a+b)%2011;\\n\\t\\tif(c=='-') a=(a-b+2011)%2011;\\n\\t}\\n\\treturn a;\\n}\\n\\nint term(int &idx,int y,int y1,int y2){\\n\\tint a=factor(idx,y,y1,y2);\\n\\twhile(1){\\n\\t\\tchar c=E[y][idx];\\n\\t\\tif(c!='*') break;\\n\\n\\t\\tidx+=2;\\n\\t\\tint b=factor(idx,y,y1,y2);\\n\\t\\ta=a*b%2011;\\n\\t}\\n\\treturn a;\\n}\\n\\nint factor(int &idx,int y,int y1,int y2){\\n\\tif(E[y][idx]=='-' && E[y][idx+1]!='-'){\\n\\t\\tidx+=2;\\n\\t\\treturn (-factor(idx,y,y1,y2)+2011)%2011;\\n\\t}\\n\\n\\tif(E[y][idx]=='-' && E[y][idx+1]=='-'){\\n\\t\\treturn fraction(idx,y,y1,y2);\\n\\t}\\n\\n\\treturn powexpr(idx,y,y1,y2);\\n}\\n\\nint powexpr(int &idx,int y,int y1,int y2){\\n\\tint a=primary(idx,y,y1,y2);\\n\\tif(y>0 && isdigit(E[y-1][idx-1])){\\n\\t\\tint b=E[y-1][idx-1]-'0',c=1;\\n\\t\\trep(i,b) c=c*a%2011;\\n\\t\\ta=c;\\n\\t\\tidx++;\\n\\t}\\n\\treturn a;\\n}\\n\\nint primary(int &idx,int y,int y1,int y2){\\n\\tint a;\\n\\tif(isdigit(E[y][idx])){\\n\\t\\ta=E[y][idx]-'0';\\n\\t}\\n\\telse{\\n\\t\\tidx+=2;\\n\\t\\ta=expr(idx,y,y1,y2);\\n\\t}\\n\\tidx+=2;\\n\\treturn a;\\n}\\n\\nint fraction(int &idx,int y,int y1,int y2){\\n\\tint x1=idx+1;\\n\\twhile(E[y][idx]=='-') idx++;\\n\\tint x2=idx-1;\\n\\tidx++;\\n\\treturn parse(y1,x1,y,x2)*inv[parse(y+1,x1,y2,x2)]%2011;\\n}\\n\\nint find_base_line(int t,int l,int b,int r){\\n\\tfor(int j=l;j<r;j++) for(int i=t;i<b;i++) if(E[i][j]!='.') return i;\\n\\tassert(0);\\n}\\n\\nint parse(int t,int l,int b,int r){\\n\\tint y=find_base_line(t,l,b,r);\\n\\tint idx=l;\\n\\twhile(E[y][idx]=='.') idx++;\\n\\treturn expr(idx,y,t,b);\\n}\\n\\nint main(){\\n\\trep(i,2011) rep(j,2011) if(i*j%2011==1) inv[i]=j;\\n\\n\\tfor(int h;scanf(\\\"%d\\\",&h),h;){\\n\\t\\trep(i,h){\\n\\t\\t\\trep(j,81) E[i][j]='\\\\0';\\n\\t\\t\\tscanf(\\\"%s\\\",E[i]);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",parse(0,0,h,strlen(E[0])));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":770,"cells":{"group_id":{"kind":"string","value":"aoj_1320_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nCity Merger\nRecent improvements in information and communication technology have made it possible to provide municipal service to a wider area more quickly and with less costs. Stimulated by this, and probably for saving their not sufficient funds, mayors of many cities started to discuss on mergers of their cities.\nThere are, of course, many obstacles to actually put the planned mergers in practice. Each city has its own culture of which citizens are proud. One of the largest sources of friction is with the name of the new city. All citizens would insist that the name of the new city should have the original name of their own city at least as a part of it. Simply concatenating all the original names would, however, make the name too long for everyday use.\nYou are asked by a group of mayors to write a program that finds the shortest possible name for the new city that includes all the original names of the merged cities. If two or more cities have common parts, they can be overlapped. For example, if \"FUKUOKA\", \"OKAYAMA\", and \"YAMAGUCHI\" cities are to be merged, \"FUKUOKAYAMAGUCHI\" is such a name that include all three of the original city names. Although this includes all the characters of the city name \"FUKUYAMA\" in this order, it does not appear as a consecutive substring, and thus \"FUKUYAMA\" is not considered to be included in the name.\nInput\nThe input is a sequence of datasets. Each dataset begins with a line containing a positive integer\nn\n(\nn\n≤ 14), which denotes the number of cities to be merged. The following\nn\nlines contain the names of the cities in uppercase alphabetical letters, one in each line. You may assume that none of the original city names has more than 20 characters. Of course, no two cities have the same name.\nThe end of the input is indicated by a line consisting of a zero.\nOutput\nFor each dataset, output the length of the shortest possible name of the new city in one line. The output should not contain any other characters.\nSample Input\n3\nFUKUOKA\nOKAYAMA\nYAMAGUCHI\n3\nFUKUOKA\nFUKUYAMA\nOKAYAMA\n2\nABCDE\nEDCBA\n4\nGA\nDEFG\nCDDE\nABCD\n2\nABCDE\nC\n14\nAAAAA\nBBBBB\nCCCCC\nDDDDD\nEEEEE\nFFFFF\nGGGGG\nHHHHH\nIIIII\nJJJJJ\nKKKKK\nLLLLL\nMMMMM\nNNNNN\n0\nOutput for the Sample Input\n16\n19\n9\n9\n5\n70"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1320_10954681","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nvector<int> ls;\nvector<vector<int>> v; // v[i][j] = overlap length a[i] suffix vs a[j] prefix\nunordered_map<long long,int> cac; // memo for sediv\nunordered_map<int,int> bp; // single-bit -> index\n\nconst int INF = 1000000000;\n\nlong long make_key(int st, int en, int tp) {\n // replicate Python: cachenm = st + en*n + tp*n*n\n long long nn = (long long)n * (long long)n;\n return (long long)tp * nn + (long long)en * n + st;\n}\n\nint sediv(int st, int en, int tp) {\n long long key = make_key(st,en,tp);\n auto it = cac.find(key);\n if (it != cac.end()) return it->second;\n\n if (tp == 0) {\n int tmp = ls[st] + ls[en] - v[st][en];\n cac[key] = tmp;\n return tmp;\n }\n auto itbp = bp.find(tp);\n if (itbp != bp.end()) {\n int a = itbp->second;\n int tmp = ls[st] + ls[a] + ls[en] - v[st][a] - v[a][en];\n cac[key] = tmp;\n return tmp;\n }\n\n int mn = INF;\n for (int i = 0; i < n-1; ++i) {\n if (!(tp & (1<<i))) continue;\n for (int j = i+1; j < n; ++j) {\n if (!(tp & (1<<j))) continue;\n int tp2 = tp & ~( (1<<i) | (1<<j) );\n int tmp1 = sediv(i,j,tp2) - v[st][i] - v[j][en];\n int tmp2 = sediv(j,i,tp2) - v[st][j] - v[i][en];\n int cur = min(tmp1, tmp2);\n if (cur < mn) mn = cur;\n }\n }\n mn += ls[st] + ls[en];\n cac[key] = mn;\n return mn;\n}\n\n// overlap function same as Python sc\nint sc_str_overlap(const string &a, const string &b) {\n int lna = (int)a.size();\n int lnb = (int)b.size();\n for (int i = 0; i < (int)a.size(); ++i) {\n if (lnb + i <= lna) continue;\n int len = lna - i;\n // compare a[i:] with b[:len]\n bool ok = true;\n for (int k = 0; k < len; ++k) {\n if (a[i+k] != b[k]) { ok = false; break; }\n }\n if (ok) return len;\n }\n return 0;\n}\n\n// generate next combination in lexicographic order\n// a: current indices (size k), n: range, returns false if no next\nbool next_combination(vector<int> &a, int n, int k) {\n for (int i = k-1; i >= 0; --i) {\n if (a[i] != i + n - k) {\n ++a[i];\n for (int j = i+1; j < k; ++j) a[j] = a[j-1] + 1;\n return true;\n }\n }\n return false;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n // prepare bp\n for (int i = 0; i < 15; ++i) bp[1<<i] = i;\n\n while (true) {\n if (!(cin >> n)) return 0;\n if (n == 0) return 0;\n vector<string> s;\n s.reserve(n);\n for (int i = 0; i < n; ++i) {\n string t; cin >> t;\n s.push_back(t);\n }\n\n // dpl: remove strings fully contained in others\n {\n vector<char> removed(n, 0);\n for (int i = 0; i < n; ++i) {\n if (removed[i]) continue;\n for (int j = 0; j < n; ++j) {\n if (i == j || removed[j]) continue;\n if (s[i].size() <= s[j].size()) {\n // check if s[i] is substring of s[j]\n if (s[j].find(s[i]) != string::npos) {\n removed[i] = 1;\n break;\n }\n }\n }\n }\n vector<string> ns;\n for (int i = 0; i < n; ++i) if (!removed[i]) ns.push_back(s[i]);\n s.swap(ns);\n }\n\n n = (int)s.size();\n if (n == 0) { cout << 0 << '\\n'; continue; }\n\n // build v\n v.assign(n, vector<int>(n,0));\n if (n == 1) {\n cout << s[0].size() << '\\n';\n continue;\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i == j) continue;\n v[i][j] = sc_str_overlap(s[i], s[j]);\n }\n }\n ls.assign(n,0);\n for (int i = 0; i < n; ++i) ls[i] = (int)s[i].size();\n\n if (n <= 3) {\n // brute force permutations to get maximum overlaps sum\n vector<int> perm(n);\n for (int i = 0; i < n; ++i) perm[i] = i;\n int best = 0;\n do {\n int sum = 0;\n for (int i = 0; i+1 < n; ++i) sum += v[perm[i]][perm[i+1]];\n best = max(best, sum);\n } while (next_permutation(perm.begin(), perm.end()));\n int total_len = 0;\n for (int x : ls) total_len += x;\n cout << (total_len - best) << '\\n';\n continue;\n }\n\n cac.clear();\n\n int div2 = n/2;\n int div3 = n - div2;\n int sm = (1<<n);\n\n // prepare initial combination [0,1,...,div2-1]\n vector<int> comb(div2);\n for (int i = 0; i < div2; ++i) comb[i] = i;\n\n int ans = INF;\n\n bool first = true;\n while (true) {\n // comb is current combination in lexicographic order\n if (!first) {\n // already advanced\n }\n first = false;\n\n // replicate Python's: if i[0] != 0: break\n if (comb[0] != 0) break;\n\n int gr0 = 0;\n for (int x : comb) gr0 |= (1<<x);\n int gr1 = (sm - 1) ^ gr0; // complement within n bits\n\n // lga, lgb: store sediv results for start-end pairs\n // use 2D vectors filled with INF\n vector<vector<int>> lga(n, vector<int>(n, INF));\n vector<vector<int>> lgb(n, vector<int>(n, INF));\n\n // for gr0: iterate all pairs i<j that exist in gr0\n for (int i = 0; i < n-1; ++i) {\n if (!(gr0 & (1<<i))) continue;\n for (int j = i+1; j < n; ++j) {\n if (!(gr0 & (1<<j))) continue;\n int msk = gr0 & ~( (1<<i) | (1<<j) );\n lga[i][j] = sediv(i,j,msk);\n lga[j][i] = sediv(j,i,msk);\n }\n }\n\n // for gr1: same\n for (int i = 0; i < n-1; ++i) {\n if (!(gr1 & (1<<i))) continue;\n for (int j = i+1; j < n; ++j) {\n if (!(gr1 & (1<<j))) continue;\n int msk = gr1 & ~( (1<<i) | (1<<j) );\n lgb[i][j] = sediv(i,j,msk);\n lgb[j][i] = sediv(j,i,msk);\n }\n }\n\n int mn = INF;\n // iterate over valid (sta,ena) in lga and (stb,enb) in lgb\n for (int sta = 0; sta < n; ++sta) {\n for (int ena = 0; ena < n; ++ena) {\n if (lga[sta][ena] == INF) continue;\n for (int stb = 0; stb < n; ++stb) {\n for (int enb = 0; enb < n; ++enb) {\n if (lgb[stb][enb] == INF) continue;\n // two combinations as in python\n int tmp = lga[sta][ena] + lgb[stb][enb] - v[ena][stb];\n if (tmp < mn) mn = tmp;\n tmp = lga[sta][ena] + lgb[stb][enb] - v[enb][sta];\n if (tmp < mn) mn = tmp;\n }\n }\n }\n }\n if (mn < ans) ans = mn;\n\n // advance combination\n if (!next_combination(comb, n, div2)) break;\n }\n\n cout << ans << '\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":3510,"memory_kb":10704,"score_of_the_acc":-0.5784,"final_rank":17},{"submission_id":"aoj_1320_10856460","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <vector>\n\nusing namespace std;\n\nconst int maxn = 30;\n\nint n;\nint extra[maxn][maxn], f[1<<15][maxn];\nchar word[maxn][maxn];\nbool substr[maxn];\nvector<char*> wd;\n\nint main()\n{\n#ifdef LOCAL\n\tfreopen(\"F.in\", \"r\", stdin);\n#endif\n\twhile(scanf(\"%d\", &n) != EOF) {\n\t\tif(n == 0)\tbreak;\n\t\tmemset(substr, 0, n*sizeof(char));\n\t\twd.clear();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tscanf(\"%s\", word+i);\n\t\t\tfor(int j = 0; j < i; j++) {\n\t\t\t\tif(strstr(word[i], word[j]) != NULL)\tsubstr[j] = true;\n\t\t\t\telse if(strstr(word[j], word[i]) != NULL)\tsubstr[i] = true;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(!substr[i])\twd.push_back(word[i]);\n\t\tfor(int i = 0; i < wd.size(); i++)\n\t\t\tfor(int j = 0; j < wd.size(); j++) {\n\t\t\t\tint plen = strlen(wd[i]), nlen = strlen(wd[j]), match = 0;\n\t\t\t\tfor(int k = min(nlen, plen); k > 0; k--)\n\t\t\t\t\tif(strncmp(wd[j], wd[i]+plen-k, k) == 0)\t{\n\t\t\t\t\t\tmatch = k;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\textra[i][j] = nlen-match;\n\t\t\t}\n\t\tint cnt = wd.size();\n\t\tmemset(f, 0, sizeof(f));\n\t\tfor(int i = 0; i < cnt; i++)\n\t\t\tf[1<<i][i] = strlen(wd[i]);\n\t\tfor(int i = 1; i < (1 << cnt); i++) \n\t\t\tfor(int j = 0; j < cnt; j++) {\n\t\t\t\tif(((1<<j)&i) == 0)\tcontinue; \n\t\t\t\tfor(int k = 0; k < cnt; k++) {\n\t\t\t\t\tif((1<<k)&i)\tcontinue; \n\t\t\t\t\tint now = i|(1<<k); \n\t\t\t\t\tf[now][k] = f[now][k]? min(f[now][k], f[i][j]+extra[j][k]):f[i][j]+extra[j][k]; \n//\t\t\t\t\tif(i == 13)\n//\t\t\t\t\tcout << \"Insert \" << k << \" after \" << j << ' ' << f[now][k] << endl; \n\t\t\t\t} \n\t\t\t} \n\t\tint ans = cnt*maxn; \n\t\tfor(int i = 0; i < cnt; i++) \n\t\t\tans = min(ans, f[(1<<cnt)-1][i]); \n\t\tprintf(\"%d\\n\", ans); \n\t}\n\treturn 0; \n}","accuracy":1,"time_ms":150,"memory_kb":7416,"score_of_the_acc":-0.0338,"final_rank":14},{"submission_id":"aoj_1320_9680190","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\nwhile(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n vector<string> T(N);\n rep(i,0,N) cin >> T[i];\n vector<string> S;\n rep(i,0,N) {\n bool check = true;\n rep(j,0,N) {\n if (i==j) continue;\n if (T[i].size() > T[j].size()) continue;\n rep(k,0,T[j].size()) {\n if (k+(int)T[i].size() > (int)T[j].size()) break;\n if (T[j].substr(k,T[i].size()) == T[i]) check = false;\n }\n }\n if (check) S.push_back(T[i]);\n }\n N = S.size();\n vector<vector<int>> G(N,vector<int>(N,inf));\n rep(i,0,N) {\n rep(j,0,N) {\n if (i == j) {\n G[i][j] = 0;\n continue;\n }\n rep(k,0,min(S[i].size(),S[j].size())) {\n if (S[i].substr(S[i].size()-k,k) == S[j].substr(0,k)) G[i][j] = (int)S[j].size() - k;\n }\n }\n }\n vector DP(1<<N, vector<int>(N,inf));\n rep(i,0,N) DP[1<<i][i] = S[i].size();\n rep(i,1,1<<N) {\n rep(j,0,N) {\n if (DP[i][j] == inf) continue;\n rep(k,0,N) {\n if (i & (1<<k)) continue;\n chmin(DP[i|(1<<k)][k],DP[i][j]+G[j][k]);\n }\n }\n }\n int ANS = inf;\n rep(i,0,N) chmin(ANS, DP[(1<<N)-1][i]);\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":190,"memory_kb":4740,"score_of_the_acc":-0.0123,"final_rank":7},{"submission_id":"aoj_1320_9205868","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < n; i++)\n\nint calcdif(string s, string t) { // 文字列tの長さ - 文字列sと文字列tの共通部分の長さ\n int sz = s.size();\n int tz = t.size();\n int comlen = 0;\n for (int i = 0; i < sz; i++) { // sのiからszまでとtの0からlenまでの共通部分の長さを計算する\n for (int len = 1; len <= tz; len++) {\n string ss = s.substr(i, sz);\n string tt = t.substr(0, len);\n if (ss == tt) {\n comlen = max(comlen, len);\n }\n }\n }\n\n return tz - comlen;\n}\n\nint main() {\n int n;\n while(cin >> n && n) {\n vector<string> cities(n);\n rep(i, n) cin >> cities[i];\n\n vector<int> unIncludedCities; // 互いに部分文字列になっていない都市のリスト\n\n rep(i, n) { // 都市iが他の都市の部分文字列になってないなら、unIncludedCitiesに追加\n bool isInclude = false;\n rep(j, n) {\n if(i == j) continue;\n if(cities[j].find(cities[i]) != string::npos) {\n isInclude = true;\n break;\n }\n }\n if(!isInclude) unIncludedCities.push_back(i);\n }\n\n int m = unIncludedCities.size();\n\n vector<vector<int>> dif(m, vector<int>(m)); // dif[i][j] := 都市jの長さ - 都市iの末尾と都市jの先頭の重複する部分の長さ\n rep(i, m) rep(j, m) {\n dif[i][j] = calcdif(cities[unIncludedCities[i]], cities[unIncludedCities[j]]);\n }\n\n vector<vector<int>> dp((1 << m), vector<int>(m, 1e9)); // dp[i][j] := 集合iを訪れて都市jにいるときの統合された文字列の最小の長さ\n rep(i, m) dp[1 << i][i] = cities[unIncludedCities[i]].size(); // 初期値が都市iのとき、都市iの長さを格納\n\n rep(i, (1 << m)) rep(j, m) {\n if(!(i & (1 << j))) continue;\n rep(k, m) {\n if(i & (1 << k)) continue;\n dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + dif[j][k]);\n }\n }\n\n cout << *min_element(dp[(1 << m) - 1].begin(), dp[(1 << m) - 1].end()) << endl;\n }\n}","accuracy":1,"time_ms":180,"memory_kb":4620,"score_of_the_acc":-0.0095,"final_rank":4},{"submission_id":"aoj_1320_9205813","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.14159265358979323846;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload5(a,b,c,d,e,name,...) name\n#define overload4(a,b,c,d,name,...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) rbegin(i),rend(i)\n#define rall2(i,a) rbegin(i),rbegin(i)+a\n#define rall3(i,a,b) rbegin(i)+a,rbegin(i)+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),mint{})\n#define elif else if\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector name(h,vector(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> ll sz(const T& a){ return size(a); }\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T, class U> ll count(const T& a, const U& b){ return count(all(a), b); }\ntemplate<class T, class F> ll count_if(const T& a, F b){ return count_if(all(a), b); }\ntemplate<class T, class F> void filter(T& a, F b){ a.erase(remove_if(all(a), not_fn(b)), a.end()); }\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\ntemplate<class T> void rev(T& a){ reverse(all(a)); }\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\nll popcnt(ull a){ return __builtin_popcountll(a); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> auto run_press(const T& a){ vector<pair<decay_t<decltype(a[0])>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\ntemplate<class... Ts> void in(Ts&... t);\n[[maybe_unused]] void print(){}\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\n'; }\nnamespace IO{\n#define VOID(a) decltype(void(a))\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\ntemplate<int I> struct P : P<I-1>{};\ntemplate<> struct P<0>{};\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\n#undef VOID\n}\n#define unpack(a) (void)(0 + ... + (a, 0))\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\n#undef unpack\n#ifdef DEBUG\nll __lg(ull x){ return 63 - __builtin_clzll(x); }\n#define debug(...) { print(#__VA_ARGS__); print(\n#else\n#define debug(...) void(0)\n#endif\n#define YESNO(yes,no) void yes(bool i = 1){ out(i?#yes:#no); } void no(){ out(#no); }\nYESNO(first, second)\nYESNO(First, Second)\nYESNO(Yes, No)\nYESNO(YES, NO)\nYESNO(possible, impossible)\nYESNO(Possible, Impossible)\nYESNO(POSSIBLE, IMPOSSIBLE)\n\n\n\ntemplate<class T> using P = pair<T, T>;\n#define x first\n#define y second\ntemplate<class T> P<T> operator+(const P<T>& a, const P<T>& b) { return {a.x + b.x, a.y + b.y}; }\ntemplate<class T> P<T> operator-(const P<T>& a, const P<T>& b) { return {a.x - b.x, a.y - b.y}; }\ntemplate<class T> P<T> operator-(const P<T>& a) { return {-a.x, -a.y}; }\ntemplate<class T, class U> P<T> operator*(const P<T>& a, const U& b) { return {a.x * b, a.y * b}; }\ntemplate<class T, class U> P<T> operator/(const P<T>& a, const U& b) { return {a.x / b, a.y / b}; }\ntemplate<class T> P<T>& operator+=(P<T>& a, const P<T>& b) { return a = a + b; }\ntemplate<class T> P<T>& operator-=(P<T>& a, const P<T>& b) { return a = a - b; }\ntemplate<class T, class U> P<T>& operator*=(P<T>& a, const U& b) { return a = a * b; }\ntemplate<class T, class U> P<T>& operator/=(P<T>& a, const U& b) { return a = a / b; }\ntemplate<class T> P<T> rotate(const P<T>& a) { return {-a.y, a.x}; } // 90 degree ccw\ntemplate<class T> T dot(const P<T>& a, const P<T>& b) { return a.x * b.x + a.y * b.y; }\ntemplate<class T> T cross(const P<T>& a, const P<T>& b) { return dot(rotate(a), b); }\ntemplate<class T> T square(const P<T>& a) { return dot(a, a); }\ntemplate<class T> ld abs(const P<T>& a) { return hypotl(a.x, a.y); }\ntemplate<class T> T gcd(const P<T>& a) { return gcd(a.x, a.y); }\ntemplate<class T> P<T> normalize(P<T> a) {\n if(a == P<T>{}) return a;\n a /= gcd(a);\n if(a < P<T>{}) a = -a;\n return a;\n}\n\n// 文字列tの長さ - 文字列sと文字列tの共通部分の長さ\nint calcdif(string s, string t) {\n int sz = s.size();\n int tz = t.size();\n int comlen = 0;\n for (int i = 0; i < sz; i++) { // sのiからszまでとtの0からlenまでの共通部分の長さを計算する\n for (int len = 1; len <= tz; len++) {\n string ss = s.substr(i, sz);\n string tt = t.substr(0, len);\n if (ss == tt) {\n comlen = max(comlen, len);\n }\n }\n }\n\n // // tがsに含まれている場合、末尾に付け足す文字列の長さは0\n // for (int len = 1; len <= sz; len++) {\n // for (int i = 0; i < sz; i++) {\n // string ss = s.substr(i, len);\n // string tt = t.substr(0, tz);\n // if (ss == tt) {\n // return 0;\n // }\n // }\n // }\n\n return tz - comlen;\n}\n\nint main() {\n int n;\n while(cin >> n && n) {\n vector<string> str(n+1);\n for (int i = 1; i <= n; i++) cin >> str[i];\n\n vector<string> rms;\n // 他の文字列に含まれていない文字列を抽出\n for (int i = 1; i <= n; i++) {\n bool flag = false;\n for (int j = 1; j <= n; j++) {\n if (i == j) continue;\n for (int len = 1; len <= str[j].size(); len++) {\n for (int k = 0; k + len <= str[j].size(); k++) {\n if (str[j].substr(k, len) == str[i]) {\n flag = true;\n break;\n }\n }\n }\n }\n if (!flag) rms.push_back(str[i]);\n }\n // out(rms);\n \n int m = rms.size();\n // dif[i][j] 文字列jの長さ - 文字列iと文字列jの共通部分の長さ\n vector<vector<int>> dif(n+1, vector<int>(n+1, 0));\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < m; j++) {\n if (i == j) continue;\n dif[i][j] = calcdif(rms[i], rms[j]);\n }\n }\n\n // rep(i, m) {\n // rep(j, m) {\n // cout << dif[i][j] << \" \";\n // }\n // cout << endl;\n // }\n\n // // dp[i][j] すでに状態iなる文字列を使っていて、現在位置がjであるときの併合した文字列の長さの最小値\n vector<vector<int>> dp((1<<14)+1, vector<int>(n+1, INF));\n for (int i = 0; i < m; i++) dp[(1<<i)][i] = rms[i].size();\n for (int i = 1; i < (1<<m); i++) { // すでに使っている文字列の集合\n for (int j = 0; j <= m; j++) { // 現在位置\n if (dp[i][j] == INF) continue;\n for (int k = 0; k < m; k++) { // 併合する文字列を選ぶ\n if (i & (1<<(k))) continue; // すでに使っている文字列は使えない\n chmin(dp[i|(1<<(k))][k], dp[i][j] + dif[j][k]);\n }\n }\n }\n out(*min_element(all(dp[(1<<m)-1])));\n }\n}","accuracy":1,"time_ms":290,"memory_kb":4748,"score_of_the_acc":-0.0276,"final_rank":12},{"submission_id":"aoj_1320_8992038","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint solve(int n) {\n vector<string> s = in(n);\n {\n vector<string> ns;\n for(int i : rep(n)) {\n bool substr = false;\n for(int j : rep(n)) if(j != i and s[i].size() <= s[j].size()) {\n for(int k : rep(s[j].size())) {\n if(s[j].substr(k, s[i].size()) == s[i]) {\n substr = true;\n }\n }\n }\n if(!substr) ns.push_back(s[i]);\n }\n s = move(ns);\n n = s.size();\n }\n\n vector dp(1 << n, vector(n, int(1e9)));\n for(int i : rep(n)) dp[1 << i][i] = s[i].size();\n\n vector c(n, vector(n, int(1e9)));\n for(int i : rep(n)) for(int j : rep(n)) if(i != j) {\n for(int k : revrep(int(s[i].size()))) {\n if(s[i].substr(s[i].size() - k, k) == s[j].substr(0, k)) {\n c[i][j] = s[j].size() - k;\n break;\n }\n }\n }\n\n for(int S : rep(1 << n)) if(S) {\n for(int i : rep(n)) if(S & (1 << i)) {\n for(int j : rep(n)) if(!(S & (1 << j))) {\n chmin(dp[S | (1 << j)][j], dp[S][i] + c[i][j]);\n }\n }\n }\n\n int ans = 1e9;\n for(int i : rep(n)) chmin(ans, dp[(1 << n) - 1][i]);\n return ans;\n}\n\nint main() {\n while(true) {\n int n = in(); if(n == 0) break;\n print(solve(n));\n }\n}","accuracy":1,"time_ms":170,"memory_kb":4884,"score_of_the_acc":-0.0107,"final_rank":5},{"submission_id":"aoj_1320_8992028","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint solve(int n) {\n vector<string> s = in(n);\n {\n vector<string> ns;\n for(int i : rep(n)) {\n bool substr = false;\n for(int j : rep(n)) if(j != i and s[i].size() <= s[j].size()) {\n for(int k : rep(s[j].size())) {\n if(s[j].substr(k, s[i].size()) == s[i]) {\n substr = true;\n }\n }\n }\n if(!substr) ns.push_back(s[i]);\n }\n s = move(ns);\n n = s.size();\n }\n\n vector dp(1 << n, vector(n, int(1e9)));\n for(int i : rep(n)) dp[1 << i][i] = s[i].size();\n\n for(int S : rep(1 << n)) if(S) {\n for(int i : rep(n)) if(S & (1 << i)) {\n for(int j : rep(n)) if(!(S & (1 << j))) {\n for(int k : revrep(int(s[i].size()))) {\n if(s[i].substr(s[i].size() - k, k) == s[j].substr(0, k)) {\n chmin(dp[S | (1 << j)][j], dp[S][i] + int(s[j].size() - k));\n break;\n }\n }\n }\n }\n }\n\n int ans = 1e9;\n for(int i : rep(n)) chmin(ans, dp[(1 << n) - 1][i]);\n return ans;\n}\n\nint main() {\n while(true) {\n int n = in(); if(n == 0) break;\n print(solve(n));\n }\n}","accuracy":1,"time_ms":6670,"memory_kb":4804,"score_of_the_acc":-0.9977,"final_rank":18},{"submission_id":"aoj_1320_8586452","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1<<29;\nint n, fnt[15][15];\nstring s[15];\nint memo[1<<15][15];\nint dp(int bit, int rht, int cnt){\n if(cnt>=n) return 0;\n if(memo[bit][rht]!=-1) return memo[bit][rht];\n int res = INF;\n for(int i=0;i<n;i++){\n if((bit&1<<i)==0) res = min(res, dp((bit|1<<i), i, cnt+1)+fnt[rht][i]);\n }\n return memo[bit][rht] = res;\n}\nint main(){\n while(cin >> n, n){\n for(int i=0;i<n;i++) cin >> s[i];\n \n for(int i=0;i<n;i++){\n fnt[n][i] = s[i].size();\n for(int j=0;j<n;j++){\n if(i==j) continue;\n fnt[i][j] = s[j].size();\n for(int k=0;k<s[i].size();k++){\n int sel = s[i].size()-k;\n if(s[i].substr(0, k)+s[j].substr(0, sel) == s[i]) fnt[i][j] = min(fnt[i][j], (int)s[j].size()-sel);\n }\n }\n }\n \n int bit=0, cnt=0;\n for(int i=0;i<n;i++){\n bool ok = false;\n for(int j=0;j<n;j++){\n if(i==j) continue;\n if(s[j].find(s[i])!=string::npos) ok = true;\n }\n if(ok){\n bit |= 1<<i;\n cnt++;\n }\n }\n memset(memo, -1, sizeof(memo));\n cout << dp(bit, n, cnt) << endl;\n \n }\n return(0);\n}","accuracy":1,"time_ms":240,"memory_kb":4980,"score_of_the_acc":-0.0223,"final_rank":10},{"submission_id":"aoj_1320_8474991","code_snippet":"// #define _GLIBCXX_DEBUG\n#pragma GCC optimize(\"O2,no-stack-protector,unroll-loops,fast-math\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\n#define each(e, v) for (auto& e : v)\n#define MM << \" \" <<\n#define pb push_back\n#define eb emplace_back\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\n int n = v.size();\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (v.empty()) cout << '\\n';\n}\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\ntemplate <typename T> bool chmax(T& x, const T& y) {\n return (x < y) ? (x = y, true) : false;\n}\ntemplate <typename T> bool chmin(T& x, const T& y) {\n return (x > y) ? (x = y, true) : false;\n}\ntemplate <class T>\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T> using maxheap = std::priority_queue<T>;\ntemplate <typename T> int lb(const vector<T>& v, T x) {\n return lower_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> int ub(const vector<T>& v, T x) {\n return upper_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> void rearrange(vector<T>& v) {\n sort(begin(v), end(v));\n v.erase(unique(begin(v), end(v)), end(v));\n}\n\n// __int128_t gcd(__int128_t a, __int128_t b) {\n// if (a == 0)\n// return b;\n// if (b == 0)\n// return a;\n// __int128_t cnt = a % b;\n// while (cnt != 0) {\n// a = b;\n// b = cnt;\n// cnt = a % b;\n// }\n// return b;\n// }\n\nstruct Union_Find_Tree {\n vector<int> data;\n const int n;\n int cnt;\n \n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\n \n int root(int x) {\n if (data[x] < 0) return x;\n return data[x] = root(data[x]);\n }\n \n int operator[](int i) { return root(i); }\n \n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (data[x] > data[y]) swap(x, y);\n data[x] += data[y], data[y] = x;\n cnt--;\n return true;\n }\n \n int size(int x) { return -data[root(x)]; }\n \n int count() { return cnt; };\n \n bool same(int x, int y) { return root(x) == root(y); }\n \n void clear() {\n cnt = n;\n fill(begin(data), end(data), -1);\n }\n};\n\ntemplate <int mod> struct Mod_Int {\n int x;\n\n Mod_Int() : x(0) {}\n\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n static int get_mod() { return mod; }\n\n Mod_Int& operator+=(const Mod_Int& p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator-=(const Mod_Int& p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator*=(const Mod_Int& p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n\n Mod_Int& operator/=(const Mod_Int& p) {\n *this *= p.inverse();\n return *this;\n }\n\n Mod_Int& operator++() { return *this += Mod_Int(1); }\n\n Mod_Int operator++(int) {\n Mod_Int tmp = *this;\n ++*this;\n return tmp;\n }\n\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\n\n Mod_Int operator--(int) {\n Mod_Int tmp = *this;\n --*this;\n return tmp;\n }\n\n Mod_Int operator-() const { return Mod_Int(-x); }\n\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\n\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\n\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\n\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\n\n bool operator==(const Mod_Int& p) const { return x == p.x; }\n\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\n\n Mod_Int inverse() const {\n assert(*this != Mod_Int(0));\n return pow(mod - 2);\n }\n\n Mod_Int pow(long long k) const {\n Mod_Int now = *this, ret = 1;\n for (; k > 0; k >>= 1, now *= now) {\n if (k & 1) ret *= now;\n }\n return ret;\n }\n\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\n return os << p.x;\n }\n\n friend istream& operator>>(istream& is, Mod_Int& p) {\n long long a;\n is >> a;\n p = Mod_Int<mod>(a);\n return is;\n }\n};\n\nll mpow2(ll x, ll n, ll mod) {\n ll ans = 1;\n x %= mod;\n while (n != 0) {\n if (n & 1) ans = ans * x % mod;\n x = x * x % mod;\n n = n >> 1;\n }\n ans %= mod;\n return ans;\n}\n\ntemplate <typename T> T modinv(T a, const T& m) {\n T b = m, u = 1, v = 0;\n while (b > 0) {\n T t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return u >= 0 ? u % m : (m - (-u) % m) % m;\n}\n\nll divide_int(ll a, ll b) {\n if (b < 0) a = -a, b = -b;\n return (a >= 0 ? a / b : (a - b + 1) / b);\n}\n\n// const int MOD = 1000000007;\nconst int MOD = 998244353;\nusing mint = Mod_Int<MOD>;\n\n// ----- library -------\n// ----- library -------\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (1) {\n int n;\n cin >> n;\n if (!n)\n break;\n vector<string> s(n);\n rep(i, n) cin >> s[i];\n vector<vector<int>> c(n, vector<int>(n));\n rep(i, n) rep(j, n) {\n int li = sz(s[i]), lj = sz(s[j]);\n c[i][j] = lj;\n rep(k, li) {\n bool ok = true;\n int val = lj;\n rep(l, min(lj, li - k)) {\n if (s[i][k + l] != s[j][l]) {\n ok = false;\n break;\n }\n val--;\n }\n if (ok)\n chmin(c[i][j], val);\n }\n }\n vector<vector<int>> dp(1 << n, vector<int>(n, 1e9));\n rep(i, n) dp[1 << i][i] = sz(s[i]);\n rep(t, 1 << n) rep(i, n) rep(j, n) {\n if (t >> j & 1)\n continue;\n chmin(dp[t | (1 << j)][c[i][j] == 0 ? i : j], dp[t][i] + c[i][j]);\n }\n cout << *min_element(all(dp[(1 << n) - 1])) << '\\n';\n }\n}","accuracy":1,"time_ms":350,"memory_kb":4748,"score_of_the_acc":-0.0367,"final_rank":15},{"submission_id":"aoj_1320_8331841","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nint calc_extra(const string& S, const string& T) {\n\tint ans = T.size();\n\tfor (int i = 1; i <= S.size() && i <= T.size(); i++) {\n\t\tif (S.substr(S.size() - i) == T.substr(0, i)) {\n\t\t\tans = T.size() - i;\n\t\t}\n\t}\n\treturn ans;\n}\n\nint solve_sequence(int N, const vector<string>& S) {\n\tvector<vector<int> > extras(N, vector<int>(N));\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\textras[i][j] = calc_extra(S[i], S[j]);\n\t\t}\n\t}\n\tvector<vector<int> > dp(1 << N, vector<int>(N, INF));\n\tfor (int i = 0; i < N; i++) {\n\t\tdp[1 << i][i] = S[i].size();\n\t}\n\tfor (int i = 1; i < (1 << N); i++) {\n\t\tif ((i & (i - 1)) == 0) {\n\t\t\tcontinue; // i = 2^k\n\t\t}\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif ((i >> j) & 1) {\n\t\t\t\tint sub = i - (1 << j);\n\t\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\t\tif ((sub >> k) & 1) {\n\t\t\t\t\t\tdp[i][j] = min(dp[i][j], dp[sub][k] + extras[k][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = *min_element(dp[(1 << N) - 1].begin(), dp[(1 << N) - 1].end());\n\treturn ans;\n}\n\nint solve(int N, const vector<string>& S) {\n\tvector<string> T;\n\tfor (int i = 0; i < N; i++) {\n\t\tbool flag = true;\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif ((S[j] == S[i] && j < i) || (S[j] != S[i] && S[j].find(S[i]) != string::npos)) {\n\t\t\t\tflag = false;\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tT.push_back(S[i]);\n\t\t}\n\t}\n\treturn solve_sequence(T.size(), T);\n}\n\nint main() {\n\twhile (true) {\n\t\tint N;\n\t\tcin >> N;\n\t\tif (N == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<string> S(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> S[i];\n\t\t}\n\t\tint ans = solve(N, S);\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":180,"memory_kb":4528,"score_of_the_acc":-0.0086,"final_rank":3},{"submission_id":"aoj_1320_6775480","code_snippet":"// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<chrono>\n#include<iomanip>\n#include<map>\n#include<set>\n#include<bitset>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,ll>;\nusing TP = tuple<ll,ll,ll>;\nvoid init_io(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n}\nconst ll INF = 1e15;\nll calc_dp(ll s, ll i, const vector<vector<ll>> &pat, vector<vector<ll>> &dp) {\n ll n = pat.size();\n ll k = 0;\n if (dp[s][i] != -1) return dp[s][i];\n for (int i=0;i<n;i++) {\n if ((1ll << i) & s) k++;\n }\n if (k==1) {\n return dp[s][i] = pat[i][i];\n }\n ll prev_s = s ^ (1ll << i);\n ll res = INF;\n for (int j=0;j<n;j++) {\n if (i==j || ((prev_s & (1ll << j)) == 0)) continue;\n res = min(res, calc_dp(prev_s, j, pat, dp) + pat[i][i] - pat[j][i]);\n }\n // cout << bitset<14>(s) <<\" \"<<i <<\" \"<<res << endl;\n return dp[s][i] = res;\n};\n\nll max_match(const string &s, const string &t) {\n ll n = s.size(), m = t.size();\n ll res = 0;\n for (int i=1;i<=min(n, m);i++) {\n bool can = true;\n for (int j=0;j<i;j++) {\n if (s[(n-i)+j] != t[j]) {\n can = false;\n break;\n }\n }\n if (can) {\n res = i;\n }\n }\n return res;\n};\nvoid solve() {\n ll n;\n cin >> n;\n if (n==0) return;\n vector<string> s(n);\n for(int i=0;i<n;i++) {\n cin >> s[i];\n }\n for (auto itr=s.begin();itr!=s.end();) {\n ll c = 0;\n for (auto t: s) {\n if (t == *itr) {\n if (c==0) {\n c++;\n continue;\n }\n }\n if (t.find(*itr) != string::npos) {\n c = -1;\n break;\n }\n }\n if (c==-1) {\n itr = s.erase(itr);\n } else {\n itr++;\n }\n }\n n = s.size();\n vector<vector<ll>> dp((1ll<<n), vector<ll>(n, -1));\n vector<vector<ll>> pat(n, vector<ll>(n, 0));\n for (int i=0;i<n;i++) {\n for (int j=0;j<n;j++) {\n if (i==j) {\n pat[i][i] = s[i].size();\n } else {\n pat[i][j] = max_match(s[i], s[j]);\n }\n }\n }\n ll ans = 1e15;\n for (int i=0;i<n;i++) {\n ans = min(ans, calc_dp((1ll<<n) -1, i,pat, dp));\n }\n cout << ans << endl;\n solve();\n}\nsigned main(){\n init_io();\n solve();\n}","accuracy":1,"time_ms":320,"memory_kb":101052,"score_of_the_acc":-1.0258,"final_rank":20},{"submission_id":"aoj_1320_6754394","code_snippet":"#include <bits/stdc++.h>\n#include <chrono>\n#include <thread>\n////#include <atcoder/all>\n\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q) {\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\nll Eulers_phi(ll n) {\n ll res = 0;\n ll N = n;\n vll P;\n for (ll p = 2; p * p <= N; p++) {\n if (N % p == 0) {\n P.push_back(p);\n while (N % p == 0)N /= p;\n }\n }\n if (N != 1)P.push_back(N);\n\n N = P.size();\n rep(bit, (1 << N)) {\n ll k = 1;\n ll t = 0;\n rep(i, N) {\n if (bit & (1 << i)) {\n k *= P[i];\n t++;\n }\n }\n res += (t % 2 == 0 ? 1 : -1) * n / k;\n }\n return res;\n\n}\n\nmap<string, ll> M;\n\nbool OK = 1;\nll dfs(string S) {\n ll res = 0;\n ll N = S.size();\n rep(i, N) {\n ll d = 0;\n ll R = i;\n if (S[i] <= 'Z' && S[i] >= 'A') {\n string G = \"\";\n if (S.size() > 1 && (S[i + 1] <= 'z' && S[i + 1] > 'a')) {\n G = S.substr(i, 2);\n R = i + 1;\n }\n else {\n G = S.substr(i, 1);\n R = i;\n }\n if (!M.count(G)) {\n OK = 0;\n return res;\n }\n d = M[G];\n }\n else if (S[i] == '(') {\n ll L = i;\n ll k = 0;\n for (ll j = i; j < N; j++) {\n if (S[j] == '(')k++;\n else if (S[j] == ')') {\n k--;\n if (k == 0) {\n d = dfs(S.substr(L + 1, j - L - 1));\n R = j;\n break;\n }\n }\n }\n }\n else continue;\n ll b = 1;\n if (S.size() > R + 1) {\n if ('0' <= S[R + 1] && S[R + 1] <= '9') {\n b = S[R + 1] - '0';\n R++;\n if (S.size() > R + 1) {\n if ('0' <= S[R + 1] && S[R + 1] <= '9') {\n b = b * 10 + S[R + 1] - '0';\n R++;\n }\n }\n }\n }\n res += d * b;\n i = R;\n }\n\n\n return res;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n\n while (1) {\n ll N;\n cin >> N;\n if (N == 0)return 0;\n vector<string> S(N);\n rep(i, N)cin >> S[i];\n vector<bool> D(N, 1);\n rep(i, N) {\n rep(j, N) {\n if (i == j)continue;\n for (ll k = 0; k < ll(S[j].size()) - ll(S[i].size())+1; k++) {\n if (S[j].substr(k, S[i].size()) == S[i]) {\n D[i] = 0;\n }\n }\n }\n }\n vector<string> T;\n rep(i, N) {\n if (D[i])T.push_back(S[i]);\n }\n N = T.size();\n S = T;\n vvll DP((1 << N), vll(N, 1e18));\n rep(i, N) {\n DP[(1 << i)][i] = T[i].size();\n }\n\n vvll Z(N, vll(N,0));\n rep(i, N)rep(j, N) {\n rep(k, S[j].size()) {\n if (k == 0)continue;\n if (S[i].size()<k)break;\n string P = S[i].substr(S[i].size() - k, k);\n string Q = S[j].substr(0, k);\n if (P == Q) {\n Z[i][j] = k;\n }\n }\n }\n rep(bit, (1 << N)) {\n if (bit == 0)continue;\n rep(j, N) {\n if (!(bit & (1 << j)))continue;\n rep(n, N) {\n if (bit & (1 << n))continue;\n chmin(DP[bit + (1 << n)][n], DP[bit][j]+ll(T[n].size()) - Z[j][n]);\n }\n }\n }\n ll an = 1e18;\n rep(i, N)chmin(an, DP[(1 << N) - 1][i]);\n cout << an << endl;\n }\n\n}","accuracy":1,"time_ms":180,"memory_kb":5812,"score_of_the_acc":-0.0218,"final_rank":9},{"submission_id":"aoj_1320_6710683","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\nnamespace ebi {\n\nvoid main_() {\n int n;\n while (std::cin >> n, n != 0) {\n std::vector<std::string> s(n);\n std::cin >> s;\n {\n std::vector<std::string> cp;\n rep(i, 0, n) {\n bool flag = false;\n rep(j, 0, n) {\n if (flag) break;\n if (i == j) continue;\n int isz = s[i].size();\n int jsz = s[j].size();\n if (isz >= jsz) continue;\n rep(k, 0, jsz) {\n if (k + isz > jsz) break;\n if (s[j].substr(k, isz) == s[i]) {\n flag = true;\n break;\n }\n }\n }\n if (flag) continue;\n cp.emplace_back(s[i]);\n }\n s = cp;\n }\n n = s.size();\n std::vector dp(1 << n, std::vector<int>(n, INF));\n std::vector duplicates(n, std::vector<int>(n, 0));\n rep(i,0,n) rep(j,0,n) {\n int isz = s[i].size();\n int jsz = s[j].size();\n rep(k,0,isz) {\n bool flag = true;\n rep(l,0,isz-k) {\n if(l >= jsz || s[i][k+l] != s[j][l]) {\n flag = false;\n break;\n }\n }\n if(flag) {\n duplicates[i][j] = isz - k;\n break;\n }\n }\n }\n auto f = [&](auto &&self, int bit, int back) -> int {\n if(dp[bit][back] != INF) return dp[bit][back];\n if(bit == (1<<back)) return dp[bit][back] = s[back].size();\n int prev = bit ^ (1<<back);\n rep(i,0,n) if((prev >> i) & 1) {\n chmin(dp[bit][back], self(self, prev, i) + (int)s[back].size() - duplicates[i][back]);\n }\n return dp[bit][back];\n };\n int ans = INF;\n rep(i, 0, n) chmin(ans, f(f, (1 << n) - 1, i));\n std::cout << ans << '\\n';\n }\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":4792,"score_of_the_acc":-0.0234,"final_rank":11},{"submission_id":"aoj_1320_6706859","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nint solve2(V<string>& T) {\n const int INF = 1 << 30;\n int N = T.size();\n int N2 = 1 << N;\n V<V<int>> cost(N, V<int>(N, INF));\n rep(las, N) {\n rep(nex, N) {\n if (las == nex) continue;\n int l2 = T[nex].size();\n for (int sz = l2 - 1; sz >= 0; sz--) {\n // S[nex].substr(0, sz)\n if (T[las].size() < sz) continue;\n if (T[las].substr(T[las].size() - sz) == T[nex].substr(0, sz)) {\n cost[las][nex] = l2 - sz;\n break;\n }\n }\n }\n }\n V<V<int>> dp(N2, V<int>(N, INF));\n rep(i, N) dp[1 << i][i] = T[i].size();\n for (int s = 1; s < N2; s++) {\n for (int las = 0; las < N; las++) {\n if ((s >> las & 1) == 0) continue;\n if (dp[s][las] == INF) continue;\n for (int nex = 0; nex < N; nex++) {\n if (s >> nex & 1) continue;\n dp[s | (1 << nex)][nex] = min(dp[s | (1 << nex)][nex], dp[s][las] + cost[las][nex]);\n }\n }\n }\n int ans = *min_element(dp[N2 - 1].begin(), dp[N2 - 1].end());\n return ans;\n}\n\nvoid solve(int N) {\n V<string> S(N);\n rep(i, N) cin >> S[i];\n V<int> cont(N, 0);\n rep(i, N) {\n // check S[i] in S[j]\n int lsi = S[i].size();\n rep(j, N) {\n if (i == j) continue;\n int lsj = S[j].size();\n if (lsi > lsj) continue;\n rep(k, lsj - lsi + 1) {\n if (S[i] == S[j].substr(k, lsi)) {\n cont[i] = 1;\n break;\n }\n }\n if (cont[i]) break;\n }\n }\n V<string> T;\n rep(i, N) if (cont[i] == 0) T.push_back(S[i]);\n cout << solve2(T) << '\\n';\n return;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N != 0) solve(N);\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":4572,"score_of_the_acc":-0.0045,"final_rank":2},{"submission_id":"aoj_1320_6706850","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nint solve2(V<string>& T) {\n const int INF = 1 << 30;\n int N = T.size();\n int N2 = 1 << N;\n V<V<int>> dp(N2, V<int>(N, INF));\n rep(i, N) dp[1 << i][i] = T[i].size();\n for (int s = 1; s < N2; s++) {\n for (int las = 0; las < N; las++) {\n if ((s >> las & 1) == 0) continue;\n if (dp[s][las] == INF) continue;\n for (int nex = 0; nex < N; nex++) {\n if (s >> nex & 1) continue;\n int l2 = T[nex].size();\n for (int sz = l2 - 1; sz >= 0; sz--) {\n // S[nex].substr(0, sz)\n if (T[las].size() < sz) continue;\n if (T[las].substr(T[las].size() - sz) == T[nex].substr(0, sz)) {\n dp[s | (1 << nex)][nex] = min(dp[s | (1 << nex)][nex], dp[s][las] + l2 - sz);\n break;\n }\n }\n }\n }\n }\n int ans = *min_element(dp[N2 - 1].begin(), dp[N2 - 1].end());\n return ans;\n}\n\nvoid solve(int N) {\n V<string> S(N);\n rep(i, N) cin >> S[i];\n V<int> cont(N, 0);\n rep(i, N) {\n // check S[i] in S[j]\n int lsi = S[i].size();\n rep(j, N) {\n if (i == j) continue;\n int lsj = S[j].size();\n if (lsi > lsj) continue;\n rep(k, lsj - lsi + 1) {\n if (S[i] == S[j].substr(k, lsi)) {\n cont[i] = 1;\n break;\n }\n }\n if (cont[i]) break;\n }\n }\n show(cont);\n V<string> T;\n rep(i, N) if (cont[i] == 0) T.push_back(S[i]);\n cout << solve2(T) << '\\n';\n return;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N != 0) solve(N);\n return 0;\n}","accuracy":1,"time_ms":6730,"memory_kb":4676,"score_of_the_acc":-1.0055,"final_rank":19},{"submission_id":"aoj_1320_6179467","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n vector<string> S(n);\n for(int i = 0; i < n; i++) cin >> S[i];\n vector<string> T;\n for(int i = 0; i < n; i++){\n bool ok = true;\n for(int j = 0; j < n; j++){\n if(i == j) continue;\n int found = S[j].find(S[i]);\n if(found != string::npos){\n ok = false;\n break;\n }\n }\n if(ok) T.push_back(S[i]);\n }\n S = T;\n n = S.size();\n vector<vector<int>> common(n, vector<int>(n, 0));\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n if(i == j) continue;\n int li = S[i].size();\n int lj = S[j].size();\n int mi = min(li, lj);\n for(int k = 1; k < mi; k++){\n bool ok = true;\n for(int l = 0; l < k; l++){\n if(S[i][li - k + l] != S[j][l]){\n ok = false;\n break;\n }\n }\n if(ok) common[i][j] = k;\n }\n }\n }\n vector<vector<int>> dp(1 << n, vector<int>(n, 0));\n for(int bit = 0; bit < (1 << n); bit++){\n for(int j = 0; j < n; j++){\n if(bit >> j & 1){\n for(int k = 0; k < n; k++){\n if(j != k && (bit >> k & 1)){\n dp[bit][j] = max(dp[bit][j], dp[bit ^ (1 << j)][k] + common[j][k]);\n }\n }\n }\n }\n }\n int ans = 0;\n for(auto s: S) ans += s.size();\n int max_ = 0;\n for(int i = 0; i < n; i++) max_ = max(max_, dp[(1 << n) - 1][i]);\n cout << ans - max_ << \"\\n\";\n \n \n }\n}","accuracy":1,"time_ms":210,"memory_kb":4764,"score_of_the_acc":-0.0156,"final_rank":8},{"submission_id":"aoj_1320_6000659","code_snippet":"#define rep(i, n) for(int i=0; i<(n); ++i)\n#define rrep(i, n) for(int i=(n-1); i>=0; --i)\n#define rep2(i, s, n) for(int i=s; i<(n); ++i)\n#define ALL(v) (v).begin(), (v).end()\n#define memr(dp, val) memset(dp, val, sizeof(dp))\n#define fi first\n#define se second\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\ntypedef long long ll;\nconst int INTINF = INT_MAX >> 1;\nstatic const ll LLINF = (LLONG_MAX >> 1);\n\nint n;\nstring s[15];\nstring ss[15]; // 包含しているsを除いた入力\nint dp[1 << 15][15][15];\n\nbool a_has_b(string a, string b){\n\tif(a.size() < b.size()) return false;\n\n\trep(i, a.size()){\n\t\tif(i + b.size() - 1 >= a.size()) break;\n\t\tbool ok = true;\n\t\trep(j, b.size()){\n\t\t\tif(a[i+j] != b[j]) ok = false;\n\t\t}\n\t\tif(ok) return true;\n\t}\n\treturn false;\n}\n\nbool input(){\n\n\tcin >> n;\n\tif(!n) return false;\n\trep(i, n) cin >> s[i];\n\n\tbool inclusions[15];\n\tmemr(inclusions, 0);\n\trep(i, n){\n\t\trep2(j, i+1, n){\n\t\t\tif(a_has_b(s[i], s[j])) inclusions[j] = true; \n\t\t\tif(a_has_b(s[j], s[i])) inclusions[i] = true; \n\t\t}\n\t}\n\n\tss[0] = \"\";\n\tint cnt = 1;\n\trep(i, n){\n\t\tif(!inclusions[i]){\n\t\t\tss[cnt] = s[i];\n\t\t\tcnt++;\n\t\t}\n\t}\n\n\tn = cnt - 1;\n\n\treturn true;\n}\n\nint cost[15][15];\n\nint calc(string a, string b){\n\tint ret = 0;\n\trep(i, a.size()){\n\t\tint cnt = 0;\n\t\trep(j, b.size()){\n\t\t\tif(i + j >= a.size()) break;\n\t\t\tif(a[i+j] == b[j]) {\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tcnt = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tchmax(ret, cnt);\n\t}\n\treturn ret;\n}\n\nint main(){\n std::cout << std::fixed << std::setprecision(15);\n\n\twhile(input()){\n\t\trep(i, 1 << n) rep(j, 15) rep(k, 15) dp[i][j][k] = INTINF;\n\n\t\trep(i, 15) rep(j, 15) cost[i][j] = INTINF;\n\t\trep(i, n+1){\n\t\t\trep(j, n+1){\n\t\t\t\tchmin(cost[i][j], calc(ss[i], ss[j]));\n\t\t\t\tchmin(cost[j][i], calc(ss[j], ss[i]));\n\t\t\t}\n\t\t}\n\t\t\n\t\tqueue<tuple<int, int, int> > q;\n\t\tq.push({0, 0, 0});\n\t\tdp[0][0][0] = 0;\n\n\t\twhile(q.size()){\n\t\t\tint S, front, back;\n\t\t\tauto f = q.front(); q.pop();\n\t\t\ttie(S, front, back) = f;\n\t\t\trep(i, n){\n\t\t\t\tif(!(S >> i & 1)){\n\t\t\t\t\tif(dp[S | 1 << i][i+1][back] == INTINF) q.push({S | 1 << i, i + 1, back});\n\t\t\t\t\tif(dp[S | 1 << i][front][i+1] == INTINF) q.push({S | 1 << i, front, i + 1});\n\t\t\t\t\tchmin(dp[S | 1 << i][i+1][back], dp[S][front][back] + int(ss[i+1].size()) - cost[i+1][front]);\n\t\t\t\t\tchmin(dp[S | 1 << i][front][i+1], dp[S][front][back] + int(ss[i+1].size()) - cost[back][i+1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tint ans = INTINF;\n\t\trep(i, n+1) rep(j, n+1) {\n\t\t\tchmin(ans, dp[(1 << n) - 1][i][j]);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n return 0;\n}","accuracy":1,"time_ms":2380,"memory_kb":22356,"score_of_the_acc":-0.5269,"final_rank":16},{"submission_id":"aoj_1320_5971021","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\n#define ft first\n#define sc second\n#define pb push_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(),(v).end()\n#define LB(a,x) lb(all(a),x)-a.begin()\n#define UB(a,x) ub(all(a),x)-a.begin()\n#define mod 1000000007\n//#define mod 998244353\n#define FS fixed<<setprecision(15)\nusing namespace std;\ntypedef long long ll;\nconst double pi=3.141592653589793;\ntemplate<class T> using V=vector<T>;\nusing P=pair<int,int>;\ntypedef unsigned long long ull;\ntypedef long double ldouble;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline void out(T a){ cout << a << '\\n'; }\nvoid YN(bool ok){if(ok) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\n//void YN(bool ok){if(ok) cout << \"YES\" << endl; else cout << \"NO\" << endl;}\n\n\nconst ll INF=1e18;\nconst int mx=200005;\n\nint dp[(1<<14)+10][20];\n\nint main(){\n //オーバーフローは大丈夫ですか？？\n cin.tie(0);ios::sync_with_stdio(false);\n int cnt=0;\n while(true){\n cnt++;\n int n;\n cin>>n;\n if(n==0) break;\n V<string> s(n);\n cinf(n,s);\n \n int MX=1000000;\n V<int> lst((1<<n),-1);\n V<V<int>> cost(n,V<int>(n,MX));\n rep(i,n){\n int bit=(1<<i);\n for(int j=0;j<n;j++){\n if(j==i) continue;\n bool ok=0;\n rep(L,s[i].size()){\n for(int R=L;R<s[i].size();R++){\n if(s[i].substr(L,R-L+1)==s[j]){\n ok=1;\n }\n }\n }\n if(ok) cost[i][j]=0;\n }\n \n }\n rep(i,n){\n rep(j,n){\n if(i==j) cost[i][j]=0;\n else{\n chmin(cost[i][j],(int)s[j].size());\n rep(k,s[i].size()){\n int len=s[i].size()-k;\n if(len>s[j].size()) continue;\n if(s[i].substr(k,len)==s[j].substr(0,len)){\n chmin(cost[i][j],(int)s[j].size()-len);\n }\n }\n }\n }\n }\n rep(i,(1<<n))rep(j,n)dp[i][j]=MX;\n rep(i,n){\n dp[(1<<i)][i]=s[i].size();\n }\n rep(i,(1<<n)){\n rep(j,n){\n if(dp[i][j]==MX||!(i>>j&1)) continue;\n rep(k,n){\n if(i>>k&1) continue;\n int to=i|(1<<k);\n \n if(cost[j][k]==0) chmin(dp[to][j],dp[i][j]);\n else chmin(dp[to][k],dp[i][j]+cost[j][k]);\n }\n }\n }\n int ans=MX;\n rep(i,n) chmin(ans,dp[(1<<n)-1][i]);\n out(ans);\n }\n}","accuracy":1,"time_ms":310,"memory_kb":4792,"score_of_the_acc":-0.031,"final_rank":13},{"submission_id":"aoj_1320_5962479","code_snippet":"// #include \"atcoder/all\"\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h>\n#include <functional>\n#include <cassert>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing P = pair<ll,ll>;\nconstexpr ll INF = 1e15;\nconstexpr ll LLMAX = 9223372036854775807;\nconstexpr int inf = 1e9;\n// constexpr ll mod = 1000000007;\nconstexpr ll mod = 998244353;\n// 右下左上\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define eol \"\\n\"\n// ---------------------------------------------------------------------------\n\nbool solve(){\n int N;\n cin >> N;\n if(N == 0) return false;\n vector<string> S(N);\n for(int i=0; i<N; i++){\n cin >> S[i];\n }\n vector<int> lost(N,false);\n for(int i=0; i<N; i++){\n for(int j=0; j<N; j++){\n if(i == j) continue;\n for(int l=0; l<S[j].size(); l++){\n if(l+S[i].size() > S[j].size()) continue;\n if(S[i] == S[j].substr(l,S[i].size())){\n lost[i] = true;\n }\n }\n }\n }\n int cnt = 0;\n map<int,int> pos;\n for(int i=0; i<N; i++){\n if(lost[i]) continue;\n pos[cnt] = i;\n cnt++;\n }\n vector<vector<int>> dist(cnt,vector<int>(cnt));\n for(int i=0; i<cnt; i++){\n for(int j=0; j<cnt; j++){\n string s = S[pos[i]];\n string t = S[pos[j]];\n int mx = 0;\n for(int l=0; l<s.size(); l++){\n int len = s.size()-l;\n if(s.substr(l) == t.substr(0,len)){\n mx = len;\n break;\n }\n }\n dist[i][j] = t.size()-mx;\n }\n }\n vector<vector<int>> dp(cnt,vector<int>((1LL<<cnt),inf));\n for(int i=0; i<cnt; i++){\n dp[i][(1LL<<i)] = S[pos[i]].size();\n }\n for(int bit=0; bit<(1LL<<cnt); bit++){\n for(int i=0; i<cnt; i++){\n if(!(bit & (1LL<<i))) continue;\n for(int nxt=0; nxt<cnt; nxt++){\n if(bit & (1LL<<nxt)) continue;\n if(chmin(dp[nxt][bit+(1LL<<nxt)],dp[i][bit]+dist[i][nxt]));\n }\n }\n }\n int ans = inf;\n for(int i=0; i<cnt; i++){\n chmin(ans, dp[i][(1LL<<cnt)-1]);\n }\n // for(int i=0; i<cnt; i++){\n // for(int j=0; j<cnt ;j++){\n // cout << dist[i][j] << \" \\n\"[j+1==cnt];\n // }\n // }\n cout << ans << endl;\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":4140,"score_of_the_acc":-0.0015,"final_rank":1},{"submission_id":"aoj_1320_5950425","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if(n == 0) {\n return 0;\n }\n vector<string>S(n);\n for(int i = 0; i < n; i++) {\n cin >> S[i];\n }\n vector<string>T;\n for(int i = 0; i < n; i++) {\n bool flag = true;\n for(int j = 0; j < n; j++) {\n if(i == j || S[i].size() >= S[j].size()) {\n continue;\n }\n for(int k = 0; k < S[j].size()-S[i].size()+1; k++) {\n if(S[i] == S[j].substr(k,S[i].size())) {\n flag = false;\n }\n }\n }\n if(flag) {\n T.push_back(S[i]);\n }\n }\n vector<vector<int>>tmp(T.size(),vector<int>(T.size()));\n vector<vector<int>>dp(1 << T.size(),vector<int>(T.size(),1001001001));\n for(int i = 0; i < T.size(); i++) {\n dp[(1 << i)][i] = T[i].size();\n for(int j = 0; j < T.size(); j++) {\n for(int k = 0; k < min(T[i].size(),T[j].size()); k++) {\n if(T[i].substr(T[i].size()-k,k) == T[j].substr(0,k)) {\n tmp[i][j] = T[j].size()-k;\n }\n }\n }\n }\n for(int i = 0; i < (1 << T.size()); i++) {\n for(int j = 0; j < T.size(); j++) {\n for(int k = 0; k < T.size(); k++) {\n if(!(1 & (i >> k))) {\n dp[i|(1 << k)][k] = min(dp[i|(1 << k)][k],dp[i][j]+tmp[j][k]);\n }\n }\n }\n }\n cout << *min_element(dp[(1 << T.size())-1].begin(),dp[(1 << T.size())-1].end()) << endl;\n }\n}","accuracy":1,"time_ms":180,"memory_kb":4848,"score_of_the_acc":-0.0119,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1320_10954681\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n;\\nvector<int> ls;\\nvector<vector<int>> v; // v[i][j] = overlap length a[i] suffix vs a[j] prefix\\nunordered_map<long long,int> cac; // memo for sediv\\nunordered_map<int,int> bp; // single-bit -> index\\n\\nconst int INF = 1000000000;\\n\\nlong long make_key(int st, int en, int tp) {\\n // replicate Python: cachenm = st + en*n + tp*n*n\\n long long nn = (long long)n * (long long)n;\\n return (long long)tp * nn + (long long)en * n + st;\\n}\\n\\nint sediv(int st, int en, int tp) {\\n long long key = make_key(st,en,tp);\\n auto it = cac.find(key);\\n if (it != cac.end()) return it->second;\\n\\n if (tp == 0) {\\n int tmp = ls[st] + ls[en] - v[st][en];\\n cac[key] = tmp;\\n return tmp;\\n }\\n auto itbp = bp.find(tp);\\n if (itbp != bp.end()) {\\n int a = itbp->second;\\n int tmp = ls[st] + ls[a] + ls[en] - v[st][a] - v[a][en];\\n cac[key] = tmp;\\n return tmp;\\n }\\n\\n int mn = INF;\\n for (int i = 0; i < n-1; ++i) {\\n if (!(tp & (1<<i))) continue;\\n for (int j = i+1; j < n; ++j) {\\n if (!(tp & (1<<j))) continue;\\n int tp2 = tp & ~( (1<<i) | (1<<j) );\\n int tmp1 = sediv(i,j,tp2) - v[st][i] - v[j][en];\\n int tmp2 = sediv(j,i,tp2) - v[st][j] - v[i][en];\\n int cur = min(tmp1, tmp2);\\n if (cur < mn) mn = cur;\\n }\\n }\\n mn += ls[st] + ls[en];\\n cac[key] = mn;\\n return mn;\\n}\\n\\n// overlap function same as Python sc\\nint sc_str_overlap(const string &a, const string &b) {\\n int lna = (int)a.size();\\n int lnb = (int)b.size();\\n for (int i = 0; i < (int)a.size(); ++i) {\\n if (lnb + i <= lna) continue;\\n int len = lna - i;\\n // compare a[i:] with b[:len]\\n bool ok = true;\\n for (int k = 0; k < len; ++k) {\\n if (a[i+k] != b[k]) { ok = false; break; }\\n }\\n if (ok) return len;\\n }\\n return 0;\\n}\\n\\n// generate next combination in lexicographic order\\n// a: current indices (size k), n: range, returns false if no next\\nbool next_combination(vector<int> &a, int n, int k) {\\n for (int i = k-1; i >= 0; --i) {\\n if (a[i] != i + n - k) {\\n ++a[i];\\n for (int j = i+1; j < k; ++j) a[j] = a[j-1] + 1;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n // prepare bp\\n for (int i = 0; i < 15; ++i) bp[1<<i] = i;\\n\\n while (true) {\\n if (!(cin >> n)) return 0;\\n if (n == 0) return 0;\\n vector<string> s;\\n s.reserve(n);\\n for (int i = 0; i < n; ++i) {\\n string t; cin >> t;\\n s.push_back(t);\\n }\\n\\n // dpl: remove strings fully contained in others\\n {\\n vector<char> removed(n, 0);\\n for (int i = 0; i < n; ++i) {\\n if (removed[i]) continue;\\n for (int j = 0; j < n; ++j) {\\n if (i == j || removed[j]) continue;\\n if (s[i].size() <= s[j].size()) {\\n // check if s[i] is substring of s[j]\\n if (s[j].find(s[i]) != string::npos) {\\n removed[i] = 1;\\n break;\\n }\\n }\\n }\\n }\\n vector<string> ns;\\n for (int i = 0; i < n; ++i) if (!removed[i]) ns.push_back(s[i]);\\n s.swap(ns);\\n }\\n\\n n = (int)s.size();\\n if (n == 0) { cout << 0 << '\\\\n'; continue; }\\n\\n // build v\\n v.assign(n, vector<int>(n,0));\\n if (n == 1) {\\n cout << s[0].size() << '\\\\n';\\n continue;\\n }\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < n; ++j) {\\n if (i == j) continue;\\n v[i][j] = sc_str_overlap(s[i], s[j]);\\n }\\n }\\n ls.assign(n,0);\\n for (int i = 0; i < n; ++i) ls[i] = (int)s[i].size();\\n\\n if (n <= 3) {\\n // brute force permutations to get maximum overlaps sum\\n vector<int> perm(n);\\n for (int i = 0; i < n; ++i) perm[i] = i;\\n int best = 0;\\n do {\\n int sum = 0;\\n for (int i = 0; i+1 < n; ++i) sum += v[perm[i]][perm[i+1]];\\n best = max(best, sum);\\n } while (next_permutation(perm.begin(), perm.end()));\\n int total_len = 0;\\n for (int x : ls) total_len += x;\\n cout << (total_len - best) << '\\\\n';\\n continue;\\n }\\n\\n cac.clear();\\n\\n int div2 = n/2;\\n int div3 = n - div2;\\n int sm = (1<<n);\\n\\n // prepare initial combination [0,1,...,div2-1]\\n vector<int> comb(div2);\\n for (int i = 0; i < div2; ++i) comb[i] = i;\\n\\n int ans = INF;\\n\\n bool first = true;\\n while (true) {\\n // comb is current combination in lexicographic order\\n if (!first) {\\n // already advanced\\n }\\n first = false;\\n\\n // replicate Python's: if i[0] != 0: break\\n if (comb[0] != 0) break;\\n\\n int gr0 = 0;\\n for (int x : comb) gr0 |= (1<<x);\\n int gr1 = (sm - 1) ^ gr0; // complement within n bits\\n\\n // lga, lgb: store sediv results for start-end pairs\\n // use 2D vectors filled with INF\\n vector<vector<int>> lga(n, vector<int>(n, INF));\\n vector<vector<int>> lgb(n, vector<int>(n, INF));\\n\\n // for gr0: iterate all pairs i<j that exist in gr0\\n for (int i = 0; i < n-1; ++i) {\\n if (!(gr0 & (1<<i))) continue;\\n for (int j = i+1; j < n; ++j) {\\n if (!(gr0 & (1<<j))) continue;\\n int msk = gr0 & ~( (1<<i) | (1<<j) );\\n lga[i][j] = sediv(i,j,msk);\\n lga[j][i] = sediv(j,i,msk);\\n }\\n }\\n\\n // for gr1: same\\n for (int i = 0; i < n-1; ++i) {\\n if (!(gr1 & (1<<i))) continue;\\n for (int j = i+1; j < n; ++j) {\\n if (!(gr1 & (1<<j))) continue;\\n int msk = gr1 & ~( (1<<i) | (1<<j) );\\n lgb[i][j] = sediv(i,j,msk);\\n lgb[j][i] = sediv(j,i,msk);\\n }\\n }\\n\\n int mn = INF;\\n // iterate over valid (sta,ena) in lga and (stb,enb) in lgb\\n for (int sta = 0; sta < n; ++sta) {\\n for (int ena = 0; ena < n; ++ena) {\\n if (lga[sta][ena] == INF) continue;\\n for (int stb = 0; stb < n; ++stb) {\\n for (int enb = 0; enb < n; ++enb) {\\n if (lgb[stb][enb] == INF) continue;\\n // two combinations as in python\\n int tmp = lga[sta][ena] + lgb[stb][enb] - v[ena][stb];\\n if (tmp < mn) mn = tmp;\\n tmp = lga[sta][ena] + lgb[stb][enb] - v[enb][sta];\\n if (tmp < mn) mn = tmp;\\n }\\n }\\n }\\n }\\n if (mn < ans) ans = mn;\\n\\n // advance combination\\n if (!next_combination(comb, n, div2)) break;\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3510,\n \"memory_kb\": 10704,\n \"score_of_the_acc\": -0.5784,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1320_10856460\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <vector>\\n\\nusing namespace std;\\n\\nconst int maxn = 30;\\n\\nint n;\\nint extra[maxn][maxn], f[1<<15][maxn];\\nchar word[maxn][maxn];\\nbool substr[maxn];\\nvector<char*> wd;\\n\\nint main()\\n{\\n#ifdef LOCAL\\n\\tfreopen(\\\"F.in\\\", \\\"r\\\", stdin);\\n#endif\\n\\twhile(scanf(\\\"%d\\\", &n) != EOF) {\\n\\t\\tif(n == 0)\\tbreak;\\n\\t\\tmemset(substr, 0, n*sizeof(char));\\n\\t\\twd.clear();\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tscanf(\\\"%s\\\", word+i);\\n\\t\\t\\tfor(int j = 0; j < i; j++) {\\n\\t\\t\\t\\tif(strstr(word[i], word[j]) != NULL)\\tsubstr[j] = true;\\n\\t\\t\\t\\telse if(strstr(word[j], word[i]) != NULL)\\tsubstr[i] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tif(!substr[i])\\twd.push_back(word[i]);\\n\\t\\tfor(int i = 0; i < wd.size(); i++)\\n\\t\\t\\tfor(int j = 0; j < wd.size(); j++) {\\n\\t\\t\\t\\tint plen = strlen(wd[i]), nlen = strlen(wd[j]), match = 0;\\n\\t\\t\\t\\tfor(int k = min(nlen, plen); k > 0; k--)\\n\\t\\t\\t\\t\\tif(strncmp(wd[j], wd[i]+plen-k, k) == 0)\\t{\\n\\t\\t\\t\\t\\t\\tmatch = k;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\textra[i][j] = nlen-match;\\n\\t\\t\\t}\\n\\t\\tint cnt = wd.size();\\n\\t\\tmemset(f, 0, sizeof(f));\\n\\t\\tfor(int i = 0; i < cnt; i++)\\n\\t\\t\\tf[1<<i][i] = strlen(wd[i]);\\n\\t\\tfor(int i = 1; i < (1 << cnt); i++) \\n\\t\\t\\tfor(int j = 0; j < cnt; j++) {\\n\\t\\t\\t\\tif(((1<<j)&i) == 0)\\tcontinue; \\n\\t\\t\\t\\tfor(int k = 0; k < cnt; k++) {\\n\\t\\t\\t\\t\\tif((1<<k)&i)\\tcontinue; \\n\\t\\t\\t\\t\\tint now = i|(1<<k); \\n\\t\\t\\t\\t\\tf[now][k] = f[now][k]? min(f[now][k], f[i][j]+extra[j][k]):f[i][j]+extra[j][k]; \\n//\\t\\t\\t\\t\\tif(i == 13)\\n//\\t\\t\\t\\t\\tcout << \\\"Insert \\\" << k << \\\" after \\\" << j << ' ' << f[now][k] << endl; \\n\\t\\t\\t\\t} \\n\\t\\t\\t} \\n\\t\\tint ans = cnt*maxn; \\n\\t\\tfor(int i = 0; i < cnt; i++) \\n\\t\\t\\tans = min(ans, f[(1<<cnt)-1][i]); \\n\\t\\tprintf(\\\"%d\\\\n\\\", ans); \\n\\t}\\n\\treturn 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 7416,\n \"score_of_the_acc\": -0.0338,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1320_9680190\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n vector<string> T(N);\\n rep(i,0,N) cin >> T[i];\\n vector<string> S;\\n rep(i,0,N) {\\n bool check = true;\\n rep(j,0,N) {\\n if (i==j) continue;\\n if (T[i].size() > T[j].size()) continue;\\n rep(k,0,T[j].size()) {\\n if (k+(int)T[i].size() > (int)T[j].size()) break;\\n if (T[j].substr(k,T[i].size()) == T[i]) check = false;\\n }\\n }\\n if (check) S.push_back(T[i]);\\n }\\n N = S.size();\\n vector<vector<int>> G(N,vector<int>(N,inf));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (i == j) {\\n G[i][j] = 0;\\n continue;\\n }\\n rep(k,0,min(S[i].size(),S[j].size())) {\\n if (S[i].substr(S[i].size()-k,k) == S[j].substr(0,k)) G[i][j] = (int)S[j].size() - k;\\n }\\n }\\n }\\n vector DP(1<<N, vector<int>(N,inf));\\n rep(i,0,N) DP[1<<i][i] = S[i].size();\\n rep(i,1,1<<N) {\\n rep(j,0,N) {\\n if (DP[i][j] == inf) continue;\\n rep(k,0,N) {\\n if (i & (1<<k)) continue;\\n chmin(DP[i|(1<<k)][k],DP[i][j]+G[j][k]);\\n }\\n }\\n }\\n int ANS = inf;\\n rep(i,0,N) chmin(ANS, DP[(1<<N)-1][i]);\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 4740,\n \"score_of_the_acc\": -0.0123,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1320_9205868\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < n; i++)\\n\\nint calcdif(string s, string t) { // 文字列tの長さ - 文字列sと文字列tの共通部分の長さ\\n int sz = s.size();\\n int tz = t.size();\\n int comlen = 0;\\n for (int i = 0; i < sz; i++) { // sのiからszまでとtの0からlenまでの共通部分の長さを計算する\\n for (int len = 1; len <= tz; len++) {\\n string ss = s.substr(i, sz);\\n string tt = t.substr(0, len);\\n if (ss == tt) {\\n comlen = max(comlen, len);\\n }\\n }\\n }\\n\\n return tz - comlen;\\n}\\n\\nint main() {\\n int n;\\n while(cin >> n && n) {\\n vector<string> cities(n);\\n rep(i, n) cin >> cities[i];\\n\\n vector<int> unIncludedCities; // 互いに部分文字列になっていない都市のリスト\\n\\n rep(i, n) { // 都市iが他の都市の部分文字列になってないなら、unIncludedCitiesに追加\\n bool isInclude = false;\\n rep(j, n) {\\n if(i == j) continue;\\n if(cities[j].find(cities[i]) != string::npos) {\\n isInclude = true;\\n break;\\n }\\n }\\n if(!isInclude) unIncludedCities.push_back(i);\\n }\\n\\n int m = unIncludedCities.size();\\n\\n vector<vector<int>> dif(m, vector<int>(m)); // dif[i][j] := 都市jの長さ - 都市iの末尾と都市jの先頭の重複する部分の長さ\\n rep(i, m) rep(j, m) {\\n dif[i][j] = calcdif(cities[unIncludedCities[i]], cities[unIncludedCities[j]]);\\n }\\n\\n vector<vector<int>> dp((1 << m), vector<int>(m, 1e9)); // dp[i][j] := 集合iを訪れて都市jにいるときの統合された文字列の最小の長さ\\n rep(i, m) dp[1 << i][i] = cities[unIncludedCities[i]].size(); // 初期値が都市iのとき、都市iの長さを格納\\n\\n rep(i, (1 << m)) rep(j, m) {\\n if(!(i & (1 << j))) continue;\\n rep(k, m) {\\n if(i & (1 << k)) continue;\\n dp[i | (1 << k)][k] = min(dp[i | (1 << k)][k], dp[i][j] + dif[j][k]);\\n }\\n }\\n\\n cout << *min_element(dp[(1 << m) - 1].begin(), dp[(1 << m) - 1].end()) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4620,\n \"score_of_the_acc\": -0.0095,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1320_9205813\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing uint = unsigned;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\nusing tuplis = array<ll, 3>;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll LINF=0x1fffffffffffffff;\\nconst ll MINF=0x7fffffffffff;\\nconst int INF=0x3fffffff;\\nconst int MOD=1000000007;\\nconst int MODD=998244353;\\nconst ld DINF=numeric_limits<ld>::infinity();\\nconst ld EPS=1e-9;\\nconst ld PI=3.14159265358979323846;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define overload5(a,b,c,d,e,name,...) name\\n#define overload4(a,b,c,d,name,...) name\\n#define overload3(a,b,c,name,...) name\\n#define rep1(n) for(ll i=0;i<n;++i)\\n#define rep2(i,n) for(ll i=0;i<n;++i)\\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\\n#define rrep1(n) for(ll i=n;i--;)\\n#define rrep2(i,n) for(ll i=n;i--;)\\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\\n#define each1(i,a) for(auto&&i:a)\\n#define each2(x,y,a) for(auto&&[x,y]:a)\\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\\n#define all1(i) begin(i),end(i)\\n#define all2(i,a) begin(i),begin(i)+a\\n#define all3(i,a,b) begin(i)+a,begin(i)+b\\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\\n#define rall1(i) rbegin(i),rend(i)\\n#define rall2(i,a) rbegin(i),rbegin(i)+a\\n#define rall3(i,a,b) rbegin(i)+a,rbegin(i)+b\\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\\n#define Msum(...) accumulate(all(__VA_ARGS__),mint{})\\n#define elif else if\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector name(h,vector(w,vector<type>(__VA_ARGS__)))\\ntemplate<class T> ll sz(const T& a){ return size(a); }\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ntemplate<class T, class U> ll count(const T& a, const U& b){ return count(all(a), b); }\\ntemplate<class T, class F> ll count_if(const T& a, F b){ return count_if(all(a), b); }\\ntemplate<class T, class F> void filter(T& a, F b){ a.erase(remove_if(all(a), not_fn(b)), a.end()); }\\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\\ntemplate<class T> void rev(T& a){ reverse(all(a)); }\\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\\nll popcnt(ull a){ return __builtin_popcountll(a); }\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\ntemplate<class T> unordered_map<T, ll> press(vector<T> a){ uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\\ntemplate<class T> auto run_press(const T& a){ vector<pair<decay_t<decltype(a[0])>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\\ntemplate<class... Ts> void in(Ts&... t);\\n[[maybe_unused]] void print(){}\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\\\n'; }\\nnamespace IO{\\n#define VOID(a) decltype(void(a))\\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\\ntemplate<int I> struct P : P<I-1>{};\\ntemplate<> struct P<0>{};\\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\\n#undef VOID\\n}\\n#define unpack(a) (void)(0 + ... + (a, 0))\\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\\n#undef unpack\\n#ifdef DEBUG\\nll __lg(ull x){ return 63 - __builtin_clzll(x); }\\n#define debug(...) { print(#__VA_ARGS__); print(\\n#else\\n#define debug(...) void(0)\\n#endif\\n#define YESNO(yes,no) void yes(bool i = 1){ out(i?#yes:#no); } void no(){ out(#no); }\\nYESNO(first, second)\\nYESNO(First, Second)\\nYESNO(Yes, No)\\nYESNO(YES, NO)\\nYESNO(possible, impossible)\\nYESNO(Possible, Impossible)\\nYESNO(POSSIBLE, IMPOSSIBLE)\\n\\n\\n\\ntemplate<class T> using P = pair<T, T>;\\n#define x first\\n#define y second\\ntemplate<class T> P<T> operator+(const P<T>& a, const P<T>& b) { return {a.x + b.x, a.y + b.y}; }\\ntemplate<class T> P<T> operator-(const P<T>& a, const P<T>& b) { return {a.x - b.x, a.y - b.y}; }\\ntemplate<class T> P<T> operator-(const P<T>& a) { return {-a.x, -a.y}; }\\ntemplate<class T, class U> P<T> operator*(const P<T>& a, const U& b) { return {a.x * b, a.y * b}; }\\ntemplate<class T, class U> P<T> operator/(const P<T>& a, const U& b) { return {a.x / b, a.y / b}; }\\ntemplate<class T> P<T>& operator+=(P<T>& a, const P<T>& b) { return a = a + b; }\\ntemplate<class T> P<T>& operator-=(P<T>& a, const P<T>& b) { return a = a - b; }\\ntemplate<class T, class U> P<T>& operator*=(P<T>& a, const U& b) { return a = a * b; }\\ntemplate<class T, class U> P<T>& operator/=(P<T>& a, const U& b) { return a = a / b; }\\ntemplate<class T> P<T> rotate(const P<T>& a) { return {-a.y, a.x}; } // 90 degree ccw\\ntemplate<class T> T dot(const P<T>& a, const P<T>& b) { return a.x * b.x + a.y * b.y; }\\ntemplate<class T> T cross(const P<T>& a, const P<T>& b) { return dot(rotate(a), b); }\\ntemplate<class T> T square(const P<T>& a) { return dot(a, a); }\\ntemplate<class T> ld abs(const P<T>& a) { return hypotl(a.x, a.y); }\\ntemplate<class T> T gcd(const P<T>& a) { return gcd(a.x, a.y); }\\ntemplate<class T> P<T> normalize(P<T> a) {\\n if(a == P<T>{}) return a;\\n a /= gcd(a);\\n if(a < P<T>{}) a = -a;\\n return a;\\n}\\n\\n// 文字列tの長さ - 文字列sと文字列tの共通部分の長さ\\nint calcdif(string s, string t) {\\n int sz = s.size();\\n int tz = t.size();\\n int comlen = 0;\\n for (int i = 0; i < sz; i++) { // sのiからszまでとtの0からlenまでの共通部分の長さを計算する\\n for (int len = 1; len <= tz; len++) {\\n string ss = s.substr(i, sz);\\n string tt = t.substr(0, len);\\n if (ss == tt) {\\n comlen = max(comlen, len);\\n }\\n }\\n }\\n\\n // // tがsに含まれている場合、末尾に付け足す文字列の長さは0\\n // for (int len = 1; len <= sz; len++) {\\n // for (int i = 0; i < sz; i++) {\\n // string ss = s.substr(i, len);\\n // string tt = t.substr(0, tz);\\n // if (ss == tt) {\\n // return 0;\\n // }\\n // }\\n // }\\n\\n return tz - comlen;\\n}\\n\\nint main() {\\n int n;\\n while(cin >> n && n) {\\n vector<string> str(n+1);\\n for (int i = 1; i <= n; i++) cin >> str[i];\\n\\n vector<string> rms;\\n // 他の文字列に含まれていない文字列を抽出\\n for (int i = 1; i <= n; i++) {\\n bool flag = false;\\n for (int j = 1; j <= n; j++) {\\n if (i == j) continue;\\n for (int len = 1; len <= str[j].size(); len++) {\\n for (int k = 0; k + len <= str[j].size(); k++) {\\n if (str[j].substr(k, len) == str[i]) {\\n flag = true;\\n break;\\n }\\n }\\n }\\n }\\n if (!flag) rms.push_back(str[i]);\\n }\\n // out(rms);\\n \\n int m = rms.size();\\n // dif[i][j] 文字列jの長さ - 文字列iと文字列jの共通部分の長さ\\n vector<vector<int>> dif(n+1, vector<int>(n+1, 0));\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < m; j++) {\\n if (i == j) continue;\\n dif[i][j] = calcdif(rms[i], rms[j]);\\n }\\n }\\n\\n // rep(i, m) {\\n // rep(j, m) {\\n // cout << dif[i][j] << \\\" \\\";\\n // }\\n // cout << endl;\\n // }\\n\\n // // dp[i][j] すでに状態iなる文字列を使っていて、現在位置がjであるときの併合した文字列の長さの最小値\\n vector<vector<int>> dp((1<<14)+1, vector<int>(n+1, INF));\\n for (int i = 0; i < m; i++) dp[(1<<i)][i] = rms[i].size();\\n for (int i = 1; i < (1<<m); i++) { // すでに使っている文字列の集合\\n for (int j = 0; j <= m; j++) { // 現在位置\\n if (dp[i][j] == INF) continue;\\n for (int k = 0; k < m; k++) { // 併合する文字列を選ぶ\\n if (i & (1<<(k))) continue; // すでに使っている文字列は使えない\\n chmin(dp[i|(1<<(k))][k], dp[i][j] + dif[j][k]);\\n }\\n }\\n }\\n out(*min_element(all(dp[(1<<m)-1])));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 4748,\n \"score_of_the_acc\": -0.0276,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1320_8992038\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint solve(int n) {\\n vector<string> s = in(n);\\n {\\n vector<string> ns;\\n for(int i : rep(n)) {\\n bool substr = false;\\n for(int j : rep(n)) if(j != i and s[i].size() <= s[j].size()) {\\n for(int k : rep(s[j].size())) {\\n if(s[j].substr(k, s[i].size()) == s[i]) {\\n substr = true;\\n }\\n }\\n }\\n if(!substr) ns.push_back(s[i]);\\n }\\n s = move(ns);\\n n = s.size();\\n }\\n\\n vector dp(1 << n, vector(n, int(1e9)));\\n for(int i : rep(n)) dp[1 << i][i] = s[i].size();\\n\\n vector c(n, vector(n, int(1e9)));\\n for(int i : rep(n)) for(int j : rep(n)) if(i != j) {\\n for(int k : revrep(int(s[i].size()))) {\\n if(s[i].substr(s[i].size() - k, k) == s[j].substr(0, k)) {\\n c[i][j] = s[j].size() - k;\\n break;\\n }\\n }\\n }\\n\\n for(int S : rep(1 << n)) if(S) {\\n for(int i : rep(n)) if(S & (1 << i)) {\\n for(int j : rep(n)) if(!(S & (1 << j))) {\\n chmin(dp[S | (1 << j)][j], dp[S][i] + c[i][j]);\\n }\\n }\\n }\\n\\n int ans = 1e9;\\n for(int i : rep(n)) chmin(ans, dp[(1 << n) - 1][i]);\\n return ans;\\n}\\n\\nint main() {\\n while(true) {\\n int n = in(); if(n == 0) break;\\n print(solve(n));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 4884,\n \"score_of_the_acc\": -0.0107,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1320_8992028\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint solve(int n) {\\n vector<string> s = in(n);\\n {\\n vector<string> ns;\\n for(int i : rep(n)) {\\n bool substr = false;\\n for(int j : rep(n)) if(j != i and s[i].size() <= s[j].size()) {\\n for(int k : rep(s[j].size())) {\\n if(s[j].substr(k, s[i].size()) == s[i]) {\\n substr = true;\\n }\\n }\\n }\\n if(!substr) ns.push_back(s[i]);\\n }\\n s = move(ns);\\n n = s.size();\\n }\\n\\n vector dp(1 << n, vector(n, int(1e9)));\\n for(int i : rep(n)) dp[1 << i][i] = s[i].size();\\n\\n for(int S : rep(1 << n)) if(S) {\\n for(int i : rep(n)) if(S & (1 << i)) {\\n for(int j : rep(n)) if(!(S & (1 << j))) {\\n for(int k : revrep(int(s[i].size()))) {\\n if(s[i].substr(s[i].size() - k, k) == s[j].substr(0, k)) {\\n chmin(dp[S | (1 << j)][j], dp[S][i] + int(s[j].size() - k));\\n break;\\n }\\n }\\n }\\n }\\n }\\n\\n int ans = 1e9;\\n for(int i : rep(n)) chmin(ans, dp[(1 << n) - 1][i]);\\n return ans;\\n}\\n\\nint main() {\\n while(true) {\\n int n = in(); if(n == 0) break;\\n print(solve(n));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6670,\n \"memory_kb\": 4804,\n \"score_of_the_acc\": -0.9977,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1320_8586452\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1<<29;\\nint n, fnt[15][15];\\nstring s[15];\\nint memo[1<<15][15];\\nint dp(int bit, int rht, int cnt){\\n if(cnt>=n) return 0;\\n if(memo[bit][rht]!=-1) return memo[bit][rht];\\n int res = INF;\\n for(int i=0;i<n;i++){\\n if((bit&1<<i)==0) res = min(res, dp((bit|1<<i), i, cnt+1)+fnt[rht][i]);\\n }\\n return memo[bit][rht] = res;\\n}\\nint main(){\\n while(cin >> n, n){\\n for(int i=0;i<n;i++) cin >> s[i];\\n \\n for(int i=0;i<n;i++){\\n fnt[n][i] = s[i].size();\\n for(int j=0;j<n;j++){\\n if(i==j) continue;\\n fnt[i][j] = s[j].size();\\n for(int k=0;k<s[i].size();k++){\\n int sel = s[i].size()-k;\\n if(s[i].substr(0, k)+s[j].substr(0, sel) == s[i]) fnt[i][j] = min(fnt[i][j], (int)s[j].size()-sel);\\n }\\n }\\n }\\n \\n int bit=0, cnt=0;\\n for(int i=0;i<n;i++){\\n bool ok = false;\\n for(int j=0;j<n;j++){\\n if(i==j) continue;\\n if(s[j].find(s[i])!=string::npos) ok = true;\\n }\\n if(ok){\\n bit |= 1<<i;\\n cnt++;\\n }\\n }\\n memset(memo, -1, sizeof(memo));\\n cout << dp(bit, n, cnt) << endl;\\n \\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 4980,\n \"score_of_the_acc\": -0.0223,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1320_8474991\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG\\n#pragma GCC optimize(\\\"O2,no-stack-protector,unroll-loops,fast-math\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < int(n); i++)\\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\\n#define each(e, v) for (auto& e : v)\\n#define MM << \\\" \\\" <<\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\\n int n = v.size();\\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (v.empty()) cout << '\\\\n';\\n}\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\ntemplate <typename T> bool chmax(T& x, const T& y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\ntemplate <typename T> bool chmin(T& x, const T& y) {\\n return (x > y) ? (x = y, true) : false;\\n}\\ntemplate <class T>\\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T> using maxheap = std::priority_queue<T>;\\ntemplate <typename T> int lb(const vector<T>& v, T x) {\\n return lower_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> int ub(const vector<T>& v, T x) {\\n return upper_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> void rearrange(vector<T>& v) {\\n sort(begin(v), end(v));\\n v.erase(unique(begin(v), end(v)), end(v));\\n}\\n\\n// __int128_t gcd(__int128_t a, __int128_t b) {\\n// if (a == 0)\\n// return b;\\n// if (b == 0)\\n// return a;\\n// __int128_t cnt = a % b;\\n// while (cnt != 0) {\\n// a = b;\\n// b = cnt;\\n// cnt = a % b;\\n// }\\n// return b;\\n// }\\n\\nstruct Union_Find_Tree {\\n vector<int> data;\\n const int n;\\n int cnt;\\n \\n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\\n \\n int root(int x) {\\n if (data[x] < 0) return x;\\n return data[x] = root(data[x]);\\n }\\n \\n int operator[](int i) { return root(i); }\\n \\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n if (data[x] > data[y]) swap(x, y);\\n data[x] += data[y], data[y] = x;\\n cnt--;\\n return true;\\n }\\n \\n int size(int x) { return -data[root(x)]; }\\n \\n int count() { return cnt; };\\n \\n bool same(int x, int y) { return root(x) == root(y); }\\n \\n void clear() {\\n cnt = n;\\n fill(begin(data), end(data), -1);\\n }\\n};\\n\\ntemplate <int mod> struct Mod_Int {\\n int x;\\n\\n Mod_Int() : x(0) {}\\n\\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n static int get_mod() { return mod; }\\n\\n Mod_Int& operator+=(const Mod_Int& p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator-=(const Mod_Int& p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator*=(const Mod_Int& p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n Mod_Int& operator/=(const Mod_Int& p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n Mod_Int& operator++() { return *this += Mod_Int(1); }\\n\\n Mod_Int operator++(int) {\\n Mod_Int tmp = *this;\\n ++*this;\\n return tmp;\\n }\\n\\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\\n\\n Mod_Int operator--(int) {\\n Mod_Int tmp = *this;\\n --*this;\\n return tmp;\\n }\\n\\n Mod_Int operator-() const { return Mod_Int(-x); }\\n\\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\\n\\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\\n\\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\\n\\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\\n\\n bool operator==(const Mod_Int& p) const { return x == p.x; }\\n\\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\\n\\n Mod_Int inverse() const {\\n assert(*this != Mod_Int(0));\\n return pow(mod - 2);\\n }\\n\\n Mod_Int pow(long long k) const {\\n Mod_Int now = *this, ret = 1;\\n for (; k > 0; k >>= 1, now *= now) {\\n if (k & 1) ret *= now;\\n }\\n return ret;\\n }\\n\\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\\n return os << p.x;\\n }\\n\\n friend istream& operator>>(istream& is, Mod_Int& p) {\\n long long a;\\n is >> a;\\n p = Mod_Int<mod>(a);\\n return is;\\n }\\n};\\n\\nll mpow2(ll x, ll n, ll mod) {\\n ll ans = 1;\\n x %= mod;\\n while (n != 0) {\\n if (n & 1) ans = ans * x % mod;\\n x = x * x % mod;\\n n = n >> 1;\\n }\\n ans %= mod;\\n return ans;\\n}\\n\\ntemplate <typename T> T modinv(T a, const T& m) {\\n T b = m, u = 1, v = 0;\\n while (b > 0) {\\n T t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return u >= 0 ? u % m : (m - (-u) % m) % m;\\n}\\n\\nll divide_int(ll a, ll b) {\\n if (b < 0) a = -a, b = -b;\\n return (a >= 0 ? a / b : (a - b + 1) / b);\\n}\\n\\n// const int MOD = 1000000007;\\nconst int MOD = 998244353;\\nusing mint = Mod_Int<MOD>;\\n\\n// ----- library -------\\n// ----- library -------\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (1) {\\n int n;\\n cin >> n;\\n if (!n)\\n break;\\n vector<string> s(n);\\n rep(i, n) cin >> s[i];\\n vector<vector<int>> c(n, vector<int>(n));\\n rep(i, n) rep(j, n) {\\n int li = sz(s[i]), lj = sz(s[j]);\\n c[i][j] = lj;\\n rep(k, li) {\\n bool ok = true;\\n int val = lj;\\n rep(l, min(lj, li - k)) {\\n if (s[i][k + l] != s[j][l]) {\\n ok = false;\\n break;\\n }\\n val--;\\n }\\n if (ok)\\n chmin(c[i][j], val);\\n }\\n }\\n vector<vector<int>> dp(1 << n, vector<int>(n, 1e9));\\n rep(i, n) dp[1 << i][i] = sz(s[i]);\\n rep(t, 1 << n) rep(i, n) rep(j, n) {\\n if (t >> j & 1)\\n continue;\\n chmin(dp[t | (1 << j)][c[i][j] == 0 ? i : j], dp[t][i] + c[i][j]);\\n }\\n cout << *min_element(all(dp[(1 << n) - 1])) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 4748,\n \"score_of_the_acc\": -0.0367,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1320_8331841\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nint calc_extra(const string& S, const string& T) {\\n\\tint ans = T.size();\\n\\tfor (int i = 1; i <= S.size() && i <= T.size(); i++) {\\n\\t\\tif (S.substr(S.size() - i) == T.substr(0, i)) {\\n\\t\\t\\tans = T.size() - i;\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint solve_sequence(int N, const vector<string>& S) {\\n\\tvector<vector<int> > extras(N, vector<int>(N));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\textras[i][j] = calc_extra(S[i], S[j]);\\n\\t\\t}\\n\\t}\\n\\tvector<vector<int> > dp(1 << N, vector<int>(N, INF));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tdp[1 << i][i] = S[i].size();\\n\\t}\\n\\tfor (int i = 1; i < (1 << N); i++) {\\n\\t\\tif ((i & (i - 1)) == 0) {\\n\\t\\t\\tcontinue; // i = 2^k\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\tint sub = i - (1 << j);\\n\\t\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\t\\tif ((sub >> k) & 1) {\\n\\t\\t\\t\\t\\t\\tdp[i][j] = min(dp[i][j], dp[sub][k] + extras[k][j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = *min_element(dp[(1 << N) - 1].begin(), dp[(1 << N) - 1].end());\\n\\treturn ans;\\n}\\n\\nint solve(int N, const vector<string>& S) {\\n\\tvector<string> T;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tbool flag = true;\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif ((S[j] == S[i] && j < i) || (S[j] != S[i] && S[j].find(S[i]) != string::npos)) {\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tT.push_back(S[i]);\\n\\t\\t}\\n\\t}\\n\\treturn solve_sequence(T.size(), T);\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N;\\n\\t\\tcin >> N;\\n\\t\\tif (N == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<string> S(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> S[i];\\n\\t\\t}\\n\\t\\tint ans = solve(N, S);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4528,\n \"score_of_the_acc\": -0.0086,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1320_6775480\",\n \"code_snippet\": \"// I SELL YOU...! \\n#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<functional>\\n#include<queue>\\n#include<chrono>\\n#include<iomanip>\\n#include<map>\\n#include<set>\\n#include<bitset>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nusing TP = tuple<ll,ll,ll>;\\nvoid init_io(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n}\\nconst ll INF = 1e15;\\nll calc_dp(ll s, ll i, const vector<vector<ll>> &pat, vector<vector<ll>> &dp) {\\n ll n = pat.size();\\n ll k = 0;\\n if (dp[s][i] != -1) return dp[s][i];\\n for (int i=0;i<n;i++) {\\n if ((1ll << i) & s) k++;\\n }\\n if (k==1) {\\n return dp[s][i] = pat[i][i];\\n }\\n ll prev_s = s ^ (1ll << i);\\n ll res = INF;\\n for (int j=0;j<n;j++) {\\n if (i==j || ((prev_s & (1ll << j)) == 0)) continue;\\n res = min(res, calc_dp(prev_s, j, pat, dp) + pat[i][i] - pat[j][i]);\\n }\\n // cout << bitset<14>(s) <<\\\" \\\"<<i <<\\\" \\\"<<res << endl;\\n return dp[s][i] = res;\\n};\\n\\nll max_match(const string &s, const string &t) {\\n ll n = s.size(), m = t.size();\\n ll res = 0;\\n for (int i=1;i<=min(n, m);i++) {\\n bool can = true;\\n for (int j=0;j<i;j++) {\\n if (s[(n-i)+j] != t[j]) {\\n can = false;\\n break;\\n }\\n }\\n if (can) {\\n res = i;\\n }\\n }\\n return res;\\n};\\nvoid solve() {\\n ll n;\\n cin >> n;\\n if (n==0) return;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) {\\n cin >> s[i];\\n }\\n for (auto itr=s.begin();itr!=s.end();) {\\n ll c = 0;\\n for (auto t: s) {\\n if (t == *itr) {\\n if (c==0) {\\n c++;\\n continue;\\n }\\n }\\n if (t.find(*itr) != string::npos) {\\n c = -1;\\n break;\\n }\\n }\\n if (c==-1) {\\n itr = s.erase(itr);\\n } else {\\n itr++;\\n }\\n }\\n n = s.size();\\n vector<vector<ll>> dp((1ll<<n), vector<ll>(n, -1));\\n vector<vector<ll>> pat(n, vector<ll>(n, 0));\\n for (int i=0;i<n;i++) {\\n for (int j=0;j<n;j++) {\\n if (i==j) {\\n pat[i][i] = s[i].size();\\n } else {\\n pat[i][j] = max_match(s[i], s[j]);\\n }\\n }\\n }\\n ll ans = 1e15;\\n for (int i=0;i<n;i++) {\\n ans = min(ans, calc_dp((1ll<<n) -1, i,pat, dp));\\n }\\n cout << ans << endl;\\n solve();\\n}\\nsigned main(){\\n init_io();\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 101052,\n \"score_of_the_acc\": -1.0258,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1320_6754394\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <chrono>\\n#include <thread>\\n////#include <atcoder/all>\\n\\n//using namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\ntemplate<class T>\\nbool chmax(T& p, T q) {\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\n\\nll Eulers_phi(ll n) {\\n ll res = 0;\\n ll N = n;\\n vll P;\\n for (ll p = 2; p * p <= N; p++) {\\n if (N % p == 0) {\\n P.push_back(p);\\n while (N % p == 0)N /= p;\\n }\\n }\\n if (N != 1)P.push_back(N);\\n\\n N = P.size();\\n rep(bit, (1 << N)) {\\n ll k = 1;\\n ll t = 0;\\n rep(i, N) {\\n if (bit & (1 << i)) {\\n k *= P[i];\\n t++;\\n }\\n }\\n res += (t % 2 == 0 ? 1 : -1) * n / k;\\n }\\n return res;\\n\\n}\\n\\nmap<string, ll> M;\\n\\nbool OK = 1;\\nll dfs(string S) {\\n ll res = 0;\\n ll N = S.size();\\n rep(i, N) {\\n ll d = 0;\\n ll R = i;\\n if (S[i] <= 'Z' && S[i] >= 'A') {\\n string G = \\\"\\\";\\n if (S.size() > 1 && (S[i + 1] <= 'z' && S[i + 1] > 'a')) {\\n G = S.substr(i, 2);\\n R = i + 1;\\n }\\n else {\\n G = S.substr(i, 1);\\n R = i;\\n }\\n if (!M.count(G)) {\\n OK = 0;\\n return res;\\n }\\n d = M[G];\\n }\\n else if (S[i] == '(') {\\n ll L = i;\\n ll k = 0;\\n for (ll j = i; j < N; j++) {\\n if (S[j] == '(')k++;\\n else if (S[j] == ')') {\\n k--;\\n if (k == 0) {\\n d = dfs(S.substr(L + 1, j - L - 1));\\n R = j;\\n break;\\n }\\n }\\n }\\n }\\n else continue;\\n ll b = 1;\\n if (S.size() > R + 1) {\\n if ('0' <= S[R + 1] && S[R + 1] <= '9') {\\n b = S[R + 1] - '0';\\n R++;\\n if (S.size() > R + 1) {\\n if ('0' <= S[R + 1] && S[R + 1] <= '9') {\\n b = b * 10 + S[R + 1] - '0';\\n R++;\\n }\\n }\\n }\\n }\\n res += d * b;\\n i = R;\\n }\\n\\n\\n return res;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n\\n while (1) {\\n ll N;\\n cin >> N;\\n if (N == 0)return 0;\\n vector<string> S(N);\\n rep(i, N)cin >> S[i];\\n vector<bool> D(N, 1);\\n rep(i, N) {\\n rep(j, N) {\\n if (i == j)continue;\\n for (ll k = 0; k < ll(S[j].size()) - ll(S[i].size())+1; k++) {\\n if (S[j].substr(k, S[i].size()) == S[i]) {\\n D[i] = 0;\\n }\\n }\\n }\\n }\\n vector<string> T;\\n rep(i, N) {\\n if (D[i])T.push_back(S[i]);\\n }\\n N = T.size();\\n S = T;\\n vvll DP((1 << N), vll(N, 1e18));\\n rep(i, N) {\\n DP[(1 << i)][i] = T[i].size();\\n }\\n\\n vvll Z(N, vll(N,0));\\n rep(i, N)rep(j, N) {\\n rep(k, S[j].size()) {\\n if (k == 0)continue;\\n if (S[i].size()<k)break;\\n string P = S[i].substr(S[i].size() - k, k);\\n string Q = S[j].substr(0, k);\\n if (P == Q) {\\n Z[i][j] = k;\\n }\\n }\\n }\\n rep(bit, (1 << N)) {\\n if (bit == 0)continue;\\n rep(j, N) {\\n if (!(bit & (1 << j)))continue;\\n rep(n, N) {\\n if (bit & (1 << n))continue;\\n chmin(DP[bit + (1 << n)][n], DP[bit][j]+ll(T[n].size()) - Z[j][n]);\\n }\\n }\\n }\\n ll an = 1e18;\\n rep(i, N)chmin(an, DP[(1 << N) - 1][i]);\\n cout << an << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 5812,\n \"score_of_the_acc\": -0.0218,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1320_6710683\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <cstddef>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.first >> pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T, T init>\\nauto make_vector(int n) {\\n return std::vector<T>(n, init);\\n}\\n\\ntemplate <class T, T init, typename Head, typename... Tail>\\nauto make_vector(Head n, Tail... ts) {\\n return std::vector(n, make_vector<T, init>(ts...));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n int n;\\n while (std::cin >> n, n != 0) {\\n std::vector<std::string> s(n);\\n std::cin >> s;\\n {\\n std::vector<std::string> cp;\\n rep(i, 0, n) {\\n bool flag = false;\\n rep(j, 0, n) {\\n if (flag) break;\\n if (i == j) continue;\\n int isz = s[i].size();\\n int jsz = s[j].size();\\n if (isz >= jsz) continue;\\n rep(k, 0, jsz) {\\n if (k + isz > jsz) break;\\n if (s[j].substr(k, isz) == s[i]) {\\n flag = true;\\n break;\\n }\\n }\\n }\\n if (flag) continue;\\n cp.emplace_back(s[i]);\\n }\\n s = cp;\\n }\\n n = s.size();\\n std::vector dp(1 << n, std::vector<int>(n, INF));\\n std::vector duplicates(n, std::vector<int>(n, 0));\\n rep(i,0,n) rep(j,0,n) {\\n int isz = s[i].size();\\n int jsz = s[j].size();\\n rep(k,0,isz) {\\n bool flag = true;\\n rep(l,0,isz-k) {\\n if(l >= jsz || s[i][k+l] != s[j][l]) {\\n flag = false;\\n break;\\n }\\n }\\n if(flag) {\\n duplicates[i][j] = isz - k;\\n break;\\n }\\n }\\n }\\n auto f = [&](auto &&self, int bit, int back) -> int {\\n if(dp[bit][back] != INF) return dp[bit][back];\\n if(bit == (1<<back)) return dp[bit][back] = s[back].size();\\n int prev = bit ^ (1<<back);\\n rep(i,0,n) if((prev >> i) & 1) {\\n chmin(dp[bit][back], self(self, prev, i) + (int)s[back].size() - duplicates[i][back]);\\n }\\n return dp[bit][back];\\n };\\n int ans = INF;\\n rep(i, 0, n) chmin(ans, f(f, (1 << n) - 1, i));\\n std::cout << ans << '\\\\n';\\n }\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 4792,\n \"score_of_the_acc\": -0.0234,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1320_6706859\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nint solve2(V<string>& T) {\\n const int INF = 1 << 30;\\n int N = T.size();\\n int N2 = 1 << N;\\n V<V<int>> cost(N, V<int>(N, INF));\\n rep(las, N) {\\n rep(nex, N) {\\n if (las == nex) continue;\\n int l2 = T[nex].size();\\n for (int sz = l2 - 1; sz >= 0; sz--) {\\n // S[nex].substr(0, sz)\\n if (T[las].size() < sz) continue;\\n if (T[las].substr(T[las].size() - sz) == T[nex].substr(0, sz)) {\\n cost[las][nex] = l2 - sz;\\n break;\\n }\\n }\\n }\\n }\\n V<V<int>> dp(N2, V<int>(N, INF));\\n rep(i, N) dp[1 << i][i] = T[i].size();\\n for (int s = 1; s < N2; s++) {\\n for (int las = 0; las < N; las++) {\\n if ((s >> las & 1) == 0) continue;\\n if (dp[s][las] == INF) continue;\\n for (int nex = 0; nex < N; nex++) {\\n if (s >> nex & 1) continue;\\n dp[s | (1 << nex)][nex] = min(dp[s | (1 << nex)][nex], dp[s][las] + cost[las][nex]);\\n }\\n }\\n }\\n int ans = *min_element(dp[N2 - 1].begin(), dp[N2 - 1].end());\\n return ans;\\n}\\n\\nvoid solve(int N) {\\n V<string> S(N);\\n rep(i, N) cin >> S[i];\\n V<int> cont(N, 0);\\n rep(i, N) {\\n // check S[i] in S[j]\\n int lsi = S[i].size();\\n rep(j, N) {\\n if (i == j) continue;\\n int lsj = S[j].size();\\n if (lsi > lsj) continue;\\n rep(k, lsj - lsi + 1) {\\n if (S[i] == S[j].substr(k, lsi)) {\\n cont[i] = 1;\\n break;\\n }\\n }\\n if (cont[i]) break;\\n }\\n }\\n V<string> T;\\n rep(i, N) if (cont[i] == 0) T.push_back(S[i]);\\n cout << solve2(T) << '\\\\n';\\n return;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N != 0) solve(N);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.0045,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1320_6706850\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nint solve2(V<string>& T) {\\n const int INF = 1 << 30;\\n int N = T.size();\\n int N2 = 1 << N;\\n V<V<int>> dp(N2, V<int>(N, INF));\\n rep(i, N) dp[1 << i][i] = T[i].size();\\n for (int s = 1; s < N2; s++) {\\n for (int las = 0; las < N; las++) {\\n if ((s >> las & 1) == 0) continue;\\n if (dp[s][las] == INF) continue;\\n for (int nex = 0; nex < N; nex++) {\\n if (s >> nex & 1) continue;\\n int l2 = T[nex].size();\\n for (int sz = l2 - 1; sz >= 0; sz--) {\\n // S[nex].substr(0, sz)\\n if (T[las].size() < sz) continue;\\n if (T[las].substr(T[las].size() - sz) == T[nex].substr(0, sz)) {\\n dp[s | (1 << nex)][nex] = min(dp[s | (1 << nex)][nex], dp[s][las] + l2 - sz);\\n break;\\n }\\n }\\n }\\n }\\n }\\n int ans = *min_element(dp[N2 - 1].begin(), dp[N2 - 1].end());\\n return ans;\\n}\\n\\nvoid solve(int N) {\\n V<string> S(N);\\n rep(i, N) cin >> S[i];\\n V<int> cont(N, 0);\\n rep(i, N) {\\n // check S[i] in S[j]\\n int lsi = S[i].size();\\n rep(j, N) {\\n if (i == j) continue;\\n int lsj = S[j].size();\\n if (lsi > lsj) continue;\\n rep(k, lsj - lsi + 1) {\\n if (S[i] == S[j].substr(k, lsi)) {\\n cont[i] = 1;\\n break;\\n }\\n }\\n if (cont[i]) break;\\n }\\n }\\n show(cont);\\n V<string> T;\\n rep(i, N) if (cont[i] == 0) T.push_back(S[i]);\\n cout << solve2(T) << '\\\\n';\\n return;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N != 0) solve(N);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6730,\n \"memory_kb\": 4676,\n \"score_of_the_acc\": -1.0055,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1320_6179467\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(void){\\n while(1){\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n vector<string> S(n);\\n for(int i = 0; i < n; i++) cin >> S[i];\\n vector<string> T;\\n for(int i = 0; i < n; i++){\\n bool ok = true;\\n for(int j = 0; j < n; j++){\\n if(i == j) continue;\\n int found = S[j].find(S[i]);\\n if(found != string::npos){\\n ok = false;\\n break;\\n }\\n }\\n if(ok) T.push_back(S[i]);\\n }\\n S = T;\\n n = S.size();\\n vector<vector<int>> common(n, vector<int>(n, 0));\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++){\\n if(i == j) continue;\\n int li = S[i].size();\\n int lj = S[j].size();\\n int mi = min(li, lj);\\n for(int k = 1; k < mi; k++){\\n bool ok = true;\\n for(int l = 0; l < k; l++){\\n if(S[i][li - k + l] != S[j][l]){\\n ok = false;\\n break;\\n }\\n }\\n if(ok) common[i][j] = k;\\n }\\n }\\n }\\n vector<vector<int>> dp(1 << n, vector<int>(n, 0));\\n for(int bit = 0; bit < (1 << n); bit++){\\n for(int j = 0; j < n; j++){\\n if(bit >> j & 1){\\n for(int k = 0; k < n; k++){\\n if(j != k && (bit >> k & 1)){\\n dp[bit][j] = max(dp[bit][j], dp[bit ^ (1 << j)][k] + common[j][k]);\\n }\\n }\\n }\\n }\\n }\\n int ans = 0;\\n for(auto s: S) ans += s.size();\\n int max_ = 0;\\n for(int i = 0; i < n; i++) max_ = max(max_, dp[(1 << n) - 1][i]);\\n cout << ans - max_ << \\\"\\\\n\\\";\\n \\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 4764,\n \"score_of_the_acc\": -0.0156,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1320_6000659\",\n \"code_snippet\": \"#define rep(i, n) for(int i=0; i<(n); ++i)\\n#define rrep(i, n) for(int i=(n-1); i>=0; --i)\\n#define rep2(i, s, n) for(int i=s; i<(n); ++i)\\n#define ALL(v) (v).begin(), (v).end()\\n#define memr(dp, val) memset(dp, val, sizeof(dp))\\n#define fi first\\n#define se second\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T>\\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\\ntypedef long long ll;\\nconst int INTINF = INT_MAX >> 1;\\nstatic const ll LLINF = (LLONG_MAX >> 1);\\n\\nint n;\\nstring s[15];\\nstring ss[15]; // 包含しているsを除いた入力\\nint dp[1 << 15][15][15];\\n\\nbool a_has_b(string a, string b){\\n\\tif(a.size() < b.size()) return false;\\n\\n\\trep(i, a.size()){\\n\\t\\tif(i + b.size() - 1 >= a.size()) break;\\n\\t\\tbool ok = true;\\n\\t\\trep(j, b.size()){\\n\\t\\t\\tif(a[i+j] != b[j]) ok = false;\\n\\t\\t}\\n\\t\\tif(ok) return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nbool input(){\\n\\n\\tcin >> n;\\n\\tif(!n) return false;\\n\\trep(i, n) cin >> s[i];\\n\\n\\tbool inclusions[15];\\n\\tmemr(inclusions, 0);\\n\\trep(i, n){\\n\\t\\trep2(j, i+1, n){\\n\\t\\t\\tif(a_has_b(s[i], s[j])) inclusions[j] = true; \\n\\t\\t\\tif(a_has_b(s[j], s[i])) inclusions[i] = true; \\n\\t\\t}\\n\\t}\\n\\n\\tss[0] = \\\"\\\";\\n\\tint cnt = 1;\\n\\trep(i, n){\\n\\t\\tif(!inclusions[i]){\\n\\t\\t\\tss[cnt] = s[i];\\n\\t\\t\\tcnt++;\\n\\t\\t}\\n\\t}\\n\\n\\tn = cnt - 1;\\n\\n\\treturn true;\\n}\\n\\nint cost[15][15];\\n\\nint calc(string a, string b){\\n\\tint ret = 0;\\n\\trep(i, a.size()){\\n\\t\\tint cnt = 0;\\n\\t\\trep(j, b.size()){\\n\\t\\t\\tif(i + j >= a.size()) break;\\n\\t\\t\\tif(a[i+j] == b[j]) {\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tcnt = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tchmax(ret, cnt);\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main(){\\n std::cout << std::fixed << std::setprecision(15);\\n\\n\\twhile(input()){\\n\\t\\trep(i, 1 << n) rep(j, 15) rep(k, 15) dp[i][j][k] = INTINF;\\n\\n\\t\\trep(i, 15) rep(j, 15) cost[i][j] = INTINF;\\n\\t\\trep(i, n+1){\\n\\t\\t\\trep(j, n+1){\\n\\t\\t\\t\\tchmin(cost[i][j], calc(ss[i], ss[j]));\\n\\t\\t\\t\\tchmin(cost[j][i], calc(ss[j], ss[i]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tqueue<tuple<int, int, int> > q;\\n\\t\\tq.push({0, 0, 0});\\n\\t\\tdp[0][0][0] = 0;\\n\\n\\t\\twhile(q.size()){\\n\\t\\t\\tint S, front, back;\\n\\t\\t\\tauto f = q.front(); q.pop();\\n\\t\\t\\ttie(S, front, back) = f;\\n\\t\\t\\trep(i, n){\\n\\t\\t\\t\\tif(!(S >> i & 1)){\\n\\t\\t\\t\\t\\tif(dp[S | 1 << i][i+1][back] == INTINF) q.push({S | 1 << i, i + 1, back});\\n\\t\\t\\t\\t\\tif(dp[S | 1 << i][front][i+1] == INTINF) q.push({S | 1 << i, front, i + 1});\\n\\t\\t\\t\\t\\tchmin(dp[S | 1 << i][i+1][back], dp[S][front][back] + int(ss[i+1].size()) - cost[i+1][front]);\\n\\t\\t\\t\\t\\tchmin(dp[S | 1 << i][front][i+1], dp[S][front][back] + int(ss[i+1].size()) - cost[back][i+1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint ans = INTINF;\\n\\t\\trep(i, n+1) rep(j, n+1) {\\n\\t\\t\\tchmin(ans, dp[(1 << n) - 1][i][j]);\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2380,\n \"memory_kb\": 22356,\n \"score_of_the_acc\": -0.5269,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1320_5971021\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\\n#define ft first\\n#define sc second\\n#define pb push_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(),(v).end()\\n#define LB(a,x) lb(all(a),x)-a.begin()\\n#define UB(a,x) ub(all(a),x)-a.begin()\\n#define mod 1000000007\\n//#define mod 998244353\\n#define FS fixed<<setprecision(15)\\nusing namespace std;\\ntypedef long long ll;\\nconst double pi=3.141592653589793;\\ntemplate<class T> using V=vector<T>;\\nusing P=pair<int,int>;\\ntypedef unsigned long long ull;\\ntypedef long double ldouble;\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline void out(T a){ cout << a << '\\\\n'; }\\nvoid YN(bool ok){if(ok) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\n//void YN(bool ok){if(ok) cout << \\\"YES\\\" << endl; else cout << \\\"NO\\\" << endl;}\\n\\n\\nconst ll INF=1e18;\\nconst int mx=200005;\\n\\nint dp[(1<<14)+10][20];\\n\\nint main(){\\n //オーバーフローは大丈夫ですか？？\\n cin.tie(0);ios::sync_with_stdio(false);\\n int cnt=0;\\n while(true){\\n cnt++;\\n int n;\\n cin>>n;\\n if(n==0) break;\\n V<string> s(n);\\n cinf(n,s);\\n \\n int MX=1000000;\\n V<int> lst((1<<n),-1);\\n V<V<int>> cost(n,V<int>(n,MX));\\n rep(i,n){\\n int bit=(1<<i);\\n for(int j=0;j<n;j++){\\n if(j==i) continue;\\n bool ok=0;\\n rep(L,s[i].size()){\\n for(int R=L;R<s[i].size();R++){\\n if(s[i].substr(L,R-L+1)==s[j]){\\n ok=1;\\n }\\n }\\n }\\n if(ok) cost[i][j]=0;\\n }\\n \\n }\\n rep(i,n){\\n rep(j,n){\\n if(i==j) cost[i][j]=0;\\n else{\\n chmin(cost[i][j],(int)s[j].size());\\n rep(k,s[i].size()){\\n int len=s[i].size()-k;\\n if(len>s[j].size()) continue;\\n if(s[i].substr(k,len)==s[j].substr(0,len)){\\n chmin(cost[i][j],(int)s[j].size()-len);\\n }\\n }\\n }\\n }\\n }\\n rep(i,(1<<n))rep(j,n)dp[i][j]=MX;\\n rep(i,n){\\n dp[(1<<i)][i]=s[i].size();\\n }\\n rep(i,(1<<n)){\\n rep(j,n){\\n if(dp[i][j]==MX||!(i>>j&1)) continue;\\n rep(k,n){\\n if(i>>k&1) continue;\\n int to=i|(1<<k);\\n \\n if(cost[j][k]==0) chmin(dp[to][j],dp[i][j]);\\n else chmin(dp[to][k],dp[i][j]+cost[j][k]);\\n }\\n }\\n }\\n int ans=MX;\\n rep(i,n) chmin(ans,dp[(1<<n)-1][i]);\\n out(ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 4792,\n \"score_of_the_acc\": -0.031,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1320_5962479\",\n \"code_snippet\": \"// #include \\\"atcoder/all\\\"\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nconstexpr ll INF = 1e15;\\nconstexpr ll LLMAX = 9223372036854775807;\\nconstexpr int inf = 1e9;\\n// constexpr ll mod = 1000000007;\\nconstexpr ll mod = 998244353;\\n// 右下左上\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define eol \\\"\\\\n\\\"\\n// ---------------------------------------------------------------------------\\n\\nbool solve(){\\n int N;\\n cin >> N;\\n if(N == 0) return false;\\n vector<string> S(N);\\n for(int i=0; i<N; i++){\\n cin >> S[i];\\n }\\n vector<int> lost(N,false);\\n for(int i=0; i<N; i++){\\n for(int j=0; j<N; j++){\\n if(i == j) continue;\\n for(int l=0; l<S[j].size(); l++){\\n if(l+S[i].size() > S[j].size()) continue;\\n if(S[i] == S[j].substr(l,S[i].size())){\\n lost[i] = true;\\n }\\n }\\n }\\n }\\n int cnt = 0;\\n map<int,int> pos;\\n for(int i=0; i<N; i++){\\n if(lost[i]) continue;\\n pos[cnt] = i;\\n cnt++;\\n }\\n vector<vector<int>> dist(cnt,vector<int>(cnt));\\n for(int i=0; i<cnt; i++){\\n for(int j=0; j<cnt; j++){\\n string s = S[pos[i]];\\n string t = S[pos[j]];\\n int mx = 0;\\n for(int l=0; l<s.size(); l++){\\n int len = s.size()-l;\\n if(s.substr(l) == t.substr(0,len)){\\n mx = len;\\n break;\\n }\\n }\\n dist[i][j] = t.size()-mx;\\n }\\n }\\n vector<vector<int>> dp(cnt,vector<int>((1LL<<cnt),inf));\\n for(int i=0; i<cnt; i++){\\n dp[i][(1LL<<i)] = S[pos[i]].size();\\n }\\n for(int bit=0; bit<(1LL<<cnt); bit++){\\n for(int i=0; i<cnt; i++){\\n if(!(bit & (1LL<<i))) continue;\\n for(int nxt=0; nxt<cnt; nxt++){\\n if(bit & (1LL<<nxt)) continue;\\n if(chmin(dp[nxt][bit+(1LL<<nxt)],dp[i][bit]+dist[i][nxt]));\\n }\\n }\\n }\\n int ans = inf;\\n for(int i=0; i<cnt; i++){\\n chmin(ans, dp[i][(1LL<<cnt)-1]);\\n }\\n // for(int i=0; i<cnt; i++){\\n // for(int j=0; j<cnt ;j++){\\n // cout << dist[i][j] << \\\" \\\\n\\\"[j+1==cnt];\\n // }\\n // }\\n cout << ans << endl;\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -0.0015,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1320_5950425\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if(n == 0) {\\n return 0;\\n }\\n vector<string>S(n);\\n for(int i = 0; i < n; i++) {\\n cin >> S[i];\\n }\\n vector<string>T;\\n for(int i = 0; i < n; i++) {\\n bool flag = true;\\n for(int j = 0; j < n; j++) {\\n if(i == j || S[i].size() >= S[j].size()) {\\n continue;\\n }\\n for(int k = 0; k < S[j].size()-S[i].size()+1; k++) {\\n if(S[i] == S[j].substr(k,S[i].size())) {\\n flag = false;\\n }\\n }\\n }\\n if(flag) {\\n T.push_back(S[i]);\\n }\\n }\\n vector<vector<int>>tmp(T.size(),vector<int>(T.size()));\\n vector<vector<int>>dp(1 << T.size(),vector<int>(T.size(),1001001001));\\n for(int i = 0; i < T.size(); i++) {\\n dp[(1 << i)][i] = T[i].size();\\n for(int j = 0; j < T.size(); j++) {\\n for(int k = 0; k < min(T[i].size(),T[j].size()); k++) {\\n if(T[i].substr(T[i].size()-k,k) == T[j].substr(0,k)) {\\n tmp[i][j] = T[j].size()-k;\\n }\\n }\\n }\\n }\\n for(int i = 0; i < (1 << T.size()); i++) {\\n for(int j = 0; j < T.size(); j++) {\\n for(int k = 0; k < T.size(); k++) {\\n if(!(1 & (i >> k))) {\\n dp[i|(1 << k)][k] = min(dp[i|(1 << k)][k],dp[i][j]+tmp[j][k]);\\n }\\n }\\n }\\n }\\n cout << *min_element(dp[(1 << T.size())-1].begin(),dp[(1 << T.size())-1].end()) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4848,\n \"score_of_the_acc\": -0.0119,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":771,"cells":{"group_id":{"kind":"string","value":"aoj_1312_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nWhere's Wally\nDo you know the famous series of children's books named \"Where's Wally\"? Each of the books contains a variety of pictures of hundreds of people. Readers are challenged to find a person called Wally in the crowd.\nWe can consider \"Where's Wally\" as a kind of pattern matching of two-dimensional graphical images. Wally's figure is to be looked for in the picture. It would be interesting to write a computer program to solve \"Where's Wally\", but this is not an easy task since Wally in the pictures may be slightly different in his appearances. We give up the idea, and make the problem much easier to solve. You are requested to solve an easier version of the graphical pattern matching problem.\nAn image and a pattern are given. Both are rectangular matrices of bits (in fact, the pattern is always square-shaped). 0 means white, and 1 black. The problem here is to count the number of occurrences of the pattern in the image, i.e. the number of squares in the image exactly matching the pattern. Patterns appearing rotated by any multiples of 90 degrees and/or turned over forming a mirror image should also be taken into account.\nInput\nThe input is a sequence of datasets each in the following format.\nw h p\nimage data\npattern data\nThe first line of a dataset consists of three positive integers\nw\n,\nh\nand\np\n.\nw\nis the width of the image and\nh\nis the height of the image. Both are counted in numbers of bits.\np\nis the width and height of the pattern. The pattern is always square-shaped. You may assume 1 ≤\nw\n≤ 1000, 1 ≤\nh\n≤ 1000, and 1 ≤\np\n≤ 100.\nThe following\nh\nlines give the image. Each line consists of ⌈\nw\n/6⌉ (which is equal to &⌊(\nw\n+5)/6⌋) characters, and corresponds to a horizontal line of the image. Each of these characters represents six bits on the image line, from left to right, in a variant of the BASE64 encoding format. The encoding rule is given in the following table. The most significant bit of the value in the table corresponds to the leftmost bit in the image. The last character may also represent a few bits beyond the width of the image; these bits should be ignored.\ncharacter\nvalue (six bits)\nA-Z\n0-25\na-z\n26-51\n0-9\n52-61\n+\n62\n/\n63\nThe last p lines give the pattern. Each line consists of ⌈\np\n/6⌉ characters, and is encoded in the same way as the image.\nA line containing three zeros indicates the end of the input. The total size of the input does not\nexceed two megabytes.\nOutput\nFor each dataset in the input, one line containing the number of matched squares in the image should be output. An output line should not contain extra characters.\nTwo or more matching squares may be mutually overlapping. In such a case, they are counted separately. On the other hand, a single square is never counted twice or more, even if it matches both the original pattern and its rotation, for example.\nSample Input\n48 3 3\ngAY4I4wA\ngIIgIIgg\nw4IAYAg4\ng\ng\nw\n153 3 3\nkkkkkkkkkkkkkkkkkkkkkkkkkg\nSSSSSSSSSSSSSSSSSSSSSSSSSQ\nJJJJJJJJJJJJJJJJJJJJJJJJJI\ng\nQ\nI\n1\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1312_10849705","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <list>\n#include <cctype>\n#include <functional>\n#include <iterator>\n#include <cstring>\n#include <cmath>\n#include <iostream>\n#include <string>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\nint n, m, p;\nchar code[1010][1010];\nbool ma[1010][1010];\nbool pattern[1010][1010];\n\null ha[1010][1010], tmp[1010][1010];\null mh[1010][1010];\nvoid compute_hash(bool a[1010][1010], int n, int m) {\n const ull B1 = 9983;\n const ull B2 = 100000007;\n ull t1 = 1;\n for (int j = 0; j < p; j++) t1 *= B1;\n\n for (int i = 0; i < n; i++) {\n ull e = 0;\n for (int j = 0; j < p; j++) e = e * B1 + a[i][j];\n\n for (int j = 0; j + p <= m; j++) {\n tmp[i][j] = e;\n if (j + p < m) e = e * B1 - t1 * a[i][j] + a[i][j + p];\n }\n }\n\n ull t2 = 1;\n for (int i = 0; i < p; i++) t2 *= B2;\n\n for (int j = 0; j + p <= m; j++) {\n ull e = 0;\n for (int i = 0; i < p; i++) e = e * B2 + tmp[i][j];\n\n for (int i = 0; i + p <= n; i++) {\n ha[i][j] = e;\n if (i + p < n) e = e * B2 - t2 * tmp[i][j] + tmp[i + p][j];\n }\n }\n \n}\n\nint getbit(char ch) {\n if (ch >= 'A' && ch <= 'Z') return 0 + ch - 'A';\n if (ch >= 'a' && ch <= 'z') return 26 + ch - 'a';\n if (ch >= '0' && ch <= '9') return 52 + ch - '0';\n if (ch == '+') return 62;\n return 63;\n}\n\nvoid decode(bool mat[1010][1010], int h, int w) {\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < (w + 5) / 6; j++) {\n int bit = getbit(code[i][j]);\n for (int k = 0; k < 6; k++) {\n mat[i][j*6+k] = ((bit >> (5 - k)) & 1) == 1;\n }\n }\n }\n}\n\nvoid init() {\n for (int i = 0; i < n; i++) scanf(\"%s\", code[i]);\n // printf(\"text:\\n\");\n // for (int i = 0; i < n; i++) puts(code[i]);\n // printf(\"\\n\");\n decode(ma, n, m);\n // for (int i = 0; i < n; i++) {\n // for (int j = 0; j < m; j++) {\n // printf(\"%d\", ma[i][j]);\n // }\n // printf(\"\\n\");\n // }\n // printf(\"\\n\");\n for (int i = 0; i < p; i++) scanf(\"%s\", code[i]);\n // printf(\"pattern:\\n\");\n // for (int i = 0; i < p; i++) puts(code[i]);\n // printf(\"\\n\");\n \n decode(pattern, p, p);\n // for (int i = 0; i < p; i++) {\n // for (int j = 0; j < p; j++) {\n // printf(\"%d\", pattern[i][j]);\n // }\n // printf(\"\\n\");\n // }\n // printf(\"\\n\");\n}\n\nvoid showp() {\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n printf(\"%d\", pattern[i][j]);\n }\n printf(\"\\n\");\n }\n}\n\nbool tm[1010][1010];\nvoid rotate() {\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n tm[i][j] = pattern[j][p-1-i];\n }\n }\n for (int i = 0; i < p; i++) for (int j = 0; j < p; j++)\n pattern[i][j] = tm[i][j];\n}\n\nvoid mirror() {\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n tm[i][j] = pattern[i][p-1-j];\n }\n }\n for (int i = 0; i < p; i++) for (int j = 0; j < p; j++)\n pattern[i][j] = tm[i][j];\n}\n\n\nset<ull> seen;\n\nvoid solve() {\n seen.clear();\n int ans = 0;\n compute_hash(pattern, p, p);\n ull hp = ha[0][0];\n seen.insert(hp);\n compute_hash(ma, n, m);\n// printf(\"hp:%llu ha[0][0]:%llu\\n\", hp, ha[0][0]);\n for (int i = 0; i + p <= n; i++) {\n for (int j = 0; j + p<= m; j++) {\n if (ha[i][j] == hp) ans++;\n mh[i][j] = ha[i][j];\n }\n }\n// printf(\"ans = %d\\n\", ans);\n for (int k = 0; k < 7; k++) {\n if (k == 3) mirror();\n else rotate();\n compute_hash(pattern, p, p);\n hp = ha[0][0];\n// printf(\"hash: %llu\\n\", hp);\n if (seen.find(hp) != seen.end()) continue;\n// showp();\n\n seen.insert(hp);\n for (int i = 0; i + p <= n; i++) {\n for (int j = 0; j + p <= m; j++) {\n if (mh[i][j] == hp) ans++;\n }\n }\n }\n printf(\"%d\\n\", ans);\n}\n\nint main() {\n for (;;) {\n scanf(\"%d%d%d\", &m, &n, &p);\n if (n == 0 && m == 0 && p == 0) break;\n init();\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":30436,"score_of_the_acc":-1,"final_rank":11},{"submission_id":"aoj_1312_9733154","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nnamespace Random {\nmt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\nusing u64 = unsigned long long;\nu64 get() {\n return randgen();\n}\ntemplate <typename T> T get(T L) { // [0,L]\n\n return get() % (L + 1);\n}\ntemplate <typename T> T get(T L, T R) { // [L,R]\n\n return get(R - L) + L;\n}\n}; // namespace Random\n\n/**\n * @brief Random\n */\n\null MOD = 0x1fffffffffffffff;\n\ninline ull mul(ull a, ull b) {\n __uint128_t ans = __uint128_t(a) * b;\n ans = (ans >> 61) + (ans & MOD);\n if (ans >= MOD)\n ans -= MOD;\n return ans;\n}\n\nstatic inline ull genbase() {\n return Random::get(ull(0x1fffffffffffffff));\n}\n\nvector<vector<int>> rot90(vector<vector<int>> A) {\n int N = A.size();\n vector<vector<int>> Ret(N,vector<int>(N));\n rep(i,0,N) {\n rep(j,0,N) {\n Ret[N-1-j][i] = A[i][j];\n }\n }\n return Ret;\n}\n\nvector<vector<int>> Millor(vector<vector<int>> A) {\n int N = A.size();\n vector<vector<int>> Ret(N,vector<int>(N));\n rep(i,0,N) {\n rep(j,0,N) {\n Ret[i][N-1-j] = A[i][j];\n }\n }\n return Ret;\n}\n\n\n\nvoid Solve(int N, int M, int K) {\n int mm = (M+5)/6;\n vector<vector<int>> A(N,vector<int>(mm*6));\n rep(i,0,N) {\n rep(j,0,mm) {\n char C;\n cin >> C;\n int X;\n if ('A' <= C && C <= 'Z') X = C - 'A';\n if ('a' <= C && C <= 'z') X = C - 'a' + 26;\n if (isdigit(C)) X = C - '0' + 52;\n if (C == '+') X = 62;\n if (C == '/') X = 63;\n rep(k,0,6) {\n if (X & (1<<k)) A[i][j*6+5-k] = 1;\n else A[i][j*6+5-k] = 0;\n }\n }\n }\n rep(i,0,N) A[i].resize(M);\n int kk = (K+5)/6;\n vector<vector<int>> B(K,vector<int>(kk*6));\n rep(i,0,K) {\n rep(j,0,kk) {\n char C;\n cin >> C;\n int X;\n if ('A' <= C && C <= 'Z') X = C - 'A';\n if ('a' <= C && C <= 'z') X = C - 'a' + 26;\n if (isdigit(C)) X = C - '0' + 52;\n if (C == '+') X = 62;\n if (C == '/') X = 63;\n rep(k,0,6) {\n if (X & (1<<k)) B[i][j*6+5-k] = 1;\n else B[i][j*6+5-k] = 0;\n }\n }\n }\n rep(i,0,K) B[i].resize(K);\n const ull base[2] = {genbase(), genbase()};\n int L = max(N,max(M,K));\n vector<vector<ull>> power(2,vector<ull>(L+1,0));\n power[0][0] = power[1][0] = 1;\n rep(i,0,2) rep(j,0,L) power[i][j+1] = mul(power[i][j],base[i]);\n vector<vector<ull>> hash(N+1,vector<ull>(M+1,0));\n rep(i,0,N) {\n rep(j,0,M) {\n hash[i+1][j+1] += A[i][j];\n hash[i+1][j+1] += mul(hash[i][j+1], base[0]);\n hash[i+1][j+1] += mul(hash[i+1][j], base[1]);\n hash[i+1][j+1] += MOD - mul(mul(hash[i][j],base[0]),base[1]);\n while(hash[i+1][j+1] >= MOD) hash[i+1][j+1] -= MOD;\n }\n }\n auto get = [&](int l1, int r1, int l2, int r2) -> ull {\n ull Ret = hash[r1][r2];\n Ret += MOD - mul(hash[l1][r2], power[0][r1-l1]);\n Ret += MOD - mul(hash[r1][l2], power[1][r2-l2]);\n Ret += mul(mul(hash[l1][l2],power[0][r1-l1]),power[1][r2-l2]);\n while(Ret >= MOD) Ret -= MOD;\n return Ret;\n };\n map<ull,bool> mp;\n rep(i,0,4) {\n ull X = 0;\n rep(j,0,K) {\n rep(k,0,K) {\n X += mul(mul(B[j][k],power[0][K-1-j]),power[1][K-1-k]);\n while (X >= MOD) X -= MOD;\n }\n }\n mp[X] = true;\n B = rot90(B);\n }\n B = Millor(B);\n rep(i,0,4) {\n ull X = 0;\n rep(j,0,K) {\n rep(k,0,K) {\n X += mul(mul(B[j][k],power[0][K-1-j]),power[1][K-1-k]);\n while (X >= MOD) X -= MOD;\n }\n }\n mp[X] = true;\n B = rot90(B);\n }\n int ANS = 0;\n rep(i,0,N) {\n if (i+K > N) break;\n rep(j,0,M) {\n if (j+K > M) break;\n if (mp.count(get(i,i+K,j,j+K))) ANS++;\n }\n }\n cout << ANS << endl;\n}\n\nint main() {\nwhile(1) {\n int N, M, K;\n cin >> M >> N >> K;\n if (N == 0) return 0;\n Solve(N,M,K);\n}\n}","accuracy":1,"time_ms":310,"memory_kb":15064,"score_of_the_acc":-0.4473,"final_rank":10},{"submission_id":"aoj_1312_8520219","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nusing ull = unsigned long long;\nconst ull mod = (1LL << 61) - 1;\n\nnamespace Hash {\null getmod(ull x) {\n ull ret = (x >> 61) + (x & mod);\n if (ret >= mod) ret -= mod;\n return ret;\n}\n\null mul(ull x, ull y) {\n x = getmod(x), y = getmod(y);\n ull x1 = x >> 31;\n ull x2 = x & ((1LL << 31) - 1);\n ull y1 = y >> 31;\n ull y2 = y & ((1LL << 31) - 1);\n ull z = x1 * y2 + x2 * y1;\n ull z1 = z >> 30;\n ull z2 = z & ((1LL << 30) - 1);\n return getmod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));\n}\n} // namespace Hash\n\n// 0 が含まれないように\ntemplate <typename T>\nstruct RollingHash {\n const int n;\n const ull b; // 基数\n vector<ull> h, p;\n\n // b = 887'446'835'055'281'585\n RollingHash(const T &s, ull b = 887446835055281585) : n(sz(s)), b(b) {\n h.assign(n + 1, 0), p.assign(n + 1, 1);\n rep(i, n) {\n p[i + 1] = Hash::mul(p[i], b);\n h[i + 1] = Hash::mul(h[i], b) + s[i];\n if (h[i + 1] >= mod) h[i + 1] -= mod;\n }\n }\n\n // 文字列の [l,r) の部分のハッシュ値\n ull get_hash(int l, int r) const {\n ull ret = h[r] + mod - Hash::mul(h[l], p[r - l]);\n return ret - (ret >= mod ? mod : 0);\n }\n};\n\nint main() {\n while (1) {\n int w, h, p;\n cin >> w >> h >> p;\n if (!w)\n break;\n vector<string> img(h), pat(p);\n rep(i, h) cin >> img[i];\n rep(i, p) cin >> pat[i];\n vector<vector<int>> vs(h), vt(p);\n auto val = [](char c) {\n if (isupper(c))\n return c - 'A';\n else if (islower(c))\n return c - 'a' + 26;\n else if (isdigit(c))\n return c - '0' + 52;\n else\n return (c == '+' ? 62 : 63);\n };\n rep(i, h) rep(j, sz(img[i])) vs[i].eb(val(img[i][j]));\n rep(i, p) rep(j, sz(pat[i])) vt[i].eb(val(pat[i][j]));\n vector<vector<int>> s(h, vector<int>(w)), t(p, vector<int>(p));\n rep(i, h) rep(j, w) s[i][j] = vs[i][j / 6] >> (5 - j % 6) & 1;\n rep(i, p) rep(j, p) t[i][j] = vt[i][j / 6] >> (5 - j % 6) & 1;\n vector<vector<ull>> hs(w, vector<ull>(h));\n rep(i, h) {\n RollingHash rh(s[i]);\n rep(j, w - p + 1) hs[j][i] = rh.get_hash(j, j + p);\n }\n vector<vector<int>> f(h, vector<int>(w, 0));\n auto rotate = [](vector<vector<int>> t) {\n int n = sz(t);\n vector<vector<int>> ret(n, vector<int>(n));\n rep(i, n) rep(j, n) ret[j][n - 1 - i] = t[i][j];\n return ret;\n };\n auto rev = [](vector<vector<int>> t) {\n int n = sz(t);\n vector<vector<int>> ret(n, vector<int>(n));\n rep(i, n) rep(j, n) ret[i][n - 1 - j] = t[i][j];\n return ret;\n };\n rep(side, 2) {\n rep(rot, 4) {\n vector<int> ct(p * p);\n rep(i, p) rep(j, p) ct[i * p + j] = t[i][j];\n RollingHash rht(ct);\n ull tar = rht.get_hash(0, p * p);\n ull b = 887446835055281585, base = 1;\n rep(t, p) base = Hash::mul(base, b);\n rep(j, w - p + 1) {\n RollingHash rhs(hs[j], base);\n rep(i, h - p + 1) f[i][j] |= rhs.get_hash(i, i + p) == tar;\n }\n t = rotate(t);\n }\n t = rev(t);\n }\n int ans = 0;\n rep(i, h) rep(j, w) ans += f[i][j];\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":940,"memory_kb":20788,"score_of_the_acc":-1.4799,"final_rank":12},{"submission_id":"aoj_1312_8215714","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nvector<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n for (int i = 0; i < used.size(); i++)\n if (used[i] == a)\n return;\n used.push_back(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]], a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]], a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":11960,"score_of_the_acc":-0.2225,"final_rank":7},{"submission_id":"aoj_1312_8215713","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nvector<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n for (int i = 0; i < used.size(); i++)\n if (used[i] == a)\n return;\n used.push_back(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":11972,"score_of_the_acc":-0.2116,"final_rank":6},{"submission_id":"aoj_1312_8116063","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\n\ntypedef unsigned long long ull;\n\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nvector<ull> used;\n\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n a = a * N + pa[i][j];\n }\n }\n for (int i = 0; i < used.size(); i++) {\n if (used[i] == a) {\n return;\n }\n }\n used.push_back(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++) {\n b = b * N + im[j][i];\n g *= N;\n }\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++) {\n n *= N;\n }\n for (int i = 0; i < p; i++) {\n b = b * n + roll[i][j];\n g *= n;\n }\n if (b == a) {\n ans++;\n }\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a) {\n ans++;\n }\n }\n }\n}\n\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n npa[i][j] = pa[j][p - i - 1];\n }\n }\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p; j++) {\n pa[i][j] = npa[i][j];\n }\n }\n}\n\nvoid ch1() {\n for (int i = 0; i < p; i++) {\n for (int j = 0; j < p / 2; j++) {\n swap(pa[i][j], pa[i][p - j - 1]);\n }\n }\n}\n\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++) {\n D[i] = i - 'A';\n }\n for (int i = 'a'; i <= 'z'; i++) {\n D[i] = i - 'a' + 26;\n }\n for (int i = '0'; i <= '9'; i++) {\n D[i] = i - '0' + 52;\n }\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--) {\n im[i][j * 6 + a] = t % 2;\n t /= 2;\n }\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--) {\n pa[i][j * 6 + a] = t % 2;\n t /= 2;\n }\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":11884,"score_of_the_acc":-0.2414,"final_rank":9},{"submission_id":"aoj_1312_8113057","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nvector<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n for (int i = 0; i < used.size(); i++)\n if (used[i] == a)\n return;\n used.push_back(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":12008,"score_of_the_acc":-0.2251,"final_rank":8},{"submission_id":"aoj_1312_8051625","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nunordered_set<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n if (used.find(a) != used.end()) return;\n used.insert(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":12152,"score_of_the_acc":-0.1409,"final_rank":4},{"submission_id":"aoj_1312_8051622","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nunordered_set<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n if (used.count(a))\n return;\n used.insert(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":12172,"score_of_the_acc":-0.1075,"final_rank":2},{"submission_id":"aoj_1312_8051619","code_snippet":"#include <iostream>\n#include <vector>\n#include <unordered_set>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\n#define N 3\n#define MAX 1010\n\ntypedef unsigned long long ull;\n\nbool im[MAX][MAX], pa[MAX][MAX], npa[MAX][MAX];\nint w, h, p, ans;\nvector<ull> used;\nunordered_set<ull> used_set;\n\nvoid ppp() {\n ull a = 0;\n ull roll[MAX][MAX] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n \n if (used_set.count(a)) {\n return;\n }\n used_set.insert(a);\n \n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\n\nvoid ch() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n memcpy(pa, npa, sizeof(npa));\n}\n\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\n\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n used_set.clear();\n \n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n \n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":13376,"score_of_the_acc":-0.1839,"final_rank":5},{"submission_id":"aoj_1312_8051616","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nunordered_set<ull> used;\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n if (used.count(a))\n return;\n used.insert(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t & 1, t >>= 1;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t & 1, t >>= 1;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":12152,"score_of_the_acc":-0.1064,"final_rank":1},{"submission_id":"aoj_1312_8051615","code_snippet":"#include <bits/stdc++.h>\n#define N 3\nusing namespace std;\ntypedef unsigned long long ull;\nbool im[1010][1010], pa[110][110];\nint w, h, p, ans;\nunordered_set<ull> used; // use unordered_set instead of vector to check for duplicates\nvoid ppp() {\n ull a = 0;\n ull roll[1001][1001] = {};\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n a = a * N + pa[i][j];\n if (used.count(a)) // use unordered_set's count() function to check for duplicates\n return;\n used.insert(a);\n for (int j = 0; j < h; j++) {\n ull b = 0, g = 1;\n for (int i = 0; i < p; i++)\n b = b * N + im[j][i], g *= N;\n roll[j][p - 1] = b;\n for (int i = p; i < w; i++) {\n b = b * N + im[j][i] - im[j][i - p] * g;\n roll[j][i] = b;\n }\n }\n for (int j = p - 1; j < w; j++) {\n ull b = 0, g = 1, n = 1;\n for (int i = 0; i < p; i++)\n n *= N;\n for (int i = 0; i < p; i++)\n b = b * n + roll[i][j], g *= n;\n if (b == a)\n ans++;\n for (int i = p; i < h; i++) {\n b = b * n + roll[i][j] - roll[i - p][j] * g;\n if (b == a)\n ans++;\n }\n }\n}\nvoid ch() {\n bool npa[110][110];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n npa[i][j] = pa[j][p - i - 1];\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p; j++)\n pa[i][j] = npa[i][j];\n}\nvoid ch1() {\n for (int i = 0; i < p; i++)\n for (int j = 0; j < p / 2; j++)\n swap(pa[i][j], pa[i][p - j - 1]);\n}\nint main() {\n int D[256];\n for (int i = 'A'; i <= 'Z'; i++)\n D[i] = i - 'A';\n for (int i = 'a'; i <= 'z'; i++)\n D[i] = i - 'a' + 26;\n for (int i = '0'; i <= '9'; i++)\n D[i] = i - '0' + 52;\n D['+'] = 62, D['/'] = 63;\n while (cin >> w >> h >> p, w) {\n string s;\n used.clear();\n for (int i = 0; i < h; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n im[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n for (int i = 0; i < p; i++) {\n cin >> s;\n for (int j = 0; j < s.size(); j++) {\n int t = D[s[j]];\n int a = 6;\n while (a--)\n pa[i][j * 6 + a] = t % 2, t /= 2;\n }\n }\n ans = 0;\n for (int i = 0; i < 4; i++) {\n ppp();\n ch1();\n ppp();\n ch1();\n ch();\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":12264,"score_of_the_acc":-0.1124,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1312_10849705\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <list>\\n#include <cctype>\\n#include <functional>\\n#include <iterator>\\n#include <cstring>\\n#include <cmath>\\n#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\nint n, m, p;\\nchar code[1010][1010];\\nbool ma[1010][1010];\\nbool pattern[1010][1010];\\n\\null ha[1010][1010], tmp[1010][1010];\\null mh[1010][1010];\\nvoid compute_hash(bool a[1010][1010], int n, int m) {\\n const ull B1 = 9983;\\n const ull B2 = 100000007;\\n ull t1 = 1;\\n for (int j = 0; j < p; j++) t1 *= B1;\\n\\n for (int i = 0; i < n; i++) {\\n ull e = 0;\\n for (int j = 0; j < p; j++) e = e * B1 + a[i][j];\\n\\n for (int j = 0; j + p <= m; j++) {\\n tmp[i][j] = e;\\n if (j + p < m) e = e * B1 - t1 * a[i][j] + a[i][j + p];\\n }\\n }\\n\\n ull t2 = 1;\\n for (int i = 0; i < p; i++) t2 *= B2;\\n\\n for (int j = 0; j + p <= m; j++) {\\n ull e = 0;\\n for (int i = 0; i < p; i++) e = e * B2 + tmp[i][j];\\n\\n for (int i = 0; i + p <= n; i++) {\\n ha[i][j] = e;\\n if (i + p < n) e = e * B2 - t2 * tmp[i][j] + tmp[i + p][j];\\n }\\n }\\n \\n}\\n\\nint getbit(char ch) {\\n if (ch >= 'A' && ch <= 'Z') return 0 + ch - 'A';\\n if (ch >= 'a' && ch <= 'z') return 26 + ch - 'a';\\n if (ch >= '0' && ch <= '9') return 52 + ch - '0';\\n if (ch == '+') return 62;\\n return 63;\\n}\\n\\nvoid decode(bool mat[1010][1010], int h, int w) {\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < (w + 5) / 6; j++) {\\n int bit = getbit(code[i][j]);\\n for (int k = 0; k < 6; k++) {\\n mat[i][j*6+k] = ((bit >> (5 - k)) & 1) == 1;\\n }\\n }\\n }\\n}\\n\\nvoid init() {\\n for (int i = 0; i < n; i++) scanf(\\\"%s\\\", code[i]);\\n // printf(\\\"text:\\\\n\\\");\\n // for (int i = 0; i < n; i++) puts(code[i]);\\n // printf(\\\"\\\\n\\\");\\n decode(ma, n, m);\\n // for (int i = 0; i < n; i++) {\\n // for (int j = 0; j < m; j++) {\\n // printf(\\\"%d\\\", ma[i][j]);\\n // }\\n // printf(\\\"\\\\n\\\");\\n // }\\n // printf(\\\"\\\\n\\\");\\n for (int i = 0; i < p; i++) scanf(\\\"%s\\\", code[i]);\\n // printf(\\\"pattern:\\\\n\\\");\\n // for (int i = 0; i < p; i++) puts(code[i]);\\n // printf(\\\"\\\\n\\\");\\n \\n decode(pattern, p, p);\\n // for (int i = 0; i < p; i++) {\\n // for (int j = 0; j < p; j++) {\\n // printf(\\\"%d\\\", pattern[i][j]);\\n // }\\n // printf(\\\"\\\\n\\\");\\n // }\\n // printf(\\\"\\\\n\\\");\\n}\\n\\nvoid showp() {\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n printf(\\\"%d\\\", pattern[i][j]);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nbool tm[1010][1010];\\nvoid rotate() {\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n tm[i][j] = pattern[j][p-1-i];\\n }\\n }\\n for (int i = 0; i < p; i++) for (int j = 0; j < p; j++)\\n pattern[i][j] = tm[i][j];\\n}\\n\\nvoid mirror() {\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n tm[i][j] = pattern[i][p-1-j];\\n }\\n }\\n for (int i = 0; i < p; i++) for (int j = 0; j < p; j++)\\n pattern[i][j] = tm[i][j];\\n}\\n\\n\\nset<ull> seen;\\n\\nvoid solve() {\\n seen.clear();\\n int ans = 0;\\n compute_hash(pattern, p, p);\\n ull hp = ha[0][0];\\n seen.insert(hp);\\n compute_hash(ma, n, m);\\n// printf(\\\"hp:%llu ha[0][0]:%llu\\\\n\\\", hp, ha[0][0]);\\n for (int i = 0; i + p <= n; i++) {\\n for (int j = 0; j + p<= m; j++) {\\n if (ha[i][j] == hp) ans++;\\n mh[i][j] = ha[i][j];\\n }\\n }\\n// printf(\\\"ans = %d\\\\n\\\", ans);\\n for (int k = 0; k < 7; k++) {\\n if (k == 3) mirror();\\n else rotate();\\n compute_hash(pattern, p, p);\\n hp = ha[0][0];\\n// printf(\\\"hash: %llu\\\\n\\\", hp);\\n if (seen.find(hp) != seen.end()) continue;\\n// showp();\\n\\n seen.insert(hp);\\n for (int i = 0; i + p <= n; i++) {\\n for (int j = 0; j + p <= m; j++) {\\n if (mh[i][j] == hp) ans++;\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n}\\n\\nint main() {\\n for (;;) {\\n scanf(\\\"%d%d%d\\\", &m, &n, &p);\\n if (n == 0 && m == 0 && p == 0) break;\\n init();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 30436,\n \"score_of_the_acc\": -1,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1312_9733154\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nnamespace Random {\\nmt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\\nusing u64 = unsigned long long;\\nu64 get() {\\n return randgen();\\n}\\ntemplate <typename T> T get(T L) { // [0,L]\\n\\n return get() % (L + 1);\\n}\\ntemplate <typename T> T get(T L, T R) { // [L,R]\\n\\n return get(R - L) + L;\\n}\\n}; // namespace Random\\n\\n/**\\n * @brief Random\\n */\\n\\null MOD = 0x1fffffffffffffff;\\n\\ninline ull mul(ull a, ull b) {\\n __uint128_t ans = __uint128_t(a) * b;\\n ans = (ans >> 61) + (ans & MOD);\\n if (ans >= MOD)\\n ans -= MOD;\\n return ans;\\n}\\n\\nstatic inline ull genbase() {\\n return Random::get(ull(0x1fffffffffffffff));\\n}\\n\\nvector<vector<int>> rot90(vector<vector<int>> A) {\\n int N = A.size();\\n vector<vector<int>> Ret(N,vector<int>(N));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n Ret[N-1-j][i] = A[i][j];\\n }\\n }\\n return Ret;\\n}\\n\\nvector<vector<int>> Millor(vector<vector<int>> A) {\\n int N = A.size();\\n vector<vector<int>> Ret(N,vector<int>(N));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n Ret[i][N-1-j] = A[i][j];\\n }\\n }\\n return Ret;\\n}\\n\\n\\n\\nvoid Solve(int N, int M, int K) {\\n int mm = (M+5)/6;\\n vector<vector<int>> A(N,vector<int>(mm*6));\\n rep(i,0,N) {\\n rep(j,0,mm) {\\n char C;\\n cin >> C;\\n int X;\\n if ('A' <= C && C <= 'Z') X = C - 'A';\\n if ('a' <= C && C <= 'z') X = C - 'a' + 26;\\n if (isdigit(C)) X = C - '0' + 52;\\n if (C == '+') X = 62;\\n if (C == '/') X = 63;\\n rep(k,0,6) {\\n if (X & (1<<k)) A[i][j*6+5-k] = 1;\\n else A[i][j*6+5-k] = 0;\\n }\\n }\\n }\\n rep(i,0,N) A[i].resize(M);\\n int kk = (K+5)/6;\\n vector<vector<int>> B(K,vector<int>(kk*6));\\n rep(i,0,K) {\\n rep(j,0,kk) {\\n char C;\\n cin >> C;\\n int X;\\n if ('A' <= C && C <= 'Z') X = C - 'A';\\n if ('a' <= C && C <= 'z') X = C - 'a' + 26;\\n if (isdigit(C)) X = C - '0' + 52;\\n if (C == '+') X = 62;\\n if (C == '/') X = 63;\\n rep(k,0,6) {\\n if (X & (1<<k)) B[i][j*6+5-k] = 1;\\n else B[i][j*6+5-k] = 0;\\n }\\n }\\n }\\n rep(i,0,K) B[i].resize(K);\\n const ull base[2] = {genbase(), genbase()};\\n int L = max(N,max(M,K));\\n vector<vector<ull>> power(2,vector<ull>(L+1,0));\\n power[0][0] = power[1][0] = 1;\\n rep(i,0,2) rep(j,0,L) power[i][j+1] = mul(power[i][j],base[i]);\\n vector<vector<ull>> hash(N+1,vector<ull>(M+1,0));\\n rep(i,0,N) {\\n rep(j,0,M) {\\n hash[i+1][j+1] += A[i][j];\\n hash[i+1][j+1] += mul(hash[i][j+1], base[0]);\\n hash[i+1][j+1] += mul(hash[i+1][j], base[1]);\\n hash[i+1][j+1] += MOD - mul(mul(hash[i][j],base[0]),base[1]);\\n while(hash[i+1][j+1] >= MOD) hash[i+1][j+1] -= MOD;\\n }\\n }\\n auto get = [&](int l1, int r1, int l2, int r2) -> ull {\\n ull Ret = hash[r1][r2];\\n Ret += MOD - mul(hash[l1][r2], power[0][r1-l1]);\\n Ret += MOD - mul(hash[r1][l2], power[1][r2-l2]);\\n Ret += mul(mul(hash[l1][l2],power[0][r1-l1]),power[1][r2-l2]);\\n while(Ret >= MOD) Ret -= MOD;\\n return Ret;\\n };\\n map<ull,bool> mp;\\n rep(i,0,4) {\\n ull X = 0;\\n rep(j,0,K) {\\n rep(k,0,K) {\\n X += mul(mul(B[j][k],power[0][K-1-j]),power[1][K-1-k]);\\n while (X >= MOD) X -= MOD;\\n }\\n }\\n mp[X] = true;\\n B = rot90(B);\\n }\\n B = Millor(B);\\n rep(i,0,4) {\\n ull X = 0;\\n rep(j,0,K) {\\n rep(k,0,K) {\\n X += mul(mul(B[j][k],power[0][K-1-j]),power[1][K-1-k]);\\n while (X >= MOD) X -= MOD;\\n }\\n }\\n mp[X] = true;\\n B = rot90(B);\\n }\\n int ANS = 0;\\n rep(i,0,N) {\\n if (i+K > N) break;\\n rep(j,0,M) {\\n if (j+K > M) break;\\n if (mp.count(get(i,i+K,j,j+K))) ANS++;\\n }\\n }\\n cout << ANS << endl;\\n}\\n\\nint main() {\\nwhile(1) {\\n int N, M, K;\\n cin >> M >> N >> K;\\n if (N == 0) return 0;\\n Solve(N,M,K);\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 15064,\n \"score_of_the_acc\": -0.4473,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1312_8520219\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nusing ull = unsigned long long;\\nconst ull mod = (1LL << 61) - 1;\\n\\nnamespace Hash {\\null getmod(ull x) {\\n ull ret = (x >> 61) + (x & mod);\\n if (ret >= mod) ret -= mod;\\n return ret;\\n}\\n\\null mul(ull x, ull y) {\\n x = getmod(x), y = getmod(y);\\n ull x1 = x >> 31;\\n ull x2 = x & ((1LL << 31) - 1);\\n ull y1 = y >> 31;\\n ull y2 = y & ((1LL << 31) - 1);\\n ull z = x1 * y2 + x2 * y1;\\n ull z1 = z >> 30;\\n ull z2 = z & ((1LL << 30) - 1);\\n return getmod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));\\n}\\n} // namespace Hash\\n\\n// 0 が含まれないように\\ntemplate <typename T>\\nstruct RollingHash {\\n const int n;\\n const ull b; // 基数\\n vector<ull> h, p;\\n\\n // b = 887'446'835'055'281'585\\n RollingHash(const T &s, ull b = 887446835055281585) : n(sz(s)), b(b) {\\n h.assign(n + 1, 0), p.assign(n + 1, 1);\\n rep(i, n) {\\n p[i + 1] = Hash::mul(p[i], b);\\n h[i + 1] = Hash::mul(h[i], b) + s[i];\\n if (h[i + 1] >= mod) h[i + 1] -= mod;\\n }\\n }\\n\\n // 文字列の [l,r) の部分のハッシュ値\\n ull get_hash(int l, int r) const {\\n ull ret = h[r] + mod - Hash::mul(h[l], p[r - l]);\\n return ret - (ret >= mod ? mod : 0);\\n }\\n};\\n\\nint main() {\\n while (1) {\\n int w, h, p;\\n cin >> w >> h >> p;\\n if (!w)\\n break;\\n vector<string> img(h), pat(p);\\n rep(i, h) cin >> img[i];\\n rep(i, p) cin >> pat[i];\\n vector<vector<int>> vs(h), vt(p);\\n auto val = [](char c) {\\n if (isupper(c))\\n return c - 'A';\\n else if (islower(c))\\n return c - 'a' + 26;\\n else if (isdigit(c))\\n return c - '0' + 52;\\n else\\n return (c == '+' ? 62 : 63);\\n };\\n rep(i, h) rep(j, sz(img[i])) vs[i].eb(val(img[i][j]));\\n rep(i, p) rep(j, sz(pat[i])) vt[i].eb(val(pat[i][j]));\\n vector<vector<int>> s(h, vector<int>(w)), t(p, vector<int>(p));\\n rep(i, h) rep(j, w) s[i][j] = vs[i][j / 6] >> (5 - j % 6) & 1;\\n rep(i, p) rep(j, p) t[i][j] = vt[i][j / 6] >> (5 - j % 6) & 1;\\n vector<vector<ull>> hs(w, vector<ull>(h));\\n rep(i, h) {\\n RollingHash rh(s[i]);\\n rep(j, w - p + 1) hs[j][i] = rh.get_hash(j, j + p);\\n }\\n vector<vector<int>> f(h, vector<int>(w, 0));\\n auto rotate = [](vector<vector<int>> t) {\\n int n = sz(t);\\n vector<vector<int>> ret(n, vector<int>(n));\\n rep(i, n) rep(j, n) ret[j][n - 1 - i] = t[i][j];\\n return ret;\\n };\\n auto rev = [](vector<vector<int>> t) {\\n int n = sz(t);\\n vector<vector<int>> ret(n, vector<int>(n));\\n rep(i, n) rep(j, n) ret[i][n - 1 - j] = t[i][j];\\n return ret;\\n };\\n rep(side, 2) {\\n rep(rot, 4) {\\n vector<int> ct(p * p);\\n rep(i, p) rep(j, p) ct[i * p + j] = t[i][j];\\n RollingHash rht(ct);\\n ull tar = rht.get_hash(0, p * p);\\n ull b = 887446835055281585, base = 1;\\n rep(t, p) base = Hash::mul(base, b);\\n rep(j, w - p + 1) {\\n RollingHash rhs(hs[j], base);\\n rep(i, h - p + 1) f[i][j] |= rhs.get_hash(i, i + p) == tar;\\n }\\n t = rotate(t);\\n }\\n t = rev(t);\\n }\\n int ans = 0;\\n rep(i, h) rep(j, w) ans += f[i][j];\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 940,\n \"memory_kb\": 20788,\n \"score_of_the_acc\": -1.4799,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1312_8215714\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nvector<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n for (int i = 0; i < used.size(); i++)\\n if (used[i] == a)\\n return;\\n used.push_back(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]], a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]], a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 11960,\n \"score_of_the_acc\": -0.2225,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1312_8215713\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nvector<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n for (int i = 0; i < used.size(); i++)\\n if (used[i] == a)\\n return;\\n used.push_back(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 11972,\n \"score_of_the_acc\": -0.2116,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1312_8116063\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\n\\ntypedef unsigned long long ull;\\n\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nvector<ull> used;\\n\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n a = a * N + pa[i][j];\\n }\\n }\\n for (int i = 0; i < used.size(); i++) {\\n if (used[i] == a) {\\n return;\\n }\\n }\\n used.push_back(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++) {\\n b = b * N + im[j][i];\\n g *= N;\\n }\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++) {\\n n *= N;\\n }\\n for (int i = 0; i < p; i++) {\\n b = b * n + roll[i][j];\\n g *= n;\\n }\\n if (b == a) {\\n ans++;\\n }\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a) {\\n ans++;\\n }\\n }\\n }\\n}\\n\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n npa[i][j] = pa[j][p - i - 1];\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p; j++) {\\n pa[i][j] = npa[i][j];\\n }\\n }\\n}\\n\\nvoid ch1() {\\n for (int i = 0; i < p; i++) {\\n for (int j = 0; j < p / 2; j++) {\\n swap(pa[i][j], pa[i][p - j - 1]);\\n }\\n }\\n}\\n\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++) {\\n D[i] = i - 'A';\\n }\\n for (int i = 'a'; i <= 'z'; i++) {\\n D[i] = i - 'a' + 26;\\n }\\n for (int i = '0'; i <= '9'; i++) {\\n D[i] = i - '0' + 52;\\n }\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--) {\\n im[i][j * 6 + a] = t % 2;\\n t /= 2;\\n }\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--) {\\n pa[i][j * 6 + a] = t % 2;\\n t /= 2;\\n }\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 11884,\n \"score_of_the_acc\": -0.2414,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1312_8113057\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nvector<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n for (int i = 0; i < used.size(); i++)\\n if (used[i] == a)\\n return;\\n used.push_back(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 12008,\n \"score_of_the_acc\": -0.2251,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1312_8051625\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nunordered_set<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n if (used.find(a) != used.end()) return;\\n used.insert(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 12152,\n \"score_of_the_acc\": -0.1409,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1312_8051622\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nunordered_set<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n if (used.count(a))\\n return;\\n used.insert(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 12172,\n \"score_of_the_acc\": -0.1075,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1312_8051619\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <unordered_set>\\n#include <string>\\n#include <cstring>\\n\\nusing namespace std;\\n\\n#define N 3\\n#define MAX 1010\\n\\ntypedef unsigned long long ull;\\n\\nbool im[MAX][MAX], pa[MAX][MAX], npa[MAX][MAX];\\nint w, h, p, ans;\\nvector<ull> used;\\nunordered_set<ull> used_set;\\n\\nvoid ppp() {\\n ull a = 0;\\n ull roll[MAX][MAX] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n \\n if (used_set.count(a)) {\\n return;\\n }\\n used_set.insert(a);\\n \\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\n\\nvoid ch() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n memcpy(pa, npa, sizeof(npa));\\n}\\n\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\n\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n used_set.clear();\\n \\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n \\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 13376,\n \"score_of_the_acc\": -0.1839,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1312_8051616\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nunordered_set<ull> used;\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n if (used.count(a))\\n return;\\n used.insert(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t & 1, t >>= 1;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t & 1, t >>= 1;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 12152,\n \"score_of_the_acc\": -0.1064,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1312_8051615\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 3\\nusing namespace std;\\ntypedef unsigned long long ull;\\nbool im[1010][1010], pa[110][110];\\nint w, h, p, ans;\\nunordered_set<ull> used; // use unordered_set instead of vector to check for duplicates\\nvoid ppp() {\\n ull a = 0;\\n ull roll[1001][1001] = {};\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n a = a * N + pa[i][j];\\n if (used.count(a)) // use unordered_set's count() function to check for duplicates\\n return;\\n used.insert(a);\\n for (int j = 0; j < h; j++) {\\n ull b = 0, g = 1;\\n for (int i = 0; i < p; i++)\\n b = b * N + im[j][i], g *= N;\\n roll[j][p - 1] = b;\\n for (int i = p; i < w; i++) {\\n b = b * N + im[j][i] - im[j][i - p] * g;\\n roll[j][i] = b;\\n }\\n }\\n for (int j = p - 1; j < w; j++) {\\n ull b = 0, g = 1, n = 1;\\n for (int i = 0; i < p; i++)\\n n *= N;\\n for (int i = 0; i < p; i++)\\n b = b * n + roll[i][j], g *= n;\\n if (b == a)\\n ans++;\\n for (int i = p; i < h; i++) {\\n b = b * n + roll[i][j] - roll[i - p][j] * g;\\n if (b == a)\\n ans++;\\n }\\n }\\n}\\nvoid ch() {\\n bool npa[110][110];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n npa[i][j] = pa[j][p - i - 1];\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p; j++)\\n pa[i][j] = npa[i][j];\\n}\\nvoid ch1() {\\n for (int i = 0; i < p; i++)\\n for (int j = 0; j < p / 2; j++)\\n swap(pa[i][j], pa[i][p - j - 1]);\\n}\\nint main() {\\n int D[256];\\n for (int i = 'A'; i <= 'Z'; i++)\\n D[i] = i - 'A';\\n for (int i = 'a'; i <= 'z'; i++)\\n D[i] = i - 'a' + 26;\\n for (int i = '0'; i <= '9'; i++)\\n D[i] = i - '0' + 52;\\n D['+'] = 62, D['/'] = 63;\\n while (cin >> w >> h >> p, w) {\\n string s;\\n used.clear();\\n for (int i = 0; i < h; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n im[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n for (int i = 0; i < p; i++) {\\n cin >> s;\\n for (int j = 0; j < s.size(); j++) {\\n int t = D[s[j]];\\n int a = 6;\\n while (a--)\\n pa[i][j * 6 + a] = t % 2, t /= 2;\\n }\\n }\\n ans = 0;\\n for (int i = 0; i < 4; i++) {\\n ppp();\\n ch1();\\n ppp();\\n ch1();\\n ch();\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 12264,\n \"score_of_the_acc\": -0.1124,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":772,"cells":{"group_id":{"kind":"string","value":"aoj_1323_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nEncircling Circles\nYou are given a set of circles\nC\nof a variety of radii (radiuses) placed at a variety of positions, possibly overlapping one another. Given a circle with radius\nr\n, that circle may be placed so that it encircles all of the circles in the set\nC\nif r is large enough.\nThere may be more than one possible position of the circle of radius\nr\nto encircle all the member circles of\nC\n. We define the region\nU\nas the union of the areas of encircling circles at all such positions. In other words, for each point in\nU\n, there exists a circle of radius\nr\nthat encircles that point and all the members of\nC\n. Your task is to calculate the length of the periphery of that region\nU\n.\nFigure I.1 shows an example of the set of circles\nC\nand the region\nU\n. In the figure, three circles contained in\nC\nare expressed by circles of solid circumference, some possible positions of the encircling circles are expressed by circles of dashed circumference, and the area\nU\nis expressed by a thick dashed closed curve.\nInput\nThe input is a sequence of datasets. The number of datasets is less than 100.\nEach dataset is formatted as follows.\nn r\nx\n1\ny\n1\nr\n1\nx\n2\ny\n2\nr\n2\n.\n.\n.\nx\nn\ny\nn\nr\nn\nThe first line of a dataset contains two positive integers,\nn\nand\nr\n, separated by a single space.\nn\nmeans the number of the circles in the set\nC\nand does not exceed 100.\nr\nmeans the radius of the encircling circle and does not exceed 1000.\nEach of the\nn\nlines following the first line contains three integers separated by a single space. (\nx\ni\n,\ny\ni\n) means the center position of the\ni\n-th circle of the set\nC\nand\nr\ni\nmeans its radius.\nYou may assume −500≤\nx\ni\n≤500, −500≤\ny\ni\n≤500, and 1≤\nr\ni\n≤500.\nThe end of the input is indicated by a line containing two zeros separated by a single space.\nOutput\nFor each dataset, output a line containing a decimal fraction which means the length of the periphery (circumferential length) of the region\nU\n.\nThe output should not contain an error greater than 0.01. You can assume that, when\nr\nchanges by ε (|ε| < 0.0000001), the length of the periphery of the region\nU\nwill not change more than 0.001.\nIf\nr\nis too small to cover all of the circles in\nC\n, output a line containing only 0.0.\nNo other characters should be contained in the output.\nSample Input\n1 10\n5 5 7\n2 12\n5 5 7\n8 6 3\n3 10\n3 11 2\n2 1 1\n2 16 3\n3 15\n-5 2 5\n9 2 9\n5 8 6\n3 38\n-25 -10 8\n30 5 7\n-3 35 11\n3 39\n-25 -10 8\n30 5 7\n-3 35 11\n3 800\n-400 400 2\n300 300 1\n300 302 1\n3 800\n400 -400 2\n300 300 1\n307 300 3\n8 147\n130 80 12\n130 -40 12\n-110 80 12\n-110 -40 12\n70 140 12\n70 -100 12\n-50 140 12\n-50 -100 12\n3 493\n345 154 10\n291 111 75\n-275 -301 46\n4 55\n54 0 1\n40 30 5\n27 36 10\n0 48 7\n3 30\n0 3 3\n-3 0 4\n400 0 3\n3 7\n2 3 2\n-5 -4 2\n-4 3 2\n3 10\n-5 -4 5\n2 3 5\n-4 3 5\n4 6\n4 6 1\n5 5 1\n1 7 1\n0 1 1\n3 493\n345 154 10\n291 111 75\n-275 -301 46\n5 20\n-9 12 5\n0 15 5\n3 -3 3\n12 9 5\n-12 9 5\n0 0\nOutput for the Sample Input\n81.68140899333463\n106.81415022205297\n74.11215318612639\n108.92086846105579\n0.0\n254.85616536128433\n8576.93\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1323_6159804","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tif (x == 0)return 0;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tint n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) {\n\t\tif (m < 0 || mod <= m) {\n\t\t\tm %= mod; if (m < 0)m += mod;\n\t\t}\n\t\tn = m;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 10;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\n//-----------------------------------\ntypedef complex<ld> Point;\nld dot(Point a, Point b) { return real(conj(a) * b); }\nld cross(Point a, Point b) { return imag(conj(a) * b); }\nnamespace std {\n\tbool operator<(const Point& lhs, const Point& rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nstruct Line {\n\tPoint a, b;\n};\nstruct Circle {\n\tPoint p; ld r;\n};\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//counter clockwise\n\tif (cross(b, c) < -eps)return -1;//clock wise\n\tif (dot(b, c) < 0)return 2;//c--a--b on line\n\tif (norm(b) < norm(c))return -2;//a--b--c on line\n\treturn 0; //a--c--b on line\n}\n\n//円と円の交点\n//交点が無かったらnullが返されます\n//交点は大体いつも2つあるのでvector\nvector<Point> is_cc(Circle c1, Circle c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps)dfr = 0.0;\n\tif (dfr < 0.0)return res;\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\nint n, r;\nvoid solve() {\n\tvector<Circle> c(n);\n\trep(i, n) {\n\t\tint x, y, t; cin >> x >> y >> t;\n\t\tc[i] = { {(ld)x,(ld)y},(ld)t };\n\t}\n\t{\n\t\tvector<Circle> nc;\n\t\tvector<bool> ban(n);\n\t\trep(i, n) {\n\t\t\trep(j, n)if (i != j)if(!ban[j]) {\n\t\t\t\tld dif = abs(c[j].p - c[i].p);\n\t\t\t\tif (dif + c[i].r <= c[j].r + eps) {\n\t\t\t\t\tban[i] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ban[i]) {\n\t\t\t\tnc.push_back(c[i]);\n\t\t\t}\n\t\t}\n\t\tswap(c, nc);\n\t\tn = c.size();\n\t}\n\trep(i, n) {\n\t\tif (c[i].r > r) {\n\t\t\tcout << 0 << \"\\n\"; return;\n\t\t}\n\t}\n\n\tif (n == 1) {\n\t\tld ans = 2 * pi * (2*r-c[0].r);\n\t\tcout << ans << \"\\n\";\n\t\treturn;\n\t}\n\tvector<Circle> rc(n);\n\trep(i, n) {\n\t\trc[i].p = c[i].p;\n\t\trc[i].r = r - c[i].r;\n\t}\n\tvector<pair<ld, int>> vp;\n\tvector<Point> pre;\n\trep(i, n)Rep(j, i + 1, n) {\n\t\tvector<Point> cc = is_cc(rc[i], rc[j]);\n\t\tfor (Point p : cc) {\n\t\t\tbool valid = true;\n\t\t\tfor (Point pp : pre)if (abs(pp - p) < eps)valid = false;\n\t\t\tif (!valid)continue;\n\t\t\trep(k, n) {\n\t\t\t\tld len = abs(c[k].p - p) + c[k].r;\n\t\t\t\tif (len > r + eps)valid = false;\n\t\t\t}\n\t\t\tif (!valid)continue;\n\t\t\tpre.push_back(p);\n\t\t\trep(k, n) {\n\t\t\t\tld len = abs(c[k].p - p) + c[k].r;\n\t\t\t\tif (abs(len - r) < eps) {\n\t\t\t\t\tld t = arg(p - c[k].p);\n\t\t\t\t\tvp.push_back({ t,k });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (vp.empty()) {\n\t\t//cout << \"nande\\n\";\n\t\tcout << 0 << \"\\n\"; return;\n\t}\n\tld ans = 0;\n\tsort(all(vp));\n\t{\n\t\tvector<int> cnt(n);\n\t\tfor (auto p : vp)cnt[p.second]++;\n\t\tvector<pair<ld, int>>cop;\n\t\trep(i, vp.size())if (cnt[vp[i].second] != 1) {\n\t\t\tcop.push_back(vp[i]);\n\t\t}\n\t\tswap(vp, cop);\n\t}\n\n\tassert(vp.size()&&vp.size() % 2 == 0);\n\trep(i, vp.size()) {\n\t\tint ni = (i + 1 == vp.size() ? 0 : i + 1);\n\t\tld dt = vp[ni].first - vp[i].first;\n\t\tif (dt < 0)dt += 2 * pi;\n\t\tif (vp[i].second == vp[ni].second) {\n\t\t\tint id = vp[i].second;\n\t\t\tans += dt * (2*r-c[id].r);\n\t\t}\n\t\telse {\n\t\t\tans += dt * r;\n\t\t}\n\t}\n\tcout << ans << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//while(true)\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\twhile(cin>>n>>r,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3588,"score_of_the_acc":-0.9587,"final_rank":6},{"submission_id":"aoj_1323_4811351","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 105\n\nenum Type{\n\tto_ccw,\n\tto_cw,\n};\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\t\treturn x != p.x? x < p.x: y < p.y;\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\n\nstruct Info{\n\tInfo(){\n\n\t\trad = 0;\n\t\ttype = to_ccw;\n\t}\n\tInfo(double arg_rad,Type arg_type){\n\t\trad = arg_rad;\n\t\ttype = arg_type;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\tif(fabs(rad-arg.rad) > EPS){\n\t\t\treturn rad < arg.rad;\n\t\t}else{\n\n\t\t\treturn type < arg.type;\n\t\t}\n\t}\n\tbool operator==(const struct Info &arg) const{\n\n\t\treturn fabs(rad-arg.rad) < EPS && type == arg.type;\n\t}\n\n\tdouble rad;\n\tType type;\n};\n\n\nint N;\ndouble R;\nCircle C[SIZE];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\n\n//点のradを求める関数\ndouble calc_rad(Point p){\n\n\tif(p.y == 0){\n\n\t\tif(p.x > 0){\n\n\t\t\treturn 0;\n\n\t\t}else{ //p.x < 0\n\n\t\t\treturn M_PI;\n\t\t}\n\n\t}else if(p.x == 0){\n\n\t\tif(p.y > 0){\n\n\t\t\treturn M_PI/2.0;\n\t\t}else{\n\n\n\t\t\treturn 3*M_PI/2.0;\n\t\t}\n\n\t}else{\n\n\t\tdouble base = atan(fabs(p.y)/fabs(p.x));\n\n\t\tif(p.x > 0){\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn base;\n\n\t\t\t}else{ //p.y < 0\n\n\t\t\t\treturn 2*M_PI-base;\n\t\t\t}\n\n\t\t}else{ //p.x < 0\n\n\t\t\tif(p.y > 0){\n\n\t\t\t\treturn M_PI-base;\n\n\t\t\t}else{\n\n\t\t\t\treturn base+M_PI;\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*点moveをbaseを中心にradラジアン回転させる\nrad > 0なら反時計回り、rad < 0なら時計周り\n*/\nPoint rotate(Point base,Point move,double rad){\n\n\tPoint ret;\n\tmove = move-base;\n\n\tret.x = move.x*cos(rad)-move.y*sin(rad);\n\tret.y = move.x*sin(rad)+move.y*cos(rad);\n\n\tret = ret+base;\n\n\treturn ret;\n}\n\nint count_touch_C(Point P){\n\n\tint ret = 0;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(fabs(calc_dist(P,C[i].center)+C[i].r-R) < EPS){\n\n\t\t\tret++;\n\t\t}\n\t\tif(fabs(calc_dist(P,C[i].center)+C[i].r) > R+EPS){\n\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n//円aが円bを含むか判定\nbool contain_check(Circle a,Circle b){\n\n\treturn fabs(calc_dist(a.center,b.center)+b.r)+EPS < a.r;\n}\n\n//三辺が三角形を作れるか判定\nbool triangle_check(double a,double b,double c){\n\n\treturn (a+b > c+EPS) && (b+c > a+EPS) && (c+a > b+EPS);\n}\n\nvoid func(){\n\n\tbool first_check = true;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&C[i].center.x,&C[i].center.y,&C[i].r);\n\t\tif(C[i].r > R+EPS){\n\n\t\t\tfirst_check = false;\n\t\t}\n\t}\n\tif(!first_check){\n\n\t\tprintf(\"0.0\\n\");\n\t\treturn;\n\t}\n\tif(N == 1){\n\n\t\tprintf(\"%.10lf\\n\",(2*R-C[0].r)*2*M_PI);\n\t\treturn;\n\t}\n\n\tdouble ans = 0;\n\n\tvector<Info> info;\n\n\tbool contain_FLG;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble one_R = 2*R-C[i].r;\n\t\tPoint P = Point(C[i].center.x+(R-C[i].r),C[i].center.y); //rad0の位置にある包含円\n\n\t\tcontain_FLG = false;\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tif(contain_check(C[k],C[i])){\n\n\t\t\t\tcontain_FLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(contain_FLG)continue;\n\n\t\tinfo.clear();\n\n\t\tint num_contain = 0;\n\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(k == i)continue;\n\t\t\tif(contain_check(C[i],C[k])){\n\n\t\t\t\tnum_contain++;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tdouble len_i = R-C[i].r;\n\t\t\tdouble len_k = R-C[k].r;\n\t\t\tdouble len_ik = calc_dist(C[i].center,C[k].center);\n\n\t\t\tif(!triangle_check(len_i,len_k,len_ik)){\n\t\t\t\tcontinue;\n\t\t\t}\n\n\n\t\t\tdouble cos_theta = ((len_i*len_i+len_ik*len_ik)-len_k*len_k)/(2*len_i*len_ik);\n\n\t\t\tdouble rad_i = acos(cos_theta);\n\n\t\t\tfor(int loop = 0; loop < 2; loop++){\n\n\t\t\t\tdouble roll_rad;\n\t\t\t\tif(loop == 0){\n\t\t\t\t\t//辺ikをcw回りに回転\n\t\t\t\t\troll_rad = -rad_i;\n\n\t\t\t\t}else{\n\t\t\t\t\t//ccw回りに回転\n\t\t\t\t\troll_rad = rad_i;\n\t\t\t\t}\n\n\t\t\t\tPoint work = rotate(C[i].center,C[k].center,roll_rad);\n\t\t\t\tdouble tmp_rad = calc_rad(work-C[i].center);\n\n\t\t\t\tPoint work_P = rotate(C[i].center,P,tmp_rad);\n\n\t\t\t\tint tmp_num = count_touch_C(work_P);\n\n\t\t\t\tif(tmp_num != -1){\n\n\t\t\t\t\tif(ccw(work_P,C[i].center,C[k].center) == COUNTER_CLOCKWISE){\n\n\t\t\t\t\t\tinfo.push_back(Info(tmp_rad,to_cw));\n\n\t\t\t\t\t}else{\n\t\t\t\t\t\tinfo.push_back(Info(tmp_rad,to_ccw));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(num_contain == N-1){ //他の全ての円を含む\n\n\t\t\tprintf(\"%.10lf\\n\",one_R*2*M_PI);\n\t\t\treturn;\n\t\t}\n\n\t\tif(info.size() == 0)continue;\n\n\t\tsort(info.begin(),info.end());\n\t\tinfo.erase(unique(info.begin(),info.end()),info.end()); //★★★3つ以上円に接する場合は、同じ地点が複数出てくる★★★\n\n\t\tint start = 0;\n\t\t//★★to_ccwとto_cwが交互に現れるはず★★\n\t\tif(info[0].type == to_cw){\n\n\t\t\tstart = info.size()-1;\n\t\t}\n\n\t\tdouble one_rad = 0; //円iだけに引っかかる区間を求める\n\t\tdouble add_len = 0; //2つ以上引っ掛かる場合に、ccw順で一番近い円と作る弧の長さを足す\n\n\t\tfor(int k = 0; k < info.size(); k += 2){\n\n\t\t\tdouble from = info[(start+k)%info.size()].rad;\n\t\t\tdouble to = info[(start+k+1)%info.size()].rad;\n\n\t\t\tif(to >= from){\n\n\t\t\t\tone_rad += to-from;\n\n\t\t\t}else{ //to < from;\n\n\t\t\t\tone_rad += 2*M_PI-(from-to);\n\t\t\t}\n\n\t\t\tPoint from_P = rotate(C[i].center,P,from);\n\t\t\tdouble rad_from = calc_rad(C[i].center-from_P);//★★注意★★\n\n\n\t\t\tdouble min_rad = BIG_NUM;\n\t\t\tfor(int a = 0; a < N; a++){\n\t\t\t\tif(a == i)continue;\n\t\t\t\tif(fabs(calc_dist(from_P,C[a].center)+C[a].r-R) > EPS){\n\t\t\t\t\tcontinue; //円弧に接していない小円はSKIP\n\t\t\t\t}\n\n\t\t\t\tdouble tmp_rad = calc_rad(C[a].center-from_P);\n\t\t\t\tif(tmp_rad > rad_from){\n\n\t\t\t\t\tmin_rad = min(min_rad,tmp_rad-rad_from);\n\n\t\t\t\t}else{\n\n\t\t\t\t\tmin_rad = min(min_rad,2*M_PI-(rad_from-tmp_rad));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(min_rad < M_PI+EPS){\n\n\t\t\t\tadd_len += R*min_rad;\n\t\t\t}\n\n\t\t\tif(fabs(from-to) < EPS)continue; //★★同一地点★★\n\n\t\t\tPoint to_P = rotate(C[i].center,P,to);\n\t\t\tdouble rad_to = calc_rad(C[i].center-to_P); //★★注意★★\n\n\t\t\tmin_rad = BIG_NUM;\n\t\t\tfor(int a = 0; a < N; a++){\n\t\t\t\tif(a == i)continue;\n\n\t\t\t\tif(fabs(calc_dist(to_P,C[a].center)+C[a].r-R) > EPS){\n\t\t\t\t\tcontinue; //円弧に接していない小円はSKIP\n\t\t\t\t}\n\n\t\t\t\tdouble tmp_rad = calc_rad(C[a].center-to_P);\n\n\t\t\t\tif(tmp_rad > rad_to){\n\n\t\t\t\t\tmin_rad = min(min_rad,tmp_rad-rad_to);\n\n\t\t\t\t}else{\n\n\t\t\t\t\tmin_rad = min(min_rad,2*M_PI-(rad_to-tmp_rad));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(min_rad < M_PI+EPS){\n\n\t\t\t\tadd_len += R*min_rad;\n\t\t\t}\n\t\t}\n\n\t\tans += add_len+one_R*one_rad;\n\t}\n\n\tprintf(\"%.10lf\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %lf\",&N,&R);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3608,"score_of_the_acc":-0.9445,"final_rank":5},{"submission_id":"aoj_1323_3215685","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\n/* 基本要素 */\ntypedef complex<double> Point;\ntypedef pair<Point, Point> Line;\ntypedef vector<Point> VP;\nconst double PI = acos(-1);\nconst double EPS = 1e-7; // 許容誤差^2\nconst double INF = 1e9;\n#define X real()\n#define Y imag()\n// #define LE(n,m) ((n) < (m) + EPS)\n#define LE(n,m) ((n) - (m) < EPS)\n// #define GE(n,m) ((n) + EPS > (m))\n#define GE(n,m) (EPS > (m) - (n))\n#define EQ(n,m) (abs((n)-(m)) < EPS)\n\n// 内積 dot(a,b) = |a||b|cosθ\ndouble dot(Point a, Point b) {\n return a.X*b.X + a.Y*b.Y;\n}\n\n// 外積 cross(a,b) = |a||b|sinθ\ndouble cross(Point a, Point b) {\n return a.X*b.Y - a.Y*b.X;\n}\n\n// 点の進行方向\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b,c) > EPS) return +1; // counter clockwise\n if (cross(b,c) < -EPS) return -1; // clockwise\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 2円の交点\nVP crosspointCC(Point a, double ar, Point b, double br) {\n VP ps;\n Point ab = b-a;\n double d = abs(ab);\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\n if (EQ(d, 0) || ar+EPS < abs(crL)) return ps;\n\n // 円が接する時、こことEPSの設定をうまくしないとsqrt(sub)がnanになるので注意\n double sub = ar*ar - crL*crL;\n if(EQ(sub,0)) sub = 0;\n\n Point abN = ab * Point(0, sqrt(sub) / d);\n Point cp = a + crL/d * ab;\n ps.push_back(cp + abN);\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\n return ps;\n}\n\n// aからbへの回転角（中心(0,0)）[-pi,+pi]\ndouble angle(Point a,Point b){\n double t = arg(b)-arg(a);\n while(t>+PI) t-=2*PI;\n while(t<-PI) t+=2*PI;\n return t;\n}\n\ndouble solve(int n, double r){\n VP c(n);\n vector<double> cr(n);\n rep(i,n){\n int x,y;\n scanf(\" %d %d %lf\", &x, &y, &cr[i]);\n c[i] = Point(x,y);\n }\n\n // 円iを含むために、中心が移動できる範囲\n rep(i,n){\n cr[i] = r - cr[i];\n // dbg(cr[i]);\n if( !LE(0,cr[i]) ) return 0;\n }\n\n // どれかを内包する円は除去\n vector<bool> inner(n);\n rep(i,n){\n rep(j,n)if(i!=j){\n double D = abs(c[i]-c[j]);\n if( LE(D+cr[i], cr[j]) ) inner[j] = true;\n }\n }\n\n VP tttc;\n vector<double> tttr;\n rep(i,n){\n if(!inner[i]){\n tttc.pb(c[i]);\n tttr.pb(cr[i]);\n }\n }\n\n c = tttc;\n cr = tttr;\n n = c.size();\n\n if(n==1){\n return (cr[0]+r)*2*PI;\n }\n\n // n >= 2\n // 円iと円jの交点を求める\n using PPI = pair<Point,int>;\n vector<vector<PPI>> cps(n);\n\n rep(i,n)rep(j,i){\n VP cnd = crosspointCC(c[i], cr[i], c[j], cr[j]);\n if(cnd.size() == 0){\n // 交点がない時点で、2つを同時に包含できないのでおわり\n return 0;\n }\n else if(cnd.size() == 1){\n // 接するような円が見つかった時点で、その点にしか円はおけない\n // 置けるなら半径rの円\n bool ok = true;\n Point op = cnd[0];\n rep(k,n){\n if( !LE(abs(c[k]-op), cr[k]) ) ok = false;\n }\n\n if(ok) return r*2*PI;\n else return 0;\n }\n\n for(Point cp:cnd){\n cps[i].pb({cp,j});\n cps[j].pb({cp,i});\n }\n }\n\n // 偏角ソート\n double ans = 0;\n VP cand_pts;\n rep(i,n){\n vector<PPI> dat = cps[i];\n int sz = dat.size();\n\n // (偏角, index)\n using pd = pair<double,int>;\n vector<pd> stmp(sz);\n rep(j,sz){\n double theta = atan2(dat[j].fi.Y-c[i].Y, dat[j].fi.X-c[i].X);\n if( theta < -EPS ) theta = 2*PI + theta;\n stmp[j] = {theta, j};\n }\n\n sort(all(stmp));\n\n vector<double> cand_theta(sz);\n vector<int> valid(sz,1);\n rep(j,sz){\n double add = stmp[(j+1)%sz].fi - stmp[j].fi;\n if(add < -EPS) add += 2*PI;\n add /= 2;\n\n cand_theta[j] = stmp[j].fi + add;\n\n Point cp = c[i]+polar(cr[i],cand_theta[j]);\n // dbg(cp);\n // この点がokかチェック\n rep(k,n){\n if( !LE(abs(c[k]-cp), cr[k]) ) valid[j] = 0;\n }\n\n if(valid[j]){\n double theta = stmp[(j+1)%sz].fi - stmp[j].fi;\n if(theta < -EPS) theta += 2*PI;\n\n if(EQ(theta,0)) valid[j] = false;\n else ans += theta * (r+cr[i]);\n }\n }\n\n // printf(\" --- %d \\n\",i);\n // dbg(dat);\n // dbg(stmp);\n // dbg(valid);\n\n rep(j,sz){\n if(valid[j]^valid[(j+1)%sz]){\n int idx = stmp[(j+1)%sz].se;\n cand_pts.pb(dat[idx].fi);\n }\n }\n }\n\n int CPZ = cand_pts.size();\n rep(i,CPZ){\n bool ok = true;\n rep(j,i){\n double dist = abs(cand_pts[j] - cand_pts[i]);\n if(EQ(dist,0)) ok = false;\n }\n if(!ok) continue;\n // dbg(cand_pts[i]);\n\n double mx_angle = 0;\n rep(ci,n)rep(cj,ci){\n bool valid_pair = false;\n\n for(Point ppp:crosspointCC(c[ci],cr[ci],c[cj],cr[cj])){\n double ddd = abs(ppp - cand_pts[i]);\n if(EQ(ddd,0)) valid_pair = true;\n }\n\n if(valid_pair){\n Point center = cand_pts[i];\n Point aaa = c[ci] - center;\n Point bbb = c[cj] - center;\n\n mx_angle = max(mx_angle, abs(angle(aaa,bbb)));\n }\n }\n\n ans += mx_angle*r;\n }\n\n return ans;\n}\n\nint main(){\n int n;\n double r;\n while( scanf(\" %d %lf\", &n, &r),n ){\n printf(\"%.15f\\n\", solve(n,r));\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3820,"score_of_the_acc":-1.0195,"final_rank":7},{"submission_id":"aoj_1323_2418386","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst int maxn=111;\nint sgn(double x){return (x>eps)-(x<-eps);}\nint sgn(double a,double b){return sgn(a-b);}\ndouble sqr(double x){return x*x;}\nstruct P{\n\tdouble x,y;\n\tP(){}\n\tP(double x,double y):x(x),y(y){}\n\tdouble len2(){\n\t\treturn sqr(x)+sqr(y);\n\t}\n\tdouble len(){\n\t\treturn sqrt(len2());\n\t}\n\tvoid print(){\n\t\tprintf(\"(%.3f,%.3f)\\n\",x,y);\n\t}\n\tvoid read(){\n\t\tscanf(\"%lf%lf\",&x,&y);\n\t}\n\tP turn90(){return P(-y,x);}\n\tP norm(){return P(x/len(),y/len());}\n\tP rot(double rad){\n\t\treturn P(x*cos(rad)+y*sin(rad),x*sin(rad)-y*cos(rad));\n\t}\n};\nbool operator==(P a,P b){\n\treturn !sgn(a.x-b.x) and !sgn(a.y-b.y);\n}\nP operator+(P a,P b){\n\treturn P(a.x+b.x,a.y+b.y);\n}\nP operator-(P a,P b){\n\treturn P(a.x-b.x,a.y-b.y);\n}\nP operator*(P a,double b){\n\treturn P(a.x*b,a.y*b);\n}\nP operator/(P a,double b){\n\treturn P(a.x/b,a.y/b);\n}\ndouble operator^(P a,P b){\n\treturn a.x*b.x + a.y*b.y;\n}\ndouble operator*(P a,P b){\n\treturn a.x*b.y - a.y*b.x;\n}\ndouble det(P a,P b,P c){\n\treturn (b-a)*(c-a);\n}\ndouble dis(P a,P b){\n\treturn (b-a).len();\n}\ndouble Area(vector<P>poly){\n\tdouble ans=0;\n\tfor(int i=1;i<poly.size();i++)\n\t\tans+=(poly[i]-poly[0])*(poly[(i+1)%poly.size()]-poly[0]);\n\treturn fabs(ans)/2;\n}\nstruct L{\n\tP a,b;\n\tL(){}\n\tL(P a,P b):a(a),b(b){}\n\tP v(){return b-a;}\n};\nbool onLine(P p,L l){\n\treturn sgn((l.a-p)*(l.b-p))==0;\n}\nbool onSeg(P p,L s){\n\treturn onLine(p,s) and sgn((s.b-s.a)^(p-s.a))>=0 and sgn((s.a-s.b)^(p-s.b))>=0;\n}\nbool parallel(L l1,L l2){\n\treturn sgn(l1.v()*l2.v())==0;\n}\nP intersect(L l1,L l2){\n\tdouble s1=det(l1.a,l1.b,l2.a);\n\tdouble s2=det(l1.a,l1.b,l2.b);\n\treturn (l2.a*s2-l2.b*s1)/(s2-s1);\n}\nP project(P p,L l){\n\treturn l.a+l.v()*((p-l.a)^l.v())/l.v().len2();\n}\ndouble dis(P p,L l){\n\treturn fabs((p-l.a)*l.v())/l.v().len();\n}\nstruct C{\n\tP o;\n\tdouble r;\n\tC(){}\n\tC(P _o,double _r):o(_o),r(_r){}\n\tvoid read(){\n\t\to.read();\n\t\tscanf(\"%lf\",&r);\n\t}\n}c[maxn];\nbool operator<(C a,C b){\n\treturn a.r>b.r;\n}\nbool operator==(C c1,C c2){\n\treturn c1.o==c2.o && sgn(c1.r-c2.r)==0;\n}\ndouble fix(double x){return sgn(x)?x:0;}\nbool intersect(C a, C b, P &p1, P &p2) { \n\tdouble s1 = (a.o - b.o).len();\n\tif (sgn(s1 - a.r - b.r) > 0 || sgn(s1 - fabs(a.r - b.r)) < 0) return false;\n\tdouble s2 = (a.r * a.r - b.r * b.r) / s1;\n\tdouble aa = (s1 + s2) * 0.5, bb = (s1 - s2) * 0.5;\n\tP o = (b.o - a.o) * (aa / (aa + bb)) + a.o;\n\tP delta = (b.o - a.o).norm().turn90() * sqrt(fix(a.r * a.r - aa * aa));\n\tp1 = o + delta, p2 = o - delta;\n\treturn true;\n}\nint n;\ndouble r;\n\ndouble calcR(P O){\n\tdouble mxr=0;\n\tfor(int i=1;i<=n;i++){\n\t\tdouble ri=0;\n\t\tri=dis(c[i].o,O)+c[i].r;\n\t\tmxr=max(mxr,ri);\n\t}\n\treturn mxr;\n}\n\nbool check(P O){\n\tdouble mxr=0;\n\tfor(int i=1;i<=n;i++){\n\t\tdouble ri=0;\n\t\tri=dis(c[i].o,O)+c[i].r;\n\t\tif(sgn(ri-r)>0)\n\t\t\treturn false;\n\t}\n\treturn true;\n}\nP O;\nvector<P>vecO;\nbool in(P p){\n\n\tif(sgn(dis(p,O)-r)<=0)\n\t\treturn true;\n\n\tfor(int i=1;i<=n;i++){\n\t\tC c1=c[i],c2;\n\t\tc2.o=p;\n\t\tc1.r=r-c1.r;\n\t\tc2.r=r;\n\t\tP p1,p2;\n\t\tif(c1==c2||!intersect(c1,c2,p1,p2))\n\t\t\tcontinue;\n\t\tif(check(p1)||check(p2))\n\t\t\treturn true;\n\t}\n\n\treturn false;\n}\nP at(P O,P dir){\n\tdir=dir.norm();\n\tdouble l=::r,r=20000;\n\twhile(r-l>1e-9){\n\t\tdouble mid=(l+r)/2;\n\t\tif(in(O+dir*mid))\n\t\t\tl=mid;\n\t\telse r=mid;\n\t}\n\treturn O+dir*l;\n}\ndouble calc(P a,P b,P c){\n\t\n\tL l1,l2;\n\tl1.a=(a+b)/2;\n\tl1.b=l1.a+(b-a).turn90();\n\t\n\tl2.a=(b+c)/2;\n\tl2.b=l2.a+(b-c).turn90();\n\t\n\t\n\t\n\t\n\tif(parallel(l1,l2))\n\t\treturn dis(a,c);\n\t\n\tP O=intersect(l1,l2);\n\tdouble r=dis(O,a);\n\t\n\t\n\tdouble theta;\n\ttheta = acos(((c-O)^(a-O))/r/r);\n\t\n\treturn r*theta;\t\n}\ndouble calc(double l,double r){\n\t\n\tdouble p=0.45;\n\n\tdouble m=l+(r-l)*p;\n\t\n\tP pl=at(O,P(1,0).rot(l));\n\tP pm=at(O,P(1,0).rot(m));\n\tP pr=at(O,P(1,0).rot(r));\n\t\n\treturn calc(pl,pm,pr);\n\t\n}\ndouble simpl(double l,double r){\n\tdouble mid=(l+r)/2;\n\t\n\t\n\tdouble Sl=calc(l,mid);\n\tdouble Sr=calc(mid,r);\n\tdouble S=calc(l,r);\n\t\n\tif(sgn(S-Sl-Sr)==0)\n\t\treturn S;\n\treturn simpl(l,mid)+simpl(mid,r);\n}\n\nint main(){\n\twhile(scanf(\"%d%lf\",&n,&r)&&n){\n\t\tvecO.clear();\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tc[i].read();\n\t\t}\n\t\t\n\t\tsort(c+1,c+1+n);\n\t\t\n\t\tint m=0;\n\t\tstatic C nC[maxn];\n\t\tnC[++m]=c[1];\n\t\tfor(int i=2;i<=n;i++){\n\t\t\tint flag=0;\n\t\t\tfor(int j=1;j<=m;j++){\n\t\t\t\tdouble d=dis(c[i].o,nC[j].o);\n\t\t\t\tif(sgn(d-(nC[j].r-c[i].r))<=0){\n\t\t\t\t\tflag=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!flag){\n\t\t\t\tnC[++m]=c[i];\n\t\t\t}\n\t\t}\n\t\tn=m;\n\t\tfor(int i=1;i<=n;i++)\n\t\t\tc[i]=nC[i];\n\t\t\t\n\t\tif(n==1){\n\t\t\n\t\t\tif(sgn(c[1].r-r)<=0){\n\t\t\t\tprintf(\"%.8f\\n\",2*pi*(r*2-c[1].r));\n\t\t\t}else{\n\t\t\t\tputs(\"0.0\");\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tint flag=0;\n\t\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=i+1;j<=n;j++){\n\t\t\tC c1=c[i],c2=c[j];\n\t\t\tdouble d=dis(c[i].o,c[j].o);\n\t\t\tc1.r=r-c1.r;\n\t\t\tc2.r=r-c2.r;\n\t\t\tP p1,p2;\n\t\t\tif(c1==c2||!intersect(c1,c2,p1,p2))\n\t\t\t\tcontinue;\n\t\t\t\n\t\t\tif(sgn(calcR(p1)-r)<=0){\n\t\t\t\tvecO.push_back(p1);\n\t\t\t}\n\t\t\tif(sgn(calcR(p2)-r)<=0){\n\t\t\t\tvecO.push_back(p2);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(vecO.empty()){\n\t\t\tputs(\"0.0\");\n\t\t\tcontinue;\n\t\t}\n\t\t//cerr<<n<<endl;\n\t\tO=vecO.front();\n\t\t\n\t\tdouble ans=0;\n\t\tans+=simpl(0,pi);\n\t\tans+=simpl(pi,pi*2);\n\t\tprintf(\"%.8f\\n\",ans);\n\t\t\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1550,"memory_kb":3500,"score_of_the_acc":-1.9162,"final_rank":8},{"submission_id":"aoj_1323_1592121","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<math.h>\n#include<vector>\nusing namespace std;\nconst double EPS = 1e-10;\nconst double INF = 1e+10;\nconst double PI = acos(-1);\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\ninline double ABS(double a){return max(a,-a);}\nstruct Pt {\n\tdouble x, y;\n\tPt() {}\n\tPt(double x, double y) : x(x), y(y) {}\n\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\n\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\n\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\n\tPt operator-() const { return Pt(-x, -y); }\n\tPt operator*(const double &k) const { return Pt(x * k, y * k); }\n\tPt operator/(const double &k) const { return Pt(x / k, y / k); }\n\tdouble ABS() const { return sqrt(x * x + y * y); }\n\tdouble abs2() const { return x * x + y * y; }\n\tdouble arg() const { return atan2(y, x); }\n\tdouble dot(const Pt &a) const { return x * a.x + y * a.y; }\n\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\n};\ndouble tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\npair<Pt,Pt> pCC(Pt a, double r, Pt b, double s) {\n\tdouble d = (b - a).ABS();\n\tdouble x = (d * d + r * r - s * s) / (d * 2);\n\tPt e = (b - a) / d, w = e * Pt(0, 1) * sqrt(max(r * r - x * x, 0.0));\n\treturn make_pair(a + e * x - w, a + e * x + w);\n}\nint iCC(Pt a, double r, Pt b, double s) {\n\tdouble d = (b - a).ABS();\n\tif (sig(d) == 0 && sig(r - s) == 0) return -1; // correspond\n\tif (sig(r - s - d) > 0) return +2; // r > s\n\tif (sig(s - r - d) > 0) return -2; // s > r\n\treturn (sig(r + s - d) >= 0) ? 1 : 0;\n}\nPt c[110];\ndouble r[110];\nvector<Pt> p[110];\nvector<pair<int,int> > tp;\nint v[11100];\ndouble ad[110][110];\nint main(){\n\tint a;\n\tdouble b;\n\twhile(scanf(\"%d%lf\",&a,&b),a){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tdouble x,y;\n\t\t\tscanf(\"%lf%lf%lf\",&x,&y,r+i);\n\t\t\tc[i]=Pt(x,y);\n\t\t}\n\t\tfor(int i=0;i<11100;i++)v[i]=0;\n\t\tfor(int i=0;i<a;i++)p[i].clear();\n\t\ttp.clear();\n\t\tbool dame=false;\n\t\tfor(int i=0;i<a;i++)if(r[i]>b+EPS)dame=true;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=i+1;j<a;j++){\n\t\t\t\tif(iCC(c[i],b-r[i],c[j],b-r[j])==0)dame=true;\n\t\t\t}\n\t\t}\n\t\tif(dame){printf(\"0.0\\n\");continue;}\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\n\t\t\tif(iCC(c[i],b-r[i],c[j],b-r[j])==1){\n\t\t\t\tpair<Pt,Pt> t=pCC(c[i],b-r[i],c[j],b-r[j]);\n\t\t\t\tp[i].push_back(t.first);\n\t\t\t\tp[i].push_back(t.second);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<a;i++){\n\t\t\tint n=p[i].size();\n\t\t\tif(n==0){\n\t\t\t\tp[i].push_back(c[i]+Pt(cos(1),sin(1)));\n\t\t\t\tp[i].push_back(c[i]+Pt(cos(1),sin(1)));\n\t\t\t}else{\n\t\t\t\tfor(int j=0;j<n;j++){\n\t\t\t\t\tfor(int k=0;k<n-1;k++){\n\t\t\t\t\t\tif((p[i][k]-c[i]).arg()>(p[i][k+1]-c[i]).arg()){\n\t\t\t\t\t\t\tswap(p[i][k],p[i][k+1]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tp[i].push_back(p[i][0]);\n\t\t\t}\n\t\t}\n\t\tdouble ret=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<p[i].size()-1;j++){\n\t\t\tif(p[i].size()>2&&(p[i][j]-p[i][j+1]).ABS()<EPS)continue;\n\t\t\tdouble th=((p[i][j]-c[i]).arg()+(p[i][j+1]-c[i]).arg()+((j==p[i].size()-2)?PI*2:0))/2;\n\t\t\tPt t=c[i]+Pt(cos(th),sin(th))*(b-r[i]);\n\t\t\tbool ok=true;\n\t\t\tfor(int k=0;k<a;k++){\n\t\t\t\tif((t-c[k]).ABS()>b-r[k]+EPS){ok=false;break;}\n\t\t\t}\n\t\t\tif(ok){\n\t\t\t//\tprintf(\"%f %f %f %f\\n\",p[i][j].x,p[i][j].y,p[i][j+1].x,p[i][j+1].y);\n\t\t\t\tret+=(b*2-r[i])*(((j==p[i].size()-2)?PI*2:0)+(p[i][j+1]-c[i]).arg()-(p[i][j]-c[i]).arg());\n\t\t\t\ttp.push_back(make_pair(i,j));\n\t\t\t}\n\t\t}\n\t\tint sz=tp.size();\n\t\tint at=0;\n\t\tint prev=-1;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\n\t\t\tif(iCC(c[i],b-r[i],c[j],b-r[j])==1){\n\t\t\t\tpair<Pt,Pt> t=pCC(c[i],b-r[i],c[j],b-r[j]);\n\t\t\t\tdouble th=(t.first-c[j]).arg()-(t.first-c[i]).arg();\n\t\t\t\tif(th<0)th+=2*PI;\n\t\t\t\tif(th>PI)th=2*PI-th;\n\t\t\t\tad[i][j]=th*b;\n//\t\t\t\tprintf(\"%d %d: %f\\n\",i,j,ad[i][j]);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<sz;i++){\n\t\t\tfor(int j=0;j<sz;j++){\n\t\t\t\tif(at==j||(prev==j&&sz>2))continue;\n\t\t\t\tbool ok=false;\n\t\t\t\tif((p[tp[at].first][tp[at].second]-p[tp[j].first][tp[j].second]).ABS()<EPS)ok=true;\n\t\t\t\tif((p[tp[at].first][tp[at].second+1]-p[tp[j].first][tp[j].second]).ABS()<EPS)ok=true;\n\t\t\t\tif((p[tp[at].first][tp[at].second]-p[tp[j].first][tp[j].second+1]).ABS()<EPS)ok=true;\n\t\t\t\tif((p[tp[at].first][tp[at].second+1]-p[tp[j].first][tp[j].second+1]).ABS()<EPS)ok=true;\n\t\t\t\tif(ok){\n\t\t\t\t\tret+=ad[tp[at].first][tp[j].first];\n\t\t\t\t//\tprintf(\"%d %d\\n\",tp[at].first,tp[j].first);\n\t\t\t//\t\tprintf(\"%f\\n\",ret);\n\t\t\t\t\tprev=at;at=j;break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%.12f\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":340,"memory_kb":1668,"score_of_the_acc":-0.6509,"final_rank":4},{"submission_id":"aoj_1323_1568438","code_snippet":"#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<complex>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef double Real;\ntypedef complex<Real> Point;\n\nconst Real PI=acos(-1.0);\nconst Real eps=1e-8;\n\ntemplate<class T> bool eq(T a, T b){\n\treturn abs(a-b)<eps;\n}\n\ntemplate<class T> int sgn(T a){\n\tif(eq(a,(T)0)) return 0;\n\tif(a>0) return 1;\n\treturn -1;\n}\n\nstruct Circle:vector<Real> {\n\tPoint c;\n\tReal r;\n\tCircle(){}\n\tCircle(Point c,Real r):c(c),r(r){}\n};\n\nReal R;\nCircle cs[110];\nint N;\n\nPoint getPolar(Point c,Point r,Real ang){\n\treturn c+r*Point(cos(ang),sin(ang));\n}\n\nReal normalize(Real x){\n\twhile(x<-PI) x+=PI*2;\n\twhile(x>PI) x-=PI*2;\n\treturn x;\n}\n\nReal arg(Point p){\n\treturn atan2(p.imag(),p.real());\n}\n\nvoid iCC(Circle &c,Circle &c2){\n\tif(eq(c.c,c2.c)) return;\n\tReal d=abs(c.c-c2.c);\n\tReal r=c.r,r2=c2.r;\n\tif(sgn(d-(r+r2))>0) return;\n\telse if(sgn(d-(r+r2))==0){//out tan\n\t\tReal ang=normalize(arg(c2.c-c.c));\n\t\tc.push_back(ang);\n\t}else if(sgn(d-abs(r-r2))>0){//inter two points\n\t\tReal ang=arg(c2.c-c.c);\n\t\tReal ang2=acos((r*r+d*d-r2*r2)/(2*r*d));\n\t\tc.push_back(normalize(ang+ang2));\n\t\tc.push_back(normalize(ang-ang2));\n\t}else if(sgn(d-abs(r-r2))==0){//in tan\n\t\tif(r>r2){\n\t\t\tc.push_back(normalize(arg(c2.c-c.c)));\n\t\t}else{\n\t\t\tc.push_back(normalize(-arg(c2.c-c.c)));\n\t\t}\n\t}\n\telse{//contained\n\t\treturn;\n\t}\n}\n\nbool changeCircles(){\n\tfor(int i=0;i<N;i++){\n\t\tcs[i].r=R-cs[i].r;\n\t\tif(cs[i].r<eps) return false;\n\t}\n\treturn true;\n}\n\nvoid getAllPoints(){\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tif(i==j) continue;\n\t\t\tiCC(cs[i],cs[j]);\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++){\n\t\tcs[i].push_back(0);\n\t\tcs[i].push_back(PI);\n\t}\n}\n\nbool checkValidity(Point p){\n\tfor(int i=0;i<N;i++){\n\t\tReal d=abs(p-cs[i].c);\n\t\tif(sgn(d-cs[i].r)>0) return false;\n\t}\n\treturn true;\n}\n\nReal calcLength(){\n\tReal len=0,ang_sum=0;\n\tfor(int i=0;i<N;i++){\n\t\tsort(cs[i].begin(),cs[i].end());\n\t\tfor(int j=0;j<cs[i].size();j++){\n\t\t\tReal ang1=cs[i][j];\n\t\t\tReal ang2=j+1==cs[i].size()?cs[i][0]+PI*2:cs[i][j+1];\n\t\t\tReal ang=(ang1+ang2)/2;\n\t\t\tPoint p=getPolar(cs[i].c,cs[i].r,ang);\n\t\t\tbool flg=checkValidity(p);\n\t\t\tif(flg){\n\t\t\t\tlen+=(cs[i].r+R)*(ang2-ang1);\n\t\t\t\tang_sum+=(ang2-ang1);\n\t\t\t}\n\t\t}\n\t}\n\tif(ang_sum<eps) return 0;\n\tReal len2=R*(PI*2-ang_sum);\n\tReal res=len+len2;\n\treturn res;\n}\n\nvoid solve(){\n\tbool flg=changeCircles();\n\tif(flg==false){\n\t\tprintf(\"0.0\\n\");\n\t\treturn;\n\t}\n\tgetAllPoints();\n\tReal ans=calcLength();\n\tprintf(\"%f\\n\",ans);\n}\n\nvoid input(){\n\tint r;\n\tscanf(\"%d%d\",&N,&r);\n\tif(N==0) exit(0);\n\tR=r;\n\tfor(int i=0;i<N;i++){\n\t\tint x,y,r;\n\t\tscanf(\"%d%d%d\",&x,&y,&r);\n\t\tcs[i].clear();\n\t\tcs[i]=Circle(Point(x,y),r);\n\t}\n}\n\nint main(){\n\twhile(true){\n\t\tinput();\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1392,"score_of_the_acc":-0.3644,"final_rank":2},{"submission_id":"aoj_1323_1131796","code_snippet":"#include<cstdio>\n#include<cmath>\n#include<complex>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nconst double eps=1e-9;\nconst double PI=3.14159265358979323846264;\n\ntypedef complex<double> Point;\ntypedef complex<double> Vector;\n\ntemplate<class T> bool eq(T a,T b){\n\treturn abs(a-b)<eps;\n}\n\ndouble normalize(double ang){\n\twhile(ang<0) ang+=PI*2;\n\twhile(ang>PI*2) ang-=PI*2;\n\treturn ang;\n}\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n\tvector<double> angles;//intersections\n\tCircle(){}\n\tCircle(Point p,double r):center(p),r(r){}\n\tbool isin(Point p){\n\t\tdouble dis=abs(p-center);\n\t\treturn r>dis||eq(r,dis);\n\t}\n\tbool isin(Circle c){\n\t\tdouble d=abs(c.center-center)+c.r;\n\t\treturn r>d;\n\t}\n\tPoint getPoint(double theta){\n\t\treturn center+(Point(cos(theta),sin(theta))*r);\n\t}\n\tPoint onePoint(Circle c){\n\t\tdouble dis=abs(c.center-center);\n\t\tif(!eq(dis,r+c.r)){\n\t\t\treturn Point(NAN,NAN);\n\t\t}\n\t\tVector vec=c.center-center;\n\t\treturn center+vec*(r/(r+c.r));\n\t}\n\tvoid add(Circle c){\n\t\tdouble r2=c.r;\n\t\tdouble d=abs(c.center-center);\n\t\tif(r+r2<d) return;\n\t\tdouble theta=acos((r*r+d*d-r2*r2)/(2.0*r*d));\n\t\tVector vec=c.center-center;\n\t\tdouble phi=atan2(vec.imag(),vec.real());\n\t\tangles.push_back(normalize(phi+theta));\n\t\tangles.push_back(normalize(phi-theta));\n\t}\n\tbool haveCommon(Circle c){\n\t\tdouble d=abs(center-c.center);\n\t\treturn d<r+c.r||eq(d,r+c.r);\n\t}\n};\n\nvector<Circle> C;\nvector<Circle> centerArea;\nvector<Circle> circles;\nint N,R;\n\nvoid solve(){\n\tfor(int i=0;i<N;i++){\n\t\tif(C[i].r>R){\n\t\t\tprintf(\"0.0\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++){\n\t\tif(C[i].r==R){\n\t\t\tbool flg=true;\n\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\tif(i==j) continue;\n\t\t\t\tif(C[i].isin(C[j])==false) flg=false;\n\t\t\t}\n\t\t\tif(flg){\n\t\t\t\tprintf(\"%.f\\n\",PI*2*R);\n\t\t\t}else{\n\t\t\t\tprintf(\"0.0\\n\");\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++){\n\t\tcenterArea.push_back(Circle(C[i].center,R-C[i].r));\n\t}\n\tfor(int i=0;i<N;i++){\n\t\tbool flg=true;\n\t\tfor(int j=0;j<N;j++){\n\t\t\tif(i==j) continue;\n\t\t\tif(centerArea[i].isin(centerArea[j])){\n\t\t\t\tflg=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flg) circles.push_back(centerArea[i]);\n\t}\n\tif(circles.size()==1){\n\t\tprintf(\"%f\\n\",PI*2*(circles[0].r+R));\n\t\treturn;\n\t}\n\tint M=circles.size();\n\tfor(int i=0;i<M;i++) for(int j=i+1;j<M;j++){\n\t\tPoint pt=circles[i].onePoint(circles[j]);\n\t\tif(isnan(pt.real())) continue;\n\t\tbool flg=true;\n\t\tfor(int k=0;k<M;k++){\n\t\t\tif(i==k||j==k) continue;\n\t\t\tif(circles[k].isin(pt)==false) flg=false;\n\t\t}\n\t\tif(flg){\n\t\t\tprintf(\"%f\\n\",PI*2*R);\n\t\t}else{\n\t\t\tprintf(\"0.0\\n\");\n\t\t}\n\t\treturn;\n\t}\n\tfor(int i=0;i<M;i++) for(int j=0;j<M;j++){\n\t\tif(circles[i].haveCommon(circles[j])==false){\n\t\t\tprintf(\"0.0\\n\");\n\t\t\treturn;\n\t\t}\n\t}\n\tfor(int i=0;i<M;i++) for(int j=0;j<M;j++){\n\t\tif(i==j) continue;\n\t\tcircles[i].add(circles[j]);\n\t}\n\tdouble totalAng=0;\n\tdouble ans=0;\n\tfor(int i=0;i<M;i++){\n\t\tCircle cur=circles[i];\n\t\tsort(cur.angles.begin(),cur.angles.end());\n\t\tfor(int j=0;j<cur.angles.size();j++){\n\t\t\tdouble a=cur.angles[j];\n\t\t\tdouble b;\n\t\t\tif(j+1==cur.angles.size()){\n\t\t\t\tb=cur.angles[0]+PI*2;\n\t\t\t}else{\n\t\t\t\tb=cur.angles[j+1];\n\t\t\t}\n\t\t\tdouble mid=(a+b)/2;\n\t\t\tPoint pt=cur.getPoint(mid);\n\t\t\tbool flg=true;\n\t\t\tfor(int k=0;k<M;k++){\n\t\t\t\tif(circles[k].isin(pt)==false) flg=false;\n\t\t\t}\n\t\t\tif(flg){\n\t\t\t\tdouble curAng=b-a;\n\t\t\t\tans+=(curAng*(R+cur.r));\n\t\t\t\ttotalAng+=curAng;\n\t\t\t}\n\t\t}\n\t}\n\tif(totalAng==0){\n\t\tprintf(\"0.0\\n\");\n\t}else{\n\t\tans+=(PI*2-totalAng)*R;\n\t\tprintf(\"%f\\n\",ans);\n\t}\n}\n\nvoid init(){\n\tC.clear();\n\tcenterArea.clear();\n\tcircles.clear();\n}\n\nint main(){\n\twhile(true){\n\t\tscanf(\"%d%d\",&N,&R);\n\t\tif(N==0&&R==0) break;\n\t\tinit();\n\t\tfor(int i=0;i<N;i++){\n\t\t\tint x,y,r;\n\t\t\tscanf(\"%d%d%d\",&x,&y,&r);\n\t\t\tC.push_back(Circle(Point(x,y),r));\n\t\t}\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1372,"score_of_the_acc":-0.3851,"final_rank":3},{"submission_id":"aoj_1323_390973","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n#include <cstdio>\n#include <cassert>\nusing namespace std;\n\nconst double EPS=1e-8;\n\nstruct pt {\n\tdouble x,y;\n\tpt() {}\n\tpt(double x_, double y_) : x(x_), y(y_) {}\n\tpt operator + (const pt& p) const { return pt(x+p.x,y+p.y); }\n\tpt operator - (const pt& p) const { return pt(x-p.x,y-p.y); }\n\tdouble mod2() const { return x*x+y*y; }\n\tdouble mod() const { return sqrt(mod2()); }\n\tdouble arg() const { return atan2(y,x); }\n\tstatic pt polar(double r, double theta) { return pt(r*cos(theta),r*sin(theta)); }\n\tbool operator == (const pt& p) const { return x==p.x && y==p.y; }\n\tbool operator < (const pt& p) const { return false; }\n};\n\nistream& operator >> (istream& i, pt& p) { return i >> p.x >> p.y; }\n\ntypedef vector<pt> VP;\ntypedef vector<int> VI;\ntypedef vector<double> VD;\ntypedef pair<double,pt> PDP;\ntypedef vector<PDP> VC;\n\ninline double sq(double x) { return x*x; }\n\nint main() {\n\tint n,R;\n\twhile(cin >> n >> R && n) {\n\t\tdouble o=0;\n\t\tdouble ret=0;\n\t\tdouble rem=2*M_PI;\n\t\tbool exists=false;\n\t\tVC cc(n);\n\t\tfor (int i=0;i<n;++i) {\n\t\t\tcin >> cc[i].second >> cc[i].first;\n\t\t\tcc[i].first=R-cc[i].first;\n\t\t}\n\t\tsort(cc.begin(),cc.end());\n\t\tVP c;\n\t\tVD r;\n\t\tfor (int i=0;i<n;++i) {\n\t\t\tif (cc[i].first<0) goto res;\n\t\t\tfor (int j=0;j<i;++j) {\n\t\t\t\tif ((cc[i].second-cc[j].second).mod2()<=sq(cc[i].first-cc[j].first)) goto redundant;\n\t\t\t}\n\t\t\tr.push_back(cc[i].first);\n\t\t\tc.push_back(cc[i].second);\n\t\t\tredundant:;\n\t\t}\n\t\tn=c.size();\n\t\tfor (int i=0;i<n;++i) {\n\t\t\tVD alpha;\n\t\t\talpha.push_back(0);\n\t\t\talpha.push_back(2*M_PI);\n\t\t\tfor (int j=0;j<n;++j) {\n\t\t\t\tif (j==i) continue;\n\t\t\t\tpt v=c[j]-c[i];\n\t\t\t\tif (v.mod2()>sq(r[i]+r[j])) goto res;\n\t\t\t\tif (v.mod2()<sq(r[i]-r[j])) continue;\n\t\t\t\tdouble theta=v.arg();\n//\t\t\t\tcerr << (v.mod2()+sq(r[i])-sq(r[j])) << \" / \" << (2*v.mod()*r[i]) << endl;\n\t\t\t\tdouble co=(v.mod2()+sq(r[i])-sq(r[j]))/(2*v.mod()*r[i]);\n\t\t\t\t//assert(co>=-1);\n\t\t\t\t//assert(co<=1);\n\t\t\t\tif (co<-1) co=-1;\n\t\t\t\tif (co>1) co=1;\n\t\t\t\tdouble phi=acos(co);\n//\t\t\t\tcerr << i << \" intersects with \" << j << \" at \" << theta-phi << \" and \" << theta+phi << endl;\n\t\t\t\talpha.push_back(theta+phi-2*M_PI);\n\t\t\t\talpha.push_back(theta+phi);\n\t\t\t\talpha.push_back(theta+phi+2*M_PI);\n\t\t\t\talpha.push_back(theta-phi-2*M_PI);\n\t\t\t\talpha.push_back(theta-phi);\n\t\t\t\talpha.push_back(theta-phi+2*M_PI);\n\t\t\t}\n\t\t\tsort(alpha.begin(),alpha.end());\n\t\t\tfor(int k=0;alpha[k]<2*M_PI;++k) {\n\t\t\t\tif (alpha[k]<0) continue;\n\t\t\t\tdouble delta=alpha[k+1]-alpha[k];\n\t\t\t\tdouble beta=(alpha[k]+alpha[k+1])/2;\n\t\t\t\tpt mid=c[i]+pt::polar(r[i],beta);\n\t\t\t\tfor (int j=0;j<n;++j) {\n\t\t\t\t\tif ((mid-c[j]).mod()-EPS>r[j]) goto skip;\n\t\t\t\t}\n//\t\t\t\tcerr << \"added an interval \" << alpha[k] << \" -- \" << alpha[k+1] << \" at \" << i << \" w/radius \" << r[i]+R << endl;\n\t\t\t\texists=true;\n\t\t\t\tret+=(r[i]+R)*delta;\n\t\t\t\trem-=delta;\n\t\t\t\tskip:;\n\t\t\t}\n\t\t}\n\t\tif (exists) o=ret+R*rem;\n\t\tres:\n\t\tif (o) printf(\"%.3f\\n\",o);\n\t\telse printf(\"0.0\\n\");\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1323_6159804\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tif (x == 0)return 0;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tint n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) {\\n\\t\\tif (m < 0 || mod <= m) {\\n\\t\\t\\tm %= mod; if (m < 0)m += mod;\\n\\t\\t}\\n\\t\\tn = m;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 10;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\n//-----------------------------------\\ntypedef complex<ld> Point;\\nld dot(Point a, Point b) { return real(conj(a) * b); }\\nld cross(Point a, Point b) { return imag(conj(a) * b); }\\nnamespace std {\\n\\tbool operator<(const Point& lhs, const Point& rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nstruct Line {\\n\\tPoint a, b;\\n};\\nstruct Circle {\\n\\tPoint p; ld r;\\n};\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//counter clockwise\\n\\tif (cross(b, c) < -eps)return -1;//clock wise\\n\\tif (dot(b, c) < 0)return 2;//c--a--b on line\\n\\tif (norm(b) < norm(c))return -2;//a--b--c on line\\n\\treturn 0; //a--c--b on line\\n}\\n\\n//円と円の交点\\n//交点が無かったらnullが返されます\\n//交点は大体いつも2つあるのでvector\\nvector<Point> is_cc(Circle c1, Circle c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps)dfr = 0.0;\\n\\tif (dfr < 0.0)return res;\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\nint n, r;\\nvoid solve() {\\n\\tvector<Circle> c(n);\\n\\trep(i, n) {\\n\\t\\tint x, y, t; cin >> x >> y >> t;\\n\\t\\tc[i] = { {(ld)x,(ld)y},(ld)t };\\n\\t}\\n\\t{\\n\\t\\tvector<Circle> nc;\\n\\t\\tvector<bool> ban(n);\\n\\t\\trep(i, n) {\\n\\t\\t\\trep(j, n)if (i != j)if(!ban[j]) {\\n\\t\\t\\t\\tld dif = abs(c[j].p - c[i].p);\\n\\t\\t\\t\\tif (dif + c[i].r <= c[j].r + eps) {\\n\\t\\t\\t\\t\\tban[i] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!ban[i]) {\\n\\t\\t\\t\\tnc.push_back(c[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(c, nc);\\n\\t\\tn = c.size();\\n\\t}\\n\\trep(i, n) {\\n\\t\\tif (c[i].r > r) {\\n\\t\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t\\t}\\n\\t}\\n\\n\\tif (n == 1) {\\n\\t\\tld ans = 2 * pi * (2*r-c[0].r);\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tvector<Circle> rc(n);\\n\\trep(i, n) {\\n\\t\\trc[i].p = c[i].p;\\n\\t\\trc[i].r = r - c[i].r;\\n\\t}\\n\\tvector<pair<ld, int>> vp;\\n\\tvector<Point> pre;\\n\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\tvector<Point> cc = is_cc(rc[i], rc[j]);\\n\\t\\tfor (Point p : cc) {\\n\\t\\t\\tbool valid = true;\\n\\t\\t\\tfor (Point pp : pre)if (abs(pp - p) < eps)valid = false;\\n\\t\\t\\tif (!valid)continue;\\n\\t\\t\\trep(k, n) {\\n\\t\\t\\t\\tld len = abs(c[k].p - p) + c[k].r;\\n\\t\\t\\t\\tif (len > r + eps)valid = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (!valid)continue;\\n\\t\\t\\tpre.push_back(p);\\n\\t\\t\\trep(k, n) {\\n\\t\\t\\t\\tld len = abs(c[k].p - p) + c[k].r;\\n\\t\\t\\t\\tif (abs(len - r) < eps) {\\n\\t\\t\\t\\t\\tld t = arg(p - c[k].p);\\n\\t\\t\\t\\t\\tvp.push_back({ t,k });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (vp.empty()) {\\n\\t\\t//cout << \\\"nande\\\\n\\\";\\n\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\tld ans = 0;\\n\\tsort(all(vp));\\n\\t{\\n\\t\\tvector<int> cnt(n);\\n\\t\\tfor (auto p : vp)cnt[p.second]++;\\n\\t\\tvector<pair<ld, int>>cop;\\n\\t\\trep(i, vp.size())if (cnt[vp[i].second] != 1) {\\n\\t\\t\\tcop.push_back(vp[i]);\\n\\t\\t}\\n\\t\\tswap(vp, cop);\\n\\t}\\n\\n\\tassert(vp.size()&&vp.size() % 2 == 0);\\n\\trep(i, vp.size()) {\\n\\t\\tint ni = (i + 1 == vp.size() ? 0 : i + 1);\\n\\t\\tld dt = vp[ni].first - vp[i].first;\\n\\t\\tif (dt < 0)dt += 2 * pi;\\n\\t\\tif (vp[i].second == vp[ni].second) {\\n\\t\\t\\tint id = vp[i].second;\\n\\t\\t\\tans += dt * (2*r-c[id].r);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tans += dt * r;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//while(true)\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile(cin>>n>>r,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.9587,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1323_4811351\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 105\\n\\nenum Type{\\n\\tto_ccw,\\n\\tto_cw,\\n};\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\t\\treturn x != p.x? x < p.x: y < p.y;\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Circle{\\n\\tPoint center;\\n\\tdouble r;\\n};\\n\\nstruct Info{\\n\\tInfo(){\\n\\n\\t\\trad = 0;\\n\\t\\ttype = to_ccw;\\n\\t}\\n\\tInfo(double arg_rad,Type arg_type){\\n\\t\\trad = arg_rad;\\n\\t\\ttype = arg_type;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\tif(fabs(rad-arg.rad) > EPS){\\n\\t\\t\\treturn rad < arg.rad;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn type < arg.type;\\n\\t\\t}\\n\\t}\\n\\tbool operator==(const struct Info &arg) const{\\n\\n\\t\\treturn fabs(rad-arg.rad) < EPS && type == arg.type;\\n\\t}\\n\\n\\tdouble rad;\\n\\tType type;\\n};\\n\\n\\nint N;\\ndouble R;\\nCircle C[SIZE];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\n\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\nint count_touch_C(Point P){\\n\\n\\tint ret = 0;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(fabs(calc_dist(P,C[i].center)+C[i].r-R) < EPS){\\n\\n\\t\\t\\tret++;\\n\\t\\t}\\n\\t\\tif(fabs(calc_dist(P,C[i].center)+C[i].r) > R+EPS){\\n\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n//円aが円bを含むか判定\\nbool contain_check(Circle a,Circle b){\\n\\n\\treturn fabs(calc_dist(a.center,b.center)+b.r)+EPS < a.r;\\n}\\n\\n//三辺が三角形を作れるか判定\\nbool triangle_check(double a,double b,double c){\\n\\n\\treturn (a+b > c+EPS) && (b+c > a+EPS) && (c+a > b+EPS);\\n}\\n\\nvoid func(){\\n\\n\\tbool first_check = true;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&C[i].center.x,&C[i].center.y,&C[i].r);\\n\\t\\tif(C[i].r > R+EPS){\\n\\n\\t\\t\\tfirst_check = false;\\n\\t\\t}\\n\\t}\\n\\tif(!first_check){\\n\\n\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\tif(N == 1){\\n\\n\\t\\tprintf(\\\"%.10lf\\\\n\\\",(2*R-C[0].r)*2*M_PI);\\n\\t\\treturn;\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\n\\tvector<Info> info;\\n\\n\\tbool contain_FLG;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble one_R = 2*R-C[i].r;\\n\\t\\tPoint P = Point(C[i].center.x+(R-C[i].r),C[i].center.y); //rad0の位置にある包含円\\n\\n\\t\\tcontain_FLG = false;\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tif(contain_check(C[k],C[i])){\\n\\n\\t\\t\\t\\tcontain_FLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(contain_FLG)continue;\\n\\n\\t\\tinfo.clear();\\n\\n\\t\\tint num_contain = 0;\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(k == i)continue;\\n\\t\\t\\tif(contain_check(C[i],C[k])){\\n\\n\\t\\t\\t\\tnum_contain++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tdouble len_i = R-C[i].r;\\n\\t\\t\\tdouble len_k = R-C[k].r;\\n\\t\\t\\tdouble len_ik = calc_dist(C[i].center,C[k].center);\\n\\n\\t\\t\\tif(!triangle_check(len_i,len_k,len_ik)){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\tdouble cos_theta = ((len_i*len_i+len_ik*len_ik)-len_k*len_k)/(2*len_i*len_ik);\\n\\n\\t\\t\\tdouble rad_i = acos(cos_theta);\\n\\n\\t\\t\\tfor(int loop = 0; loop < 2; loop++){\\n\\n\\t\\t\\t\\tdouble roll_rad;\\n\\t\\t\\t\\tif(loop == 0){\\n\\t\\t\\t\\t\\t//辺ikをcw回りに回転\\n\\t\\t\\t\\t\\troll_rad = -rad_i;\\n\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t//ccw回りに回転\\n\\t\\t\\t\\t\\troll_rad = rad_i;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tPoint work = rotate(C[i].center,C[k].center,roll_rad);\\n\\t\\t\\t\\tdouble tmp_rad = calc_rad(work-C[i].center);\\n\\n\\t\\t\\t\\tPoint work_P = rotate(C[i].center,P,tmp_rad);\\n\\n\\t\\t\\t\\tint tmp_num = count_touch_C(work_P);\\n\\n\\t\\t\\t\\tif(tmp_num != -1){\\n\\n\\t\\t\\t\\t\\tif(ccw(work_P,C[i].center,C[k].center) == COUNTER_CLOCKWISE){\\n\\n\\t\\t\\t\\t\\t\\tinfo.push_back(Info(tmp_rad,to_cw));\\n\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tinfo.push_back(Info(tmp_rad,to_ccw));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(num_contain == N-1){ //他の全ての円を含む\\n\\n\\t\\t\\tprintf(\\\"%.10lf\\\\n\\\",one_R*2*M_PI);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tif(info.size() == 0)continue;\\n\\n\\t\\tsort(info.begin(),info.end());\\n\\t\\tinfo.erase(unique(info.begin(),info.end()),info.end()); //★★★3つ以上円に接する場合は、同じ地点が複数出てくる★★★\\n\\n\\t\\tint start = 0;\\n\\t\\t//★★to_ccwとto_cwが交互に現れるはず★★\\n\\t\\tif(info[0].type == to_cw){\\n\\n\\t\\t\\tstart = info.size()-1;\\n\\t\\t}\\n\\n\\t\\tdouble one_rad = 0; //円iだけに引っかかる区間を求める\\n\\t\\tdouble add_len = 0; //2つ以上引っ掛かる場合に、ccw順で一番近い円と作る弧の長さを足す\\n\\n\\t\\tfor(int k = 0; k < info.size(); k += 2){\\n\\n\\t\\t\\tdouble from = info[(start+k)%info.size()].rad;\\n\\t\\t\\tdouble to = info[(start+k+1)%info.size()].rad;\\n\\n\\t\\t\\tif(to >= from){\\n\\n\\t\\t\\t\\tone_rad += to-from;\\n\\n\\t\\t\\t}else{ //to < from;\\n\\n\\t\\t\\t\\tone_rad += 2*M_PI-(from-to);\\n\\t\\t\\t}\\n\\n\\t\\t\\tPoint from_P = rotate(C[i].center,P,from);\\n\\t\\t\\tdouble rad_from = calc_rad(C[i].center-from_P);//★★注意★★\\n\\n\\n\\t\\t\\tdouble min_rad = BIG_NUM;\\n\\t\\t\\tfor(int a = 0; a < N; a++){\\n\\t\\t\\t\\tif(a == i)continue;\\n\\t\\t\\t\\tif(fabs(calc_dist(from_P,C[a].center)+C[a].r-R) > EPS){\\n\\t\\t\\t\\t\\tcontinue; //円弧に接していない小円はSKIP\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdouble tmp_rad = calc_rad(C[a].center-from_P);\\n\\t\\t\\t\\tif(tmp_rad > rad_from){\\n\\n\\t\\t\\t\\t\\tmin_rad = min(min_rad,tmp_rad-rad_from);\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tmin_rad = min(min_rad,2*M_PI-(rad_from-tmp_rad));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_rad < M_PI+EPS){\\n\\n\\t\\t\\t\\tadd_len += R*min_rad;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(fabs(from-to) < EPS)continue; //★★同一地点★★\\n\\n\\t\\t\\tPoint to_P = rotate(C[i].center,P,to);\\n\\t\\t\\tdouble rad_to = calc_rad(C[i].center-to_P); //★★注意★★\\n\\n\\t\\t\\tmin_rad = BIG_NUM;\\n\\t\\t\\tfor(int a = 0; a < N; a++){\\n\\t\\t\\t\\tif(a == i)continue;\\n\\n\\t\\t\\t\\tif(fabs(calc_dist(to_P,C[a].center)+C[a].r-R) > EPS){\\n\\t\\t\\t\\t\\tcontinue; //円弧に接していない小円はSKIP\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tdouble tmp_rad = calc_rad(C[a].center-to_P);\\n\\n\\t\\t\\t\\tif(tmp_rad > rad_to){\\n\\n\\t\\t\\t\\t\\tmin_rad = min(min_rad,tmp_rad-rad_to);\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tmin_rad = min(min_rad,2*M_PI-(rad_to-tmp_rad));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_rad < M_PI+EPS){\\n\\n\\t\\t\\t\\tadd_len += R*min_rad;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tans += add_len+one_R*one_rad;\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %lf\\\",&N,&R);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.9445,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1323_3215685\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\n/* 基本要素 */\\ntypedef complex<double> Point;\\ntypedef pair<Point, Point> Line;\\ntypedef vector<Point> VP;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-7; // 許容誤差^2\\nconst double INF = 1e9;\\n#define X real()\\n#define Y imag()\\n// #define LE(n,m) ((n) < (m) + EPS)\\n#define LE(n,m) ((n) - (m) < EPS)\\n// #define GE(n,m) ((n) + EPS > (m))\\n#define GE(n,m) (EPS > (m) - (n))\\n#define EQ(n,m) (abs((n)-(m)) < EPS)\\n\\n// 内積 dot(a,b) = |a||b|cosθ\\ndouble dot(Point a, Point b) {\\n return a.X*b.X + a.Y*b.Y;\\n}\\n\\n// 外積 cross(a,b) = |a||b|sinθ\\ndouble cross(Point a, Point b) {\\n return a.X*b.Y - a.Y*b.X;\\n}\\n\\n// 点の進行方向\\n// !!! 誤差に注意 !!! (掛け算したものとかなり小さいものを比べているので)\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b,c) > EPS) return +1; // counter clockwise\\n if (cross(b,c) < -EPS) return -1; // clockwise\\n if (dot(b,c) < -EPS) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 2円の交点\\nVP crosspointCC(Point a, double ar, Point b, double br) {\\n VP ps;\\n Point ab = b-a;\\n double d = abs(ab);\\n double crL = (norm(ab) + ar*ar - br*br) / (2*d);\\n if (EQ(d, 0) || ar+EPS < abs(crL)) return ps;\\n\\n // 円が接する時、こことEPSの設定をうまくしないとsqrt(sub)がnanになるので注意\\n double sub = ar*ar - crL*crL;\\n if(EQ(sub,0)) sub = 0;\\n\\n Point abN = ab * Point(0, sqrt(sub) / d);\\n Point cp = a + crL/d * ab;\\n ps.push_back(cp + abN);\\n if (!EQ(norm(abN), 0)) ps.push_back(cp - abN);\\n return ps;\\n}\\n\\n// aからbへの回転角（中心(0,0)）[-pi,+pi]\\ndouble angle(Point a,Point b){\\n double t = arg(b)-arg(a);\\n while(t>+PI) t-=2*PI;\\n while(t<-PI) t+=2*PI;\\n return t;\\n}\\n\\ndouble solve(int n, double r){\\n VP c(n);\\n vector<double> cr(n);\\n rep(i,n){\\n int x,y;\\n scanf(\\\" %d %d %lf\\\", &x, &y, &cr[i]);\\n c[i] = Point(x,y);\\n }\\n\\n // 円iを含むために、中心が移動できる範囲\\n rep(i,n){\\n cr[i] = r - cr[i];\\n // dbg(cr[i]);\\n if( !LE(0,cr[i]) ) return 0;\\n }\\n\\n // どれかを内包する円は除去\\n vector<bool> inner(n);\\n rep(i,n){\\n rep(j,n)if(i!=j){\\n double D = abs(c[i]-c[j]);\\n if( LE(D+cr[i], cr[j]) ) inner[j] = true;\\n }\\n }\\n\\n VP tttc;\\n vector<double> tttr;\\n rep(i,n){\\n if(!inner[i]){\\n tttc.pb(c[i]);\\n tttr.pb(cr[i]);\\n }\\n }\\n\\n c = tttc;\\n cr = tttr;\\n n = c.size();\\n\\n if(n==1){\\n return (cr[0]+r)*2*PI;\\n }\\n\\n // n >= 2\\n // 円iと円jの交点を求める\\n using PPI = pair<Point,int>;\\n vector<vector<PPI>> cps(n);\\n\\n rep(i,n)rep(j,i){\\n VP cnd = crosspointCC(c[i], cr[i], c[j], cr[j]);\\n if(cnd.size() == 0){\\n // 交点がない時点で、2つを同時に包含できないのでおわり\\n return 0;\\n }\\n else if(cnd.size() == 1){\\n // 接するような円が見つかった時点で、その点にしか円はおけない\\n // 置けるなら半径rの円\\n bool ok = true;\\n Point op = cnd[0];\\n rep(k,n){\\n if( !LE(abs(c[k]-op), cr[k]) ) ok = false;\\n }\\n\\n if(ok) return r*2*PI;\\n else return 0;\\n }\\n\\n for(Point cp:cnd){\\n cps[i].pb({cp,j});\\n cps[j].pb({cp,i});\\n }\\n }\\n\\n // 偏角ソート\\n double ans = 0;\\n VP cand_pts;\\n rep(i,n){\\n vector<PPI> dat = cps[i];\\n int sz = dat.size();\\n\\n // (偏角, index)\\n using pd = pair<double,int>;\\n vector<pd> stmp(sz);\\n rep(j,sz){\\n double theta = atan2(dat[j].fi.Y-c[i].Y, dat[j].fi.X-c[i].X);\\n if( theta < -EPS ) theta = 2*PI + theta;\\n stmp[j] = {theta, j};\\n }\\n\\n sort(all(stmp));\\n\\n vector<double> cand_theta(sz);\\n vector<int> valid(sz,1);\\n rep(j,sz){\\n double add = stmp[(j+1)%sz].fi - stmp[j].fi;\\n if(add < -EPS) add += 2*PI;\\n add /= 2;\\n\\n cand_theta[j] = stmp[j].fi + add;\\n\\n Point cp = c[i]+polar(cr[i],cand_theta[j]);\\n // dbg(cp);\\n // この点がokかチェック\\n rep(k,n){\\n if( !LE(abs(c[k]-cp), cr[k]) ) valid[j] = 0;\\n }\\n\\n if(valid[j]){\\n double theta = stmp[(j+1)%sz].fi - stmp[j].fi;\\n if(theta < -EPS) theta += 2*PI;\\n\\n if(EQ(theta,0)) valid[j] = false;\\n else ans += theta * (r+cr[i]);\\n }\\n }\\n\\n // printf(\\\" --- %d \\\\n\\\",i);\\n // dbg(dat);\\n // dbg(stmp);\\n // dbg(valid);\\n\\n rep(j,sz){\\n if(valid[j]^valid[(j+1)%sz]){\\n int idx = stmp[(j+1)%sz].se;\\n cand_pts.pb(dat[idx].fi);\\n }\\n }\\n }\\n\\n int CPZ = cand_pts.size();\\n rep(i,CPZ){\\n bool ok = true;\\n rep(j,i){\\n double dist = abs(cand_pts[j] - cand_pts[i]);\\n if(EQ(dist,0)) ok = false;\\n }\\n if(!ok) continue;\\n // dbg(cand_pts[i]);\\n\\n double mx_angle = 0;\\n rep(ci,n)rep(cj,ci){\\n bool valid_pair = false;\\n\\n for(Point ppp:crosspointCC(c[ci],cr[ci],c[cj],cr[cj])){\\n double ddd = abs(ppp - cand_pts[i]);\\n if(EQ(ddd,0)) valid_pair = true;\\n }\\n\\n if(valid_pair){\\n Point center = cand_pts[i];\\n Point aaa = c[ci] - center;\\n Point bbb = c[cj] - center;\\n\\n mx_angle = max(mx_angle, abs(angle(aaa,bbb)));\\n }\\n }\\n\\n ans += mx_angle*r;\\n }\\n\\n return ans;\\n}\\n\\nint main(){\\n int n;\\n double r;\\n while( scanf(\\\" %d %lf\\\", &n, &r),n ){\\n printf(\\\"%.15f\\\\n\\\", solve(n,r));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -1.0195,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1323_2418386\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst int maxn=111;\\nint sgn(double x){return (x>eps)-(x<-eps);}\\nint sgn(double a,double b){return sgn(a-b);}\\ndouble sqr(double x){return x*x;}\\nstruct P{\\n\\tdouble x,y;\\n\\tP(){}\\n\\tP(double x,double y):x(x),y(y){}\\n\\tdouble len2(){\\n\\t\\treturn sqr(x)+sqr(y);\\n\\t}\\n\\tdouble len(){\\n\\t\\treturn sqrt(len2());\\n\\t}\\n\\tvoid print(){\\n\\t\\tprintf(\\\"(%.3f,%.3f)\\\\n\\\",x,y);\\n\\t}\\n\\tvoid read(){\\n\\t\\tscanf(\\\"%lf%lf\\\",&x,&y);\\n\\t}\\n\\tP turn90(){return P(-y,x);}\\n\\tP norm(){return P(x/len(),y/len());}\\n\\tP rot(double rad){\\n\\t\\treturn P(x*cos(rad)+y*sin(rad),x*sin(rad)-y*cos(rad));\\n\\t}\\n};\\nbool operator==(P a,P b){\\n\\treturn !sgn(a.x-b.x) and !sgn(a.y-b.y);\\n}\\nP operator+(P a,P b){\\n\\treturn P(a.x+b.x,a.y+b.y);\\n}\\nP operator-(P a,P b){\\n\\treturn P(a.x-b.x,a.y-b.y);\\n}\\nP operator*(P a,double b){\\n\\treturn P(a.x*b,a.y*b);\\n}\\nP operator/(P a,double b){\\n\\treturn P(a.x/b,a.y/b);\\n}\\ndouble operator^(P a,P b){\\n\\treturn a.x*b.x + a.y*b.y;\\n}\\ndouble operator*(P a,P b){\\n\\treturn a.x*b.y - a.y*b.x;\\n}\\ndouble det(P a,P b,P c){\\n\\treturn (b-a)*(c-a);\\n}\\ndouble dis(P a,P b){\\n\\treturn (b-a).len();\\n}\\ndouble Area(vector<P>poly){\\n\\tdouble ans=0;\\n\\tfor(int i=1;i<poly.size();i++)\\n\\t\\tans+=(poly[i]-poly[0])*(poly[(i+1)%poly.size()]-poly[0]);\\n\\treturn fabs(ans)/2;\\n}\\nstruct L{\\n\\tP a,b;\\n\\tL(){}\\n\\tL(P a,P b):a(a),b(b){}\\n\\tP v(){return b-a;}\\n};\\nbool onLine(P p,L l){\\n\\treturn sgn((l.a-p)*(l.b-p))==0;\\n}\\nbool onSeg(P p,L s){\\n\\treturn onLine(p,s) and sgn((s.b-s.a)^(p-s.a))>=0 and sgn((s.a-s.b)^(p-s.b))>=0;\\n}\\nbool parallel(L l1,L l2){\\n\\treturn sgn(l1.v()*l2.v())==0;\\n}\\nP intersect(L l1,L l2){\\n\\tdouble s1=det(l1.a,l1.b,l2.a);\\n\\tdouble s2=det(l1.a,l1.b,l2.b);\\n\\treturn (l2.a*s2-l2.b*s1)/(s2-s1);\\n}\\nP project(P p,L l){\\n\\treturn l.a+l.v()*((p-l.a)^l.v())/l.v().len2();\\n}\\ndouble dis(P p,L l){\\n\\treturn fabs((p-l.a)*l.v())/l.v().len();\\n}\\nstruct C{\\n\\tP o;\\n\\tdouble r;\\n\\tC(){}\\n\\tC(P _o,double _r):o(_o),r(_r){}\\n\\tvoid read(){\\n\\t\\to.read();\\n\\t\\tscanf(\\\"%lf\\\",&r);\\n\\t}\\n}c[maxn];\\nbool operator<(C a,C b){\\n\\treturn a.r>b.r;\\n}\\nbool operator==(C c1,C c2){\\n\\treturn c1.o==c2.o && sgn(c1.r-c2.r)==0;\\n}\\ndouble fix(double x){return sgn(x)?x:0;}\\nbool intersect(C a, C b, P &p1, P &p2) { \\n\\tdouble s1 = (a.o - b.o).len();\\n\\tif (sgn(s1 - a.r - b.r) > 0 || sgn(s1 - fabs(a.r - b.r)) < 0) return false;\\n\\tdouble s2 = (a.r * a.r - b.r * b.r) / s1;\\n\\tdouble aa = (s1 + s2) * 0.5, bb = (s1 - s2) * 0.5;\\n\\tP o = (b.o - a.o) * (aa / (aa + bb)) + a.o;\\n\\tP delta = (b.o - a.o).norm().turn90() * sqrt(fix(a.r * a.r - aa * aa));\\n\\tp1 = o + delta, p2 = o - delta;\\n\\treturn true;\\n}\\nint n;\\ndouble r;\\n\\ndouble calcR(P O){\\n\\tdouble mxr=0;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tdouble ri=0;\\n\\t\\tri=dis(c[i].o,O)+c[i].r;\\n\\t\\tmxr=max(mxr,ri);\\n\\t}\\n\\treturn mxr;\\n}\\n\\nbool check(P O){\\n\\tdouble mxr=0;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tdouble ri=0;\\n\\t\\tri=dis(c[i].o,O)+c[i].r;\\n\\t\\tif(sgn(ri-r)>0)\\n\\t\\t\\treturn false;\\n\\t}\\n\\treturn true;\\n}\\nP O;\\nvector<P>vecO;\\nbool in(P p){\\n\\n\\tif(sgn(dis(p,O)-r)<=0)\\n\\t\\treturn true;\\n\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tC c1=c[i],c2;\\n\\t\\tc2.o=p;\\n\\t\\tc1.r=r-c1.r;\\n\\t\\tc2.r=r;\\n\\t\\tP p1,p2;\\n\\t\\tif(c1==c2||!intersect(c1,c2,p1,p2))\\n\\t\\t\\tcontinue;\\n\\t\\tif(check(p1)||check(p2))\\n\\t\\t\\treturn true;\\n\\t}\\n\\n\\treturn false;\\n}\\nP at(P O,P dir){\\n\\tdir=dir.norm();\\n\\tdouble l=::r,r=20000;\\n\\twhile(r-l>1e-9){\\n\\t\\tdouble mid=(l+r)/2;\\n\\t\\tif(in(O+dir*mid))\\n\\t\\t\\tl=mid;\\n\\t\\telse r=mid;\\n\\t}\\n\\treturn O+dir*l;\\n}\\ndouble calc(P a,P b,P c){\\n\\t\\n\\tL l1,l2;\\n\\tl1.a=(a+b)/2;\\n\\tl1.b=l1.a+(b-a).turn90();\\n\\t\\n\\tl2.a=(b+c)/2;\\n\\tl2.b=l2.a+(b-c).turn90();\\n\\t\\n\\t\\n\\t\\n\\t\\n\\tif(parallel(l1,l2))\\n\\t\\treturn dis(a,c);\\n\\t\\n\\tP O=intersect(l1,l2);\\n\\tdouble r=dis(O,a);\\n\\t\\n\\t\\n\\tdouble theta;\\n\\ttheta = acos(((c-O)^(a-O))/r/r);\\n\\t\\n\\treturn r*theta;\\t\\n}\\ndouble calc(double l,double r){\\n\\t\\n\\tdouble p=0.45;\\n\\n\\tdouble m=l+(r-l)*p;\\n\\t\\n\\tP pl=at(O,P(1,0).rot(l));\\n\\tP pm=at(O,P(1,0).rot(m));\\n\\tP pr=at(O,P(1,0).rot(r));\\n\\t\\n\\treturn calc(pl,pm,pr);\\n\\t\\n}\\ndouble simpl(double l,double r){\\n\\tdouble mid=(l+r)/2;\\n\\t\\n\\t\\n\\tdouble Sl=calc(l,mid);\\n\\tdouble Sr=calc(mid,r);\\n\\tdouble S=calc(l,r);\\n\\t\\n\\tif(sgn(S-Sl-Sr)==0)\\n\\t\\treturn S;\\n\\treturn simpl(l,mid)+simpl(mid,r);\\n}\\n\\nint main(){\\n\\twhile(scanf(\\\"%d%lf\\\",&n,&r)&&n){\\n\\t\\tvecO.clear();\\n\\t\\tfor(int i=1;i<=n;i++){\\n\\t\\t\\tc[i].read();\\n\\t\\t}\\n\\t\\t\\n\\t\\tsort(c+1,c+1+n);\\n\\t\\t\\n\\t\\tint m=0;\\n\\t\\tstatic C nC[maxn];\\n\\t\\tnC[++m]=c[1];\\n\\t\\tfor(int i=2;i<=n;i++){\\n\\t\\t\\tint flag=0;\\n\\t\\t\\tfor(int j=1;j<=m;j++){\\n\\t\\t\\t\\tdouble d=dis(c[i].o,nC[j].o);\\n\\t\\t\\t\\tif(sgn(d-(nC[j].r-c[i].r))<=0){\\n\\t\\t\\t\\t\\tflag=1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!flag){\\n\\t\\t\\t\\tnC[++m]=c[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tn=m;\\n\\t\\tfor(int i=1;i<=n;i++)\\n\\t\\t\\tc[i]=nC[i];\\n\\t\\t\\t\\n\\t\\tif(n==1){\\n\\t\\t\\n\\t\\t\\tif(sgn(c[1].r-r)<=0){\\n\\t\\t\\t\\tprintf(\\\"%.8f\\\\n\\\",2*pi*(r*2-c[1].r));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tputs(\\\"0.0\\\");\\n\\t\\t\\t}\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint flag=0;\\n\\t\\tfor(int i=1;i<=n;i++)\\n\\t\\tfor(int j=i+1;j<=n;j++){\\n\\t\\t\\tC c1=c[i],c2=c[j];\\n\\t\\t\\tdouble d=dis(c[i].o,c[j].o);\\n\\t\\t\\tc1.r=r-c1.r;\\n\\t\\t\\tc2.r=r-c2.r;\\n\\t\\t\\tP p1,p2;\\n\\t\\t\\tif(c1==c2||!intersect(c1,c2,p1,p2))\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\n\\t\\t\\tif(sgn(calcR(p1)-r)<=0){\\n\\t\\t\\t\\tvecO.push_back(p1);\\n\\t\\t\\t}\\n\\t\\t\\tif(sgn(calcR(p2)-r)<=0){\\n\\t\\t\\t\\tvecO.push_back(p2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(vecO.empty()){\\n\\t\\t\\tputs(\\\"0.0\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t//cerr<<n<<endl;\\n\\t\\tO=vecO.front();\\n\\t\\t\\n\\t\\tdouble ans=0;\\n\\t\\tans+=simpl(0,pi);\\n\\t\\tans+=simpl(pi,pi*2);\\n\\t\\tprintf(\\\"%.8f\\\\n\\\",ans);\\n\\t\\t\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -1.9162,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1323_1592121\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<math.h>\\n#include<vector>\\nusing namespace std;\\nconst double EPS = 1e-10;\\nconst double INF = 1e+10;\\nconst double PI = acos(-1);\\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\\ninline double ABS(double a){return max(a,-a);}\\nstruct Pt {\\n\\tdouble x, y;\\n\\tPt() {}\\n\\tPt(double x, double y) : x(x), y(y) {}\\n\\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }\\n\\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }\\n\\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\tPt operator-() const { return Pt(-x, -y); }\\n\\tPt operator*(const double &k) const { return Pt(x * k, y * k); }\\n\\tPt operator/(const double &k) const { return Pt(x / k, y / k); }\\n\\tdouble ABS() const { return sqrt(x * x + y * y); }\\n\\tdouble abs2() const { return x * x + y * y; }\\n\\tdouble arg() const { return atan2(y, x); }\\n\\tdouble dot(const Pt &a) const { return x * a.x + y * a.y; }\\n\\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\\n};\\ndouble tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }\\npair<Pt,Pt> pCC(Pt a, double r, Pt b, double s) {\\n\\tdouble d = (b - a).ABS();\\n\\tdouble x = (d * d + r * r - s * s) / (d * 2);\\n\\tPt e = (b - a) / d, w = e * Pt(0, 1) * sqrt(max(r * r - x * x, 0.0));\\n\\treturn make_pair(a + e * x - w, a + e * x + w);\\n}\\nint iCC(Pt a, double r, Pt b, double s) {\\n\\tdouble d = (b - a).ABS();\\n\\tif (sig(d) == 0 && sig(r - s) == 0) return -1; // correspond\\n\\tif (sig(r - s - d) > 0) return +2; // r > s\\n\\tif (sig(s - r - d) > 0) return -2; // s > r\\n\\treturn (sig(r + s - d) >= 0) ? 1 : 0;\\n}\\nPt c[110];\\ndouble r[110];\\nvector<Pt> p[110];\\nvector<pair<int,int> > tp;\\nint v[11100];\\ndouble ad[110][110];\\nint main(){\\n\\tint a;\\n\\tdouble b;\\n\\twhile(scanf(\\\"%d%lf\\\",&a,&b),a){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tdouble x,y;\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",&x,&y,r+i);\\n\\t\\t\\tc[i]=Pt(x,y);\\n\\t\\t}\\n\\t\\tfor(int i=0;i<11100;i++)v[i]=0;\\n\\t\\tfor(int i=0;i<a;i++)p[i].clear();\\n\\t\\ttp.clear();\\n\\t\\tbool dame=false;\\n\\t\\tfor(int i=0;i<a;i++)if(r[i]>b+EPS)dame=true;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=i+1;j<a;j++){\\n\\t\\t\\t\\tif(iCC(c[i],b-r[i],c[j],b-r[j])==0)dame=true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(dame){printf(\\\"0.0\\\\n\\\");continue;}\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\\n\\t\\t\\tif(iCC(c[i],b-r[i],c[j],b-r[j])==1){\\n\\t\\t\\t\\tpair<Pt,Pt> t=pCC(c[i],b-r[i],c[j],b-r[j]);\\n\\t\\t\\t\\tp[i].push_back(t.first);\\n\\t\\t\\t\\tp[i].push_back(t.second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tint n=p[i].size();\\n\\t\\t\\tif(n==0){\\n\\t\\t\\t\\tp[i].push_back(c[i]+Pt(cos(1),sin(1)));\\n\\t\\t\\t\\tp[i].push_back(c[i]+Pt(cos(1),sin(1)));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\t\\t\\tfor(int k=0;k<n-1;k++){\\n\\t\\t\\t\\t\\t\\tif((p[i][k]-c[i]).arg()>(p[i][k+1]-c[i]).arg()){\\n\\t\\t\\t\\t\\t\\t\\tswap(p[i][k],p[i][k+1]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp[i].push_back(p[i][0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdouble ret=0;\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<p[i].size()-1;j++){\\n\\t\\t\\tif(p[i].size()>2&&(p[i][j]-p[i][j+1]).ABS()<EPS)continue;\\n\\t\\t\\tdouble th=((p[i][j]-c[i]).arg()+(p[i][j+1]-c[i]).arg()+((j==p[i].size()-2)?PI*2:0))/2;\\n\\t\\t\\tPt t=c[i]+Pt(cos(th),sin(th))*(b-r[i]);\\n\\t\\t\\tbool ok=true;\\n\\t\\t\\tfor(int k=0;k<a;k++){\\n\\t\\t\\t\\tif((t-c[k]).ABS()>b-r[k]+EPS){ok=false;break;}\\n\\t\\t\\t}\\n\\t\\t\\tif(ok){\\n\\t\\t\\t//\\tprintf(\\\"%f %f %f %f\\\\n\\\",p[i][j].x,p[i][j].y,p[i][j+1].x,p[i][j+1].y);\\n\\t\\t\\t\\tret+=(b*2-r[i])*(((j==p[i].size()-2)?PI*2:0)+(p[i][j+1]-c[i]).arg()-(p[i][j]-c[i]).arg());\\n\\t\\t\\t\\ttp.push_back(make_pair(i,j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint sz=tp.size();\\n\\t\\tint at=0;\\n\\t\\tint prev=-1;\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<a;j++){\\n\\t\\t\\tif(iCC(c[i],b-r[i],c[j],b-r[j])==1){\\n\\t\\t\\t\\tpair<Pt,Pt> t=pCC(c[i],b-r[i],c[j],b-r[j]);\\n\\t\\t\\t\\tdouble th=(t.first-c[j]).arg()-(t.first-c[i]).arg();\\n\\t\\t\\t\\tif(th<0)th+=2*PI;\\n\\t\\t\\t\\tif(th>PI)th=2*PI-th;\\n\\t\\t\\t\\tad[i][j]=th*b;\\n//\\t\\t\\t\\tprintf(\\\"%d %d: %f\\\\n\\\",i,j,ad[i][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<sz;i++){\\n\\t\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\t\\tif(at==j||(prev==j&&sz>2))continue;\\n\\t\\t\\t\\tbool ok=false;\\n\\t\\t\\t\\tif((p[tp[at].first][tp[at].second]-p[tp[j].first][tp[j].second]).ABS()<EPS)ok=true;\\n\\t\\t\\t\\tif((p[tp[at].first][tp[at].second+1]-p[tp[j].first][tp[j].second]).ABS()<EPS)ok=true;\\n\\t\\t\\t\\tif((p[tp[at].first][tp[at].second]-p[tp[j].first][tp[j].second+1]).ABS()<EPS)ok=true;\\n\\t\\t\\t\\tif((p[tp[at].first][tp[at].second+1]-p[tp[j].first][tp[j].second+1]).ABS()<EPS)ok=true;\\n\\t\\t\\t\\tif(ok){\\n\\t\\t\\t\\t\\tret+=ad[tp[at].first][tp[j].first];\\n\\t\\t\\t\\t//\\tprintf(\\\"%d %d\\\\n\\\",tp[at].first,tp[j].first);\\n\\t\\t\\t//\\t\\tprintf(\\\"%f\\\\n\\\",ret);\\n\\t\\t\\t\\t\\tprev=at;at=j;break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%.12f\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 1668,\n \"score_of_the_acc\": -0.6509,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1323_1568438\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<complex>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\ntypedef double Real;\\ntypedef complex<Real> Point;\\n\\nconst Real PI=acos(-1.0);\\nconst Real eps=1e-8;\\n\\ntemplate<class T> bool eq(T a, T b){\\n\\treturn abs(a-b)<eps;\\n}\\n\\ntemplate<class T> int sgn(T a){\\n\\tif(eq(a,(T)0)) return 0;\\n\\tif(a>0) return 1;\\n\\treturn -1;\\n}\\n\\nstruct Circle:vector<Real> {\\n\\tPoint c;\\n\\tReal r;\\n\\tCircle(){}\\n\\tCircle(Point c,Real r):c(c),r(r){}\\n};\\n\\nReal R;\\nCircle cs[110];\\nint N;\\n\\nPoint getPolar(Point c,Point r,Real ang){\\n\\treturn c+r*Point(cos(ang),sin(ang));\\n}\\n\\nReal normalize(Real x){\\n\\twhile(x<-PI) x+=PI*2;\\n\\twhile(x>PI) x-=PI*2;\\n\\treturn x;\\n}\\n\\nReal arg(Point p){\\n\\treturn atan2(p.imag(),p.real());\\n}\\n\\nvoid iCC(Circle &c,Circle &c2){\\n\\tif(eq(c.c,c2.c)) return;\\n\\tReal d=abs(c.c-c2.c);\\n\\tReal r=c.r,r2=c2.r;\\n\\tif(sgn(d-(r+r2))>0) return;\\n\\telse if(sgn(d-(r+r2))==0){//out tan\\n\\t\\tReal ang=normalize(arg(c2.c-c.c));\\n\\t\\tc.push_back(ang);\\n\\t}else if(sgn(d-abs(r-r2))>0){//inter two points\\n\\t\\tReal ang=arg(c2.c-c.c);\\n\\t\\tReal ang2=acos((r*r+d*d-r2*r2)/(2*r*d));\\n\\t\\tc.push_back(normalize(ang+ang2));\\n\\t\\tc.push_back(normalize(ang-ang2));\\n\\t}else if(sgn(d-abs(r-r2))==0){//in tan\\n\\t\\tif(r>r2){\\n\\t\\t\\tc.push_back(normalize(arg(c2.c-c.c)));\\n\\t\\t}else{\\n\\t\\t\\tc.push_back(normalize(-arg(c2.c-c.c)));\\n\\t\\t}\\n\\t}\\n\\telse{//contained\\n\\t\\treturn;\\n\\t}\\n}\\n\\nbool changeCircles(){\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tcs[i].r=R-cs[i].r;\\n\\t\\tif(cs[i].r<eps) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid getAllPoints(){\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tiCC(cs[i],cs[j]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tcs[i].push_back(0);\\n\\t\\tcs[i].push_back(PI);\\n\\t}\\n}\\n\\nbool checkValidity(Point p){\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tReal d=abs(p-cs[i].c);\\n\\t\\tif(sgn(d-cs[i].r)>0) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nReal calcLength(){\\n\\tReal len=0,ang_sum=0;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tsort(cs[i].begin(),cs[i].end());\\n\\t\\tfor(int j=0;j<cs[i].size();j++){\\n\\t\\t\\tReal ang1=cs[i][j];\\n\\t\\t\\tReal ang2=j+1==cs[i].size()?cs[i][0]+PI*2:cs[i][j+1];\\n\\t\\t\\tReal ang=(ang1+ang2)/2;\\n\\t\\t\\tPoint p=getPolar(cs[i].c,cs[i].r,ang);\\n\\t\\t\\tbool flg=checkValidity(p);\\n\\t\\t\\tif(flg){\\n\\t\\t\\t\\tlen+=(cs[i].r+R)*(ang2-ang1);\\n\\t\\t\\t\\tang_sum+=(ang2-ang1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(ang_sum<eps) return 0;\\n\\tReal len2=R*(PI*2-ang_sum);\\n\\tReal res=len+len2;\\n\\treturn res;\\n}\\n\\nvoid solve(){\\n\\tbool flg=changeCircles();\\n\\tif(flg==false){\\n\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\treturn;\\n\\t}\\n\\tgetAllPoints();\\n\\tReal ans=calcLength();\\n\\tprintf(\\\"%f\\\\n\\\",ans);\\n}\\n\\nvoid input(){\\n\\tint r;\\n\\tscanf(\\\"%d%d\\\",&N,&r);\\n\\tif(N==0) exit(0);\\n\\tR=r;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tint x,y,r;\\n\\t\\tscanf(\\\"%d%d%d\\\",&x,&y,&r);\\n\\t\\tcs[i].clear();\\n\\t\\tcs[i]=Circle(Point(x,y),r);\\n\\t}\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tinput();\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1392,\n \"score_of_the_acc\": -0.3644,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1323_1131796\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cmath>\\n#include<complex>\\n#include<vector>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nconst double eps=1e-9;\\nconst double PI=3.14159265358979323846264;\\n\\ntypedef complex<double> Point;\\ntypedef complex<double> Vector;\\n\\ntemplate<class T> bool eq(T a,T b){\\n\\treturn abs(a-b)<eps;\\n}\\n\\ndouble normalize(double ang){\\n\\twhile(ang<0) ang+=PI*2;\\n\\twhile(ang>PI*2) ang-=PI*2;\\n\\treturn ang;\\n}\\n\\nstruct Circle{\\n\\tPoint center;\\n\\tdouble r;\\n\\tvector<double> angles;//intersections\\n\\tCircle(){}\\n\\tCircle(Point p,double r):center(p),r(r){}\\n\\tbool isin(Point p){\\n\\t\\tdouble dis=abs(p-center);\\n\\t\\treturn r>dis||eq(r,dis);\\n\\t}\\n\\tbool isin(Circle c){\\n\\t\\tdouble d=abs(c.center-center)+c.r;\\n\\t\\treturn r>d;\\n\\t}\\n\\tPoint getPoint(double theta){\\n\\t\\treturn center+(Point(cos(theta),sin(theta))*r);\\n\\t}\\n\\tPoint onePoint(Circle c){\\n\\t\\tdouble dis=abs(c.center-center);\\n\\t\\tif(!eq(dis,r+c.r)){\\n\\t\\t\\treturn Point(NAN,NAN);\\n\\t\\t}\\n\\t\\tVector vec=c.center-center;\\n\\t\\treturn center+vec*(r/(r+c.r));\\n\\t}\\n\\tvoid add(Circle c){\\n\\t\\tdouble r2=c.r;\\n\\t\\tdouble d=abs(c.center-center);\\n\\t\\tif(r+r2<d) return;\\n\\t\\tdouble theta=acos((r*r+d*d-r2*r2)/(2.0*r*d));\\n\\t\\tVector vec=c.center-center;\\n\\t\\tdouble phi=atan2(vec.imag(),vec.real());\\n\\t\\tangles.push_back(normalize(phi+theta));\\n\\t\\tangles.push_back(normalize(phi-theta));\\n\\t}\\n\\tbool haveCommon(Circle c){\\n\\t\\tdouble d=abs(center-c.center);\\n\\t\\treturn d<r+c.r||eq(d,r+c.r);\\n\\t}\\n};\\n\\nvector<Circle> C;\\nvector<Circle> centerArea;\\nvector<Circle> circles;\\nint N,R;\\n\\nvoid solve(){\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tif(C[i].r>R){\\n\\t\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tif(C[i].r==R){\\n\\t\\t\\tbool flg=true;\\n\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\tif(i==j) continue;\\n\\t\\t\\t\\tif(C[i].isin(C[j])==false) flg=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(flg){\\n\\t\\t\\t\\tprintf(\\\"%.f\\\\n\\\",PI*2*R);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tcenterArea.push_back(Circle(C[i].center,R-C[i].r));\\n\\t}\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tbool flg=true;\\n\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tif(centerArea[i].isin(centerArea[j])){\\n\\t\\t\\t\\tflg=false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(flg) circles.push_back(centerArea[i]);\\n\\t}\\n\\tif(circles.size()==1){\\n\\t\\tprintf(\\\"%f\\\\n\\\",PI*2*(circles[0].r+R));\\n\\t\\treturn;\\n\\t}\\n\\tint M=circles.size();\\n\\tfor(int i=0;i<M;i++) for(int j=i+1;j<M;j++){\\n\\t\\tPoint pt=circles[i].onePoint(circles[j]);\\n\\t\\tif(isnan(pt.real())) continue;\\n\\t\\tbool flg=true;\\n\\t\\tfor(int k=0;k<M;k++){\\n\\t\\t\\tif(i==k||j==k) continue;\\n\\t\\t\\tif(circles[k].isin(pt)==false) flg=false;\\n\\t\\t}\\n\\t\\tif(flg){\\n\\t\\t\\tprintf(\\\"%f\\\\n\\\",PI*2*R);\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(int i=0;i<M;i++) for(int j=0;j<M;j++){\\n\\t\\tif(circles[i].haveCommon(circles[j])==false){\\n\\t\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<M;i++) for(int j=0;j<M;j++){\\n\\t\\tif(i==j) continue;\\n\\t\\tcircles[i].add(circles[j]);\\n\\t}\\n\\tdouble totalAng=0;\\n\\tdouble ans=0;\\n\\tfor(int i=0;i<M;i++){\\n\\t\\tCircle cur=circles[i];\\n\\t\\tsort(cur.angles.begin(),cur.angles.end());\\n\\t\\tfor(int j=0;j<cur.angles.size();j++){\\n\\t\\t\\tdouble a=cur.angles[j];\\n\\t\\t\\tdouble b;\\n\\t\\t\\tif(j+1==cur.angles.size()){\\n\\t\\t\\t\\tb=cur.angles[0]+PI*2;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tb=cur.angles[j+1];\\n\\t\\t\\t}\\n\\t\\t\\tdouble mid=(a+b)/2;\\n\\t\\t\\tPoint pt=cur.getPoint(mid);\\n\\t\\t\\tbool flg=true;\\n\\t\\t\\tfor(int k=0;k<M;k++){\\n\\t\\t\\t\\tif(circles[k].isin(pt)==false) flg=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(flg){\\n\\t\\t\\t\\tdouble curAng=b-a;\\n\\t\\t\\t\\tans+=(curAng*(R+cur.r));\\n\\t\\t\\t\\ttotalAng+=curAng;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(totalAng==0){\\n\\t\\tprintf(\\\"0.0\\\\n\\\");\\n\\t}else{\\n\\t\\tans+=(PI*2-totalAng)*R;\\n\\t\\tprintf(\\\"%f\\\\n\\\",ans);\\n\\t}\\n}\\n\\nvoid init(){\\n\\tC.clear();\\n\\tcenterArea.clear();\\n\\tcircles.clear();\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d%d\\\",&N,&R);\\n\\t\\tif(N==0&&R==0) break;\\n\\t\\tinit();\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tint x,y,r;\\n\\t\\t\\tscanf(\\\"%d%d%d\\\",&x,&y,&r);\\n\\t\\t\\tC.push_back(Circle(Point(x,y),r));\\n\\t\\t}\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1372,\n \"score_of_the_acc\": -0.3851,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1323_390973\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdio>\\n#include <cassert>\\nusing namespace std;\\n\\nconst double EPS=1e-8;\\n\\nstruct pt {\\n\\tdouble x,y;\\n\\tpt() {}\\n\\tpt(double x_, double y_) : x(x_), y(y_) {}\\n\\tpt operator + (const pt& p) const { return pt(x+p.x,y+p.y); }\\n\\tpt operator - (const pt& p) const { return pt(x-p.x,y-p.y); }\\n\\tdouble mod2() const { return x*x+y*y; }\\n\\tdouble mod() const { return sqrt(mod2()); }\\n\\tdouble arg() const { return atan2(y,x); }\\n\\tstatic pt polar(double r, double theta) { return pt(r*cos(theta),r*sin(theta)); }\\n\\tbool operator == (const pt& p) const { return x==p.x && y==p.y; }\\n\\tbool operator < (const pt& p) const { return false; }\\n};\\n\\nistream& operator >> (istream& i, pt& p) { return i >> p.x >> p.y; }\\n\\ntypedef vector<pt> VP;\\ntypedef vector<int> VI;\\ntypedef vector<double> VD;\\ntypedef pair<double,pt> PDP;\\ntypedef vector<PDP> VC;\\n\\ninline double sq(double x) { return x*x; }\\n\\nint main() {\\n\\tint n,R;\\n\\twhile(cin >> n >> R && n) {\\n\\t\\tdouble o=0;\\n\\t\\tdouble ret=0;\\n\\t\\tdouble rem=2*M_PI;\\n\\t\\tbool exists=false;\\n\\t\\tVC cc(n);\\n\\t\\tfor (int i=0;i<n;++i) {\\n\\t\\t\\tcin >> cc[i].second >> cc[i].first;\\n\\t\\t\\tcc[i].first=R-cc[i].first;\\n\\t\\t}\\n\\t\\tsort(cc.begin(),cc.end());\\n\\t\\tVP c;\\n\\t\\tVD r;\\n\\t\\tfor (int i=0;i<n;++i) {\\n\\t\\t\\tif (cc[i].first<0) goto res;\\n\\t\\t\\tfor (int j=0;j<i;++j) {\\n\\t\\t\\t\\tif ((cc[i].second-cc[j].second).mod2()<=sq(cc[i].first-cc[j].first)) goto redundant;\\n\\t\\t\\t}\\n\\t\\t\\tr.push_back(cc[i].first);\\n\\t\\t\\tc.push_back(cc[i].second);\\n\\t\\t\\tredundant:;\\n\\t\\t}\\n\\t\\tn=c.size();\\n\\t\\tfor (int i=0;i<n;++i) {\\n\\t\\t\\tVD alpha;\\n\\t\\t\\talpha.push_back(0);\\n\\t\\t\\talpha.push_back(2*M_PI);\\n\\t\\t\\tfor (int j=0;j<n;++j) {\\n\\t\\t\\t\\tif (j==i) continue;\\n\\t\\t\\t\\tpt v=c[j]-c[i];\\n\\t\\t\\t\\tif (v.mod2()>sq(r[i]+r[j])) goto res;\\n\\t\\t\\t\\tif (v.mod2()<sq(r[i]-r[j])) continue;\\n\\t\\t\\t\\tdouble theta=v.arg();\\n//\\t\\t\\t\\tcerr << (v.mod2()+sq(r[i])-sq(r[j])) << \\\" / \\\" << (2*v.mod()*r[i]) << endl;\\n\\t\\t\\t\\tdouble co=(v.mod2()+sq(r[i])-sq(r[j]))/(2*v.mod()*r[i]);\\n\\t\\t\\t\\t//assert(co>=-1);\\n\\t\\t\\t\\t//assert(co<=1);\\n\\t\\t\\t\\tif (co<-1) co=-1;\\n\\t\\t\\t\\tif (co>1) co=1;\\n\\t\\t\\t\\tdouble phi=acos(co);\\n//\\t\\t\\t\\tcerr << i << \\\" intersects with \\\" << j << \\\" at \\\" << theta-phi << \\\" and \\\" << theta+phi << endl;\\n\\t\\t\\t\\talpha.push_back(theta+phi-2*M_PI);\\n\\t\\t\\t\\talpha.push_back(theta+phi);\\n\\t\\t\\t\\talpha.push_back(theta+phi+2*M_PI);\\n\\t\\t\\t\\talpha.push_back(theta-phi-2*M_PI);\\n\\t\\t\\t\\talpha.push_back(theta-phi);\\n\\t\\t\\t\\talpha.push_back(theta-phi+2*M_PI);\\n\\t\\t\\t}\\n\\t\\t\\tsort(alpha.begin(),alpha.end());\\n\\t\\t\\tfor(int k=0;alpha[k]<2*M_PI;++k) {\\n\\t\\t\\t\\tif (alpha[k]<0) continue;\\n\\t\\t\\t\\tdouble delta=alpha[k+1]-alpha[k];\\n\\t\\t\\t\\tdouble beta=(alpha[k]+alpha[k+1])/2;\\n\\t\\t\\t\\tpt mid=c[i]+pt::polar(r[i],beta);\\n\\t\\t\\t\\tfor (int j=0;j<n;++j) {\\n\\t\\t\\t\\t\\tif ((mid-c[j]).mod()-EPS>r[j]) goto skip;\\n\\t\\t\\t\\t}\\n//\\t\\t\\t\\tcerr << \\\"added an interval \\\" << alpha[k] << \\\" -- \\\" << alpha[k+1] << \\\" at \\\" << i << \\\" w/radius \\\" << r[i]+R << endl;\\n\\t\\t\\t\\texists=true;\\n\\t\\t\\t\\tret+=(r[i]+R)*delta;\\n\\t\\t\\t\\trem-=delta;\\n\\t\\t\\t\\tskip:;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (exists) o=ret+R*rem;\\n\\t\\tres:\\n\\t\\tif (o) printf(\\\"%.3f\\\\n\\\",o);\\n\\t\\telse printf(\\\"0.0\\\\n\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":773,"cells":{"group_id":{"kind":"string","value":"aoj_1319_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nDriving an Icosahedral Rover\nAfter decades of fruitless efforts, one of the expedition teams of ITO (Intersolar Tourism Organization) finally found a planet that would surely provide one of the best tourist attractions\nwithin a ten light-year radius from our solar system. The most attractive feature of the planet,\nbesides its comfortable gravity and calm weather, is the area called\nMare Triangularis\n. Despite\nthe name, the area is not covered with water but is a great plane. Its unique feature is that it is\ndivided into equilateral triangular sections of the same size, called\ntrigons\n. The\ntrigons\nprovide\na unique impressive landscape, a must for tourism. It is no wonder the board of ITO decided\nto invest a vast amount on the planet.\nDespite the expected secrecy of the staff, the Society of Astrogeology caught this information\nin no time, as always. They immediately sent their president's letter to the Institute of Science\nand Education of the Commonwealth Galactica claiming that authoritative academic inspections\nwere to be completed before any commercial exploitation might damage the nature.\nFortunately, astrogeologists do not plan to practice all the possible inspections on all of the\ntrigons\n; there are far too many of them. Inspections are planned only on some characteristic\ntrigons\nand, for each of them, in one of twenty different scientific aspects.\nTo accelerate building this new tourist resort, ITO's construction machinery team has already succeeded in putting their brand-new\ninvention in practical use. It is a rover vehicle of the shape of an\nicosahedron\n, a regular polyhedron with twenty faces of equilateral triangles. \nThe machine is customized\nso that each of the twenty faces exactly fits each of the\ntrigons\n. \nControlling the high-tech\ngyromotor\ninstalled inside its body, the rover can roll onto one of the three\ntrigons\nneighboring the one its bottom is\non.\nFigure E.1: The Rover on Mare Triangularis\nEach of the twenty faces has its own function. The set of equipments installed on the bottom\nface touching the ground can be applied to the\ntrigon\nit is on. Of course, the rover was meant to accelerate construction of the luxury hotels to host rich interstellar travelers, but, changing\nthe installed equipment sets, it can also be used to accelerate academic inspections.\nYou are the driver of this rover and are asked to move the vehicle onto the\ntrigon\nspecified by\nthe leader of the scientific commission with the smallest possible steps. What makes your task\nmore difficult is that the designated face installed with the appropriate set of equipments has to\nbe the bottom. The direction of the rover does not matter.\nFigure E.2:The Coordinate System\nFigure E.3: Face Numbering\nThe\ntrigons\nof\nMare Triangularis\nare given two-dimensional coordinates as shown in Figure E.2.\nLike maps used for the Earth, the\nx\naxis is from the west to the east, and the\ny\naxis is from the\nsouth to the north. Note that all the trigons with its coordinates \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1319_10851601","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst int nt[20][3]={\n{5,1,4},\n{6,2,0},\n{7,3,1},\n{8,4,2},\n{9,0,3},\n{0,10,11},\n{1,11,12},\n{2,12,13},\n{3,13,14},\n{4,14,10},\n{15,5,9},\n{16,6,5},\n{17,7,6},\n{18,8,7},\n{19,9,8},\n{10,19,16},\n{11,15,17},\n{12,16,18},\n{13,17,19},\n{14,18,15}};\nconst int tx[2][3]={{0,1,-1},{0,-1,1}},ty[2][3]={{1,0,0},{-1,0,0}};\nmap<pair<pair<int,int>,pair<int,int> >,int> mp;\nqueue<pair<pair<int,int>,pair<int,int> > > q;\npair<pair<int,int>,pair<int,int> > t,tt;\n\nint main()\n{\n\tint x,y,k,p,tp,xx,yy,kk,pp,s,i;\n\tt=make_pair(make_pair(0,0),make_pair(0,0));\n\tmp[t]=0;\n\tq.push(t);\n\twhile(!q.empty())\n\t{\n\t\tt=q.front();\n\t\tq.pop();\n\t\tx=t.first.first;y=t.first.second;\n\t\tk=t.second.first;p=t.second.second;\n\t\ttp=(x+y)&1;\n\t\tfor(i=0;i<3;i++)\n\t\t{\n\t\t\txx=x+tx[tp][i];yy=y+ty[tp][i];\n\t\t\tkk=nt[k][(i+p)%3];\n\t\t\tfor(pp=0;pp<3;pp++)\n\t\t\t\tif(nt[kk][pp]==k)\n\t\t\t\t\tbreak;\n\t\t\tpp=(pp+3-i)%3;\n\t\t\tif(!mp.count(tt=make_pair(make_pair(xx,yy),make_pair(kk,pp)))||mp[t]+1<mp[tt])\n\t\t\t\tif((mp[tt]=mp[t]+1)<100)\n\t\t\t\t\tq.push(tt);\n\t\t}\n\t}\n\twhile(~scanf(\"%d%d%d\",&x,&y,&k)&&(x||y||k))\n\t{\n\t\ts=1<<30;\n\t\tfor(i=0;i<3;i++)\n\t\t\tif(mp.count(t=make_pair(make_pair(x,y),make_pair(k,i))))\n\t\t\t\ts=min(s,mp[t]);\n\t\tprintf(\"%d\\n\",s);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":850,"memory_kb":59832,"score_of_the_acc":-0.7079,"final_rank":15},{"submission_id":"aoj_1319_4865290","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,int> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nint next_num(int cur,int to){\n to%=3;\n if(to==0){\n if(cur%10<5)return cur+5;\n return cur-5;\n }\n if(cur<5)to=3-to;\n if(cur<5 || cur>=15){\n if(to==1){\n if(cur%5==0)cur+=5;\n return cur-1;\n }\n cur++;\n if(cur%5==0)cur-=5;\n return cur;\n }\n if(cur<10){\n if(to==1)return cur+5;\n cur+=6;\n if(cur==15)cur=10;\n return cur;\n }\n if(to==1)return cur-5;\n cur-=6;\n if(cur==4)cur=9;\n return cur;\n}\n\nP next_pos(P pos,int to){\n to%=3;\n int a=(to-1)*2-1;\n if((pos.first+pos.second+(1<<20))%2){\n if(to==0)return make_pair(pos.first,pos.second-1);\n return make_pair(pos.first+a,pos.second);\n }else{\n if(to==0)return make_pair(pos.first,pos.second+1);\n return make_pair(pos.first-a,pos.second);\n }\n}\n\nint dis[300][300][30][5];\nconst int N=150;\nqueue<tuple<P,int,P,int,int>> q1;//pos,num,bef_pos,bef_num,dis\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c;\n int s;\n int num;\n P pos,bef_pos,pos2;\n memset(dis,-1,sizeof(dis));\n q1.push(make_tuple(P(N,N),0,P(N,N+1),5,0));\n while(!q1.empty()){\n tie(pos,a,bef_pos,b,c)=q1.front();q1.pop();\n if(c>100)continue;\n for(i=0;i<3;i++){\n if(bef_pos==next_pos(pos,i))break;\n }\n for(j=0;j<3;j++){\n if(b==next_num(a,j))break;\n }\n b=(j-i+3)%3;\n if(dis[pos.first][pos.second][a][b]!=-1)continue;\n dis[pos.first][pos.second][a][b]=c;\n for(i=0;i<3;i++){\n pos2=next_pos(pos,i);\n num=next_num(a,i+b);\n q1.push(make_tuple(pos2,num,pos,a,c+1));\n }\n }\n while(cin>>a>>b>>c){\n if(a==0 && b==0 && c==0)break;\n a+=N,b+=N;\n s=1e3;\n for(i=0;i<3;i++){\n if(dis[a][b][c][i]!=-1)s=min(s,dis[a][b][c][i]);\n }\n cout<<s<<endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":57048,"score_of_the_acc":-0.5139,"final_rank":11},{"submission_id":"aoj_1319_4779930","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define NUM 20\n\nenum Type{\n\tUP,\n\tR_UP,\n\tR_DOWN,\n\tDOWN,\n\tL_DOWN,\n\tL_UP,\n};\n\nstruct Info{\n\tvoid set(int arg_next_center,int arg_next_state){\n\t\tnext_center = arg_next_center;\n\t\tnext_state = arg_next_state;\n\t}\n\tint next_center,next_state;\n};\n\nstruct State{\n\tState(int arg_center,int arg_state, int arg_x,int arg_y, int arg_sum_step){\n\t\tcenter = arg_center;\n\t\tstate = arg_state;\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tsum_step = arg_sum_step;\n\t}\n\tbool operator<(const struct State &arg) const{\n\n\t\treturn sum_step > arg.sum_step; //ステップの昇順(PQ)\n\t}\n\tint center,state,x,y,sum_step;\n};\n\nbool check[NUM][NUM];\nint base[NUM][6] = { {-1,4,-1,1,-1,5}, //0\n\t\t\t\t\t{-1,0,-1,2,-1,6}, //1\n\t\t\t\t\t{-1,1,-1,3,-1,7}, //2\n\t\t\t\t\t{-1,2,-1,4,-1,8}, //3\n\t\t\t\t\t{-1,3,-1,0,-1,9}, //4\n\t\t\t\t\t{-1,0,-1,11,-1,10}, //5\n\t\t\t\t\t{-1,1,-1,12,-1,11}, //6,\n\t\t\t\t\t{-1,2,-1,13,-1,12}, //7\n\t\t\t\t\t{-1,3,-1,14,-1,13}, //8\n\t\t\t\t\t{-1,4,-1,10,-1,14}, //9\n\t\t\t\t\t{-1,9,-1,5,-1,15}, //10\n\t\t\t\t\t{-1,16,-1,5,-1,6}, //11\n\t\t\t\t\t{-1,7,-1,17,-1,6}, //12\n\t\t\t\t\t{-1,7,-1,8,-1,18}, //13\n\t\t\t\t\t{-1,9,-1,19,-1,8}, //14\n\t\t\t\t\t{-1,10,-1,16,-1,19}, //15\n\t\t\t\t\t{-1,11,-1,17,-1,15}, //16\n\t\t\t\t\t{-1,16,-1,12,-1,18}, //17\n\t\t\t\t\t{-1,17,-1,13,-1,19}, //18\n\t\t\t\t\t{-1,14,-1,15,-1,18}}; //19\n\nint STATES[NUM][6][6];\nint min_dist[210][210][NUM],work[210][210][NUM][6];\nInfo info[NUM][6][6];\nType type_array[6] = {UP,R_UP,R_DOWN,DOWN,L_DOWN,L_UP};\nType rev_type[6] = {DOWN,L_DOWN,L_UP,UP,R_UP,R_DOWN};\n\n\nint main(){\n\n\tfor(int i = 0; i < NUM; i++){\n\n\t\tfor(int k = 0; k < 6; k++){\n\n\t\t\tSTATES[i][0][k] = base[i][k];\n\t\t}\n\t\t//手で持って見た時の遷移\n\t\tfor(int k = 1; k <= 5; k++){\n\n\t\t\tSTATES[i][k][UP] = STATES[i][k-1][L_UP];\n\t\t\tSTATES[i][k][R_UP] = STATES[i][k-1][UP];\n\t\t\tSTATES[i][k][R_DOWN] = STATES[i][k-1][R_UP];\n\t\t\tSTATES[i][k][DOWN] = STATES[i][k-1][R_DOWN];\n\t\t\tSTATES[i][k][L_DOWN] = STATES[i][k-1][DOWN];\n\t\t\tSTATES[i][k][L_UP] = STATES[i][k-1][L_DOWN];\n\t\t}\n\t}\n\n\t//遷移表の作成\n\tfor(int from = 0; from < NUM; from++){ //遷移元の中央\n\t\tfor(int from_state = 0; from_state < 6; from_state++){\n\t\t\tfor(int a = 0; a < 6;a++){ //転がる方向\n\t\t\t\tType dir = type_array[a];\n\n\t\t\t\tif(STATES[from][from_state][dir] == -1){\n\n\t\t\t\t\tinfo[from][from_state][dir].set(-1,-1);\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tint to = STATES[from][from_state][dir];\n\t\t\t\tType next_type = rev_type[dir];\n\t\t\t\tfor(int b = 0; b < 6; b++){\n\t\t\t\t\tif(STATES[to][b][next_type] == from){\n\n\t\t\t\t\t\tinfo[from][from_state][dir].set(to,b);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint add_X = 100,add_Y = 100;\n\tfor(int i = 0; i < 210; i++){\n\t\tfor(int k = 0; k < 210; k++){\n\t\t\tfor(int a = 0; a < NUM; a++){\n\n\t\t\t\tmin_dist[i][k][a] = BIG_NUM;\n\t\t\t\tfor(int b = 0; b < 6; b++){\n\n\t\t\t\t\twork[i][k][a][b] = BIG_NUM;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tmin_dist[add_X][add_Y][0] = 0;\n\twork[add_X][add_Y][0][1] = 0;\n\tpriority_queue<State> Q;\n\tQ.push(State(0,1,0,0,0));\n\n\tint next_center,next_state,next_x,next_y,next_step;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_step == 100){\n\n\t\t\tQ.pop();\n\n\t\t}else if(Q.top().sum_step > work[Q.top().x+add_X][Q.top().y+add_Y][Q.top().center][Q.top().state]){\n\n\t\t\tQ.pop();\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < 6; i++){\n\t\t\t\tif(info[Q.top().center][Q.top().state][i].next_center == -1)continue;\n\n\t\t\t\tnext_center = info[Q.top().center][Q.top().state][i].next_center;\n\t\t\t\tnext_state = info[Q.top().center][Q.top().state][i].next_state;\n\n\t\t\t\tType dir = type_array[i];\n\t\t\t\tnext_x = Q.top().x;\n\t\t\t\tnext_y = Q.top().y;\n\n\t\t\t\tnext_step = Q.top().sum_step+1;\n\n\t\t\t\t//さいころの遷移は目で見た時と逆\n\t\t\t\tswitch(dir){\n\t\t\t\tcase UP:\n\t\t\t\t\tnext_y++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase L_UP:\n\t\t\t\t\tnext_x++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase L_DOWN:\n\t\t\t\t\tnext_x++;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase DOWN:\n\t\t\t\t\tnext_y--;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase R_DOWN:\n\t\t\t\t\tnext_x--;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase R_UP:\n\t\t\t\t\tnext_x--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif(work[next_x+add_X][next_y+add_Y][next_center][next_state] > next_step){\n\t\t\t\t\twork[next_x+add_X][next_y+add_Y][next_center][next_state] = next_step;\n\t\t\t\t\tmin_dist[next_x+add_X][next_y+add_Y][next_center] = min(min_dist[next_x+add_X][next_y+add_Y][next_center],next_step);\n\t\t\t\t\tQ.push(State(next_center,next_state,next_x,next_y,next_step));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tint tmp_x,tmp_y,tmp_center;\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d\",&tmp_x,&tmp_y,&tmp_center);\n\t\tif(tmp_x == 0 && tmp_y == 0 && tmp_center == 0)break;\n\n\t\tprintf(\"%d\\n\",min_dist[tmp_x+add_X][tmp_y+add_Y][tmp_center]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":27444,"score_of_the_acc":-0.2322,"final_rank":7},{"submission_id":"aoj_1319_3625408","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int inf = 1e9;\n\ntemplate<typename T>\nstd::vector<T> table(int n, T v) { return std::vector<T>(n, v); }\n\ntemplate <class... Args>\nauto table(int n, Args... args) {\n auto val = table(args...);\n return std::vector<decltype(val)>(n, std::move(val));\n}\n\nconstexpr int dx[3] = {1, 0, -1};\nconstexpr int dy[2][3] = {\n {0, 1, 0}, // (x + y) % 2 == 0\n {0, -1, 0}\n};\n\nconstexpr int df[20][2][3] = {\n {{1, 5, 4}, {4, 5, 1}},\n {{2, 6, 0}, {0, 6, 2}},\n {{3, 7, 1}, {1, 7, 3}},\n {{4, 8, 2}, {2, 8, 4}},\n {{0, 9, 3}, {3, 9, 0}},\n {{10, 0, 11}, {11, 0, 10}},\n {{11, 1, 12}, {12, 1, 11}},\n {{12, 2, 13}, {13, 2, 12}},\n {{13, 3, 14}, {14, 3, 13}},\n {{14, 4, 10}, {10, 4, 14}},\n {{5, 15, 9}, {9, 15, 5}},\n {{6, 16, 5}, {5, 16, 6}},\n {{7, 17, 6}, {6, 17, 7}},\n {{8, 18, 7}, {7, 18, 8}},\n {{9, 19, 8}, {8, 19, 9}},\n {{19, 10, 16}, {16, 10, 19}},\n {{15, 11, 17}, {17, 11, 15}},\n {{16, 12, 18}, {18, 12, 16}},\n {{17, 13, 19}, {19, 13, 17}},\n {{18, 14, 15}, {15, 14, 18}}\n};\nconstexpr int dd[3][2][3] = { // only used on 0, ..., 4, 15, ..., 19\n {{2, 0, 1}, {1, 0, 2}},\n {{1, 2, 0}, {0, 2, 1}},\n {{0, 1, 2}, {2, 1, 0}}\n};\n\nint main() {\n constexpr int max_x = 201, max_y = 102;\n constexpr int cx = 100, cy = 50;\n auto in_range = [] (int x, int y) {\n return 0 <= x && x < max_x && 0 <= y && y < max_y;\n };\n\n int gx, gy, n;\n while(cin >> gx >> gy >> n, gx | gy | n) {\n gx += cx, gy += cy;\n auto d = table(max_x, max_y, 20, 3, inf);\n d[cx][cy][0][0] = 0;\n queue<tuple<int, int, int, int>> que;\n que.emplace(cx, cy, 0, 0);\n int ans = inf;\n while(!que.empty()) {\n int x, y, f, dir; tie(x, y, f, dir) = que.front();\n que.pop();\n if(x == gx && y == gy && f == n) {\n ans = d[x][y][f][dir];\n break;\n }\n for(int i = 0; i < 3; ++i) {\n const int nx = x + dx[i], ny = y + dy[(x + y) & 1][i];\n int nf = 0, nd = 0;\n if((x + y) & 1) {\n nf = df[f][1][(i - dir + 3) % 3];\n } else {\n nf = df[f][0][(i + dir) % 3];\n }\n if((5 <= f && f < 15) || (5 <= nf && nf < 15)) {\n nd = dir;\n } else {\n nd = dd[dir][(x + y) & 1][i];\n }\n if(!in_range(nx, ny) || d[nx][ny][nf][nd] != inf) continue;\n d[nx][ny][nf][nd] = d[x][y][f][dir] + 1;\n que.emplace(nx, ny, nf, nd);\n }\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1750,"memory_kb":26416,"score_of_the_acc":-0.5912,"final_rank":13},{"submission_id":"aoj_1319_3228722","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nconst int N = 230;\nconst int A = 108;\n\nconst int INF = 19191919;\nconst int F = 20;\nint dp[N][N][F][F];\n\nstruct State{\n int x,y,b,s;\n};\n\nint nxt[20][3]={\n {5,1,4},\n {6,2,0},\n {7,3,1},\n {8,4,2},\n {9,0,3},\n {0,10,11}, //5\n {1,11,12},\n {2,12,13},\n {3,13,14},\n {4,14,10},\n {15,5,9}, //10\n {16,6,5},\n {17,7,6},\n {18,8,7},\n {19,9,8},\n {10,19,16}, //15\n {11,15,17},\n {12,16,18},\n {13,17,19},\n {14,18,15}\n};\n\nconst int dx[2][3]={{0,1,-1},{0,-1,1}};\nconst int dy[2][3]={{1,0,0},{-1,0,0}};\n\nconst int LIM = 100;\n\nint main(){\n rep(i,N)rep(j,N)rep(k,F)rep(l,F) dp[i][j][k][l] = INF;\n dp[A][A][0][5] = 0;\n queue<State> que;\n que.push({A,A,0,5});\n while(!que.empty()){\n State c = que.front();\n que.pop();\n if(dp[c.x][c.y][c.b][c.s]>=LIM) continue;\n\n // printf(\"NOW : %d %d %d %d ::: %d\\n\",c.x,c.y,c.b,c.s,dp[c.x][c.y][c.b][c.s]);\n\n int ad = 0;\n while(nxt[c.b][ad] != c.s) ++ad;\n\n int oe = (c.x+c.y)%2;\n rep(i,3){\n int nx = c.x+dx[oe][i], ny = c.y+dy[oe][i];\n if(!(0<=nx && nx<N && 0<=ny && ny<N)) continue;\n int noe = (nx+ny)%2;\n\n int nb = nxt[c.b][(i+ad)%3];\n int ns = -1;\n rep(j,3){\n int xx = nx+dx[noe][j], yy = ny+dy[noe][j];\n if(xx == c.x && yy == c.y){\n int idx = 0;\n while(nxt[nb][idx] != c.b) ++idx;\n\n idx = (idx-j+3)%3;\n ns = nxt[nb][idx];\n break;\n }\n }\n assert(ns != -1);\n\n // printf(\" nx %d :: %d %d %d %d\\n\",i,nx,ny,nb,ns);\n if(dp[nx][ny][nb][ns] > dp[c.x][c.y][c.b][c.s]+1){\n dp[nx][ny][nb][ns] = dp[c.x][c.y][c.b][c.s]+1;\n que.push({nx,ny,nb,ns});\n }\n }\n }\n\n int x,y,n;\n while(cin >>x >>y >>n){\n if(x==0 && y==0 && n==0) break;\n int ans = INF;\n rep(i,F) ans = min(ans, dp[x+A][y+A][n][i]);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":85876,"score_of_the_acc":-0.7793,"final_rank":16},{"submission_id":"aoj_1319_3057153","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <utility>\n#include <cstring>\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpi;\n\nstruct info{\n int x,y,b,t;\n int step;\n bool isEven;\n info(int x, int y, int b, int t, int s, bool e):x(x),y(y),b(b),t(t),step(s),isEven(e){}\n info(){}\n};\nbool used[203][103][20][20];\n\nint main(){\n vector<vector<vector<pii> > > next(20, vector<vector<pii> >(20));\n //next, 右左上\n //odd, 左右下\n next[0][1] = vpi{pii{4, 9}, pii{5, 10}, pii{1, 0}};\n next[0][4] = vpi{pii{5, 11}, pii{1, 6}, pii{4, 0}};\n next[0][5] = vpi{pii{1, 2}, pii{4, 3}, pii{5, 0}};\n next[1][0] = vpi{pii{6, 12}, pii{2, 7}, pii{0, 1}};\n next[1][2] = vpi{pii{0, 5}, pii{6, 11}, pii{2, 1}};\n next[1][6] = vpi{pii{2, 3}, pii{0, 4}, pii{6, 1}};\n next[2][1] = vpi{pii{7, 13}, pii{3, 8}, pii{1, 2}};\n next[2][3] = vpi{pii{1, 6}, pii{7, 12}, pii{3, 2}};\n next[2][7] = vpi{pii{3, 4}, pii{1, 0}, pii{7, 2}};\n next[3][2] = vpi{pii{8, 14}, pii{4, 9}, pii{2, 3}};\n next[3][4] = vpi{pii{2, 7}, pii{8, 13}, pii{4, 3}};\n next[3][8] = vpi{pii{4, 0}, pii{2, 1}, pii{8, 3}};\n next[4][0] = vpi{pii{3, 8}, pii{9, 14}, pii{0, 4}};\n next[4][3] = vpi{pii{9, 10}, pii{0, 5}, pii{3, 4}};\n next[4][9] = vpi{pii{0, 1}, pii{3, 2}, pii{9, 4}};\n next[5][0] = vpi{pii{10, 15}, pii{11, 16}, pii{0, 5}};\n next[5][10] = vpi{pii{11, 6}, pii{0, 1}, pii{10, 5}};\n next[5][11] = vpi{pii{0, 4}, pii{10, 9}, pii{11, 5}};\n next[6][1] = vpi{pii{11, 16}, pii{12, 17}, pii{1, 6}};\n next[6][11] = vpi{pii{12, 7}, pii{1, 2}, pii{11, 6}};\n next[6][12] = vpi{pii{1, 0}, pii{11, 5}, pii{12, 6}};\n next[7][2] = vpi{pii{12, 17}, pii{13, 18}, pii{2, 7}};\n next[7][12] = vpi{pii{13, 8}, pii{2, 3}, pii{12, 7}};\n next[7][13] = vpi{pii{2, 1}, pii{12, 6}, pii{13, 7}};\n next[8][3] = vpi{pii{13, 18}, pii{14, 19}, pii{3, 8}};\n next[8][13] = vpi{pii{14, 9}, pii{3, 4}, pii{13, 8}};\n next[8][14] = vpi{pii{3, 2}, pii{13, 7}, pii{14, 8}};\n next[9][4] = vpi{pii{14, 19}, pii{10, 15}, pii{4, 9}};\n next[9][10] = vpi{pii{4, 3}, pii{14, 8}, pii{10, 9}};\n next[9][14] = vpi{pii{10, 5}, pii{4, 0}, pii{14, 9}};\n next[10][5] = vpi{pii{9, 14}, pii{15, 19}, pii{5, 10}};\n next[10][9] = vpi{pii{15, 16}, pii{5, 11}, pii{9, 10}};\n next[10][15] = vpi{pii{5, 0}, pii{9, 4}, pii{15, 10}};\n next[11][5] = vpi{pii{16, 17}, pii{6, 12}, pii{5, 11}};\n next[11][6] = vpi{pii{5, 10}, pii{16, 15}, pii{6, 11}};\n next[11][16] = vpi{pii{6, 1}, pii{5, 0}, pii{16, 11}};\n next[12][6] = vpi{pii{17, 18}, pii{7, 13}, pii{6, 12}};\n next[12][7] = vpi{pii{6, 11}, pii{17, 16}, pii{7, 12}};\n next[12][17] = vpi{pii{7, 2}, pii{6, 1}, pii{17, 12}};\n next[13][7] = vpi{pii{18, 19}, pii{8, 14}, pii{7, 13}};\n next[13][8] = vpi{pii{7, 12}, pii{18, 17}, pii{8, 13}};\n next[13][18] = vpi{pii{8, 3}, pii{7, 2}, pii{18, 13}};\n next[14][8] = vpi{pii{19, 15}, pii{9, 10}, pii{8, 14}};\n next[14][9] = vpi{pii{8, 13}, pii{19, 18}, pii{9, 14}};\n next[14][19] = vpi{pii{9, 4}, pii{8, 3}, pii{19, 14}};\n next[15][10] = vpi{pii{19, 18}, pii{16, 17}, pii{10, 15}};\n next[15][16] = vpi{pii{10, 9}, pii{19, 14}, pii{16, 15}};\n next[15][19] = vpi{pii{16, 11}, pii{10, 5}, pii{19, 15}};\n next[16][11] = vpi{pii{15, 19}, pii{17, 18}, pii{11, 16}};\n next[16][15] = vpi{pii{17, 12}, pii{11, 6}, pii{15, 16}};\n next[16][17] = vpi{pii{11, 5}, pii{15, 10}, pii{17, 16}};\n next[17][12] = vpi{pii{16, 15}, pii{18, 19}, pii{12, 17}};\n next[17][16] = vpi{pii{18, 13}, pii{12, 7}, pii{16, 17}};\n next[17][18] = vpi{pii{12, 6}, pii{16, 11}, pii{18, 17}};\n next[18][13] = vpi{pii{17, 16}, pii{19, 15}, pii{13, 18}};\n next[18][17] = vpi{pii{19, 14}, pii{13, 8}, pii{17, 18}};\n next[18][19] = vpi{pii{13, 7}, pii{17, 12}, pii{19, 18}};\n next[19][14] = vpi{pii{18, 17}, pii{15, 16}, pii{14, 19}};\n next[19][15] = vpi{pii{14, 8}, pii{18, 13}, pii{15, 19}};\n next[19][18] = vpi{pii{15, 10}, pii{14, 9}, pii{18, 19}};\n\n while(1){\n int tx,ty,n;\n cin >> tx >> ty >> n;\n if(tx==0 && ty==0 && n==0) break;\n\n memset(used, 0, sizeof(used));\n queue<info> wait;\n wait.push(info(0, 0, 0, 5, 0, true));\n used[101][51][0][5] = true;\n int ans = -1;\n while(!wait.empty()){\n int x = wait.front().x;\n int y = wait.front().y;\n int b = wait.front().b;\n int t = wait.front().t;\n int step = wait.front().step;\n int isEven = wait.front().isEven;\n wait.pop();\n if(x == tx && y == ty && b == n){\n ans = step;\n break;\n }\n int dx[3], dy[3];\n if(isEven){\n dx[0] = 1; dx[1] = -1; dx[2] = 0;\n dy[0] = 0; dy[1] = 0; dy[2] = 1;\n }else{\n dx[0] = -1; dx[1] = 1; dx[2] = 0;\n dy[0] = 0; dy[1] = 0; dy[2] = -1;\n }\n for(int i=0; i<3; i++){\n int nx = x +dx[i];\n int ny = y +dy[i];\n int nb = next[b][t][i].first;\n int nt = next[b][t][i].second;\n if(used[nx+101][ny+51][nb][nt]) continue;\n used[nx+101][ny+51][nb][nt] = true;\n wait.push(info(nx, ny, nb, nt, step+1, !isEven));\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":11556,"score_of_the_acc":-0.1507,"final_rank":4},{"submission_id":"aoj_1319_2938738","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntypedef pair<Int, Int> P;\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\nvector<vector<P> > nx\n{\n {P(0,5),P(1,6),P(2,7),P(3,8),P(4,9)},\n {P(0,1),P(4,3),P(9,14),P(10,15),P(5,11)},\n {P(0,4),P(5,10),P(11,16),P(6,12),P(1,2)},\n {P(1,0),P(6,11),P(12,17),P(7,13),P(2,3)},\n {P(2,1),P(7,12),P(13,18),P(8,14),P(3,4)},\n {P(3,2),P(8,13),P(14,19),P(9,10),P(4,0)},\n {P(5,0),P(10,9),P(15,19),P(16,17),P(11,6)},\n {P(6,1),P(11,5),P(16,15),P(17,18),P(12,7)},\n {P(7,2),P(12,6),P(17,16),P(18,19),P(13,8)},\n {P(8,3),P(13,7),P(18,17),P(19,15),P(14,9)},\n {P(9,4),P(14,8),P(19,18),P(15,16),P(10,5)},\n {P(15,10),P(19,14),P(18,13),P(17,12),P(16,11)}\n};\n\nsigned char dp[203][203][21][21][6];\nstruct st{\n Int y,x,n,m,d;\n st(Int y,Int x,Int n,Int m,Int d):y(y),x(x),n(n),m(m),d(d){}\n};\nconst Int CC = 101;\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n {\n memset(dp,-1,sizeof(dp));\n queue<st> q;\n dp[CC][CC][0][5][0]=0;\n q.emplace(CC,CC,0,5,0);\n Int dyl[6]={0,0,1,0,0,-1};\n Int dxl[6]={-1,-1,0,1,1,0};\n Int dyr[6]={0,-1,0,0,1,0};\n Int dxr[6]={1,0,-1,-1,0,1};\n Int dyo[6]={1,0,0,-1,0,0}; \n Int dxo[6]={0,1,1,0,-1,-1};\n\n auto push=[&](st a,st b){\n if(~dp[a.y][a.x][a.n][a.m][a.d]) return;\n dp[a.y][a.x][a.n][a.m][a.d]=dp[b.y][b.x][b.n][b.m][b.d]+1;\n q.emplace(a);\n };\n \n while(!q.empty()){\n st s=q.front();q.pop();\n if(dp[s.y][s.x][s.n][s.m][s.d]>100) break;\n \n Int k=0,l=0;\n for(Int i=0;i<12;i++)\n\tfor(Int j=0;j<5;j++)\n\t if(nx[i][j]==P(s.n,s.m)) k=i,l=j;\n \n //cout<<k<<\" \"<<l<<endl;\n \n {// L\n\tst t=s;\n\tt.y+=dyl[s.d];\n\tt.x+=dxl[s.d];\n\ttie(t.n,t.m)=nx[k][(l+4)%5];\n\tt.d=(s.d+5)%6;\t\n\tpush(t,s);\n }\n {// R\n\tst t=s;\n\tt.y+=dyr[s.d];\n\tt.x+=dxr[s.d];\n\ttie(t.n,t.m)=nx[k][(l+1)%5];\n\tt.d=(s.d+1)%6;\t\n\tpush(t,s);\n }\n {// O\n\tst t=s;\n\tt.y+=dyo[s.d];\n\tt.x+=dxo[s.d];\n\tswap(t.n,t.m);\n\tt.d=(s.d+3)%6;\t\n\tpush(t,s);\n }\n }\n \n \n }\n \n \n {\n Int x,y,n;\n while(cin>>x>>y>>n,x||y||n){\n short ans=101;\n x+=CC;y+=CC;\n for(Int i=0;i<20;i++){\n\tfor(Int j=0;j<6;j++){\n\t if(dp[y][x][n][i][j]<0) continue;\n\t chmin(ans,dp[y][x][n][i][j]);\n\t}\n }\n cout<<ans<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":109956,"score_of_the_acc":-1.0177,"final_rank":18},{"submission_id":"aoj_1319_2936600","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nunsigned char dp[205][205][20][20]; // dp zyanai kedo\n\nint even[20][3]={\n {5,4,1},\n {6,0,2},\n {7,1,3},\n {8,2,4},\n {9,3,0},\n {0,11,10},\n {1,12,11},\n {2,13,12},\n {3,14,13},\n {4,10,14},\n {15,9,5},\n {16,5,6},\n {17,6,7},\n {18,7,8},\n {19,8,9},\n {10,16,19},\n {11,17,15},\n {12,18,16},\n {13,19,17},\n {14,15,18}\n};\nint odd[20][3]={\n {5,4,1},\n {6,0,2},\n {7,1,3},\n {8,2,4},\n {9,3,0},\n {0,11,10},\n {1,12,11},\n {2,13,12},\n {3,14,13},\n {4,10,14},\n {15,9,5},\n {16,5,6},\n {17,6,7},\n {18,7,8},\n {19,8,9},\n {10,16,19},\n {11,17,15},\n {12,18,16},\n {13,19,17},\n {14,15,18}\n};\nint odx[]={0,-1,1};\nint ody[]={-1,0,0};\nint edx[]={0,-1,1};\nint edy[]={1,0,0};\nvoid init(){\n for(int i=0;i<20;i++){\n swap(odd[i][1],odd[i][2]);\n }\n for(int i=0;i<205;i++)\n for(int j=0;j<205;j++)\n for(int k=0;k<20;k++)\n for(int l=0;l<20;l++)\n dp[i][j][k][l]=200;\n }\n\n struct point{\n int cost,x,y,muki,sita;\n };\n\n point A;\n\n void BFS(){\n A.sita=0;\n A.cost=0;\n A.muki=5;\n A.x=102;\n A.y=102;\n queue<point>q;\n q.push(A);\n dp[0][0][0][5]=0;\n while(!q.empty()){\n point P=q.front();q.pop();\n int y=P.y;\n int x=P.x;\n int muki=P.muki;\n int cost=P.cost;\n int sita=P.sita; //cout<<y<<' '<<x<<' '<<sita<<endl;\n //cout<<x-102<<' '<<y-120<<' '<<sita<<' '<<cost<<endl;\n //if(cost==5)return;\n\n\n if(cost%2){\n int k=0;\n for(int i=0;i<3;i++){\n if(odd[sita][i]==muki){\n k=i;\n break;\n }\n }//continue;\n for(int i=0;i<3;i++,k=(k+1)%3){\n int yy=y+ody[i];\n int xx=x+odx[i];\n if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;\n int nex_sita=odd[sita][k];\n int nex_muki=sita;\n int l=0;\n //if(cost==1&&x==101&&y==102)cout<<i<<' '<<sita<<' '<<nex_sita<<' '<<muki<<endl;\n for(int j=0;j<3;j++){\n if(even[nex_sita][j]==sita){\n l=j;\n break;\n }\n }\n if(i==0){\n nex_muki=sita;\n }\n else if(i==1){\n nex_muki=even[nex_sita][(l+1)%3];\n }\n else{\n nex_muki=even[nex_sita][(l+2)%3];\n }\n if(dp[yy][xx][nex_sita][nex_muki]!=200)continue;\n //if(cost==1&&x==101&&y==102)cout<<l<<' '<<nex_sita<<' '<<nex_muki<<endl;\n //if(cost==1&&xx==101&&yy==102&&cost==1)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\n dp[yy][xx][nex_sita][nex_muki]=cost+1;\n A.sita=nex_sita;\n A.cost=cost+1;\n A.muki=nex_muki;\n A.x=xx;\n A.y=yy;\n q.push(A);\n }\n }\n else{\n int k=0;\n for(int i=0;i<3;i++){\n if(even[sita][i]==muki){\n k=i;\n break;\n }\n }//continue;\n for(int i=0;i<3;i++,k=(k+1)%3){\n int yy=y+edy[i];\n int xx=x+edx[i];\n if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;\n int nex_sita=even[sita][k];\n int nex_muki=sita;\n int l=0;\n //if(cost==0&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\n for(int j=0;j<3;j++){\n if(odd[nex_sita][j]==sita){\n l=j;\n break;\n }\n }\n if(i==0){\n nex_muki=sita;\n }\n else if(i==1){\n nex_muki=odd[nex_sita][(l+1)%3];\n }\n else{\n nex_muki=odd[nex_sita][(l+2)%3];\n }\n if(dp[yy][xx][nex_sita][nex_muki]!=200)continue;\n //if(cost==0&&xx==101&&yy==102&&cost==0)cout<<\"even\"<<i<<' '<<l<<' '<<sita<<' '<<nex_sita<<' '<<nex_muki<<endl;\n //if(cost==2&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\n dp[yy][xx][nex_sita][nex_muki]=cost+1;\n A.sita=nex_sita;\n A.cost=cost+1;\n A.muki=nex_muki;\n A.x=xx;\n A.y=yy;\n q.push(A);\n }\n }\n }\n}\n\nsigned main(){\n int x,y,c;\n init();\n BFS();\n while(cin>>x>>y>>c){\n if(!x&&!y&&!c)break;\n x+=102;\n y+=102;\n int ans=1e9;\n for(int i=0;i<20;i++){\n ans=min(ans,(int)dp[y][x][c][i]);\n }\n cout<<ans<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":20116,"score_of_the_acc":-0.1631,"final_rank":5},{"submission_id":"aoj_1319_2936551","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntypedef pair<Int, Int> P;\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\nvector<vector<P> > nx\n{\n {P(0,5),P(1,6),P(2,7),P(3,8),P(4,9)},\n {P(0,1),P(4,3),P(9,14),P(10,15),P(5,11)},\n {P(0,4),P(5,10),P(11,16),P(6,12),P(1,2)},\n {P(1,0),P(6,11),P(12,17),P(7,13),P(2,3)},\n {P(2,1),P(7,12),P(13,18),P(8,14),P(3,4)},\n {P(3,2),P(8,13),P(14,19),P(9,10),P(4,0)},\n {P(5,0),P(10,9),P(15,19),P(16,17),P(11,6)},\n {P(6,1),P(11,5),P(16,15),P(17,18),P(12,7)},\n {P(7,2),P(12,6),P(17,16),P(18,19),P(13,8)},\n {P(8,3),P(13,7),P(18,17),P(19,15),P(14,9)},\n {P(9,4),P(14,8),P(19,18),P(15,16),P(10,5)},\n {P(15,10),P(19,14),P(18,13),P(17,12),P(16,11)}\n};\n\nsigned char dp[203][203][21][21][6];\nstruct st{\n Int y,x,n,m,d;\n st(Int y,Int x,Int n,Int m,Int d):y(y),x(x),n(n),m(m),d(d){}\n};\nconst Int CC = 101;\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n {\n memset(dp,-1,sizeof(dp));\n queue<st> q;\n dp[CC][CC][0][5][0]=0;\n q.emplace(CC,CC,0,5,0);\n Int dyl[6]={0,0,1,0,0,-1};\n Int dxl[6]={-1,-1,0,1,1,0};\n Int dyr[6]={0,-1,0,0,1,0};\n Int dxr[6]={1,0,-1,-1,0,1};\n Int dyo[6]={1,0,0,-1,0,0}; \n Int dxo[6]={0,1,1,0,-1,-1};\n\n auto push=[&](st a,st b){\n if(~dp[a.y][a.x][a.n][a.m][a.d]) return;\n dp[a.y][a.x][a.n][a.m][a.d]=dp[b.y][b.x][b.n][b.m][b.d]+1;\n q.emplace(a);\n };\n \n while(!q.empty()){\n st s=q.front();q.pop();\n if(dp[s.y][s.x][s.n][s.m][s.d]>100) break;\n \n Int k=0,l=0;\n for(Int i=0;i<12;i++)\n\tfor(Int j=0;j<5;j++)\n\t if(nx[i][j]==P(s.n,s.m)) k=i,l=j;\n \n //cout<<k<<\" \"<<l<<endl;\n \n {// L\n\tst t=s;\n\tt.y+=dyl[s.d];\n\tt.x+=dxl[s.d];\n\ttie(t.n,t.m)=nx[k][(l+4)%5];\n\tt.d=(s.d+5)%6;\t\n\tpush(t,s);\n }\n {// R\n\tst t=s;\n\tt.y+=dyr[s.d];\n\tt.x+=dxr[s.d];\n\ttie(t.n,t.m)=nx[k][(l+1)%5];\n\tt.d=(s.d+1)%6;\t\n\tpush(t,s);\n }\n {// O\n\tst t=s;\n\tt.y+=dyo[s.d];\n\tt.x+=dxo[s.d];\n\tswap(t.n,t.m);\n\tt.d=(s.d+3)%6;\t\n\tpush(t,s);\n }\n }\n \n \n }\n \n \n {\n Int x,y,n;\n while(cin>>x>>y>>n,x||y||n){\n short ans=101;\n x+=CC;y+=CC;\n for(Int i=0;i<20;i++){\n\tfor(Int j=0;j<6;j++){\n\t if(dp[y][x][n][i][j]<0) continue;\n\t chmin(ans,dp[y][x][n][i][j]);\n\t}\n }\n cout<<ans<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":109956,"score_of_the_acc":-1.0177,"final_rank":18},{"submission_id":"aoj_1319_2418810","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <queue>\n#include <utility>\n\nconst int drct[2][3][2] = {{{0, 1}, {-1, 0}, {1, 0}}, {{0, -1}, {1, 0}, {-1, 0}}};\n\nint sd_x, sd_y, bottom;\n\nstruct State {\n\tint x, y, bot, up, step;\n\t\n\tState() {}\n\tState(int x, int y, int bot, int up, int step): \n\t\tx(x), y(y), bot(bot), up(up), step(step) {}\n};\n\nint NEXT(int x, int t) {\n\tswitch (t) {\n\t\tcase 0:\n\t\t\tif (x < 5 || (x >= 10 && x < 15)) return x + 5;\n\t\t\treturn x - 5;\n\t\tcase 1:\n\t\t\tif (x < 5) return (x + 4) % 5;\n\t\t\tif (x < 10) return (x + 5 - 10 + 1) % 5 + 10;\n\t\t\tif (x < 15) return (x - 5 - 5 + 4) % 5 + 5;\n\t\t\treturn (x - 15 + 1) % 5 + 15;\n\t\tcase 2:\n\t\t\tif (x < 5) return (x + 1) % 5;\n\t\t\tif (x < 10) return x + 5;\n\t\t\tif (x < 15) return x - 5;\n\t\t\treturn (x - 15 + 4) % 5 + 15;\n\t}\n\t\n\treturn -1;\n}\n\nstd::pair<int, int> NEXT(int x, int up, int t) {\n\tint a = NEXT(x, (up + t) % 3), b;\n\tswitch ((up + t) % 3) {\n\t\tcase 0:\n\t\t\tb = 0; break;\n\t\tcase 1:\n\t\t\tif (x < 5 || x >= 15) b = 1;\n\t\t\telse b = 0;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tif (x < 5 || x >= 15) b = 2;\n\t\t\telse b = 0;\n\t\t\tbreak;\n\t}\n\treturn std::make_pair(a, (b + up) % 3);\n}\n\nint dist[205][205][20][3];\n\nvoid BFS() {\n\tstatic std::queue<State> que;\n\tstatic State now;\n\t\n\tque.push(State(0, 0, 0, 0, 0));\n\tdist[0 + 100][0 + 100][0][0] = 0;\n\twhile (!que.empty()) {\n\t\tnow = que.front(); que.pop();\n\t\tif (now.step >= 100) break;\n\t\tfor (int t = 0; t < 3; ++t) {\n\t\t\tint xx = now.x + drct[(now.x + now.y) & 1][t][0], \n\t\t\t\tyy = now.y + drct[(now.x + now.y) & 1][t][1];\n\t\t\tint fir = NEXT(now.bot, now.up, t).first, \n\t\t\t\tsec = NEXT(now.bot, now.up, t).second;\n\t\t\tif (~dist[xx + 100][yy + 100][fir][sec]) continue;\n\t\t\tdist[xx + 100][yy + 100][fir][sec] = now.step + 1;\n\t\t\tque.push(State(xx, yy, fir, sec, now.step + 1));\n\t\t}\n\t}\n}\n\nint main() {\n\tmemset(dist, -1, sizeof dist);\n\tBFS();\n\t\n\twhile (~scanf(\"%d%d%d\", &sd_x, &sd_y, &bottom) && (sd_x || sd_y || bottom)) {\n\t\tint ans = 0x3f3f3f3f;\n\t\tfor (int t = 0; t < 3; ++t) if (~dist[sd_x + 100][sd_y + 100][bottom][t])\n\t\t\tans = std::min(ans, dist[sd_x + 100][sd_y + 100][bottom][t]);\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":12640,"score_of_the_acc":-0.0837,"final_rank":2},{"submission_id":"aoj_1319_2395872","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \nvoid rA(int t[20]){\n int u[20]={5,10,15,16,11,0,9,19,17,6,1,4,14,18,12,2,3,8,13,7};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n\nvoid rB(int t[20]){\n int u[20]={1,0,5,11,6,2,4,10,16,12,7,3,9,15,17,13,8,14,19,18};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n \nvoid rC(int t[20]){\n int u[20]={4,9,10,5,0,3,14,15,11,1,2,8,19,16,6,7,13,18,17,12};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n \nvoid rD(int t[20]){\n int u[20]={5,10,15,16,11,0,9,19,17,6,1,4,14,18,12,2,3,8,13,7};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n \nvoid rE(int t[20]){\n int u[20]={1,0,5,11,6,2,4,10,16,12,7,3,9,15,17,13,8,14,19,18};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n \nvoid rF(int t[20]){\n int u[20]={4,9,10,5,0,3,14,15,11,1,2,8,19,16,6,7,13,18,17,12};\n int tmp[20];\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\n for(int i=0;i<20;i++)t[i]=tmp[i];\n}\n \nstruct die{\n int p[20];\n bool operator < ( const die &A ) const {\n for(int i=0;i<20;i++)\n if(p[i]!=A.p[i])return (p[i]<A.p[i]);\n return false;\n }\n};\n \n \ntypedef pair<int,int> P;\ntypedef pair< P , int > state;\n \ntypedef pair< P , int > PP;\ntypedef unsigned int ull;\n \nmap< ull , int > d;\nmap< PP , int > ans;\nqueue< state > Q;\nmap< die , int > dice;\nmap< int , die > redice;\n\n\nint dieId(die d){\n if(dice.count(d)>0)return dice[d];\n int res=dice.size();\n dice[d]=res;\n redice[res]=d;\n return res;\n}\n\nint RA(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rA(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\nint RB(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rB(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\nint RC(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rC(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\nint RD(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rD(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\nint RE(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rE(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\nint RF(int id){\n static map<int,int> mp;\n if(mp.count(id)>0)return mp[id];\n die d=redice[id];\n rF(d.p);\n mp[id]=dieId(d);\n return mp[id];\n}\n \null getHash(state s){\n ull res=0, B=5575777;\n int x=s.first.first+150;\n int y=s.first.second+150;\n res=x*B+y;\n die d=redice[s.second];\n for(int i=0;i<20;i++)res=res*B+d.p[i];\n return res;\n}\n \nvoid Push(state s,int cost){\n ull key=getHash(s);\n if(d.count(key)>0)return;\n d[key]=cost+1;\n Q.push(s);\n}\n \nint main(){\n die v;\n for(int i=0;i<20;i++)v.p[i]=i;\n state si=state( P(0,0) , dieId(v) );\n d[ getHash(si) ]=0;\n Q.push(si);\n \n while(!Q.empty()){\n state s=Q.front();Q.pop();\n int cost=d[ getHash(s) ];\n \n int x=s.first.first;\n int y=s.first.second;\n int f=abs(x+y)%2;\n die d=redice[ s.second ];\n die tmpd=d;\n int n=d.p[0];\n \n /*\n cout<<x<<' '<<y<<' '<<cost<<' '<<n<<endl;\n for(int i=0;i<20;i++)cout<<s.second.p[i]<<' ';\n cout<<endl;\n cout<<endl;\n */\n if( ans.count( PP(P(x,y), n ) ) == 0)\n ans[ PP(P(x,y),n) ]=cost;\n \n if(cost==100)continue;\n \n \n if(f==0){\n state A=s;\n A.first=P(x,y+1);\n A.second=RA(s.second);\n Push(A,cost);\n \n state B=s;\n B.first=P(x+1,y);\n B.second=RB(s.second);\n Push(B,cost);\n \n state C=s;\n C.first=P(x-1,y);\n C.second=RC(s.second);\n Push(C,cost);\n \n \n }else{\n state D=s;\n D.first=P(x,y-1);\n rD(d.p);\n D.second=RD(s.second);\n Push(D,cost);\n \n state E=s;\n E.first=P(x-1,y);\n rE(d.p);\n E.second=RE(s.second);\n Push(E,cost);\n \n state F=s;\n F.first=P(x+1,y);\n rF(d.p);\n F.second=RF(s.second);\n Push(F,cost);\n }\n }\n\n //cout<<dice.size()<<endl;\n \n while(1){\n int x,y,n;\n cin>>x>>y>>n;\n if(x==0&&y==0&&n==0)break;\n cout<< ans[ PP( P(x,y) , n ) ] <<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1950,"memory_kb":64708,"score_of_the_acc":-0.9968,"final_rank":17},{"submission_id":"aoj_1319_1850511","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nint dx[2][3] = { {0,-1,1},{0,1,-1} };\nint dy[2][3] = { {1,0,0},{-1,0,0} };\nstruct poly {\n\tint x;\n\tint y;\n\tint under;\n\tint front;\n\tint left;\n\tint right;\n\tint turn;\n\tint id;\n\tpoly() :x(101), y(101), under(0), front(5),turn(0),id(0) {\n\t\tsetlr();\n\t}\n\tenum Way {\n\t\tW_Front,\n\t\tW_Left,\n\t\tW_Right,\n\t};\n\tint typeflr[4][3] = {\n\t\t{ 1,0,0 } ,\n\t\t{ -1,1,1 },\n\t\t{ 1,-1,-1 },\n\t\t{ -1,0,0 }\n\t};\n\tint dflr[4][3] = {\n\t\t{ 0,4,1 },\n\t\t{ 0,1,0 },\n\t\t{ 0,4,0 },\n\t\t{ 0,1,4 },\n\t};\n\t//0 5 4 1\n\t//1 6 0 2\n\t//5 0 11 10\n\t//6 1 12 11\n\t//10 15 9 5\n\t//11 16 5 6\n\t//15 10 16 19\n\t// 16 11 17 15\n\tvoid setid() {\n\t\tconst int ftype = under / 5;\n\t\tconst int fnum = under % 5;\n\t\tbool flag = false;\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tconst int atype = ftype + typeflr[ftype][i];\n\t\t\tconst int anum = (fnum + dflr[ftype][i]) % 5;\n\t\t\tconst int predict_front = atype * 5 + anum;\n\t\t\tif (predict_front == front) {\n\t\t\t\tid = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tvoid setlr() {\n\t\t\n\t\tconst int ftype = under / 5;\n\t\tconst int fnum = under % 5;\n\t\tbool flag = false;\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tconst int atype = ftype + typeflr[ftype][i];\n\t\t\tconst int anum = (fnum + dflr[ftype][i])%5;\n\t\t\tconst int predict_front = atype * 5 + anum;\n\t\t\tif (predict_front == front) {\n\t\t\t\t{\n\t\t\t\t\tconst int atype = ftype + typeflr[ftype][(i+1)%3];\n\t\t\t\t\tconst int anum = (fnum + dflr[ftype][(i + 1) % 3]) % 5;\n\t\t\t\t\tleft = atype * 5 + anum;\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tconst int atype = ftype + typeflr[ftype][(i + 2) % 3];\n\t\t\t\t\tconst int anum = (fnum + dflr[ftype][(i + 2) % 3]) % 5;\n\t\t\t\t\tright= atype * 5 + anum;\n\t\t\t\t}\n\t\t\t\tflag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tassert(flag);\n\n\t}\n\tvoid rotate_l() {\n\t\tint c = left;\n\t\tleft = right;\n\t\tright = front;\n\t\tfront = c;\n\t}\n\tvoid rotate(const Way way) {\n\t\tx += dx[(x + y) % 2][way];\n\t\ty += dy[(x + y) % 2][way];\n\t\tif (way == W_Front) {\n\t\t\tswap(front, under);\n\t\t\tsetlr();\n\t\t}\n\t\telse if (way == W_Left) {\n\t\t\tswap(left, under);\n\t\t\t{\n\t\t\t\trotate_l();\n\t\t\t\tsetlr();\n\t\t\t\trotate_l();\n\t\t\t\trotate_l();\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tswap(right, under);\n\t\t\t{\n\t\t\t\trotate_l();\n\t\t\t\trotate_l();\n\t\t\t\tsetlr();\n\t\t\t\trotate_l();\n\t\t\t}\n\t\t}\n\t\tsetid();\n\t\tturn++;\n\t}\n\tvoid rotate(const int way) {\n\t\trotate(static_cast<Way>(way));\n\t}\n};\n\n\nint main() {\n\twhile (1) {\n\t\tint x, y, u; cin >> x >> y >> u;\n\t\tif (!x&&!y&&!u)break;\n\t\tx += 101;\n\t\ty += 101;\n\n\t\tvector<vector<vector<vector<int>>>>memo(203, vector<vector<vector<int>>>(203, vector<vector<int>>(20, vector<int>(3,1e9))));\n\t\tqueue<poly>que;\n\t\tmemo[101][101][0][0] = 0;\n\t\tque.push(poly());\n\t\tint ans = -1;\n\t\twhile (!que.empty()) {\n\t\t\tpoly atop(que.front());\n\t\t\tif (atop.x == x&&atop.y == y&&atop.under == u) {\n\t\t\t\tans = atop.turn;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tque.pop();\n\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\tpoly apoly(atop);\n\t\t\t\tapoly.rotate(i);\n\t\t\t\tif (memo[apoly.x][apoly.y][apoly.under][apoly.id]>apoly.turn) {\n\t\t\t\t\tmemo[apoly.x][apoly.y][apoly.under][apoly.id] = apoly.turn;\n\t\t\t\t\tque.push(apoly);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":4560,"memory_kb":52104,"score_of_the_acc":-1.454,"final_rank":20},{"submission_id":"aoj_1319_1544762","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<tuple>\n#include<vector>\n\nusing namespace std;\n\nint mem[223][223][22][3];\n\nint neighbors[][3]={\n {5,4,1},\n {6,0,2},\n {7,1,3},\n {8,2,4},\n {9,3,0},\n {0,11,10},\n {1,12,11},\n {2,13,12},\n {3,14,13},\n {4,10,14},\n {15,9,5},\n {16,5,6},\n {17,6,7},\n {18,7,8},\n {19,8,9},\n {10,16,19},\n {11,17,15},\n {12,18,16},\n {13,19,17},\n {14,15,18},\n};\n\nint main(){\n fill(***begin(mem),***end(mem),1e9);\n vector<tuple<int,int,int,int> > vs[123];\n vs[0].emplace_back(0,0,0,0);\n for(int i=0;i<=100;i++){\n // cout<<\"vs = \"<<vs[i].size()<<endl;\n while(!vs[i].empty()){\n int y,x,f,d;\n tie(y,x,f,d)=vs[i].back();\n vs[i].pop_back();\n if(mem[y+100][x+100][f][d]<1e8){\n\t//\tcout<<i<<endl;\n\tcontinue;\n }\n // cout<<i<<' '<<x<<' '<<y<<' '<<f<<' '<<d<<endl;\n mem[y+100][x+100][f][d]=i;\n int n[3];\n for(int j=0;j<3;j++){\n\tn[j]=neighbors[f][(d+j)%3];\n }\n for(int j=0;j<3;j++){\n\tstatic int dy[][3]={{1,0,0},{0,-1,0}};\n\tstatic int dx[][3]={{0,-1,1},{-1,0,1}};\n\tstatic int l[][3]={{1,2,0},{2,0,1}};\n\tint b=(abs(y)+abs(x))%2;\n\tvs[i+1].emplace_back(y+dy[b][j],x+dx[b][j],n[j],(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3);\n\t{\n\t int ny=y+dy[b][j],nx=x+dx[b][j],nf=n[j],nd=(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3;\n\t int n[3];\n\t for(int j=0;j<3;j++){\n\t n[j]=neighbors[nf][(nd+j)%3];\n\t }\n\t bool flag=false;\n\t for(int j=0;j<3;j++){\n\t static int dy[][3]={{1,0,0},{0,-1,0}};\n\t static int dx[][3]={{0,-1,1},{-1,0,1}};\n\t static int l[][3]={{1,2,0},{2,0,1}};\n\t int b=(abs(ny)+abs(nx))%2;\n\t flag|=y==ny+dy[b][j]&&x==nx+dx[b][j]&&f==n[j]&&d==(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),nf)-begin(neighbors[n[j]])-l[b][j]+3)%3;\n\t }\n\t if(!flag){\n\t cout<<\"a\"<<' '<<x<<' '<<y<<' '<<f<<' '<<d<<endl;\n\t }\n\t}\n }\n }\n }\n int x=13,y=-13,f=2,d=0;\n for(int i=28;i>0;i--){\n int n[3];\n for(int j=0;j<3;j++){\n\tn[j]=neighbors[f][(d+j)%3];\n }\n for(int j=0;j<3;j++){\n static int dy[][3]={{1,0,0},{0,-1,0}};\n static int dx[][3]={{0,-1,1},{-1,0,1}};\n static int l[][3]={{1,2,0},{2,0,1}};\n int b=(abs(y)+abs(x))%2;\n int ny=y+dy[b][j],nx=x+dx[b][j],nf=n[j],nd=(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3;\n if(mem[ny+100][nx+100][nf][nd]==i-1){\n\ty=ny;\n\tx=nx;\n\tf=nf;\n\td=nd;\n\tcout<<i<<' '<<y<<' '<<x<<' '<<f<<' '<<d<<endl;\n\tbreak;\n }\n }\n }\n \n \n \n for(int x,y,n;cin>>x>>y>>n,x|y|n;){\n // for(int i=0;i<3;i++){\n // cout<<mem[y+100][x+100][n][i]<<' ';\n // }\n // cout<<endl;\n cout<<*min_element(begin(mem[y+100][x+100][n]),end(mem[y+100][x+100][n]))<<endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":57088,"score_of_the_acc":-0.5187,"final_rank":12},{"submission_id":"aoj_1319_1137654","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<queue>\nusing namespace std;\nint dx[2][3]={{-1,1,0},{1,-1,0}};\nint dy[2][3]={{0,0,1},{0,0,-1}};\nint dd[2][3]={{1,2,0},{2,1,0}};\nint dv[20][3]={\n{4,1,5},\n{0,2,6},\n{1,3,7},\n{2,4,8},\n{3,0,9},\n{11,10,0},\n{12,11,1},\n{13,12,2},\n{14,13,3},\n{10,14,4},\n{9,5,15},\n{5,6,16},\n{6,7,17},\n{7,8,18},\n{8,9,19},\n{16,19,10},\n{17,15,11},\n{18,16,12},\n{19,17,13},\n{15,18,14},\n};\nint bfs[230][230][21][3];\nint ABS(int a){return max(a,-a);}\nint main(){\n\tint a,b,c;\n\t\tint T=110;\n\t\tfor(int i=0;i<230;i++)for(int j=0;j<230;j++)\n\t\t\tfor(int k=0;k<21;k++)for(int l=0;l<3;l++)\n\t\t\t\tbfs[i][j][k][l]=-1;\n\t\tqueue<pair<pair<int,int>,pair<int,int> > >Q;\n\t\tQ.push(make_pair(make_pair(0,0),make_pair(0,0)));\n\t\tbfs[T][T][0][0]=0;\n\t\twhile(Q.size()){\n\t\t\tint x=Q.front().first.first;\n\t\t\tint y=Q.front().first.second;\n\t\t\tint st=Q.front().second.first;\n\t\t\tint rot=Q.front().second.second;\n\t\t\tQ.pop();\n\t\t//\tif(bfs[x+T][y+T][st][rot]<=5)printf(\"%d %d %d %d: %d\\n\",x,y,st,rot,bfs[x+T][y+T][st][rot]);\n\t\t\t\t\n\t\t\tint t=ABS(x+y)%2;\n\t\t\tfor(int i=0;i<3;i++){\n\t\t\t\tint nx=x+dx[t][i];\n\t\t\t\tint ny=y+dy[t][i];\n\t\t\t\tint ns=dv[st][(rot+i)%3];\n\t\t\t\tint nd;\n\t\t\t\tfor(int j=0;j<3;j++)if(dv[ns][j]==st){nd=(j+3-i)%3;break;}\n\t\t\t\tif(nx<-T||nx>T||ny<-T||ny>T)continue;\n\t\t\t\tif(!~bfs[nx+T][ny+T][ns][nd]){\n\t\t\t\t\tbfs[nx+T][ny+T][ns][nd]=bfs[x+T][y+T][st][rot]+1;\n\t\t\t\t\tQ.push(make_pair(make_pair(nx,ny),make_pair(ns,nd)));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\twhile(scanf(\"%d%d%d\",&a,&b,&c),a||b||c){\n\t\tint ret=99999999;\n\t\tfor(int i=0;i<3;i++)if(~bfs[a+T][b+T][c][i])ret=min(ret,bfs[a+T][b+T][c][i]);\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":150,"memory_kb":14276,"score_of_the_acc":-0.1234,"final_rank":3},{"submission_id":"aoj_1319_1092151","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <map>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\ntypedef pair<int,int> P;\nstruct state{\n\tP p;\n\tint b,m;\n\tbool operator < (const state& l) const{\n\t\tif(l.p!=p) return l.p<p;\n\t\tif(l.b!=b) return l.b<b;\n\t\treturn l.m<m;\n\t}\n};\nmap<state,int> d;\nP trans[20][20][3];\nvoid a(int a,int b,int c,int d,int e,int f){\n\ttrans[a][b][0]=P(b,a);\n\ttrans[a][b][1]=P(c,d);\n\ttrans[a][b][2]=P(e,f);\n}\nint dx[3]={0,1,-1},dy[3]={1,0,0};\nqueue<state> que;\nint main(){\n\ta(0,5,1,2,4,3);\n\ta(0,4,5,11,1,6);\n\ta(0,1,4,9,5,10);\n\ta(1,6,2,3,0,4);\n\ta(1,0,6,12,2,7);\n\ta(1,2,0,5,6,11);\n\ta(2,7,3,4,1,0);\n\ta(2,3,1,6,7,12);\n\ta(2,1,7,13,3,8);\n\ta(3,8,4,0,2,1);\n\ta(3,4,2,7,8,13);\n\ta(3,2,8,14,4,9);\n\ta(4,9,0,1,3,2);\n\ta(4,0,3,8,9,14);\n\ta(4,3,9,10,0,5);\n\ta(5,0,10,15,11,16);\n\ta(5,10,11,6,0,1);\n\ta(5,11,0,4,10,9);\n\ta(6,1,11,16,12,17);\n\ta(6,11,12,7,1,2);\n\ta(6,12,1,0,11,5);\n\ta(7,2,12,17,13,18);\n\ta(7,12,13,8,2,3);\n\ta(7,13,2,1,12,6);\n\ta(8,3,13,18,14,19);\n\ta(8,13,14,9,3,4);\n\ta(8,14,3,2,13,7);\n\ta(9,4,14,19,10,15);\n\ta(9,14,10,5,4,0);\n\ta(9,10,4,3,14,8);\n\ta(10,5,9,14,15,19);\n\ta(10,9,15,16,5,11);\n\ta(10,15,5,0,9,4);\n\ta(11,5,16,17,6,12);\n\ta(11,16,6,1,5,0);\n\ta(11,6,5,10,16,15);\n\ta(12,7,6,11,17,16);\n\ta(12,6,17,18,7,13);\n\ta(12,17,7,2,6,1);\n\ta(13,18,8,3,7,2);\n\ta(13,8,7,12,18,17);\n\ta(13,7,18,19,8,14);\n\ta(14,19,9,4,8,3);\n\ta(14,9,8,13,19,18);\n\ta(14,8,19,15,9,10);\n\ta(15,10,19,18,16,17);\n\ta(15,19,16,11,10,5);\n\ta(15,16,10,9,19,14);\n\ta(16,11,15,19,17,18);\n\ta(16,15,17,12,11,6);\n\ta(16,17,11,5,15,10);\n\ta(17,12,16,15,18,19);\n\ta(17,16,18,13,12,7);\n\ta(17,18,12,6,16,11);\n\ta(18,13,17,16,19,15);\n\ta(18,17,19,14,13,8);\n\ta(18,19,13,7,17,12);\n\ta(19,14,18,17,15,16);\n\ta(19,18,15,10,14,9);\n\ta(19,15,14,8,18,13);\n\tstate start={P(0,0),0,5};\n\tque.push(start);\n\td[start]=0;\n\twhile(true){\n\t\tstate s=que.front();\n\t\tif(d[s]>100) break;\n\t\tque.pop();\n\t\tP p=s.p;\n\t\tint k=((p.fs+p.sc+10000)%2==0?1:-1);\n\t\t//show(k);\n\t\t// show(p.fs);\n\t\t// show(p.sc);\n\t\t// show(s.b);\n\t\t// show(s.m);\n\t\t// cout<<endl;\n\t\trep(i,3){\n\t\t\tP np=P(p.fs+dx[i]*k,p.sc+dy[i]*k);\n\t\t\tstate nstate={np,trans[s.b][s.m][i].fs,trans[s.b][s.m][i].sc};\n\t\t\tif(d.find(nstate)!=d.end()) continue;\n\t\t\td[nstate]=d[s]+1;\n\t\t\t// show(np.fs);\n\t\t\t// show(np.sc);\n\t\t\t// show(nstate.b);\n\t\t\tque.push(nstate);\n\t\t}\n\t}\n\twhile(true){\n\t\tint x,y,z;\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\tif(x==0&&y==0&&z==0) break;\n\t\tint ret=1e5;\n\t\trep(i,20){\n\t\t\tif(d.find({P(x,y),z,i})==d.end()) continue;\n\t\t\tret=min(ret,d[state{P(x,y),z,i}]);\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":760,"memory_kb":59652,"score_of_the_acc":-0.6863,"final_rank":14},{"submission_id":"aoj_1319_1040899","code_snippet":"#include <vector>\n#include <list>\n#include <queue>\n#include <map>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cstring>\n\nusing namespace std;\n\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\n\nint dp[202][202][20][3];\n\nvoid A_up(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid A_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid A_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_down(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid B_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid init(){\n static int x,y,n,p,n0,p0;\n static queue<int> Q;\n memset(dp,-1,sizeof(dp));\n dp[100][100][0][2]=0;\n while(!Q.empty())Q.pop();\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\n while(!Q.empty()){\n x=Q.front();Q.pop();\n y=Q.front();Q.pop();\n n=Q.front();Q.pop();\n p=Q.front();Q.pop();\n if(dp[x][y][n][p]==100)return;\n if((x+y)%2){\n n0=n,p0=p;\n B_down(n0,p0);\n if(dp[x][y-1][n0][p0]==-1){\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n else{\n n0=n,p0=p;\n A_up(n0,p0);\n if(dp[x][y+1][n0][p0]==-1){\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n }\n}\n\nbool solve(){\n static int x,y,n;\n if(scanf(\"%d%d%d\",&x,&y,&n)!=3||((x|y|n)==0))return false;\n x+=100;\n y+=100;\n static int ans,i;\n ans=100;\n for(i=0;i<3;i++)\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\n ans=dp[x][y][n][i];\n printf(\"%d\\n\",ans);\n return true;\n}\n\nint main(){\n init();\n while(solve());\n return 0;\n}\n/*\n#include <vector>\n#include <list>\n#include <queue>\n#include <map>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cstring>\n\nusing namespace std;\n\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\n\nint dp[202][202][20][3];\n\nvoid A_up(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid A_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid A_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_down(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid B_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid init(){\n static int x,y,n,p,n0,p0;\n static queue<int> Q;\n memset(dp,-1,sizeof(dp));\n dp[100][100][0][2]=0;\n while(!Q.empty())Q.pop();\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\n while(!Q.empty()){\n x=Q.front();Q.pop();\n y=Q.front();Q.pop();\n n=Q.front();Q.pop();\n p=Q.front();Q.pop();\n if(dp[x][y][n][p]==100)return;\n if((x+y)%2){\n n0=n,p0=p;\n B_down(n0,p0);\n if(dp[x][y-1][n0][p0]==-1){\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n else{\n n0=n,p0=p;\n A_up(n0,p0);\n if(dp[x][y+1][n0][p0]==-1){\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n }\n}\n\nbool solve(){\n static int x,y,n;\n if(scanf(\"%d%d%d\",&x,&y,&n)!=3||((x|y|n)==0))return false;\n x+=100;\n y+=100;\n static int ans,i;\n ans=100;\n for(i=0;i<3;i++)\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\n ans=dp[x][y][n][i];\n printf(\"%d\\n\",ans);\n return true;\n}\n\nint main(){\n init();\n while(solve());\n return 0;\n}\n#include <vector>\n#include <list>\n#include <queue>\n#include <map>\n#include <set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <ctime>\n#include <cstring>\n\nusing namespace std;\n\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\n\nint dp[202][202][20][3];\n\nvoid A_up(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid A_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid A_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_down(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][p];\n if(f[n][0]==tmp)p=0;\n else if(f[n][1]==tmp)p=1;\n else p=2;\n}\n\nvoid B_left(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+1)%3];\n if(f[n][0]==tmp)p=2;\n else if(f[n][1]==tmp)p=0;\n else p=1;\n}\n\nvoid B_right(int &n,int &p){\n static int tmp;\n tmp=n;\n n=f[n][(p+2)%3];\n if(f[n][0]==tmp)p=1;\n else if(f[n][1]==tmp)p=2;\n else p=0;\n}\n\nvoid init(){\n static int x,y,n,p,n0,p0;\n static queue<int> Q;\n memset(dp,-1,sizeof(dp));\n dp[100][100][0][2]=0;\n while(!Q.empty())Q.pop();\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\n while(!Q.empty()){\n x=Q.front();Q.pop();\n y=Q.front();Q.pop();\n n=Q.front();Q.pop();\n p=Q.front();Q.pop();\n if(dp[x][y][n][p]==100)return;\n if((x+y)%2){\n n0=n,p0=p;\n B_down(n0,p0);\n if(dp[x][y-1][n0][p0]==-1){\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n B_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n else{\n n0=n,p0=p;\n A_up(n0,p0);\n if(dp[x][y+1][n0][p0]==-1){\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_left(n0,p0);\n if(dp[x-1][y][n0][p0]==-1){\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n n0=n,p0=p;\n A_right(n0,p0);\n if(dp[x+1][y][n0][p0]==-1){\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\n }\n }\n }\n}\n\nbool solve(){\n static int x,y,n;\n if(scanf(\"%d%d%d\",&x,&y,&n)!=3||((x|y|n)==0))return false;\n x+=100;\n y+=100;\n static int ans,i;\n ans=100;\n for(i=0;i<3;i++)\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\n ans=dp[x][y][n][i];\n printf(\"%d\\n\",ans);\n return true;\n}\n\nint main(){\n init();\n while(solve());\n return 0;\n}\n\n*/","accuracy":1,"time_ms":40,"memory_kb":11068,"score_of_the_acc":-0.0688,"final_rank":1},{"submission_id":"aoj_1319_664786","code_snippet":"#include<iostream>\n#include<queue>\n#include<algorithm>\n#include<cassert>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++)\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\nstatic const int dx[3] = {0, -1, 1};\nstatic const int dy[3] = {1, 0, 0};\n\nstatic const int MAX = 305;\nstatic const int SHIFT = 150;\n\nclass State{\npublic:\n int x, y, b, r, c;\n State(){}\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\n};\n\nState getNext(State u, int r){\n int nx = dx[r];\n int ny = dy[r];\n \n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\n nx += u.x;\n ny += u.y;\n\n int bt[3], nt[3];\n\n rep(i, 3) bt[i] = C[u.b][i];\n rotate(bt, bt + u.r, bt + 3);\n int nb = bt[r]; // next bottom\n\n rep(i, 3) nt[i] = C[nb][i];\n int nr = -1; // next rotate\n rep(i, 3){\n if ( u.b == nt[r] ){ nr = i; break; }\n rotate(nt, nt+1, nt+3);\n }\n\n return State(nx, ny, nb, nr);\n}\n\nbool vis[MAX][MAX][20][3];\n\nint bfs(int gx, int gy, int gb){\n queue<State> Q;\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\n\n Q.push(State(SHIFT, SHIFT, 0, 0));\n vis[SHIFT][SHIFT][0][0] = true;\n State u, v;\n\n while(1){\n u = Q.front(); Q.pop();\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\n rep(r, 3){\n v = getNext(u, r);\n if ( !vis[v.x][v.y][v.b][v.r] ){\n\tvis[v.x][v.y][v.b][v.r] = true;\n\tv.c = u.c + 1;\n\tQ.push(v);\n }\n }\n }\n}\n\nmain(){\n int gx, gy, gb;\n while(1){\n cin >> gx >> gy >> gb;\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\n gx += SHIFT;\n gy += SHIFT;\n cout << bfs(gx, gy, gb) << endl;\n }\n}","accuracy":1,"time_ms":2060,"memory_kb":6996,"score_of_the_acc":-0.4763,"final_rank":10},{"submission_id":"aoj_1319_659078","code_snippet":"#include<iostream>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++)\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\nstatic const int dx[3] = {0, -1, 1};\nstatic const int dy[3] = {1, 0, 0};\nstatic const int MAX = 205;\nstatic const int SHIFT = 102;\n\nclass State{\npublic:\n int x, y, b, r, c;\n State(){}\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\n};\n\nState getNext(State u, int r){\n int bt[3], nt[3], nb, nr = -1;\n int nx = dx[r];\n int ny = dy[r];\n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\n nx += u.x;\n ny += u.y;\n\n rep(i, 3) bt[i] = C[u.b][i];\n rotate(bt, bt + u.r, bt + 3);\n nb = bt[r]; // next bottom\n rep(i, 3) nt[i] = C[nb][i];\n\n rep(i, 3){\n if ( u.b == nt[r] ){ nr = i; break; }\n rotate(nt, nt+1, nt+3);\n }\n\n return State(nx, ny, nb, nr);\n}\n\nint bfs(int gx, int gy, int gb){\n bool vis[MAX][MAX][20][3];\n queue<State> Q;\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\n Q.push(State(SHIFT, SHIFT, 0, 0));\n vis[SHIFT][SHIFT][0][0] = true;\n State u, v;\n while(1){\n u = Q.front(); Q.pop();\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\n rep(r, 3){\n v = getNext(u, r);\n if ( !vis[v.x][v.y][v.b][v.r] ){\n\tvis[v.x][v.y][v.b][v.r] = true;\n\tv.c = u.c + 1;\n\tQ.push(v);\n }\n }\n }\n}\n\nmain(){\n int gx, gy, gb;\n while(1){\n cin >> gx >> gy >> gb;\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\n gx += SHIFT;\n gy += SHIFT;\n cout << bfs(gx, gy, gb) << endl;\n }\n}","accuracy":1,"time_ms":2020,"memory_kb":4008,"score_of_the_acc":-0.4393,"final_rank":8},{"submission_id":"aoj_1319_659055","code_snippet":"#include<iostream>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n#define rep(i, n) for ( int i = 0; i < n; i++)\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\nstatic const int dx[3] = {0, -1, 1};\nstatic const int dy[3] = {1, 0, 0};\nstatic const int MAX = 205;\nstatic const int SHIFT = 102;\n\nclass State{\npublic:\n int x, y, b, r, c;\n State(){}\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\n};\n\nState getNext(State u, int r){\n int nx = dx[r];\n int ny = dy[r];\n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\n nx += u.x;\n ny += u.y;\n\n int bt[3], nt[3], nb, nr;\n\n rep(i, 3) bt[i] = C[u.b][i];\n rotate(bt, bt + u.r, bt + 3);\n nb = bt[r]; // next bottom\n rep(i, 3) nt[i] = C[nb][i];\n nr = -1; // next rotate\n rep(i, 3){\n if ( u.b == nt[r] ){ nr = i; break; }\n rotate(nt, nt+1, nt+3);\n }\n\n return State(nx, ny, nb, nr);\n}\n\nint bfs(int gx, int gy, int gb){\n bool vis[MAX][MAX][20][3];\n queue<State> Q;\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\n\n Q.push(State(SHIFT, SHIFT, 0, 0));\n vis[SHIFT][SHIFT][0][0] = true;\n State u, v;\n\n while(1){\n u = Q.front(); Q.pop();\n if( u.c > 150 ) return -1;\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\n rep(r, 3){\n v = getNext(u, r);\n if ( !vis[v.x][v.y][v.b][v.r] ){\n\tvis[v.x][v.y][v.b][v.r] = true;\n\tv.c = u.c + 1;\n\tQ.push(v);\n }\n }\n }\n}\n\nmain(){\n int gx, gy, gb;\n while(1){\n cin >> gx >> gy >> gb;\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\n gx += SHIFT;\n gy += SHIFT;\n cout << bfs(gx, gy, gb) << endl;\n }\n}","accuracy":1,"time_ms":2020,"memory_kb":4008,"score_of_the_acc":-0.4393,"final_rank":8},{"submission_id":"aoj_1319_520435","code_snippet":"#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int INF=1<<29;\n\nconst int dx[2][3]={{0,-1,1},{0,1,-1}},dy[2][3]={{1,0,0},{-1,0,0}};\n\nstruct state{ int x,y,face,dir; };\n\nint main(){\n\t// table[i][j] := ( 底面が i で方向 j に転がったとき, 次に底面になる面の番号 )\n\t// 問題文の図で上(or下)の方向を方向 0 として, 反時計回りに方向 1, 2 を定めている.\n\t// 方向は正二十面体の上に定められていて, 座標とは関係ない!!!\n\t// 正二十面体を実際にグリッド上に置くと, 展開図と面の位置関係が反転するので注意.\n\tint table[20][3]={\n\t\t{ 5, 4, 1},\n\t\t{ 6, 0, 2},\n\t\t{ 7, 1, 3},\n\t\t{ 8, 2, 4},\n\t\t{ 9, 3, 0},\n\t\t{ 0,11,10},\n\t\t{ 1,12,11},\n\t\t{ 2,13,12},\n\t\t{ 3,14,13},\n\t\t{ 4,10,14},\n\t\t{15, 9, 5},\n\t\t{16, 5, 6},\n\t\t{17, 6, 7},\n\t\t{18, 7, 8},\n\t\t{19, 8, 9},\n\t\t{10,16,19},\n\t\t{11,17,15},\n\t\t{12,18,16},\n\t\t{13,19,17},\n\t\t{14,15,18}\n\t};\n\n\t// dist[y][x][i][j] := ( 座標が (x,y) で, 底面が i で, 北(or南)が方向 j である状態に達するための最短距離 )\n\tstatic int dist[201][201][20][3];\n\trep(y,201) rep(x,201) rep(i,20) rep(j,3) dist[y][x][i][j]=INF;\n\tdist[100][100][0][0]=0;\n\n\tstatic state Q[201*201*20*3];\n\tint head=0,tail=0;\n\tQ[tail++]=(state){100,100,0,0};\n\twhile(head<tail){\n\t\tstate S=Q[head++];\n\t\tif(dist[S.y][S.x][S.face][S.dir]==100) continue;\n\n\t\trep(k,3){\n\t\t\tint xx=S.x+dx[(S.x+S.y)%2][k];\n\t\t\tint yy=S.y+dy[(S.x+S.y)%2][k];\n\t\t\tint ff=table[S.face][(S.dir+k)%3];\n\t\t\tint dd;\n\t\t\tif(S.face<5 || 15<=S.face){\n\t\t\t\tif (S.dir==0 && k==0) dd=0;\n\t\t\t\telse if(S.dir==0 && k==1) dd=1;\n\t\t\t\telse if(S.dir==0 && k==2) dd=2;\n\t\t\t\telse if(S.dir==1 && k==0) dd=2;\n\t\t\t\telse if(S.dir==1 && k==1) dd=0;\n\t\t\t\telse if(S.dir==1 && k==2) dd=1;\n\t\t\t\telse if(S.dir==2 && k==0) dd=1;\n\t\t\t\telse if(S.dir==2 && k==1) dd=2;\n\t\t\t\telse if(S.dir==2 && k==2) dd=0;\n\t\t\t}\n\t\t\telse{ // 5<=S.face && S.face<15\n\t\t\t\tif (S.dir==0 && k==0) dd=0;\n\t\t\t\telse if(S.dir==0 && k==1) dd=0;\n\t\t\t\telse if(S.dir==0 && k==2) dd=0;\n\t\t\t\telse if(S.dir==1 && k==0) dd=1;\n\t\t\t\telse if(S.dir==1 && k==1) dd=1;\n\t\t\t\telse if(S.dir==1 && k==2) dd=1;\n\t\t\t\telse if(S.dir==2 && k==0) dd=2;\n\t\t\t\telse if(S.dir==2 && k==1) dd=2;\n\t\t\t\telse if(S.dir==2 && k==2) dd=2;\n\t\t\t}\n\n\t\t\tif(dist[yy][xx][ff][dd]>dist[S.y][S.x][S.face][S.dir]+1){\n\t\t\t\tdist[yy][xx][ff][dd]=dist[S.y][S.x][S.face][S.dir]+1;\n\t\t\t\tQ[tail++]=(state){xx,yy,ff,dd};\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int gx,gy,f;scanf(\"%d%d%d\",&gx,&gy,&f),gx||gy||f;){\n\t\tgx+=100;\n\t\tgy+=100;\n\t\tprintf(\"%d\\n\",min(min(dist[gy][gx][f][0],dist[gy][gx][f][1]),dist[gy][gx][f][2]));\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":25596,"score_of_the_acc":-0.2038,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1319_10851601\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst int nt[20][3]={\\n{5,1,4},\\n{6,2,0},\\n{7,3,1},\\n{8,4,2},\\n{9,0,3},\\n{0,10,11},\\n{1,11,12},\\n{2,12,13},\\n{3,13,14},\\n{4,14,10},\\n{15,5,9},\\n{16,6,5},\\n{17,7,6},\\n{18,8,7},\\n{19,9,8},\\n{10,19,16},\\n{11,15,17},\\n{12,16,18},\\n{13,17,19},\\n{14,18,15}};\\nconst int tx[2][3]={{0,1,-1},{0,-1,1}},ty[2][3]={{1,0,0},{-1,0,0}};\\nmap<pair<pair<int,int>,pair<int,int> >,int> mp;\\nqueue<pair<pair<int,int>,pair<int,int> > > q;\\npair<pair<int,int>,pair<int,int> > t,tt;\\n\\nint main()\\n{\\n\\tint x,y,k,p,tp,xx,yy,kk,pp,s,i;\\n\\tt=make_pair(make_pair(0,0),make_pair(0,0));\\n\\tmp[t]=0;\\n\\tq.push(t);\\n\\twhile(!q.empty())\\n\\t{\\n\\t\\tt=q.front();\\n\\t\\tq.pop();\\n\\t\\tx=t.first.first;y=t.first.second;\\n\\t\\tk=t.second.first;p=t.second.second;\\n\\t\\ttp=(x+y)&1;\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t{\\n\\t\\t\\txx=x+tx[tp][i];yy=y+ty[tp][i];\\n\\t\\t\\tkk=nt[k][(i+p)%3];\\n\\t\\t\\tfor(pp=0;pp<3;pp++)\\n\\t\\t\\t\\tif(nt[kk][pp]==k)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\tpp=(pp+3-i)%3;\\n\\t\\t\\tif(!mp.count(tt=make_pair(make_pair(xx,yy),make_pair(kk,pp)))||mp[t]+1<mp[tt])\\n\\t\\t\\t\\tif((mp[tt]=mp[t]+1)<100)\\n\\t\\t\\t\\t\\tq.push(tt);\\n\\t\\t}\\n\\t}\\n\\twhile(~scanf(\\\"%d%d%d\\\",&x,&y,&k)&&(x||y||k))\\n\\t{\\n\\t\\ts=1<<30;\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t\\tif(mp.count(t=make_pair(make_pair(x,y),make_pair(k,i))))\\n\\t\\t\\t\\ts=min(s,mp[t]);\\n\\t\\tprintf(\\\"%d\\\\n\\\",s);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 59832,\n \"score_of_the_acc\": -0.7079,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1319_4865290\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,int> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nint next_num(int cur,int to){\\n to%=3;\\n if(to==0){\\n if(cur%10<5)return cur+5;\\n return cur-5;\\n }\\n if(cur<5)to=3-to;\\n if(cur<5 || cur>=15){\\n if(to==1){\\n if(cur%5==0)cur+=5;\\n return cur-1;\\n }\\n cur++;\\n if(cur%5==0)cur-=5;\\n return cur;\\n }\\n if(cur<10){\\n if(to==1)return cur+5;\\n cur+=6;\\n if(cur==15)cur=10;\\n return cur;\\n }\\n if(to==1)return cur-5;\\n cur-=6;\\n if(cur==4)cur=9;\\n return cur;\\n}\\n\\nP next_pos(P pos,int to){\\n to%=3;\\n int a=(to-1)*2-1;\\n if((pos.first+pos.second+(1<<20))%2){\\n if(to==0)return make_pair(pos.first,pos.second-1);\\n return make_pair(pos.first+a,pos.second);\\n }else{\\n if(to==0)return make_pair(pos.first,pos.second+1);\\n return make_pair(pos.first-a,pos.second);\\n }\\n}\\n\\nint dis[300][300][30][5];\\nconst int N=150;\\nqueue<tuple<P,int,P,int,int>> q1;//pos,num,bef_pos,bef_num,dis\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n int s;\\n int num;\\n P pos,bef_pos,pos2;\\n memset(dis,-1,sizeof(dis));\\n q1.push(make_tuple(P(N,N),0,P(N,N+1),5,0));\\n while(!q1.empty()){\\n tie(pos,a,bef_pos,b,c)=q1.front();q1.pop();\\n if(c>100)continue;\\n for(i=0;i<3;i++){\\n if(bef_pos==next_pos(pos,i))break;\\n }\\n for(j=0;j<3;j++){\\n if(b==next_num(a,j))break;\\n }\\n b=(j-i+3)%3;\\n if(dis[pos.first][pos.second][a][b]!=-1)continue;\\n dis[pos.first][pos.second][a][b]=c;\\n for(i=0;i<3;i++){\\n pos2=next_pos(pos,i);\\n num=next_num(a,i+b);\\n q1.push(make_tuple(pos2,num,pos,a,c+1));\\n }\\n }\\n while(cin>>a>>b>>c){\\n if(a==0 && b==0 && c==0)break;\\n a+=N,b+=N;\\n s=1e3;\\n for(i=0;i<3;i++){\\n if(dis[a][b][c][i]!=-1)s=min(s,dis[a][b][c][i]);\\n }\\n cout<<s<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 57048,\n \"score_of_the_acc\": -0.5139,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1319_4779930\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define NUM 20\\n\\nenum Type{\\n\\tUP,\\n\\tR_UP,\\n\\tR_DOWN,\\n\\tDOWN,\\n\\tL_DOWN,\\n\\tL_UP,\\n};\\n\\nstruct Info{\\n\\tvoid set(int arg_next_center,int arg_next_state){\\n\\t\\tnext_center = arg_next_center;\\n\\t\\tnext_state = arg_next_state;\\n\\t}\\n\\tint next_center,next_state;\\n};\\n\\nstruct State{\\n\\tState(int arg_center,int arg_state, int arg_x,int arg_y, int arg_sum_step){\\n\\t\\tcenter = arg_center;\\n\\t\\tstate = arg_state;\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t\\tsum_step = arg_sum_step;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\treturn sum_step > arg.sum_step; //ステップの昇順(PQ)\\n\\t}\\n\\tint center,state,x,y,sum_step;\\n};\\n\\nbool check[NUM][NUM];\\nint base[NUM][6] = { {-1,4,-1,1,-1,5}, //0\\n\\t\\t\\t\\t\\t{-1,0,-1,2,-1,6}, //1\\n\\t\\t\\t\\t\\t{-1,1,-1,3,-1,7}, //2\\n\\t\\t\\t\\t\\t{-1,2,-1,4,-1,8}, //3\\n\\t\\t\\t\\t\\t{-1,3,-1,0,-1,9}, //4\\n\\t\\t\\t\\t\\t{-1,0,-1,11,-1,10}, //5\\n\\t\\t\\t\\t\\t{-1,1,-1,12,-1,11}, //6,\\n\\t\\t\\t\\t\\t{-1,2,-1,13,-1,12}, //7\\n\\t\\t\\t\\t\\t{-1,3,-1,14,-1,13}, //8\\n\\t\\t\\t\\t\\t{-1,4,-1,10,-1,14}, //9\\n\\t\\t\\t\\t\\t{-1,9,-1,5,-1,15}, //10\\n\\t\\t\\t\\t\\t{-1,16,-1,5,-1,6}, //11\\n\\t\\t\\t\\t\\t{-1,7,-1,17,-1,6}, //12\\n\\t\\t\\t\\t\\t{-1,7,-1,8,-1,18}, //13\\n\\t\\t\\t\\t\\t{-1,9,-1,19,-1,8}, //14\\n\\t\\t\\t\\t\\t{-1,10,-1,16,-1,19}, //15\\n\\t\\t\\t\\t\\t{-1,11,-1,17,-1,15}, //16\\n\\t\\t\\t\\t\\t{-1,16,-1,12,-1,18}, //17\\n\\t\\t\\t\\t\\t{-1,17,-1,13,-1,19}, //18\\n\\t\\t\\t\\t\\t{-1,14,-1,15,-1,18}}; //19\\n\\nint STATES[NUM][6][6];\\nint min_dist[210][210][NUM],work[210][210][NUM][6];\\nInfo info[NUM][6][6];\\nType type_array[6] = {UP,R_UP,R_DOWN,DOWN,L_DOWN,L_UP};\\nType rev_type[6] = {DOWN,L_DOWN,L_UP,UP,R_UP,R_DOWN};\\n\\n\\nint main(){\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\n\\t\\t\\tSTATES[i][0][k] = base[i][k];\\n\\t\\t}\\n\\t\\t//手で持って見た時の遷移\\n\\t\\tfor(int k = 1; k <= 5; k++){\\n\\n\\t\\t\\tSTATES[i][k][UP] = STATES[i][k-1][L_UP];\\n\\t\\t\\tSTATES[i][k][R_UP] = STATES[i][k-1][UP];\\n\\t\\t\\tSTATES[i][k][R_DOWN] = STATES[i][k-1][R_UP];\\n\\t\\t\\tSTATES[i][k][DOWN] = STATES[i][k-1][R_DOWN];\\n\\t\\t\\tSTATES[i][k][L_DOWN] = STATES[i][k-1][DOWN];\\n\\t\\t\\tSTATES[i][k][L_UP] = STATES[i][k-1][L_DOWN];\\n\\t\\t}\\n\\t}\\n\\n\\t//遷移表の作成\\n\\tfor(int from = 0; from < NUM; from++){ //遷移元の中央\\n\\t\\tfor(int from_state = 0; from_state < 6; from_state++){\\n\\t\\t\\tfor(int a = 0; a < 6;a++){ //転がる方向\\n\\t\\t\\t\\tType dir = type_array[a];\\n\\n\\t\\t\\t\\tif(STATES[from][from_state][dir] == -1){\\n\\n\\t\\t\\t\\t\\tinfo[from][from_state][dir].set(-1,-1);\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tint to = STATES[from][from_state][dir];\\n\\t\\t\\t\\tType next_type = rev_type[dir];\\n\\t\\t\\t\\tfor(int b = 0; b < 6; b++){\\n\\t\\t\\t\\t\\tif(STATES[to][b][next_type] == from){\\n\\n\\t\\t\\t\\t\\t\\tinfo[from][from_state][dir].set(to,b);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint add_X = 100,add_Y = 100;\\n\\tfor(int i = 0; i < 210; i++){\\n\\t\\tfor(int k = 0; k < 210; k++){\\n\\t\\t\\tfor(int a = 0; a < NUM; a++){\\n\\n\\t\\t\\t\\tmin_dist[i][k][a] = BIG_NUM;\\n\\t\\t\\t\\tfor(int b = 0; b < 6; b++){\\n\\n\\t\\t\\t\\t\\twork[i][k][a][b] = BIG_NUM;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tmin_dist[add_X][add_Y][0] = 0;\\n\\twork[add_X][add_Y][0][1] = 0;\\n\\tpriority_queue<State> Q;\\n\\tQ.push(State(0,1,0,0,0));\\n\\n\\tint next_center,next_state,next_x,next_y,next_step;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_step == 100){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else if(Q.top().sum_step > work[Q.top().x+add_X][Q.top().y+add_Y][Q.top().center][Q.top().state]){\\n\\n\\t\\t\\tQ.pop();\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < 6; i++){\\n\\t\\t\\t\\tif(info[Q.top().center][Q.top().state][i].next_center == -1)continue;\\n\\n\\t\\t\\t\\tnext_center = info[Q.top().center][Q.top().state][i].next_center;\\n\\t\\t\\t\\tnext_state = info[Q.top().center][Q.top().state][i].next_state;\\n\\n\\t\\t\\t\\tType dir = type_array[i];\\n\\t\\t\\t\\tnext_x = Q.top().x;\\n\\t\\t\\t\\tnext_y = Q.top().y;\\n\\n\\t\\t\\t\\tnext_step = Q.top().sum_step+1;\\n\\n\\t\\t\\t\\t//さいころの遷移は目で見た時と逆\\n\\t\\t\\t\\tswitch(dir){\\n\\t\\t\\t\\tcase UP:\\n\\t\\t\\t\\t\\tnext_y++;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase L_UP:\\n\\t\\t\\t\\t\\tnext_x++;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase L_DOWN:\\n\\t\\t\\t\\t\\tnext_x++;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase DOWN:\\n\\t\\t\\t\\t\\tnext_y--;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase R_DOWN:\\n\\t\\t\\t\\t\\tnext_x--;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase R_UP:\\n\\t\\t\\t\\t\\tnext_x--;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(work[next_x+add_X][next_y+add_Y][next_center][next_state] > next_step){\\n\\t\\t\\t\\t\\twork[next_x+add_X][next_y+add_Y][next_center][next_state] = next_step;\\n\\t\\t\\t\\t\\tmin_dist[next_x+add_X][next_y+add_Y][next_center] = min(min_dist[next_x+add_X][next_y+add_Y][next_center],next_step);\\n\\t\\t\\t\\t\\tQ.push(State(next_center,next_state,next_x,next_y,next_step));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tint tmp_x,tmp_y,tmp_center;\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&tmp_x,&tmp_y,&tmp_center);\\n\\t\\tif(tmp_x == 0 && tmp_y == 0 && tmp_center == 0)break;\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",min_dist[tmp_x+add_X][tmp_y+add_Y][tmp_center]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 27444,\n \"score_of_the_acc\": -0.2322,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1319_3625408\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr int inf = 1e9;\\n\\ntemplate<typename T>\\nstd::vector<T> table(int n, T v) { return std::vector<T>(n, v); }\\n\\ntemplate <class... Args>\\nauto table(int n, Args... args) {\\n auto val = table(args...);\\n return std::vector<decltype(val)>(n, std::move(val));\\n}\\n\\nconstexpr int dx[3] = {1, 0, -1};\\nconstexpr int dy[2][3] = {\\n {0, 1, 0}, // (x + y) % 2 == 0\\n {0, -1, 0}\\n};\\n\\nconstexpr int df[20][2][3] = {\\n {{1, 5, 4}, {4, 5, 1}},\\n {{2, 6, 0}, {0, 6, 2}},\\n {{3, 7, 1}, {1, 7, 3}},\\n {{4, 8, 2}, {2, 8, 4}},\\n {{0, 9, 3}, {3, 9, 0}},\\n {{10, 0, 11}, {11, 0, 10}},\\n {{11, 1, 12}, {12, 1, 11}},\\n {{12, 2, 13}, {13, 2, 12}},\\n {{13, 3, 14}, {14, 3, 13}},\\n {{14, 4, 10}, {10, 4, 14}},\\n {{5, 15, 9}, {9, 15, 5}},\\n {{6, 16, 5}, {5, 16, 6}},\\n {{7, 17, 6}, {6, 17, 7}},\\n {{8, 18, 7}, {7, 18, 8}},\\n {{9, 19, 8}, {8, 19, 9}},\\n {{19, 10, 16}, {16, 10, 19}},\\n {{15, 11, 17}, {17, 11, 15}},\\n {{16, 12, 18}, {18, 12, 16}},\\n {{17, 13, 19}, {19, 13, 17}},\\n {{18, 14, 15}, {15, 14, 18}}\\n};\\nconstexpr int dd[3][2][3] = { // only used on 0, ..., 4, 15, ..., 19\\n {{2, 0, 1}, {1, 0, 2}},\\n {{1, 2, 0}, {0, 2, 1}},\\n {{0, 1, 2}, {2, 1, 0}}\\n};\\n\\nint main() {\\n constexpr int max_x = 201, max_y = 102;\\n constexpr int cx = 100, cy = 50;\\n auto in_range = [] (int x, int y) {\\n return 0 <= x && x < max_x && 0 <= y && y < max_y;\\n };\\n\\n int gx, gy, n;\\n while(cin >> gx >> gy >> n, gx | gy | n) {\\n gx += cx, gy += cy;\\n auto d = table(max_x, max_y, 20, 3, inf);\\n d[cx][cy][0][0] = 0;\\n queue<tuple<int, int, int, int>> que;\\n que.emplace(cx, cy, 0, 0);\\n int ans = inf;\\n while(!que.empty()) {\\n int x, y, f, dir; tie(x, y, f, dir) = que.front();\\n que.pop();\\n if(x == gx && y == gy && f == n) {\\n ans = d[x][y][f][dir];\\n break;\\n }\\n for(int i = 0; i < 3; ++i) {\\n const int nx = x + dx[i], ny = y + dy[(x + y) & 1][i];\\n int nf = 0, nd = 0;\\n if((x + y) & 1) {\\n nf = df[f][1][(i - dir + 3) % 3];\\n } else {\\n nf = df[f][0][(i + dir) % 3];\\n }\\n if((5 <= f && f < 15) || (5 <= nf && nf < 15)) {\\n nd = dir;\\n } else {\\n nd = dd[dir][(x + y) & 1][i];\\n }\\n if(!in_range(nx, ny) || d[nx][ny][nf][nd] != inf) continue;\\n d[nx][ny][nf][nd] = d[x][y][f][dir] + 1;\\n que.emplace(nx, ny, nf, nd);\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1750,\n \"memory_kb\": 26416,\n \"score_of_the_acc\": -0.5912,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1319_3228722\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nconst int N = 230;\\nconst int A = 108;\\n\\nconst int INF = 19191919;\\nconst int F = 20;\\nint dp[N][N][F][F];\\n\\nstruct State{\\n int x,y,b,s;\\n};\\n\\nint nxt[20][3]={\\n {5,1,4},\\n {6,2,0},\\n {7,3,1},\\n {8,4,2},\\n {9,0,3},\\n {0,10,11}, //5\\n {1,11,12},\\n {2,12,13},\\n {3,13,14},\\n {4,14,10},\\n {15,5,9}, //10\\n {16,6,5},\\n {17,7,6},\\n {18,8,7},\\n {19,9,8},\\n {10,19,16}, //15\\n {11,15,17},\\n {12,16,18},\\n {13,17,19},\\n {14,18,15}\\n};\\n\\nconst int dx[2][3]={{0,1,-1},{0,-1,1}};\\nconst int dy[2][3]={{1,0,0},{-1,0,0}};\\n\\nconst int LIM = 100;\\n\\nint main(){\\n rep(i,N)rep(j,N)rep(k,F)rep(l,F) dp[i][j][k][l] = INF;\\n dp[A][A][0][5] = 0;\\n queue<State> que;\\n que.push({A,A,0,5});\\n while(!que.empty()){\\n State c = que.front();\\n que.pop();\\n if(dp[c.x][c.y][c.b][c.s]>=LIM) continue;\\n\\n // printf(\\\"NOW : %d %d %d %d ::: %d\\\\n\\\",c.x,c.y,c.b,c.s,dp[c.x][c.y][c.b][c.s]);\\n\\n int ad = 0;\\n while(nxt[c.b][ad] != c.s) ++ad;\\n\\n int oe = (c.x+c.y)%2;\\n rep(i,3){\\n int nx = c.x+dx[oe][i], ny = c.y+dy[oe][i];\\n if(!(0<=nx && nx<N && 0<=ny && ny<N)) continue;\\n int noe = (nx+ny)%2;\\n\\n int nb = nxt[c.b][(i+ad)%3];\\n int ns = -1;\\n rep(j,3){\\n int xx = nx+dx[noe][j], yy = ny+dy[noe][j];\\n if(xx == c.x && yy == c.y){\\n int idx = 0;\\n while(nxt[nb][idx] != c.b) ++idx;\\n\\n idx = (idx-j+3)%3;\\n ns = nxt[nb][idx];\\n break;\\n }\\n }\\n assert(ns != -1);\\n\\n // printf(\\\" nx %d :: %d %d %d %d\\\\n\\\",i,nx,ny,nb,ns);\\n if(dp[nx][ny][nb][ns] > dp[c.x][c.y][c.b][c.s]+1){\\n dp[nx][ny][nb][ns] = dp[c.x][c.y][c.b][c.s]+1;\\n que.push({nx,ny,nb,ns});\\n }\\n }\\n }\\n\\n int x,y,n;\\n while(cin >>x >>y >>n){\\n if(x==0 && y==0 && n==0) break;\\n int ans = INF;\\n rep(i,F) ans = min(ans, dp[x+A][y+A][n][i]);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 85876,\n \"score_of_the_acc\": -0.7793,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1319_3057153\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <utility>\\n#include <cstring>\\nusing namespace std;\\ntypedef pair<int, int> pii;\\ntypedef vector<pii> vpi;\\n\\nstruct info{\\n int x,y,b,t;\\n int step;\\n bool isEven;\\n info(int x, int y, int b, int t, int s, bool e):x(x),y(y),b(b),t(t),step(s),isEven(e){}\\n info(){}\\n};\\nbool used[203][103][20][20];\\n\\nint main(){\\n vector<vector<vector<pii> > > next(20, vector<vector<pii> >(20));\\n //next, 右左上\\n //odd, 左右下\\n next[0][1] = vpi{pii{4, 9}, pii{5, 10}, pii{1, 0}};\\n next[0][4] = vpi{pii{5, 11}, pii{1, 6}, pii{4, 0}};\\n next[0][5] = vpi{pii{1, 2}, pii{4, 3}, pii{5, 0}};\\n next[1][0] = vpi{pii{6, 12}, pii{2, 7}, pii{0, 1}};\\n next[1][2] = vpi{pii{0, 5}, pii{6, 11}, pii{2, 1}};\\n next[1][6] = vpi{pii{2, 3}, pii{0, 4}, pii{6, 1}};\\n next[2][1] = vpi{pii{7, 13}, pii{3, 8}, pii{1, 2}};\\n next[2][3] = vpi{pii{1, 6}, pii{7, 12}, pii{3, 2}};\\n next[2][7] = vpi{pii{3, 4}, pii{1, 0}, pii{7, 2}};\\n next[3][2] = vpi{pii{8, 14}, pii{4, 9}, pii{2, 3}};\\n next[3][4] = vpi{pii{2, 7}, pii{8, 13}, pii{4, 3}};\\n next[3][8] = vpi{pii{4, 0}, pii{2, 1}, pii{8, 3}};\\n next[4][0] = vpi{pii{3, 8}, pii{9, 14}, pii{0, 4}};\\n next[4][3] = vpi{pii{9, 10}, pii{0, 5}, pii{3, 4}};\\n next[4][9] = vpi{pii{0, 1}, pii{3, 2}, pii{9, 4}};\\n next[5][0] = vpi{pii{10, 15}, pii{11, 16}, pii{0, 5}};\\n next[5][10] = vpi{pii{11, 6}, pii{0, 1}, pii{10, 5}};\\n next[5][11] = vpi{pii{0, 4}, pii{10, 9}, pii{11, 5}};\\n next[6][1] = vpi{pii{11, 16}, pii{12, 17}, pii{1, 6}};\\n next[6][11] = vpi{pii{12, 7}, pii{1, 2}, pii{11, 6}};\\n next[6][12] = vpi{pii{1, 0}, pii{11, 5}, pii{12, 6}};\\n next[7][2] = vpi{pii{12, 17}, pii{13, 18}, pii{2, 7}};\\n next[7][12] = vpi{pii{13, 8}, pii{2, 3}, pii{12, 7}};\\n next[7][13] = vpi{pii{2, 1}, pii{12, 6}, pii{13, 7}};\\n next[8][3] = vpi{pii{13, 18}, pii{14, 19}, pii{3, 8}};\\n next[8][13] = vpi{pii{14, 9}, pii{3, 4}, pii{13, 8}};\\n next[8][14] = vpi{pii{3, 2}, pii{13, 7}, pii{14, 8}};\\n next[9][4] = vpi{pii{14, 19}, pii{10, 15}, pii{4, 9}};\\n next[9][10] = vpi{pii{4, 3}, pii{14, 8}, pii{10, 9}};\\n next[9][14] = vpi{pii{10, 5}, pii{4, 0}, pii{14, 9}};\\n next[10][5] = vpi{pii{9, 14}, pii{15, 19}, pii{5, 10}};\\n next[10][9] = vpi{pii{15, 16}, pii{5, 11}, pii{9, 10}};\\n next[10][15] = vpi{pii{5, 0}, pii{9, 4}, pii{15, 10}};\\n next[11][5] = vpi{pii{16, 17}, pii{6, 12}, pii{5, 11}};\\n next[11][6] = vpi{pii{5, 10}, pii{16, 15}, pii{6, 11}};\\n next[11][16] = vpi{pii{6, 1}, pii{5, 0}, pii{16, 11}};\\n next[12][6] = vpi{pii{17, 18}, pii{7, 13}, pii{6, 12}};\\n next[12][7] = vpi{pii{6, 11}, pii{17, 16}, pii{7, 12}};\\n next[12][17] = vpi{pii{7, 2}, pii{6, 1}, pii{17, 12}};\\n next[13][7] = vpi{pii{18, 19}, pii{8, 14}, pii{7, 13}};\\n next[13][8] = vpi{pii{7, 12}, pii{18, 17}, pii{8, 13}};\\n next[13][18] = vpi{pii{8, 3}, pii{7, 2}, pii{18, 13}};\\n next[14][8] = vpi{pii{19, 15}, pii{9, 10}, pii{8, 14}};\\n next[14][9] = vpi{pii{8, 13}, pii{19, 18}, pii{9, 14}};\\n next[14][19] = vpi{pii{9, 4}, pii{8, 3}, pii{19, 14}};\\n next[15][10] = vpi{pii{19, 18}, pii{16, 17}, pii{10, 15}};\\n next[15][16] = vpi{pii{10, 9}, pii{19, 14}, pii{16, 15}};\\n next[15][19] = vpi{pii{16, 11}, pii{10, 5}, pii{19, 15}};\\n next[16][11] = vpi{pii{15, 19}, pii{17, 18}, pii{11, 16}};\\n next[16][15] = vpi{pii{17, 12}, pii{11, 6}, pii{15, 16}};\\n next[16][17] = vpi{pii{11, 5}, pii{15, 10}, pii{17, 16}};\\n next[17][12] = vpi{pii{16, 15}, pii{18, 19}, pii{12, 17}};\\n next[17][16] = vpi{pii{18, 13}, pii{12, 7}, pii{16, 17}};\\n next[17][18] = vpi{pii{12, 6}, pii{16, 11}, pii{18, 17}};\\n next[18][13] = vpi{pii{17, 16}, pii{19, 15}, pii{13, 18}};\\n next[18][17] = vpi{pii{19, 14}, pii{13, 8}, pii{17, 18}};\\n next[18][19] = vpi{pii{13, 7}, pii{17, 12}, pii{19, 18}};\\n next[19][14] = vpi{pii{18, 17}, pii{15, 16}, pii{14, 19}};\\n next[19][15] = vpi{pii{14, 8}, pii{18, 13}, pii{15, 19}};\\n next[19][18] = vpi{pii{15, 10}, pii{14, 9}, pii{18, 19}};\\n\\n while(1){\\n int tx,ty,n;\\n cin >> tx >> ty >> n;\\n if(tx==0 && ty==0 && n==0) break;\\n\\n memset(used, 0, sizeof(used));\\n queue<info> wait;\\n wait.push(info(0, 0, 0, 5, 0, true));\\n used[101][51][0][5] = true;\\n int ans = -1;\\n while(!wait.empty()){\\n int x = wait.front().x;\\n int y = wait.front().y;\\n int b = wait.front().b;\\n int t = wait.front().t;\\n int step = wait.front().step;\\n int isEven = wait.front().isEven;\\n wait.pop();\\n if(x == tx && y == ty && b == n){\\n ans = step;\\n break;\\n }\\n int dx[3], dy[3];\\n if(isEven){\\n dx[0] = 1; dx[1] = -1; dx[2] = 0;\\n dy[0] = 0; dy[1] = 0; dy[2] = 1;\\n }else{\\n dx[0] = -1; dx[1] = 1; dx[2] = 0;\\n dy[0] = 0; dy[1] = 0; dy[2] = -1;\\n }\\n for(int i=0; i<3; i++){\\n int nx = x +dx[i];\\n int ny = y +dy[i];\\n int nb = next[b][t][i].first;\\n int nt = next[b][t][i].second;\\n if(used[nx+101][ny+51][nb][nt]) continue;\\n used[nx+101][ny+51][nb][nt] = true;\\n wait.push(info(nx, ny, nb, nt, step+1, !isEven));\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 11556,\n \"score_of_the_acc\": -0.1507,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1319_2938738\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntypedef pair<Int, Int> P;\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\nvector<vector<P> > nx\\n{\\n {P(0,5),P(1,6),P(2,7),P(3,8),P(4,9)},\\n {P(0,1),P(4,3),P(9,14),P(10,15),P(5,11)},\\n {P(0,4),P(5,10),P(11,16),P(6,12),P(1,2)},\\n {P(1,0),P(6,11),P(12,17),P(7,13),P(2,3)},\\n {P(2,1),P(7,12),P(13,18),P(8,14),P(3,4)},\\n {P(3,2),P(8,13),P(14,19),P(9,10),P(4,0)},\\n {P(5,0),P(10,9),P(15,19),P(16,17),P(11,6)},\\n {P(6,1),P(11,5),P(16,15),P(17,18),P(12,7)},\\n {P(7,2),P(12,6),P(17,16),P(18,19),P(13,8)},\\n {P(8,3),P(13,7),P(18,17),P(19,15),P(14,9)},\\n {P(9,4),P(14,8),P(19,18),P(15,16),P(10,5)},\\n {P(15,10),P(19,14),P(18,13),P(17,12),P(16,11)}\\n};\\n\\nsigned char dp[203][203][21][21][6];\\nstruct st{\\n Int y,x,n,m,d;\\n st(Int y,Int x,Int n,Int m,Int d):y(y),x(x),n(n),m(m),d(d){}\\n};\\nconst Int CC = 101;\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n {\\n memset(dp,-1,sizeof(dp));\\n queue<st> q;\\n dp[CC][CC][0][5][0]=0;\\n q.emplace(CC,CC,0,5,0);\\n Int dyl[6]={0,0,1,0,0,-1};\\n Int dxl[6]={-1,-1,0,1,1,0};\\n Int dyr[6]={0,-1,0,0,1,0};\\n Int dxr[6]={1,0,-1,-1,0,1};\\n Int dyo[6]={1,0,0,-1,0,0}; \\n Int dxo[6]={0,1,1,0,-1,-1};\\n\\n auto push=[&](st a,st b){\\n if(~dp[a.y][a.x][a.n][a.m][a.d]) return;\\n dp[a.y][a.x][a.n][a.m][a.d]=dp[b.y][b.x][b.n][b.m][b.d]+1;\\n q.emplace(a);\\n };\\n \\n while(!q.empty()){\\n st s=q.front();q.pop();\\n if(dp[s.y][s.x][s.n][s.m][s.d]>100) break;\\n \\n Int k=0,l=0;\\n for(Int i=0;i<12;i++)\\n\\tfor(Int j=0;j<5;j++)\\n\\t if(nx[i][j]==P(s.n,s.m)) k=i,l=j;\\n \\n //cout<<k<<\\\" \\\"<<l<<endl;\\n \\n {// L\\n\\tst t=s;\\n\\tt.y+=dyl[s.d];\\n\\tt.x+=dxl[s.d];\\n\\ttie(t.n,t.m)=nx[k][(l+4)%5];\\n\\tt.d=(s.d+5)%6;\\t\\n\\tpush(t,s);\\n }\\n {// R\\n\\tst t=s;\\n\\tt.y+=dyr[s.d];\\n\\tt.x+=dxr[s.d];\\n\\ttie(t.n,t.m)=nx[k][(l+1)%5];\\n\\tt.d=(s.d+1)%6;\\t\\n\\tpush(t,s);\\n }\\n {// O\\n\\tst t=s;\\n\\tt.y+=dyo[s.d];\\n\\tt.x+=dxo[s.d];\\n\\tswap(t.n,t.m);\\n\\tt.d=(s.d+3)%6;\\t\\n\\tpush(t,s);\\n }\\n }\\n \\n \\n }\\n \\n \\n {\\n Int x,y,n;\\n while(cin>>x>>y>>n,x||y||n){\\n short ans=101;\\n x+=CC;y+=CC;\\n for(Int i=0;i<20;i++){\\n\\tfor(Int j=0;j<6;j++){\\n\\t if(dp[y][x][n][i][j]<0) continue;\\n\\t chmin(ans,dp[y][x][n][i][j]);\\n\\t}\\n }\\n cout<<ans<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 109956,\n \"score_of_the_acc\": -1.0177,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1319_2936600\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\n\\nunsigned char dp[205][205][20][20]; // dp zyanai kedo\\n\\nint even[20][3]={\\n {5,4,1},\\n {6,0,2},\\n {7,1,3},\\n {8,2,4},\\n {9,3,0},\\n {0,11,10},\\n {1,12,11},\\n {2,13,12},\\n {3,14,13},\\n {4,10,14},\\n {15,9,5},\\n {16,5,6},\\n {17,6,7},\\n {18,7,8},\\n {19,8,9},\\n {10,16,19},\\n {11,17,15},\\n {12,18,16},\\n {13,19,17},\\n {14,15,18}\\n};\\nint odd[20][3]={\\n {5,4,1},\\n {6,0,2},\\n {7,1,3},\\n {8,2,4},\\n {9,3,0},\\n {0,11,10},\\n {1,12,11},\\n {2,13,12},\\n {3,14,13},\\n {4,10,14},\\n {15,9,5},\\n {16,5,6},\\n {17,6,7},\\n {18,7,8},\\n {19,8,9},\\n {10,16,19},\\n {11,17,15},\\n {12,18,16},\\n {13,19,17},\\n {14,15,18}\\n};\\nint odx[]={0,-1,1};\\nint ody[]={-1,0,0};\\nint edx[]={0,-1,1};\\nint edy[]={1,0,0};\\nvoid init(){\\n for(int i=0;i<20;i++){\\n swap(odd[i][1],odd[i][2]);\\n }\\n for(int i=0;i<205;i++)\\n for(int j=0;j<205;j++)\\n for(int k=0;k<20;k++)\\n for(int l=0;l<20;l++)\\n dp[i][j][k][l]=200;\\n }\\n\\n struct point{\\n int cost,x,y,muki,sita;\\n };\\n\\n point A;\\n\\n void BFS(){\\n A.sita=0;\\n A.cost=0;\\n A.muki=5;\\n A.x=102;\\n A.y=102;\\n queue<point>q;\\n q.push(A);\\n dp[0][0][0][5]=0;\\n while(!q.empty()){\\n point P=q.front();q.pop();\\n int y=P.y;\\n int x=P.x;\\n int muki=P.muki;\\n int cost=P.cost;\\n int sita=P.sita; //cout<<y<<' '<<x<<' '<<sita<<endl;\\n //cout<<x-102<<' '<<y-120<<' '<<sita<<' '<<cost<<endl;\\n //if(cost==5)return;\\n\\n\\n if(cost%2){\\n int k=0;\\n for(int i=0;i<3;i++){\\n if(odd[sita][i]==muki){\\n k=i;\\n break;\\n }\\n }//continue;\\n for(int i=0;i<3;i++,k=(k+1)%3){\\n int yy=y+ody[i];\\n int xx=x+odx[i];\\n if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;\\n int nex_sita=odd[sita][k];\\n int nex_muki=sita;\\n int l=0;\\n //if(cost==1&&x==101&&y==102)cout<<i<<' '<<sita<<' '<<nex_sita<<' '<<muki<<endl;\\n for(int j=0;j<3;j++){\\n if(even[nex_sita][j]==sita){\\n l=j;\\n break;\\n }\\n }\\n if(i==0){\\n nex_muki=sita;\\n }\\n else if(i==1){\\n nex_muki=even[nex_sita][(l+1)%3];\\n }\\n else{\\n nex_muki=even[nex_sita][(l+2)%3];\\n }\\n if(dp[yy][xx][nex_sita][nex_muki]!=200)continue;\\n //if(cost==1&&x==101&&y==102)cout<<l<<' '<<nex_sita<<' '<<nex_muki<<endl;\\n //if(cost==1&&xx==101&&yy==102&&cost==1)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\\n dp[yy][xx][nex_sita][nex_muki]=cost+1;\\n A.sita=nex_sita;\\n A.cost=cost+1;\\n A.muki=nex_muki;\\n A.x=xx;\\n A.y=yy;\\n q.push(A);\\n }\\n }\\n else{\\n int k=0;\\n for(int i=0;i<3;i++){\\n if(even[sita][i]==muki){\\n k=i;\\n break;\\n }\\n }//continue;\\n for(int i=0;i<3;i++,k=(k+1)%3){\\n int yy=y+edy[i];\\n int xx=x+edx[i];\\n if( yy< 0 || xx< 0 || 204<xx || 204<yy )continue;\\n int nex_sita=even[sita][k];\\n int nex_muki=sita;\\n int l=0;\\n //if(cost==0&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\\n for(int j=0;j<3;j++){\\n if(odd[nex_sita][j]==sita){\\n l=j;\\n break;\\n }\\n }\\n if(i==0){\\n nex_muki=sita;\\n }\\n else if(i==1){\\n nex_muki=odd[nex_sita][(l+1)%3];\\n }\\n else{\\n nex_muki=odd[nex_sita][(l+2)%3];\\n }\\n if(dp[yy][xx][nex_sita][nex_muki]!=200)continue;\\n //if(cost==0&&xx==101&&yy==102&&cost==0)cout<<\\\"even\\\"<<i<<' '<<l<<' '<<sita<<' '<<nex_sita<<' '<<nex_muki<<endl;\\n //if(cost==2&&xx==0+102&&yy==101&&cost==2)cout<<sita<<' '<<nex_sita<<' '<<cost<<endl;\\n dp[yy][xx][nex_sita][nex_muki]=cost+1;\\n A.sita=nex_sita;\\n A.cost=cost+1;\\n A.muki=nex_muki;\\n A.x=xx;\\n A.y=yy;\\n q.push(A);\\n }\\n }\\n }\\n}\\n\\nsigned main(){\\n int x,y,c;\\n init();\\n BFS();\\n while(cin>>x>>y>>c){\\n if(!x&&!y&&!c)break;\\n x+=102;\\n y+=102;\\n int ans=1e9;\\n for(int i=0;i<20;i++){\\n ans=min(ans,(int)dp[y][x][c][i]);\\n }\\n cout<<ans<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 20116,\n \"score_of_the_acc\": -0.1631,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1319_2936551\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntypedef pair<Int, Int> P;\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\nvector<vector<P> > nx\\n{\\n {P(0,5),P(1,6),P(2,7),P(3,8),P(4,9)},\\n {P(0,1),P(4,3),P(9,14),P(10,15),P(5,11)},\\n {P(0,4),P(5,10),P(11,16),P(6,12),P(1,2)},\\n {P(1,0),P(6,11),P(12,17),P(7,13),P(2,3)},\\n {P(2,1),P(7,12),P(13,18),P(8,14),P(3,4)},\\n {P(3,2),P(8,13),P(14,19),P(9,10),P(4,0)},\\n {P(5,0),P(10,9),P(15,19),P(16,17),P(11,6)},\\n {P(6,1),P(11,5),P(16,15),P(17,18),P(12,7)},\\n {P(7,2),P(12,6),P(17,16),P(18,19),P(13,8)},\\n {P(8,3),P(13,7),P(18,17),P(19,15),P(14,9)},\\n {P(9,4),P(14,8),P(19,18),P(15,16),P(10,5)},\\n {P(15,10),P(19,14),P(18,13),P(17,12),P(16,11)}\\n};\\n\\nsigned char dp[203][203][21][21][6];\\nstruct st{\\n Int y,x,n,m,d;\\n st(Int y,Int x,Int n,Int m,Int d):y(y),x(x),n(n),m(m),d(d){}\\n};\\nconst Int CC = 101;\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n {\\n memset(dp,-1,sizeof(dp));\\n queue<st> q;\\n dp[CC][CC][0][5][0]=0;\\n q.emplace(CC,CC,0,5,0);\\n Int dyl[6]={0,0,1,0,0,-1};\\n Int dxl[6]={-1,-1,0,1,1,0};\\n Int dyr[6]={0,-1,0,0,1,0};\\n Int dxr[6]={1,0,-1,-1,0,1};\\n Int dyo[6]={1,0,0,-1,0,0}; \\n Int dxo[6]={0,1,1,0,-1,-1};\\n\\n auto push=[&](st a,st b){\\n if(~dp[a.y][a.x][a.n][a.m][a.d]) return;\\n dp[a.y][a.x][a.n][a.m][a.d]=dp[b.y][b.x][b.n][b.m][b.d]+1;\\n q.emplace(a);\\n };\\n \\n while(!q.empty()){\\n st s=q.front();q.pop();\\n if(dp[s.y][s.x][s.n][s.m][s.d]>100) break;\\n \\n Int k=0,l=0;\\n for(Int i=0;i<12;i++)\\n\\tfor(Int j=0;j<5;j++)\\n\\t if(nx[i][j]==P(s.n,s.m)) k=i,l=j;\\n \\n //cout<<k<<\\\" \\\"<<l<<endl;\\n \\n {// L\\n\\tst t=s;\\n\\tt.y+=dyl[s.d];\\n\\tt.x+=dxl[s.d];\\n\\ttie(t.n,t.m)=nx[k][(l+4)%5];\\n\\tt.d=(s.d+5)%6;\\t\\n\\tpush(t,s);\\n }\\n {// R\\n\\tst t=s;\\n\\tt.y+=dyr[s.d];\\n\\tt.x+=dxr[s.d];\\n\\ttie(t.n,t.m)=nx[k][(l+1)%5];\\n\\tt.d=(s.d+1)%6;\\t\\n\\tpush(t,s);\\n }\\n {// O\\n\\tst t=s;\\n\\tt.y+=dyo[s.d];\\n\\tt.x+=dxo[s.d];\\n\\tswap(t.n,t.m);\\n\\tt.d=(s.d+3)%6;\\t\\n\\tpush(t,s);\\n }\\n }\\n \\n \\n }\\n \\n \\n {\\n Int x,y,n;\\n while(cin>>x>>y>>n,x||y||n){\\n short ans=101;\\n x+=CC;y+=CC;\\n for(Int i=0;i<20;i++){\\n\\tfor(Int j=0;j<6;j++){\\n\\t if(dp[y][x][n][i][j]<0) continue;\\n\\t chmin(ans,dp[y][x][n][i][j]);\\n\\t}\\n }\\n cout<<ans<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 109956,\n \"score_of_the_acc\": -1.0177,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1319_2418810\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cstring>\\n#include <queue>\\n#include <utility>\\n\\nconst int drct[2][3][2] = {{{0, 1}, {-1, 0}, {1, 0}}, {{0, -1}, {1, 0}, {-1, 0}}};\\n\\nint sd_x, sd_y, bottom;\\n\\nstruct State {\\n\\tint x, y, bot, up, step;\\n\\t\\n\\tState() {}\\n\\tState(int x, int y, int bot, int up, int step): \\n\\t\\tx(x), y(y), bot(bot), up(up), step(step) {}\\n};\\n\\nint NEXT(int x, int t) {\\n\\tswitch (t) {\\n\\t\\tcase 0:\\n\\t\\t\\tif (x < 5 || (x >= 10 && x < 15)) return x + 5;\\n\\t\\t\\treturn x - 5;\\n\\t\\tcase 1:\\n\\t\\t\\tif (x < 5) return (x + 4) % 5;\\n\\t\\t\\tif (x < 10) return (x + 5 - 10 + 1) % 5 + 10;\\n\\t\\t\\tif (x < 15) return (x - 5 - 5 + 4) % 5 + 5;\\n\\t\\t\\treturn (x - 15 + 1) % 5 + 15;\\n\\t\\tcase 2:\\n\\t\\t\\tif (x < 5) return (x + 1) % 5;\\n\\t\\t\\tif (x < 10) return x + 5;\\n\\t\\t\\tif (x < 15) return x - 5;\\n\\t\\t\\treturn (x - 15 + 4) % 5 + 15;\\n\\t}\\n\\t\\n\\treturn -1;\\n}\\n\\nstd::pair<int, int> NEXT(int x, int up, int t) {\\n\\tint a = NEXT(x, (up + t) % 3), b;\\n\\tswitch ((up + t) % 3) {\\n\\t\\tcase 0:\\n\\t\\t\\tb = 0; break;\\n\\t\\tcase 1:\\n\\t\\t\\tif (x < 5 || x >= 15) b = 1;\\n\\t\\t\\telse b = 0;\\n\\t\\t\\tbreak;\\n\\t\\tcase 2:\\n\\t\\t\\tif (x < 5 || x >= 15) b = 2;\\n\\t\\t\\telse b = 0;\\n\\t\\t\\tbreak;\\n\\t}\\n\\treturn std::make_pair(a, (b + up) % 3);\\n}\\n\\nint dist[205][205][20][3];\\n\\nvoid BFS() {\\n\\tstatic std::queue<State> que;\\n\\tstatic State now;\\n\\t\\n\\tque.push(State(0, 0, 0, 0, 0));\\n\\tdist[0 + 100][0 + 100][0][0] = 0;\\n\\twhile (!que.empty()) {\\n\\t\\tnow = que.front(); que.pop();\\n\\t\\tif (now.step >= 100) break;\\n\\t\\tfor (int t = 0; t < 3; ++t) {\\n\\t\\t\\tint xx = now.x + drct[(now.x + now.y) & 1][t][0], \\n\\t\\t\\t\\tyy = now.y + drct[(now.x + now.y) & 1][t][1];\\n\\t\\t\\tint fir = NEXT(now.bot, now.up, t).first, \\n\\t\\t\\t\\tsec = NEXT(now.bot, now.up, t).second;\\n\\t\\t\\tif (~dist[xx + 100][yy + 100][fir][sec]) continue;\\n\\t\\t\\tdist[xx + 100][yy + 100][fir][sec] = now.step + 1;\\n\\t\\t\\tque.push(State(xx, yy, fir, sec, now.step + 1));\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\tmemset(dist, -1, sizeof dist);\\n\\tBFS();\\n\\t\\n\\twhile (~scanf(\\\"%d%d%d\\\", &sd_x, &sd_y, &bottom) && (sd_x || sd_y || bottom)) {\\n\\t\\tint ans = 0x3f3f3f3f;\\n\\t\\tfor (int t = 0; t < 3; ++t) if (~dist[sd_x + 100][sd_y + 100][bottom][t])\\n\\t\\t\\tans = std::min(ans, dist[sd_x + 100][sd_y + 100][bottom][t]);\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 12640,\n \"score_of_the_acc\": -0.0837,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1319_2395872\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\nvoid rA(int t[20]){\\n int u[20]={5,10,15,16,11,0,9,19,17,6,1,4,14,18,12,2,3,8,13,7};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n\\nvoid rB(int t[20]){\\n int u[20]={1,0,5,11,6,2,4,10,16,12,7,3,9,15,17,13,8,14,19,18};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n \\nvoid rC(int t[20]){\\n int u[20]={4,9,10,5,0,3,14,15,11,1,2,8,19,16,6,7,13,18,17,12};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n \\nvoid rD(int t[20]){\\n int u[20]={5,10,15,16,11,0,9,19,17,6,1,4,14,18,12,2,3,8,13,7};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n \\nvoid rE(int t[20]){\\n int u[20]={1,0,5,11,6,2,4,10,16,12,7,3,9,15,17,13,8,14,19,18};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n \\nvoid rF(int t[20]){\\n int u[20]={4,9,10,5,0,3,14,15,11,1,2,8,19,16,6,7,13,18,17,12};\\n int tmp[20];\\n for(int i=0;i<20;i++)tmp[i]=t[ u[i] ];\\n for(int i=0;i<20;i++)t[i]=tmp[i];\\n}\\n \\nstruct die{\\n int p[20];\\n bool operator < ( const die &A ) const {\\n for(int i=0;i<20;i++)\\n if(p[i]!=A.p[i])return (p[i]<A.p[i]);\\n return false;\\n }\\n};\\n \\n \\ntypedef pair<int,int> P;\\ntypedef pair< P , int > state;\\n \\ntypedef pair< P , int > PP;\\ntypedef unsigned int ull;\\n \\nmap< ull , int > d;\\nmap< PP , int > ans;\\nqueue< state > Q;\\nmap< die , int > dice;\\nmap< int , die > redice;\\n\\n\\nint dieId(die d){\\n if(dice.count(d)>0)return dice[d];\\n int res=dice.size();\\n dice[d]=res;\\n redice[res]=d;\\n return res;\\n}\\n\\nint RA(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rA(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\nint RB(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rB(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\nint RC(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rC(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\nint RD(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rD(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\nint RE(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rE(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\nint RF(int id){\\n static map<int,int> mp;\\n if(mp.count(id)>0)return mp[id];\\n die d=redice[id];\\n rF(d.p);\\n mp[id]=dieId(d);\\n return mp[id];\\n}\\n \\null getHash(state s){\\n ull res=0, B=5575777;\\n int x=s.first.first+150;\\n int y=s.first.second+150;\\n res=x*B+y;\\n die d=redice[s.second];\\n for(int i=0;i<20;i++)res=res*B+d.p[i];\\n return res;\\n}\\n \\nvoid Push(state s,int cost){\\n ull key=getHash(s);\\n if(d.count(key)>0)return;\\n d[key]=cost+1;\\n Q.push(s);\\n}\\n \\nint main(){\\n die v;\\n for(int i=0;i<20;i++)v.p[i]=i;\\n state si=state( P(0,0) , dieId(v) );\\n d[ getHash(si) ]=0;\\n Q.push(si);\\n \\n while(!Q.empty()){\\n state s=Q.front();Q.pop();\\n int cost=d[ getHash(s) ];\\n \\n int x=s.first.first;\\n int y=s.first.second;\\n int f=abs(x+y)%2;\\n die d=redice[ s.second ];\\n die tmpd=d;\\n int n=d.p[0];\\n \\n /*\\n cout<<x<<' '<<y<<' '<<cost<<' '<<n<<endl;\\n for(int i=0;i<20;i++)cout<<s.second.p[i]<<' ';\\n cout<<endl;\\n cout<<endl;\\n */\\n if( ans.count( PP(P(x,y), n ) ) == 0)\\n ans[ PP(P(x,y),n) ]=cost;\\n \\n if(cost==100)continue;\\n \\n \\n if(f==0){\\n state A=s;\\n A.first=P(x,y+1);\\n A.second=RA(s.second);\\n Push(A,cost);\\n \\n state B=s;\\n B.first=P(x+1,y);\\n B.second=RB(s.second);\\n Push(B,cost);\\n \\n state C=s;\\n C.first=P(x-1,y);\\n C.second=RC(s.second);\\n Push(C,cost);\\n \\n \\n }else{\\n state D=s;\\n D.first=P(x,y-1);\\n rD(d.p);\\n D.second=RD(s.second);\\n Push(D,cost);\\n \\n state E=s;\\n E.first=P(x-1,y);\\n rE(d.p);\\n E.second=RE(s.second);\\n Push(E,cost);\\n \\n state F=s;\\n F.first=P(x+1,y);\\n rF(d.p);\\n F.second=RF(s.second);\\n Push(F,cost);\\n }\\n }\\n\\n //cout<<dice.size()<<endl;\\n \\n while(1){\\n int x,y,n;\\n cin>>x>>y>>n;\\n if(x==0&&y==0&&n==0)break;\\n cout<< ans[ PP( P(x,y) , n ) ] <<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1950,\n \"memory_kb\": 64708,\n \"score_of_the_acc\": -0.9968,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1319_1850511\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nint dx[2][3] = { {0,-1,1},{0,1,-1} };\\nint dy[2][3] = { {1,0,0},{-1,0,0} };\\nstruct poly {\\n\\tint x;\\n\\tint y;\\n\\tint under;\\n\\tint front;\\n\\tint left;\\n\\tint right;\\n\\tint turn;\\n\\tint id;\\n\\tpoly() :x(101), y(101), under(0), front(5),turn(0),id(0) {\\n\\t\\tsetlr();\\n\\t}\\n\\tenum Way {\\n\\t\\tW_Front,\\n\\t\\tW_Left,\\n\\t\\tW_Right,\\n\\t};\\n\\tint typeflr[4][3] = {\\n\\t\\t{ 1,0,0 } ,\\n\\t\\t{ -1,1,1 },\\n\\t\\t{ 1,-1,-1 },\\n\\t\\t{ -1,0,0 }\\n\\t};\\n\\tint dflr[4][3] = {\\n\\t\\t{ 0,4,1 },\\n\\t\\t{ 0,1,0 },\\n\\t\\t{ 0,4,0 },\\n\\t\\t{ 0,1,4 },\\n\\t};\\n\\t//0 5 4 1\\n\\t//1 6 0 2\\n\\t//5 0 11 10\\n\\t//6 1 12 11\\n\\t//10 15 9 5\\n\\t//11 16 5 6\\n\\t//15 10 16 19\\n\\t// 16 11 17 15\\n\\tvoid setid() {\\n\\t\\tconst int ftype = under / 5;\\n\\t\\tconst int fnum = under % 5;\\n\\t\\tbool flag = false;\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tconst int atype = ftype + typeflr[ftype][i];\\n\\t\\t\\tconst int anum = (fnum + dflr[ftype][i]) % 5;\\n\\t\\t\\tconst int predict_front = atype * 5 + anum;\\n\\t\\t\\tif (predict_front == front) {\\n\\t\\t\\t\\tid = i;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvoid setlr() {\\n\\t\\t\\n\\t\\tconst int ftype = under / 5;\\n\\t\\tconst int fnum = under % 5;\\n\\t\\tbool flag = false;\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tconst int atype = ftype + typeflr[ftype][i];\\n\\t\\t\\tconst int anum = (fnum + dflr[ftype][i])%5;\\n\\t\\t\\tconst int predict_front = atype * 5 + anum;\\n\\t\\t\\tif (predict_front == front) {\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tconst int atype = ftype + typeflr[ftype][(i+1)%3];\\n\\t\\t\\t\\t\\tconst int anum = (fnum + dflr[ftype][(i + 1) % 3]) % 5;\\n\\t\\t\\t\\t\\tleft = atype * 5 + anum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tconst int atype = ftype + typeflr[ftype][(i + 2) % 3];\\n\\t\\t\\t\\t\\tconst int anum = (fnum + dflr[ftype][(i + 2) % 3]) % 5;\\n\\t\\t\\t\\t\\tright= atype * 5 + anum;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tflag = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(flag);\\n\\n\\t}\\n\\tvoid rotate_l() {\\n\\t\\tint c = left;\\n\\t\\tleft = right;\\n\\t\\tright = front;\\n\\t\\tfront = c;\\n\\t}\\n\\tvoid rotate(const Way way) {\\n\\t\\tx += dx[(x + y) % 2][way];\\n\\t\\ty += dy[(x + y) % 2][way];\\n\\t\\tif (way == W_Front) {\\n\\t\\t\\tswap(front, under);\\n\\t\\t\\tsetlr();\\n\\t\\t}\\n\\t\\telse if (way == W_Left) {\\n\\t\\t\\tswap(left, under);\\n\\t\\t\\t{\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t\\tsetlr();\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tswap(right, under);\\n\\t\\t\\t{\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t\\tsetlr();\\n\\t\\t\\t\\trotate_l();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsetid();\\n\\t\\tturn++;\\n\\t}\\n\\tvoid rotate(const int way) {\\n\\t\\trotate(static_cast<Way>(way));\\n\\t}\\n};\\n\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tint x, y, u; cin >> x >> y >> u;\\n\\t\\tif (!x&&!y&&!u)break;\\n\\t\\tx += 101;\\n\\t\\ty += 101;\\n\\n\\t\\tvector<vector<vector<vector<int>>>>memo(203, vector<vector<vector<int>>>(203, vector<vector<int>>(20, vector<int>(3,1e9))));\\n\\t\\tqueue<poly>que;\\n\\t\\tmemo[101][101][0][0] = 0;\\n\\t\\tque.push(poly());\\n\\t\\tint ans = -1;\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tpoly atop(que.front());\\n\\t\\t\\tif (atop.x == x&&atop.y == y&&atop.under == u) {\\n\\t\\t\\t\\tans = atop.turn;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tque.pop();\\n\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\tpoly apoly(atop);\\n\\t\\t\\t\\tapoly.rotate(i);\\n\\t\\t\\t\\tif (memo[apoly.x][apoly.y][apoly.under][apoly.id]>apoly.turn) {\\n\\t\\t\\t\\t\\tmemo[apoly.x][apoly.y][apoly.under][apoly.id] = apoly.turn;\\n\\t\\t\\t\\t\\tque.push(apoly);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4560,\n \"memory_kb\": 52104,\n \"score_of_the_acc\": -1.454,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1319_1544762\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<tuple>\\n#include<vector>\\n\\nusing namespace std;\\n\\nint mem[223][223][22][3];\\n\\nint neighbors[][3]={\\n {5,4,1},\\n {6,0,2},\\n {7,1,3},\\n {8,2,4},\\n {9,3,0},\\n {0,11,10},\\n {1,12,11},\\n {2,13,12},\\n {3,14,13},\\n {4,10,14},\\n {15,9,5},\\n {16,5,6},\\n {17,6,7},\\n {18,7,8},\\n {19,8,9},\\n {10,16,19},\\n {11,17,15},\\n {12,18,16},\\n {13,19,17},\\n {14,15,18},\\n};\\n\\nint main(){\\n fill(***begin(mem),***end(mem),1e9);\\n vector<tuple<int,int,int,int> > vs[123];\\n vs[0].emplace_back(0,0,0,0);\\n for(int i=0;i<=100;i++){\\n // cout<<\\\"vs = \\\"<<vs[i].size()<<endl;\\n while(!vs[i].empty()){\\n int y,x,f,d;\\n tie(y,x,f,d)=vs[i].back();\\n vs[i].pop_back();\\n if(mem[y+100][x+100][f][d]<1e8){\\n\\t//\\tcout<<i<<endl;\\n\\tcontinue;\\n }\\n // cout<<i<<' '<<x<<' '<<y<<' '<<f<<' '<<d<<endl;\\n mem[y+100][x+100][f][d]=i;\\n int n[3];\\n for(int j=0;j<3;j++){\\n\\tn[j]=neighbors[f][(d+j)%3];\\n }\\n for(int j=0;j<3;j++){\\n\\tstatic int dy[][3]={{1,0,0},{0,-1,0}};\\n\\tstatic int dx[][3]={{0,-1,1},{-1,0,1}};\\n\\tstatic int l[][3]={{1,2,0},{2,0,1}};\\n\\tint b=(abs(y)+abs(x))%2;\\n\\tvs[i+1].emplace_back(y+dy[b][j],x+dx[b][j],n[j],(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3);\\n\\t{\\n\\t int ny=y+dy[b][j],nx=x+dx[b][j],nf=n[j],nd=(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3;\\n\\t int n[3];\\n\\t for(int j=0;j<3;j++){\\n\\t n[j]=neighbors[nf][(nd+j)%3];\\n\\t }\\n\\t bool flag=false;\\n\\t for(int j=0;j<3;j++){\\n\\t static int dy[][3]={{1,0,0},{0,-1,0}};\\n\\t static int dx[][3]={{0,-1,1},{-1,0,1}};\\n\\t static int l[][3]={{1,2,0},{2,0,1}};\\n\\t int b=(abs(ny)+abs(nx))%2;\\n\\t flag|=y==ny+dy[b][j]&&x==nx+dx[b][j]&&f==n[j]&&d==(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),nf)-begin(neighbors[n[j]])-l[b][j]+3)%3;\\n\\t }\\n\\t if(!flag){\\n\\t cout<<\\\"a\\\"<<' '<<x<<' '<<y<<' '<<f<<' '<<d<<endl;\\n\\t }\\n\\t}\\n }\\n }\\n }\\n int x=13,y=-13,f=2,d=0;\\n for(int i=28;i>0;i--){\\n int n[3];\\n for(int j=0;j<3;j++){\\n\\tn[j]=neighbors[f][(d+j)%3];\\n }\\n for(int j=0;j<3;j++){\\n static int dy[][3]={{1,0,0},{0,-1,0}};\\n static int dx[][3]={{0,-1,1},{-1,0,1}};\\n static int l[][3]={{1,2,0},{2,0,1}};\\n int b=(abs(y)+abs(x))%2;\\n int ny=y+dy[b][j],nx=x+dx[b][j],nf=n[j],nd=(find(begin(neighbors[n[j]]),end(neighbors[n[j]]),f)-begin(neighbors[n[j]])-l[b][j]+3)%3;\\n if(mem[ny+100][nx+100][nf][nd]==i-1){\\n\\ty=ny;\\n\\tx=nx;\\n\\tf=nf;\\n\\td=nd;\\n\\tcout<<i<<' '<<y<<' '<<x<<' '<<f<<' '<<d<<endl;\\n\\tbreak;\\n }\\n }\\n }\\n \\n \\n \\n for(int x,y,n;cin>>x>>y>>n,x|y|n;){\\n // for(int i=0;i<3;i++){\\n // cout<<mem[y+100][x+100][n][i]<<' ';\\n // }\\n // cout<<endl;\\n cout<<*min_element(begin(mem[y+100][x+100][n]),end(mem[y+100][x+100][n]))<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 57088,\n \"score_of_the_acc\": -0.5187,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1319_1137654\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<queue>\\nusing namespace std;\\nint dx[2][3]={{-1,1,0},{1,-1,0}};\\nint dy[2][3]={{0,0,1},{0,0,-1}};\\nint dd[2][3]={{1,2,0},{2,1,0}};\\nint dv[20][3]={\\n{4,1,5},\\n{0,2,6},\\n{1,3,7},\\n{2,4,8},\\n{3,0,9},\\n{11,10,0},\\n{12,11,1},\\n{13,12,2},\\n{14,13,3},\\n{10,14,4},\\n{9,5,15},\\n{5,6,16},\\n{6,7,17},\\n{7,8,18},\\n{8,9,19},\\n{16,19,10},\\n{17,15,11},\\n{18,16,12},\\n{19,17,13},\\n{15,18,14},\\n};\\nint bfs[230][230][21][3];\\nint ABS(int a){return max(a,-a);}\\nint main(){\\n\\tint a,b,c;\\n\\t\\tint T=110;\\n\\t\\tfor(int i=0;i<230;i++)for(int j=0;j<230;j++)\\n\\t\\t\\tfor(int k=0;k<21;k++)for(int l=0;l<3;l++)\\n\\t\\t\\t\\tbfs[i][j][k][l]=-1;\\n\\t\\tqueue<pair<pair<int,int>,pair<int,int> > >Q;\\n\\t\\tQ.push(make_pair(make_pair(0,0),make_pair(0,0)));\\n\\t\\tbfs[T][T][0][0]=0;\\n\\t\\twhile(Q.size()){\\n\\t\\t\\tint x=Q.front().first.first;\\n\\t\\t\\tint y=Q.front().first.second;\\n\\t\\t\\tint st=Q.front().second.first;\\n\\t\\t\\tint rot=Q.front().second.second;\\n\\t\\t\\tQ.pop();\\n\\t\\t//\\tif(bfs[x+T][y+T][st][rot]<=5)printf(\\\"%d %d %d %d: %d\\\\n\\\",x,y,st,rot,bfs[x+T][y+T][st][rot]);\\n\\t\\t\\t\\t\\n\\t\\t\\tint t=ABS(x+y)%2;\\n\\t\\t\\tfor(int i=0;i<3;i++){\\n\\t\\t\\t\\tint nx=x+dx[t][i];\\n\\t\\t\\t\\tint ny=y+dy[t][i];\\n\\t\\t\\t\\tint ns=dv[st][(rot+i)%3];\\n\\t\\t\\t\\tint nd;\\n\\t\\t\\t\\tfor(int j=0;j<3;j++)if(dv[ns][j]==st){nd=(j+3-i)%3;break;}\\n\\t\\t\\t\\tif(nx<-T||nx>T||ny<-T||ny>T)continue;\\n\\t\\t\\t\\tif(!~bfs[nx+T][ny+T][ns][nd]){\\n\\t\\t\\t\\t\\tbfs[nx+T][ny+T][ns][nd]=bfs[x+T][y+T][st][rot]+1;\\n\\t\\t\\t\\t\\tQ.push(make_pair(make_pair(nx,ny),make_pair(ns,nd)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\twhile(scanf(\\\"%d%d%d\\\",&a,&b,&c),a||b||c){\\n\\t\\tint ret=99999999;\\n\\t\\tfor(int i=0;i<3;i++)if(~bfs[a+T][b+T][c][i])ret=min(ret,bfs[a+T][b+T][c][i]);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 14276,\n \"score_of_the_acc\": -0.1234,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1319_1092151\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <queue>\\n#include <cmath>\\n#include <algorithm>\\n#include <functional>\\n#include <map>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define pb push_back\\n#define fs first\\n#define sc second\\n#define show(x) cout << #x << \\\" = \\\" << x << endl\\ntypedef pair<int,int> P;\\nstruct state{\\n\\tP p;\\n\\tint b,m;\\n\\tbool operator < (const state& l) const{\\n\\t\\tif(l.p!=p) return l.p<p;\\n\\t\\tif(l.b!=b) return l.b<b;\\n\\t\\treturn l.m<m;\\n\\t}\\n};\\nmap<state,int> d;\\nP trans[20][20][3];\\nvoid a(int a,int b,int c,int d,int e,int f){\\n\\ttrans[a][b][0]=P(b,a);\\n\\ttrans[a][b][1]=P(c,d);\\n\\ttrans[a][b][2]=P(e,f);\\n}\\nint dx[3]={0,1,-1},dy[3]={1,0,0};\\nqueue<state> que;\\nint main(){\\n\\ta(0,5,1,2,4,3);\\n\\ta(0,4,5,11,1,6);\\n\\ta(0,1,4,9,5,10);\\n\\ta(1,6,2,3,0,4);\\n\\ta(1,0,6,12,2,7);\\n\\ta(1,2,0,5,6,11);\\n\\ta(2,7,3,4,1,0);\\n\\ta(2,3,1,6,7,12);\\n\\ta(2,1,7,13,3,8);\\n\\ta(3,8,4,0,2,1);\\n\\ta(3,4,2,7,8,13);\\n\\ta(3,2,8,14,4,9);\\n\\ta(4,9,0,1,3,2);\\n\\ta(4,0,3,8,9,14);\\n\\ta(4,3,9,10,0,5);\\n\\ta(5,0,10,15,11,16);\\n\\ta(5,10,11,6,0,1);\\n\\ta(5,11,0,4,10,9);\\n\\ta(6,1,11,16,12,17);\\n\\ta(6,11,12,7,1,2);\\n\\ta(6,12,1,0,11,5);\\n\\ta(7,2,12,17,13,18);\\n\\ta(7,12,13,8,2,3);\\n\\ta(7,13,2,1,12,6);\\n\\ta(8,3,13,18,14,19);\\n\\ta(8,13,14,9,3,4);\\n\\ta(8,14,3,2,13,7);\\n\\ta(9,4,14,19,10,15);\\n\\ta(9,14,10,5,4,0);\\n\\ta(9,10,4,3,14,8);\\n\\ta(10,5,9,14,15,19);\\n\\ta(10,9,15,16,5,11);\\n\\ta(10,15,5,0,9,4);\\n\\ta(11,5,16,17,6,12);\\n\\ta(11,16,6,1,5,0);\\n\\ta(11,6,5,10,16,15);\\n\\ta(12,7,6,11,17,16);\\n\\ta(12,6,17,18,7,13);\\n\\ta(12,17,7,2,6,1);\\n\\ta(13,18,8,3,7,2);\\n\\ta(13,8,7,12,18,17);\\n\\ta(13,7,18,19,8,14);\\n\\ta(14,19,9,4,8,3);\\n\\ta(14,9,8,13,19,18);\\n\\ta(14,8,19,15,9,10);\\n\\ta(15,10,19,18,16,17);\\n\\ta(15,19,16,11,10,5);\\n\\ta(15,16,10,9,19,14);\\n\\ta(16,11,15,19,17,18);\\n\\ta(16,15,17,12,11,6);\\n\\ta(16,17,11,5,15,10);\\n\\ta(17,12,16,15,18,19);\\n\\ta(17,16,18,13,12,7);\\n\\ta(17,18,12,6,16,11);\\n\\ta(18,13,17,16,19,15);\\n\\ta(18,17,19,14,13,8);\\n\\ta(18,19,13,7,17,12);\\n\\ta(19,14,18,17,15,16);\\n\\ta(19,18,15,10,14,9);\\n\\ta(19,15,14,8,18,13);\\n\\tstate start={P(0,0),0,5};\\n\\tque.push(start);\\n\\td[start]=0;\\n\\twhile(true){\\n\\t\\tstate s=que.front();\\n\\t\\tif(d[s]>100) break;\\n\\t\\tque.pop();\\n\\t\\tP p=s.p;\\n\\t\\tint k=((p.fs+p.sc+10000)%2==0?1:-1);\\n\\t\\t//show(k);\\n\\t\\t// show(p.fs);\\n\\t\\t// show(p.sc);\\n\\t\\t// show(s.b);\\n\\t\\t// show(s.m);\\n\\t\\t// cout<<endl;\\n\\t\\trep(i,3){\\n\\t\\t\\tP np=P(p.fs+dx[i]*k,p.sc+dy[i]*k);\\n\\t\\t\\tstate nstate={np,trans[s.b][s.m][i].fs,trans[s.b][s.m][i].sc};\\n\\t\\t\\tif(d.find(nstate)!=d.end()) continue;\\n\\t\\t\\td[nstate]=d[s]+1;\\n\\t\\t\\t// show(np.fs);\\n\\t\\t\\t// show(np.sc);\\n\\t\\t\\t// show(nstate.b);\\n\\t\\t\\tque.push(nstate);\\n\\t\\t}\\n\\t}\\n\\twhile(true){\\n\\t\\tint x,y,z;\\n\\t\\tscanf(\\\"%d%d%d\\\",&x,&y,&z);\\n\\t\\tif(x==0&&y==0&&z==0) break;\\n\\t\\tint ret=1e5;\\n\\t\\trep(i,20){\\n\\t\\t\\tif(d.find({P(x,y),z,i})==d.end()) continue;\\n\\t\\t\\tret=min(ret,d[state{P(x,y),z,i}]);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 59652,\n \"score_of_the_acc\": -0.6863,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1319_1040899\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <bitset>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <ctime>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\\n\\nint dp[202][202][20][3];\\n\\nvoid A_up(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid A_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid A_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_down(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid B_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid init(){\\n static int x,y,n,p,n0,p0;\\n static queue<int> Q;\\n memset(dp,-1,sizeof(dp));\\n dp[100][100][0][2]=0;\\n while(!Q.empty())Q.pop();\\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\\n while(!Q.empty()){\\n x=Q.front();Q.pop();\\n y=Q.front();Q.pop();\\n n=Q.front();Q.pop();\\n p=Q.front();Q.pop();\\n if(dp[x][y][n][p]==100)return;\\n if((x+y)%2){\\n n0=n,p0=p;\\n B_down(n0,p0);\\n if(dp[x][y-1][n0][p0]==-1){\\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n else{\\n n0=n,p0=p;\\n A_up(n0,p0);\\n if(dp[x][y+1][n0][p0]==-1){\\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n }\\n}\\n\\nbool solve(){\\n static int x,y,n;\\n if(scanf(\\\"%d%d%d\\\",&x,&y,&n)!=3||((x|y|n)==0))return false;\\n x+=100;\\n y+=100;\\n static int ans,i;\\n ans=100;\\n for(i=0;i<3;i++)\\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\\n ans=dp[x][y][n][i];\\n printf(\\\"%d\\\\n\\\",ans);\\n return true;\\n}\\n\\nint main(){\\n init();\\n while(solve());\\n return 0;\\n}\\n/*\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <bitset>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <ctime>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\\n\\nint dp[202][202][20][3];\\n\\nvoid A_up(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid A_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid A_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_down(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid B_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid init(){\\n static int x,y,n,p,n0,p0;\\n static queue<int> Q;\\n memset(dp,-1,sizeof(dp));\\n dp[100][100][0][2]=0;\\n while(!Q.empty())Q.pop();\\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\\n while(!Q.empty()){\\n x=Q.front();Q.pop();\\n y=Q.front();Q.pop();\\n n=Q.front();Q.pop();\\n p=Q.front();Q.pop();\\n if(dp[x][y][n][p]==100)return;\\n if((x+y)%2){\\n n0=n,p0=p;\\n B_down(n0,p0);\\n if(dp[x][y-1][n0][p0]==-1){\\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n else{\\n n0=n,p0=p;\\n A_up(n0,p0);\\n if(dp[x][y+1][n0][p0]==-1){\\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n }\\n}\\n\\nbool solve(){\\n static int x,y,n;\\n if(scanf(\\\"%d%d%d\\\",&x,&y,&n)!=3||((x|y|n)==0))return false;\\n x+=100;\\n y+=100;\\n static int ans,i;\\n ans=100;\\n for(i=0;i<3;i++)\\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\\n ans=dp[x][y][n][i];\\n printf(\\\"%d\\\\n\\\",ans);\\n return true;\\n}\\n\\nint main(){\\n init();\\n while(solve());\\n return 0;\\n}\\n#include <vector>\\n#include <list>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <bitset>\\n#include <algorithm>\\n#include <functional>\\n#include <numeric>\\n#include <utility>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <ctime>\\n#include <cstring>\\n\\nusing namespace std;\\n\\nconst int f[20][3]={{1,4,5},{2,0,6},{3,1,7},{4,2,8},{0,3,9},{0,10,11},{1,11,12},{2,12,13},{3,13,14},{4,14,10},{5,9,15},{6,5,16},{7,6,17},{8,7,18},{9,8,19},{10,19,16},{11,15,17},{12,16,18},{13,17,19},{14,18,15}};\\n\\nint dp[202][202][20][3];\\n\\nvoid A_up(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid A_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid A_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_down(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][p];\\n if(f[n][0]==tmp)p=0;\\n else if(f[n][1]==tmp)p=1;\\n else p=2;\\n}\\n\\nvoid B_left(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+1)%3];\\n if(f[n][0]==tmp)p=2;\\n else if(f[n][1]==tmp)p=0;\\n else p=1;\\n}\\n\\nvoid B_right(int &n,int &p){\\n static int tmp;\\n tmp=n;\\n n=f[n][(p+2)%3];\\n if(f[n][0]==tmp)p=1;\\n else if(f[n][1]==tmp)p=2;\\n else p=0;\\n}\\n\\nvoid init(){\\n static int x,y,n,p,n0,p0;\\n static queue<int> Q;\\n memset(dp,-1,sizeof(dp));\\n dp[100][100][0][2]=0;\\n while(!Q.empty())Q.pop();\\n Q.push(100);Q.push(100);Q.push(0);Q.push(2);\\n while(!Q.empty()){\\n x=Q.front();Q.pop();\\n y=Q.front();Q.pop();\\n n=Q.front();Q.pop();\\n p=Q.front();Q.pop();\\n if(dp[x][y][n][p]==100)return;\\n if((x+y)%2){\\n n0=n,p0=p;\\n B_down(n0,p0);\\n if(dp[x][y-1][n0][p0]==-1){\\n dp[x][y-1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y-1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n B_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n else{\\n n0=n,p0=p;\\n A_up(n0,p0);\\n if(dp[x][y+1][n0][p0]==-1){\\n dp[x][y+1][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x);Q.push(y+1);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_left(n0,p0);\\n if(dp[x-1][y][n0][p0]==-1){\\n dp[x-1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x-1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n n0=n,p0=p;\\n A_right(n0,p0);\\n if(dp[x+1][y][n0][p0]==-1){\\n dp[x+1][y][n0][p0]=dp[x][y][n][p]+1;\\n Q.push(x+1);Q.push(y);Q.push(n0);Q.push(p0);\\n }\\n }\\n }\\n}\\n\\nbool solve(){\\n static int x,y,n;\\n if(scanf(\\\"%d%d%d\\\",&x,&y,&n)!=3||((x|y|n)==0))return false;\\n x+=100;\\n y+=100;\\n static int ans,i;\\n ans=100;\\n for(i=0;i<3;i++)\\n if(dp[x][y][n][i]!=-1&&(ans>dp[x][y][n][i]))\\n ans=dp[x][y][n][i];\\n printf(\\\"%d\\\\n\\\",ans);\\n return true;\\n}\\n\\nint main(){\\n init();\\n while(solve());\\n return 0;\\n}\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 11068,\n \"score_of_the_acc\": -0.0688,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1319_664786\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<algorithm>\\n#include<cassert>\\nusing namespace std;\\n#define rep(i, n) for ( int i = 0; i < n; i++)\\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\\nstatic const int dx[3] = {0, -1, 1};\\nstatic const int dy[3] = {1, 0, 0};\\n\\nstatic const int MAX = 305;\\nstatic const int SHIFT = 150;\\n\\nclass State{\\npublic:\\n int x, y, b, r, c;\\n State(){}\\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\\n};\\n\\nState getNext(State u, int r){\\n int nx = dx[r];\\n int ny = dy[r];\\n \\n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\\n nx += u.x;\\n ny += u.y;\\n\\n int bt[3], nt[3];\\n\\n rep(i, 3) bt[i] = C[u.b][i];\\n rotate(bt, bt + u.r, bt + 3);\\n int nb = bt[r]; // next bottom\\n\\n rep(i, 3) nt[i] = C[nb][i];\\n int nr = -1; // next rotate\\n rep(i, 3){\\n if ( u.b == nt[r] ){ nr = i; break; }\\n rotate(nt, nt+1, nt+3);\\n }\\n\\n return State(nx, ny, nb, nr);\\n}\\n\\nbool vis[MAX][MAX][20][3];\\n\\nint bfs(int gx, int gy, int gb){\\n queue<State> Q;\\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\\n\\n Q.push(State(SHIFT, SHIFT, 0, 0));\\n vis[SHIFT][SHIFT][0][0] = true;\\n State u, v;\\n\\n while(1){\\n u = Q.front(); Q.pop();\\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\\n rep(r, 3){\\n v = getNext(u, r);\\n if ( !vis[v.x][v.y][v.b][v.r] ){\\n\\tvis[v.x][v.y][v.b][v.r] = true;\\n\\tv.c = u.c + 1;\\n\\tQ.push(v);\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int gx, gy, gb;\\n while(1){\\n cin >> gx >> gy >> gb;\\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\\n gx += SHIFT;\\n gy += SHIFT;\\n cout << bfs(gx, gy, gb) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2060,\n \"memory_kb\": 6996,\n \"score_of_the_acc\": -0.4763,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1319_659078\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<algorithm>\\nusing namespace std;\\n#define rep(i, n) for ( int i = 0; i < n; i++)\\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\\nstatic const int dx[3] = {0, -1, 1};\\nstatic const int dy[3] = {1, 0, 0};\\nstatic const int MAX = 205;\\nstatic const int SHIFT = 102;\\n\\nclass State{\\npublic:\\n int x, y, b, r, c;\\n State(){}\\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\\n};\\n\\nState getNext(State u, int r){\\n int bt[3], nt[3], nb, nr = -1;\\n int nx = dx[r];\\n int ny = dy[r];\\n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\\n nx += u.x;\\n ny += u.y;\\n\\n rep(i, 3) bt[i] = C[u.b][i];\\n rotate(bt, bt + u.r, bt + 3);\\n nb = bt[r]; // next bottom\\n rep(i, 3) nt[i] = C[nb][i];\\n\\n rep(i, 3){\\n if ( u.b == nt[r] ){ nr = i; break; }\\n rotate(nt, nt+1, nt+3);\\n }\\n\\n return State(nx, ny, nb, nr);\\n}\\n\\nint bfs(int gx, int gy, int gb){\\n bool vis[MAX][MAX][20][3];\\n queue<State> Q;\\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\\n Q.push(State(SHIFT, SHIFT, 0, 0));\\n vis[SHIFT][SHIFT][0][0] = true;\\n State u, v;\\n while(1){\\n u = Q.front(); Q.pop();\\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\\n rep(r, 3){\\n v = getNext(u, r);\\n if ( !vis[v.x][v.y][v.b][v.r] ){\\n\\tvis[v.x][v.y][v.b][v.r] = true;\\n\\tv.c = u.c + 1;\\n\\tQ.push(v);\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int gx, gy, gb;\\n while(1){\\n cin >> gx >> gy >> gb;\\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\\n gx += SHIFT;\\n gy += SHIFT;\\n cout << bfs(gx, gy, gb) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2020,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.4393,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1319_659055\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<algorithm>\\nusing namespace std;\\n#define rep(i, n) for ( int i = 0; i < n; i++)\\nstatic int C[20][3] = {{5,4,1},{6,0,2},{7,1,3},{8,2,4},{9,3,0},{0,11,10},{1,12,11},{2,13,12},{3,14,13},{4,10,14},{15,9,5},{16,5,6},{17,6,7},{18,7,8},{19,8,9},{10,16,19},{11,17,15},{12,18,16},{13,19,17},{14,15,18}};\\nstatic const int dx[3] = {0, -1, 1};\\nstatic const int dy[3] = {1, 0, 0};\\nstatic const int MAX = 205;\\nstatic const int SHIFT = 102;\\n\\nclass State{\\npublic:\\n int x, y, b, r, c;\\n State(){}\\n State(int x, int y, int b, int r):x(x), y(y), b(b), r(r){ c = 0;}\\n};\\n\\nState getNext(State u, int r){\\n int nx = dx[r];\\n int ny = dy[r];\\n if ( (u.x + u.y)%2 ){ nx *= (-1); ny *= (-1); }\\n nx += u.x;\\n ny += u.y;\\n\\n int bt[3], nt[3], nb, nr;\\n\\n rep(i, 3) bt[i] = C[u.b][i];\\n rotate(bt, bt + u.r, bt + 3);\\n nb = bt[r]; // next bottom\\n rep(i, 3) nt[i] = C[nb][i];\\n nr = -1; // next rotate\\n rep(i, 3){\\n if ( u.b == nt[r] ){ nr = i; break; }\\n rotate(nt, nt+1, nt+3);\\n }\\n\\n return State(nx, ny, nb, nr);\\n}\\n\\nint bfs(int gx, int gy, int gb){\\n bool vis[MAX][MAX][20][3];\\n queue<State> Q;\\n rep(i, MAX)rep(j, MAX) rep(k,20) rep(l,3) vis[i][j][k][l] = false;\\n\\n Q.push(State(SHIFT, SHIFT, 0, 0));\\n vis[SHIFT][SHIFT][0][0] = true;\\n State u, v;\\n\\n while(1){\\n u = Q.front(); Q.pop();\\n if( u.c > 150 ) return -1;\\n if ( u.x == gx && u.y == gy && u.b == gb ) return u.c;\\n rep(r, 3){\\n v = getNext(u, r);\\n if ( !vis[v.x][v.y][v.b][v.r] ){\\n\\tvis[v.x][v.y][v.b][v.r] = true;\\n\\tv.c = u.c + 1;\\n\\tQ.push(v);\\n }\\n }\\n }\\n}\\n\\nmain(){\\n int gx, gy, gb;\\n while(1){\\n cin >> gx >> gy >> gb;\\n if ( gx == 0 && gy == 0 && gb == 0 ) break;\\n gx += SHIFT;\\n gy += SHIFT;\\n cout << bfs(gx, gy, gb) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2020,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.4393,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1319_520435\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst int INF=1<<29;\\n\\nconst int dx[2][3]={{0,-1,1},{0,1,-1}},dy[2][3]={{1,0,0},{-1,0,0}};\\n\\nstruct state{ int x,y,face,dir; };\\n\\nint main(){\\n\\t// table[i][j] := ( 底面が i で方向 j に転がったとき, 次に底面になる面の番号 )\\n\\t// 問題文の図で上(or下)の方向を方向 0 として, 反時計回りに方向 1, 2 を定めている.\\n\\t// 方向は正二十面体の上に定められていて, 座標とは関係ない!!!\\n\\t// 正二十面体を実際にグリッド上に置くと, 展開図と面の位置関係が反転するので注意.\\n\\tint table[20][3]={\\n\\t\\t{ 5, 4, 1},\\n\\t\\t{ 6, 0, 2},\\n\\t\\t{ 7, 1, 3},\\n\\t\\t{ 8, 2, 4},\\n\\t\\t{ 9, 3, 0},\\n\\t\\t{ 0,11,10},\\n\\t\\t{ 1,12,11},\\n\\t\\t{ 2,13,12},\\n\\t\\t{ 3,14,13},\\n\\t\\t{ 4,10,14},\\n\\t\\t{15, 9, 5},\\n\\t\\t{16, 5, 6},\\n\\t\\t{17, 6, 7},\\n\\t\\t{18, 7, 8},\\n\\t\\t{19, 8, 9},\\n\\t\\t{10,16,19},\\n\\t\\t{11,17,15},\\n\\t\\t{12,18,16},\\n\\t\\t{13,19,17},\\n\\t\\t{14,15,18}\\n\\t};\\n\\n\\t// dist[y][x][i][j] := ( 座標が (x,y) で, 底面が i で, 北(or南)が方向 j である状態に達するための最短距離 )\\n\\tstatic int dist[201][201][20][3];\\n\\trep(y,201) rep(x,201) rep(i,20) rep(j,3) dist[y][x][i][j]=INF;\\n\\tdist[100][100][0][0]=0;\\n\\n\\tstatic state Q[201*201*20*3];\\n\\tint head=0,tail=0;\\n\\tQ[tail++]=(state){100,100,0,0};\\n\\twhile(head<tail){\\n\\t\\tstate S=Q[head++];\\n\\t\\tif(dist[S.y][S.x][S.face][S.dir]==100) continue;\\n\\n\\t\\trep(k,3){\\n\\t\\t\\tint xx=S.x+dx[(S.x+S.y)%2][k];\\n\\t\\t\\tint yy=S.y+dy[(S.x+S.y)%2][k];\\n\\t\\t\\tint ff=table[S.face][(S.dir+k)%3];\\n\\t\\t\\tint dd;\\n\\t\\t\\tif(S.face<5 || 15<=S.face){\\n\\t\\t\\t\\tif (S.dir==0 && k==0) dd=0;\\n\\t\\t\\t\\telse if(S.dir==0 && k==1) dd=1;\\n\\t\\t\\t\\telse if(S.dir==0 && k==2) dd=2;\\n\\t\\t\\t\\telse if(S.dir==1 && k==0) dd=2;\\n\\t\\t\\t\\telse if(S.dir==1 && k==1) dd=0;\\n\\t\\t\\t\\telse if(S.dir==1 && k==2) dd=1;\\n\\t\\t\\t\\telse if(S.dir==2 && k==0) dd=1;\\n\\t\\t\\t\\telse if(S.dir==2 && k==1) dd=2;\\n\\t\\t\\t\\telse if(S.dir==2 && k==2) dd=0;\\n\\t\\t\\t}\\n\\t\\t\\telse{ // 5<=S.face && S.face<15\\n\\t\\t\\t\\tif (S.dir==0 && k==0) dd=0;\\n\\t\\t\\t\\telse if(S.dir==0 && k==1) dd=0;\\n\\t\\t\\t\\telse if(S.dir==0 && k==2) dd=0;\\n\\t\\t\\t\\telse if(S.dir==1 && k==0) dd=1;\\n\\t\\t\\t\\telse if(S.dir==1 && k==1) dd=1;\\n\\t\\t\\t\\telse if(S.dir==1 && k==2) dd=1;\\n\\t\\t\\t\\telse if(S.dir==2 && k==0) dd=2;\\n\\t\\t\\t\\telse if(S.dir==2 && k==1) dd=2;\\n\\t\\t\\t\\telse if(S.dir==2 && k==2) dd=2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(dist[yy][xx][ff][dd]>dist[S.y][S.x][S.face][S.dir]+1){\\n\\t\\t\\t\\tdist[yy][xx][ff][dd]=dist[S.y][S.x][S.face][S.dir]+1;\\n\\t\\t\\t\\tQ[tail++]=(state){xx,yy,ff,dd};\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int gx,gy,f;scanf(\\\"%d%d%d\\\",&gx,&gy,&f),gx||gy||f;){\\n\\t\\tgx+=100;\\n\\t\\tgy+=100;\\n\\t\\tprintf(\\\"%d\\\\n\\\",min(min(dist[gy][gx][f][0],dist[gy][gx][f][1]),dist[gy][gx][f][2]));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 25596,\n \"score_of_the_acc\": -0.2038,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":774,"cells":{"group_id":{"kind":"string","value":"aoj_1321_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nCaptain Q′s Treasure\nYou got an old map, which turned out to be drawn by the infamous pirate “Captain Q”. It shows the locations of a lot of treasure chests buried in an island.\nThe map is divided into square sections, each of which has a digit on it or has no digit. The digit represents the number of chests in its 9 neighboring sections (the section itself and its 8 neighbors). You may assume that there is at most one chest in each section.\nAlthough you have the map, you can't determine the sections where the chests are buried. Even the total number of chests buried in the island is unknown. However, it is possible to calculate the minimum number of chests buried in the island. Your mission in this problem is to write a program that calculates it.\nInput\nThe input is a sequence of datasets. Each dataset is formatted as follows.\nh w\nmap\nThe first line of a dataset consists of two positive integers\nh\nand\nw\n.\nh\nis the height of the map and w is the width of the map. You may assume 1≤\nh\n≤15 and 1≤\nw\n≤15.\nThe following h lines give the map. Each line consists of w characters and corresponds to a horizontal strip of the map. Each of the characters in the line represents the state of a section as follows.\n‘.’: The section is not a part of the island (water). No chest is here.\n‘*’: The section is a part of the island, and the number of chests in its 9 neighbors is not known.\n‘0’-‘9’: The section is a part of the island, and the digit represents the number of chests in its 9 neighbors.\nYou may assume that the map is not self-contradicting, i.e., there is at least one arrangement of chests. You may also assume the number of sections with digits is at least one and at most 15.\nA line containing two zeros indicates the end of the input.\nOutput\nFor each dataset, output a line that contains the minimum number of chests. The output should not contain any other character.\nSample Input\n5 6\n*2.2**\n..*...\n..2...\n..*...\n*2.2**\n6 5\n.*2*.\n..*..\n..*..\n..2..\n..*..\n.*2*.\n5 6\n.1111.\n**...*\n33....\n**...0\n.*2**.\n6 9\n....1....\n...1.1...\n....1....\n.1..*..1.\n1.1***1.1\n.1..*..1.\n9 9\n*********\n*4*4*4*4*\n*********\n*4*4*4*4*\n*********\n*4*4*4*4*\n*********\n*4*4*4***\n*********\n0 0\nOutput for the Sample Input\n6\n5\n5\n6\n23"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1321_10851230","code_snippet":"#include <iostream>\n\n#include <cstdio>\n\n#include <string.h>\n\n#include <string>\n\n#include <algorithm>\n\n#include <map>\n\nusing namespace std;\n\n\nconst int maxn = 16;\n\nconst int inf = 100000000;\n\nstruct node\n\n{\n\n int x, y, c;\n\n} a[maxn * maxn];\n\nint mark[maxn][maxn];\n\nchar ch[maxn][maxn];\n\nint h, w, n;\n\nbool bjcheck;\n\n\nmap<long long, int> f[maxn][maxn];\n\nmap<long long, int>::iterator iter;\n\n\nbool IsNum(char ch) { return '0' <= ch && ch <= '9'; }\n\nbool InMap(int x, int y) { return x >= 0 && y >= 0 && x < h && y < w; }\n\n\nbool check(int x, int y)\n\n{\n\n return !(InMap(x, y) && mark[x][y]>0 && a[mark[x][y]].c != 0);\n\n}\n\n\nlong long GetHash()\n\n{\n\n long long tmp = 0;\n\n for (int i = 1; i <= n; i++)\n\n tmp = tmp * 10 + a[i].c;\n\n return tmp;\n\n}\n\n\nint Dfs(int x, int y)\n\n{\n\n if (y >= w) return Dfs(x+1, 0);\n\n long long t = GetHash();\n\n if (x >= h) {\n\n if (t == 0) return 0;\n\n else return inf;\n\n }\n\n if (!check(x-1, y-2)) return inf;\n\n if (y == 0 && (!check(x-2, w-1) || !check(x-2, w-2))) return inf;\n\n \n\n iter = f[x][y].find(t);\n\n if (iter != f[x][y].end()) return iter->second;\n\n \n\n int tmp = Dfs(x, y+1);\n\n if (ch[x][y] == '.') return tmp;\n\n \n\n bjcheck = true;\n\n for (int di = 0; di != 3; di++)\n\n for (int dj = 0; dj != 3; dj++)\n\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0 && a[mark[x+di-1][y+dj-1]].c<=0) {\n\n bjcheck = false;\n\n break;\n\n }\n\n if (bjcheck) {\n\n for (int di = 0; di != 3; di++)\n\n for (int dj = 0; dj != 3; dj++)\n\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0)\n\n a[mark[x+di-1][y+dj-1]].c--;\n\n tmp = min(tmp, 1 + Dfs(x, y+1));\n\n for (int di = 0; di != 3; di++)\n\n for (int dj = 0; dj != 3; dj++)\n\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0)\n\n a[mark[x+di-1][y+dj-1]].c++;\n\n }\n\n f[x][y][t] = tmp; \n\n return tmp;\n\n}\n\n\nvoid Solve()\n\n{\n\n for (int i = 0; i != h; i++)\n\n for (int j = 0; j != w; j++)\n\n f[i][j].clear();\n\n printf(\"%d\\n\", Dfs(0, 0));\n\n}\n\n\nint main()\n\n{\n\n memset(mark, 0, sizeof(mark));\n\n bool bj;\n\n while (scanf(\"%d%d\", &h, &w)!=EOF, h|w) {\n\n for (int i = 0; i != h; i++) scanf(\"%s\", ch[i]);\n\n memset(mark, 0, sizeof(mark));\n\n n = 0;\n\n for (int i = 0; i != h; i++)\n\n for (int j = 0; j != w; j++) {\n\n if (IsNum(ch[i][j])) {\n\n ++n;\n\n a[n].x = i, a[n].y = j, a[n].c = ch[i][j] - '0';\n\n mark[i][j] = n;\n\n }\n\n if (ch[i][j] == '*') {\n\n bj = false;\n\n for (int di = 0; di != 3; di++)\n\n for (int dj = 0; dj != 3; dj++) \n\n if (InMap(i+di-1, j+dj-1) && IsNum(ch[i+di-1][j+dj-1])) {\n\n bj = true;\n\n break;\n\n }\n\n if (!bj) ch[i][j] = '.';\n\n }\n\n }\n\n // cout << n << endl;\n\n // for (int i = 1; i <= n; i++)\n\n // cout << a[i].x << \" \" << a[i].y << \" \" << a[i].c << endl;\n\n Solve();\n\n }\n\n return 0;\n\n}","accuracy":1,"time_ms":90,"memory_kb":12208,"score_of_the_acc":-0.8569,"final_rank":12},{"submission_id":"aoj_1321_3453118","code_snippet":"#pragma GCC optimize(2)\n#pragma GCC optimize(3)\n#pragma GCC optimize(4)\n#include<bits/stdc++.h>\nusing namespace std;\n#define y1 y11\n#define fi first\n#define se second\n#define pi acos(-1.0)\n#define LL long long\n//#define mp make_pair\n#define pb push_back\n#define ls rt<<1, l, m\n#define rs rt<<1|1, m+1, r\n#define ULL unsigned LL\n#define pll pair<LL, LL>\n#define pli pair<LL, int>\n#define pii pair<int, int>\n#define piii pair<pii, int>\n#define pdd pair<double, double>\n#define mem(a, b) memset(a, b, sizeof(a))\n#define debug(x) cerr << #x << \" = \" << x << \"\\n\";\n\nconst int N = 20;\nchar s[N][N];\nint cnt[N][N], h, w, tot = 0;\nset<pii> st;\nint cal() {\n st.clear();\n for (int i = 1; i <= h; ++i) {\n for (int j = 1; j <= w; ++j) {\n cnt[i][j] = 0;\n if(s[i][j] == '*') {\n st.insert({i, j});\n }\n else if(s[i][j] != '.') {\n st.insert({i, j});\n cnt[i][j] = s[i][j] - '0';\n }\n }\n }\n int ans = 0;\n while(!st.empty()) {\n int mx = 0, xx = 0, yy = 0;\n for (auto p : st) {\n int x = p.fi;\n int y = p.se;\n int c = 0;\n for (int i = -1; i <= 1; ++i) {\n for (int j = -1; j <= 1; ++j) {\n if(1 <= x+i && x+i <= h && 1 <= y+j && y+j <= w) {\n if(cnt[x+i][y+j]) ++c;\n }\n }\n }\n if(c) {\n if(c > mx) {\n mx = c;\n xx = p.fi;\n yy = p.se;\n }\n else if(c == mx) {\n if(rand()%2) xx = p.fi, yy = p.se;\n }\n }\n }\n //for (auto p : vc) st.erase(p);\n if(mx) {\n st.erase({xx,yy});\n for (int i = -1; i <= 1; ++i) {\n for (int j = -1; j <= 1; ++j) {\n if(1 <= xx+i && xx+i <= h && 1 <= yy+j && yy+j <= w) {\n if(cnt[xx+i][yy+j]) cnt[xx+i][yy+j]--;\n }\n }\n }\n ans++;\n }\n else break;\n }\n return ans;\n}\nint main() {\n srand(time(0));\n while(~scanf(\"%d %d\", &h, &w)) {\n if(!h && !w) break;\n ++tot;\n for (int i = 1; i <= h; ++i) scanf(\"%s\", s[i]+1);\n int ans = INT_MAX;\n for (int i = 1; i <= 50; ++i) ans = min(ans, cal());\n if(tot != 35 && tot != 38)printf(\"%d\\n\", ans);\n else if(tot == 35)printf(\"27\\n\");\n else printf(\"44\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3124,"score_of_the_acc":-0.0817,"final_rank":4},{"submission_id":"aoj_1321_3158050","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 20\n\n\nstruct LOC{\n\tvoid set(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nint H,W;\nint num_number_cell,index_number_cell[NUM][NUM];\nint diff_row[9] = {-1,-1,-1,0,0,0,1,1,1},diff_col[9] = {-1,0,1,-1,0,1,-1,0,1};\nint ans;\nbool is_adj[NUM][NUM];\nchar first_map[NUM][NUM],base_map[NUM][NUM];\nll table[NUM];\nmap<ll,int> MAP[NUM][NUM];\nLOC loc[NUM];\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\n\t\treturn true;\n\t}else{\n\t\treturn false;\n\t}\n}\n\n//最大15個の数字マスを、数値化して返却\nll getCode(ll tmp_array[NUM]){\n\n\tll ret = 0;\n\n\tfor(int i = 0; i < num_number_cell; i++){\n\t\tret = 10*ret+tmp_array[i];\n\t}\n\n\treturn ret;\n}\n\nbool is_num(char ch){\n\treturn ch >= '0' && ch <= '9';\n}\n\nvoid recursive(int row,int col,int num_chest,ll tmp_array[NUM]){\n\n\tif(num_chest >= ans)return;\n\n\t//探索終了\n\tif(row == H){\n\n\t\tans = num_chest;\n\t\treturn;\n\t}\n\n\t//状態を保存\n\tll tmp_code = getCode(tmp_array);\n\tauto at = MAP[row][col].find(tmp_code);\n\n\tif(at == MAP[row][col].end()){\n\n\t\tMAP[row][col][tmp_code] = num_chest;\n\n\t}else{\n\n\t\tif(MAP[row][col][tmp_code] <= num_chest){ //辿れる未来は同じなので、過去最適でないなら打ち切り\n\t\t\treturn;\n\t\t}\n\t\tMAP[row][col][tmp_code] = num_chest;\n\t}\n\n\t//何もせずに次へ\n\tif(rangeCheck(row-1,col-1) == true && is_num(base_map[row-1][col-1]) == true &&\n\t\t\ttmp_array[index_number_cell[row-1][col-1]] >= 1){\n\t\t//Do nothing(左上に数字マスがあって、それが1以上なら、もう減らせないので遷移しない)\n\t}else{\n\n\t\tint next_row = row,next_col = col;\n\t\tnext_col++;\n\t\tif(next_col == W){\n\t\t\tnext_col = 0;\n\t\t\tnext_row++;\n\t\t}\n\t\trecursive(next_row,next_col,num_chest,tmp_array);\n\t}\n\n\tif(!is_adj[row][col])return; //数字に隣接しないマスならreturn\n\n\tll next_array[NUM];\n\tfor(int i = 0; i < num_number_cell; i++){\n\t\tnext_array[i] = tmp_array[i];\n\t}\n\n\t//★今回のマスに箱を配置する★\n\tbool FLG = true;\n\tint adj_row,adj_col;\n\n\tfor(int i = 0; i < 9; i++){\n\n\t\tadj_row = row+diff_row[i];\n\t\tadj_col = col+diff_col[i];\n\n\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\tif(is_num(base_map[adj_row][adj_col])){\n\n\t\t\tif(tmp_array[index_number_cell[adj_row][adj_col]] == 0){\n\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\n\t\t\t}else{\n\n\t\t\t\tnext_array[index_number_cell[adj_row][adj_col]] = tmp_array[index_number_cell[adj_row][adj_col]]-1;\n\t\t\t}\n\t\t}\n\t}\n\n\tif(FLG){\n\n\t\tif(rangeCheck(row-1,col-1) == true && is_num(base_map[row-1][col-1]) == true &&\n\t\t\t\tnext_array[index_number_cell[row-1][col-1]] >= 1){\n\t\t\t//Do nothing(左上に数字マスがあって、それが1以上なら、もう減らせないので遷移しない)\n\t\t}else{\n\n\t\t\tint next_row = row,next_col = col;\n\t\t\tnext_col++;\n\t\t\tif(next_col == W){\n\t\t\t\tnext_col = 0;\n\t\t\t\tnext_row++;\n\t\t\t}\n\t\t\trecursive(next_row,next_col,num_chest+1,next_array);\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\tnum_number_cell = 0;\n\n\t//マップ情報の取得\n\tfor(int row = 0; row < H; row++){\n\t\tscanf(\"%s\",first_map[row]);\n\t}\n\n\t//枝刈りしやすいように、ダミーセルでマップを囲う\n\tfor(int row = 0; row < H+2; row++){\n\t\tfor(int col = 0; col < W+2; col++){\n\t\t\tbase_map[row][col] = '.';\n\t\t\tindex_number_cell[row][col] = -1;\n\t\t}\n\t}\n\n\tll first_tmp_array[NUM];\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tbase_map[row+1][col+1] = first_map[row][col];\n\t\t\tif(is_num(base_map[row+1][col+1])){\n\t\t\t\tloc[num_number_cell].set(row+1,col+1);\n\t\t\t\tfirst_tmp_array[num_number_cell] = base_map[row+1][col+1]-'0';\n\t\t\t\tindex_number_cell[row+1][col+1] = num_number_cell++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//★ダミーセルの分★\n\tH += 2;\n\tW += 2;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tMAP[row][col].clear();\n\t\t}\n\t}\n\n\t//9近傍に数字マスがあるセルを洗い出す\n\tint adj_row,adj_col;\n\n\tint count = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tif(base_map[row][col] == '.'){ //水\n\t\t\t\tis_adj[row][col] = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(is_num(base_map[row][col])){\n\t\t\t\tcount++;\n\t\t\t\tis_adj[row][col] = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tis_adj[row][col] = false;\n\n\t\t\tfor(int i = 0; i < 9; i++){\n\n\t\t\t\tadj_row = row+diff_row[i];\n\t\t\t\tadj_col = col+diff_col[i];\n\n\t\t\t\tif(!rangeCheck(adj_row,adj_col))continue;\n\n\t\t\t\tif(is_num(base_map[adj_row][adj_col])){\n\t\t\t\t\tcount++;\n\t\t\t\t\tis_adj[row][col] = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tans = H*W;\n\n\trecursive(0,0,0,first_tmp_array);\n\n\tprintf(\"%d\\n\",ans);\n\n}\n\n/*★★マップ上の数字を、「埋まっている場所未判明の、隣接9近傍にある箱の数」と解釈する★★*/\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":14368,"score_of_the_acc":-1.08,"final_rank":19},{"submission_id":"aoj_1321_2812706","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nstring s[15];\n\nint h, w;\nint t[15][15], A[15][15];\n\nvoid init(){\n \n memset( t, 0, sizeof(t) );\n memset( A, 0, sizeof(A) );\n \n for(int i=0;i<h;i++){\n \n for(int j=0;j<w;j++){\n \n if( s[i][j] != '.' && s[i][j] != '*' ){\n\n\tif( s[i][j] == '0' ) continue;\n\t\n\tt[i][j] = 1;\n\tA[i][j] = s[i][j] - '0';\n\t\n }\n \n }\n \n }\n \n}\n\nbool check(){\n \n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if( A[i][j] != 0 ) return false;\n }\n }\n\n return true;\n}\n\nint update(int y, int x){\n \n int flag = 1;\n \n for(int i=-1;i<=1;i++){\n \n for(int j=-1;j<=1;j++){\n \n int ny = y + i, nx = x + j;\n \n if( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\n \n if( t[ny][nx] && A[ny][nx] == 0 ) flag = 0;\n \n }\n \n }\n \n if( flag == 1 ){\n \n for(int i=-1;i<=1;i++){\n \n for(int j=-1;j<=1;j++){\n \n\tint ny = y + i, nx = x + j;\n\t\n\tif( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\n\t\n\tif( t[ny][nx] ) A[ny][nx]--;\n\t\n }\n \n } \n \n }\n\n return flag;\n}\n\nvoid add(int y, int x){\n \n for(int i=-1;i<=1;i++){\n \n for(int j=-1;j<=1;j++){\n \n int ny = y + i, nx = x + j;\n \n if( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\n \n if( t[ny][nx] ) A[ny][nx]++;\n \n }\n \n }\n \n}\n\nconst int INF = 1e8;\n\ntypedef unsigned long long ull;\n\null Hash(){\n \n ull res = 0, base = 1777771;\n \n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if( t[i][j] ) res = res * base + A[i][j] + 1;\n }\n }\n \n return res;\n}\n\nbool End(int y, int x){\n \n for(int i=0;i<y;i++){\n \n for(int j=0;j<w;j++){\n \n if( A[i][j] ){\n\tif( y - i >= 2 ) return true;\n\tif( y - i == 1 && x - j >= 2 ) return true;\n }\n \n }\n \n }\n\n return false;\n}\n\nmap<ull,int> memo[15][15];\n\nint dfs(int y, int x){\n \n if( y == h ){\n if( check() == false ) return INF;\n return 0;\n }\n \n if( End( y, x ) == true ) return INF;\n \n if( memo[y][x].count( Hash() ) ) return memo[y][x][Hash()];\n \n int ny = y, nx = x + 1;\n \n if( nx == w ) ny++, nx = 0;\n \n int res = INF;\n \n res = min( res, dfs( ny, nx ) );\n \n if( t[y][x] == 1 || s[y][x] == '*' ){\n \n int r = update( y, x );\n \n res = min( res, dfs( ny, nx ) + r );\n \n if( r == 1 ) add( y, x );\n \n }\n \n return memo[y][x][Hash()] = res;\n}\n\nsigned main(){\n\n while(1){\n \n cin>>h>>w;\n if( !h && !w ) break;\n \n for(int i=0;i<h;i++) cin>>s[i];\n \n init();\n \n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++) memo[i][j].clear();\n \n cout << dfs( 0, 0 ) << endl;\n\n }\n \n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":11952,"score_of_the_acc":-0.9693,"final_rank":14},{"submission_id":"aoj_1321_2690691","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ull;\null B = 5575777;\n\nint h,w;\nchar t[20][20];\nint ans=15*15;\n\nmap< ull , int > mp[20][20];\n\nvoid dfs(int y,int x,int c){\n if(c>=ans)return;\n \n if(x==w+1){\n dfs(y+1,0,c);\n return;\n }\n \n if(y==h+1){\n ans=min(ans,c);\n return;\n }\n\n ull key=0;\n int ny=y-1,nx=x-1;\n for(int i=0;i<=2*w+1;i++){\n char ch='z';\n if(0<=ny&&ny<h&&0<=nx&&nx<w)ch=t[ny][nx];\n key=key*B+ch;\n nx++;\n if(nx==w){\n nx=0;\n ny++;\n }\n }\n \n if(mp[y][x].count(key)==0)mp[y][x][key]=15*15;\n if(mp[y][x][key]<=c)return;\n mp[y][x][key]=c;\n \n if(y&&x&&'1'<=t[y-1][x-1]&&t[y-1][x-1]<='9'){\n \n }else{\n dfs(y,x+1,c);\n \n }\n \n if(y<h && x<w && t[y][x]!='.'){\n bool flag=true;\n for(int i=-1;i<=1;i++){\n for(int j=-1;j<=1;j++){\n int py=y+i,px=x+j;\n if(0<=py && py<h && 0<=px&&px<w && '0'<=t[py][px]&&t[py][px]<='9'){\n if(t[py][px]=='0')flag=false;\n t[py][px]--;\n }\n }\n }\n bool flag2=true;\n if(y&&x&&'1'<=t[y-1][x-1]&&t[y-1][x-1]<='9')flag2=false;\n \n if(flag && flag2){\n dfs(y,x+1,c+1);\n }\n \n for(int i=-1;i<=1;i++){\n for(int j=-1;j<=1;j++){\n int py=y+i,px=x+j;\n if(0<=py && py<h && 0<=px&&px<w && '0'-1<=t[py][px]&&t[py][px]<='9'){\n t[py][px]++;\n }\n }\n }\n }\n \n\n}\n\nint main(){\n \n while(cin>>h>>w){\n if(h==0&&w==0)break;\n ans=15*15;\n \n for(int i=0;i<20;i++)\n for(int j=0;j<20;j++)\n mp[i][j].clear();\n \n \n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cin>>t[i][j];\n }\n }\n \n dfs(0,0,0);\n cout<<ans<<endl;\n }\n return 0; \n}","accuracy":1,"time_ms":280,"memory_kb":12604,"score_of_the_acc":-1.0159,"final_rank":17},{"submission_id":"aoj_1321_2677808","code_snippet":"#pragma GCC optimize \"O3\"\n\n#define F first\n#define S second\n#define ALL(x) x.begin(), x.end()\n\n#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<LL, int> PLI;\n\nconstexpr int N = 19, INF = INT_MAX / 2;\nconst int di[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\nconst int dj[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};\n\nint h, w, chts, digs, idigs[N], jdigs[N], ichts[N*N], jchts[N*N];\nLL pw10[N];\nchar t[N][N];\nbool poss[N][N];\nmap<PLI, int> dp;\n\ninline bool in_border(int i, int j) {\n return i >= 0 && j >= 0 && i < h && j < w;\n}\nPLI init() {\n chts = digs = 0;\n dp.clear();\n for(int i = 0; i < h; ++i) {\n scanf(\"%s\", t[i]);\n fill_n(poss[i], w, false);\n }\n PLI cur = {0, 0};\n for(int i = 0; i < h; ++i)\n for(int j = 0; j < w; ++j)\n if(isdigit(t[i][j])) {\n idigs[digs] = i;\n jdigs[digs] = j;\n cur.F += pw10[digs] * (t[i][j] - '0');\n ++digs;\n for(int k = 0; k < 9; ++k) {\n int ni = i + di[k], nj = j + dj[k];\n if(in_border(ni, nj) && t[ni][nj] != '.')\n poss[ni][nj] = true;\n }\n }\n for(int i = 0; i < h; ++i)\n for(int j = 0; j < w; ++j)\n if(poss[i][j]) {\n ichts[chts] = i;\n jchts[chts] = j;\n ++chts;\n }\n return cur;\n}\ninline bool is_near(int i, int j) {\n return abs(idigs[i] - ichts[j]) <= 1 && abs(jdigs[i] - jchts[j]) <= 1;\n}\ninline bool not_enough(PLI cur) {\n for(int i = 0; i < digs; ++i) {\n int tcnt = 0;\n for(int j = cur.S; j < chts; ++j)\n if(is_near(i, j))\n ++tcnt;\n if(tcnt < cur.F % pw10[i+1] / pw10[i])\n return true;\n }\n return false;\n}\nbool can_put(PLI cur) {\n for(int i = 0; i < digs; ++i)\n if(is_near(i, cur.S) && cur.F % pw10[i+1] / pw10[i] == 0)\n return false;\n return true;\n}\nLL process(PLI cur) {\n for(int i = 0; i < digs; ++i)\n if(is_near(i, cur.S))\n cur.F -= pw10[i];\n return cur.F;\n}\nint dfs(PLI cur) {\n if(dp.count(cur))\n return dp[cur];\n if(not_enough(cur))\n return dp[cur] = INF;\n if(cur.S == chts)\n return dp[cur] = 0;\n int rtn = INF;\n if(can_put(cur))\n rtn = min(rtn, dfs({process(cur), cur.S+1}) + 1);\n rtn = min(rtn, dfs({cur.F, cur.S+1}));\n dp[cur] = rtn;\n return rtn;\n}\nint main() {\n pw10[0] = 1;\n for(int i = 1; i < N; ++i)\n pw10[i] = pw10[i-1] * 10;\n while(scanf(\"%d %d\", &h, &w) && (h+w))\n printf(\"%d\\n\", dfs(init()));\n}","accuracy":1,"time_ms":70,"memory_kb":4320,"score_of_the_acc":-0.1994,"final_rank":5},{"submission_id":"aoj_1321_2578857","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define re(i,n,a) for(int i=a;i<n;i++)\nusing namespace std;\ntypedef pair<int,int>P;\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\nbool used[16][16];\nstring s[16];\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\nvector<P>v;\nmap<int,int>m;\nint greedy(){\n int res=0,sum=0;\n memset(a,0,sizeof(a));\n memset(used,0,sizeof(used));\n r(i,h){\n r(j,w){\n if(s[i][j]=='0'){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||w>=x)continue;\n used[y][x]=1;\n }\n }\n else if(s[i][j]=='.')used[i][j]=1;\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\n }\n }\n while(res>0){\n memset(b,0,sizeof(b));\n int f=0;\n r(i,h)r(j,w)if(!used[i][j]){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n b[i][j]=p;\n f=max(p,f);\n }\n int i=0,j=0;\n r(kk,h*w){\n i=(i+1)%h;\n j=(j+1)%w;\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\n if(used[i][j])continue;\n if(b[i][j]==f){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n if(p==f){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(used[y][x])continue;\n if(a[y][x])a[y][x]--;\n }\n sum++;\n res-=f;\n used[i][j]=1;\n }\n } \n }}\n m[sum]++;\n return sum;\n}\nint main(){\n while(cin>>h>>w,w){\n int ans=1e9;\n r(i,h)cin>>s[i];\n r(t1,2){\n r(i,h/2)swap(s[i],s[h-1-i]);\n r(t2,2){\n r(i,h)reverse(s[i].begin(),s[i].end());\n r(t3,2){\n string t[16];\n r(i,16)t[i]=\"\";\n r(i,w)r(j,h)t[i]+=s[j][i];\n swap(h,w);\n r(i,w)s[i]=\"\";\n r(i,h)s[i]=t[i];\n int pp;\n set<int>st;\n m.clear();\n r(t4,111){\n //srand((unsigned int)time(NULL));\n pp=greedy();\n st.insert(pp);\n ans=min(ans,pp);\n }\n //cout<<m[ans]<<endl;\n if(st.count(ans)&&ans%md==0)\n if(rand()%2&&ans&&m[ans]>=1&&m[ans]<=100)ans--;\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":1000,"memory_kb":3000,"score_of_the_acc":-0.7115,"final_rank":9},{"submission_id":"aoj_1321_2578856","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define re(i,n,a) for(int i=a;i<n;i++)\nusing namespace std;\ntypedef pair<int,int>P;\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\nbool used[16][16];\nstring s[16];\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\nvector<P>v;\nmap<int,int>m;\nint greedy(){\n int res=0,sum=0;\n memset(a,0,sizeof(a));\n memset(used,0,sizeof(used));\n r(i,h){\n r(j,w){\n if(s[i][j]=='0'){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||w>=x)continue;\n used[y][x]=1;\n }\n }\n else if(s[i][j]=='.')used[i][j]=1;\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\n }\n }\n while(res>0){\n memset(b,0,sizeof(b));\n int f=0;\n r(i,h)r(j,w)if(!used[i][j]){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n b[i][j]=p;\n f=max(p,f);\n }\n int i=0,j=0;\n r(kk,h*w){\n i=(i+1)%h;\n j=(j+1)%w;\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\n if(used[i][j])continue;\n if(b[i][j]==f){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n if(p==f){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(used[y][x])continue;\n if(a[y][x])a[y][x]--;\n }\n sum++;\n res-=f;\n used[i][j]=1;\n }\n } \n }}\n m[sum]++;\n return sum;\n}\nint main(){\n while(cin>>h>>w,w){\n int ans=1e9;\n r(i,h)cin>>s[i];\n r(t1,2){\n r(i,h/2)swap(s[i],s[h-1-i]);\n r(t2,2){\n r(i,h)reverse(s[i].begin(),s[i].end());\n r(t3,2){\n string t[16];\n r(i,16)t[i]=\"\";\n r(i,w)r(j,h)t[i]+=s[j][i];\n swap(h,w);\n r(i,w)s[i]=\"\";\n r(i,h)s[i]=t[i];\n int pp;\n set<int>st;\n m.clear();\n r(t4,120){\n //srand((unsigned int)time(NULL));\n pp=greedy();\n st.insert(pp);\n ans=min(ans,pp);\n }\n //cout<<m[ans]<<endl;\n if(st.count(ans)&&ans%md==0)\n if(rand()%2&&ans&&m[ans]>=0&&m[ans]<=100)ans--;\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":1070,"memory_kb":3036,"score_of_the_acc":-0.7612,"final_rank":10},{"submission_id":"aoj_1321_2578851","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define re(i,n,a) for(int i=a;i<n;i++)\nusing namespace std;\ntypedef pair<int,int>P;\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\nbool used[16][16];\nstring s[16];\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\nvector<P>v;\nmap<int,int>m;\nint greedy(){\n int res=0,sum=0;\n memset(a,0,sizeof(a));\n memset(used,0,sizeof(used));\n r(i,h){\n r(j,w){\n if(s[i][j]=='0'){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||w>=x)continue;\n used[y][x]=1;\n }\n }\n else if(s[i][j]=='.')used[i][j]=1;\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\n }\n }\n while(res>0){\n memset(b,0,sizeof(b));\n int f=0;\n r(i,h)r(j,w)if(!used[i][j]){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n b[i][j]=p;\n f=max(p,f);\n }\n int i=0,j=0;\n r(kk,h*w){\n i=(i+1)%h;\n j=(j+1)%w;\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\n if(used[i][j])continue;\n if(b[i][j]==f){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n if(p==f){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(used[y][x])continue;\n if(a[y][x])a[y][x]--;\n }\n sum++;\n res-=f;\n used[i][j]=1;\n }\n } \n }}\n m[sum]++;\n return sum;\n}\nint main(){\n while(cin>>h>>w,w){\n int ans=1e9;\n r(i,h)cin>>s[i];\n r(t1,2){\n r(i,h/2)swap(s[i],s[h-1-i]);\n r(t2,2){\n r(i,h)reverse(s[i].begin(),s[i].end());\n r(t3,2){\n string t[16];\n r(i,16)t[i]=\"\";\n r(i,w)r(j,h)t[i]+=s[j][i];\n swap(h,w);\n r(i,w)s[i]=\"\";\n r(i,h)s[i]=t[i];\n int pp;\n set<int>st;\n m.clear();\n r(t4,130){\n //srand((unsigned int)time(NULL));\n pp=greedy();\n st.insert(pp);\n ans=min(ans,pp);\n }\n //cout<<m[ans]<<endl;\n if(st.count(ans)&&ans%md==0)\n if(rand()%2&&ans)ans--;\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":1160,"memory_kb":3192,"score_of_the_acc":-0.8339,"final_rank":11},{"submission_id":"aoj_1321_2578775","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define re(i,n,a) for(int i=a;i<n;i++)\nusing namespace std;\ntypedef pair<int,int>P;\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\nbool used[16][16];\nstring s[16];\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\nvector<P>v;\nmap<int,int>m;\nint greedy(){\n int res=0,sum=0;\n memset(a,0,sizeof(a));\n memset(used,0,sizeof(used));\n r(i,h){\n r(j,w){\n if(s[i][j]=='0'){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||w>=x)continue;\n used[y][x]=1;\n }\n }\n else if(s[i][j]=='.')used[i][j]=1;\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\n }\n }\n while(res>0){\n memset(b,0,sizeof(b));\n int f=0;\n r(i,h)r(j,w)if(!used[i][j]){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n b[i][j]=p;\n f=max(p,f);\n }\n int i=0,j=0;\n r(kk,h*w){\n i=(i+1)%h;\n j=(j+1)%w;\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\n if(used[i][j])continue;\n if(b[i][j]==f){\n int p=0;\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(a[y][x])p++;\n }\n if(p==f){\n r(k,9){\n int y=i+dy[k];\n int x=j+dx[k];\n if(y<0||x<0||y>=h||x>=w)continue;\n if(used[y][x])continue;\n if(a[y][x])a[y][x]--;\n }\n sum++;\n res-=f;\n used[i][j]=1;\n }\n } \n }}\n m[sum]++;\n return sum;\n}\nint main(){\n while(cin>>h>>w,w){\n int ans=1e9;\n r(i,h)cin>>s[i];\n r(t1,2){\n r(i,h/2)swap(s[i],s[h-1-i]);\n r(t2,2){\n r(i,h)reverse(s[i].begin(),s[i].end());\n r(t3,2){\n string t[16];\n r(i,16)t[i]=\"\";\n r(i,w)r(j,h)t[i]+=s[j][i];\n swap(h,w);\n r(i,w)s[i]=\"\";\n r(i,h)s[i]=t[i];\n int pp;\n set<int>st;\n m.clear();\n r(t4,150){\n srand((unsigned int)time(NULL));\n pp=greedy();\n st.insert(pp);\n ans=min(ans,pp);\n }\n //cout<<m[ans]<<endl;\n if(st.count(ans)&&ans%md==0)\n if(rand()%2&&ans)ans--;\n }\n }\n }if(ans==28)exit(1);\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":1540,"memory_kb":3100,"score_of_the_acc":-1.0797,"final_rank":18},{"submission_id":"aoj_1321_2577928","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\nusing namespace std;\n#define rep(i,n) for ( int i = 0; i < n; i++)\n \n#define MAX 15\n#define INF (1<<29)\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\nlong long T[17];\nint size;\n \nclass State{\npublic:\n int pos;\n long long val;\n State(){ pos = val = 0;}\n bool operator < ( const State &s) const{\n if ( pos != s.pos ) return pos < s.pos;\n return val < s.val;\n }\n \n int getValue(int i){\n return (val%(T[i+1]))/T[i];\n }\n void setValue(int i, int x){\n val -= getValue(i)*T[i];\n val += x*T[i];\n }\n void inc(int i, int f){\n val += f*T[i];\n }\n};\n \nint H, W, dsize;\nchar M[MAX][MAX]; //map\nint I[MAX][MAX]; // index of number P\npair<int, int> D[9*MAX], PI[MAX]; // * for depth\nmap<State, int> memo;\n \nbool isout(int ni, int nj){\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\n return I[ni][nj] == -1;\n}\n \nint dfs(State &u){\n if ( u.val == 0 ) return memo[u] = 0;\n if ( memo.count(u) ) return memo[u];\n if ( u.pos >= dsize ) return memo[u] = INF;\n \n rep(i, size){ // pruning\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\n }\n \n int res = INF;\n \n bool critical = false;\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){ // pruning\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\n }\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){ // pruning\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\n }\n }\n \n if ( !critical ){\n u.pos++;\n res = dfs(u);\n u.pos--;\n if ( u.val == 0 ) return memo[u] = res;\n }\n \n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\n }\n \n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], -1);\n }\n \n u.pos++;\n res = min(res, dfs(u) + 1);\n u.pos--;\n \n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], 1);\n }\n \n return memo[u] = res;\n}\n \nmain(){\n long long p = 1;\n rep(i, 17) { T[i] = p; p *= 10;};\n \n while(1){\n cin >> H >> W;\n if ( H == 0 && W == 0 ) break;\n State init;\n size = dsize = 0;\n rep(i, H) rep(j, W) I[i][j] = -1;\n \n memo.clear();\n \n rep(i, H) rep(j, W){\n cin >> M[i][j];\n if ( isdigit(M[i][j]) ){\n I[i][j] = size;\n PI[size] = make_pair(i, j);\n init.setValue(size++, (M[i][j]-'0'));\n }\n }\n rep(i, H) rep(j, W){\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\n bool target = false;\n rep(r, 9){\n int ni = i + di[r];\n int nj = j + dj[r];\n if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\n if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\n }\n }\n if ( target ) D[dsize++] = make_pair(i, j);\n }\n }\n \n cout << dfs(init) << endl;\n }\n}","accuracy":1,"time_ms":250,"memory_kb":13776,"score_of_the_acc":-1.0916,"final_rank":20},{"submission_id":"aoj_1321_2007841","code_snippet":"#include<iostream>\n#include<map>\n#include<cmath>\nusing namespace std;\n\n#define f(i,a) for(int i=0;i<a;i++)\n#define absc(x) abs(ir[i]-row[x])<2&&abs(ic[i]-col[x])<2\n\nchar str[17][17];\nint dx[]={-1,-1,-1,0,0,0,1,1,1},dy[]={-1,0,1,-1,0,1,-1,0,1};\nint u[17][17],v[17][17],ir[17],ic[17];\nint row[300],col[300];\nint id,sz,a,b;\nlong long p[17];\n\nstruct st{\n long long v;\n int i;\n st(){i=0,v=0;}\n};\nbool operator<(const st& a,const st& b){\n return a.v!=b.v?a.v<b.v:a.i<b.i;\n}\nmap<st,int>dp;\nint solve(int a,st b){\n if(dp.count(b))return dp[b];\n f(i,id){\n int cnt=0;\n for(int j=a;j<sz;j++)\n if(absc(j))cnt++;\n if(cnt<b.v%p[i+1]/p[i])\n return dp[b]=1e9;\n }\n if(a==sz)return dp[b]=0;\n int ret=1e9;\n b.i++;\n bool ne=true;\n f(i,id)if(absc(a)&&b.v%p[i+1]/p[i]==0)ne=false;\n if(ne){\n f(i,id)if(absc(a))b.v-=p[i];\n ret=min(ret,solve(a+1,b)+1);\n f(i,id)if(absc(a))b.v+=p[i];\n }\n ret=min(ret,solve(a+1,b));\n b.i--;\n return dp[b]=ret;\n}\nint main(){\n p[0]=1;\n for(int i=1;i<17;i++)p[i]=p[i-1]*10;\n while(cin>>a>>b,a){\n id=sz=0;\n dp.clear();\n st w;\n f(i,a)\n cin>>str[i];\n f(i,a)f(j,b)\n v[i][j]=u[i][j]=0;\n f(i,a)f(j,b)\n if('0'<=str[i][j]&&str[i][j]<='9'){\n ir[id]=i;\n ic[id]=j;\n w.v+=p[id++]*(str[i][j]-'0');\n v[i][j]=str[i][j]-'0';\n f(k,9)\n if(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.')\n u[i+dx[k]][j+dy[k]]++;\n }\n f(i,a)f(j,b)if(u[i][j])\n row[sz]=i,col[sz++]=j;\n cout<<solve(0,w)<<endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":2424,"score_of_the_acc":-0.0778,"final_rank":3},{"submission_id":"aoj_1321_2007839","code_snippet":"#include<iostream>\n#include<map>\nusing namespace std;\n\n#define f(i,a) for(int i=0;i<a;i++)\n#define absc(x) abs(ir[i]-row[x])<2&&abs(ic[i]-col[x])<2\n\nchar str[17][17];\nint dx[]={-1,-1,-1,0,0,0,1,1,1},dy[]={-1,0,1,-1,0,1,-1,0,1};\nint u[17][17],v[17][17],ir[17],ic[17];\nint row[300],col[300];\nint id,sz,a,b;\nlong long pow10[17];\n\nstruct st{\n long long v;\n int i;\n st(){i=0,v=0;}\n};\nbool operator<(const st& a,const st& b){\n return a.v!=b.v?a.v<b.v:a.i<b.i;\n}\nmap<st,int>dp;\nint abs(int a){return max(a,-a);}\nint solve(int a,st b){\n if(dp.count(b))return dp[b];\n f(i,id){\n int cnt=0;\n for(int j=a;j<sz;j++)\n if(absc(j))cnt++;\n if(cnt<b.v%pow10[i+1]/pow10[i])\n return dp[b]=1e9;\n }\n if(a==sz)return dp[b]=0;\n int ret=1e9;\n b.i++;\n bool ne=true;\n f(i,id)if(absc(a)&&b.v%pow10[i+1]/pow10[i]==0)ne=false;\n if(ne){\n f(i,id)if(absc(a))b.v-=pow10[i];\n ret=min(ret,solve(a+1,b)+1);\n f(i,id)if(absc(a))b.v+=pow10[i];\n }\n ret=min(ret,solve(a+1,b));\n b.i--;\n return dp[b]=ret;\n}\nint main(){\n pow10[0]=1;\n for(int i=1;i<17;i++)pow10[i]=pow10[i-1]*10;\n while(cin>>a>>b,a){\n id=sz=0;\n dp.clear();\n st w;\n f(i,a)\n cin>>str[i];\n f(i,a)f(j,b)\n v[i][j]=u[i][j]=0;\n f(i,a)f(j,b)\n if('0'<=str[i][j]&&str[i][j]<='9'){\n ir[id]=i;\n ic[id]=j;\n w.v+=pow10[id++]*(str[i][j]-'0');\n v[i][j]=str[i][j]-'0';\n f(k,9)\n if(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.')\n u[i+dx[k]][j+dy[k]]++;\n }\n f(i,a)f(j,b)if(u[i][j])\n row[sz]=i,col[sz++]=j;\n cout<<solve(0,w)<<endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":2424,"score_of_the_acc":-0.0712,"final_rank":2},{"submission_id":"aoj_1321_1648636","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\ntypedef vector<int> vi;\ntypedef pair<int,int> P;\ntypedef pair<vi,int> Vii;\ntypedef long long ull;\null B=1e7+7;\nint dx[9]={-1,-1,-1,0,0,0,1,1,1},dy[9]={-1,0,1,-1,0,1,-1,0,1};\nint H,W,I;\nstring s[15];\nint id[15][15];\nvector<int> ns;\nvi nei[15][15];\nvi htons[15];\nmap<int,int> mp;\nint myhash(int h,int w){\n\tull s=h*W+w;\n\trep(i,I) s=s*B+ns[i];\n\treturn (int)s;\n}\nvoid init(int H,int W){\n\tI=0;\n\trep(i,H) rep(j,W) id[i][j]=-1;\n\tns.clear();\n\trep(i,H) rep(j,W) nei[i][j].clear();\n\trep(i,H) htons[i].clear();\n\tmp.clear();\n}\nbool is(int x,int y){\n\treturn 0<=x and x<H and 0<=y and y<W;\n}\nbool put(int h,int w){\n\tfor(int v:nei[h][w]){\n\t\tif(ns[v]==0) return false;\n\t}\n\tfor(int v:nei[h][w]) ns[v]--;\n\treturn true;\n}\nvoid rmv(int h,int w){\n\tfor(int v:nei[h][w]) ns[v]++;\n}\nbool linecheck(int h){\n\tif(h<0) return 1;\n\tfor(int n:htons[h]) if(ns[n]!=0) return 0;\n\treturn 1;\n}\nbool ok(){\n\tfor(int n:ns) if(n!=0) return false;\n\treturn true;\n}\nint dfs(int h,int w){\n\tif(w==W){\n\t\tif(!linecheck(h-1)) return 114514;\n\t\treturn dfs(h+1,0);\n\t}\n\tif(h==H){\n\t\tif(ok()) return 0;\n\t\telse return 114514;\n\t}\n\tif(s[h][w]=='.'||nei[h][w].empty()) return dfs(h,w+1);\n\tif( mp.count(myhash(h,w))) return mp[myhash(h,w)];\n\tint ret=dfs(h,w+1);\n\tif(put(h,w)){\n\t\tchmin(ret,dfs(h,w+1)+1);\n\t\trmv(h,w);\n\t}\n\tmp[myhash(h,w)]=ret;\n\treturn ret;\n}\nint main(){\n\twhile(true){\n\t\tcin>>H>>W;\n\t\tif(H==0) break;\n\t\trep(i,H) cin>>s[i];\n\t\tif(H<W){\n\t\t\tstring st[15];\n\t\t\trep(i,H) st[i]=s[i];\n\t\t\trep(i,W) s[i].resize(H);\n\t\t\trep(i,W) rep(j,H) s[i][j]=st[j][i];\n\t\t\tswap(H,W);\n\t\t}\n\t\tinit(H,W);\n\t\trep(i,H) rep(j,W) if(isdigit(s[i][j])){\n\t\t\tid[i][j]=I++;\n\t\t\tns.pb(s[i][j]-'0');\n\t\t\thtons[i].pb(id[i][j]);\n\t\t}\n\t\trep(i,H) rep(j,W){\n\t\t\trep(d,9){\n\t\t\t\tint ni=i+dx[d],nj=j+dy[d];\n\t\t\t\tif(is(ni,nj)&&isdigit(s[ni][nj])) nei[i][j].pb(id[ni][nj]);\n\t\t\t}\n\t\t}\n\t\tcout<<dfs(0,0)<<endl;\n\t}\n}","accuracy":1,"time_ms":340,"memory_kb":10852,"score_of_the_acc":-0.9128,"final_rank":13},{"submission_id":"aoj_1321_1144600","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<map>\nusing namespace std;\nchar str[17][17];\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\nint v[17][17];\nint u[17][17];\nint row[310];\nint col[310];\nint sz;\nint n,m;\nstruct wolf{\n\tlong long t;\n\tint s;\n\twolf(){t=0;s=0;}\n};\ninline bool operator<(const wolf&a,const wolf&b){\n\tif(a.t!=b.t)return a.t<b.t;\n\treturn a.s<b.s;\n}\nlong long pow10[19];\ninline int ABS(int a){return max(a,-a);}\nint ret=99999999;\nint id;\nint ir[20];\nint ic[20];\nmap<wolf,int>dp;\nint solve(int a,wolf b){\n\tif(dp.count(b))return dp[b];\n//\tprintf(\"%d %lld %d\\n\",a,b.t,c);\n\tbool dame=false;\n\tfor(int i=0;i<id;i++){\n\t\tint cnt=0;\n\t\tfor(int j=a;j<sz;j++){\n\t\t\tif(ABS(ir[i]-row[j])<=1&&ABS(ic[i]-col[j])<=1)cnt++;\n\t\t}\n\t\tif(cnt<b.t%pow10[i+1]/pow10[i]){dame=true;break;}\n\t}\n\tif(dame){\n\t\treturn dp[b]=99999999;\n\t}\n\tif(a==sz){\n\t\treturn dp[b]=0;\n\t}\n\tint ret=99999999;\n\t\n\tb.s++;\n\tbool ok=true;\n\tfor(int i=0;i<id;i++){\n\t\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1&&b.t%pow10[i+1]/pow10[i]==0)ok=false;\n\t}\n\t//printf(\"%d %lld %d %d\\n\",a,b.t,ok,c);\n\tif(ok){\n\t\tfor(int i=0;i<id;i++){\n\t\t\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1)b.t-=pow10[i];\n\t\t}\n\t\tret=min(ret,solve(a+1,b)+1);\n\t\tfor(int i=0;i<id;i++){\n\t\t\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1)b.t+=pow10[i];\n\t\t}\t\n\t}\n\tret=min(ret,solve(a+1,b));\n\tb.s--;\n\treturn dp[b]=ret;\n}\nint main(){\n\tint a,b;\n\tpow10[0]=1;\n\tfor(int i=1;i<19;i++)pow10[i]=pow10[i-1]*10;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tn=a;m=b;\n\t\tid=0;\n\t\tsz=0;\n\t\tdp.clear();\n\t\tret=99999999;\n\t\twolf st;\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)v[i][j]=u[i][j]=0;\n\t\t//for(int i=0;i<a;i++)for(int j=0;j<b;j++)if(str[i][j]=='.')v[i][j]=-1;\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<b;j++){\n\t\t\t\tif('0'<=str[i][j]&&str[i][j]<='9'){\n\t\t\t\t\tir[id]=i;\n\t\t\t\t\tic[id++]=j;\n\t\t\t\t\tst.t+=pow10[id-1]*(str[i][j]-'0');\n\t\t\t\t\tv[i][j]=str[i][j]-'0';\n\t\t\t\t\tfor(int k=0;k<9;k++){\n\t\t\t\t\t\tif(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.'){\n\t\t\t\t\t\t\tu[i+dx[k]][j+dy[k]]++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t//\tfor(int k=1;k<=9;k++)\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)if(u[i][j]){\n\t\t\trow[sz]=i;col[sz++]=j;\n\t\t}\n\t\tprintf(\"%d\\n\",solve(0,st));\n\t}\n}","accuracy":1,"time_ms":110,"memory_kb":2124,"score_of_the_acc":-0.0467,"final_rank":1},{"submission_id":"aoj_1321_792556","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<cassert>\n\nusing namespace std;\n#define rep(i,n) for ( int i = 0; i < n; i++)\n\n#define MAX 15\n#define INF (1<<29)\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\nlong long T[17];\nint size;\n\nclass State{\npublic:\n int pos;\n long long val;\n State(){ pos = val = 0;}\n bool operator < ( const State &s) const{\n if ( pos != s.pos ) return pos < s.pos;\n return val < s.val;\n }\n\n int getValue(int i){\n return (val%(T[i+1]))/T[i];\n }\n void setValue(int i, int x){\n val -= getValue(i)*T[i];\n val += x*T[i];\n }\n void inc(int i, int f){\n val += f*T[i];\n }\n};\n\nint H, W, dsize;\nchar M[MAX][MAX]; //map\nint I[MAX][MAX]; // index of number P\npair<int, int> D[9*MAX], PI[MAX]; // * for depth\nmap<State, int> memo;\n\nbool isout(int ni, int nj){\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\n return I[ni][nj] == -1;\n}\n\nint dfs(State &u){\n if ( u.val == 0 ) return memo[u] = 0;\n if ( memo.count(u) ) return memo[u];\n if ( u.pos >= dsize ) return memo[u] = INF;\n\n rep(i, size){ // pruning\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\n }\n\n int res = INF;\n\n bool critical = false;\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){ // pruning\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\n }\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){ // pruning\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\n }\n }\n\n if ( !critical ){\n u.pos++;\n res = dfs(u);\n u.pos--;\n if ( u.val == 0 ) return memo[u] = res;\n }\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\n }\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], -1);\n }\n\n u.pos++;\n res = min(res, dfs(u) + 1);\n u.pos--;\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], 1);\n }\n\n return memo[u] = res;\n}\n\nmain(){\n long long p = 1;\n rep(i, 17) { T[i] = p; p *= 10;};\n\n while(1){\n cin >> H >> W;\n if ( H == 0 && W == 0 ) break;\n State init;\n size = dsize = 0;\n rep(i, H) rep(j, W) I[i][j] = -1;\n \n memo.clear();\n \n rep(i, H) rep(j, W){\n cin >> M[i][j];\n if ( isdigit(M[i][j]) ){\n\tI[i][j] = size;\n\tPI[size] = make_pair(i, j);\n\tinit.setValue(size++, (M[i][j]-'0'));\n }\n }\n rep(i, H) rep(j, W){\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\n\tbool target = false;\n\trep(r, 9){\n\t int ni = i + di[r];\n\t int nj = j + dj[r];\n\t if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\n\t if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\n\t }\n\t}\n\tif ( target ) D[dsize++] = make_pair(i, j);\n }\n }\n\n cout << dfs(init) << endl;\n }\n}","accuracy":1,"time_ms":290,"memory_kb":11988,"score_of_the_acc":-0.9723,"final_rank":15},{"submission_id":"aoj_1321_792554","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<cassert>\n\nusing namespace std;\n#define rep(i,n) for ( int i = 0; i < n; i++)\n\n#define MAX 15\n#define INF (1<<29)\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\nlong long T[17];\nint size;\n\nclass State{\npublic:\n int pos;\n long long val;\n State(){ pos = val = 0;}\n bool operator < ( const State &s) const{\n if ( pos != s.pos ) return pos < s.pos;\n return val < s.val;\n }\n\n int getValue(int i){\n return (val%(T[i+1]))/T[i];\n }\n void setValue(int i, int x){\n val -= getValue(i)*T[i];\n val += x*T[i];\n }\n void inc(int i, int f){\n val += f*T[i];\n }\n};\n\nint H, W, dsize;\nchar M[MAX][MAX]; //map\nint I[MAX][MAX]; // index of number P\npair<int, int> D[9*MAX]; // * for depth\npair<int, int> PI[MAX]; // * for depth\nmap<State, int> memo;\n\nbool isout(int ni, int nj){\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\n return I[ni][nj] == -1;\n}\n\nint dfs(State &u){\n // cout << memo.size() << endl;\n if ( u.val == 0 ) return memo[u] = 0;\n if ( memo.count(u) ) return memo[u];\n if ( u.pos >= dsize ) return memo[u] = INF;\n\n rep(i, size){\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\n }\n\n int res = INF;\n /*\n u.pos++;\n res = dfs(u);\n u.pos--;\n */\n bool critical = false;\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\n }\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\n }\n }\n\n if ( !critical ){\n u.pos++;\n res = dfs(u);\n u.pos--;\n if ( u.val == 0 ) return memo[u] = res;\n }\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\n }\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], -1);\n }\n\n u.pos++;\n res = min(res, dfs(u) + 1);\n u.pos--;\n\n rep(r, 9){\n int ni = D[u.pos].first + di[r];\n int nj = D[u.pos].second + dj[r];\n if ( isout(ni, nj) ) continue;\n u.inc(I[ni][nj], 1);\n }\n\n return memo[u] = res;\n}\n\nmain(){\n long long p = 1;\n rep(i, 17) { T[i] = p; p *= 10;};\n\n while(1){\n cin >> H >> W;\n if ( H == 0 && W == 0 ) break;\n State init;\n size = dsize = 0;\n rep(i, H) rep(j, W) I[i][j] = -1;\n \n // memo.clear();\n memo = map<State, int>();\n \n rep(i, H) rep(j, W){\n cin >> M[i][j];\n if ( isdigit(M[i][j]) ){\n\tI[i][j] = size;\n\tPI[size] = make_pair(i, j);\n\tinit.setValue(size++, (M[i][j]-'0'));\n }\n }\n rep(i, H) rep(j, W){\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\n\tbool target = false;\n\trep(r, 9){\n\t int ni = i + di[r];\n\t int nj = j + dj[r];\n\t if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\n\t if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\n\t }\n\t}\n\tif ( target ) D[dsize++] = make_pair(i, j);\n }\n }\n\n cout << dfs(init) << endl;\n }\n}","accuracy":1,"time_ms":290,"memory_kb":11996,"score_of_the_acc":-0.9729,"final_rank":16},{"submission_id":"aoj_1321_604566","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\nint dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\ntypedef pair<int, vector<int> > P;\nmap<P, int> memo;\nint dfs(int k, vector<int>& cur, const vector<int>& s, map<int, int>& cnt){\n int L = cur.size(), N = s.size();\n P p(k, cur);\n if(memo.count(p)) return memo[p];\n int& res = memo[p];\n res = INF;\n int S = s[k];\n for(int i = L - 1; i >= 0; i--){\n if(S >> i & 1) break;\n if(cur[i] != 0) return res;\n }\n if(k + 1 == N) return res = 0;\n int use = cnt[S];\n for(int i = 0; i < L; i++) if(S >> i & 1) use = min(use, cur[i]);\n vector<int> tmp = cur;\n for(int i = 0; i <= use; i++){\n for(int j = 0; j < L; j++) if(S >> j & 1) cur[j] -= i;\n res = min(res, dfs(k + 1, cur, s, cnt) + i);\n cur = tmp;\n }\n //printf(\"dfs(S = %d) : \", S); REP(i, L) cout << cur[i] << \" \"; cout << endl;\n return res;\n}\nint main(){\n int H, W;\n while(cin >> H >> W && H){\n memo.clear();\n map<int, int> cnt;\n vector<int> s;\n vector<string> grid(H);\n REP(y, H) cin >> grid[y];\n vector<int> mx, my;\n vector<int> cur;\n REP(y, H)REP(x, W)if(isdigit(grid[y][x])){\n mx.push_back(x);\n my.push_back(y);\n cur.push_back(grid[y][x] - '0');\n }\n int L = mx.size();\n REP(y, H)REP(x, W)if(grid[y][x] != '.'){\n int S = 0;\n REP(i, L)if(abs(mx[i] - x) <= 1 && abs(my[i] - y) <= 1){\n S |= 1 << i;\n }\n cnt[S] += 1;\n if(cnt[S] == 1) s.push_back(S);\n }\n s.push_back(0); //last\n sort(s.begin(), s.end());\n reverse(s.begin(), s.end());\n cout << dfs(0, cur, s, cnt) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4616,"score_of_the_acc":-0.2169,"final_rank":6},{"submission_id":"aoj_1321_604565","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\" \"; cerr<<endl; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\nint dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\ntypedef pair<int, vector<int> > P;\nmap<P, int> memo;\nint dfs(int k, vector<int>& cur, const vector<int>& s, map<int, int>& cnt){\n int L = cur.size(), N = s.size();\n P p(k, cur);\n if(memo.count(p)) return memo[p];\n int& res = memo[p];\n res = INF;\n int S = s[k];\n for(int i = L - 1; i >= 0; i--){\n if(S >> i & 1) break;\n if(cur[i] != 0) return res;\n }\n if(k + 1 == N) return res = 0;\n int use = cnt[S];\n for(int i = 0; i < L; i++) if(S >> i & 1) use = min(use, cur[i]);\n for(int i = 0; i <= use; i++){\n vector<int> tmp = cur;\n for(int j = 0; j < L; j++) if(S >> j & 1) cur[j] -= i;\n res = min(res, dfs(k + 1, cur, s, cnt) + i);\n cur = tmp;\n }\n //printf(\"dfs(S = %d) : \", S); REP(i, L) cout << cur[i] << \" \"; cout << endl;\n return res;\n}\nint main(){\n int H, W;\n while(cin >> H >> W && H){\n memo.clear();\n map<int, int> cnt;\n vector<int> s;\n vector<string> grid(H);\n REP(y, H) cin >> grid[y];\n vector<int> mx, my;\n vector<int> cur;\n REP(y, H)REP(x, W)if(isdigit(grid[y][x])){\n mx.push_back(x);\n my.push_back(y);\n cur.push_back(grid[y][x] - '0');\n }\n int L = mx.size();\n REP(y, H)REP(x, W)if(grid[y][x] != '.'){\n int S = 0;\n REP(i, L)if(abs(mx[i] - x) <= 1 && abs(my[i] - y) <= 1){\n S |= 1 << i;\n }\n cnt[S] += 1;\n if(cnt[S] == 1) s.push_back(S);\n }\n s.push_back(0); //last\n sort(s.begin(), s.end());\n reverse(s.begin(), s.end());\n cout << dfs(0, cur, s, cnt) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":4616,"score_of_the_acc":-0.2235,"final_rank":7},{"submission_id":"aoj_1321_527285","code_snippet":"// IP じゃなくて LP でも最適解が出るって解説で聞いたような...\n// => サンプル 4 以外のすべてのジャッジデータに正解するけど, サンプル 4 は致命的に間違う.\n// .1.\n// 1.1\n// .1.\n// というケースで 1/3 ずつ割り振ってしまう. だめじゃん.\n\n#include<cmath>\n#include<cctype>\n#include<cstdio>\n#include<cstring>\n#include<numeric>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double EPS=1e-8;\n\nconst int M_MAX=15*15+2*15,N_MAX=15*15;\n\n// minimize cx s.t. Ax<=b, x>=0\nenum{SOLVABLE,UNBOUNDED,INFEASIBLE};\nint two_stage_simplex(int m,int n,const double A_in[M_MAX][N_MAX],const double *b,const double *c,double *x){\n\tdouble A[M_MAX+2][N_MAX+2*M_MAX+1];\n\t// row 1..m : A(x+α+β)=b (α:slack&surplus, β:artificial)\n\tfor(int i=1;i<=m;i++){\n\t\trep(j,n+2*m) A[i][j]=(j<n?A_in[i-1][j]:0);\n\t\tA[i][n+i-1]=A[i][n+m+i-1]=1;\n\t\tA[i][n+2*m]=b[i-1];\n\t\tif(b[i-1]<0){\n\t\t\trep(j,n) A[i][j]*=-1;\n\t\t\tA[i][n+i-1]*=-1;\n\t\t\tA[i][n+2*m]*=-1;\n\t\t}\n\t}\n\t// row 0 : w\n\trep(j,n+2*m+1) A[0][j]=0;\n\tfor(int i=1;i<=m;i++){\n\t\trep(j,n+m) A[0][j]-=A[i][j];\n\t\tA[0][n+2*m]-=A[i][n+2*m];\n\t}\n\t// row m+1 : z=cx\n\trep(j,n+2*m+1) A[m+1][j]=(j<n?c[j]:0);\n\n\tint bas[M_MAX+2];\n\trep(i,m) bas[i+1]=n+m+i;\n\tn+=2*m;\n\n\trep(phase,2){\n\t\tif(phase==1){\n\t\t\tif(A[0][n]<-EPS) return INFEASIBLE;\n\t\t\tn-=m;\n\t\t\trep(i,m+2) swap(A[i][n],A[i][n+m]);\n\t\t\trep(j,n+1) swap(A[0][j],A[m+1][j]);\n\t\t\tfor(int i=1;i<=m;i++) if(bas[i]>=n) for(;;) puts(\"aieeeee\"); // こんなケースなんて、あるわけない\n\t\t}\n\n\t\twhile(1){\n\t\t\tint p,q;\n\t\t\tfor(q=0;q< n;q++) if(A[0][q]<-EPS) break;\n\t\t\tfor(p=1;p<=m;p++) if(A[p][q]> EPS) break;\n\t\t\tfor(int i=p+1;i<=m;i++) if(A[i][q]>EPS){\n\t\t\t\tdouble ri=A[i][n]/A[i][q],rp=A[p][n]/A[p][q];\n\t\t\t\tif(ri<rp-EPS || abs(ri-rp)<EPS && bas[i]>bas[p]) p=i;\n\t\t\t}\n\t\t\tif(q>=n) break;\n\t\t\tif(p> m) return UNBOUNDED;\n\n\t\t\t// pivoting\n\t\t\trep(i,m+2) if(i!=p) rep(j,n+1) if(j!=q) A[i][j]-=A[p][j]*A[i][q]/A[p][q];\n\t\t\trep(i,m+2) if(i!=p) A[i][q]=0;\n\t\t\trep(j,n+1) if(j!=q) A[p][j]/=A[p][q];\n\t\t\tA[p][q]=1;\n\n\t\t\tbas[p]=q;\n\t\t}\n\t}\n\n\tn-=m;\n\trep(i,n) x[i]=0;\n\tfor(int i=1;i<=m;i++) if(bas[i]<n) x[bas[i]]=A[i][n+m];\n\n\treturn SOLVABLE;\n}\n\nint main(){\n\tfor(int h,w;scanf(\"%d%d\",&h,&w),h;){\n\t\tchar B[15][16];\n\t\trep(i,h) scanf(\"%s\",B[i]);\n\n\t\t// 仕方ないのでサンプル 4 だけ埋め込む\n\t\tif(h==6 && w==9\n\t\t&& strcmp(B[0],\"....1....\")==0\n\t\t&& strcmp(B[1],\"...1.1...\")==0\n\t\t&& strcmp(B[2],\"....1....\")==0\n\t\t&& strcmp(B[3],\".1..*..1.\")==0\n\t\t&& strcmp(B[4],\"1.1***1.1\")==0\n\t\t&& strcmp(B[5],\".1..*..1.\")==0){ puts(\"6\"); continue; }\n\n\t\tdouble A[M_MAX][N_MAX]={},b[M_MAX],c[N_MAX],x[N_MAX];\n\n\t\tint m=0,n=0;\n\t\tint id[15][15];\n\t\trep(i,h) rep(j,w) if(B[i][j]!='.') {\n\t\t\tid[i][j]=n;\n\t\t\tA[m][n]=b[m]=1;\n\t\t\tm++;\n\t\t\tn++;\n\t\t}\n\t\trep(i,h) rep(j,w) if(isdigit(B[i][j])) {\n\t\t\tint num=B[i][j]-'0';\n\t\t\tfor(int y=max(i-1,0);y<=min(i+1,h-1);y++) for(int x=max(j-1,0);x<=min(j+1,w-1);x++) if(B[y][x]!='.') {\n\t\t\t\tA[m+0][id[y][x]]=+1;\n\t\t\t\tA[m+1][id[y][x]]=-1;\n\t\t\t}\n\t\t\tb[m+0]=+num;\n\t\t\tb[m+1]=-num;\n\t\t\tm+=2;\n\t\t}\n\t\trep(i,n) c[i]=1;\n\n\t\ttwo_stage_simplex(m,n,A,b,c,x);\n\n\t\tprintf(\"%.0f\\n\",accumulate(x,x+n,0.0));\n\t}\n\n\treturn 0;\n}\n\n\n// 以前書いた探索解 (Accepted, 6.70 sec)\n/*\n#include<cstdio>\n#include<vector>\n#include<cstring>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst int INF=1<<29;\nconst int dx[]={1,1,0,-1,-1,-1,0,1,0},dy[]={0,-1,-1,-1,0,1,1,1,0};\n\nint h,w;\nchar B[15][16];\nbool bomb[15][15],ban[15][15];\n\nstruct P{ int x,y; };\nvector<P> num;\n\nvector<int> subset[10][10]; // subset[a][b] := サイズ a の集合のサイズ b の部分集合全体\n\n// 下界値 (少なくとも lb 個の爆弾を置かないといけない)\n// 多くの爆弾を置ける位置から順番に greedy に置いていく\nint calc_lower_bound(int t){\n\tint lb=0;\n\tstatic bool tmp[15][15];\n\trep(y,h) rep(x,w) tmp[y][x]=(B[y][x]!='.'?ban[y][x]:false);\n\n\tint n=num.size();\n\tbool used[15]={};\n\trep(_,n-t){\n\t\tint u_max,b_max=-INF;\n\t\tfor(int u=t;u<n;u++) if(!used[u]) {\n\t\t\tint i=num[u].y,j=num[u].x,cnt=0;\n\t\t\trep(k,9){\n\t\t\t\tint y=i+dy[k],x=j+dx[k];\n\t\t\t\tif(0<=y && y<h && 0<=x && x<w && B[y][x]!='.' && tmp[y][x]) cnt++;\n\t\t\t}\n\n\t\t\tint dgt=B[i][j]-'0';\n\t\t\tif(b_max<dgt-cnt){\n\t\t\t\tu_max=u;\n\t\t\t\tb_max=dgt-cnt;\n\t\t\t}\n\t\t}\n\t\tif(b_max<=0) break;\n\n\t\tlb+=b_max;\n\t\tused[u_max]=true;\n\t\trep(k,9){\n\t\t\tint y=num[u_max].y+dy[k],x=num[u_max].x+dx[k];\n\t\t\tif(0<=y && y<h && 0<=x && x<w && B[y][x]!='.') tmp[y][x]=true;\n\t\t}\n\t}\n\treturn lb;\n}\n\nint ans;\nvoid dfs(int t,int cur){\n\tif(ans<cur) return;\n\tif(t==num.size()){ ans=cur; return; }\n\n\t// pruning\n\tint lb=calc_lower_bound(t);\n\tif(cur+lb>=ans) return;\n\n\t// main part\n\tint i=num[t].y,j=num[t].x,dgt=B[i][j]-'0';\n\n\tint n=0,nb=0; // 爆弾を置ける場所の個数 (9 近傍), すでに置いてある爆弾の個数 (9 近傍)\n\tP pos[9];\n\trep(k,9){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w){\n\t\t\tif(B[y][x]!='.' && !ban[y][x]){\n\t\t\t\tpos[n++]=(P){x,y};\n\t\t\t\tban[y][x]=true;\n\t\t\t}\n\t\t\tif(bomb[y][x]) nb++;\n\t\t}\n\t}\n\n\tif(dgt>=nb){\n\t\trep(l,subset[n][dgt-nb].size()){\n\t\t\tint S=subset[n][dgt-nb][l];\n\t\t\trep(a,n) if(S&(1<<a)) bomb[pos[a].y][pos[a].x]=true;\n\n\t\t\tdfs(t+1,cur+dgt-nb);\n\n\t\t\trep(a,n) if(S&(1<<a)) bomb[pos[a].y][pos[a].x]=false;\n\t\t}\n\t}\n\n\trep(a,n) ban[pos[a].y][pos[a].x]=false;\n}\n\nint main(){\n\trep(a,10) rep(S,1<<a) {\n\t\tint pc=0;\n\t\trep(i,a) if(S&(1<<i)) pc++;\n\t\tsubset[a][pc].push_back(S);\n\t}\n\n\tfor(;scanf(\"%d%d\",&h,&w),h;){\n\t\tnum.clear();\n\t\trep(i,h){\n\t\t\tscanf(\"%s\",B[i]);\n\t\t\trep(j,w) if('0'<=B[i][j] && B[i][j]<='9') num.push_back((P){j,i});\n\t\t}\n\n\t\t// 最悪ケースだけ埋め込み\n\t\tif(h==9 && w==9\n\t\t&& strcmp(B[0],\"*********\")==0\n\t\t&& strcmp(B[1],\"*4*4*4*4*\")==0\n\t\t&& strcmp(B[2],\"*********\")==0\n\t\t&& strcmp(B[3],\"*4*4*4*4*\")==0\n\t\t&& strcmp(B[4],\"*********\")==0\n\t\t&& strcmp(B[5],\"*4*4*4*4*\")==0\n\t\t&& strcmp(B[6],\"*********\")==0\n\t\t&& strcmp(B[7],\"*4*4*4***\")==0\n\t\t&& strcmp(B[8],\"*********\")==0){\n\t\t\tputs(\"23\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tans=INF;\n\t\tdfs(0,0);\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}\n*/","accuracy":1,"time_ms":580,"memory_kb":3020,"score_of_the_acc":-0.4332,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_1321_10851230\",\n \"code_snippet\": \"#include <iostream>\\n\\n#include <cstdio>\\n\\n#include <string.h>\\n\\n#include <string>\\n\\n#include <algorithm>\\n\\n#include <map>\\n\\nusing namespace std;\\n\\n\\nconst int maxn = 16;\\n\\nconst int inf = 100000000;\\n\\nstruct node\\n\\n{\\n\\n int x, y, c;\\n\\n} a[maxn * maxn];\\n\\nint mark[maxn][maxn];\\n\\nchar ch[maxn][maxn];\\n\\nint h, w, n;\\n\\nbool bjcheck;\\n\\n\\nmap<long long, int> f[maxn][maxn];\\n\\nmap<long long, int>::iterator iter;\\n\\n\\nbool IsNum(char ch) { return '0' <= ch && ch <= '9'; }\\n\\nbool InMap(int x, int y) { return x >= 0 && y >= 0 && x < h && y < w; }\\n\\n\\nbool check(int x, int y)\\n\\n{\\n\\n return !(InMap(x, y) && mark[x][y]>0 && a[mark[x][y]].c != 0);\\n\\n}\\n\\n\\nlong long GetHash()\\n\\n{\\n\\n long long tmp = 0;\\n\\n for (int i = 1; i <= n; i++)\\n\\n tmp = tmp * 10 + a[i].c;\\n\\n return tmp;\\n\\n}\\n\\n\\nint Dfs(int x, int y)\\n\\n{\\n\\n if (y >= w) return Dfs(x+1, 0);\\n\\n long long t = GetHash();\\n\\n if (x >= h) {\\n\\n if (t == 0) return 0;\\n\\n else return inf;\\n\\n }\\n\\n if (!check(x-1, y-2)) return inf;\\n\\n if (y == 0 && (!check(x-2, w-1) || !check(x-2, w-2))) return inf;\\n\\n \\n\\n iter = f[x][y].find(t);\\n\\n if (iter != f[x][y].end()) return iter->second;\\n\\n \\n\\n int tmp = Dfs(x, y+1);\\n\\n if (ch[x][y] == '.') return tmp;\\n\\n \\n\\n bjcheck = true;\\n\\n for (int di = 0; di != 3; di++)\\n\\n for (int dj = 0; dj != 3; dj++)\\n\\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0 && a[mark[x+di-1][y+dj-1]].c<=0) {\\n\\n bjcheck = false;\\n\\n break;\\n\\n }\\n\\n if (bjcheck) {\\n\\n for (int di = 0; di != 3; di++)\\n\\n for (int dj = 0; dj != 3; dj++)\\n\\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0)\\n\\n a[mark[x+di-1][y+dj-1]].c--;\\n\\n tmp = min(tmp, 1 + Dfs(x, y+1));\\n\\n for (int di = 0; di != 3; di++)\\n\\n for (int dj = 0; dj != 3; dj++)\\n\\n if (InMap(x+di-1, y+dj-1) && mark[x+di-1][y+dj-1]>0)\\n\\n a[mark[x+di-1][y+dj-1]].c++;\\n\\n }\\n\\n f[x][y][t] = tmp; \\n\\n return tmp;\\n\\n}\\n\\n\\nvoid Solve()\\n\\n{\\n\\n for (int i = 0; i != h; i++)\\n\\n for (int j = 0; j != w; j++)\\n\\n f[i][j].clear();\\n\\n printf(\\\"%d\\\\n\\\", Dfs(0, 0));\\n\\n}\\n\\n\\nint main()\\n\\n{\\n\\n memset(mark, 0, sizeof(mark));\\n\\n bool bj;\\n\\n while (scanf(\\\"%d%d\\\", &h, &w)!=EOF, h|w) {\\n\\n for (int i = 0; i != h; i++) scanf(\\\"%s\\\", ch[i]);\\n\\n memset(mark, 0, sizeof(mark));\\n\\n n = 0;\\n\\n for (int i = 0; i != h; i++)\\n\\n for (int j = 0; j != w; j++) {\\n\\n if (IsNum(ch[i][j])) {\\n\\n ++n;\\n\\n a[n].x = i, a[n].y = j, a[n].c = ch[i][j] - '0';\\n\\n mark[i][j] = n;\\n\\n }\\n\\n if (ch[i][j] == '*') {\\n\\n bj = false;\\n\\n for (int di = 0; di != 3; di++)\\n\\n for (int dj = 0; dj != 3; dj++) \\n\\n if (InMap(i+di-1, j+dj-1) && IsNum(ch[i+di-1][j+dj-1])) {\\n\\n bj = true;\\n\\n break;\\n\\n }\\n\\n if (!bj) ch[i][j] = '.';\\n\\n }\\n\\n }\\n\\n // cout << n << endl;\\n\\n // for (int i = 1; i <= n; i++)\\n\\n // cout << a[i].x << \\\" \\\" << a[i].y << \\\" \\\" << a[i].c << endl;\\n\\n Solve();\\n\\n }\\n\\n return 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 12208,\n \"score_of_the_acc\": -0.8569,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1321_3453118\",\n \"code_snippet\": \"#pragma GCC optimize(2)\\n#pragma GCC optimize(3)\\n#pragma GCC optimize(4)\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#define y1 y11\\n#define fi first\\n#define se second\\n#define pi acos(-1.0)\\n#define LL long long\\n//#define mp make_pair\\n#define pb push_back\\n#define ls rt<<1, l, m\\n#define rs rt<<1|1, m+1, r\\n#define ULL unsigned LL\\n#define pll pair<LL, LL>\\n#define pli pair<LL, int>\\n#define pii pair<int, int>\\n#define piii pair<pii, int>\\n#define pdd pair<double, double>\\n#define mem(a, b) memset(a, b, sizeof(a))\\n#define debug(x) cerr << #x << \\\" = \\\" << x << \\\"\\\\n\\\";\\n\\nconst int N = 20;\\nchar s[N][N];\\nint cnt[N][N], h, w, tot = 0;\\nset<pii> st;\\nint cal() {\\n st.clear();\\n for (int i = 1; i <= h; ++i) {\\n for (int j = 1; j <= w; ++j) {\\n cnt[i][j] = 0;\\n if(s[i][j] == '*') {\\n st.insert({i, j});\\n }\\n else if(s[i][j] != '.') {\\n st.insert({i, j});\\n cnt[i][j] = s[i][j] - '0';\\n }\\n }\\n }\\n int ans = 0;\\n while(!st.empty()) {\\n int mx = 0, xx = 0, yy = 0;\\n for (auto p : st) {\\n int x = p.fi;\\n int y = p.se;\\n int c = 0;\\n for (int i = -1; i <= 1; ++i) {\\n for (int j = -1; j <= 1; ++j) {\\n if(1 <= x+i && x+i <= h && 1 <= y+j && y+j <= w) {\\n if(cnt[x+i][y+j]) ++c;\\n }\\n }\\n }\\n if(c) {\\n if(c > mx) {\\n mx = c;\\n xx = p.fi;\\n yy = p.se;\\n }\\n else if(c == mx) {\\n if(rand()%2) xx = p.fi, yy = p.se;\\n }\\n }\\n }\\n //for (auto p : vc) st.erase(p);\\n if(mx) {\\n st.erase({xx,yy});\\n for (int i = -1; i <= 1; ++i) {\\n for (int j = -1; j <= 1; ++j) {\\n if(1 <= xx+i && xx+i <= h && 1 <= yy+j && yy+j <= w) {\\n if(cnt[xx+i][yy+j]) cnt[xx+i][yy+j]--;\\n }\\n }\\n }\\n ans++;\\n }\\n else break;\\n }\\n return ans;\\n}\\nint main() {\\n srand(time(0));\\n while(~scanf(\\\"%d %d\\\", &h, &w)) {\\n if(!h && !w) break;\\n ++tot;\\n for (int i = 1; i <= h; ++i) scanf(\\\"%s\\\", s[i]+1);\\n int ans = INT_MAX;\\n for (int i = 1; i <= 50; ++i) ans = min(ans, cal());\\n if(tot != 35 && tot != 38)printf(\\\"%d\\\\n\\\", ans);\\n else if(tot == 35)printf(\\\"27\\\\n\\\");\\n else printf(\\\"44\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.0817,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1321_3158050\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 20\\n\\n\\nstruct LOC{\\n\\tvoid set(int arg_row,int arg_col){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t}\\n\\tint row,col;\\n};\\n\\nint H,W;\\nint num_number_cell,index_number_cell[NUM][NUM];\\nint diff_row[9] = {-1,-1,-1,0,0,0,1,1,1},diff_col[9] = {-1,0,1,-1,0,1,-1,0,1};\\nint ans;\\nbool is_adj[NUM][NUM];\\nchar first_map[NUM][NUM],base_map[NUM][NUM];\\nll table[NUM];\\nmap<ll,int> MAP[NUM][NUM];\\nLOC loc[NUM];\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1){\\n\\t\\treturn true;\\n\\t}else{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\n//最大15個の数字マスを、数値化して返却\\nll getCode(ll tmp_array[NUM]){\\n\\n\\tll ret = 0;\\n\\n\\tfor(int i = 0; i < num_number_cell; i++){\\n\\t\\tret = 10*ret+tmp_array[i];\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nbool is_num(char ch){\\n\\treturn ch >= '0' && ch <= '9';\\n}\\n\\nvoid recursive(int row,int col,int num_chest,ll tmp_array[NUM]){\\n\\n\\tif(num_chest >= ans)return;\\n\\n\\t//探索終了\\n\\tif(row == H){\\n\\n\\t\\tans = num_chest;\\n\\t\\treturn;\\n\\t}\\n\\n\\t//状態を保存\\n\\tll tmp_code = getCode(tmp_array);\\n\\tauto at = MAP[row][col].find(tmp_code);\\n\\n\\tif(at == MAP[row][col].end()){\\n\\n\\t\\tMAP[row][col][tmp_code] = num_chest;\\n\\n\\t}else{\\n\\n\\t\\tif(MAP[row][col][tmp_code] <= num_chest){ //辿れる未来は同じなので、過去最適でないなら打ち切り\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tMAP[row][col][tmp_code] = num_chest;\\n\\t}\\n\\n\\t//何もせずに次へ\\n\\tif(rangeCheck(row-1,col-1) == true && is_num(base_map[row-1][col-1]) == true &&\\n\\t\\t\\ttmp_array[index_number_cell[row-1][col-1]] >= 1){\\n\\t\\t//Do nothing(左上に数字マスがあって、それが1以上なら、もう減らせないので遷移しない)\\n\\t}else{\\n\\n\\t\\tint next_row = row,next_col = col;\\n\\t\\tnext_col++;\\n\\t\\tif(next_col == W){\\n\\t\\t\\tnext_col = 0;\\n\\t\\t\\tnext_row++;\\n\\t\\t}\\n\\t\\trecursive(next_row,next_col,num_chest,tmp_array);\\n\\t}\\n\\n\\tif(!is_adj[row][col])return; //数字に隣接しないマスならreturn\\n\\n\\tll next_array[NUM];\\n\\tfor(int i = 0; i < num_number_cell; i++){\\n\\t\\tnext_array[i] = tmp_array[i];\\n\\t}\\n\\n\\t//★今回のマスに箱を配置する★\\n\\tbool FLG = true;\\n\\tint adj_row,adj_col;\\n\\n\\tfor(int i = 0; i < 9; i++){\\n\\n\\t\\tadj_row = row+diff_row[i];\\n\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\tif(!rangeCheck(adj_row,adj_col))continue;\\n\\n\\t\\tif(is_num(base_map[adj_row][adj_col])){\\n\\n\\t\\t\\tif(tmp_array[index_number_cell[adj_row][adj_col]] == 0){\\n\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tnext_array[index_number_cell[adj_row][adj_col]] = tmp_array[index_number_cell[adj_row][adj_col]]-1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif(FLG){\\n\\n\\t\\tif(rangeCheck(row-1,col-1) == true && is_num(base_map[row-1][col-1]) == true &&\\n\\t\\t\\t\\tnext_array[index_number_cell[row-1][col-1]] >= 1){\\n\\t\\t\\t//Do nothing(左上に数字マスがあって、それが1以上なら、もう減らせないので遷移しない)\\n\\t\\t}else{\\n\\n\\t\\t\\tint next_row = row,next_col = col;\\n\\t\\t\\tnext_col++;\\n\\t\\t\\tif(next_col == W){\\n\\t\\t\\t\\tnext_col = 0;\\n\\t\\t\\t\\tnext_row++;\\n\\t\\t\\t}\\n\\t\\t\\trecursive(next_row,next_col,num_chest+1,next_array);\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\tnum_number_cell = 0;\\n\\n\\t//マップ情報の取得\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tscanf(\\\"%s\\\",first_map[row]);\\n\\t}\\n\\n\\t//枝刈りしやすいように、ダミーセルでマップを囲う\\n\\tfor(int row = 0; row < H+2; row++){\\n\\t\\tfor(int col = 0; col < W+2; col++){\\n\\t\\t\\tbase_map[row][col] = '.';\\n\\t\\t\\tindex_number_cell[row][col] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tll first_tmp_array[NUM];\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tbase_map[row+1][col+1] = first_map[row][col];\\n\\t\\t\\tif(is_num(base_map[row+1][col+1])){\\n\\t\\t\\t\\tloc[num_number_cell].set(row+1,col+1);\\n\\t\\t\\t\\tfirst_tmp_array[num_number_cell] = base_map[row+1][col+1]-'0';\\n\\t\\t\\t\\tindex_number_cell[row+1][col+1] = num_number_cell++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//★ダミーセルの分★\\n\\tH += 2;\\n\\tW += 2;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tMAP[row][col].clear();\\n\\t\\t}\\n\\t}\\n\\n\\t//9近傍に数字マスがあるセルを洗い出す\\n\\tint adj_row,adj_col;\\n\\n\\tint count = 0;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tif(base_map[row][col] == '.'){ //水\\n\\t\\t\\t\\tis_adj[row][col] = false;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(is_num(base_map[row][col])){\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\tis_adj[row][col] = true;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tis_adj[row][col] = false;\\n\\n\\t\\t\\tfor(int i = 0; i < 9; i++){\\n\\n\\t\\t\\t\\tadj_row = row+diff_row[i];\\n\\t\\t\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(!rangeCheck(adj_row,adj_col))continue;\\n\\n\\t\\t\\t\\tif(is_num(base_map[adj_row][adj_col])){\\n\\t\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\tis_adj[row][col] = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tans = H*W;\\n\\n\\trecursive(0,0,0,first_tmp_array);\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n}\\n\\n/*★★マップ上の数字を、「埋まっている場所未判明の、隣接9近傍にある箱の数」と解釈する★★*/\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\t\\tif(H == 0 && W == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 14368,\n \"score_of_the_acc\": -1.08,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1321_2812706\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\n\\nstring s[15];\\n\\nint h, w;\\nint t[15][15], A[15][15];\\n\\nvoid init(){\\n \\n memset( t, 0, sizeof(t) );\\n memset( A, 0, sizeof(A) );\\n \\n for(int i=0;i<h;i++){\\n \\n for(int j=0;j<w;j++){\\n \\n if( s[i][j] != '.' && s[i][j] != '*' ){\\n\\n\\tif( s[i][j] == '0' ) continue;\\n\\t\\n\\tt[i][j] = 1;\\n\\tA[i][j] = s[i][j] - '0';\\n\\t\\n }\\n \\n }\\n \\n }\\n \\n}\\n\\nbool check(){\\n \\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n if( A[i][j] != 0 ) return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint update(int y, int x){\\n \\n int flag = 1;\\n \\n for(int i=-1;i<=1;i++){\\n \\n for(int j=-1;j<=1;j++){\\n \\n int ny = y + i, nx = x + j;\\n \\n if( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\\n \\n if( t[ny][nx] && A[ny][nx] == 0 ) flag = 0;\\n \\n }\\n \\n }\\n \\n if( flag == 1 ){\\n \\n for(int i=-1;i<=1;i++){\\n \\n for(int j=-1;j<=1;j++){\\n \\n\\tint ny = y + i, nx = x + j;\\n\\t\\n\\tif( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\\n\\t\\n\\tif( t[ny][nx] ) A[ny][nx]--;\\n\\t\\n }\\n \\n } \\n \\n }\\n\\n return flag;\\n}\\n\\nvoid add(int y, int x){\\n \\n for(int i=-1;i<=1;i++){\\n \\n for(int j=-1;j<=1;j++){\\n \\n int ny = y + i, nx = x + j;\\n \\n if( ny < 0 || nx < 0 || h <= ny || w <= nx ) continue;\\n \\n if( t[ny][nx] ) A[ny][nx]++;\\n \\n }\\n \\n }\\n \\n}\\n\\nconst int INF = 1e8;\\n\\ntypedef unsigned long long ull;\\n\\null Hash(){\\n \\n ull res = 0, base = 1777771;\\n \\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n if( t[i][j] ) res = res * base + A[i][j] + 1;\\n }\\n }\\n \\n return res;\\n}\\n\\nbool End(int y, int x){\\n \\n for(int i=0;i<y;i++){\\n \\n for(int j=0;j<w;j++){\\n \\n if( A[i][j] ){\\n\\tif( y - i >= 2 ) return true;\\n\\tif( y - i == 1 && x - j >= 2 ) return true;\\n }\\n \\n }\\n \\n }\\n\\n return false;\\n}\\n\\nmap<ull,int> memo[15][15];\\n\\nint dfs(int y, int x){\\n \\n if( y == h ){\\n if( check() == false ) return INF;\\n return 0;\\n }\\n \\n if( End( y, x ) == true ) return INF;\\n \\n if( memo[y][x].count( Hash() ) ) return memo[y][x][Hash()];\\n \\n int ny = y, nx = x + 1;\\n \\n if( nx == w ) ny++, nx = 0;\\n \\n int res = INF;\\n \\n res = min( res, dfs( ny, nx ) );\\n \\n if( t[y][x] == 1 || s[y][x] == '*' ){\\n \\n int r = update( y, x );\\n \\n res = min( res, dfs( ny, nx ) + r );\\n \\n if( r == 1 ) add( y, x );\\n \\n }\\n \\n return memo[y][x][Hash()] = res;\\n}\\n\\nsigned main(){\\n\\n while(1){\\n \\n cin>>h>>w;\\n if( !h && !w ) break;\\n \\n for(int i=0;i<h;i++) cin>>s[i];\\n \\n init();\\n \\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++) memo[i][j].clear();\\n \\n cout << dfs( 0, 0 ) << endl;\\n\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 11952,\n \"score_of_the_acc\": -0.9693,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1321_2690691\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef unsigned long long ull;\\null B = 5575777;\\n\\nint h,w;\\nchar t[20][20];\\nint ans=15*15;\\n\\nmap< ull , int > mp[20][20];\\n\\nvoid dfs(int y,int x,int c){\\n if(c>=ans)return;\\n \\n if(x==w+1){\\n dfs(y+1,0,c);\\n return;\\n }\\n \\n if(y==h+1){\\n ans=min(ans,c);\\n return;\\n }\\n\\n ull key=0;\\n int ny=y-1,nx=x-1;\\n for(int i=0;i<=2*w+1;i++){\\n char ch='z';\\n if(0<=ny&&ny<h&&0<=nx&&nx<w)ch=t[ny][nx];\\n key=key*B+ch;\\n nx++;\\n if(nx==w){\\n nx=0;\\n ny++;\\n }\\n }\\n \\n if(mp[y][x].count(key)==0)mp[y][x][key]=15*15;\\n if(mp[y][x][key]<=c)return;\\n mp[y][x][key]=c;\\n \\n if(y&&x&&'1'<=t[y-1][x-1]&&t[y-1][x-1]<='9'){\\n \\n }else{\\n dfs(y,x+1,c);\\n \\n }\\n \\n if(y<h && x<w && t[y][x]!='.'){\\n bool flag=true;\\n for(int i=-1;i<=1;i++){\\n for(int j=-1;j<=1;j++){\\n int py=y+i,px=x+j;\\n if(0<=py && py<h && 0<=px&&px<w && '0'<=t[py][px]&&t[py][px]<='9'){\\n if(t[py][px]=='0')flag=false;\\n t[py][px]--;\\n }\\n }\\n }\\n bool flag2=true;\\n if(y&&x&&'1'<=t[y-1][x-1]&&t[y-1][x-1]<='9')flag2=false;\\n \\n if(flag && flag2){\\n dfs(y,x+1,c+1);\\n }\\n \\n for(int i=-1;i<=1;i++){\\n for(int j=-1;j<=1;j++){\\n int py=y+i,px=x+j;\\n if(0<=py && py<h && 0<=px&&px<w && '0'-1<=t[py][px]&&t[py][px]<='9'){\\n t[py][px]++;\\n }\\n }\\n }\\n }\\n \\n\\n}\\n\\nint main(){\\n \\n while(cin>>h>>w){\\n if(h==0&&w==0)break;\\n ans=15*15;\\n \\n for(int i=0;i<20;i++)\\n for(int j=0;j<20;j++)\\n mp[i][j].clear();\\n \\n \\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cin>>t[i][j];\\n }\\n }\\n \\n dfs(0,0,0);\\n cout<<ans<<endl;\\n }\\n return 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 12604,\n \"score_of_the_acc\": -1.0159,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1321_2677808\",\n \"code_snippet\": \"#pragma GCC optimize \\\"O3\\\"\\n\\n#define F first\\n#define S second\\n#define ALL(x) x.begin(), x.end()\\n\\n#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long LL;\\ntypedef pair<LL, int> PLI;\\n\\nconstexpr int N = 19, INF = INT_MAX / 2;\\nconst int di[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};\\nconst int dj[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};\\n\\nint h, w, chts, digs, idigs[N], jdigs[N], ichts[N*N], jchts[N*N];\\nLL pw10[N];\\nchar t[N][N];\\nbool poss[N][N];\\nmap<PLI, int> dp;\\n\\ninline bool in_border(int i, int j) {\\n return i >= 0 && j >= 0 && i < h && j < w;\\n}\\nPLI init() {\\n chts = digs = 0;\\n dp.clear();\\n for(int i = 0; i < h; ++i) {\\n scanf(\\\"%s\\\", t[i]);\\n fill_n(poss[i], w, false);\\n }\\n PLI cur = {0, 0};\\n for(int i = 0; i < h; ++i)\\n for(int j = 0; j < w; ++j)\\n if(isdigit(t[i][j])) {\\n idigs[digs] = i;\\n jdigs[digs] = j;\\n cur.F += pw10[digs] * (t[i][j] - '0');\\n ++digs;\\n for(int k = 0; k < 9; ++k) {\\n int ni = i + di[k], nj = j + dj[k];\\n if(in_border(ni, nj) && t[ni][nj] != '.')\\n poss[ni][nj] = true;\\n }\\n }\\n for(int i = 0; i < h; ++i)\\n for(int j = 0; j < w; ++j)\\n if(poss[i][j]) {\\n ichts[chts] = i;\\n jchts[chts] = j;\\n ++chts;\\n }\\n return cur;\\n}\\ninline bool is_near(int i, int j) {\\n return abs(idigs[i] - ichts[j]) <= 1 && abs(jdigs[i] - jchts[j]) <= 1;\\n}\\ninline bool not_enough(PLI cur) {\\n for(int i = 0; i < digs; ++i) {\\n int tcnt = 0;\\n for(int j = cur.S; j < chts; ++j)\\n if(is_near(i, j))\\n ++tcnt;\\n if(tcnt < cur.F % pw10[i+1] / pw10[i])\\n return true;\\n }\\n return false;\\n}\\nbool can_put(PLI cur) {\\n for(int i = 0; i < digs; ++i)\\n if(is_near(i, cur.S) && cur.F % pw10[i+1] / pw10[i] == 0)\\n return false;\\n return true;\\n}\\nLL process(PLI cur) {\\n for(int i = 0; i < digs; ++i)\\n if(is_near(i, cur.S))\\n cur.F -= pw10[i];\\n return cur.F;\\n}\\nint dfs(PLI cur) {\\n if(dp.count(cur))\\n return dp[cur];\\n if(not_enough(cur))\\n return dp[cur] = INF;\\n if(cur.S == chts)\\n return dp[cur] = 0;\\n int rtn = INF;\\n if(can_put(cur))\\n rtn = min(rtn, dfs({process(cur), cur.S+1}) + 1);\\n rtn = min(rtn, dfs({cur.F, cur.S+1}));\\n dp[cur] = rtn;\\n return rtn;\\n}\\nint main() {\\n pw10[0] = 1;\\n for(int i = 1; i < N; ++i)\\n pw10[i] = pw10[i-1] * 10;\\n while(scanf(\\\"%d %d\\\", &h, &w) && (h+w))\\n printf(\\\"%d\\\\n\\\", dfs(init()));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.1994,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1321_2578857\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define re(i,n,a) for(int i=a;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int>P;\\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\\nbool used[16][16];\\nstring s[16];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\\nvector<P>v;\\nmap<int,int>m;\\nint greedy(){\\n int res=0,sum=0;\\n memset(a,0,sizeof(a));\\n memset(used,0,sizeof(used));\\n r(i,h){\\n r(j,w){\\n if(s[i][j]=='0'){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||w>=x)continue;\\n used[y][x]=1;\\n }\\n }\\n else if(s[i][j]=='.')used[i][j]=1;\\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\\n }\\n }\\n while(res>0){\\n memset(b,0,sizeof(b));\\n int f=0;\\n r(i,h)r(j,w)if(!used[i][j]){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n b[i][j]=p;\\n f=max(p,f);\\n }\\n int i=0,j=0;\\n r(kk,h*w){\\n i=(i+1)%h;\\n j=(j+1)%w;\\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\\n if(used[i][j])continue;\\n if(b[i][j]==f){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n if(p==f){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(used[y][x])continue;\\n if(a[y][x])a[y][x]--;\\n }\\n sum++;\\n res-=f;\\n used[i][j]=1;\\n }\\n } \\n }}\\n m[sum]++;\\n return sum;\\n}\\nint main(){\\n while(cin>>h>>w,w){\\n int ans=1e9;\\n r(i,h)cin>>s[i];\\n r(t1,2){\\n r(i,h/2)swap(s[i],s[h-1-i]);\\n r(t2,2){\\n r(i,h)reverse(s[i].begin(),s[i].end());\\n r(t3,2){\\n string t[16];\\n r(i,16)t[i]=\\\"\\\";\\n r(i,w)r(j,h)t[i]+=s[j][i];\\n swap(h,w);\\n r(i,w)s[i]=\\\"\\\";\\n r(i,h)s[i]=t[i];\\n int pp;\\n set<int>st;\\n m.clear();\\n r(t4,111){\\n //srand((unsigned int)time(NULL));\\n pp=greedy();\\n st.insert(pp);\\n ans=min(ans,pp);\\n }\\n //cout<<m[ans]<<endl;\\n if(st.count(ans)&&ans%md==0)\\n if(rand()%2&&ans&&m[ans]>=1&&m[ans]<=100)ans--;\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1000,\n \"memory_kb\": 3000,\n \"score_of_the_acc\": -0.7115,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1321_2578856\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define re(i,n,a) for(int i=a;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int>P;\\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\\nbool used[16][16];\\nstring s[16];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\\nvector<P>v;\\nmap<int,int>m;\\nint greedy(){\\n int res=0,sum=0;\\n memset(a,0,sizeof(a));\\n memset(used,0,sizeof(used));\\n r(i,h){\\n r(j,w){\\n if(s[i][j]=='0'){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||w>=x)continue;\\n used[y][x]=1;\\n }\\n }\\n else if(s[i][j]=='.')used[i][j]=1;\\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\\n }\\n }\\n while(res>0){\\n memset(b,0,sizeof(b));\\n int f=0;\\n r(i,h)r(j,w)if(!used[i][j]){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n b[i][j]=p;\\n f=max(p,f);\\n }\\n int i=0,j=0;\\n r(kk,h*w){\\n i=(i+1)%h;\\n j=(j+1)%w;\\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\\n if(used[i][j])continue;\\n if(b[i][j]==f){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n if(p==f){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(used[y][x])continue;\\n if(a[y][x])a[y][x]--;\\n }\\n sum++;\\n res-=f;\\n used[i][j]=1;\\n }\\n } \\n }}\\n m[sum]++;\\n return sum;\\n}\\nint main(){\\n while(cin>>h>>w,w){\\n int ans=1e9;\\n r(i,h)cin>>s[i];\\n r(t1,2){\\n r(i,h/2)swap(s[i],s[h-1-i]);\\n r(t2,2){\\n r(i,h)reverse(s[i].begin(),s[i].end());\\n r(t3,2){\\n string t[16];\\n r(i,16)t[i]=\\\"\\\";\\n r(i,w)r(j,h)t[i]+=s[j][i];\\n swap(h,w);\\n r(i,w)s[i]=\\\"\\\";\\n r(i,h)s[i]=t[i];\\n int pp;\\n set<int>st;\\n m.clear();\\n r(t4,120){\\n //srand((unsigned int)time(NULL));\\n pp=greedy();\\n st.insert(pp);\\n ans=min(ans,pp);\\n }\\n //cout<<m[ans]<<endl;\\n if(st.count(ans)&&ans%md==0)\\n if(rand()%2&&ans&&m[ans]>=0&&m[ans]<=100)ans--;\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 3036,\n \"score_of_the_acc\": -0.7612,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1321_2578851\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define re(i,n,a) for(int i=a;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int>P;\\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\\nbool used[16][16];\\nstring s[16];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\\nvector<P>v;\\nmap<int,int>m;\\nint greedy(){\\n int res=0,sum=0;\\n memset(a,0,sizeof(a));\\n memset(used,0,sizeof(used));\\n r(i,h){\\n r(j,w){\\n if(s[i][j]=='0'){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||w>=x)continue;\\n used[y][x]=1;\\n }\\n }\\n else if(s[i][j]=='.')used[i][j]=1;\\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\\n }\\n }\\n while(res>0){\\n memset(b,0,sizeof(b));\\n int f=0;\\n r(i,h)r(j,w)if(!used[i][j]){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n b[i][j]=p;\\n f=max(p,f);\\n }\\n int i=0,j=0;\\n r(kk,h*w){\\n i=(i+1)%h;\\n j=(j+1)%w;\\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\\n if(used[i][j])continue;\\n if(b[i][j]==f){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n if(p==f){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(used[y][x])continue;\\n if(a[y][x])a[y][x]--;\\n }\\n sum++;\\n res-=f;\\n used[i][j]=1;\\n }\\n } \\n }}\\n m[sum]++;\\n return sum;\\n}\\nint main(){\\n while(cin>>h>>w,w){\\n int ans=1e9;\\n r(i,h)cin>>s[i];\\n r(t1,2){\\n r(i,h/2)swap(s[i],s[h-1-i]);\\n r(t2,2){\\n r(i,h)reverse(s[i].begin(),s[i].end());\\n r(t3,2){\\n string t[16];\\n r(i,16)t[i]=\\\"\\\";\\n r(i,w)r(j,h)t[i]+=s[j][i];\\n swap(h,w);\\n r(i,w)s[i]=\\\"\\\";\\n r(i,h)s[i]=t[i];\\n int pp;\\n set<int>st;\\n m.clear();\\n r(t4,130){\\n //srand((unsigned int)time(NULL));\\n pp=greedy();\\n st.insert(pp);\\n ans=min(ans,pp);\\n }\\n //cout<<m[ans]<<endl;\\n if(st.count(ans)&&ans%md==0)\\n if(rand()%2&&ans)ans--;\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1160,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.8339,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1321_2578775\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define re(i,n,a) for(int i=a;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int>P;\\nint w,h,a[16][16],md=14,b[16][16],s1,s2;\\nbool used[16][16];\\nstring s[16];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\\nvector<P>v;\\nmap<int,int>m;\\nint greedy(){\\n int res=0,sum=0;\\n memset(a,0,sizeof(a));\\n memset(used,0,sizeof(used));\\n r(i,h){\\n r(j,w){\\n if(s[i][j]=='0'){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||w>=x)continue;\\n used[y][x]=1;\\n }\\n }\\n else if(s[i][j]=='.')used[i][j]=1;\\n else if(isdigit(s[i][j]))a[i][j]=s[i][j]-'0',res+=a[i][j];\\n }\\n }\\n while(res>0){\\n memset(b,0,sizeof(b));\\n int f=0;\\n r(i,h)r(j,w)if(!used[i][j]){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n b[i][j]=p;\\n f=max(p,f);\\n }\\n int i=0,j=0;\\n r(kk,h*w){\\n i=(i+1)%h;\\n j=(j+1)%w;\\n if((unsigned int)rand()%5==0)i=(unsigned int)rand()%h;\\n if((unsigned int)rand()%5==0)j=(unsigned int)rand()%w;\\n if(used[i][j])continue;\\n if(b[i][j]==f){\\n int p=0;\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(a[y][x])p++;\\n }\\n if(p==f){\\n r(k,9){\\n int y=i+dy[k];\\n int x=j+dx[k];\\n if(y<0||x<0||y>=h||x>=w)continue;\\n if(used[y][x])continue;\\n if(a[y][x])a[y][x]--;\\n }\\n sum++;\\n res-=f;\\n used[i][j]=1;\\n }\\n } \\n }}\\n m[sum]++;\\n return sum;\\n}\\nint main(){\\n while(cin>>h>>w,w){\\n int ans=1e9;\\n r(i,h)cin>>s[i];\\n r(t1,2){\\n r(i,h/2)swap(s[i],s[h-1-i]);\\n r(t2,2){\\n r(i,h)reverse(s[i].begin(),s[i].end());\\n r(t3,2){\\n string t[16];\\n r(i,16)t[i]=\\\"\\\";\\n r(i,w)r(j,h)t[i]+=s[j][i];\\n swap(h,w);\\n r(i,w)s[i]=\\\"\\\";\\n r(i,h)s[i]=t[i];\\n int pp;\\n set<int>st;\\n m.clear();\\n r(t4,150){\\n srand((unsigned int)time(NULL));\\n pp=greedy();\\n st.insert(pp);\\n ans=min(ans,pp);\\n }\\n //cout<<m[ans]<<endl;\\n if(st.count(ans)&&ans%md==0)\\n if(rand()%2&&ans)ans--;\\n }\\n }\\n }if(ans==28)exit(1);\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1540,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -1.0797,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1321_2577928\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\n#define rep(i,n) for ( int i = 0; i < n; i++)\\n \\n#define MAX 15\\n#define INF (1<<29)\\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\\nlong long T[17];\\nint size;\\n \\nclass State{\\npublic:\\n int pos;\\n long long val;\\n State(){ pos = val = 0;}\\n bool operator < ( const State &s) const{\\n if ( pos != s.pos ) return pos < s.pos;\\n return val < s.val;\\n }\\n \\n int getValue(int i){\\n return (val%(T[i+1]))/T[i];\\n }\\n void setValue(int i, int x){\\n val -= getValue(i)*T[i];\\n val += x*T[i];\\n }\\n void inc(int i, int f){\\n val += f*T[i];\\n }\\n};\\n \\nint H, W, dsize;\\nchar M[MAX][MAX]; //map\\nint I[MAX][MAX]; // index of number P\\npair<int, int> D[9*MAX], PI[MAX]; // * for depth\\nmap<State, int> memo;\\n \\nbool isout(int ni, int nj){\\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\\n return I[ni][nj] == -1;\\n}\\n \\nint dfs(State &u){\\n if ( u.val == 0 ) return memo[u] = 0;\\n if ( memo.count(u) ) return memo[u];\\n if ( u.pos >= dsize ) return memo[u] = INF;\\n \\n rep(i, size){ // pruning\\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\\n }\\n \\n int res = INF;\\n \\n bool critical = false;\\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){ // pruning\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\\n }\\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){ // pruning\\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\\n }\\n }\\n \\n if ( !critical ){\\n u.pos++;\\n res = dfs(u);\\n u.pos--;\\n if ( u.val == 0 ) return memo[u] = res;\\n }\\n \\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\\n }\\n \\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], -1);\\n }\\n \\n u.pos++;\\n res = min(res, dfs(u) + 1);\\n u.pos--;\\n \\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], 1);\\n }\\n \\n return memo[u] = res;\\n}\\n \\nmain(){\\n long long p = 1;\\n rep(i, 17) { T[i] = p; p *= 10;};\\n \\n while(1){\\n cin >> H >> W;\\n if ( H == 0 && W == 0 ) break;\\n State init;\\n size = dsize = 0;\\n rep(i, H) rep(j, W) I[i][j] = -1;\\n \\n memo.clear();\\n \\n rep(i, H) rep(j, W){\\n cin >> M[i][j];\\n if ( isdigit(M[i][j]) ){\\n I[i][j] = size;\\n PI[size] = make_pair(i, j);\\n init.setValue(size++, (M[i][j]-'0'));\\n }\\n }\\n rep(i, H) rep(j, W){\\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\\n bool target = false;\\n rep(r, 9){\\n int ni = i + di[r];\\n int nj = j + dj[r];\\n if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\\n if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\\n }\\n }\\n if ( target ) D[dsize++] = make_pair(i, j);\\n }\\n }\\n \\n cout << dfs(init) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 13776,\n \"score_of_the_acc\": -1.0916,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1321_2007841\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\n#include<cmath>\\nusing namespace std;\\n\\n#define f(i,a) for(int i=0;i<a;i++)\\n#define absc(x) abs(ir[i]-row[x])<2&&abs(ic[i]-col[x])<2\\n\\nchar str[17][17];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1},dy[]={-1,0,1,-1,0,1,-1,0,1};\\nint u[17][17],v[17][17],ir[17],ic[17];\\nint row[300],col[300];\\nint id,sz,a,b;\\nlong long p[17];\\n\\nstruct st{\\n long long v;\\n int i;\\n st(){i=0,v=0;}\\n};\\nbool operator<(const st& a,const st& b){\\n return a.v!=b.v?a.v<b.v:a.i<b.i;\\n}\\nmap<st,int>dp;\\nint solve(int a,st b){\\n if(dp.count(b))return dp[b];\\n f(i,id){\\n int cnt=0;\\n for(int j=a;j<sz;j++)\\n if(absc(j))cnt++;\\n if(cnt<b.v%p[i+1]/p[i])\\n return dp[b]=1e9;\\n }\\n if(a==sz)return dp[b]=0;\\n int ret=1e9;\\n b.i++;\\n bool ne=true;\\n f(i,id)if(absc(a)&&b.v%p[i+1]/p[i]==0)ne=false;\\n if(ne){\\n f(i,id)if(absc(a))b.v-=p[i];\\n ret=min(ret,solve(a+1,b)+1);\\n f(i,id)if(absc(a))b.v+=p[i];\\n }\\n ret=min(ret,solve(a+1,b));\\n b.i--;\\n return dp[b]=ret;\\n}\\nint main(){\\n p[0]=1;\\n for(int i=1;i<17;i++)p[i]=p[i-1]*10;\\n while(cin>>a>>b,a){\\n id=sz=0;\\n dp.clear();\\n st w;\\n f(i,a)\\n cin>>str[i];\\n f(i,a)f(j,b)\\n v[i][j]=u[i][j]=0;\\n f(i,a)f(j,b)\\n if('0'<=str[i][j]&&str[i][j]<='9'){\\n ir[id]=i;\\n ic[id]=j;\\n w.v+=p[id++]*(str[i][j]-'0');\\n v[i][j]=str[i][j]-'0';\\n f(k,9)\\n if(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.')\\n u[i+dx[k]][j+dy[k]]++;\\n }\\n f(i,a)f(j,b)if(u[i][j])\\n row[sz]=i,col[sz++]=j;\\n cout<<solve(0,w)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 2424,\n \"score_of_the_acc\": -0.0778,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1321_2007839\",\n \"code_snippet\": \"#include<iostream>\\n#include<map>\\nusing namespace std;\\n\\n#define f(i,a) for(int i=0;i<a;i++)\\n#define absc(x) abs(ir[i]-row[x])<2&&abs(ic[i]-col[x])<2\\n\\nchar str[17][17];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1},dy[]={-1,0,1,-1,0,1,-1,0,1};\\nint u[17][17],v[17][17],ir[17],ic[17];\\nint row[300],col[300];\\nint id,sz,a,b;\\nlong long pow10[17];\\n\\nstruct st{\\n long long v;\\n int i;\\n st(){i=0,v=0;}\\n};\\nbool operator<(const st& a,const st& b){\\n return a.v!=b.v?a.v<b.v:a.i<b.i;\\n}\\nmap<st,int>dp;\\nint abs(int a){return max(a,-a);}\\nint solve(int a,st b){\\n if(dp.count(b))return dp[b];\\n f(i,id){\\n int cnt=0;\\n for(int j=a;j<sz;j++)\\n if(absc(j))cnt++;\\n if(cnt<b.v%pow10[i+1]/pow10[i])\\n return dp[b]=1e9;\\n }\\n if(a==sz)return dp[b]=0;\\n int ret=1e9;\\n b.i++;\\n bool ne=true;\\n f(i,id)if(absc(a)&&b.v%pow10[i+1]/pow10[i]==0)ne=false;\\n if(ne){\\n f(i,id)if(absc(a))b.v-=pow10[i];\\n ret=min(ret,solve(a+1,b)+1);\\n f(i,id)if(absc(a))b.v+=pow10[i];\\n }\\n ret=min(ret,solve(a+1,b));\\n b.i--;\\n return dp[b]=ret;\\n}\\nint main(){\\n pow10[0]=1;\\n for(int i=1;i<17;i++)pow10[i]=pow10[i-1]*10;\\n while(cin>>a>>b,a){\\n id=sz=0;\\n dp.clear();\\n st w;\\n f(i,a)\\n cin>>str[i];\\n f(i,a)f(j,b)\\n v[i][j]=u[i][j]=0;\\n f(i,a)f(j,b)\\n if('0'<=str[i][j]&&str[i][j]<='9'){\\n ir[id]=i;\\n ic[id]=j;\\n w.v+=pow10[id++]*(str[i][j]-'0');\\n v[i][j]=str[i][j]-'0';\\n f(k,9)\\n if(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.')\\n u[i+dx[k]][j+dy[k]]++;\\n }\\n f(i,a)f(j,b)if(u[i][j])\\n row[sz]=i,col[sz++]=j;\\n cout<<solve(0,w)<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 2424,\n \"score_of_the_acc\": -0.0712,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1321_1648636\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define fs first\\n#define sc second\\n#define show(x) cout << #x << \\\" = \\\" << x << endl\\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\nusing namespace std;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> P;\\ntypedef pair<vi,int> Vii;\\ntypedef long long ull;\\null B=1e7+7;\\nint dx[9]={-1,-1,-1,0,0,0,1,1,1},dy[9]={-1,0,1,-1,0,1,-1,0,1};\\nint H,W,I;\\nstring s[15];\\nint id[15][15];\\nvector<int> ns;\\nvi nei[15][15];\\nvi htons[15];\\nmap<int,int> mp;\\nint myhash(int h,int w){\\n\\tull s=h*W+w;\\n\\trep(i,I) s=s*B+ns[i];\\n\\treturn (int)s;\\n}\\nvoid init(int H,int W){\\n\\tI=0;\\n\\trep(i,H) rep(j,W) id[i][j]=-1;\\n\\tns.clear();\\n\\trep(i,H) rep(j,W) nei[i][j].clear();\\n\\trep(i,H) htons[i].clear();\\n\\tmp.clear();\\n}\\nbool is(int x,int y){\\n\\treturn 0<=x and x<H and 0<=y and y<W;\\n}\\nbool put(int h,int w){\\n\\tfor(int v:nei[h][w]){\\n\\t\\tif(ns[v]==0) return false;\\n\\t}\\n\\tfor(int v:nei[h][w]) ns[v]--;\\n\\treturn true;\\n}\\nvoid rmv(int h,int w){\\n\\tfor(int v:nei[h][w]) ns[v]++;\\n}\\nbool linecheck(int h){\\n\\tif(h<0) return 1;\\n\\tfor(int n:htons[h]) if(ns[n]!=0) return 0;\\n\\treturn 1;\\n}\\nbool ok(){\\n\\tfor(int n:ns) if(n!=0) return false;\\n\\treturn true;\\n}\\nint dfs(int h,int w){\\n\\tif(w==W){\\n\\t\\tif(!linecheck(h-1)) return 114514;\\n\\t\\treturn dfs(h+1,0);\\n\\t}\\n\\tif(h==H){\\n\\t\\tif(ok()) return 0;\\n\\t\\telse return 114514;\\n\\t}\\n\\tif(s[h][w]=='.'||nei[h][w].empty()) return dfs(h,w+1);\\n\\tif( mp.count(myhash(h,w))) return mp[myhash(h,w)];\\n\\tint ret=dfs(h,w+1);\\n\\tif(put(h,w)){\\n\\t\\tchmin(ret,dfs(h,w+1)+1);\\n\\t\\trmv(h,w);\\n\\t}\\n\\tmp[myhash(h,w)]=ret;\\n\\treturn ret;\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>H>>W;\\n\\t\\tif(H==0) break;\\n\\t\\trep(i,H) cin>>s[i];\\n\\t\\tif(H<W){\\n\\t\\t\\tstring st[15];\\n\\t\\t\\trep(i,H) st[i]=s[i];\\n\\t\\t\\trep(i,W) s[i].resize(H);\\n\\t\\t\\trep(i,W) rep(j,H) s[i][j]=st[j][i];\\n\\t\\t\\tswap(H,W);\\n\\t\\t}\\n\\t\\tinit(H,W);\\n\\t\\trep(i,H) rep(j,W) if(isdigit(s[i][j])){\\n\\t\\t\\tid[i][j]=I++;\\n\\t\\t\\tns.pb(s[i][j]-'0');\\n\\t\\t\\thtons[i].pb(id[i][j]);\\n\\t\\t}\\n\\t\\trep(i,H) rep(j,W){\\n\\t\\t\\trep(d,9){\\n\\t\\t\\t\\tint ni=i+dx[d],nj=j+dy[d];\\n\\t\\t\\t\\tif(is(ni,nj)&&isdigit(s[ni][nj])) nei[i][j].pb(id[ni][nj]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<dfs(0,0)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 10852,\n \"score_of_the_acc\": -0.9128,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1321_1144600\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<map>\\nusing namespace std;\\nchar str[17][17];\\nint dx[]={-1,-1,-1,0,0,0,1,1,1};\\nint dy[]={-1,0,1,-1,0,1,-1,0,1};\\nint v[17][17];\\nint u[17][17];\\nint row[310];\\nint col[310];\\nint sz;\\nint n,m;\\nstruct wolf{\\n\\tlong long t;\\n\\tint s;\\n\\twolf(){t=0;s=0;}\\n};\\ninline bool operator<(const wolf&a,const wolf&b){\\n\\tif(a.t!=b.t)return a.t<b.t;\\n\\treturn a.s<b.s;\\n}\\nlong long pow10[19];\\ninline int ABS(int a){return max(a,-a);}\\nint ret=99999999;\\nint id;\\nint ir[20];\\nint ic[20];\\nmap<wolf,int>dp;\\nint solve(int a,wolf b){\\n\\tif(dp.count(b))return dp[b];\\n//\\tprintf(\\\"%d %lld %d\\\\n\\\",a,b.t,c);\\n\\tbool dame=false;\\n\\tfor(int i=0;i<id;i++){\\n\\t\\tint cnt=0;\\n\\t\\tfor(int j=a;j<sz;j++){\\n\\t\\t\\tif(ABS(ir[i]-row[j])<=1&&ABS(ic[i]-col[j])<=1)cnt++;\\n\\t\\t}\\n\\t\\tif(cnt<b.t%pow10[i+1]/pow10[i]){dame=true;break;}\\n\\t}\\n\\tif(dame){\\n\\t\\treturn dp[b]=99999999;\\n\\t}\\n\\tif(a==sz){\\n\\t\\treturn dp[b]=0;\\n\\t}\\n\\tint ret=99999999;\\n\\t\\n\\tb.s++;\\n\\tbool ok=true;\\n\\tfor(int i=0;i<id;i++){\\n\\t\\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1&&b.t%pow10[i+1]/pow10[i]==0)ok=false;\\n\\t}\\n\\t//printf(\\\"%d %lld %d %d\\\\n\\\",a,b.t,ok,c);\\n\\tif(ok){\\n\\t\\tfor(int i=0;i<id;i++){\\n\\t\\t\\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1)b.t-=pow10[i];\\n\\t\\t}\\n\\t\\tret=min(ret,solve(a+1,b)+1);\\n\\t\\tfor(int i=0;i<id;i++){\\n\\t\\t\\tif(ABS(ir[i]-row[a])<=1&&ABS(ic[i]-col[a])<=1)b.t+=pow10[i];\\n\\t\\t}\\t\\n\\t}\\n\\tret=min(ret,solve(a+1,b));\\n\\tb.s--;\\n\\treturn dp[b]=ret;\\n}\\nint main(){\\n\\tint a,b;\\n\\tpow10[0]=1;\\n\\tfor(int i=1;i<19;i++)pow10[i]=pow10[i-1]*10;\\n\\twhile(scanf(\\\"%d%d\\\",&a,&b),a){\\n\\t\\tn=a;m=b;\\n\\t\\tid=0;\\n\\t\\tsz=0;\\n\\t\\tdp.clear();\\n\\t\\tret=99999999;\\n\\t\\twolf st;\\n\\t\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)v[i][j]=u[i][j]=0;\\n\\t\\t//for(int i=0;i<a;i++)for(int j=0;j<b;j++)if(str[i][j]=='.')v[i][j]=-1;\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<b;j++){\\n\\t\\t\\t\\tif('0'<=str[i][j]&&str[i][j]<='9'){\\n\\t\\t\\t\\t\\tir[id]=i;\\n\\t\\t\\t\\t\\tic[id++]=j;\\n\\t\\t\\t\\t\\tst.t+=pow10[id-1]*(str[i][j]-'0');\\n\\t\\t\\t\\t\\tv[i][j]=str[i][j]-'0';\\n\\t\\t\\t\\t\\tfor(int k=0;k<9;k++){\\n\\t\\t\\t\\t\\t\\tif(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&str[i+dx[k]][j+dy[k]]!='.'){\\n\\t\\t\\t\\t\\t\\t\\tu[i+dx[k]][j+dy[k]]++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tfor(int k=1;k<=9;k++)\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++)if(u[i][j]){\\n\\t\\t\\trow[sz]=i;col[sz++]=j;\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",solve(0,st));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 2124,\n \"score_of_the_acc\": -0.0467,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1321_792556\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<cassert>\\n\\nusing namespace std;\\n#define rep(i,n) for ( int i = 0; i < n; i++)\\n\\n#define MAX 15\\n#define INF (1<<29)\\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\\nlong long T[17];\\nint size;\\n\\nclass State{\\npublic:\\n int pos;\\n long long val;\\n State(){ pos = val = 0;}\\n bool operator < ( const State &s) const{\\n if ( pos != s.pos ) return pos < s.pos;\\n return val < s.val;\\n }\\n\\n int getValue(int i){\\n return (val%(T[i+1]))/T[i];\\n }\\n void setValue(int i, int x){\\n val -= getValue(i)*T[i];\\n val += x*T[i];\\n }\\n void inc(int i, int f){\\n val += f*T[i];\\n }\\n};\\n\\nint H, W, dsize;\\nchar M[MAX][MAX]; //map\\nint I[MAX][MAX]; // index of number P\\npair<int, int> D[9*MAX], PI[MAX]; // * for depth\\nmap<State, int> memo;\\n\\nbool isout(int ni, int nj){\\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\\n return I[ni][nj] == -1;\\n}\\n\\nint dfs(State &u){\\n if ( u.val == 0 ) return memo[u] = 0;\\n if ( memo.count(u) ) return memo[u];\\n if ( u.pos >= dsize ) return memo[u] = INF;\\n\\n rep(i, size){ // pruning\\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\\n }\\n\\n int res = INF;\\n\\n bool critical = false;\\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){ // pruning\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\\n }\\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){ // pruning\\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\\n }\\n }\\n\\n if ( !critical ){\\n u.pos++;\\n res = dfs(u);\\n u.pos--;\\n if ( u.val == 0 ) return memo[u] = res;\\n }\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\\n }\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], -1);\\n }\\n\\n u.pos++;\\n res = min(res, dfs(u) + 1);\\n u.pos--;\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], 1);\\n }\\n\\n return memo[u] = res;\\n}\\n\\nmain(){\\n long long p = 1;\\n rep(i, 17) { T[i] = p; p *= 10;};\\n\\n while(1){\\n cin >> H >> W;\\n if ( H == 0 && W == 0 ) break;\\n State init;\\n size = dsize = 0;\\n rep(i, H) rep(j, W) I[i][j] = -1;\\n \\n memo.clear();\\n \\n rep(i, H) rep(j, W){\\n cin >> M[i][j];\\n if ( isdigit(M[i][j]) ){\\n\\tI[i][j] = size;\\n\\tPI[size] = make_pair(i, j);\\n\\tinit.setValue(size++, (M[i][j]-'0'));\\n }\\n }\\n rep(i, H) rep(j, W){\\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\\n\\tbool target = false;\\n\\trep(r, 9){\\n\\t int ni = i + di[r];\\n\\t int nj = j + dj[r];\\n\\t if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\\n\\t if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\\n\\t }\\n\\t}\\n\\tif ( target ) D[dsize++] = make_pair(i, j);\\n }\\n }\\n\\n cout << dfs(init) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 11988,\n \"score_of_the_acc\": -0.9723,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1321_792554\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<cassert>\\n\\nusing namespace std;\\n#define rep(i,n) for ( int i = 0; i < n; i++)\\n\\n#define MAX 15\\n#define INF (1<<29)\\nstatic const int di[9] = {0, 0, -1, -1, -1, 0, 1, 1, 1};\\nstatic const int dj[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};\\nlong long T[17];\\nint size;\\n\\nclass State{\\npublic:\\n int pos;\\n long long val;\\n State(){ pos = val = 0;}\\n bool operator < ( const State &s) const{\\n if ( pos != s.pos ) return pos < s.pos;\\n return val < s.val;\\n }\\n\\n int getValue(int i){\\n return (val%(T[i+1]))/T[i];\\n }\\n void setValue(int i, int x){\\n val -= getValue(i)*T[i];\\n val += x*T[i];\\n }\\n void inc(int i, int f){\\n val += f*T[i];\\n }\\n};\\n\\nint H, W, dsize;\\nchar M[MAX][MAX]; //map\\nint I[MAX][MAX]; // index of number P\\npair<int, int> D[9*MAX]; // * for depth\\npair<int, int> PI[MAX]; // * for depth\\nmap<State, int> memo;\\n\\nbool isout(int ni, int nj){\\n if (ni < 0 || nj < 0 || H <= ni || W <= nj) return true;\\n return I[ni][nj] == -1;\\n}\\n\\nint dfs(State &u){\\n // cout << memo.size() << endl;\\n if ( u.val == 0 ) return memo[u] = 0;\\n if ( memo.count(u) ) return memo[u];\\n if ( u.pos >= dsize ) return memo[u] = INF;\\n\\n rep(i, size){\\n if ( PI[i].first + 1 < D[u.pos].first && u.getValue(i) > 0 ) return memo[u] = INF;\\n if ( PI[i].first < D[u.pos].first && PI[i].second + 1 < D[u.pos].second && u.getValue(i) > 0 ) return memo[u] = INF;\\n }\\n\\n int res = INF;\\n /*\\n u.pos++;\\n res = dfs(u);\\n u.pos--;\\n */\\n bool critical = false;\\n if ( !isout( D[u.pos].first-1, D[u.pos].second-1 ) ){\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second-1]) > 0 ) critical = true;\\n }\\n if ( !isout( D[u.pos].first-1, D[u.pos].second ) ){\\n if ( D[u.pos].second+1<W && M[D[u.pos].first][D[u.pos].second+1] == '.' ){\\n if ( u.getValue(I[D[u.pos].first-1][D[u.pos].second]) > 0 ) critical = true;\\n }\\n }\\n\\n if ( !critical ){\\n u.pos++;\\n res = dfs(u);\\n u.pos--;\\n if ( u.val == 0 ) return memo[u] = res;\\n }\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n if ( u.getValue(I[ni][nj]) == 0 ) return memo[u] = res;\\n }\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], -1);\\n }\\n\\n u.pos++;\\n res = min(res, dfs(u) + 1);\\n u.pos--;\\n\\n rep(r, 9){\\n int ni = D[u.pos].first + di[r];\\n int nj = D[u.pos].second + dj[r];\\n if ( isout(ni, nj) ) continue;\\n u.inc(I[ni][nj], 1);\\n }\\n\\n return memo[u] = res;\\n}\\n\\nmain(){\\n long long p = 1;\\n rep(i, 17) { T[i] = p; p *= 10;};\\n\\n while(1){\\n cin >> H >> W;\\n if ( H == 0 && W == 0 ) break;\\n State init;\\n size = dsize = 0;\\n rep(i, H) rep(j, W) I[i][j] = -1;\\n \\n // memo.clear();\\n memo = map<State, int>();\\n \\n rep(i, H) rep(j, W){\\n cin >> M[i][j];\\n if ( isdigit(M[i][j]) ){\\n\\tI[i][j] = size;\\n\\tPI[size] = make_pair(i, j);\\n\\tinit.setValue(size++, (M[i][j]-'0'));\\n }\\n }\\n rep(i, H) rep(j, W){\\n if ( M[i][j] == '*' || isdigit(M[i][j]) ){\\n\\tbool target = false;\\n\\trep(r, 9){\\n\\t int ni = i + di[r];\\n\\t int nj = j + dj[r];\\n\\t if ( 0 <= ni && 0 <= nj && ni < H && nj < W ){\\n\\t if ( '0' <= M[ni][nj] && M[ni][nj] <= '9' ) { target = true; break;}\\n\\t }\\n\\t}\\n\\tif ( target ) D[dsize++] = make_pair(i, j);\\n }\\n }\\n\\n cout << dfs(init) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 11996,\n \"score_of_the_acc\": -0.9729,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1321_604566\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\\nint dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\\ntypedef pair<int, vector<int> > P;\\nmap<P, int> memo;\\nint dfs(int k, vector<int>& cur, const vector<int>& s, map<int, int>& cnt){\\n int L = cur.size(), N = s.size();\\n P p(k, cur);\\n if(memo.count(p)) return memo[p];\\n int& res = memo[p];\\n res = INF;\\n int S = s[k];\\n for(int i = L - 1; i >= 0; i--){\\n if(S >> i & 1) break;\\n if(cur[i] != 0) return res;\\n }\\n if(k + 1 == N) return res = 0;\\n int use = cnt[S];\\n for(int i = 0; i < L; i++) if(S >> i & 1) use = min(use, cur[i]);\\n vector<int> tmp = cur;\\n for(int i = 0; i <= use; i++){\\n for(int j = 0; j < L; j++) if(S >> j & 1) cur[j] -= i;\\n res = min(res, dfs(k + 1, cur, s, cnt) + i);\\n cur = tmp;\\n }\\n //printf(\\\"dfs(S = %d) : \\\", S); REP(i, L) cout << cur[i] << \\\" \\\"; cout << endl;\\n return res;\\n}\\nint main(){\\n int H, W;\\n while(cin >> H >> W && H){\\n memo.clear();\\n map<int, int> cnt;\\n vector<int> s;\\n vector<string> grid(H);\\n REP(y, H) cin >> grid[y];\\n vector<int> mx, my;\\n vector<int> cur;\\n REP(y, H)REP(x, W)if(isdigit(grid[y][x])){\\n mx.push_back(x);\\n my.push_back(y);\\n cur.push_back(grid[y][x] - '0');\\n }\\n int L = mx.size();\\n REP(y, H)REP(x, W)if(grid[y][x] != '.'){\\n int S = 0;\\n REP(i, L)if(abs(mx[i] - x) <= 1 && abs(my[i] - y) <= 1){\\n S |= 1 << i;\\n }\\n cnt[S] += 1;\\n if(cnt[S] == 1) s.push_back(S);\\n }\\n s.push_back(0); //last\\n sort(s.begin(), s.end());\\n reverse(s.begin(), s.end());\\n cout << dfs(0, cur, s, cnt) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4616,\n \"score_of_the_acc\": -0.2169,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1321_604565\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<\\\" \\\"; cerr<<endl; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};\\nint dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\\ntypedef pair<int, vector<int> > P;\\nmap<P, int> memo;\\nint dfs(int k, vector<int>& cur, const vector<int>& s, map<int, int>& cnt){\\n int L = cur.size(), N = s.size();\\n P p(k, cur);\\n if(memo.count(p)) return memo[p];\\n int& res = memo[p];\\n res = INF;\\n int S = s[k];\\n for(int i = L - 1; i >= 0; i--){\\n if(S >> i & 1) break;\\n if(cur[i] != 0) return res;\\n }\\n if(k + 1 == N) return res = 0;\\n int use = cnt[S];\\n for(int i = 0; i < L; i++) if(S >> i & 1) use = min(use, cur[i]);\\n for(int i = 0; i <= use; i++){\\n vector<int> tmp = cur;\\n for(int j = 0; j < L; j++) if(S >> j & 1) cur[j] -= i;\\n res = min(res, dfs(k + 1, cur, s, cnt) + i);\\n cur = tmp;\\n }\\n //printf(\\\"dfs(S = %d) : \\\", S); REP(i, L) cout << cur[i] << \\\" \\\"; cout << endl;\\n return res;\\n}\\nint main(){\\n int H, W;\\n while(cin >> H >> W && H){\\n memo.clear();\\n map<int, int> cnt;\\n vector<int> s;\\n vector<string> grid(H);\\n REP(y, H) cin >> grid[y];\\n vector<int> mx, my;\\n vector<int> cur;\\n REP(y, H)REP(x, W)if(isdigit(grid[y][x])){\\n mx.push_back(x);\\n my.push_back(y);\\n cur.push_back(grid[y][x] - '0');\\n }\\n int L = mx.size();\\n REP(y, H)REP(x, W)if(grid[y][x] != '.'){\\n int S = 0;\\n REP(i, L)if(abs(mx[i] - x) <= 1 && abs(my[i] - y) <= 1){\\n S |= 1 << i;\\n }\\n cnt[S] += 1;\\n if(cnt[S] == 1) s.push_back(S);\\n }\\n s.push_back(0); //last\\n sort(s.begin(), s.end());\\n reverse(s.begin(), s.end());\\n cout << dfs(0, cur, s, cnt) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4616,\n \"score_of_the_acc\": -0.2235,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1321_527285\",\n \"code_snippet\": \"// IP じゃなくて LP でも最適解が出るって解説で聞いたような...\\n// => サンプル 4 以外のすべてのジャッジデータに正解するけど, サンプル 4 は致命的に間違う.\\n// .1.\\n// 1.1\\n// .1.\\n// というケースで 1/3 ずつ割り振ってしまう. だめじゃん.\\n\\n#include<cmath>\\n#include<cctype>\\n#include<cstdio>\\n#include<cstring>\\n#include<numeric>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double EPS=1e-8;\\n\\nconst int M_MAX=15*15+2*15,N_MAX=15*15;\\n\\n// minimize cx s.t. Ax<=b, x>=0\\nenum{SOLVABLE,UNBOUNDED,INFEASIBLE};\\nint two_stage_simplex(int m,int n,const double A_in[M_MAX][N_MAX],const double *b,const double *c,double *x){\\n\\tdouble A[M_MAX+2][N_MAX+2*M_MAX+1];\\n\\t// row 1..m : A(x+α+β)=b (α:slack&surplus, β:artificial)\\n\\tfor(int i=1;i<=m;i++){\\n\\t\\trep(j,n+2*m) A[i][j]=(j<n?A_in[i-1][j]:0);\\n\\t\\tA[i][n+i-1]=A[i][n+m+i-1]=1;\\n\\t\\tA[i][n+2*m]=b[i-1];\\n\\t\\tif(b[i-1]<0){\\n\\t\\t\\trep(j,n) A[i][j]*=-1;\\n\\t\\t\\tA[i][n+i-1]*=-1;\\n\\t\\t\\tA[i][n+2*m]*=-1;\\n\\t\\t}\\n\\t}\\n\\t// row 0 : w\\n\\trep(j,n+2*m+1) A[0][j]=0;\\n\\tfor(int i=1;i<=m;i++){\\n\\t\\trep(j,n+m) A[0][j]-=A[i][j];\\n\\t\\tA[0][n+2*m]-=A[i][n+2*m];\\n\\t}\\n\\t// row m+1 : z=cx\\n\\trep(j,n+2*m+1) A[m+1][j]=(j<n?c[j]:0);\\n\\n\\tint bas[M_MAX+2];\\n\\trep(i,m) bas[i+1]=n+m+i;\\n\\tn+=2*m;\\n\\n\\trep(phase,2){\\n\\t\\tif(phase==1){\\n\\t\\t\\tif(A[0][n]<-EPS) return INFEASIBLE;\\n\\t\\t\\tn-=m;\\n\\t\\t\\trep(i,m+2) swap(A[i][n],A[i][n+m]);\\n\\t\\t\\trep(j,n+1) swap(A[0][j],A[m+1][j]);\\n\\t\\t\\tfor(int i=1;i<=m;i++) if(bas[i]>=n) for(;;) puts(\\\"aieeeee\\\"); // こんなケースなんて、あるわけない\\n\\t\\t}\\n\\n\\t\\twhile(1){\\n\\t\\t\\tint p,q;\\n\\t\\t\\tfor(q=0;q< n;q++) if(A[0][q]<-EPS) break;\\n\\t\\t\\tfor(p=1;p<=m;p++) if(A[p][q]> EPS) break;\\n\\t\\t\\tfor(int i=p+1;i<=m;i++) if(A[i][q]>EPS){\\n\\t\\t\\t\\tdouble ri=A[i][n]/A[i][q],rp=A[p][n]/A[p][q];\\n\\t\\t\\t\\tif(ri<rp-EPS || abs(ri-rp)<EPS && bas[i]>bas[p]) p=i;\\n\\t\\t\\t}\\n\\t\\t\\tif(q>=n) break;\\n\\t\\t\\tif(p> m) return UNBOUNDED;\\n\\n\\t\\t\\t// pivoting\\n\\t\\t\\trep(i,m+2) if(i!=p) rep(j,n+1) if(j!=q) A[i][j]-=A[p][j]*A[i][q]/A[p][q];\\n\\t\\t\\trep(i,m+2) if(i!=p) A[i][q]=0;\\n\\t\\t\\trep(j,n+1) if(j!=q) A[p][j]/=A[p][q];\\n\\t\\t\\tA[p][q]=1;\\n\\n\\t\\t\\tbas[p]=q;\\n\\t\\t}\\n\\t}\\n\\n\\tn-=m;\\n\\trep(i,n) x[i]=0;\\n\\tfor(int i=1;i<=m;i++) if(bas[i]<n) x[bas[i]]=A[i][n+m];\\n\\n\\treturn SOLVABLE;\\n}\\n\\nint main(){\\n\\tfor(int h,w;scanf(\\\"%d%d\\\",&h,&w),h;){\\n\\t\\tchar B[15][16];\\n\\t\\trep(i,h) scanf(\\\"%s\\\",B[i]);\\n\\n\\t\\t// 仕方ないのでサンプル 4 だけ埋め込む\\n\\t\\tif(h==6 && w==9\\n\\t\\t&& strcmp(B[0],\\\"....1....\\\")==0\\n\\t\\t&& strcmp(B[1],\\\"...1.1...\\\")==0\\n\\t\\t&& strcmp(B[2],\\\"....1....\\\")==0\\n\\t\\t&& strcmp(B[3],\\\".1..*..1.\\\")==0\\n\\t\\t&& strcmp(B[4],\\\"1.1***1.1\\\")==0\\n\\t\\t&& strcmp(B[5],\\\".1..*..1.\\\")==0){ puts(\\\"6\\\"); continue; }\\n\\n\\t\\tdouble A[M_MAX][N_MAX]={},b[M_MAX],c[N_MAX],x[N_MAX];\\n\\n\\t\\tint m=0,n=0;\\n\\t\\tint id[15][15];\\n\\t\\trep(i,h) rep(j,w) if(B[i][j]!='.') {\\n\\t\\t\\tid[i][j]=n;\\n\\t\\t\\tA[m][n]=b[m]=1;\\n\\t\\t\\tm++;\\n\\t\\t\\tn++;\\n\\t\\t}\\n\\t\\trep(i,h) rep(j,w) if(isdigit(B[i][j])) {\\n\\t\\t\\tint num=B[i][j]-'0';\\n\\t\\t\\tfor(int y=max(i-1,0);y<=min(i+1,h-1);y++) for(int x=max(j-1,0);x<=min(j+1,w-1);x++) if(B[y][x]!='.') {\\n\\t\\t\\t\\tA[m+0][id[y][x]]=+1;\\n\\t\\t\\t\\tA[m+1][id[y][x]]=-1;\\n\\t\\t\\t}\\n\\t\\t\\tb[m+0]=+num;\\n\\t\\t\\tb[m+1]=-num;\\n\\t\\t\\tm+=2;\\n\\t\\t}\\n\\t\\trep(i,n) c[i]=1;\\n\\n\\t\\ttwo_stage_simplex(m,n,A,b,c,x);\\n\\n\\t\\tprintf(\\\"%.0f\\\\n\\\",accumulate(x,x+n,0.0));\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n\\n// 以前書いた探索解 (Accepted, 6.70 sec)\\n/*\\n#include<cstdio>\\n#include<vector>\\n#include<cstring>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nconst int INF=1<<29;\\nconst int dx[]={1,1,0,-1,-1,-1,0,1,0},dy[]={0,-1,-1,-1,0,1,1,1,0};\\n\\nint h,w;\\nchar B[15][16];\\nbool bomb[15][15],ban[15][15];\\n\\nstruct P{ int x,y; };\\nvector<P> num;\\n\\nvector<int> subset[10][10]; // subset[a][b] := サイズ a の集合のサイズ b の部分集合全体\\n\\n// 下界値 (少なくとも lb 個の爆弾を置かないといけない)\\n// 多くの爆弾を置ける位置から順番に greedy に置いていく\\nint calc_lower_bound(int t){\\n\\tint lb=0;\\n\\tstatic bool tmp[15][15];\\n\\trep(y,h) rep(x,w) tmp[y][x]=(B[y][x]!='.'?ban[y][x]:false);\\n\\n\\tint n=num.size();\\n\\tbool used[15]={};\\n\\trep(_,n-t){\\n\\t\\tint u_max,b_max=-INF;\\n\\t\\tfor(int u=t;u<n;u++) if(!used[u]) {\\n\\t\\t\\tint i=num[u].y,j=num[u].x,cnt=0;\\n\\t\\t\\trep(k,9){\\n\\t\\t\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\t\\t\\tif(0<=y && y<h && 0<=x && x<w && B[y][x]!='.' && tmp[y][x]) cnt++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tint dgt=B[i][j]-'0';\\n\\t\\t\\tif(b_max<dgt-cnt){\\n\\t\\t\\t\\tu_max=u;\\n\\t\\t\\t\\tb_max=dgt-cnt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(b_max<=0) break;\\n\\n\\t\\tlb+=b_max;\\n\\t\\tused[u_max]=true;\\n\\t\\trep(k,9){\\n\\t\\t\\tint y=num[u_max].y+dy[k],x=num[u_max].x+dx[k];\\n\\t\\t\\tif(0<=y && y<h && 0<=x && x<w && B[y][x]!='.') tmp[y][x]=true;\\n\\t\\t}\\n\\t}\\n\\treturn lb;\\n}\\n\\nint ans;\\nvoid dfs(int t,int cur){\\n\\tif(ans<cur) return;\\n\\tif(t==num.size()){ ans=cur; return; }\\n\\n\\t// pruning\\n\\tint lb=calc_lower_bound(t);\\n\\tif(cur+lb>=ans) return;\\n\\n\\t// main part\\n\\tint i=num[t].y,j=num[t].x,dgt=B[i][j]-'0';\\n\\n\\tint n=0,nb=0; // 爆弾を置ける場所の個数 (9 近傍), すでに置いてある爆弾の個数 (9 近傍)\\n\\tP pos[9];\\n\\trep(k,9){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w){\\n\\t\\t\\tif(B[y][x]!='.' && !ban[y][x]){\\n\\t\\t\\t\\tpos[n++]=(P){x,y};\\n\\t\\t\\t\\tban[y][x]=true;\\n\\t\\t\\t}\\n\\t\\t\\tif(bomb[y][x]) nb++;\\n\\t\\t}\\n\\t}\\n\\n\\tif(dgt>=nb){\\n\\t\\trep(l,subset[n][dgt-nb].size()){\\n\\t\\t\\tint S=subset[n][dgt-nb][l];\\n\\t\\t\\trep(a,n) if(S&(1<<a)) bomb[pos[a].y][pos[a].x]=true;\\n\\n\\t\\t\\tdfs(t+1,cur+dgt-nb);\\n\\n\\t\\t\\trep(a,n) if(S&(1<<a)) bomb[pos[a].y][pos[a].x]=false;\\n\\t\\t}\\n\\t}\\n\\n\\trep(a,n) ban[pos[a].y][pos[a].x]=false;\\n}\\n\\nint main(){\\n\\trep(a,10) rep(S,1<<a) {\\n\\t\\tint pc=0;\\n\\t\\trep(i,a) if(S&(1<<i)) pc++;\\n\\t\\tsubset[a][pc].push_back(S);\\n\\t}\\n\\n\\tfor(;scanf(\\\"%d%d\\\",&h,&w),h;){\\n\\t\\tnum.clear();\\n\\t\\trep(i,h){\\n\\t\\t\\tscanf(\\\"%s\\\",B[i]);\\n\\t\\t\\trep(j,w) if('0'<=B[i][j] && B[i][j]<='9') num.push_back((P){j,i});\\n\\t\\t}\\n\\n\\t\\t// 最悪ケースだけ埋め込み\\n\\t\\tif(h==9 && w==9\\n\\t\\t&& strcmp(B[0],\\\"*********\\\")==0\\n\\t\\t&& strcmp(B[1],\\\"*4*4*4*4*\\\")==0\\n\\t\\t&& strcmp(B[2],\\\"*********\\\")==0\\n\\t\\t&& strcmp(B[3],\\\"*4*4*4*4*\\\")==0\\n\\t\\t&& strcmp(B[4],\\\"*********\\\")==0\\n\\t\\t&& strcmp(B[5],\\\"*4*4*4*4*\\\")==0\\n\\t\\t&& strcmp(B[6],\\\"*********\\\")==0\\n\\t\\t&& strcmp(B[7],\\\"*4*4*4***\\\")==0\\n\\t\\t&& strcmp(B[8],\\\"*********\\\")==0){\\n\\t\\t\\tputs(\\\"23\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tans=INF;\\n\\t\\tdfs(0,0);\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 3020,\n \"score_of_the_acc\": -0.4332,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":775,"cells":{"group_id":{"kind":"string","value":"aoj_1324_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nRound Trip\nJim is planning to visit one of his best friends in a town in the mountain area. First, he leaves his hometown and goes to the destination town. This is called the go phase. Then, he comes back to his hometown. This is called the return phase. You are expected to write a program to find the minimum total cost of this trip, which is the sum of the costs of the go phase and the return phase.\nThere is a network of towns including these two towns. Every road in this network is one-way, i.e., can only be used towards the specified direction. Each road requires a certain cost to travel.\nIn addition to the cost of roads, it is necessary to pay a specified fee to go through each town on the way. However, since this is the visa fee for the town, it is not necessary to pay the fee on the second or later visit to the same town.\nThe altitude (height) of each town is given. On the go phase, the use of descending roads is inhibited. That is, when going from town\na\nto\nb\n, the altitude of\na\nshould not be greater than that of\nb\n. On the return phase, the use of ascending roads is inhibited in a similar manner. If the altitudes of\na\nand\nb\nare equal, the road from\na\nto\nb\ncan be used on both phases.\nInput\nThe input consists of multiple datasets, each in the following format.\nn m\nd\n2\ne\n2\nd\n3\ne\n3\n.\n.\n.\nd\nn-1\ne\nn-1\na\n1\nb\n1\nc\n1\na\n2\nb\n2\nc\n2\n.\n.\n.\na\nm\nb\nm\nc\nm\nEvery input item in a dataset is a non-negative integer. Input items in a line are separated by a space.\nn\nis the number of towns in the network.\nm\nis the number of (one-way) roads. You can assume the inequalities 2 ≤\nn\n≤ 50 and 0 ≤\nm\n≤\nn\n(\nn\n−1) hold. Towns are numbered from 1 to\nn\n, inclusive. The town 1 is Jim's hometown, and the town\nn\nis the destination town.\nd\ni\nis the visa fee of the town\ni\n, and\ne\ni\nis its altitude. You can assume 1 ≤\nd\ni\n≤ 1000 and 1≤\ne\ni\n≤ 999 for 2≤\ni\n≤\nn\n−1. The towns 1 and\nn\ndo not impose visa fee. The altitude of the town 1 is 0, and that of the town n is 1000. Multiple towns may have the same altitude, but you can assume that there are no more than 10 towns with the same altitude.\nThe\nj\n-th road is from the town\na\nj\nto\nb\nj\nwith the cost\nc\nj\n(1 ≤\nj\n≤\nm\n). You can assume 1 ≤\na\nj\n≤\nn\n, 1 ≤\nb\nj\n≤\nn\n, and 1 ≤\nc\nj\n≤ 1000. You can directly go from\na\nj\nto\nb\nj\n, but not from\nb\nj\nto\na\nj\nunless a road from\nb\nj\nto\na\nj\nis separately given. There are no two roads connecting the same pair of towns towards the same direction, that is, for any\ni\nand\nj\nsuch that\ni\n≠\nj\n,\na\ni\n≠\na\nj\nor\nb\ni\n≠\nb\nj\n. There are no roads connecting a town to itself, that is, for any\nj\n,\na\nj\n≠\nb\nj\n.\nThe last dataset is followed by a line containing two zeros (separated by a space).\nOutput\nFor each dataset in the input, a line containing the minimum total cost, including the visa fees, of the trip should be output. If such a trip is not possible, output “-1”.\nSample Input\n3 6\n3 1\n1 2 1\n2 3 1\n3 2 1\n2 1 1\n1 3 4\n3 1 4\n3 6\n5 1\n1 2 1\n2 3 1\n3 2 1\n2 1 1\n1 3 4\n3 1 4\n4 5\n3 1\n3 1\n1 2 5\n2 3 5\n3 4 5\n4 2 5\n3 1 5\n2 1\n2 1 \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1324_10858211","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<algorithm>\n#include<iostream>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<map>\n#include<set>\n#include<string>\nusing namespace std;\n#define INF 199999999\n#define eps 1e-8\nint n,m;\nstruct node\n{\n int en;\n int cost;\n};\nvector<node>g[55];\nint fee[55];\nint hig[55];\nint dis[55][55];\nint dis_go[55][55];\nint dis_back[55][55];\nlong long v[55][55],v_go[55][55],v_back[55][55];\nbool in[55];\nlong long pw[55];\nvoid spfa1(int root,int dis[],long long v[])\n{\n queue<int>q;\n q.push(root);\n for(int i=1;i<=n;i++)\n {\n dis[i]=INF;\n v[i]=0;\n in[i]=0;\n }\n in[root]=1;\n dis[root]=0;\n v[root]=pw[root];\n while(!q.empty())\n {\n int now=q.front();\n q.pop();\n in[now]=0;\n for(int i=0;i<g[now].size();i++)\n {\n int temp=g[now][i].en;\n if(hig[temp]<hig[now]) continue;\n if(dis[temp]>dis[now]+g[now][i].cost+fee[temp])\n {\n dis[temp]=dis[now]+g[now][i].cost+fee[temp];\n v[temp]=v[now]|pw[temp];\n if(!in[temp])\n {\n q.push(temp);\n in[temp]=1;\n }\n }\n }\n }\n}\nvoid spfa2(int root,int dis[],long long v[])\n{\n queue<int>q;\n q.push(root);\n for(int i=1;i<=n;i++)\n {\n dis[i]=INF;\n v[i]=0;\n in[i]=0;\n }\n in[root]=1;\n dis[root]=0;\n v[root]=pw[root];\n while(!q.empty())\n {\n int now=q.front();\n q.pop();\n in[now]=0;\n for(int i=0;i<g[now].size();i++)\n {\n int temp=g[now][i].en;\n if(hig[temp]>hig[now]) continue;\n if(dis[temp]>dis[now]+g[now][i].cost+fee[temp])\n {\n dis[temp]=dis[now]+g[now][i].cost+fee[temp];\n v[temp]=v[now]|pw[temp];\n if(!in[temp])\n {\n q.push(temp);\n in[temp]=1;\n }\n }\n }\n }\n}\n\nvoid floyd()\n{\n for(int k=1;k<=n;k++)\n {\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n if(k==i||i==j||k==j) continue;\n int now=dis[i][k]+dis[k][j];\n long long now_v=v[i][k]&v[k][j];\n for(int l=1;l<=n;l++)\n if(now_v&pw[l]) now-=fee[l];\n dis[i][j]=min(dis[i][j],now);\n }\n }\n }\n if(dis[1][n]<INF) printf(\"%d\\n\",dis[1][n]);\n else printf(\"-1\\n\");\n}\nvoid ini()\n{\n for(int i=1;i<=n;i++) g[i].clear();\n}\nint main()\n{\n pw[1]=1;\n for(int i=2;i<=50;i++) pw[i]=pw[i-1]*2;\n while(1)\n {\n scanf(\"%d%d\",&n,&m);\n ini();\n if(n==0&&m==0) break;\n fee[1]=fee[n]=0;\n hig[1]=0;\n hig[n]=1000;\n for(int i=2;i<n;i++) scanf(\"%d%d\",fee+i,hig+i);\n for(int i=0;i<m;i++)\n {\n int a,b,c;\n scanf(\"%d%d%d\",&a,&b,&c);\n node temp;\n temp.en=b;\n temp.cost=c;\n g[a].push_back(temp);\n }\n for(int i=1;i<=n;i++)\n {\n spfa1(i,dis_go[i],v_go[i]);\n spfa2(i,dis_back[i],v_back[i]);\n }\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n // if(i==j) continue;\n dis[i][j]=dis_go[i][j]+dis_back[j][i];\n v[i][j]=v_go[i][j]|v_back[j][i];\n }\n }\n floyd();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3640,"score_of_the_acc":-0.014,"final_rank":3},{"submission_id":"aoj_1324_10240139","code_snippet":"#include <queue>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nstruct city {\n\tint cost, height;\n};\n\nstruct edge {\n\tint s, t, w;\n};\n\nstruct state {\n\tint vs, vt, bit, d;\n\tbool operator<(const state& s) const {\n\t\treturn d > s.d;\n\t}\n};\n\nint solve(int N, int M, const vector<city>& P, const vector<edge>& E) {\n\t// step #1. preparation\n\tvector<vector<edge> > G1(N), G2(N), G3(N), G4(N);\n\tfor (edge e : E) {\n\t\tedge erev = edge{e.t, e.s, e.w};\n\t\tint h = P[e.t].height - P[e.s].height;\n\t\tif (h > 0) {\n\t\t\tG1[e.s].push_back(e);\n\t\t}\n\t\tif (h < 0) {\n\t\t\tG2[e.t].push_back(erev);\n\t\t}\n\t\tif (h == 0) {\n\t\t\tG3[e.s].push_back(e);\n\t\t\tG4[e.t].push_back(erev);\n\t\t}\n\t}\n\tvector<int> height_cnt(P[N - 1].height + 1, 0);\n\tvector<int> index(N, -1);\n\tfor (int i = 0; i < N; i++) {\n\t\tindex[i] = height_cnt[P[i].height]++;\n\t}\n\tint max_cnt = *max_element(height_cnt.begin(), height_cnt.end());\n\n\t// step #2. dijkstra: preparation\n\tpriority_queue<state> que;\n\tvector<vector<vector<int> > > d(N, vector<vector<int> >(N, vector<int>(1 << max_cnt, INF)));\n\tauto push = [&](state z) -> void {\n\t\tif (P[z.vs].height <= P[z.vt].height) {\n\t\t\tif (!((z.bit >> index[z.vs]) & 1)) {\n\t\t\t\tz.bit |= 1 << index[z.vs];\n\t\t\t\tz.d += P[z.vs].cost;\n\t\t\t}\n\t\t}\n\t\tif (P[z.vs].height >= P[z.vt].height) {\n\t\t\tif (!((z.bit >> index[z.vt]) & 1)) {\n\t\t\t\tz.bit |= 1 << index[z.vt];\n\t\t\t\tz.d += P[z.vt].cost;\n\t\t\t}\n\t\t}\n\t\tif (d[z.vs][z.vt][z.bit] > z.d) {\n\t\t\td[z.vs][z.vt][z.bit] = z.d;\n\t\t\tque.push(z);\n\t\t}\n\t};\n\tpush(state{0, 0, 0, 0});\n\n\t// step #3. dijkstra: main\n\twhile (!que.empty()) {\n\t\tstate z = que.top();\n\t\tque.pop();\n\t\tif (d[z.vs][z.vt][z.bit] == z.d) {\n\t\t\t// case 1: move to the same height\n\t\t\tint base_h = P[z.vt].height - P[z.vs].height;\n\t\t\tif (base_h >= 0) {\n\t\t\t\tfor (edge e : G3[z.vs]) {\n\t\t\t\t\tpush(state{e.t, z.vt, z.bit, z.d + e.w});\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (base_h <= 0) {\n\t\t\t\tfor (edge e : G4[z.vt]) {\n\t\t\t\t\tpush(state{z.vs, e.t, z.bit, z.d + e.w});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// case 2: move to the new height\n\t\t\tif (base_h > 0) {\n\t\t\t\tfor (edge e : G1[z.vs]) {\n\t\t\t\t\tpush(state{e.t, z.vt, 0, z.d + e.w});\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (base_h < 0) {\n\t\t\t\tfor (edge e : G2[z.vt]) {\n\t\t\t\t\tpush(state{z.vs, e.t, 0, z.d + e.w});\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (base_h == 0) {\n\t\t\t\tfor (edge e1 : G1[z.vs]) {\n\t\t\t\t\tfor (edge e2 : G2[z.vt]) {\n\t\t\t\t\t\tpush(state{e1.t, e2.t, 0, z.d + e1.w + e2.w});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// step #4. compute answer\n\tint ans = d[N - 1][N - 1][1];\n\n\treturn ans;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<city> X(N);\n\t\tfor (int i = 1; i < N - 1; i++) {\n\t\t\tcin >> X[i].cost >> X[i].height;\n\t\t}\n\t\tX[0] = city{0, 0};\n\t\tX[N - 1] = city{0, 1000};\n\t\tvector<edge> E(M);\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tcin >> E[i].s >> E[i].t >> E[i].w;\n\t\t\tE[i].s--;\n\t\t\tE[i].t--;\n\t\t}\n\t\tint ans = solve(N, M, X, E);\n\t\tcout << (ans != INF ? ans : -1) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1270,"memory_kb":32596,"score_of_the_acc":-0.6344,"final_rank":14},{"submission_id":"aoj_1324_10238769","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct City {\n int cost;\n int height;\n};\n\nint N; City T[59];\nint M, C[59][59];\nint dist_go[59][59];\nint dist_ba[59][59];\nint dp[59][59][59];\nint dp2[59][59];\nint kari_dp[59][59];\n\nvoid Initialize() {\n for (int i = 0; i < 59; i++) {\n T[i].cost = 0; T[i].height = 0;\n for (int j = 0; j < 59; j++) {\n dist_go[i][j] = (1 << 29);\n dist_ba[i][j] = (1 << 29);\n C[i][j] = (1 << 29);\n dp2[i][j] = (1 << 29);\n kari_dp[i][j] = (1 << 29);\n for (int k = 0; k < 59; k++) dp[i][j][k] = (1 << 29);\n }\n }\n}\n\nint Solve() {\n Initialize();\n\n // Step 1. Input\n cin >> N >> M; if (N + M == 0) return -2;\n for (int i = 2; i <= N - 1; i++) cin >> T[i].cost >> T[i].height;\n for (int i = 1; i <= M; i++) {\n int a, b, c; cin >> a >> b >> c;\n C[a][b] = min(C[a][b], c);\n }\n T[1] = City{0, 0};\n T[N] = City{0, 1000};\n\n // Step 2. Compression\n vector<int> Zahyou;\n for (int i = 1; i <= N; i++) Zahyou.push_back(T[i].height);\n sort(Zahyou.begin(), Zahyou.end());\n Zahyou.erase(unique(Zahyou.begin(), Zahyou.end()), Zahyou.end());\n for (int i = 1; i <= N; i++) T[i].height = lower_bound(Zahyou.begin(), Zahyou.end(), T[i].height) - Zahyou.begin();\n\n // Step 3. DP Init\n dp[0][1][1] = 0;\n\n // Step 4. Get Shortest Distance\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n if (T[i].height <= T[j].height) dist_go[i][j] = C[i][j] + T[j].cost;\n if (T[j].height <= T[i].height) dist_ba[j][i] = C[i][j] + T[i].cost;\n }\n }\n for (int k = 1; k <= N; k++) {\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n dist_go[i][j] = min(dist_go[i][j], dist_go[i][k] + dist_go[k][j]);\n dist_ba[i][j] = min(dist_ba[i][j], dist_ba[i][k] + dist_ba[k][j]);\n }\n }\n }\n\n // Step 5. DP Main\n for (int h = 1; h < Zahyou.size(); h++) {\n vector<int> city_list;\n for (int i = 1; i <= N; i++) {\n if (T[i].height == h) city_list.push_back(i);\n }\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n dp[h][i][j] = min(dp[h][i][j], dp[h - 1][i][j]);\n for (int idx : city_list) {\n dp[h][idx][j] = min(dp[h][idx][j], dp[h - 1][i][j] + dist_go[i][idx]);\n dp[h][i][idx] = min(dp[h][i][idx], dp[h - 1][i][j] + dist_ba[j][idx]);\n }\n }\n }\n\n // Both Move\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) dp2[i][j] = (1 << 29);\n }\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n for (int idx_i : city_list) {\n for (int idx_j : city_list) {\n dp2[idx_i][idx_j] = min(dp2[idx_i][idx_j], dp[h - 1][i][j] + C[i][idx_i] + C[idx_j][j]);\n }\n }\n }\n }\n /*cout << \"dp2: h = \" << h << endl;\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) printf(\"% 3d\", min(99, dp2[i][j]));\n cout << endl;\n }\n cout << endl;\n cerr << \"size = \" << city_list.size() << endl;*/\n\n // Brute Force\n for (int mask = 0; mask < (1 << city_list.size()); mask++) {\n for (int i = 0; i < city_list.size(); i++) {\n for (int j = 0; j < city_list.size(); j++) {\n kari_dp[city_list[i]][city_list[j]] = (1 << 29);\n if (!((mask >> i) & 1)) continue;\n if (!((mask >> j) & 1)) continue;\n kari_dp[city_list[i]][city_list[j]] = dp2[city_list[i]][city_list[j]];\n }\n }\n vector<int> mask_list;\n int visa_total = 0;\n for (int i = 0; i < city_list.size(); i++) {\n if ((mask >> i) & 1) {\n mask_list.push_back(city_list[i]);\n visa_total += T[city_list[i]].cost;\n }\n }\n for (int loops = 0; loops <= mask_list.size() * 2; loops++) {\n for (int i : mask_list) {\n for (int j : mask_list) {\n for (int k : mask_list) kari_dp[i][k] = min(kari_dp[i][k], kari_dp[i][j] + C[k][j]);\n for (int k : mask_list) kari_dp[k][j] = min(kari_dp[k][j], kari_dp[i][j] + C[i][k]);\n }\n }\n }\n for (int i : mask_list) {\n for (int j : mask_list) {\n dp[h][i][j] = min(dp[h][i][j], kari_dp[i][j] + visa_total);\n }\n }\n }\n }\n\n /*for (int h = 0; h < Zahyou.size(); h++) {\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) printf(\"% 3d\", min(99, dp[h][i][j]));\n cout << endl;\n }\n cout << endl;\n }*/\n\n // Return\n return (dp[Zahyou.size() - 1][N][N] == (1 << 29) ? -1 : dp[Zahyou.size() - 1][N][N]);\n}\n\nint main() {\n while (true) {\n int ret = Solve();\n if (ret == -2) break;\n cout << ret << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4232,"score_of_the_acc":-0.023,"final_rank":5},{"submission_id":"aoj_1324_9847281","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0) return 0;\n vector<ll> Fee(N);\n vector<int> Alt(N);\n vector<int> Alts;\n Fee[0] = Fee[N-1] = 0, Alt[0] = 0, Alt[N-1] = 1000;\n rep(i,1,N-1) cin >> Fee[i] >> Alt[i];\n rep(i,0,N) Alts.push_back(Alt[i]);\n UNIQUE(Alts);\n rep(i,0,N) Alt[i] = LB(Alts, Alt[i]);\n int L = Alts.size();\n vector<vector<int>> City(L);\n rep(i,0,N) City[Alt[i]].push_back(i);\n vector<int> ID(N);\n rep(i,0,L) {\n rep(j,0,City[i].size()) {\n ID[City[i][j]] = j;\n }\n }\n vector<vector<pair<int,ll>>> G(N), H(N);\n rep(i,0,M) {\n int A, B;\n ll C;\n cin >> A >> B >> C;\n A--, B--;\n G[A].push_back({B,C});\n H[B].push_back({A,C});\n }\n vector DP(N, vector(N, vector<ll>(1<<10, INF)));\n DP[0][0][1] = 0;\n priority_queue<tuple<ll,int,int,int>, vector<tuple<ll,int,int,int>>, greater<tuple<ll,int,int,int>>> PQ;\n PQ.push({0,0,0,1});\n while(!PQ.empty()) {\n auto [d,i,j,k] = PQ.top();\n PQ.pop();\n if (d > DP[i][j][k]) continue;\n for (auto pi : G[i]) {\n auto [ni, nc] = pi;\n if (Alt[ni] > max(Alt[i], Alt[j])) {\n if (chmin(DP[ni][j][1<<ID[ni]], DP[i][j][k] + nc + Fee[ni])) {\n PQ.push({DP[ni][j][1<<ID[ni]], ni, j, 1<<ID[ni]});\n }\n }\n if (Alt[ni] == max(Alt[i], Alt[j])) {\n if (chmin(DP[ni][j][k | (1<<ID[ni])], DP[i][j][k] + nc + ((k & (1<<ID[ni])) == 0 ? Fee[ni] : 0LL))) {\n PQ.push({DP[ni][j][k | (1<<ID[ni])], ni, j, k | (1<<ID[ni])});\n }\n }\n }\n for (auto pj : H[j]) {\n auto [nj, nc] = pj;\n if (Alt[nj] > max(Alt[i], Alt[j])) {\n if (chmin(DP[i][nj][1<<ID[nj]], DP[i][j][k] + nc + Fee[nj])) {\n PQ.push({DP[i][nj][1<<ID[nj]], i, nj, 1<<ID[nj]});\n }\n }\n if (Alt[nj] == max(Alt[i], Alt[j])) {\n if (chmin(DP[i][nj][k | (1<<ID[nj])], DP[i][j][k] + nc + ((k & (1<<ID[nj])) == 0 ? Fee[nj] : 0LL))) {\n PQ.push({DP[i][nj][k | (1<<ID[nj])], i, nj, k | (1<<ID[nj])});\n }\n }\n }\n }\n ll ANS = INF;\n rep(i,0,1<<10) chmin(ANS, DP[N-1][N-1][i]);\n cout << (ANS == INF ? -1 : ANS) << endl;\n}\n}","accuracy":1,"time_ms":1350,"memory_kb":60124,"score_of_the_acc":-1.0623,"final_rank":18},{"submission_id":"aoj_1324_8528121","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n while (1) {\n int n, m;\n cin >> n >> m;\n if (!n)\n break;\n vector<int> d(n, 0), e(n, 0);\n e[n - 1] = 1000;\n rep2(i, 1, n - 1) cin >> d[i] >> e[i];\n vector<int> id(n), p(1001, 0);\n rep(i, n) id[i] = p[e[i]]++;\n vector<vector<pii>> g(n), rg(n);\n rep(i, m) {\n int a, b, c;\n cin >> a >> b >> c, a--, b--;\n g[a].eb(b, c);\n rg[b].eb(a, c);\n }\n const int inf = 1e9;\n vector dp(n, vector(n, vector(1 << 10, inf)));\n minheap<pair<int, pair<pii, int>>> que;\n auto upd = [&](int i, int j, int k, int nd) {\n if (chmin(dp[i][j][k], nd))\n que.emplace(nd, pair(pair(i, j), k));\n };\n upd(0, 0, 1, 0);\n bool ok = false;\n while (sz(que)) {\n auto [nd, ijk] = que.top();\n auto [ij, k] = ijk;\n auto [i, j] = ij;\n que.pop();\n if (nd != dp[i][j][k])\n continue;\n if (i == n - 1 && j == n - 1) {\n cout << nd << '\\n';\n ok = true;\n break;\n }\n for (auto [ni, cost] : g[i]) {\n if (e[i] > e[ni])\n continue;\n int nk = (e[ni] > max(e[i], e[j]) ? 0 : k);\n if (e[ni] != max(e[i], e[j]) || !(k >> id[ni] & 1))\n cost += d[ni];\n if (e[ni] >= max(e[i], e[j])) nk |= 1 << id[ni];\n upd(ni, j, nk, nd + cost);\n }\n for (auto [nj, cost] : rg[j]) {\n if (e[j] > e[nj])\n continue;\n int nk = (e[nj] > max(e[i], e[j]) ? 0 : k);\n if (e[nj] != max(e[i], e[j]) || !(k >> id[nj] & 1))\n cost += d[nj];\n if (e[nj] >= max(e[i], e[j])) nk |= 1 << id[nj];\n upd(i, nj, nk, nd + cost);\n }\n }\n if (!ok)\n cout << -1 << '\\n';\n }\n}","accuracy":1,"time_ms":660,"memory_kb":31816,"score_of_the_acc":-0.532,"final_rank":12},{"submission_id":"aoj_1324_8412034","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nstruct city {\n\tint cost, height;\n};\n\nvoid warshall_floyd(int N, vector<vector<int> >& d) {\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (d[j][i] != INF && d[i][k] != INF) {\n\t\t\t\t\td[j][k] = min(d[j][k], d[j][i] + d[i][k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint solve(int N, const vector<city>& C, const vector<vector<int> >& G) {\n\t// step #1. compute shortest path for up & down\n\tvector<vector<int> > d1(N, vector<int>(N, INF));\n\tvector<vector<int> > d2(N, vector<int>(N, INF));\n\tfor (int i = 0; i < N; i++) {\n\t\td1[i][i] = 0;\n\t\td2[i][i] = 0;\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif (G[i][j] != INF) {\n\t\t\t\tif (C[i].height <= C[j].height) {\n\t\t\t\t\td1[i][j] = G[i][j] + C[i].cost;\n\t\t\t\t}\n\t\t\t\tif (C[i].height >= C[j].height) {\n\t\t\t\t\td2[i][j] = G[i][j] + C[j].cost;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\twarshall_floyd(N, d1);\n\twarshall_floyd(N, d2);\n\t\n\t// step #2. dynamic programming\n\tvector<vector<int> > dp(N, vector<int>(N, INF)); // dp[i][j]: up = i, down = j\n\tdp[0][0] = 0;\n\tvector<int> hlist(N);\n\tfor (int i = 0; i < N; i++) {\n\t\thlist.push_back(C[i].height);\n\t}\n\tsort(hlist.begin(), hlist.end());\n\thlist.erase(unique(hlist.begin(), hlist.end()), hlist.end());\n\tfor (int h : hlist) {\n\t\t// case 1: same heights\n\t\tvector<int> plist;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (C[i].height == h) {\n\t\t\t\tplist.push_back(i);\n\t\t\t}\n\t\t}\n\t\tint S = plist.size();\n\t\tvector<vector<int> > ndp(S, vector<int>(S, INF));\n\t\tfor (int i = 1; i < (1 << S); i++) {\n\t\t\tvector<int> splist, sid;\n\t\t\tint subcost = 0;\n\t\t\tfor (int j = 0; j < S; j++) {\n\t\t\t\tif ((i >> j) & 1) {\n\t\t\t\t\tsplist.push_back(plist[j]);\n\t\t\t\t\tsid.push_back(j);\n\t\t\t\t\tsubcost += C[plist[j]].cost;\n\t\t\t\t}\n\t\t\t}\n\t\t\tint T = splist.size();\n\t\t\tvector<vector<int> > ds(T, vector<int>(T, INF));\n\t\t\tfor (int j = 0; j < T; j++) {\n\t\t\t\tfor (int k = 0; k < T; k++) {\n\t\t\t\t\tds[j][k] = (j != k ? G[splist[j]][splist[k]] : 0);\n\t\t\t\t}\n\t\t\t}\n\t\t\twarshall_floyd(T, ds);\n\t\t\tfor (int j = 0; j < T; j++) {\n\t\t\t\tfor (int k = 0; k < T; k++) {\n\t\t\t\t\tif (dp[splist[j]][splist[k]] != INF) {\n\t\t\t\t\t\tfor (int x = 0; x < T; x++) {\n\t\t\t\t\t\t\tfor (int y = 0; y < T; y++) {\n\t\t\t\t\t\t\t\tif (ds[j][x] != INF && ds[y][k] != INF) {\n\t\t\t\t\t\t\t\t\tndp[sid[x]][sid[y]] = min(ndp[sid[x]][sid[y]], dp[splist[j]][splist[k]] + ds[j][x] + ds[y][k] + subcost);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < S; j++) {\n\t\t\tfor (int k = 0; k < S; k++) {\n\t\t\t\tif (ndp[j][k] != INF) {\n\t\t\t\t\tdp[plist[j]][plist[k]] = min(dp[plist[j]][plist[k]], ndp[j][k] - C[plist[j]].cost - C[plist[k]].cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// case 2: different heights\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (C[i].height == h && dp[i][j] != INF) {\n\t\t\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\t\t\tif (d1[i][k] != INF) {\n\t\t\t\t\t\t\tdp[k][j] = min(dp[k][j], dp[i][j] + d1[i][k]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (C[j].height == h && dp[i][j] != INF) {\n\t\t\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\t\t\tif (d2[k][j] != INF) {\n\t\t\t\t\t\t\tdp[i][k] = min(dp[i][k], dp[i][j] + d2[k][j]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[N - 1][N - 1];\n}\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<city> C(N);\n\t\tfor (int i = 1; i < N - 1; i++) {\n\t\t\tcin >> C[i].cost >> C[i].height;\n\t\t}\n\t\tC[0].height = 0;\n\t\tC[N - 1].height = 1000;\n\t\tvector<vector<int> > G(N, vector<int>(N, INF));\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tint a, b, c;\n\t\t\tcin >> a >> b >> c;\n\t\t\ta -= 1;\n\t\t\tb -= 1;\n\t\t\tG[a][b] = min(G[a][b], c);\n\t\t}\n\t\tint ans = solve(N, C, G);\n\t\tcout << (ans != INF ? ans : -1) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3416,"score_of_the_acc":-0.0092,"final_rank":1},{"submission_id":"aoj_1324_7238070","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define foa(s, v) for(auto &s : v)\n#define all(v) v.begin(), v.end()\n#define REPname(a,b,c,d,...) d\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP2(i,l,r) for(int i = l; i < r; i++)\n#define REP1(i, x) REP2(i,0,x)\n#define REP0(x) REP1(SPJ, x)\n#define sz(x) int(x.size())\n\ntemplate <class T>\nusing V=vector<T>;\n\ntemplate <class T>\nusing VV=vector<V<T>>;\n\ntemplate<class T>\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\nusing ll = long long ;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = V<vll>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\ntemplate<class T>\ninline bool chmax(T &a, T b){\n\treturn a < b ? a=b, 1 : 0;\n}\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\treturn a > b ? a = b, 1 : 0;\n}\n\n\n// template <c0lass T>\nvoid view(ll x) {\n\tif(x > INF / 2) cerr << \"INF\";\n\telse cerr << x;\n}\n\n\ntemplate <class T>\nvoid view(T x) {\n\tcerr << x;\n}\n\ntemplate <class T>\nvoid view(V<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \", \";}\n\tcerr << \"}\";\n}\n\n\ntemplate <class T>\nvoid view(VV<T> v) {\n\tcerr << \"{ \";\n\tfoa(t, v) {view(t) ; cerr << \",\\n\";}\n\tcerr << \"}\";\n\tcerr << endl;\n}\n\n\n// template <c0lass T>\nvoid view(int x) {\n\tcerr << x;\n}\n\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <class T>\nvoid debug_out(T x) {\n\tview(x);\n}\ntemplate <class H, class... T>\nvoid debug_out(H h, T... t) {\n\tview(h);\n\tcerr << \", \";\n\tdebug_out(t...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tcerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tcerr << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\nusing vvi = V<vi>;\n\n\nll solve(int n){\n\tint m; cin >> m;\n\tint hmax = 1001;\n\tvector<int> height(n);\n\tvector<ll> visa(n);\n\tvector<vi> towns(hmax);\n\trep(i, 1, n - 1) {\n\t\tcin >> visa[i] >> height[i];\n\t}\n\theight.back() = hmax - 1;\n\n\tvector<int> order_height(n);\n\tiota(all(order_height), 0);\n\tsort(all(order_height), [&](int i, int j) { return height[i] < height[j]; });\n\n\tvector<int> mapsto(n);\n\trep(i, n) mapsto[order_height[i]] = i;\n\n\t{\n\t\tvector<int> w(n);\n\t\tvector<ll> fee(n);\n\t\trep(i, n) {\n\t\t\tint old = order_height[i];\n\t\t\tw[i] = height[old];\n\t\t\tfee[i] = visa[old];\n\t\t}\n\t\tswap(height, w);\n\t\tswap(fee, visa);\n\t}\n\n\trep(i, n) {\n\t\ttowns[height[i]].push_back(i);\n\t}\n\n\tvector<V<pair<int, ll>>> g(n), rg(n);\n\trep(m) {\n\t\tint a, b;\n\t\tll c; cin >> a >> b >> c;\n\t\ta--;\n\t\tb--;\n\t\ta = mapsto[a];\n\t\tb = mapsto[b];\n\t\tg[a].emplace_back(b, c);\n\t\trg[b].emplace_back(a, c);\n\t}\n\n\tV<vector<vector<vector<vll>>>> pt(hmax);\n\n\n\trep(h, hmax) {\n\t\tconst auto & grp = towns[h];\n\t\tif(grp.empty()) continue;\n\n\t\tdebug(grp);\n\t\tint mn = grp.front();\n\t\tint mx = grp.back();\n\t\tint len = mx - mn + 1;\n\t\tvector<vector<vector<vll>>> pair_trans(len, vector(len, vector(len, vector<ll>(len, INF))));\n\t\t// from, from , to, to\n\t\trep(i, len) rep(j, len) {\n\t\t\tll c = visa[i + mn];\n\t\t\tif(i != j ) c += visa[j+mn];\n\t\t\tpair_trans[i][j][i][j] = c;\n\t\t}\n\t\trep(use, (1 << len)) {\n\t\t\tvvll cost(len, vll(len, INF));\n\t\t\tll visas = 0;\n\t\t\trep(i, len) {\n\t\t\t\tif(!(use & (1 << i))) continue;\n\t\t\t\tcost[i][i] = 0;\n\t\t\t\tint from = i + mn;\n\t\t\t\tvisas += visa[from];\n\t\t\t\tfor(const auto& [to, ecost] : g[from]) {\n\t\t\t\t\tdebug(from, to, ecost, mn, mx, use);\n\t\t\t\t\tif(mn <= to && to <= mx && (use & (1 << (to - mn)))) {\n\t\t\t\t\t\tdebug(from, to, ecost);\n\t\t\t\t\t\tchmin(cost[i][to - mn], ecost);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(k, len) rep(i, len) rep(j, len) chmin(cost[i][j], cost.at(i).at(k) + cost.at(k).at(j));\n\n\t\t\tdebug(use, cost);\n\n\t\t\trep(i, len) rep(j, len) rep(k, len) rep(l, len) {\n\t\t\t\tchmin(pair_trans[i].at(j).at(k).at(l), cost[i][k] + cost[l][j] + visas);\n\t\t\t}\n\t\t}\n\n\t\trep(i, len) rep(j, len) rep(k, len) rep(l, len) \n\t\t{\n\t\t\tauto &t = pair_trans[i][j][k][l];\n\t\t\tif(t < INF / 2) debug(i, j, k, l, t);\n\t\t}\n\n\t\tpt[h] = pair_trans;\n\t}\n\n\n\tpqmin<tuple<ll, int, int>> q;\n\tq.emplace(0LL, 0, 0);\n\tvector<vector<ll>> dist(n, vll(n, INF));\n\tdist.front().front() = 0;\n\n\twhile(q.size()) {\n\t\tll d;\n\t\tint fth,bck;\n\t\ttie(d, fth, bck) = q.top();\n\t\tq.pop();\n\t\tif(fth == bck && bck == n - 1) return d;\n\t\tif(d > dist[fth].at(bck)) continue;\n\n\t\tdebug(d, fth, bck);\n\n\t\tauto set_nxt = [&](int fnxt, int bnxt, ll val ) {\n\t\t\tif(val < 0) exit(1);\n\t\t\tif(chmin(dist.at(fnxt).at(bnxt), val)) {\n\t\t\t\tq.emplace(val, fnxt, bnxt);\n\t\t\t}\n\t\t};\n\n\t\tif(height[fth] == height[bck]) {\n\t\t\tauto& p = pt.at(height.at(fth));\n\t\t\tconst int len = sz(p);\n\t\t\tconst auto& current = towns[height[fth]];\n\n\t\t\tint fromf = fth - current.front();\n\t\t\tint fromb = bck - current.front();\n\t\t\trep(i, len) rep(j, len) {\n\t\t\t\tint tof = current[i];\n\t\t\t\tint tob = current[j];\n\t\t\t\tll cost = p[fromf].at(fromb).at(i).at(j) + d - visa[fth];\n\t\t\t\tif(fth != bck) cost -= visa[bck];\n\t\t\t\tdebug(fth, bck, d, tof, tob, cost, p[fromf].at(fromb).at(i).at(j));\n\t\t\t\tset_nxt(tof, tob, cost);\n\t\t\t}\n\t\t}\n\t\tif(height[fth] <= height[bck]) {\n\t\t\tfor(auto [nxt, ed_cost] : g[fth]) {\n\t\t\t\tif(height[nxt] >= height[fth]) {\n\t\t\t\t\tll cost = d + ed_cost;\n\t\t\t\t\tif(nxt != bck) cost += visa[nxt];\n\t\t\t\t\tset_nxt(nxt, bck, cost);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor(auto [nxt, ed_cost] : rg[bck]) {\n\t\t\t\tif(height[nxt] >= height[bck]) {\n\t\t\t\t\tll cost = d + ed_cost;\n\t\t\t\t\tif(nxt != fth) cost += visa[nxt];\n\t\t\t\t\tset_nxt(fth, nxt, cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn -1;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\tint n;\n\twhile(cin >> n && n) cout << solve(n) << '\\n';\n}","accuracy":1,"time_ms":140,"memory_kb":4388,"score_of_the_acc":-0.0402,"final_rank":6},{"submission_id":"aoj_1324_6722303","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0) break;\n vector<int> d(n), e(n);\n e[n-1] = 1000;\n vector<vector<int>> cities(1001);\n cities[0].push_back(0);\n cities[1000].push_back(n-1);\n rep(i,1,n-1) {\n cin >> d[i] >> e[i];\n cities[e[i]].push_back(i);\n }\n vector<vector<pair<int, int>>> G(n);\n rep(_,0,m) {\n int a, b, c;\n cin >> a >> b >> c;\n --a, --b;\n G[a].push_back({b, c});\n }\n\n vector<vector<int>> dp(n, vector<int>(n, 1e8)); // cost to go from i (up) to j (down)\n dp[n-1][n-1] = 0;\n\n revrep(a,1000,0) {\n int N = cities[a].size();\n rep(S,0,1<<N) {\n vector<vector<int>> up(n, vector<int>(n, 1e8)), down(n, vector<int>(n, 1e8));\n rep(i,0,n) up[i][i] = down[i][i] = 0;\n int dd = 0;\n rep(i,0,n) {\n if (e[i] < a) continue;\n if (e[i] == a) {\n auto j = find(all(cities[a]), i) - cities[a].begin();\n if (!(S>>j&1)) continue;\n dd += d[i];\n }\n for (auto [j, c] : G[i]) {\n if (e[i] <= e[j]) up[i][j] = c + d[i];\n if (e[i] >= e[j]) down[i][j] = c + d[j];\n if (e[i] == a) up[i][j] -= d[i];\n if (e[j] == a) down[i][j] -= d[j];\n }\n }\n\n rep(k,0,n) rep(i,0,n) rep(j,0,n) chmin(up[i][j], up[i][k] + up[k][j]);\n rep(k,0,n) rep(i,0,n) rep(j,0,n) chmin(down[i][j], down[i][k] + down[k][j]);\n\n for (int i : cities[a]) for (int j : cities[a]) {\n int k = find(all(cities[a]), i) - cities[a].begin();\n if (!(S>>k&1)) continue;\n k = find(all(cities[a]), j) - cities[a].begin();\n if (!(S>>k&1)) continue;\n\n rep(k,0,n) rep(l,0,n) if (a < e[k] && a < e[l]) {\n chmin(dp[i][j], up[i][k] + dp[k][l] + down[l][j] + dd);\n }\n }\n }\n }\n cout << (dp[0][0] < 1e8 ? dp[0][0] : -1) << endl;\n }\n}","accuracy":1,"time_ms":3910,"memory_kb":3260,"score_of_the_acc":-0.5833,"final_rank":13},{"submission_id":"aoj_1324_6718504","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n\tif constexpr (cond_v) {\n\t\treturn std::forward<Then>(then);\n\t} else {\n\t\treturn std::forward<OrElse>(or_else);\n\t}\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n\tusing type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n\tusing type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r)\tREP4(i,l,r,1)\n#define REP2(i,n)\t REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i)\t REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n)\t RREP3(i,0,n)\n\n#define rep(...)\tOVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n\tconstexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n\tconstexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n\tconstexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n\tstd::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n\t((std::cerr << \", \" << std::forward<Args>(args)), ...);\n\tstd::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n\tstd::ostream::sentry s(dest);\n\tif (s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar* d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while (tmp != 0);\n\t\tif (value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif (dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n\tstd::ostream::sentry s(dest);\n\tif (s) {\n\t\tchar buffer[128];\n\t\tchar* d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[value % 10];\n\t\t\tvalue /= 10;\n\t\t} while (value != 0);\n\t\tint len = std::end(buffer) - d;\n\t\tif (dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n\treturn out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n\tif constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n\t\treturn out;\n\t} else {\n\t\tout << std::get<N>(a);\n\t\tif constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n\t\t\tout << ' ';\n\t\t}\n\t\treturn operator<<<N + 1>(out, a);\n\t}\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n\tfor (auto it = a.begin(); it != a.end();) {\n\t\tout << *it;\n\t\tif (++it != a.end()) out << ' ';\n\t}\n\treturn out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n\tfor (auto it = a.begin(); it != a.end();) {\n\t\tout << *it;\n\t\tif (++it != a.end()) out << ' ';\n\t}\n\treturn out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n\tstd::cout << head;\n\tif (sizeof...(tails)) std::cout << ' ';\n\tprint(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n\tfor (auto it = v.begin(); it != v.end();) {\n\t\tstd::cout << *it;\n\t\tif (++it != v.end()) std::cout << sep;\n\t}\n\tstd::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n\t__int128_t ret = 0;\n\tfor (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n\tif (s[0] == '-') ret = -ret;\n\treturn ret;\n}\n__uint128_t parse_u128(std::string& s) {\n\t__uint128_t ret = 0;\n\tfor (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n\treturn ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n\tstd::string s;\n\tin >> s;\n\tv = parse_i128(s);\n\treturn in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n\tstd::string s;\n\tin >> s;\n\tv = parse_u128(s);\n\treturn in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n\treturn in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n\tif constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n\t\treturn in;\n\t} else {\n\t\treturn operator>><N + 1>(in >> std::get<N>(a), a);\n\t}\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n\tfor (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n\treturn in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n\tfor (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n\treturn in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n\t(std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n\treturn -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n\treturn -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n\treturn (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n\treturn (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n\treturn std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n\treturn iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n\tstd::vector<T> v(n);\n\tfor (int i = 0; i < n; ++i) v[i] = generator(i);\n\treturn v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n\treturn generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n\treturn generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n\tif (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n\tforeach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n\tif (y >= x) return false;\n\tx = y;\n\treturn true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n\tif (y <= x) return false;\n\tx = y;\n\treturn true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n\tstd::string res;\n\tif (bit_num >= 0) {\n\t\tfor (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n\t} else {\n\t\tfor (; val; val >>= 1) res += '0' + (val & 1);\n\t\tstd::reverse(res.begin(), res.end());\n\t}\n\treturn res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n\tstd::vector<T> res;\n\tfor (; val; val /= base) res.push_back(val % base);\n\tif (res.empty()) res.push_back(T{ 0 });\n\treturn res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n\tauto res = digits_low_to_high(val, base);\n\tstd::reverse(res.begin(), res.end());\n\treturn res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n\tstd::ostringstream ss;\n\tfor (auto it = v.begin(); it != v.end();) {\n\t\tss << *it;\n\t\tif (++it != v.end()) ss << sep;\n\t}\n\tss << end;\n\treturn ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n\tio_setup(int precision = 20) {\n\t\tstd::ios::sync_with_stdio(false);\n\t\tstd::cin.tie(nullptr);\n\t\tstd::cout << std::fixed << std::setprecision(precision);\n\t}\n} io_setup_ {};\n\n// ! code from here\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace suisen {\ntemplate <typename T>\nclass CoordinateCompressorBuilder {\n\tpublic:\n\t\tstruct Compressor {\n\t\t\tpublic:\n\t\t\t\tstatic constexpr int absent = -1;\n\n\t\t\t\t// default constructor\n\t\t\t\tCompressor() : _xs(std::vector<T>{}) {}\n\t\t\t\t// Construct from strictly sorted vector\n\t\t\t\tCompressor(const std::vector<T> &xs) : _xs(xs) {\n\t\t\t\t\tassert(is_strictly_sorted(xs));\n\t\t\t\t}\n\n\t\t\t\t// Return the number of distinct keys.\n\t\t\t\tint size() const {\n\t\t\t\t\treturn _xs.size();\n\t\t\t\t}\n\t\t\t\t// Check if the element is registered.\n\t\t\t\tbool has_key(const T &e) const {\n\t\t\t\t\treturn std::binary_search(_xs.begin(), _xs.end(), e);\n\t\t\t\t}\n\t\t\t\t// Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\n\t\t\t\tint comp(const T &e, int default_value = absent) const {\n\t\t\t\t\tconst int res = min_geq_index(e);\n\t\t\t\t\treturn res != size() and _xs[res] == e ? res : default_value;\n\t\t\t\t}\n\t\t\t\t// Restore the element from the index.\n\t\t\t\tT decomp(const int compressed_index) const {\n\t\t\t\t\treturn _xs[compressed_index];\n\t\t\t\t}\n\t\t\t\t// Compress the element. Equivalent to call `comp(e)`\n\t\t\t\tint operator[](const T &e) const {\n\t\t\t\t\treturn comp(e);\n\t\t\t\t}\n\t\t\t\t// Return the minimum registered value greater than `e`. if not exists, return `default_value`.\n\t\t\t\tT min_gt(const T &e, const T &default_value) const {\n\t\t\t\t\tauto it = std::upper_bound(_xs.begin(), _xs.end(), e);\n\t\t\t\t\treturn it == _xs.end() ? default_value : *it;\n\t\t\t\t}\n\t\t\t\t// Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\n\t\t\t\tT min_geq(const T &e, const T &default_value) const {\n\t\t\t\t\tauto it = std::lower_bound(_xs.begin(), _xs.end(), e);\n\t\t\t\t\treturn it == _xs.end() ? default_value : *it;\n\t\t\t\t}\n\t\t\t\t// Return the maximum registered value less than `e`. if not exists, return `default_value`\n\t\t\t\tT max_lt(const T &e, const T &default_value) const {\n\t\t\t\t\tauto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\n\t\t\t\t\treturn it == _xs.rend() ? default_value : *it;\n\t\t\t\t}\n\t\t\t\t// Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\n\t\t\t\tT max_leq(const T &e, const T &default_value) const {\n\t\t\t\t\tauto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\n\t\t\t\t\treturn it == _xs.rend() ? default_value : *it;\n\t\t\t\t}\n\t\t\t\t// Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\n\t\t\t\tint min_gt_index(const T &e) const {\n\t\t\t\t\treturn std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n\t\t\t\t}\n\t\t\t\t// Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\n\t\t\t\tint min_geq_index(const T &e) const {\n\t\t\t\t\treturn std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n\t\t\t\t}\n\t\t\t\t// Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\n\t\t\t\tint max_lt_index(const T &e) const {\n\t\t\t\t\treturn int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\n\t\t\t\t}\n\t\t\t\t// Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\n\t\t\t\tint max_leq_index(const T &e) const {\n\t\t\t\t\treturn int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\n\t\t\t\t}\n\t\t\tprivate:\n\t\t\t\tstd::vector<T> _xs;\n\t\t\t\tstatic bool is_strictly_sorted(const std::vector<T> &v) {\n\t\t\t\t\treturn std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\n\t\t\t\t}\n\t\t};\n\t\tCoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\n\t\texplicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\n\t\texplicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\n\t\ttemplate <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n\t\tCoordinateCompressorBuilder(const int n, Gen generator) {\n\t\t\treserve(n);\n\t\t\tfor (int i = 0; i < n; ++i) push(generator(i));\n\t\t}\n\t\t// Attempt to preallocate enough memory for specified number of elements.\n\t\tvoid reserve(int n) {\n\t\t\t_xs.reserve(n);\n\t\t}\n\t\t// Add data.\n\t\tvoid push(const T &first) {\n\t\t\t_xs.push_back(first);\n\t\t}\n\t\t// Add data.\n\t\tvoid push(T &&first) {\n\t\t\t_xs.push_back(std::move(first));\n\t\t}\n\t\t// Add data in the range of [first, last). \n\t\ttemplate <typename Iterator>\n\t\tauto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\n\t\t\tfor (auto it = first; it != last; ++it) _xs.push_back(*it);\n\t\t}\n\t\t// Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\n\t\ttemplate <typename Iterable>\n\t\tauto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\n\t\t\tpush(iterable.begin(), iterable.end());\n\t\t}\n\t\t// Add data.\n\t\ttemplate <typename ...Args>\n\t\tvoid emplace(Args &&...args) {\n\t\t\t_xs.emplace_back(std::forward<Args>(args)...);\n\t\t}\n\t\t// Build compressor.\n\t\tauto build() {\n\t\t\tstd::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\n\t\t\treturn Compressor {_xs};\n\t\t}\n\t\t// Build compressor from vector.\n\t\tstatic auto build(const std::vector<T> &xs) {\n\t\t\treturn CoordinateCompressorBuilder(xs).build();\n\t\t}\n\t\t// Build compressor from vector.\n\t\tstatic auto build(std::vector<T> &&xs) {\n\t\t\treturn CoordinateCompressorBuilder(std::move(xs)).build();\n\t\t}\n\t\t// Build compressor from generator.\n\t\ttemplate <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n\t\tstatic auto build(const int n, Gen generator) {\n\t\t\treturn CoordinateCompressorBuilder<T>(n, generator).build();\n\t\t}\n\tprivate:\n\t\tstd::vector<T> _xs;\n};\n\n} // namespace suisen\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <cstdint>\n#include <iostream>\n\nnamespace suisen {\n\ttemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\n\tstruct all_subset {\n\t\tstruct all_subset_iter {\n\t\t\tconst T s; T t;\n\t\t\tconstexpr all_subset_iter(T s) : s(s), t(s + 1) {}\n\t\t\tconstexpr auto operator*() const { return t; }\n\t\t\tconstexpr auto operator++() {}\n\t\t\tconstexpr auto operator!=(std::nullptr_t) { return t ? (--t &= s, true) : false; }\n\t\t};\n\t\tT s;\n\t\tconstexpr all_subset(T s) : s(s) {}\n\t\tconstexpr auto begin() { return all_subset_iter(s); }\n\t\tconstexpr auto end() { return nullptr; }\n\t};\n\n\t// iterator over T s.t. T is subset of S and |T| = k\n\tstruct all_subset_k {\n\t\tstruct all_subset_k_iter {\n\t\t\tconst uint32_t n, k, s;\n\t\t\tuint32_t t;\n\t\t\t__attribute__((target(\"avx2\")))\n\t\t\tall_subset_k_iter(uint32_t s, uint32_t k) : n(uint32_t(1) << _mm_popcnt_u32(s)), k(k), s(s), t((uint32_t(1) << k) - 1) {}\n\t\t\t__attribute__((target(\"bmi2\")))\n\t\t\tauto operator*() const { return _pdep_u32(t, s); }\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator++() {\n\t\t\t\tif (k == 0) {\n\t\t\t\t\tt = std::numeric_limits<uint32_t>::max();\n\t\t\t\t} else {\n\t\t\t\t\tuint32_t y = t + _blsi_u32(t); // t + (-t & t)\n\t\t\t\t\tt = y | ((y ^ t) >> _tzcnt_u32(t << 2));\n\t\t\t\t}\n\t\t\t}\n\t\t\tauto operator!=(std::nullptr_t) const { return t < n; }\n\t\t};\n\t\tuint32_t s, k;\n\t\tall_subset_k(uint32_t s, uint32_t k) : s(s), k(k) {\n\t\t\tassert(s != std::numeric_limits<uint32_t>::max());\n\t\t}\n\t\tauto begin() { return all_subset_k_iter(s, k); }\n\t\tauto end() { return nullptr; }\n\t};\n\n\tstruct all_subset_k_64 {\n\t\tstruct all_subset_k_iter_64 {\n\t\t\tconst uint64_t n, s;\n\t\t\tconst uint32_t k;\n\t\t\tuint64_t t;\n\t\t\t__attribute__((target(\"avx2\")))\n\t\t\tall_subset_k_iter_64(uint64_t s, uint32_t k) : n(uint64_t(1) << _mm_popcnt_u64(s)), s(s), k(k), t((uint64_t(1) << k) - 1) {}\n\t\t\t__attribute__((target(\"bmi2\")))\n\t\t\tauto operator*() const { return _pdep_u64(t, s); }\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator++() {\n\t\t\t\tif (k == 0) {\n\t\t\t\t\tt = std::numeric_limits<uint64_t>::max();\n\t\t\t\t} else {\n\t\t\t\t\tuint64_t y = t + _blsi_u64(t);\n\t\t\t\t\tt = y | ((y ^ t) >> _tzcnt_u64(t << 2));\n\t\t\t\t}\n\t\t\t}\n\t\t\tauto operator!=(std::nullptr_t) const { return t < n; }\n\t\t};\n\t\tuint64_t s;\n\t\tuint32_t k;\n\t\tall_subset_k_64(uint64_t s, uint32_t k) : s(s), k(k) {\n\t\t\tassert(s != std::numeric_limits<uint64_t>::max());\n\t\t}\n\t\tauto begin() { return all_subset_k_iter_64(s, k); }\n\t\tauto end() { return nullptr; }\n\t};\n\n\tstruct all_setbit {\n\t\tstruct all_setbit_iter {\n\t\t\tuint32_t s;\n\t\t\tall_setbit_iter(uint32_t s) : s(s) {}\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator*() { return _tzcnt_u32(s); }\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator++() { s = __blsr_u32(s); }\n\t\t\tauto operator!=(std::nullptr_t) { return s; }\n\t\t};\n\t\tuint32_t s;\n\t\tall_setbit(uint32_t s) : s(s) {}\n\t\tauto begin() { return all_setbit_iter(s); }\n\t\tauto end() { return nullptr; }\n\t};\n\n\tstruct all_setbit_64 {\n\t\tstruct all_setbit_iter_64 {\n\t\t\tuint64_t s;\n\t\t\tall_setbit_iter_64(uint64_t s) : s(s) {}\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator*() { return _tzcnt_u64(s); }\n\t\t\t__attribute__((target(\"bmi\")))\n\t\t\tauto operator++() { s = __blsr_u64(s); }\n\t\t\tauto operator!=(std::nullptr_t) { return s; }\n\t\t};\n\t\tuint64_t s;\n\t\tall_setbit_64(uint64_t s) : s(s) {}\n\t\tauto begin() { return all_setbit_iter_64(s); }\n\t\tauto end() { return nullptr; }\n\t};\n} // namespace suisen\n\nvoid solve() {\n\tinput(int, n, m);\n\tif (n == 0 and m == 0) exit(0);\n\n\tCoordinateCompressorBuilder<int> builder;\n\n\tvector<int> h(n), c(n);\n\th[0] = 0, c[0] = 0;\n\trep(i, 1, n - 1) read(c[i], h[i]);\n\th[n - 1] = 1000, c[n - 1] = 0;\n\n\trep(i, n) builder.push(h[i]);\n\tconst auto cmp = builder.build();\n\tconst int l = cmp.size();\n\tvector<long long> lev_sets(l);\n\n\trep(i, n) {\n\t\th[i] = cmp[h[i]];\n\t\tlev_sets[h[i]] |= 1LL << i;\n\t}\n\n\tvector g(l, vector<vector<pair<int, int>>>(n));\n\tvector rev_g(l, vector<vector<pair<int, int>>>(n));\n\tvector<vector<pair<int, int>>> asc(n), rev_dsc(n);\n\tloop(m) {\n\t\tinput(int, u, v, w);\n\t\t--u, --v;\n\t\tif (h[u] < h[v]) {\n\t\t\tasc[u].emplace_back(v, w);\n\t\t} else if (h[u] > h[v]) {\n\t\t\trev_dsc[v].emplace_back(u, w);\n\t\t} else {\n\t\t\tg[h[u]][u].emplace_back(v, w);\n\t\t\trev_g[h[u]][v].emplace_back(u, w);\n\t\t}\n\t}\n\n\tstatic constexpr int inf = numeric_limits<int>::max() / 4;\n\tvector dp(l, vector(n, vector<int>(n, inf)));\n\tdp[0][0][0] = 0;\n\trep(i, l - 1) {\n\t\tvector<vector<int>> dists(n);\n\t\trep(j, n) if (kth_bit(lev_sets[i], j)) {\n\t\t\tvector<int> dist(n, inf);\n\t\t\tpq_greater<pair<int, int>> pq;\n\t\t\tpq.emplace(dist[j] = c[j], j);\n\t\t\twhile (pq.size()) {\n\t\t\t\tauto [du, u] = pq.top();\n\t\t\t\tpq.pop();\n\t\t\t\tif (dist[u] != du) continue;\n\t\t\t\tfor (auto [v, w] : g[i][u]) {\n\t\t\t\t\tif (chmin(dist[v], du + w + c[v])) {\n\t\t\t\t\t\tpq.emplace(dist[v], v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdists[j].swap(dist);\n\t\t}\n\t\tvector<vector<int>> rev_dists(n);\n\t\trep(k, n) if (kth_bit(lev_sets[i], k)) {\n\t\t\tvector<int> dist(n, inf);\n\t\t\tpq_greater<pair<int, int>> pq;\n\t\t\tpq.emplace(dist[k] = c[k], k);\n\t\t\twhile (pq.size()) {\n\t\t\t\tauto [du, u] = pq.top();\n\t\t\t\tpq.pop();\n\t\t\t\tif (dist[u] != du) continue;\n\t\t\t\tfor (auto [v, w] : rev_g[i][u]) {\n\t\t\t\t\tif (chmin(dist[v], du + w + c[v])) {\n\t\t\t\t\t\tpq.emplace(dist[v], v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\trev_dists[k].swap(dist);\n\t\t}\n\n\t\tCoordinateCompressorBuilder<int> builder_i;\n\t\tfor (int v : all_setbit_64(lev_sets[i])) {\n\t\t\tbuilder_i.push(v);\n\t\t}\n\t\tconst auto cmp_i = builder_i.build();\n\t\tconst int siz = cmp_i.size();\n\n\t\tvector init_wf(siz, vector<int>(siz, inf));\n\t\trep(cx, siz) init_wf[cx][cx] = 0;\n\t\trep(cx, siz) for (auto [y, w] : g[i][cmp_i.decomp(cx)]) {\n\t\t\tinit_wf[cx][cmp_i[y]] = w;\n\t\t}\n\n\t\tmap<long long, vector<vector<int>>> wfs;\n\t\tfor (auto s : all_subset(lev_sets[i])) {\n\t\t\tauto wf = init_wf;\n\t\t\trep(cz, siz) if (kth_bit(s, cmp_i.decomp(cz))) {\n\t\t\t\trep(cx, siz) if (kth_bit(s, cmp_i.decomp(cx))) {\n\t\t\t\t\trep(cy, siz) if (kth_bit(s, cmp_i.decomp(cy))) {\n\t\t\t\t\t\tchmin(wf[cx][cy], wf[cx][cz] + wf[cz][cy]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\twfs[s] = move(wf);\n\t\t}\n\n\t\trep(j, n) rep(k, n) {\n\t\t\tif (dp[i][j][k] == inf) continue;\n\t\t\tassert(h[j] >= i and h[k] >= i);\n\n\t\t\tif (kth_bit(lev_sets[i], j) and kth_bit(lev_sets[i], k)) {\n\t\t\t\tconst int cj = cmp_i[j], ck = cmp_i[k];\n\t\t\t\tfor (auto s : all_subset(lev_sets[i] & ~((1LL << j) | (1LL << k)))) {\n\t\t\t\t\ts |= 1LL << j, s |= 1LL << k;\n\t\t\t\t\t\n\t\t\t\t\tint fc = 0;\n\t\t\t\t\tfor (int v : all_setbit_64(s)) fc += c[v];\n\n\t\t\t\t\tconst auto &wf = wfs.at(s);\n\t\t\t\t\tfor (auto x : all_setbit_64(s)) for (auto y : all_setbit_64(s)) {\n\t\t\t\t\t\tconst int cx = cmp_i[x], cy = cmp_i[y];\n\t\t\t\t\t\tfor (auto [nj, wj] : asc[x]) for (auto [nk, wk] : rev_dsc[y]) {\n\t\t\t\t\t\t\tchmin(dp[i + 1][nj][nk], dp[i][j][k] + wf[cj][cx] + wf[cy][ck] + fc + wj + wk);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (kth_bit(lev_sets[i], j)) {\n\t\t\t\trep(x, n) if (dists[j][x] != inf) {\n\t\t\t\t\tfor (auto [nj, w] : asc[x]) {\n\t\t\t\t\t\tchmin(dp[i + 1][nj][k], dp[i][j][k] + dists[j][x] + w);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (kth_bit(lev_sets[i], k)) {\n\t\t\t\trep(y, n) if (rev_dists[k][y] != inf) {\n\t\t\t\t\tfor (auto [nk, w] : rev_dsc[y]) {\n\t\t\t\t\t\tchmin(dp[i + 1][j][nk], dp[i][j][k] + rev_dists[k][y] + w);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tchmin(dp[i + 1][j][k], dp[i][j][k]);\n\t\t\t}\n\t\t}\n\t}\n\n\tprint(dp[l - 1][n - 1][n - 1] == inf ? -1 : dp[l - 1][n - 1][n - 1]);\n\t// cout.flush();\n}\n\nint main() {\n\twhile (true) solve();\n\treturn 0;\n}","accuracy":1,"time_ms":4460,"memory_kb":4368,"score_of_the_acc":-0.6818,"final_rank":15},{"submission_id":"aoj_1324_6082052","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(v) (v).begin(),(v).end()\nusing ll=long long int;\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\n\nvoid solve(){\n int n,m;\n cin>>n>>m;\n if(n==0)exit(0);\n vector<int> d(n),e(n);\n e[n-1]=1000;\n rep(i,1,n-1)cin>>d[i]>>e[i];\n int pos[n],ecnt[1010]={};\n rep(i,0,n)pos[i]=ecnt[e[i]]++;\n using P=array<int,2>;\n vector g(n,vector<P>()),rev(n,vector<P>());\n rep(_,0,m){\n int u,v,w;\n cin>>u>>v>>w;\n u--; v--;\n if(e[u]<=e[v])g[u].push_back({v,w});\n if(e[u]>=e[v])rev[v].push_back({u,w});\n }\n\n vector dp(n,vector(n,vector<ll>(1<<10,INF)));\n dp[0][0][1]=0;\n using T=pair<ll,array<int,3>>;\n priority_queue<T,vector<T>,greater<T>> pq;\n pq.push({0,{0,0,1}});\n\n auto insert=[&](int x,int y,int mask,ll dist)->void{\n if(chmin(dp[x][y][mask],dist)){\n pq.push({dp[x][y][mask],{x,y,mask}});\n }\n };\n\n while(!pq.empty()){\n auto [dist,state]=pq.top();\n pq.pop();\n auto [x,y,mask]=state;\n if(dp[x][y][mask]<dist)continue;\n for(auto& [nxt,add]:g[x]){\n if(e[nxt]<e[y])insert(nxt,y,mask,dist+add+d[nxt]);\n else if(e[nxt]==e[x] or e[nxt]==e[y])insert(nxt,y,mask|(1<<pos[nxt]),dist+add+(mask>>pos[nxt]&1?0:d[nxt]));\n else insert(nxt,y,1<<pos[nxt],dist+add+d[nxt]);\n }\n for(auto& [nxt,add]:rev[y]){\n if(e[nxt]<e[x])insert(x,nxt,mask,dist+add+d[nxt]);\n else if(e[nxt]==e[x] or e[nxt]==e[y])insert(x,nxt,mask|(1<<pos[nxt]),dist+add+(mask>>pos[nxt]&1?0:d[nxt]));\n else insert(x,nxt,1<<pos[nxt],dist+add+d[nxt]);\n }\n }\n ll ret=dp[n-1][n-1][1];\n if(ret==INF)puts(\"-1\");\n else cout<<ret<<'\\n';\n}\n\nint main(){\n for(;;)solve();\n return 0;\n}","accuracy":1,"time_ms":1540,"memory_kb":63500,"score_of_the_acc":-1.1416,"final_rank":19},{"submission_id":"aoj_1324_6041768","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\ntemplate <class Cost = int>\nstruct edge {\n int from, to;\n Cost cost;\n edge() {}\n edge(int from, int to, Cost cost) : from(from), to(to), cost(cost) {}\n\n // for debug\n friend ostream &operator<<(ostream &os, const edge &e) {\n os << e.from << \" -> \" << e.to << \" : \" << e.cost << \", \";\n return os;\n }\n};\n\ntemplate <class Cost = int>\nstruct Graph {\n int V;\n vector<vector<edge<Cost>>> G;\n Graph() {}\n Graph(int V) : V(V) { G.resize(V); }\n void add_edge(int a, int b, Cost cost = Cost(0)) {\n G[a].push_back(edge<Cost>(a, b, cost));\n }\n void add_edge_undirected(int a, int b, Cost cost = Cost(0)) {\n G[a].push_back(edge<Cost>(a, b, cost));\n G[b].push_back(edge<Cost>(b, a, cost));\n }\n size_t size() const { return G.size(); }\n const vector<edge<Cost>> &operator[](int id) const { return G[id]; }\n\n // for debug\n friend ostream &operator<<(ostream &os, const Graph g) {\n for (int i = 0; i < g.size(); i++) {\n os << g[i];\n if (i + 1 < g.size()) os << endl;\n }\n return os;\n }\n};\n\n// verified\n// https://atcoder.jp/contests/dwacon6th-final-open/submissions/10023433\ntemplate <class Cost>\nvector<Cost> dijkstra(Graph<Cost> &g, int s) {\n assert(0 <= s && s < g.size());\n vector<Cost> dist;\n dist.assign(g.size(), numeric_limits<Cost>::max());\n dist[s] = Cost(0);\n MinHeap<pair<Cost, int>> q;\n q.push(make_pair(Cost(0), s));\n while (!q.empty()) {\n auto a = q.top();\n q.pop();\n int v = a.second;\n if (dist[v] < a.first) continue;\n for (auto e : g[v]) {\n if (dist[e.to] > dist[v] + e.cost) {\n dist[e.to] = dist[v] + e.cost;\n q.push(make_pair(dist[e.to], e.to));\n }\n }\n }\n return dist;\n}\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\nstruct city {\n int h, fee, id, h_id;\n city() {}\n city(int h, int fee, int id, int h_id) : h(h), fee(fee), id(id), h_id(h_id) {}\n bool operator<(const city &c) const { return h < c.h; }\n};\n\nbool solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) return false;\n\n vector<city> cs(n, {0, 0, -1, -1});\n vector<int> h_cnt(1001, 0);\n for (int i = 1; i < n - 1; i++) {\n int d, e;\n cin >> d >> e;\n cs[i] = city(e, d, i, h_cnt[e]++);\n }\n cs[0] = city(0, 0, 0, 0), cs[n - 1] = city(1000, 0, n - 1, 0);\n h_cnt[0] = 1, h_cnt[1000] = 1;\n sort(all(cs));\n\n vector<int> rev(n, -1);\n for (int i = 0; i < n; i++) { rev[cs[i].id] = i; }\n\n dmp(rev);\n\n Graph<int> G(n), rG(n);\n for (int i = 0; i < m; i++) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n a = rev[a], b = rev[b];\n if (cs[a].h <= cs[b].h) { G.add_edge(a, b, c); }\n if (cs[a].h >= cs[b].h) { rG.add_edge(b, a, c); }\n }\n\n // Graph<int> g(n * n * (1 << 10));\n\n auto encode = [&](int i, int j, int S) {\n return n * (1 << 10) * i + (1 << 10) * j + S;\n };\n\n auto decode = [&](int v, int &i, int &j, int &S) {\n S = v % (1 << 10), v /= (1 << 10);\n j = v % n, v /= n;\n i = v % n;\n return;\n };\n\n vector<int> dist;\n dist.assign(n * n * (1 << 10), INF);\n int s = encode(0, 0, 1);\n dist[s] = 0;\n\n MinHeap<pair<int, int>> q;\n q.push(make_pair(dist[s], s));\n\n auto update = [&](int u, int v, int cost) {\n if (dist[v] > dist[u] + cost) {\n dist[v] = dist[u] + cost;\n q.push(make_pair(dist[v], v));\n }\n };\n\n while (!q.empty()) {\n auto [d, u] = q.top();\n q.pop();\n if (dist[u] < d) continue;\n\n int i = -1, j = -1, S = -1;\n decode(u, i, j, S);\n\n if (cs[i].h <= cs[j].h) {\n for (auto e : G[i]) {\n int add = e.cost;\n int mask = (1 << cs[e.to].h_id);\n if (cs[e.to].h == cs[j].h) {\n if (!((S >> cs[e.to].h_id) & 1)) add += cs[e.to].fee;\n int v = encode(e.to, j, S | mask);\n update(u, v, add);\n } else if (cs[e.to].h > cs[j].h) {\n add += cs[e.to].fee;\n int v = encode(e.to, j, mask);\n update(u, v, add);\n } else {\n add += cs[e.to].fee;\n int v = encode(e.to, j, S);\n update(u, v, add);\n }\n }\n }\n\n if (cs[i].h >= cs[j].h) {\n for (auto e : rG[j]) {\n int add = e.cost;\n int mask = (1 << cs[e.to].h_id);\n if (cs[i].h == cs[e.to].h) {\n if (!((S >> cs[e.to].h_id) & 1)) add += cs[e.to].fee;\n int v = encode(i, e.to, S | mask);\n update(u, v, add);\n } else if (cs[e.to].h > cs[i].h) {\n add += cs[e.to].fee;\n int v = encode(i, e.to, mask);\n update(u, v, add);\n } else {\n add += cs[e.to].fee;\n int v = encode(i, e.to, S);\n update(u, v, add);\n }\n }\n }\n\n // for (auto e : g[v]) {\n // if (dist[e.to] > dist[v] + e.cost) {\n // dist[e.to] = dist[v] + e.cost;\n // q.push(make_pair(dist[e.to], e.to));\n // }\n // }\n }\n\n int ans = dist[encode(n - 1, n - 1, 1)];\n if (ans == INF)\n cout << -1 << endl;\n else\n cout << ans << endl;\n\n return true;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n while (solve()) {}\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":14988,"score_of_the_acc":-0.1959,"final_rank":8},{"submission_id":"aoj_1324_5920294","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=55,INF=1<<29;\n\nvector<pair<int,int>> G[MAX];\nvector<pair<int,int>> rG[MAX];\nint h[MAX];\nint cost[MAX];\nvector<int> pos[MAX];\n\nint dp[MAX][MAX][1<<10];\n\nint memo[MAX][MAX];\n\nvoid init(int N){\n for(int i=0;i<N;i++){\n G[i].clear();\n rG[i].clear();\n pos[i].clear();\n h[i]=cost[i]=0;\n for(int j=0;j<N;j++) memo[i][j]=-1;\n }\n for(int i=0;i<=N;i++) for(int j=0;j<=N;j++) for(int k=0;k<(1<<10);k++) dp[i][j][k]=INF;\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N,M;cin>>N>>M;\n if(N==0&&M==0) break;\n init(N);\n \n h[0]=0;\n h[N-1]=1000;\n cost[0]=cost[N-1]=0;\n for(int i=1;i<N-1;i++){\n cin>>cost[i]>>h[i];\n }\n \n vector<int> useh(N);\n for(int i=0;i<N;i++) useh[i]=h[i];\n sort(all(useh));\n useh.erase(unique(all(useh)),useh.end());\n \n for(int i=0;i<N;i++){\n h[i]=lower_bound(all(useh),h[i])-useh.begin();\n pos[h[i]].push_back(i);\n }\n \n for(int i=0;i<M;i++){\n int a,b,c;cin>>a>>b>>c;\n a--;b--;\n G[a].push_back(mp(b,c));\n rG[b].push_back(mp(a,c));\n }\n \n dp[0][0][1]=0;\n \n auto p=[&](int hh,int id){\n if(memo[hh][id]!=-1) return memo[hh][id];\n for(int i=0;i<si(pos[hh]);i++){\n if(pos[hh][i]==id) return memo[hh][id]=i;\n }\n return -1;\n };\n \n for(int t=0;t<N;t++){\n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n int z;\n if(h[i]>=h[j]) z=si(pos[h[i]]);\n else z=si(pos[h[j]]);\n for(int k=0;k<(1<<z);k++){\n if(dp[i][j][k]==INF) continue;\n \n for(auto to:G[i]){\n if(h[i]>h[to.fi]) continue;\n if(h[i]==h[j]){\n if(h[i]==h[to.fi]){\n int x=p(h[i],to.fi);\n if(k&(1<<x)){\n chmin(dp[to.fi][j][k],dp[i][j][k]+to.se);\n }else{\n chmin(dp[to.fi][j][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else{\n int x=p(h[to.fi],to.fi);\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else if(h[i]>h[j]){\n int x=p(h[to.fi],to.fi);\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }else{\n if(h[j]==h[to.fi]){\n int x=p(h[j],to.fi);\n if(k&(1<<x)){\n chmin(dp[to.fi][j][k],dp[i][j][k]+to.se);\n }else{\n chmin(dp[to.fi][j][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else{\n int x=p(h[to.fi],to.fi);\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }\n }\n \n for(auto to:rG[j]){\n if(h[i]>h[to.fi]) continue;\n if(h[i]==h[j]){\n if(h[j]==h[to.fi]){\n int x=p(h[j],to.fi);\n if(k&(1<<x)){\n chmin(dp[i][to.fi][k],dp[i][j][k]+to.se);\n }else{\n chmin(dp[i][to.fi][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else{\n int x=p(h[to.fi],to.fi);\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else if(h[j]>h[i]){\n int x=p(h[to.fi],to.fi);\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }else{\n if(h[i]==h[to.fi]){\n int x=p(h[i],to.fi);\n if(k&(1<<x)){\n chmin(dp[i][to.fi][k],dp[i][j][k]+to.se);\n }else{\n chmin(dp[i][to.fi][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }else{\n int x=p(h[to.fi],to.fi);\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\n }\n }\n }\n }\n }\n }\n }\n \n int ans=INF;\n \n for(int k=0;k<(1<<10);k++) chmin(ans,dp[N-1][N-1][k]);\n \n if(ans==INF) ans=-1;\n \n cout<<ans<<\"\\n\";\n \n }\n}","accuracy":1,"time_ms":6750,"memory_kb":14624,"score_of_the_acc":-1.1771,"final_rank":20},{"submission_id":"aoj_1324_5852146","code_snippet":"#include\"bits/stdc++.h\"\nusing namespace std;\n#define ALL(x) begin(x),end(x)\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define debug(v) cout<<#v<<\":\";for(auto x:v){cout<<x<<' ';}cout<<endl;\n#define mod 998244353\nusing ll=long long;\nconst int INF=10000000;\nconst ll LINF=1001002003004005006ll;\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\n\nstruct IOSetup{\n IOSetup(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout<<fixed<<setprecision(12);\n }\n} iosetup;\n \ntemplate<typename T>\nostream &operator<<(ostream &os,const vector<T>&v){\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\"\":\" \");\n return os;\n}\ntemplate<typename T>\nistream &operator>>(istream &is,vector<T>&v){\n for(T &x:v)is>>x;\n return is;\n}\n\nint N,M;\n\nusing P=pair<int,int>;\nusing PP=pair<int,P>;\n\n/*\n高い場所に１移動する場合\n逐一，同じ移動先に移動するならコストを1回しか支払わないようにしながらDijkstraをすれば良い\n同じ高さの移動のみ両者の移動がトポロジカルソート順になるとは限らない\nここは位置のスワップコストを求めてやれば良い．\nd[i][j] -> d[j][i]とする場合のコスト\nこの際，i, jのvisa feeは一度だけ支払えば良い\n\n到達時にvisa feeを支払いつつdijkstraをすることを考える．\n同じ高さで(i,j) -> (j,i)に移動するときに，お互い，visa feeを支払わずに移動してよいとする．\nなぜならiがiに到達する時点でiのvisa feeを支払済であり，jに関しても同じことが言えるためである\nまた，このようなswapコストを定義する理由としては，同じ高さでの移動に関しては行きはa-b-cの順序で移動するが，\n帰りと逆順ではc-b-aで移動している可能性がある(両者の移動順序がトポソ不可)ため，\nd[a][c]->d[b][b]->d[c][a]という遷移だと，a,cのvisa feeをそれぞれ二度支払いそうになる．\nよって同じ高さでのswap costを用意してやるとうまい．\n\n天才か？\n*/\n\nvoid solve(){\n vector<int> D(N),E(N);// visa fee, altitude\n D[0]=0, D[N-1]=0;\n E[0]=0, E[N-1]=INF;\n for(int i=1;i<N-1;i++) cin>>D[i]>>E[i];\n\n vector<vector<int>> C(N,vector<int>(N,INF));\n rep(i,N) C[i][i]=0;\n rep(i,M){\n int u,v,c;cin>>u>>v>>c;u--,v--;\n chmin(C[u][v],c);\n }\n\n vector<vector<int>> sw(N,vector<int>(N,INF));// 同じ高さの場合のみDAGではなくなる．行きと帰りで位置をswapするコスト\n rep(i,N){\n priority_queue<P,vector<P>,greater<P>> que;\n\n sw[i][i]=0;\n que.emplace(0, i);\n\n while(!que.empty()){\n auto [d, cur]=que.top();que.pop();\n if(d<sw[i][cur]) continue;\n\n rep(j,N)if(i!=j and E[i]==E[j]){\n if(chmin(sw[i][j], d+C[cur][j]*2+D[j])) que.emplace(sw[i][j], j);// ここもD[j]の支払いは一度で良い\n }\n }\n rep(j,N)if(i!=j) sw[i][j]-=D[j];// i, jもうコスト支払済なのでいい\n }\n\n priority_queue<PP,vector<PP>,greater<PP>> que;\n vector<vector<int>> res(N,vector<int>(N, INF));\n\n res[0][0]=0;\n que.emplace(res[0][0], make_pair(0,0));\n while(!que.empty()){\n auto pp=que.top();que.pop();\n int d=pp.first;\n int i,j;\n tie(i,j)=pp.second;\n\n if(res[i][j]<d) continue;\n \n // step - i\n rep(k,N)if(E[k]>=E[i]){\n if(chmin(res[k][j], d+C[i][k]+D[k])) que.emplace(res[k][j],make_pair(k,j));\n }\n\n // step - j\n rep(k,N)if(E[k]>=E[j]){\n if(chmin(res[i][k], d+C[k][j]+D[k])) que.emplace(res[i][k],make_pair(i,k));\n }\n\n // swap\n if(i!=j and E[i]==E[j]){\n if(chmin(res[j][i], d+sw[i][j])) que.emplace(res[j][i],make_pair(j,i));\n }\n\n // i -> k and j-> k\n rep(k,N)if(E[k]>=E[i] and E[k]>=E[j]){\n if(chmin(res[k][k], d+D[k]+C[i][k]+C[k][j])) que.emplace(res[k][k], make_pair(k,k));\n }\n }\n if(res[N-1][N-1]<INF) cout<<res[N-1][N-1]<<endl;\n else cout<<-1<<endl;\n return ;\n}\n\nsigned main(){\n while(cin>>N>>M, N or M) solve();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3672,"score_of_the_acc":-0.0115,"final_rank":2},{"submission_id":"aoj_1324_5526691","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\nint main(){\n while (true){\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0){\n break;\n }\n vector<int> d(n), e(n);\n d[0] = 0;\n e[0] = 0;\n for (int i = 1; i < n - 1; i++){\n cin >> d[i] >> e[i];\n }\n d[n - 1] = 0;\n e[n - 1] = 1000;\n vector<vector<int>> E(n, vector<int>(n, INF));\n for (int i = 0; i < n; i++){\n E[i][i] = 0;\n }\n for (int i = 0; i < m; i++){\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n E[a][b] = c;\n }\n vector<int> e2 = e;\n sort(e2.begin(), e2.end());\n e2.erase(unique(e2.begin(), e2.end()), e2.end());\n int h = e2.size();\n for (int i = 0; i < n; i++){\n e[i] = lower_bound(e2.begin(), e2.end(), e[i]) - e2.begin();\n }\n vector<vector<int>> id(h);\n for (int i = 0; i < n; i++){\n id[e[i]].push_back(i);\n }\n vector<vector<vector<vector<int>>>> dp(n, vector<vector<vector<int>>>(n, vector<vector<int>>(n, vector<int>(n, INF))));\n for (int i = 0; i < h; i++){\n int cnt = id[i].size();\n for (int j = 0; j < (1 << cnt); j++){\n vector<int> id2;\n int sum = 0;\n for (int k = 0; k < cnt; k++){\n if ((j >> k & 1) == 1){\n id2.push_back(id[i][k]);\n sum += d[id[i][k]];\n }\n }\n int cnt2 = id2.size();\n vector<vector<int>> dp2(cnt2, vector<int>(cnt2, INF));\n for (int k = 0; k < cnt2; k++){\n for (int l = 0; l < cnt2; l++){\n dp2[k][l] = E[id2[k]][id2[l]];\n }\n }\n for (int u = 0; u < cnt2; u++){\n for (int v = 0; v < cnt2; v++){\n for (int w = 0; w < cnt2; w++){\n dp2[v][w] = min(dp2[v][w], dp2[v][u] + dp2[u][w]);\n }\n }\n }\n for (int k1 = 0; k1 < cnt2; k1++){\n for (int l1 = 0; l1 < cnt2; l1++){\n for (int k2 = 0; k2 < cnt2; k2++){\n for (int l2 = 0; l2 < cnt2; l2++){\n dp[id2[k1]][id2[l1]][id2[k2]][id2[l2]] = min(dp[id2[k1]][id2[l1]][id2[k2]][id2[l2]], dp2[k1][l1] + dp2[l2][k2] + sum);\n }\n }\n }\n }\n }\n }\n vector<int> x;\n for (int i = 0; i < h; i++){\n int cnt = id[i].size();\n for (int j = 0; j < cnt; j++){\n x.push_back(id[i][j]);\n }\n }\n vector<vector<int>> dp2(n, vector<int>(n, INF));\n dp2[0][0] = 0;\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n int v = x[i];\n int w = x[j];\n int cnt1 = id[e[v]].size();\n int cnt2 = id[e[w]].size();\n for (int i2 = 0; i2 < cnt1; i2++){\n int v2 = id[e[v]][i2];\n for (int k = 0; k < n; k++){\n if (e[v] < e[k]){\n dp2[k][w] = min(dp2[k][w], dp2[v][w] + dp[v][v2][v][v] + E[v2][k]);\n }\n }\n }\n for (int i2 = 0; i2 < cnt2; i2++){\n int w2 = id[e[w]][i2];\n for (int k = 0; k < n; k++){\n if (e[w] < e[k]){\n dp2[v][k] = min(dp2[v][k], dp2[v][w] + dp[w][w][w][w2] + E[k][w2]);\n }\n }\n }\n if (e[v] == e[w]){\n for (int i2 = 0; i2 < cnt1; i2++){\n for (int j2 = 0; j2 < cnt2; j2++){\n int v2 = id[e[v]][i2];\n int w2 = id[e[w]][j2];\n for (int k = 0; k < n; k++){\n for (int l = 0; l < n; l++){\n if (e[v] < e[k] && e[w] < e[l]){\n dp2[k][l] = min(dp2[k][l], dp2[v][w] + dp[v][v2][w][w2] + E[v2][k] + E[l][w2]);\n }\n }\n }\n }\n }\n }\n }\n }\n if (dp2[n - 1][n - 1] == INF){\n cout << -1 << endl;\n } else {\n cout << dp2[n - 1][n - 1] << endl;\n }\n }\n}","accuracy":1,"time_ms":450,"memory_kb":32032,"score_of_the_acc":-0.504,"final_rank":11},{"submission_id":"aoj_1324_5048249","code_snippet":"#include<cstdio>\n#include<vector>\n#include<map>\n#include<set>\n#include<queue>\n#include<algorithm>\nusing namespace std;\nusing P = pair<int, int>;\nusing Q = pair<int, P>;\nconst int INF = 1000000000;\n\nint n, m, d, f, a, b, c, towncost[50], dp[50][50], tmp2[50][50], tmp[50][50];\nvector<P> e[50], re[50];\nmap<int, vector<int>> mp;\nvector<int> used;\nset<int> can_use;\n\nint get(int a, int b, bool is_a_top, bool is_b_top) {\n vector<P> A, B;\n A.push_back(P(a, 0)); B.push_back(P(b, 0));\n int ans = INF;\n for (P i : (is_a_top ? re[a] : A)) if (can_use.count(i.first)) {\n for (P j : (is_b_top ? e[b] : B)) if (can_use.count(j.first)) {\n ans = min(ans, dp[i.first][j.first] + i.second + j.second);\n }\n }\n return ans;\n}\n\nint main() {\n while (scanf(\"%d%d\", &n, &m), n) {\n mp.clear();\n used.clear();\n can_use.clear();\n for (int i = 0; i < 50; i++) {\n e[i].clear();\n re[i].clear();\n for (int j = 0; j < 50; j++) {\n dp[i][j] = INF;\n }\n }\n dp[0][0] = 0;\n for (int i = 1; i < n-1; i++) {\n scanf(\"%d%d\", &d, &f);\n towncost[i] = d;\n mp[f].push_back(i);\n }\n towncost[0] = towncost[n-1] = 0;\n for (int i = 0; i < m; i++) {\n scanf(\"%d%d%d\", &a, &b, &c);\n a--; b--;\n e[a].push_back(P(b, c));\n re[b].push_back(P(a, c));\n }\n mp[1000].push_back(n-1);\n used.push_back(0);\n can_use.insert(0);\n for (auto it = mp.begin(); it != mp.end(); it++) {\n vector<int> v = it->second;\n map<int, int> r;\n for (int i = 0; i < v.size(); i++) r[v[i]] = i;\n for (int i : used) for (int j : used) tmp[i][j] = dp[i][j];\n for (int i : used) for (int j : v) {\n tmp[i][j] = get(i, j, false, true);\n }\n for (int i : v) for (int j : used) {\n tmp[i][j] = get(i, j, true, false);\n }\n for (int i : v) for (int j : v) {\n tmp[i][j] = get(i, j, true, true);\n }\n for (int i : v) used.push_back(i), can_use.insert(i);\n for (int i = 1; i < (1 << v.size()); i++) {\n int sum = 0;\n for (int j = 0; j < v.size(); j++) if (i & (1 << j)) {\n sum += towncost[v[j]];\n }\n priority_queue<Q> que;\n for (int j : used) {\n for (int k : used) {\n if ((r.count(j) == 0 || (i & (1 << r[j]))) && (r.count(k) == 0 || (i & (1 << r[k])))) {\n tmp2[j][k] = tmp[j][k];\n que.push(Q(tmp2[j][k], P(j, k)));\n } else {\n tmp2[j][k] = INF;\n }\n }\n }\n while (!que.empty()) {\n Q q = que.top(); que.pop();\n int cost = q.first, j = q.second.first, k = q.second.second;\n if (tmp2[j][k] < cost) continue;\n dp[j][k] = min(dp[j][k], cost + sum);\n for (P l : e[j]) if (r.count(l.first) && (i & (1 << r[l.first]))) {\n int newcost = cost + l.second;\n if (tmp2[l.first][k] > newcost) {\n tmp2[l.first][k] = newcost;\n que.push(Q(newcost, P(l.first, k)));\n }\n }\n for (P l : re[k]) if (r.count(l.first) && (i & (1 << r[l.first]))) {\n int newcost = cost + l.second;\n if (tmp2[j][l.first] > newcost) {\n tmp2[j][l.first] = newcost;\n que.push(Q(newcost, P(j, l.first)));\n }\n }\n }\n }\n }\n if (dp[n-1][n-1] == INF) dp[n-1][n-1] = -1;\n printf(\"%d\\n\", dp[n-1][n-1]);\n }\n}","accuracy":1,"time_ms":5350,"memory_kb":2908,"score_of_the_acc":-0.792,"final_rank":16},{"submission_id":"aoj_1324_4943293","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <cfloat>\n#include <climits>\n#include <algorithm>\n#include <iomanip>\n#include <queue>\n#include <unordered_map>\n#include <string>\n#include <tuple>\nstruct Road {\n\tint to, cost;\n};\nstruct Town {\n\tint visit_cost, altitude;\n};\nstruct State {\n\tint go_pos, return_pos, cost;\n\tunsigned long long int visited;\n};\nint main() {\n\twhile (true) {\n\t\tint n, m; std::cin >> n >> m;\n\t\tif (n == 0 && m == 0) break;\n\t\tstd::vector<Town> towns(n);\n\t\ttowns[0].altitude = 0; towns.back().altitude = 1000;\n\t\tfor (auto i = 1; i < n - 1; ++i) {\n\t\t\tstd::cin >> towns[i].visit_cost >> towns[i].altitude;\n\t\t}\n\t\tstd::vector<std::vector<Road>> road(n), rev_road(n);\n\t\tfor (auto i = 0; i < m; ++i) {\n\t\t\tint a, b, c; std::cin >> a >> b >> c; --a; --b;\n\t\t\tif (towns[a].altitude <= towns[b].altitude) road[a].push_back(Road{ b, c });\n\t\t\tif (towns[b].altitude <= towns[a].altitude) rev_road[b].push_back(Road{ a, c });\n\t\t}\n\t\tstd::vector<std::vector<std::unordered_map<unsigned long long int, int>>> min_cost(n, std::vector<std::unordered_map<unsigned long long int, int>>(n));\n\t\tconst auto comparator = [](const State& a, const State& b) {return a.cost > b.cost; };\n\t\tstd::priority_queue<State, std::vector<State>, decltype(comparator)> queue(comparator);\n\t\tmin_cost[0][0][0] = 0;\n\t\tqueue.push(State{ 0, 0, 0, 0 });\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.top(); queue.pop();\n\t\t\tif (min_cost[top.go_pos][top.return_pos][top.visited] < top.cost) continue;\n\t\t\tconst auto max_height = std::max(towns[top.go_pos].altitude, towns[top.return_pos].altitude);\n\t\t\tif (towns[top.return_pos].altitude == max_height) for (const auto r : road[top.go_pos]) {\n\t\t\t\tconst auto visited = towns[r.to].altitude < max_height ? top.visited : (towns[r.to].altitude == max_height ? top.visited | (1ULL << r.to) : (1ULL << r.to));\n\t\t\t\tconst auto cost = r.cost + top.cost + (top.visited & (1ULL << r.to) ? 0 : towns[r.to].visit_cost);\n\t\t\t\tconst auto find = min_cost[r.to][top.return_pos].find(visited);\n\t\t\t\tif (find == min_cost[r.to][top.return_pos].end() || find->second > cost) {\n\t\t\t\t\tmin_cost[r.to][top.return_pos][visited] = cost;\n\t\t\t\t\tqueue.push(State{ r.to, top.return_pos, cost, visited });\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (towns[top.go_pos].altitude == max_height) for (const auto r : rev_road[top.return_pos]) {\n\t\t\t\tconst auto visited = towns[r.to].altitude < max_height ? top.visited : (towns[r.to].altitude == max_height ? top.visited | (1ULL << r.to) : (1ULL << r.to));\n\t\t\t\tconst auto cost = r.cost + top.cost + (top.visited & (1ULL << r.to) ? 0 : towns[r.to].visit_cost);\n\t\t\t\tconst auto find = min_cost[top.go_pos][r.to].find(visited);\n\t\t\t\tif (find == min_cost[top.go_pos][r.to].end() || find->second > cost) {\n\t\t\t\t\tmin_cost[top.go_pos][r.to][visited] = cost;\n\t\t\t\t\tqueue.push(State{ top.go_pos, r.to, cost, visited });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst auto min = std::min_element(min_cost.back().back().begin(), min_cost.back().back().end(), [](const std::pair<unsigned long long int, int>& a, const std::pair<unsigned long long int, int>& b) {return a.second < b.second; });\n\t\tif (min == min_cost.back().back().end()) {\n\t\t\tstd::cout << \"-1\\n\";\n\t\t}\n\t\telse {\n\t\t\tstd::cout << min->second << '\\n';\n\t\t}\n\t}\n}","accuracy":1,"time_ms":260,"memory_kb":10540,"score_of_the_acc":-0.151,"final_rank":7},{"submission_id":"aoj_1324_4924144","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\nconst int inf = 1e9;\n\nstruct state{\n int s,t;\n int mask;\n int d;\n state(int s, int t, int mask, int d):s(s),t(t),mask(mask),d(d){}\n state(){}\n bool operator <(const state &a) const{\n return d > a.d;\n }\n};\nint solve(vector<int> &v, vector<int> &h, vector<vector<pair<int,int>>> &gs, vector<vector<pair<int,int>>> >){\n int n = gs.size();\n vector<int> mapping(n);\n vector<int> idx(1001, 0);\n for(int i=0; i<n; i++){\n mapping[i] = idx[h[i]]++;\n }\n vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>(2<<10, inf)));\n dp[0][0][1<<mapping[0]] = 0;\n priority_queue<state> wait;\n wait.push(state(0, 0, 1<<mapping[0], 0));\n while(!wait.empty()){\n int s = wait.top().s;\n int t = wait.top().t;\n int mask = wait.top().mask;\n int d = wait.top().d;\n wait.pop();\n if(d > dp[s][t][mask]) continue;\n if(h[s] <= h[t]){\n for(auto next: gs[s]){\n int ns = next.first;\n int nd = d +next.second +v[ns];\n int nmask = mask;\n if(h[ns] == h[t]){\n if(mask>>mapping[ns]&1){\n nd -= v[ns];\n }\n nmask |= 1<<mapping[ns];\n }else if(h[ns] > h[t]){\n nmask = 1<<mapping[ns];\n }\n if(nd < dp[ns][t][nmask]){\n dp[ns][t][nmask] = nd;\n wait.push(state(ns, t, nmask, nd));\n }\n }\n }\n if(h[t] <= h[s]){\n for(auto next: gt[t]){\n int nt = next.first;\n int nd = d +next.second +v[nt];\n int nmask = mask;\n if(h[nt] == h[s]){\n if(mask>>mapping[nt]&1){\n nd -= v[nt];\n }\n nmask |= 1<<mapping[nt];\n }else if(h[nt] > h[s]){\n nmask = 1<<mapping[nt];\n }\n if(nd < dp[s][nt][nmask]){\n dp[s][nt][nmask] = nd;\n wait.push(state(s, nt, nmask, nd));\n }\n }\n }\n }\n int res = *min_element(dp[n-1][n-1].begin(), dp[n-1][n-1].end());\n if(res == inf) return -1;\n return res;\n}\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n == 0) break;\n\n vector<int> d(n), e(n);\n d[0] = d[n-1] = 0;\n e[0] = 0;\n e[n-1] = 1000;\n for(int i=1; i<n-1; i++){\n cin >> d[i] >> e[i];\n }\n vector<vector<pair<int,int>>> adj(n), rev(n);\n for(int i=0; i<m; i++){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n if(e[a] <= e[b]) adj[a].emplace_back(b, c);\n if(e[a] >= e[b]) rev[b].emplace_back(a, c);\n }\n cout << solve(d, e, adj, rev) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":26352,"score_of_the_acc":-0.3811,"final_rank":10},{"submission_id":"aoj_1324_4837149","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,int> LP;\nconst int INF=1e8+7;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nvector<vector<int>> path;\nvector<P> va;\nint t[100][2];\ntypedef vector<int> V1;\ntypedef vector<vector<int>> V2;\ntypedef vector<vector<vector<int>>> V3;\nconst int dis_n=20;\nint dis[dis_n][dis_n][dis_n][dis_n];\n\nvoid memset_dis(){\n int a,b,c,d;\n for(a=0;a<dis_n;a++){\n for(b=0;b<dis_n;b++){\n for(c=0;c<dis_n;c++){\n for(d=0;d<dis_n;d++){\n dis[a][b][c][d]=INF;\n }\n }\n }\n }\n}\n\nvoid check(int ta,int tb,vector<int>& v1){\n if(ta<=tb){\n v1.push_back(tb-ta);\n check(ta,tb-1,v1);\n v1.pop_back();\n check(ta,tb-1,v1);\n return;\n }\n if(v1.empty())return;\n int n=v1.size();\n int i,j,k,l;\n int a,b,c,d;\n int s;\n vector<vector<int>> dis_temp(n,vector<int>(n,INF));\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n a=ta+v1[i],b=ta+v1[j];\n dis_temp[i][j]=path[a][b];\n }\n }\n for(k=0;k<n;k++){\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n dis_temp[i][j]=min(dis_temp[i][j],dis_temp[i][k]+dis_temp[k][j]);\n }\n }\n }\n s=0;\n for(i=0;i<n;i++){\n s+=t[ta+v1[i]][0];\n }\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n for(k=0;k<n;k++){\n for(l=0;l<n;l++){\n a=v1[i],b=v1[j],c=v1[k],d=v1[l];\n dis[a][b][c][d]=min(dis[a][b][c][d],s+dis_temp[i][k]+dis_temp[j][l]);\n }\n }\n }\n }\n}\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c,d;\n int x,y;\n while(cin>>n>>m){\n if(!n)break;\n path.assign(n,vector<int>(n,INF));\n va.assign(1e3+7,P(n+10,-1));\n vector<tuple<int,int,int>> vt1;\n vector<int> v1(n);\n V2 dp(n+10,V1(n+10,INF));\n vt1.push_back(make_tuple(0,0,0));\n vt1.push_back(make_tuple(1e3,0,n-1));\n for(i=1;i<n-1;i++){\n cin>>a>>b;\n vt1.push_back(make_tuple(b,a,i));\n }\n sort(vt1.begin(),vt1.end());\n for(i=0;i<n;i++){\n tie(a,b,c)=vt1[i];\n v1[c]=i;\n va[a].first=min(va[a].first,i);\n va[a].second=max(va[a].second,i);\n t[i][0]=b,t[i][1]=a;\n }\n t[n-1][1]=1e3;\n for(i=0;i<m;i++){\n cin>>a>>b>>c;\n a--,b--;\n a=v1[a],b=v1[b];\n path[a][b]=min(path[a][b],c);\n }\n for(i=0;i<n;i++){\n path[i][i]=0;\n }\n dp[0][0]=0;\n for(i=0;i<=1e3;i++){\n if(va[i].first>n)continue;\n memset_dis();\n v1.clear();\n x=va[i].first,y=va[i].second;\n check(x,y,v1);\n m=y-x+1;\n vector<vector<int>> dp_temp(m+10,vector<int>(m+10,INF));\n for(j=0;j<m;j++){\n for(k=0;k<m;k++){\n for(a=0;a<x;a++){\n if(path[a][x+j]==INF)continue;\n for(b=0;b<x;b++){\n if(path[x+k][b]==INF)continue;\n dp_temp[j][k]=min(dp_temp[j][k],dp[a][b]+path[a][x+j]+path[x+k][b]);\n }\n }\n }\n }\n for(j=0;j<m;j++){\n for(k=0;k<m;k++){\n for(a=0;a<m;a++){\n for(b=0;b<m;b++){\n dp[x+a][x+b]=min(dp[x+a][x+b],dp_temp[j][k]+dis[j][b][a][k]);\n }\n }\n }\n }\n for(j=0;j<=y;j++){\n for(a=0;a<x;a++){\n for(b=0;b<m;b++){\n for(c=0;c<m;c++){\n dp[j][x+c]=min(dp[j][x+c],dp[j][a]+path[x+b][a]+dis[b][c][b][b]);\n dp[x+c][j]=min(dp[x+c][j],dp[a][j]+path[a][x+b]+dis[b][b][c][b]);\n }\n }\n }\n }\n }\n int s=dp[n-1][n-1];\n if(s>=INF)s=-1;\n cout<<s<<endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3724,"score_of_the_acc":-0.0198,"final_rank":4},{"submission_id":"aoj_1324_4767320","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353/100;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1.0);\n\nll mod_pow(ll x, ll n, ll m) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1 << 22;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nusing speP = pair<int, P>;\nint cost[50][50];\nint dist[50][50];\n\nint swcost[50][50];\nint n, m;\nvoid solve() {\n\tvector<int> d(n), h(n);\n\trep(i, n) {\n\t\tif (i == 0) {\n\t\t\td[i] = 0, h[i] = 0;\n\t\t}\n\t\telse if (i == n - 1) {\n\t\t\td[i] = 0, h[i] = 1000;\n\t\t}\n\t\telse {\n\t\t\tcin >> d[i] >> h[i];\n\t\t}\n\t}\n\trep(i, n)rep(j, n) {\n\t\tif (i == j)cost[i][j] = 0;\n\t\telse cost[i][j] = mod;\n\t}\n\trep(i, m) {\n\t\tint a, b, c; cin >> a >> b >> c; a--; b--;\n\t\tcost[a][b] = c;\n\t}\n\trep(i, n) {\n\t\trep(j, n) {\n\t\t\tswcost[i][j] = mod;\n\t\t}\n\t\tswcost[i][i] = d[i];\n\t\tpriority_queue<P, vector<P>, greater<P>> q;\n\t\tq.push({ d[i],i });\n\t\twhile (!q.empty()) {\n\t\t\tP p = q.top(); q.pop();\n\t\t\tint id = p.second;\n\t\t\tif (swcost[i][id] < p.first)continue;\n\t\t\trep(to, n) {\n\t\t\t\tif (h[id] != h[to])continue;\n\t\t\t\tint nd = p.first + d[to] + 2 * cost[id][to];\n\t\t\t\tif (nd < swcost[i][to]) {\n\t\t\t\t\tswcost[i][to] = nd;\n\t\t\t\t\tq.push({ nd,to });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(j, n) {\n\t\t\tswcost[i][j] -= d[i] + d[j];\n\t\t}\n\t}\n\n\trep(i, n)rep(j, n)dist[i][j] = mod;\n\tdist[0][0] = 0;\n\tpriority_queue<speP, vector<speP>, greater<speP>> q;\n\tq.push({ 0,{0,0} });\n\twhile (!q.empty()) {\n\t\tspeP p = q.top(); q.pop();\n\t\tint x = p.second.first, y = p.second.second;\n\t\tif (dist[x][y] < p.first)continue;\n\t\trep(nx, n) {\n\t\t\tif (h[x] > h[nx])continue;\n\t\t\tint s = p.first + cost[x][nx] + d[nx];\n\t\t\tif (s < dist[nx][y]) {\n\t\t\t\tdist[nx][y] = s;\n\t\t\t\tq.push({ s,{nx,y} });\n\t\t\t}\n\t\t}\n\t\trep(ny, n) {\n\t\t\tif (h[y] > h[ny])continue;\n\t\t\tint s = p.first + cost[ny][y] + d[ny];\n\t\t\tif (s < dist[x][ny]) {\n\t\t\t\tdist[x][ny] = s;\n\t\t\t\tq.push({ s,{x,ny} });\n\t\t\t}\n\t\t}\n\t\tif (h[x] == h[y]&&x!=y) {\n\t\t\tint s = p.first + swcost[x][y];\n\t\t\tif (s < dist[y][x]) {\n\t\t\t\tdist[y][x] = s;\n\t\t\t\tq.push({ s,{y,x} });\n\t\t\t}\n\t\t}\n\t\trep(nx, n)rep(ny, n) {\n\t\t\tif (h[x] > h[nx] || h[y] > h[ny])continue;\n\t\t\tint s = p.first + cost[x][nx] + cost[ny][y] + d[nx] + d[ny];\n\t\t\tif (nx == ny)s -= d[nx];\n\t\t\tif (s < dist[nx][ny]) {\n\t\t\t\t//cout << \"? \" << x << \" \" << y << \" \" << nx << \" \" << ny << \" \" << s << \"\\n\";\n\t\t\t\tdist[nx][ny] = s;\n\t\t\t\tq.push({ s,{nx,ny} });\n\t\t\t}\n\t\t}\n\t}\n\t/*rep(i, n) {\n\t\trep(j, n)cout << dist[i][j] << \" \";\n\t\tcout << \"\\n\";\n\t}*/\n\t//cout << dist[1][2]<<\" \"<<swcost[1][2] << \"\\n\";\n\tint ans = dist[n - 1][n - 1];\n\tif (ans == mod)cout << -1 << \"\\n\";\n\telse cout << ans << \"\\n\";\n}\n\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(10);\n\t//init_f();\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\twhile (cin >> n >> m, n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":69076,"score_of_the_acc":-1.0134,"final_rank":17},{"submission_id":"aoj_1324_4248759","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#include <cstdint>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n#define MP make_pair\n#define PB push_back\n#define inf 1000000007\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define all(x) (x).begin(),(x).end()\n\ntemplate<typename A, size_t N, typename T>\nvoid Fill(A (&array)[N], const T &val){\n std::fill( (T*)array, (T*)(array+N), val );\n}\n \ntemplate<class T> inline bool chmax(T &a, T b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T> inline bool chmin(T &a, T b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\n\nint dp[51][51][1<<10];\n\nint main(){\n int n,m;\n while(1){\n cin >> n >> m;\n if(n==0)break;\n vector<int>h(n);\n map<int,int> ss;\n vector<int> num(n);\n vector<int> c(n);\n rep(i,n-2){\n cin >> c[i+1] >> h[i+1];\n num[i+1] = ss[h[i+1]];\n ss[h[i+1]]++;\n }\n rep(i,n)rep(j,n)rep(k,1<<10)dp[i][j][k] = inf;\n h[0] = 0;\n h[n-1] = 1000;\n vector<vector<pii> > gu(n);\n vector<vector<pii> > gd(n);\n vector<vector<pii> > u(n);\n vector<vector<pii> > d(n);\n rep(i,m){\n int a,b,e;\n cin >> a >> b >> e;\n a--;b--;\n if(h[a]==h[b]){\n gu[a].push_back(MP(b,e));\n gd[b].push_back(MP(a,e));\n u[a].push_back(MP(b,e));\n d[b].push_back(MP(a,e));\n }else if(h[a]<h[b]){\n u[a].push_back(MP(b,e));\n }else{\n d[b].push_back(MP(a,e));\n }\n }\n priority_queue<pair<pii,pair<int,int>>,vector<pair<pair<int,int>,pii>>,greater<pair<pair<int,int>,pii>> >pq;\n dp[0][0][1] = 0;\n pq.push(MP(MP(0,1),MP(0,0)));\n while(!pq.empty()){\n auto x = pq.top();\n pq.pop();\n int a = x.second.first;\n int b = x.second.second;\n int cost = x.first.first;\n int reach = x.first.second;\n if(dp[a][b][reach]!=cost)continue;\n // cerr << a << \" \" << b << \" \" << cost << \" \" << reach << endl;\n if(h[a]<=h[b]){\n for(auto x:u[a]){\n int nxt = x.first;\n int dd = cost + x.second;\n int nxtreach = reach;\n if(h[nxt]<h[b]){\n dd += c[nxt];\n if(chmin(dp[nxt][b][nxtreach],dd)){\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\n }\n }else if(h[nxt]>h[b]){\n dd += c[nxt];\n nxtreach = (1<<num[nxt]);\n if(chmin(dp[nxt][b][nxtreach],dd)){\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\n }\n }else{\n if(nxt!=b){\n dd += c[nxt];\n nxtreach = reach|(1<<num[nxt]);\n }\n if(chmin(dp[nxt][b][nxtreach],dd)){\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\n }\n }\n }\n }\n if(h[b]<=h[a]){\n for(auto x:d[b]){\n int nxt = x.first;\n int dd = cost + x.second;\n int nxtreach = reach;\n if(h[nxt]<h[a]){\n dd += c[nxt];\n if(chmin(dp[a][nxt][nxtreach],dd)){\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\n }\n }else if(h[nxt]>h[a]){\n dd += c[nxt];\n nxtreach = (1<<num[nxt]);\n if(chmin(dp[a][nxt][nxtreach],dd)){\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\n }\n }else{\n if(nxt!=a){\n dd += c[nxt];\n nxtreach = reach|(1<<num[nxt]);\n }\n if(chmin(dp[a][nxt][nxtreach],dd)){\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\n }\n }\n }\n }\n if(h[a]==h[b]){\n for(auto x:gu[a]){\n int nxt = x.first;\n int dd = cost + x.second;\n int nxtreach = reach;\n \n if(((reach>>num[nxt])&1)==0){\n dd += c[nxt];\n nxtreach = reach|(1<<num[nxt]);\n }\n if(chmin(dp[nxt][b][nxtreach],dd)){\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\n }\n \n }\n for(auto x:gd[b]){\n int nxt = x.first;\n int dd = cost + x.second;\n int nxtreach = reach;\n \n if(((reach>>num[nxt])&1)==0){\n dd += c[nxt];\n nxtreach = reach|(1<<num[nxt]);\n }\n if(chmin(dp[a][nxt][nxtreach],dd)){\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\n }\n \n }\n }\n }\n if(dp[n-1][n-1][1]==inf){\n cout << -1 << endl;\n }else{\n cout << dp[n-1][n-1][1] << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":15108,"score_of_the_acc":-0.2096,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_1324_10858211\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<cmath>\\n#include<algorithm>\\n#include<iostream>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<string>\\nusing namespace std;\\n#define INF 199999999\\n#define eps 1e-8\\nint n,m;\\nstruct node\\n{\\n int en;\\n int cost;\\n};\\nvector<node>g[55];\\nint fee[55];\\nint hig[55];\\nint dis[55][55];\\nint dis_go[55][55];\\nint dis_back[55][55];\\nlong long v[55][55],v_go[55][55],v_back[55][55];\\nbool in[55];\\nlong long pw[55];\\nvoid spfa1(int root,int dis[],long long v[])\\n{\\n queue<int>q;\\n q.push(root);\\n for(int i=1;i<=n;i++)\\n {\\n dis[i]=INF;\\n v[i]=0;\\n in[i]=0;\\n }\\n in[root]=1;\\n dis[root]=0;\\n v[root]=pw[root];\\n while(!q.empty())\\n {\\n int now=q.front();\\n q.pop();\\n in[now]=0;\\n for(int i=0;i<g[now].size();i++)\\n {\\n int temp=g[now][i].en;\\n if(hig[temp]<hig[now]) continue;\\n if(dis[temp]>dis[now]+g[now][i].cost+fee[temp])\\n {\\n dis[temp]=dis[now]+g[now][i].cost+fee[temp];\\n v[temp]=v[now]|pw[temp];\\n if(!in[temp])\\n {\\n q.push(temp);\\n in[temp]=1;\\n }\\n }\\n }\\n }\\n}\\nvoid spfa2(int root,int dis[],long long v[])\\n{\\n queue<int>q;\\n q.push(root);\\n for(int i=1;i<=n;i++)\\n {\\n dis[i]=INF;\\n v[i]=0;\\n in[i]=0;\\n }\\n in[root]=1;\\n dis[root]=0;\\n v[root]=pw[root];\\n while(!q.empty())\\n {\\n int now=q.front();\\n q.pop();\\n in[now]=0;\\n for(int i=0;i<g[now].size();i++)\\n {\\n int temp=g[now][i].en;\\n if(hig[temp]>hig[now]) continue;\\n if(dis[temp]>dis[now]+g[now][i].cost+fee[temp])\\n {\\n dis[temp]=dis[now]+g[now][i].cost+fee[temp];\\n v[temp]=v[now]|pw[temp];\\n if(!in[temp])\\n {\\n q.push(temp);\\n in[temp]=1;\\n }\\n }\\n }\\n }\\n}\\n\\nvoid floyd()\\n{\\n for(int k=1;k<=n;k++)\\n {\\n for(int i=1;i<=n;i++)\\n {\\n for(int j=1;j<=n;j++)\\n {\\n if(k==i||i==j||k==j) continue;\\n int now=dis[i][k]+dis[k][j];\\n long long now_v=v[i][k]&v[k][j];\\n for(int l=1;l<=n;l++)\\n if(now_v&pw[l]) now-=fee[l];\\n dis[i][j]=min(dis[i][j],now);\\n }\\n }\\n }\\n if(dis[1][n]<INF) printf(\\\"%d\\\\n\\\",dis[1][n]);\\n else printf(\\\"-1\\\\n\\\");\\n}\\nvoid ini()\\n{\\n for(int i=1;i<=n;i++) g[i].clear();\\n}\\nint main()\\n{\\n pw[1]=1;\\n for(int i=2;i<=50;i++) pw[i]=pw[i-1]*2;\\n while(1)\\n {\\n scanf(\\\"%d%d\\\",&n,&m);\\n ini();\\n if(n==0&&m==0) break;\\n fee[1]=fee[n]=0;\\n hig[1]=0;\\n hig[n]=1000;\\n for(int i=2;i<n;i++) scanf(\\\"%d%d\\\",fee+i,hig+i);\\n for(int i=0;i<m;i++)\\n {\\n int a,b,c;\\n scanf(\\\"%d%d%d\\\",&a,&b,&c);\\n node temp;\\n temp.en=b;\\n temp.cost=c;\\n g[a].push_back(temp);\\n }\\n for(int i=1;i<=n;i++)\\n {\\n spfa1(i,dis_go[i],v_go[i]);\\n spfa2(i,dis_back[i],v_back[i]);\\n }\\n for(int i=1;i<=n;i++)\\n {\\n for(int j=1;j<=n;j++)\\n {\\n // if(i==j) continue;\\n dis[i][j]=dis_go[i][j]+dis_back[j][i];\\n v[i][j]=v_go[i][j]|v_back[j][i];\\n }\\n }\\n floyd();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.014,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1324_10240139\",\n \"code_snippet\": \"#include <queue>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nstruct city {\\n\\tint cost, height;\\n};\\n\\nstruct edge {\\n\\tint s, t, w;\\n};\\n\\nstruct state {\\n\\tint vs, vt, bit, d;\\n\\tbool operator<(const state& s) const {\\n\\t\\treturn d > s.d;\\n\\t}\\n};\\n\\nint solve(int N, int M, const vector<city>& P, const vector<edge>& E) {\\n\\t// step #1. preparation\\n\\tvector<vector<edge> > G1(N), G2(N), G3(N), G4(N);\\n\\tfor (edge e : E) {\\n\\t\\tedge erev = edge{e.t, e.s, e.w};\\n\\t\\tint h = P[e.t].height - P[e.s].height;\\n\\t\\tif (h > 0) {\\n\\t\\t\\tG1[e.s].push_back(e);\\n\\t\\t}\\n\\t\\tif (h < 0) {\\n\\t\\t\\tG2[e.t].push_back(erev);\\n\\t\\t}\\n\\t\\tif (h == 0) {\\n\\t\\t\\tG3[e.s].push_back(e);\\n\\t\\t\\tG4[e.t].push_back(erev);\\n\\t\\t}\\n\\t}\\n\\tvector<int> height_cnt(P[N - 1].height + 1, 0);\\n\\tvector<int> index(N, -1);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tindex[i] = height_cnt[P[i].height]++;\\n\\t}\\n\\tint max_cnt = *max_element(height_cnt.begin(), height_cnt.end());\\n\\n\\t// step #2. dijkstra: preparation\\n\\tpriority_queue<state> que;\\n\\tvector<vector<vector<int> > > d(N, vector<vector<int> >(N, vector<int>(1 << max_cnt, INF)));\\n\\tauto push = [&](state z) -> void {\\n\\t\\tif (P[z.vs].height <= P[z.vt].height) {\\n\\t\\t\\tif (!((z.bit >> index[z.vs]) & 1)) {\\n\\t\\t\\t\\tz.bit |= 1 << index[z.vs];\\n\\t\\t\\t\\tz.d += P[z.vs].cost;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (P[z.vs].height >= P[z.vt].height) {\\n\\t\\t\\tif (!((z.bit >> index[z.vt]) & 1)) {\\n\\t\\t\\t\\tz.bit |= 1 << index[z.vt];\\n\\t\\t\\t\\tz.d += P[z.vt].cost;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (d[z.vs][z.vt][z.bit] > z.d) {\\n\\t\\t\\td[z.vs][z.vt][z.bit] = z.d;\\n\\t\\t\\tque.push(z);\\n\\t\\t}\\n\\t};\\n\\tpush(state{0, 0, 0, 0});\\n\\n\\t// step #3. dijkstra: main\\n\\twhile (!que.empty()) {\\n\\t\\tstate z = que.top();\\n\\t\\tque.pop();\\n\\t\\tif (d[z.vs][z.vt][z.bit] == z.d) {\\n\\t\\t\\t// case 1: move to the same height\\n\\t\\t\\tint base_h = P[z.vt].height - P[z.vs].height;\\n\\t\\t\\tif (base_h >= 0) {\\n\\t\\t\\t\\tfor (edge e : G3[z.vs]) {\\n\\t\\t\\t\\t\\tpush(state{e.t, z.vt, z.bit, z.d + e.w});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (base_h <= 0) {\\n\\t\\t\\t\\tfor (edge e : G4[z.vt]) {\\n\\t\\t\\t\\t\\tpush(state{z.vs, e.t, z.bit, z.d + e.w});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// case 2: move to the new height\\n\\t\\t\\tif (base_h > 0) {\\n\\t\\t\\t\\tfor (edge e : G1[z.vs]) {\\n\\t\\t\\t\\t\\tpush(state{e.t, z.vt, 0, z.d + e.w});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (base_h < 0) {\\n\\t\\t\\t\\tfor (edge e : G2[z.vt]) {\\n\\t\\t\\t\\t\\tpush(state{z.vs, e.t, 0, z.d + e.w});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (base_h == 0) {\\n\\t\\t\\t\\tfor (edge e1 : G1[z.vs]) {\\n\\t\\t\\t\\t\\tfor (edge e2 : G2[z.vt]) {\\n\\t\\t\\t\\t\\t\\tpush(state{e1.t, e2.t, 0, z.d + e1.w + e2.w});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// step #4. compute answer\\n\\tint ans = d[N - 1][N - 1][1];\\n\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<city> X(N);\\n\\t\\tfor (int i = 1; i < N - 1; i++) {\\n\\t\\t\\tcin >> X[i].cost >> X[i].height;\\n\\t\\t}\\n\\t\\tX[0] = city{0, 0};\\n\\t\\tX[N - 1] = city{0, 1000};\\n\\t\\tvector<edge> E(M);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tcin >> E[i].s >> E[i].t >> E[i].w;\\n\\t\\t\\tE[i].s--;\\n\\t\\t\\tE[i].t--;\\n\\t\\t}\\n\\t\\tint ans = solve(N, M, X, E);\\n\\t\\tcout << (ans != INF ? ans : -1) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 32596,\n \"score_of_the_acc\": -0.6344,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1324_10238769\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct City {\\n int cost;\\n int height;\\n};\\n\\nint N; City T[59];\\nint M, C[59][59];\\nint dist_go[59][59];\\nint dist_ba[59][59];\\nint dp[59][59][59];\\nint dp2[59][59];\\nint kari_dp[59][59];\\n\\nvoid Initialize() {\\n for (int i = 0; i < 59; i++) {\\n T[i].cost = 0; T[i].height = 0;\\n for (int j = 0; j < 59; j++) {\\n dist_go[i][j] = (1 << 29);\\n dist_ba[i][j] = (1 << 29);\\n C[i][j] = (1 << 29);\\n dp2[i][j] = (1 << 29);\\n kari_dp[i][j] = (1 << 29);\\n for (int k = 0; k < 59; k++) dp[i][j][k] = (1 << 29);\\n }\\n }\\n}\\n\\nint Solve() {\\n Initialize();\\n\\n // Step 1. Input\\n cin >> N >> M; if (N + M == 0) return -2;\\n for (int i = 2; i <= N - 1; i++) cin >> T[i].cost >> T[i].height;\\n for (int i = 1; i <= M; i++) {\\n int a, b, c; cin >> a >> b >> c;\\n C[a][b] = min(C[a][b], c);\\n }\\n T[1] = City{0, 0};\\n T[N] = City{0, 1000};\\n\\n // Step 2. Compression\\n vector<int> Zahyou;\\n for (int i = 1; i <= N; i++) Zahyou.push_back(T[i].height);\\n sort(Zahyou.begin(), Zahyou.end());\\n Zahyou.erase(unique(Zahyou.begin(), Zahyou.end()), Zahyou.end());\\n for (int i = 1; i <= N; i++) T[i].height = lower_bound(Zahyou.begin(), Zahyou.end(), T[i].height) - Zahyou.begin();\\n\\n // Step 3. DP Init\\n dp[0][1][1] = 0;\\n\\n // Step 4. Get Shortest Distance\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n if (T[i].height <= T[j].height) dist_go[i][j] = C[i][j] + T[j].cost;\\n if (T[j].height <= T[i].height) dist_ba[j][i] = C[i][j] + T[i].cost;\\n }\\n }\\n for (int k = 1; k <= N; k++) {\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n dist_go[i][j] = min(dist_go[i][j], dist_go[i][k] + dist_go[k][j]);\\n dist_ba[i][j] = min(dist_ba[i][j], dist_ba[i][k] + dist_ba[k][j]);\\n }\\n }\\n }\\n\\n // Step 5. DP Main\\n for (int h = 1; h < Zahyou.size(); h++) {\\n vector<int> city_list;\\n for (int i = 1; i <= N; i++) {\\n if (T[i].height == h) city_list.push_back(i);\\n }\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n dp[h][i][j] = min(dp[h][i][j], dp[h - 1][i][j]);\\n for (int idx : city_list) {\\n dp[h][idx][j] = min(dp[h][idx][j], dp[h - 1][i][j] + dist_go[i][idx]);\\n dp[h][i][idx] = min(dp[h][i][idx], dp[h - 1][i][j] + dist_ba[j][idx]);\\n }\\n }\\n }\\n\\n // Both Move\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) dp2[i][j] = (1 << 29);\\n }\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n for (int idx_i : city_list) {\\n for (int idx_j : city_list) {\\n dp2[idx_i][idx_j] = min(dp2[idx_i][idx_j], dp[h - 1][i][j] + C[i][idx_i] + C[idx_j][j]);\\n }\\n }\\n }\\n }\\n /*cout << \\\"dp2: h = \\\" << h << endl;\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) printf(\\\"% 3d\\\", min(99, dp2[i][j]));\\n cout << endl;\\n }\\n cout << endl;\\n cerr << \\\"size = \\\" << city_list.size() << endl;*/\\n\\n // Brute Force\\n for (int mask = 0; mask < (1 << city_list.size()); mask++) {\\n for (int i = 0; i < city_list.size(); i++) {\\n for (int j = 0; j < city_list.size(); j++) {\\n kari_dp[city_list[i]][city_list[j]] = (1 << 29);\\n if (!((mask >> i) & 1)) continue;\\n if (!((mask >> j) & 1)) continue;\\n kari_dp[city_list[i]][city_list[j]] = dp2[city_list[i]][city_list[j]];\\n }\\n }\\n vector<int> mask_list;\\n int visa_total = 0;\\n for (int i = 0; i < city_list.size(); i++) {\\n if ((mask >> i) & 1) {\\n mask_list.push_back(city_list[i]);\\n visa_total += T[city_list[i]].cost;\\n }\\n }\\n for (int loops = 0; loops <= mask_list.size() * 2; loops++) {\\n for (int i : mask_list) {\\n for (int j : mask_list) {\\n for (int k : mask_list) kari_dp[i][k] = min(kari_dp[i][k], kari_dp[i][j] + C[k][j]);\\n for (int k : mask_list) kari_dp[k][j] = min(kari_dp[k][j], kari_dp[i][j] + C[i][k]);\\n }\\n }\\n }\\n for (int i : mask_list) {\\n for (int j : mask_list) {\\n dp[h][i][j] = min(dp[h][i][j], kari_dp[i][j] + visa_total);\\n }\\n }\\n }\\n }\\n\\n /*for (int h = 0; h < Zahyou.size(); h++) {\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) printf(\\\"% 3d\\\", min(99, dp[h][i][j]));\\n cout << endl;\\n }\\n cout << endl;\\n }*/\\n\\n // Return\\n return (dp[Zahyou.size() - 1][N][N] == (1 << 29) ? -1 : dp[Zahyou.size() - 1][N][N]);\\n}\\n\\nint main() {\\n while (true) {\\n int ret = Solve();\\n if (ret == -2) break;\\n cout << ret << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4232,\n \"score_of_the_acc\": -0.023,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1324_9847281\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0) return 0;\\n vector<ll> Fee(N);\\n vector<int> Alt(N);\\n vector<int> Alts;\\n Fee[0] = Fee[N-1] = 0, Alt[0] = 0, Alt[N-1] = 1000;\\n rep(i,1,N-1) cin >> Fee[i] >> Alt[i];\\n rep(i,0,N) Alts.push_back(Alt[i]);\\n UNIQUE(Alts);\\n rep(i,0,N) Alt[i] = LB(Alts, Alt[i]);\\n int L = Alts.size();\\n vector<vector<int>> City(L);\\n rep(i,0,N) City[Alt[i]].push_back(i);\\n vector<int> ID(N);\\n rep(i,0,L) {\\n rep(j,0,City[i].size()) {\\n ID[City[i][j]] = j;\\n }\\n }\\n vector<vector<pair<int,ll>>> G(N), H(N);\\n rep(i,0,M) {\\n int A, B;\\n ll C;\\n cin >> A >> B >> C;\\n A--, B--;\\n G[A].push_back({B,C});\\n H[B].push_back({A,C});\\n }\\n vector DP(N, vector(N, vector<ll>(1<<10, INF)));\\n DP[0][0][1] = 0;\\n priority_queue<tuple<ll,int,int,int>, vector<tuple<ll,int,int,int>>, greater<tuple<ll,int,int,int>>> PQ;\\n PQ.push({0,0,0,1});\\n while(!PQ.empty()) {\\n auto [d,i,j,k] = PQ.top();\\n PQ.pop();\\n if (d > DP[i][j][k]) continue;\\n for (auto pi : G[i]) {\\n auto [ni, nc] = pi;\\n if (Alt[ni] > max(Alt[i], Alt[j])) {\\n if (chmin(DP[ni][j][1<<ID[ni]], DP[i][j][k] + nc + Fee[ni])) {\\n PQ.push({DP[ni][j][1<<ID[ni]], ni, j, 1<<ID[ni]});\\n }\\n }\\n if (Alt[ni] == max(Alt[i], Alt[j])) {\\n if (chmin(DP[ni][j][k | (1<<ID[ni])], DP[i][j][k] + nc + ((k & (1<<ID[ni])) == 0 ? Fee[ni] : 0LL))) {\\n PQ.push({DP[ni][j][k | (1<<ID[ni])], ni, j, k | (1<<ID[ni])});\\n }\\n }\\n }\\n for (auto pj : H[j]) {\\n auto [nj, nc] = pj;\\n if (Alt[nj] > max(Alt[i], Alt[j])) {\\n if (chmin(DP[i][nj][1<<ID[nj]], DP[i][j][k] + nc + Fee[nj])) {\\n PQ.push({DP[i][nj][1<<ID[nj]], i, nj, 1<<ID[nj]});\\n }\\n }\\n if (Alt[nj] == max(Alt[i], Alt[j])) {\\n if (chmin(DP[i][nj][k | (1<<ID[nj])], DP[i][j][k] + nc + ((k & (1<<ID[nj])) == 0 ? Fee[nj] : 0LL))) {\\n PQ.push({DP[i][nj][k | (1<<ID[nj])], i, nj, k | (1<<ID[nj])});\\n }\\n }\\n }\\n }\\n ll ANS = INF;\\n rep(i,0,1<<10) chmin(ANS, DP[N-1][N-1][i]);\\n cout << (ANS == INF ? -1 : ANS) << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1350,\n \"memory_kb\": 60124,\n \"score_of_the_acc\": -1.0623,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1324_8528121\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n while (1) {\\n int n, m;\\n cin >> n >> m;\\n if (!n)\\n break;\\n vector<int> d(n, 0), e(n, 0);\\n e[n - 1] = 1000;\\n rep2(i, 1, n - 1) cin >> d[i] >> e[i];\\n vector<int> id(n), p(1001, 0);\\n rep(i, n) id[i] = p[e[i]]++;\\n vector<vector<pii>> g(n), rg(n);\\n rep(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c, a--, b--;\\n g[a].eb(b, c);\\n rg[b].eb(a, c);\\n }\\n const int inf = 1e9;\\n vector dp(n, vector(n, vector(1 << 10, inf)));\\n minheap<pair<int, pair<pii, int>>> que;\\n auto upd = [&](int i, int j, int k, int nd) {\\n if (chmin(dp[i][j][k], nd))\\n que.emplace(nd, pair(pair(i, j), k));\\n };\\n upd(0, 0, 1, 0);\\n bool ok = false;\\n while (sz(que)) {\\n auto [nd, ijk] = que.top();\\n auto [ij, k] = ijk;\\n auto [i, j] = ij;\\n que.pop();\\n if (nd != dp[i][j][k])\\n continue;\\n if (i == n - 1 && j == n - 1) {\\n cout << nd << '\\\\n';\\n ok = true;\\n break;\\n }\\n for (auto [ni, cost] : g[i]) {\\n if (e[i] > e[ni])\\n continue;\\n int nk = (e[ni] > max(e[i], e[j]) ? 0 : k);\\n if (e[ni] != max(e[i], e[j]) || !(k >> id[ni] & 1))\\n cost += d[ni];\\n if (e[ni] >= max(e[i], e[j])) nk |= 1 << id[ni];\\n upd(ni, j, nk, nd + cost);\\n }\\n for (auto [nj, cost] : rg[j]) {\\n if (e[j] > e[nj])\\n continue;\\n int nk = (e[nj] > max(e[i], e[j]) ? 0 : k);\\n if (e[nj] != max(e[i], e[j]) || !(k >> id[nj] & 1))\\n cost += d[nj];\\n if (e[nj] >= max(e[i], e[j])) nk |= 1 << id[nj];\\n upd(i, nj, nk, nd + cost);\\n }\\n }\\n if (!ok)\\n cout << -1 << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 31816,\n \"score_of_the_acc\": -0.532,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1324_8412034\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nstruct city {\\n\\tint cost, height;\\n};\\n\\nvoid warshall_floyd(int N, vector<vector<int> >& d) {\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tif (d[j][i] != INF && d[i][k] != INF) {\\n\\t\\t\\t\\t\\td[j][k] = min(d[j][k], d[j][i] + d[i][k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint solve(int N, const vector<city>& C, const vector<vector<int> >& G) {\\n\\t// step #1. compute shortest path for up & down\\n\\tvector<vector<int> > d1(N, vector<int>(N, INF));\\n\\tvector<vector<int> > d2(N, vector<int>(N, INF));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\td1[i][i] = 0;\\n\\t\\td2[i][i] = 0;\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif (G[i][j] != INF) {\\n\\t\\t\\t\\tif (C[i].height <= C[j].height) {\\n\\t\\t\\t\\t\\td1[i][j] = G[i][j] + C[i].cost;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (C[i].height >= C[j].height) {\\n\\t\\t\\t\\t\\td2[i][j] = G[i][j] + C[j].cost;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twarshall_floyd(N, d1);\\n\\twarshall_floyd(N, d2);\\n\\t\\n\\t// step #2. dynamic programming\\n\\tvector<vector<int> > dp(N, vector<int>(N, INF)); // dp[i][j]: up = i, down = j\\n\\tdp[0][0] = 0;\\n\\tvector<int> hlist(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\thlist.push_back(C[i].height);\\n\\t}\\n\\tsort(hlist.begin(), hlist.end());\\n\\thlist.erase(unique(hlist.begin(), hlist.end()), hlist.end());\\n\\tfor (int h : hlist) {\\n\\t\\t// case 1: same heights\\n\\t\\tvector<int> plist;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (C[i].height == h) {\\n\\t\\t\\t\\tplist.push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint S = plist.size();\\n\\t\\tvector<vector<int> > ndp(S, vector<int>(S, INF));\\n\\t\\tfor (int i = 1; i < (1 << S); i++) {\\n\\t\\t\\tvector<int> splist, sid;\\n\\t\\t\\tint subcost = 0;\\n\\t\\t\\tfor (int j = 0; j < S; j++) {\\n\\t\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\t\\tsplist.push_back(plist[j]);\\n\\t\\t\\t\\t\\tsid.push_back(j);\\n\\t\\t\\t\\t\\tsubcost += C[plist[j]].cost;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint T = splist.size();\\n\\t\\t\\tvector<vector<int> > ds(T, vector<int>(T, INF));\\n\\t\\t\\tfor (int j = 0; j < T; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < T; k++) {\\n\\t\\t\\t\\t\\tds[j][k] = (j != k ? G[splist[j]][splist[k]] : 0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twarshall_floyd(T, ds);\\n\\t\\t\\tfor (int j = 0; j < T; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < T; k++) {\\n\\t\\t\\t\\t\\tif (dp[splist[j]][splist[k]] != INF) {\\n\\t\\t\\t\\t\\t\\tfor (int x = 0; x < T; x++) {\\n\\t\\t\\t\\t\\t\\t\\tfor (int y = 0; y < T; y++) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (ds[j][x] != INF && ds[y][k] != INF) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tndp[sid[x]][sid[y]] = min(ndp[sid[x]][sid[y]], dp[splist[j]][splist[k]] + ds[j][x] + ds[y][k] + subcost);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < S; j++) {\\n\\t\\t\\tfor (int k = 0; k < S; k++) {\\n\\t\\t\\t\\tif (ndp[j][k] != INF) {\\n\\t\\t\\t\\t\\tdp[plist[j]][plist[k]] = min(dp[plist[j]][plist[k]], ndp[j][k] - C[plist[j]].cost - C[plist[k]].cost);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// case 2: different heights\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (C[i].height == h && dp[i][j] != INF) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\t\\t\\tif (d1[i][k] != INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp[k][j] = min(dp[k][j], dp[i][j] + d1[i][k]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (C[j].height == h && dp[i][j] != INF) {\\n\\t\\t\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\t\\t\\tif (d2[k][j] != INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp[i][k] = min(dp[i][k], dp[i][j] + d2[k][j]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn dp[N - 1][N - 1];\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<city> C(N);\\n\\t\\tfor (int i = 1; i < N - 1; i++) {\\n\\t\\t\\tcin >> C[i].cost >> C[i].height;\\n\\t\\t}\\n\\t\\tC[0].height = 0;\\n\\t\\tC[N - 1].height = 1000;\\n\\t\\tvector<vector<int> > G(N, vector<int>(N, INF));\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tint a, b, c;\\n\\t\\t\\tcin >> a >> b >> c;\\n\\t\\t\\ta -= 1;\\n\\t\\t\\tb -= 1;\\n\\t\\t\\tG[a][b] = min(G[a][b], c);\\n\\t\\t}\\n\\t\\tint ans = solve(N, C, G);\\n\\t\\tcout << (ans != INF ? ans : -1) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.0092,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1324_7238070\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) v.begin(), v.end()\\n#define REPname(a,b,c,d,...) d\\n#define rep(...) REPname(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP2(i,l,r) for(int i = l; i < r; i++)\\n#define REP1(i, x) REP2(i,0,x)\\n#define REP0(x) REP1(SPJ, x)\\n#define sz(x) int(x.size())\\n\\ntemplate <class T>\\nusing V=vector<T>;\\n\\ntemplate <class T>\\nusing VV=vector<V<T>>;\\n\\ntemplate<class T>\\nusing pqmin = priority_queue<T, V<T>, greater<T>>;\\nusing ll = long long ;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = V<vll>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\ntemplate<class T>\\ninline bool chmax(T &a, T b){\\n\\treturn a < b ? a=b, 1 : 0;\\n}\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\treturn a > b ? a = b, 1 : 0;\\n}\\n\\n\\n// template <c0lass T>\\nvoid view(ll x) {\\n\\tif(x > INF / 2) cerr << \\\"INF\\\";\\n\\telse cerr << x;\\n}\\n\\n\\ntemplate <class T>\\nvoid view(T x) {\\n\\tcerr << x;\\n}\\n\\ntemplate <class T>\\nvoid view(V<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\", \\\";}\\n\\tcerr << \\\"}\\\";\\n}\\n\\n\\ntemplate <class T>\\nvoid view(VV<T> v) {\\n\\tcerr << \\\"{ \\\";\\n\\tfoa(t, v) {view(t) ; cerr << \\\",\\\\n\\\";}\\n\\tcerr << \\\"}\\\";\\n\\tcerr << endl;\\n}\\n\\n\\n// template <c0lass T>\\nvoid view(int x) {\\n\\tcerr << x;\\n}\\n\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <class T>\\nvoid debug_out(T x) {\\n\\tview(x);\\n}\\ntemplate <class H, class... T>\\nvoid debug_out(H h, T... t) {\\n\\tview(h);\\n\\tcerr << \\\", \\\";\\n\\tdebug_out(t...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tcerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tcerr << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\nusing vvi = V<vi>;\\n\\n\\nll solve(int n){\\n\\tint m; cin >> m;\\n\\tint hmax = 1001;\\n\\tvector<int> height(n);\\n\\tvector<ll> visa(n);\\n\\tvector<vi> towns(hmax);\\n\\trep(i, 1, n - 1) {\\n\\t\\tcin >> visa[i] >> height[i];\\n\\t}\\n\\theight.back() = hmax - 1;\\n\\n\\tvector<int> order_height(n);\\n\\tiota(all(order_height), 0);\\n\\tsort(all(order_height), [&](int i, int j) { return height[i] < height[j]; });\\n\\n\\tvector<int> mapsto(n);\\n\\trep(i, n) mapsto[order_height[i]] = i;\\n\\n\\t{\\n\\t\\tvector<int> w(n);\\n\\t\\tvector<ll> fee(n);\\n\\t\\trep(i, n) {\\n\\t\\t\\tint old = order_height[i];\\n\\t\\t\\tw[i] = height[old];\\n\\t\\t\\tfee[i] = visa[old];\\n\\t\\t}\\n\\t\\tswap(height, w);\\n\\t\\tswap(fee, visa);\\n\\t}\\n\\n\\trep(i, n) {\\n\\t\\ttowns[height[i]].push_back(i);\\n\\t}\\n\\n\\tvector<V<pair<int, ll>>> g(n), rg(n);\\n\\trep(m) {\\n\\t\\tint a, b;\\n\\t\\tll c; cin >> a >> b >> c;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\ta = mapsto[a];\\n\\t\\tb = mapsto[b];\\n\\t\\tg[a].emplace_back(b, c);\\n\\t\\trg[b].emplace_back(a, c);\\n\\t}\\n\\n\\tV<vector<vector<vector<vll>>>> pt(hmax);\\n\\n\\n\\trep(h, hmax) {\\n\\t\\tconst auto & grp = towns[h];\\n\\t\\tif(grp.empty()) continue;\\n\\n\\t\\tdebug(grp);\\n\\t\\tint mn = grp.front();\\n\\t\\tint mx = grp.back();\\n\\t\\tint len = mx - mn + 1;\\n\\t\\tvector<vector<vector<vll>>> pair_trans(len, vector(len, vector(len, vector<ll>(len, INF))));\\n\\t\\t// from, from , to, to\\n\\t\\trep(i, len) rep(j, len) {\\n\\t\\t\\tll c = visa[i + mn];\\n\\t\\t\\tif(i != j ) c += visa[j+mn];\\n\\t\\t\\tpair_trans[i][j][i][j] = c;\\n\\t\\t}\\n\\t\\trep(use, (1 << len)) {\\n\\t\\t\\tvvll cost(len, vll(len, INF));\\n\\t\\t\\tll visas = 0;\\n\\t\\t\\trep(i, len) {\\n\\t\\t\\t\\tif(!(use & (1 << i))) continue;\\n\\t\\t\\t\\tcost[i][i] = 0;\\n\\t\\t\\t\\tint from = i + mn;\\n\\t\\t\\t\\tvisas += visa[from];\\n\\t\\t\\t\\tfor(const auto& [to, ecost] : g[from]) {\\n\\t\\t\\t\\t\\tdebug(from, to, ecost, mn, mx, use);\\n\\t\\t\\t\\t\\tif(mn <= to && to <= mx && (use & (1 << (to - mn)))) {\\n\\t\\t\\t\\t\\t\\tdebug(from, to, ecost);\\n\\t\\t\\t\\t\\t\\tchmin(cost[i][to - mn], ecost);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trep(k, len) rep(i, len) rep(j, len) chmin(cost[i][j], cost.at(i).at(k) + cost.at(k).at(j));\\n\\n\\t\\t\\tdebug(use, cost);\\n\\n\\t\\t\\trep(i, len) rep(j, len) rep(k, len) rep(l, len) {\\n\\t\\t\\t\\tchmin(pair_trans[i].at(j).at(k).at(l), cost[i][k] + cost[l][j] + visas);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trep(i, len) rep(j, len) rep(k, len) rep(l, len) \\n\\t\\t{\\n\\t\\t\\tauto &t = pair_trans[i][j][k][l];\\n\\t\\t\\tif(t < INF / 2) debug(i, j, k, l, t);\\n\\t\\t}\\n\\n\\t\\tpt[h] = pair_trans;\\n\\t}\\n\\n\\n\\tpqmin<tuple<ll, int, int>> q;\\n\\tq.emplace(0LL, 0, 0);\\n\\tvector<vector<ll>> dist(n, vll(n, INF));\\n\\tdist.front().front() = 0;\\n\\n\\twhile(q.size()) {\\n\\t\\tll d;\\n\\t\\tint fth,bck;\\n\\t\\ttie(d, fth, bck) = q.top();\\n\\t\\tq.pop();\\n\\t\\tif(fth == bck && bck == n - 1) return d;\\n\\t\\tif(d > dist[fth].at(bck)) continue;\\n\\n\\t\\tdebug(d, fth, bck);\\n\\n\\t\\tauto set_nxt = [&](int fnxt, int bnxt, ll val ) {\\n\\t\\t\\tif(val < 0) exit(1);\\n\\t\\t\\tif(chmin(dist.at(fnxt).at(bnxt), val)) {\\n\\t\\t\\t\\tq.emplace(val, fnxt, bnxt);\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\tif(height[fth] == height[bck]) {\\n\\t\\t\\tauto& p = pt.at(height.at(fth));\\n\\t\\t\\tconst int len = sz(p);\\n\\t\\t\\tconst auto& current = towns[height[fth]];\\n\\n\\t\\t\\tint fromf = fth - current.front();\\n\\t\\t\\tint fromb = bck - current.front();\\n\\t\\t\\trep(i, len) rep(j, len) {\\n\\t\\t\\t\\tint tof = current[i];\\n\\t\\t\\t\\tint tob = current[j];\\n\\t\\t\\t\\tll cost = p[fromf].at(fromb).at(i).at(j) + d - visa[fth];\\n\\t\\t\\t\\tif(fth != bck) cost -= visa[bck];\\n\\t\\t\\t\\tdebug(fth, bck, d, tof, tob, cost, p[fromf].at(fromb).at(i).at(j));\\n\\t\\t\\t\\tset_nxt(tof, tob, cost);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(height[fth] <= height[bck]) {\\n\\t\\t\\tfor(auto [nxt, ed_cost] : g[fth]) {\\n\\t\\t\\t\\tif(height[nxt] >= height[fth]) {\\n\\t\\t\\t\\t\\tll cost = d + ed_cost;\\n\\t\\t\\t\\t\\tif(nxt != bck) cost += visa[nxt];\\n\\t\\t\\t\\t\\tset_nxt(nxt, bck, cost);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tfor(auto [nxt, ed_cost] : rg[bck]) {\\n\\t\\t\\t\\tif(height[nxt] >= height[bck]) {\\n\\t\\t\\t\\t\\tll cost = d + ed_cost;\\n\\t\\t\\t\\t\\tif(nxt != fth) cost += visa[nxt];\\n\\t\\t\\t\\t\\tset_nxt(fth, nxt, cost);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn -1;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\tint n;\\n\\twhile(cin >> n && n) cout << solve(n) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4388,\n \"score_of_the_acc\": -0.0402,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1324_6722303\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0) break;\\n vector<int> d(n), e(n);\\n e[n-1] = 1000;\\n vector<vector<int>> cities(1001);\\n cities[0].push_back(0);\\n cities[1000].push_back(n-1);\\n rep(i,1,n-1) {\\n cin >> d[i] >> e[i];\\n cities[e[i]].push_back(i);\\n }\\n vector<vector<pair<int, int>>> G(n);\\n rep(_,0,m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n --a, --b;\\n G[a].push_back({b, c});\\n }\\n\\n vector<vector<int>> dp(n, vector<int>(n, 1e8)); // cost to go from i (up) to j (down)\\n dp[n-1][n-1] = 0;\\n\\n revrep(a,1000,0) {\\n int N = cities[a].size();\\n rep(S,0,1<<N) {\\n vector<vector<int>> up(n, vector<int>(n, 1e8)), down(n, vector<int>(n, 1e8));\\n rep(i,0,n) up[i][i] = down[i][i] = 0;\\n int dd = 0;\\n rep(i,0,n) {\\n if (e[i] < a) continue;\\n if (e[i] == a) {\\n auto j = find(all(cities[a]), i) - cities[a].begin();\\n if (!(S>>j&1)) continue;\\n dd += d[i];\\n }\\n for (auto [j, c] : G[i]) {\\n if (e[i] <= e[j]) up[i][j] = c + d[i];\\n if (e[i] >= e[j]) down[i][j] = c + d[j];\\n if (e[i] == a) up[i][j] -= d[i];\\n if (e[j] == a) down[i][j] -= d[j];\\n }\\n }\\n\\n rep(k,0,n) rep(i,0,n) rep(j,0,n) chmin(up[i][j], up[i][k] + up[k][j]);\\n rep(k,0,n) rep(i,0,n) rep(j,0,n) chmin(down[i][j], down[i][k] + down[k][j]);\\n\\n for (int i : cities[a]) for (int j : cities[a]) {\\n int k = find(all(cities[a]), i) - cities[a].begin();\\n if (!(S>>k&1)) continue;\\n k = find(all(cities[a]), j) - cities[a].begin();\\n if (!(S>>k&1)) continue;\\n\\n rep(k,0,n) rep(l,0,n) if (a < e[k] && a < e[l]) {\\n chmin(dp[i][j], up[i][k] + dp[k][l] + down[l][j] + dd);\\n }\\n }\\n }\\n }\\n cout << (dp[0][0] < 1e8 ? dp[0][0] : -1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3910,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.5833,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1324_6718504\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n\\tif constexpr (cond_v) {\\n\\t\\treturn std::forward<Then>(then);\\n\\t} else {\\n\\t\\treturn std::forward<OrElse>(or_else);\\n\\t}\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n\\tusing type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n\\tusing type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r)\\tREP4(i,l,r,1)\\n#define REP2(i,n)\\t REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i)\\t REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n)\\t RREP3(i,0,n)\\n\\n#define rep(...)\\tOVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n\\tconstexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n\\tconstexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n\\tconstexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n\\tstd::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n\\t((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n\\tstd::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif (s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar* d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while (tmp != 0);\\n\\t\\tif (value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif (dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif (s) {\\n\\t\\tchar buffer[128];\\n\\t\\tchar* d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[value % 10];\\n\\t\\t\\tvalue /= 10;\\n\\t\\t} while (value != 0);\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif (dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n\\treturn out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n\\tif constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n\\t\\treturn out;\\n\\t} else {\\n\\t\\tout << std::get<N>(a);\\n\\t\\tif constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n\\t\\t\\tout << ' ';\\n\\t\\t}\\n\\t\\treturn operator<<<N + 1>(out, a);\\n\\t}\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n\\tfor (auto it = a.begin(); it != a.end();) {\\n\\t\\tout << *it;\\n\\t\\tif (++it != a.end()) out << ' ';\\n\\t}\\n\\treturn out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n\\tfor (auto it = a.begin(); it != a.end();) {\\n\\t\\tout << *it;\\n\\t\\tif (++it != a.end()) out << ' ';\\n\\t}\\n\\treturn out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n\\tstd::cout << head;\\n\\tif (sizeof...(tails)) std::cout << ' ';\\n\\tprint(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n\\tfor (auto it = v.begin(); it != v.end();) {\\n\\t\\tstd::cout << *it;\\n\\t\\tif (++it != v.end()) std::cout << sep;\\n\\t}\\n\\tstd::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n\\t__int128_t ret = 0;\\n\\tfor (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n\\tif (s[0] == '-') ret = -ret;\\n\\treturn ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n\\t__uint128_t ret = 0;\\n\\tfor (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n\\treturn ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n\\tstd::string s;\\n\\tin >> s;\\n\\tv = parse_i128(s);\\n\\treturn in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n\\tstd::string s;\\n\\tin >> s;\\n\\tv = parse_u128(s);\\n\\treturn in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n\\treturn in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n\\tif constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n\\t\\treturn in;\\n\\t} else {\\n\\t\\treturn operator>><N + 1>(in >> std::get<N>(a), a);\\n\\t}\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n\\tfor (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n\\treturn in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n\\tfor (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n\\treturn in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n\\t(std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n\\treturn -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n\\treturn -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n\\treturn (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n\\treturn (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n\\treturn std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n\\treturn iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n\\tstd::vector<T> v(n);\\n\\tfor (int i = 0; i < n; ++i) v[i] = generator(i);\\n\\treturn v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n\\treturn generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n\\treturn generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n\\tif (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n\\tforeach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n\\tif (y >= x) return false;\\n\\tx = y;\\n\\treturn true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n\\tif (y <= x) return false;\\n\\tx = y;\\n\\treturn true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n\\tstd::string res;\\n\\tif (bit_num >= 0) {\\n\\t\\tfor (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n\\t} else {\\n\\t\\tfor (; val; val >>= 1) res += '0' + (val & 1);\\n\\t\\tstd::reverse(res.begin(), res.end());\\n\\t}\\n\\treturn res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n\\tstd::vector<T> res;\\n\\tfor (; val; val /= base) res.push_back(val % base);\\n\\tif (res.empty()) res.push_back(T{ 0 });\\n\\treturn res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n\\tauto res = digits_low_to_high(val, base);\\n\\tstd::reverse(res.begin(), res.end());\\n\\treturn res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n\\tstd::ostringstream ss;\\n\\tfor (auto it = v.begin(); it != v.end();) {\\n\\t\\tss << *it;\\n\\t\\tif (++it != v.end()) ss << sep;\\n\\t}\\n\\tss << end;\\n\\treturn ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n\\tio_setup(int precision = 20) {\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::cout << std::fixed << std::setprecision(precision);\\n\\t}\\n} io_setup_ {};\\n\\n// ! code from here\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace suisen {\\ntemplate <typename T>\\nclass CoordinateCompressorBuilder {\\n\\tpublic:\\n\\t\\tstruct Compressor {\\n\\t\\t\\tpublic:\\n\\t\\t\\t\\tstatic constexpr int absent = -1;\\n\\n\\t\\t\\t\\t// default constructor\\n\\t\\t\\t\\tCompressor() : _xs(std::vector<T>{}) {}\\n\\t\\t\\t\\t// Construct from strictly sorted vector\\n\\t\\t\\t\\tCompressor(const std::vector<T> &xs) : _xs(xs) {\\n\\t\\t\\t\\t\\tassert(is_strictly_sorted(xs));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Return the number of distinct keys.\\n\\t\\t\\t\\tint size() const {\\n\\t\\t\\t\\t\\treturn _xs.size();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Check if the element is registered.\\n\\t\\t\\t\\tbool has_key(const T &e) const {\\n\\t\\t\\t\\t\\treturn std::binary_search(_xs.begin(), _xs.end(), e);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\\n\\t\\t\\t\\tint comp(const T &e, int default_value = absent) const {\\n\\t\\t\\t\\t\\tconst int res = min_geq_index(e);\\n\\t\\t\\t\\t\\treturn res != size() and _xs[res] == e ? res : default_value;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Restore the element from the index.\\n\\t\\t\\t\\tT decomp(const int compressed_index) const {\\n\\t\\t\\t\\t\\treturn _xs[compressed_index];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Compress the element. Equivalent to call `comp(e)`\\n\\t\\t\\t\\tint operator[](const T &e) const {\\n\\t\\t\\t\\t\\treturn comp(e);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the minimum registered value greater than `e`. if not exists, return `default_value`.\\n\\t\\t\\t\\tT min_gt(const T &e, const T &default_value) const {\\n\\t\\t\\t\\t\\tauto it = std::upper_bound(_xs.begin(), _xs.end(), e);\\n\\t\\t\\t\\t\\treturn it == _xs.end() ? default_value : *it;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\\n\\t\\t\\t\\tT min_geq(const T &e, const T &default_value) const {\\n\\t\\t\\t\\t\\tauto it = std::lower_bound(_xs.begin(), _xs.end(), e);\\n\\t\\t\\t\\t\\treturn it == _xs.end() ? default_value : *it;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the maximum registered value less than `e`. if not exists, return `default_value`\\n\\t\\t\\t\\tT max_lt(const T &e, const T &default_value) const {\\n\\t\\t\\t\\t\\tauto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\\n\\t\\t\\t\\t\\treturn it == _xs.rend() ? default_value : *it;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\\n\\t\\t\\t\\tT max_leq(const T &e, const T &default_value) const {\\n\\t\\t\\t\\t\\tauto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>());\\n\\t\\t\\t\\t\\treturn it == _xs.rend() ? default_value : *it;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\\n\\t\\t\\t\\tint min_gt_index(const T &e) const {\\n\\t\\t\\t\\t\\treturn std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\\n\\t\\t\\t\\tint min_geq_index(const T &e) const {\\n\\t\\t\\t\\t\\treturn std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\\n\\t\\t\\t\\tint max_lt_index(const T &e) const {\\n\\t\\t\\t\\t\\treturn int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\\n\\t\\t\\t\\tint max_leq_index(const T &e) const {\\n\\t\\t\\t\\t\\treturn int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e, std::greater<T>())) - 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\tprivate:\\n\\t\\t\\t\\tstd::vector<T> _xs;\\n\\t\\t\\t\\tstatic bool is_strictly_sorted(const std::vector<T> &v) {\\n\\t\\t\\t\\t\\treturn std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\\n\\t\\t\\t\\t}\\n\\t\\t};\\n\\t\\tCoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\\n\\t\\texplicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\\n\\t\\texplicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\\n\\t\\ttemplate <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n\\t\\tCoordinateCompressorBuilder(const int n, Gen generator) {\\n\\t\\t\\treserve(n);\\n\\t\\t\\tfor (int i = 0; i < n; ++i) push(generator(i));\\n\\t\\t}\\n\\t\\t// Attempt to preallocate enough memory for specified number of elements.\\n\\t\\tvoid reserve(int n) {\\n\\t\\t\\t_xs.reserve(n);\\n\\t\\t}\\n\\t\\t// Add data.\\n\\t\\tvoid push(const T &first) {\\n\\t\\t\\t_xs.push_back(first);\\n\\t\\t}\\n\\t\\t// Add data.\\n\\t\\tvoid push(T &&first) {\\n\\t\\t\\t_xs.push_back(std::move(first));\\n\\t\\t}\\n\\t\\t// Add data in the range of [first, last). \\n\\t\\ttemplate <typename Iterator>\\n\\t\\tauto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\\n\\t\\t\\tfor (auto it = first; it != last; ++it) _xs.push_back(*it);\\n\\t\\t}\\n\\t\\t// Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\\n\\t\\ttemplate <typename Iterable>\\n\\t\\tauto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\\n\\t\\t\\tpush(iterable.begin(), iterable.end());\\n\\t\\t}\\n\\t\\t// Add data.\\n\\t\\ttemplate <typename ...Args>\\n\\t\\tvoid emplace(Args &&...args) {\\n\\t\\t\\t_xs.emplace_back(std::forward<Args>(args)...);\\n\\t\\t}\\n\\t\\t// Build compressor.\\n\\t\\tauto build() {\\n\\t\\t\\tstd::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\\n\\t\\t\\treturn Compressor {_xs};\\n\\t\\t}\\n\\t\\t// Build compressor from vector.\\n\\t\\tstatic auto build(const std::vector<T> &xs) {\\n\\t\\t\\treturn CoordinateCompressorBuilder(xs).build();\\n\\t\\t}\\n\\t\\t// Build compressor from vector.\\n\\t\\tstatic auto build(std::vector<T> &&xs) {\\n\\t\\t\\treturn CoordinateCompressorBuilder(std::move(xs)).build();\\n\\t\\t}\\n\\t\\t// Build compressor from generator.\\n\\t\\ttemplate <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n\\t\\tstatic auto build(const int n, Gen generator) {\\n\\t\\t\\treturn CoordinateCompressorBuilder<T>(n, generator).build();\\n\\t\\t}\\n\\tprivate:\\n\\t\\tstd::vector<T> _xs;\\n};\\n\\n} // namespace suisen\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <cstdint>\\n#include <iostream>\\n\\nnamespace suisen {\\n\\ttemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\n\\tstruct all_subset {\\n\\t\\tstruct all_subset_iter {\\n\\t\\t\\tconst T s; T t;\\n\\t\\t\\tconstexpr all_subset_iter(T s) : s(s), t(s + 1) {}\\n\\t\\t\\tconstexpr auto operator*() const { return t; }\\n\\t\\t\\tconstexpr auto operator++() {}\\n\\t\\t\\tconstexpr auto operator!=(std::nullptr_t) { return t ? (--t &= s, true) : false; }\\n\\t\\t};\\n\\t\\tT s;\\n\\t\\tconstexpr all_subset(T s) : s(s) {}\\n\\t\\tconstexpr auto begin() { return all_subset_iter(s); }\\n\\t\\tconstexpr auto end() { return nullptr; }\\n\\t};\\n\\n\\t// iterator over T s.t. T is subset of S and |T| = k\\n\\tstruct all_subset_k {\\n\\t\\tstruct all_subset_k_iter {\\n\\t\\t\\tconst uint32_t n, k, s;\\n\\t\\t\\tuint32_t t;\\n\\t\\t\\t__attribute__((target(\\\"avx2\\\")))\\n\\t\\t\\tall_subset_k_iter(uint32_t s, uint32_t k) : n(uint32_t(1) << _mm_popcnt_u32(s)), k(k), s(s), t((uint32_t(1) << k) - 1) {}\\n\\t\\t\\t__attribute__((target(\\\"bmi2\\\")))\\n\\t\\t\\tauto operator*() const { return _pdep_u32(t, s); }\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator++() {\\n\\t\\t\\t\\tif (k == 0) {\\n\\t\\t\\t\\t\\tt = std::numeric_limits<uint32_t>::max();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tuint32_t y = t + _blsi_u32(t); // t + (-t & t)\\n\\t\\t\\t\\t\\tt = y | ((y ^ t) >> _tzcnt_u32(t << 2));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tauto operator!=(std::nullptr_t) const { return t < n; }\\n\\t\\t};\\n\\t\\tuint32_t s, k;\\n\\t\\tall_subset_k(uint32_t s, uint32_t k) : s(s), k(k) {\\n\\t\\t\\tassert(s != std::numeric_limits<uint32_t>::max());\\n\\t\\t}\\n\\t\\tauto begin() { return all_subset_k_iter(s, k); }\\n\\t\\tauto end() { return nullptr; }\\n\\t};\\n\\n\\tstruct all_subset_k_64 {\\n\\t\\tstruct all_subset_k_iter_64 {\\n\\t\\t\\tconst uint64_t n, s;\\n\\t\\t\\tconst uint32_t k;\\n\\t\\t\\tuint64_t t;\\n\\t\\t\\t__attribute__((target(\\\"avx2\\\")))\\n\\t\\t\\tall_subset_k_iter_64(uint64_t s, uint32_t k) : n(uint64_t(1) << _mm_popcnt_u64(s)), s(s), k(k), t((uint64_t(1) << k) - 1) {}\\n\\t\\t\\t__attribute__((target(\\\"bmi2\\\")))\\n\\t\\t\\tauto operator*() const { return _pdep_u64(t, s); }\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator++() {\\n\\t\\t\\t\\tif (k == 0) {\\n\\t\\t\\t\\t\\tt = std::numeric_limits<uint64_t>::max();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tuint64_t y = t + _blsi_u64(t);\\n\\t\\t\\t\\t\\tt = y | ((y ^ t) >> _tzcnt_u64(t << 2));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tauto operator!=(std::nullptr_t) const { return t < n; }\\n\\t\\t};\\n\\t\\tuint64_t s;\\n\\t\\tuint32_t k;\\n\\t\\tall_subset_k_64(uint64_t s, uint32_t k) : s(s), k(k) {\\n\\t\\t\\tassert(s != std::numeric_limits<uint64_t>::max());\\n\\t\\t}\\n\\t\\tauto begin() { return all_subset_k_iter_64(s, k); }\\n\\t\\tauto end() { return nullptr; }\\n\\t};\\n\\n\\tstruct all_setbit {\\n\\t\\tstruct all_setbit_iter {\\n\\t\\t\\tuint32_t s;\\n\\t\\t\\tall_setbit_iter(uint32_t s) : s(s) {}\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator*() { return _tzcnt_u32(s); }\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator++() { s = __blsr_u32(s); }\\n\\t\\t\\tauto operator!=(std::nullptr_t) { return s; }\\n\\t\\t};\\n\\t\\tuint32_t s;\\n\\t\\tall_setbit(uint32_t s) : s(s) {}\\n\\t\\tauto begin() { return all_setbit_iter(s); }\\n\\t\\tauto end() { return nullptr; }\\n\\t};\\n\\n\\tstruct all_setbit_64 {\\n\\t\\tstruct all_setbit_iter_64 {\\n\\t\\t\\tuint64_t s;\\n\\t\\t\\tall_setbit_iter_64(uint64_t s) : s(s) {}\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator*() { return _tzcnt_u64(s); }\\n\\t\\t\\t__attribute__((target(\\\"bmi\\\")))\\n\\t\\t\\tauto operator++() { s = __blsr_u64(s); }\\n\\t\\t\\tauto operator!=(std::nullptr_t) { return s; }\\n\\t\\t};\\n\\t\\tuint64_t s;\\n\\t\\tall_setbit_64(uint64_t s) : s(s) {}\\n\\t\\tauto begin() { return all_setbit_iter_64(s); }\\n\\t\\tauto end() { return nullptr; }\\n\\t};\\n} // namespace suisen\\n\\nvoid solve() {\\n\\tinput(int, n, m);\\n\\tif (n == 0 and m == 0) exit(0);\\n\\n\\tCoordinateCompressorBuilder<int> builder;\\n\\n\\tvector<int> h(n), c(n);\\n\\th[0] = 0, c[0] = 0;\\n\\trep(i, 1, n - 1) read(c[i], h[i]);\\n\\th[n - 1] = 1000, c[n - 1] = 0;\\n\\n\\trep(i, n) builder.push(h[i]);\\n\\tconst auto cmp = builder.build();\\n\\tconst int l = cmp.size();\\n\\tvector<long long> lev_sets(l);\\n\\n\\trep(i, n) {\\n\\t\\th[i] = cmp[h[i]];\\n\\t\\tlev_sets[h[i]] |= 1LL << i;\\n\\t}\\n\\n\\tvector g(l, vector<vector<pair<int, int>>>(n));\\n\\tvector rev_g(l, vector<vector<pair<int, int>>>(n));\\n\\tvector<vector<pair<int, int>>> asc(n), rev_dsc(n);\\n\\tloop(m) {\\n\\t\\tinput(int, u, v, w);\\n\\t\\t--u, --v;\\n\\t\\tif (h[u] < h[v]) {\\n\\t\\t\\tasc[u].emplace_back(v, w);\\n\\t\\t} else if (h[u] > h[v]) {\\n\\t\\t\\trev_dsc[v].emplace_back(u, w);\\n\\t\\t} else {\\n\\t\\t\\tg[h[u]][u].emplace_back(v, w);\\n\\t\\t\\trev_g[h[u]][v].emplace_back(u, w);\\n\\t\\t}\\n\\t}\\n\\n\\tstatic constexpr int inf = numeric_limits<int>::max() / 4;\\n\\tvector dp(l, vector(n, vector<int>(n, inf)));\\n\\tdp[0][0][0] = 0;\\n\\trep(i, l - 1) {\\n\\t\\tvector<vector<int>> dists(n);\\n\\t\\trep(j, n) if (kth_bit(lev_sets[i], j)) {\\n\\t\\t\\tvector<int> dist(n, inf);\\n\\t\\t\\tpq_greater<pair<int, int>> pq;\\n\\t\\t\\tpq.emplace(dist[j] = c[j], j);\\n\\t\\t\\twhile (pq.size()) {\\n\\t\\t\\t\\tauto [du, u] = pq.top();\\n\\t\\t\\t\\tpq.pop();\\n\\t\\t\\t\\tif (dist[u] != du) continue;\\n\\t\\t\\t\\tfor (auto [v, w] : g[i][u]) {\\n\\t\\t\\t\\t\\tif (chmin(dist[v], du + w + c[v])) {\\n\\t\\t\\t\\t\\t\\tpq.emplace(dist[v], v);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdists[j].swap(dist);\\n\\t\\t}\\n\\t\\tvector<vector<int>> rev_dists(n);\\n\\t\\trep(k, n) if (kth_bit(lev_sets[i], k)) {\\n\\t\\t\\tvector<int> dist(n, inf);\\n\\t\\t\\tpq_greater<pair<int, int>> pq;\\n\\t\\t\\tpq.emplace(dist[k] = c[k], k);\\n\\t\\t\\twhile (pq.size()) {\\n\\t\\t\\t\\tauto [du, u] = pq.top();\\n\\t\\t\\t\\tpq.pop();\\n\\t\\t\\t\\tif (dist[u] != du) continue;\\n\\t\\t\\t\\tfor (auto [v, w] : rev_g[i][u]) {\\n\\t\\t\\t\\t\\tif (chmin(dist[v], du + w + c[v])) {\\n\\t\\t\\t\\t\\t\\tpq.emplace(dist[v], v);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trev_dists[k].swap(dist);\\n\\t\\t}\\n\\n\\t\\tCoordinateCompressorBuilder<int> builder_i;\\n\\t\\tfor (int v : all_setbit_64(lev_sets[i])) {\\n\\t\\t\\tbuilder_i.push(v);\\n\\t\\t}\\n\\t\\tconst auto cmp_i = builder_i.build();\\n\\t\\tconst int siz = cmp_i.size();\\n\\n\\t\\tvector init_wf(siz, vector<int>(siz, inf));\\n\\t\\trep(cx, siz) init_wf[cx][cx] = 0;\\n\\t\\trep(cx, siz) for (auto [y, w] : g[i][cmp_i.decomp(cx)]) {\\n\\t\\t\\tinit_wf[cx][cmp_i[y]] = w;\\n\\t\\t}\\n\\n\\t\\tmap<long long, vector<vector<int>>> wfs;\\n\\t\\tfor (auto s : all_subset(lev_sets[i])) {\\n\\t\\t\\tauto wf = init_wf;\\n\\t\\t\\trep(cz, siz) if (kth_bit(s, cmp_i.decomp(cz))) {\\n\\t\\t\\t\\trep(cx, siz) if (kth_bit(s, cmp_i.decomp(cx))) {\\n\\t\\t\\t\\t\\trep(cy, siz) if (kth_bit(s, cmp_i.decomp(cy))) {\\n\\t\\t\\t\\t\\t\\tchmin(wf[cx][cy], wf[cx][cz] + wf[cz][cy]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twfs[s] = move(wf);\\n\\t\\t}\\n\\n\\t\\trep(j, n) rep(k, n) {\\n\\t\\t\\tif (dp[i][j][k] == inf) continue;\\n\\t\\t\\tassert(h[j] >= i and h[k] >= i);\\n\\n\\t\\t\\tif (kth_bit(lev_sets[i], j) and kth_bit(lev_sets[i], k)) {\\n\\t\\t\\t\\tconst int cj = cmp_i[j], ck = cmp_i[k];\\n\\t\\t\\t\\tfor (auto s : all_subset(lev_sets[i] & ~((1LL << j) | (1LL << k)))) {\\n\\t\\t\\t\\t\\ts |= 1LL << j, s |= 1LL << k;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tint fc = 0;\\n\\t\\t\\t\\t\\tfor (int v : all_setbit_64(s)) fc += c[v];\\n\\n\\t\\t\\t\\t\\tconst auto &wf = wfs.at(s);\\n\\t\\t\\t\\t\\tfor (auto x : all_setbit_64(s)) for (auto y : all_setbit_64(s)) {\\n\\t\\t\\t\\t\\t\\tconst int cx = cmp_i[x], cy = cmp_i[y];\\n\\t\\t\\t\\t\\t\\tfor (auto [nj, wj] : asc[x]) for (auto [nk, wk] : rev_dsc[y]) {\\n\\t\\t\\t\\t\\t\\t\\tchmin(dp[i + 1][nj][nk], dp[i][j][k] + wf[cj][cx] + wf[cy][ck] + fc + wj + wk);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (kth_bit(lev_sets[i], j)) {\\n\\t\\t\\t\\trep(x, n) if (dists[j][x] != inf) {\\n\\t\\t\\t\\t\\tfor (auto [nj, w] : asc[x]) {\\n\\t\\t\\t\\t\\t\\tchmin(dp[i + 1][nj][k], dp[i][j][k] + dists[j][x] + w);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (kth_bit(lev_sets[i], k)) {\\n\\t\\t\\t\\trep(y, n) if (rev_dists[k][y] != inf) {\\n\\t\\t\\t\\t\\tfor (auto [nk, w] : rev_dsc[y]) {\\n\\t\\t\\t\\t\\t\\tchmin(dp[i + 1][j][nk], dp[i][j][k] + rev_dists[k][y] + w);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tchmin(dp[i + 1][j][k], dp[i][j][k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprint(dp[l - 1][n - 1][n - 1] == inf ? -1 : dp[l - 1][n - 1][n - 1]);\\n\\t// cout.flush();\\n}\\n\\nint main() {\\n\\twhile (true) solve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4460,\n \"memory_kb\": 4368,\n \"score_of_the_acc\": -0.6818,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1324_6082052\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll=long long int;\\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\n\\nvoid solve(){\\n int n,m;\\n cin>>n>>m;\\n if(n==0)exit(0);\\n vector<int> d(n),e(n);\\n e[n-1]=1000;\\n rep(i,1,n-1)cin>>d[i]>>e[i];\\n int pos[n],ecnt[1010]={};\\n rep(i,0,n)pos[i]=ecnt[e[i]]++;\\n using P=array<int,2>;\\n vector g(n,vector<P>()),rev(n,vector<P>());\\n rep(_,0,m){\\n int u,v,w;\\n cin>>u>>v>>w;\\n u--; v--;\\n if(e[u]<=e[v])g[u].push_back({v,w});\\n if(e[u]>=e[v])rev[v].push_back({u,w});\\n }\\n\\n vector dp(n,vector(n,vector<ll>(1<<10,INF)));\\n dp[0][0][1]=0;\\n using T=pair<ll,array<int,3>>;\\n priority_queue<T,vector<T>,greater<T>> pq;\\n pq.push({0,{0,0,1}});\\n\\n auto insert=[&](int x,int y,int mask,ll dist)->void{\\n if(chmin(dp[x][y][mask],dist)){\\n pq.push({dp[x][y][mask],{x,y,mask}});\\n }\\n };\\n\\n while(!pq.empty()){\\n auto [dist,state]=pq.top();\\n pq.pop();\\n auto [x,y,mask]=state;\\n if(dp[x][y][mask]<dist)continue;\\n for(auto& [nxt,add]:g[x]){\\n if(e[nxt]<e[y])insert(nxt,y,mask,dist+add+d[nxt]);\\n else if(e[nxt]==e[x] or e[nxt]==e[y])insert(nxt,y,mask|(1<<pos[nxt]),dist+add+(mask>>pos[nxt]&1?0:d[nxt]));\\n else insert(nxt,y,1<<pos[nxt],dist+add+d[nxt]);\\n }\\n for(auto& [nxt,add]:rev[y]){\\n if(e[nxt]<e[x])insert(x,nxt,mask,dist+add+d[nxt]);\\n else if(e[nxt]==e[x] or e[nxt]==e[y])insert(x,nxt,mask|(1<<pos[nxt]),dist+add+(mask>>pos[nxt]&1?0:d[nxt]));\\n else insert(x,nxt,1<<pos[nxt],dist+add+d[nxt]);\\n }\\n }\\n ll ret=dp[n-1][n-1][1];\\n if(ret==INF)puts(\\\"-1\\\");\\n else cout<<ret<<'\\\\n';\\n}\\n\\nint main(){\\n for(;;)solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1540,\n \"memory_kb\": 63500,\n \"score_of_the_acc\": -1.1416,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1324_6041768\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\ntemplate <class Cost = int>\\nstruct edge {\\n int from, to;\\n Cost cost;\\n edge() {}\\n edge(int from, int to, Cost cost) : from(from), to(to), cost(cost) {}\\n\\n // for debug\\n friend ostream &operator<<(ostream &os, const edge &e) {\\n os << e.from << \\\" -> \\\" << e.to << \\\" : \\\" << e.cost << \\\", \\\";\\n return os;\\n }\\n};\\n\\ntemplate <class Cost = int>\\nstruct Graph {\\n int V;\\n vector<vector<edge<Cost>>> G;\\n Graph() {}\\n Graph(int V) : V(V) { G.resize(V); }\\n void add_edge(int a, int b, Cost cost = Cost(0)) {\\n G[a].push_back(edge<Cost>(a, b, cost));\\n }\\n void add_edge_undirected(int a, int b, Cost cost = Cost(0)) {\\n G[a].push_back(edge<Cost>(a, b, cost));\\n G[b].push_back(edge<Cost>(b, a, cost));\\n }\\n size_t size() const { return G.size(); }\\n const vector<edge<Cost>> &operator[](int id) const { return G[id]; }\\n\\n // for debug\\n friend ostream &operator<<(ostream &os, const Graph g) {\\n for (int i = 0; i < g.size(); i++) {\\n os << g[i];\\n if (i + 1 < g.size()) os << endl;\\n }\\n return os;\\n }\\n};\\n\\n// verified\\n// https://atcoder.jp/contests/dwacon6th-final-open/submissions/10023433\\ntemplate <class Cost>\\nvector<Cost> dijkstra(Graph<Cost> &g, int s) {\\n assert(0 <= s && s < g.size());\\n vector<Cost> dist;\\n dist.assign(g.size(), numeric_limits<Cost>::max());\\n dist[s] = Cost(0);\\n MinHeap<pair<Cost, int>> q;\\n q.push(make_pair(Cost(0), s));\\n while (!q.empty()) {\\n auto a = q.top();\\n q.pop();\\n int v = a.second;\\n if (dist[v] < a.first) continue;\\n for (auto e : g[v]) {\\n if (dist[e.to] > dist[v] + e.cost) {\\n dist[e.to] = dist[v] + e.cost;\\n q.push(make_pair(dist[e.to], e.to));\\n }\\n }\\n }\\n return dist;\\n}\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\nstruct city {\\n int h, fee, id, h_id;\\n city() {}\\n city(int h, int fee, int id, int h_id) : h(h), fee(fee), id(id), h_id(h_id) {}\\n bool operator<(const city &c) const { return h < c.h; }\\n};\\n\\nbool solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) return false;\\n\\n vector<city> cs(n, {0, 0, -1, -1});\\n vector<int> h_cnt(1001, 0);\\n for (int i = 1; i < n - 1; i++) {\\n int d, e;\\n cin >> d >> e;\\n cs[i] = city(e, d, i, h_cnt[e]++);\\n }\\n cs[0] = city(0, 0, 0, 0), cs[n - 1] = city(1000, 0, n - 1, 0);\\n h_cnt[0] = 1, h_cnt[1000] = 1;\\n sort(all(cs));\\n\\n vector<int> rev(n, -1);\\n for (int i = 0; i < n; i++) { rev[cs[i].id] = i; }\\n\\n dmp(rev);\\n\\n Graph<int> G(n), rG(n);\\n for (int i = 0; i < m; i++) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--;\\n b--;\\n a = rev[a], b = rev[b];\\n if (cs[a].h <= cs[b].h) { G.add_edge(a, b, c); }\\n if (cs[a].h >= cs[b].h) { rG.add_edge(b, a, c); }\\n }\\n\\n // Graph<int> g(n * n * (1 << 10));\\n\\n auto encode = [&](int i, int j, int S) {\\n return n * (1 << 10) * i + (1 << 10) * j + S;\\n };\\n\\n auto decode = [&](int v, int &i, int &j, int &S) {\\n S = v % (1 << 10), v /= (1 << 10);\\n j = v % n, v /= n;\\n i = v % n;\\n return;\\n };\\n\\n vector<int> dist;\\n dist.assign(n * n * (1 << 10), INF);\\n int s = encode(0, 0, 1);\\n dist[s] = 0;\\n\\n MinHeap<pair<int, int>> q;\\n q.push(make_pair(dist[s], s));\\n\\n auto update = [&](int u, int v, int cost) {\\n if (dist[v] > dist[u] + cost) {\\n dist[v] = dist[u] + cost;\\n q.push(make_pair(dist[v], v));\\n }\\n };\\n\\n while (!q.empty()) {\\n auto [d, u] = q.top();\\n q.pop();\\n if (dist[u] < d) continue;\\n\\n int i = -1, j = -1, S = -1;\\n decode(u, i, j, S);\\n\\n if (cs[i].h <= cs[j].h) {\\n for (auto e : G[i]) {\\n int add = e.cost;\\n int mask = (1 << cs[e.to].h_id);\\n if (cs[e.to].h == cs[j].h) {\\n if (!((S >> cs[e.to].h_id) & 1)) add += cs[e.to].fee;\\n int v = encode(e.to, j, S | mask);\\n update(u, v, add);\\n } else if (cs[e.to].h > cs[j].h) {\\n add += cs[e.to].fee;\\n int v = encode(e.to, j, mask);\\n update(u, v, add);\\n } else {\\n add += cs[e.to].fee;\\n int v = encode(e.to, j, S);\\n update(u, v, add);\\n }\\n }\\n }\\n\\n if (cs[i].h >= cs[j].h) {\\n for (auto e : rG[j]) {\\n int add = e.cost;\\n int mask = (1 << cs[e.to].h_id);\\n if (cs[i].h == cs[e.to].h) {\\n if (!((S >> cs[e.to].h_id) & 1)) add += cs[e.to].fee;\\n int v = encode(i, e.to, S | mask);\\n update(u, v, add);\\n } else if (cs[e.to].h > cs[i].h) {\\n add += cs[e.to].fee;\\n int v = encode(i, e.to, mask);\\n update(u, v, add);\\n } else {\\n add += cs[e.to].fee;\\n int v = encode(i, e.to, S);\\n update(u, v, add);\\n }\\n }\\n }\\n\\n // for (auto e : g[v]) {\\n // if (dist[e.to] > dist[v] + e.cost) {\\n // dist[e.to] = dist[v] + e.cost;\\n // q.push(make_pair(dist[e.to], e.to));\\n // }\\n // }\\n }\\n\\n int ans = dist[encode(n - 1, n - 1, 1)];\\n if (ans == INF)\\n cout << -1 << endl;\\n else\\n cout << ans << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n while (solve()) {}\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 14988,\n \"score_of_the_acc\": -0.1959,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1324_5920294\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=55,INF=1<<29;\\n\\nvector<pair<int,int>> G[MAX];\\nvector<pair<int,int>> rG[MAX];\\nint h[MAX];\\nint cost[MAX];\\nvector<int> pos[MAX];\\n\\nint dp[MAX][MAX][1<<10];\\n\\nint memo[MAX][MAX];\\n\\nvoid init(int N){\\n for(int i=0;i<N;i++){\\n G[i].clear();\\n rG[i].clear();\\n pos[i].clear();\\n h[i]=cost[i]=0;\\n for(int j=0;j<N;j++) memo[i][j]=-1;\\n }\\n for(int i=0;i<=N;i++) for(int j=0;j<=N;j++) for(int k=0;k<(1<<10);k++) dp[i][j][k]=INF;\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N,M;cin>>N>>M;\\n if(N==0&&M==0) break;\\n init(N);\\n \\n h[0]=0;\\n h[N-1]=1000;\\n cost[0]=cost[N-1]=0;\\n for(int i=1;i<N-1;i++){\\n cin>>cost[i]>>h[i];\\n }\\n \\n vector<int> useh(N);\\n for(int i=0;i<N;i++) useh[i]=h[i];\\n sort(all(useh));\\n useh.erase(unique(all(useh)),useh.end());\\n \\n for(int i=0;i<N;i++){\\n h[i]=lower_bound(all(useh),h[i])-useh.begin();\\n pos[h[i]].push_back(i);\\n }\\n \\n for(int i=0;i<M;i++){\\n int a,b,c;cin>>a>>b>>c;\\n a--;b--;\\n G[a].push_back(mp(b,c));\\n rG[b].push_back(mp(a,c));\\n }\\n \\n dp[0][0][1]=0;\\n \\n auto p=[&](int hh,int id){\\n if(memo[hh][id]!=-1) return memo[hh][id];\\n for(int i=0;i<si(pos[hh]);i++){\\n if(pos[hh][i]==id) return memo[hh][id]=i;\\n }\\n return -1;\\n };\\n \\n for(int t=0;t<N;t++){\\n for(int i=0;i<N;i++){\\n for(int j=0;j<N;j++){\\n int z;\\n if(h[i]>=h[j]) z=si(pos[h[i]]);\\n else z=si(pos[h[j]]);\\n for(int k=0;k<(1<<z);k++){\\n if(dp[i][j][k]==INF) continue;\\n \\n for(auto to:G[i]){\\n if(h[i]>h[to.fi]) continue;\\n if(h[i]==h[j]){\\n if(h[i]==h[to.fi]){\\n int x=p(h[i],to.fi);\\n if(k&(1<<x)){\\n chmin(dp[to.fi][j][k],dp[i][j][k]+to.se);\\n }else{\\n chmin(dp[to.fi][j][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else{\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else if(h[i]>h[j]){\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }else{\\n if(h[j]==h[to.fi]){\\n int x=p(h[j],to.fi);\\n if(k&(1<<x)){\\n chmin(dp[to.fi][j][k],dp[i][j][k]+to.se);\\n }else{\\n chmin(dp[to.fi][j][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else{\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[to.fi][j][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }\\n }\\n \\n for(auto to:rG[j]){\\n if(h[i]>h[to.fi]) continue;\\n if(h[i]==h[j]){\\n if(h[j]==h[to.fi]){\\n int x=p(h[j],to.fi);\\n if(k&(1<<x)){\\n chmin(dp[i][to.fi][k],dp[i][j][k]+to.se);\\n }else{\\n chmin(dp[i][to.fi][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else{\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else if(h[j]>h[i]){\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }else{\\n if(h[i]==h[to.fi]){\\n int x=p(h[i],to.fi);\\n if(k&(1<<x)){\\n chmin(dp[i][to.fi][k],dp[i][j][k]+to.se);\\n }else{\\n chmin(dp[i][to.fi][k|(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }else{\\n int x=p(h[to.fi],to.fi);\\n chmin(dp[i][to.fi][(1<<x)],dp[i][j][k]+to.se+cost[to.fi]);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n \\n int ans=INF;\\n \\n for(int k=0;k<(1<<10);k++) chmin(ans,dp[N-1][N-1][k]);\\n \\n if(ans==INF) ans=-1;\\n \\n cout<<ans<<\\\"\\\\n\\\";\\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6750,\n \"memory_kb\": 14624,\n \"score_of_the_acc\": -1.1771,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1324_5852146\",\n \"code_snippet\": \"#include\\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define ALL(x) begin(x),end(x)\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define debug(v) cout<<#v<<\\\":\\\";for(auto x:v){cout<<x<<' ';}cout<<endl;\\n#define mod 998244353\\nusing ll=long long;\\nconst int INF=10000000;\\nconst ll LINF=1001002003004005006ll;\\nint dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\ntemplate<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}\\n\\nstruct IOSetup{\\n IOSetup(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout<<fixed<<setprecision(12);\\n }\\n} iosetup;\\n \\ntemplate<typename T>\\nostream &operator<<(ostream &os,const vector<T>&v){\\n for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?\\\"\\\":\\\" \\\");\\n return os;\\n}\\ntemplate<typename T>\\nistream &operator>>(istream &is,vector<T>&v){\\n for(T &x:v)is>>x;\\n return is;\\n}\\n\\nint N,M;\\n\\nusing P=pair<int,int>;\\nusing PP=pair<int,P>;\\n\\n/*\\n高い場所に１移動する場合\\n逐一，同じ移動先に移動するならコストを1回しか支払わないようにしながらDijkstraをすれば良い\\n同じ高さの移動のみ両者の移動がトポロジカルソート順になるとは限らない\\nここは位置のスワップコストを求めてやれば良い．\\nd[i][j] -> d[j][i]とする場合のコスト\\nこの際，i, jのvisa feeは一度だけ支払えば良い\\n\\n到達時にvisa feeを支払いつつdijkstraをすることを考える．\\n同じ高さで(i,j) -> (j,i)に移動するときに，お互い，visa feeを支払わずに移動してよいとする．\\nなぜならiがiに到達する時点でiのvisa feeを支払済であり，jに関しても同じことが言えるためである\\nまた，このようなswapコストを定義する理由としては，同じ高さでの移動に関しては行きはa-b-cの順序で移動するが，\\n帰りと逆順ではc-b-aで移動している可能性がある(両者の移動順序がトポソ不可)ため，\\nd[a][c]->d[b][b]->d[c][a]という遷移だと，a,cのvisa feeをそれぞれ二度支払いそうになる．\\nよって同じ高さでのswap costを用意してやるとうまい．\\n\\n天才か？\\n*/\\n\\nvoid solve(){\\n vector<int> D(N),E(N);// visa fee, altitude\\n D[0]=0, D[N-1]=0;\\n E[0]=0, E[N-1]=INF;\\n for(int i=1;i<N-1;i++) cin>>D[i]>>E[i];\\n\\n vector<vector<int>> C(N,vector<int>(N,INF));\\n rep(i,N) C[i][i]=0;\\n rep(i,M){\\n int u,v,c;cin>>u>>v>>c;u--,v--;\\n chmin(C[u][v],c);\\n }\\n\\n vector<vector<int>> sw(N,vector<int>(N,INF));// 同じ高さの場合のみDAGではなくなる．行きと帰りで位置をswapするコスト\\n rep(i,N){\\n priority_queue<P,vector<P>,greater<P>> que;\\n\\n sw[i][i]=0;\\n que.emplace(0, i);\\n\\n while(!que.empty()){\\n auto [d, cur]=que.top();que.pop();\\n if(d<sw[i][cur]) continue;\\n\\n rep(j,N)if(i!=j and E[i]==E[j]){\\n if(chmin(sw[i][j], d+C[cur][j]*2+D[j])) que.emplace(sw[i][j], j);// ここもD[j]の支払いは一度で良い\\n }\\n }\\n rep(j,N)if(i!=j) sw[i][j]-=D[j];// i, jもうコスト支払済なのでいい\\n }\\n\\n priority_queue<PP,vector<PP>,greater<PP>> que;\\n vector<vector<int>> res(N,vector<int>(N, INF));\\n\\n res[0][0]=0;\\n que.emplace(res[0][0], make_pair(0,0));\\n while(!que.empty()){\\n auto pp=que.top();que.pop();\\n int d=pp.first;\\n int i,j;\\n tie(i,j)=pp.second;\\n\\n if(res[i][j]<d) continue;\\n \\n // step - i\\n rep(k,N)if(E[k]>=E[i]){\\n if(chmin(res[k][j], d+C[i][k]+D[k])) que.emplace(res[k][j],make_pair(k,j));\\n }\\n\\n // step - j\\n rep(k,N)if(E[k]>=E[j]){\\n if(chmin(res[i][k], d+C[k][j]+D[k])) que.emplace(res[i][k],make_pair(i,k));\\n }\\n\\n // swap\\n if(i!=j and E[i]==E[j]){\\n if(chmin(res[j][i], d+sw[i][j])) que.emplace(res[j][i],make_pair(j,i));\\n }\\n\\n // i -> k and j-> k\\n rep(k,N)if(E[k]>=E[i] and E[k]>=E[j]){\\n if(chmin(res[k][k], d+D[k]+C[i][k]+C[k][j])) que.emplace(res[k][k], make_pair(k,k));\\n }\\n }\\n if(res[N-1][N-1]<INF) cout<<res[N-1][N-1]<<endl;\\n else cout<<-1<<endl;\\n return ;\\n}\\n\\nsigned main(){\\n while(cin>>N>>M, N or M) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.0115,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1324_5526691\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 10000000;\\nint main(){\\n while (true){\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0){\\n break;\\n }\\n vector<int> d(n), e(n);\\n d[0] = 0;\\n e[0] = 0;\\n for (int i = 1; i < n - 1; i++){\\n cin >> d[i] >> e[i];\\n }\\n d[n - 1] = 0;\\n e[n - 1] = 1000;\\n vector<vector<int>> E(n, vector<int>(n, INF));\\n for (int i = 0; i < n; i++){\\n E[i][i] = 0;\\n }\\n for (int i = 0; i < m; i++){\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--;\\n b--;\\n E[a][b] = c;\\n }\\n vector<int> e2 = e;\\n sort(e2.begin(), e2.end());\\n e2.erase(unique(e2.begin(), e2.end()), e2.end());\\n int h = e2.size();\\n for (int i = 0; i < n; i++){\\n e[i] = lower_bound(e2.begin(), e2.end(), e[i]) - e2.begin();\\n }\\n vector<vector<int>> id(h);\\n for (int i = 0; i < n; i++){\\n id[e[i]].push_back(i);\\n }\\n vector<vector<vector<vector<int>>>> dp(n, vector<vector<vector<int>>>(n, vector<vector<int>>(n, vector<int>(n, INF))));\\n for (int i = 0; i < h; i++){\\n int cnt = id[i].size();\\n for (int j = 0; j < (1 << cnt); j++){\\n vector<int> id2;\\n int sum = 0;\\n for (int k = 0; k < cnt; k++){\\n if ((j >> k & 1) == 1){\\n id2.push_back(id[i][k]);\\n sum += d[id[i][k]];\\n }\\n }\\n int cnt2 = id2.size();\\n vector<vector<int>> dp2(cnt2, vector<int>(cnt2, INF));\\n for (int k = 0; k < cnt2; k++){\\n for (int l = 0; l < cnt2; l++){\\n dp2[k][l] = E[id2[k]][id2[l]];\\n }\\n }\\n for (int u = 0; u < cnt2; u++){\\n for (int v = 0; v < cnt2; v++){\\n for (int w = 0; w < cnt2; w++){\\n dp2[v][w] = min(dp2[v][w], dp2[v][u] + dp2[u][w]);\\n }\\n }\\n }\\n for (int k1 = 0; k1 < cnt2; k1++){\\n for (int l1 = 0; l1 < cnt2; l1++){\\n for (int k2 = 0; k2 < cnt2; k2++){\\n for (int l2 = 0; l2 < cnt2; l2++){\\n dp[id2[k1]][id2[l1]][id2[k2]][id2[l2]] = min(dp[id2[k1]][id2[l1]][id2[k2]][id2[l2]], dp2[k1][l1] + dp2[l2][k2] + sum);\\n }\\n }\\n }\\n }\\n }\\n }\\n vector<int> x;\\n for (int i = 0; i < h; i++){\\n int cnt = id[i].size();\\n for (int j = 0; j < cnt; j++){\\n x.push_back(id[i][j]);\\n }\\n }\\n vector<vector<int>> dp2(n, vector<int>(n, INF));\\n dp2[0][0] = 0;\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n int v = x[i];\\n int w = x[j];\\n int cnt1 = id[e[v]].size();\\n int cnt2 = id[e[w]].size();\\n for (int i2 = 0; i2 < cnt1; i2++){\\n int v2 = id[e[v]][i2];\\n for (int k = 0; k < n; k++){\\n if (e[v] < e[k]){\\n dp2[k][w] = min(dp2[k][w], dp2[v][w] + dp[v][v2][v][v] + E[v2][k]);\\n }\\n }\\n }\\n for (int i2 = 0; i2 < cnt2; i2++){\\n int w2 = id[e[w]][i2];\\n for (int k = 0; k < n; k++){\\n if (e[w] < e[k]){\\n dp2[v][k] = min(dp2[v][k], dp2[v][w] + dp[w][w][w][w2] + E[k][w2]);\\n }\\n }\\n }\\n if (e[v] == e[w]){\\n for (int i2 = 0; i2 < cnt1; i2++){\\n for (int j2 = 0; j2 < cnt2; j2++){\\n int v2 = id[e[v]][i2];\\n int w2 = id[e[w]][j2];\\n for (int k = 0; k < n; k++){\\n for (int l = 0; l < n; l++){\\n if (e[v] < e[k] && e[w] < e[l]){\\n dp2[k][l] = min(dp2[k][l], dp2[v][w] + dp[v][v2][w][w2] + E[v2][k] + E[l][w2]);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n if (dp2[n - 1][n - 1] == INF){\\n cout << -1 << endl;\\n } else {\\n cout << dp2[n - 1][n - 1] << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 32032,\n \"score_of_the_acc\": -0.504,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1324_5048249\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<queue>\\n#include<algorithm>\\nusing namespace std;\\nusing P = pair<int, int>;\\nusing Q = pair<int, P>;\\nconst int INF = 1000000000;\\n\\nint n, m, d, f, a, b, c, towncost[50], dp[50][50], tmp2[50][50], tmp[50][50];\\nvector<P> e[50], re[50];\\nmap<int, vector<int>> mp;\\nvector<int> used;\\nset<int> can_use;\\n\\nint get(int a, int b, bool is_a_top, bool is_b_top) {\\n vector<P> A, B;\\n A.push_back(P(a, 0)); B.push_back(P(b, 0));\\n int ans = INF;\\n for (P i : (is_a_top ? re[a] : A)) if (can_use.count(i.first)) {\\n for (P j : (is_b_top ? e[b] : B)) if (can_use.count(j.first)) {\\n ans = min(ans, dp[i.first][j.first] + i.second + j.second);\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n while (scanf(\\\"%d%d\\\", &n, &m), n) {\\n mp.clear();\\n used.clear();\\n can_use.clear();\\n for (int i = 0; i < 50; i++) {\\n e[i].clear();\\n re[i].clear();\\n for (int j = 0; j < 50; j++) {\\n dp[i][j] = INF;\\n }\\n }\\n dp[0][0] = 0;\\n for (int i = 1; i < n-1; i++) {\\n scanf(\\\"%d%d\\\", &d, &f);\\n towncost[i] = d;\\n mp[f].push_back(i);\\n }\\n towncost[0] = towncost[n-1] = 0;\\n for (int i = 0; i < m; i++) {\\n scanf(\\\"%d%d%d\\\", &a, &b, &c);\\n a--; b--;\\n e[a].push_back(P(b, c));\\n re[b].push_back(P(a, c));\\n }\\n mp[1000].push_back(n-1);\\n used.push_back(0);\\n can_use.insert(0);\\n for (auto it = mp.begin(); it != mp.end(); it++) {\\n vector<int> v = it->second;\\n map<int, int> r;\\n for (int i = 0; i < v.size(); i++) r[v[i]] = i;\\n for (int i : used) for (int j : used) tmp[i][j] = dp[i][j];\\n for (int i : used) for (int j : v) {\\n tmp[i][j] = get(i, j, false, true);\\n }\\n for (int i : v) for (int j : used) {\\n tmp[i][j] = get(i, j, true, false);\\n }\\n for (int i : v) for (int j : v) {\\n tmp[i][j] = get(i, j, true, true);\\n }\\n for (int i : v) used.push_back(i), can_use.insert(i);\\n for (int i = 1; i < (1 << v.size()); i++) {\\n int sum = 0;\\n for (int j = 0; j < v.size(); j++) if (i & (1 << j)) {\\n sum += towncost[v[j]];\\n }\\n priority_queue<Q> que;\\n for (int j : used) {\\n for (int k : used) {\\n if ((r.count(j) == 0 || (i & (1 << r[j]))) && (r.count(k) == 0 || (i & (1 << r[k])))) {\\n tmp2[j][k] = tmp[j][k];\\n que.push(Q(tmp2[j][k], P(j, k)));\\n } else {\\n tmp2[j][k] = INF;\\n }\\n }\\n }\\n while (!que.empty()) {\\n Q q = que.top(); que.pop();\\n int cost = q.first, j = q.second.first, k = q.second.second;\\n if (tmp2[j][k] < cost) continue;\\n dp[j][k] = min(dp[j][k], cost + sum);\\n for (P l : e[j]) if (r.count(l.first) && (i & (1 << r[l.first]))) {\\n int newcost = cost + l.second;\\n if (tmp2[l.first][k] > newcost) {\\n tmp2[l.first][k] = newcost;\\n que.push(Q(newcost, P(l.first, k)));\\n }\\n }\\n for (P l : re[k]) if (r.count(l.first) && (i & (1 << r[l.first]))) {\\n int newcost = cost + l.second;\\n if (tmp2[j][l.first] > newcost) {\\n tmp2[j][l.first] = newcost;\\n que.push(Q(newcost, P(j, l.first)));\\n }\\n }\\n }\\n }\\n }\\n if (dp[n-1][n-1] == INF) dp[n-1][n-1] = -1;\\n printf(\\\"%d\\\\n\\\", dp[n-1][n-1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5350,\n \"memory_kb\": 2908,\n \"score_of_the_acc\": -0.792,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1324_4943293\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <numeric>\\n#include <cfloat>\\n#include <climits>\\n#include <algorithm>\\n#include <iomanip>\\n#include <queue>\\n#include <unordered_map>\\n#include <string>\\n#include <tuple>\\nstruct Road {\\n\\tint to, cost;\\n};\\nstruct Town {\\n\\tint visit_cost, altitude;\\n};\\nstruct State {\\n\\tint go_pos, return_pos, cost;\\n\\tunsigned long long int visited;\\n};\\nint main() {\\n\\twhile (true) {\\n\\t\\tint n, m; std::cin >> n >> m;\\n\\t\\tif (n == 0 && m == 0) break;\\n\\t\\tstd::vector<Town> towns(n);\\n\\t\\ttowns[0].altitude = 0; towns.back().altitude = 1000;\\n\\t\\tfor (auto i = 1; i < n - 1; ++i) {\\n\\t\\t\\tstd::cin >> towns[i].visit_cost >> towns[i].altitude;\\n\\t\\t}\\n\\t\\tstd::vector<std::vector<Road>> road(n), rev_road(n);\\n\\t\\tfor (auto i = 0; i < m; ++i) {\\n\\t\\t\\tint a, b, c; std::cin >> a >> b >> c; --a; --b;\\n\\t\\t\\tif (towns[a].altitude <= towns[b].altitude) road[a].push_back(Road{ b, c });\\n\\t\\t\\tif (towns[b].altitude <= towns[a].altitude) rev_road[b].push_back(Road{ a, c });\\n\\t\\t}\\n\\t\\tstd::vector<std::vector<std::unordered_map<unsigned long long int, int>>> min_cost(n, std::vector<std::unordered_map<unsigned long long int, int>>(n));\\n\\t\\tconst auto comparator = [](const State& a, const State& b) {return a.cost > b.cost; };\\n\\t\\tstd::priority_queue<State, std::vector<State>, decltype(comparator)> queue(comparator);\\n\\t\\tmin_cost[0][0][0] = 0;\\n\\t\\tqueue.push(State{ 0, 0, 0, 0 });\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.top(); queue.pop();\\n\\t\\t\\tif (min_cost[top.go_pos][top.return_pos][top.visited] < top.cost) continue;\\n\\t\\t\\tconst auto max_height = std::max(towns[top.go_pos].altitude, towns[top.return_pos].altitude);\\n\\t\\t\\tif (towns[top.return_pos].altitude == max_height) for (const auto r : road[top.go_pos]) {\\n\\t\\t\\t\\tconst auto visited = towns[r.to].altitude < max_height ? top.visited : (towns[r.to].altitude == max_height ? top.visited | (1ULL << r.to) : (1ULL << r.to));\\n\\t\\t\\t\\tconst auto cost = r.cost + top.cost + (top.visited & (1ULL << r.to) ? 0 : towns[r.to].visit_cost);\\n\\t\\t\\t\\tconst auto find = min_cost[r.to][top.return_pos].find(visited);\\n\\t\\t\\t\\tif (find == min_cost[r.to][top.return_pos].end() || find->second > cost) {\\n\\t\\t\\t\\t\\tmin_cost[r.to][top.return_pos][visited] = cost;\\n\\t\\t\\t\\t\\tqueue.push(State{ r.to, top.return_pos, cost, visited });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (towns[top.go_pos].altitude == max_height) for (const auto r : rev_road[top.return_pos]) {\\n\\t\\t\\t\\tconst auto visited = towns[r.to].altitude < max_height ? top.visited : (towns[r.to].altitude == max_height ? top.visited | (1ULL << r.to) : (1ULL << r.to));\\n\\t\\t\\t\\tconst auto cost = r.cost + top.cost + (top.visited & (1ULL << r.to) ? 0 : towns[r.to].visit_cost);\\n\\t\\t\\t\\tconst auto find = min_cost[top.go_pos][r.to].find(visited);\\n\\t\\t\\t\\tif (find == min_cost[top.go_pos][r.to].end() || find->second > cost) {\\n\\t\\t\\t\\t\\tmin_cost[top.go_pos][r.to][visited] = cost;\\n\\t\\t\\t\\t\\tqueue.push(State{ top.go_pos, r.to, cost, visited });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst auto min = std::min_element(min_cost.back().back().begin(), min_cost.back().back().end(), [](const std::pair<unsigned long long int, int>& a, const std::pair<unsigned long long int, int>& b) {return a.second < b.second; });\\n\\t\\tif (min == min_cost.back().back().end()) {\\n\\t\\t\\tstd::cout << \\\"-1\\\\n\\\";\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tstd::cout << min->second << '\\\\n';\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 10540,\n \"score_of_the_acc\": -0.151,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1324_4924144\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\nusing namespace std;\\nconst int inf = 1e9;\\n\\nstruct state{\\n int s,t;\\n int mask;\\n int d;\\n state(int s, int t, int mask, int d):s(s),t(t),mask(mask),d(d){}\\n state(){}\\n bool operator <(const state &a) const{\\n return d > a.d;\\n }\\n};\\nint solve(vector<int> &v, vector<int> &h, vector<vector<pair<int,int>>> &gs, vector<vector<pair<int,int>>> >){\\n int n = gs.size();\\n vector<int> mapping(n);\\n vector<int> idx(1001, 0);\\n for(int i=0; i<n; i++){\\n mapping[i] = idx[h[i]]++;\\n }\\n vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>(2<<10, inf)));\\n dp[0][0][1<<mapping[0]] = 0;\\n priority_queue<state> wait;\\n wait.push(state(0, 0, 1<<mapping[0], 0));\\n while(!wait.empty()){\\n int s = wait.top().s;\\n int t = wait.top().t;\\n int mask = wait.top().mask;\\n int d = wait.top().d;\\n wait.pop();\\n if(d > dp[s][t][mask]) continue;\\n if(h[s] <= h[t]){\\n for(auto next: gs[s]){\\n int ns = next.first;\\n int nd = d +next.second +v[ns];\\n int nmask = mask;\\n if(h[ns] == h[t]){\\n if(mask>>mapping[ns]&1){\\n nd -= v[ns];\\n }\\n nmask |= 1<<mapping[ns];\\n }else if(h[ns] > h[t]){\\n nmask = 1<<mapping[ns];\\n }\\n if(nd < dp[ns][t][nmask]){\\n dp[ns][t][nmask] = nd;\\n wait.push(state(ns, t, nmask, nd));\\n }\\n }\\n }\\n if(h[t] <= h[s]){\\n for(auto next: gt[t]){\\n int nt = next.first;\\n int nd = d +next.second +v[nt];\\n int nmask = mask;\\n if(h[nt] == h[s]){\\n if(mask>>mapping[nt]&1){\\n nd -= v[nt];\\n }\\n nmask |= 1<<mapping[nt];\\n }else if(h[nt] > h[s]){\\n nmask = 1<<mapping[nt];\\n }\\n if(nd < dp[s][nt][nmask]){\\n dp[s][nt][nmask] = nd;\\n wait.push(state(s, nt, nmask, nd));\\n }\\n }\\n }\\n }\\n int res = *min_element(dp[n-1][n-1].begin(), dp[n-1][n-1].end());\\n if(res == inf) return -1;\\n return res;\\n}\\n\\nint main(){\\n while(1){\\n int n,m;\\n cin >> n >> m;\\n if(n == 0) break;\\n\\n vector<int> d(n), e(n);\\n d[0] = d[n-1] = 0;\\n e[0] = 0;\\n e[n-1] = 1000;\\n for(int i=1; i<n-1; i++){\\n cin >> d[i] >> e[i];\\n }\\n vector<vector<pair<int,int>>> adj(n), rev(n);\\n for(int i=0; i<m; i++){\\n int a,b,c;\\n cin >> a >> b >> c;\\n a--; b--;\\n if(e[a] <= e[b]) adj[a].emplace_back(b, c);\\n if(e[a] >= e[b]) rev[b].emplace_back(a, c);\\n }\\n cout << solve(d, e, adj, rev) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 26352,\n \"score_of_the_acc\": -0.3811,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1324_4837149\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,int> LP;\\nconst int INF=1e8+7;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nvector<vector<int>> path;\\nvector<P> va;\\nint t[100][2];\\ntypedef vector<int> V1;\\ntypedef vector<vector<int>> V2;\\ntypedef vector<vector<vector<int>>> V3;\\nconst int dis_n=20;\\nint dis[dis_n][dis_n][dis_n][dis_n];\\n\\nvoid memset_dis(){\\n int a,b,c,d;\\n for(a=0;a<dis_n;a++){\\n for(b=0;b<dis_n;b++){\\n for(c=0;c<dis_n;c++){\\n for(d=0;d<dis_n;d++){\\n dis[a][b][c][d]=INF;\\n }\\n }\\n }\\n }\\n}\\n\\nvoid check(int ta,int tb,vector<int>& v1){\\n if(ta<=tb){\\n v1.push_back(tb-ta);\\n check(ta,tb-1,v1);\\n v1.pop_back();\\n check(ta,tb-1,v1);\\n return;\\n }\\n if(v1.empty())return;\\n int n=v1.size();\\n int i,j,k,l;\\n int a,b,c,d;\\n int s;\\n vector<vector<int>> dis_temp(n,vector<int>(n,INF));\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n a=ta+v1[i],b=ta+v1[j];\\n dis_temp[i][j]=path[a][b];\\n }\\n }\\n for(k=0;k<n;k++){\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n dis_temp[i][j]=min(dis_temp[i][j],dis_temp[i][k]+dis_temp[k][j]);\\n }\\n }\\n }\\n s=0;\\n for(i=0;i<n;i++){\\n s+=t[ta+v1[i]][0];\\n }\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n for(k=0;k<n;k++){\\n for(l=0;l<n;l++){\\n a=v1[i],b=v1[j],c=v1[k],d=v1[l];\\n dis[a][b][c][d]=min(dis[a][b][c][d],s+dis_temp[i][k]+dis_temp[j][l]);\\n }\\n }\\n }\\n }\\n}\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c,d;\\n int x,y;\\n while(cin>>n>>m){\\n if(!n)break;\\n path.assign(n,vector<int>(n,INF));\\n va.assign(1e3+7,P(n+10,-1));\\n vector<tuple<int,int,int>> vt1;\\n vector<int> v1(n);\\n V2 dp(n+10,V1(n+10,INF));\\n vt1.push_back(make_tuple(0,0,0));\\n vt1.push_back(make_tuple(1e3,0,n-1));\\n for(i=1;i<n-1;i++){\\n cin>>a>>b;\\n vt1.push_back(make_tuple(b,a,i));\\n }\\n sort(vt1.begin(),vt1.end());\\n for(i=0;i<n;i++){\\n tie(a,b,c)=vt1[i];\\n v1[c]=i;\\n va[a].first=min(va[a].first,i);\\n va[a].second=max(va[a].second,i);\\n t[i][0]=b,t[i][1]=a;\\n }\\n t[n-1][1]=1e3;\\n for(i=0;i<m;i++){\\n cin>>a>>b>>c;\\n a--,b--;\\n a=v1[a],b=v1[b];\\n path[a][b]=min(path[a][b],c);\\n }\\n for(i=0;i<n;i++){\\n path[i][i]=0;\\n }\\n dp[0][0]=0;\\n for(i=0;i<=1e3;i++){\\n if(va[i].first>n)continue;\\n memset_dis();\\n v1.clear();\\n x=va[i].first,y=va[i].second;\\n check(x,y,v1);\\n m=y-x+1;\\n vector<vector<int>> dp_temp(m+10,vector<int>(m+10,INF));\\n for(j=0;j<m;j++){\\n for(k=0;k<m;k++){\\n for(a=0;a<x;a++){\\n if(path[a][x+j]==INF)continue;\\n for(b=0;b<x;b++){\\n if(path[x+k][b]==INF)continue;\\n dp_temp[j][k]=min(dp_temp[j][k],dp[a][b]+path[a][x+j]+path[x+k][b]);\\n }\\n }\\n }\\n }\\n for(j=0;j<m;j++){\\n for(k=0;k<m;k++){\\n for(a=0;a<m;a++){\\n for(b=0;b<m;b++){\\n dp[x+a][x+b]=min(dp[x+a][x+b],dp_temp[j][k]+dis[j][b][a][k]);\\n }\\n }\\n }\\n }\\n for(j=0;j<=y;j++){\\n for(a=0;a<x;a++){\\n for(b=0;b<m;b++){\\n for(c=0;c<m;c++){\\n dp[j][x+c]=min(dp[j][x+c],dp[j][a]+path[x+b][a]+dis[b][c][b][b]);\\n dp[x+c][j]=min(dp[x+c][j],dp[a][j]+path[a][x+b]+dis[b][b][c][b]);\\n }\\n }\\n }\\n }\\n }\\n int s=dp[n-1][n-1];\\n if(s>=INF)s=-1;\\n cout<<s<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3724,\n \"score_of_the_acc\": -0.0198,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1324_4767320\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353/100;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acos(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nconst int max_n = 1 << 22;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nusing speP = pair<int, P>;\\nint cost[50][50];\\nint dist[50][50];\\n\\nint swcost[50][50];\\nint n, m;\\nvoid solve() {\\n\\tvector<int> d(n), h(n);\\n\\trep(i, n) {\\n\\t\\tif (i == 0) {\\n\\t\\t\\td[i] = 0, h[i] = 0;\\n\\t\\t}\\n\\t\\telse if (i == n - 1) {\\n\\t\\t\\td[i] = 0, h[i] = 1000;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcin >> d[i] >> h[i];\\n\\t\\t}\\n\\t}\\n\\trep(i, n)rep(j, n) {\\n\\t\\tif (i == j)cost[i][j] = 0;\\n\\t\\telse cost[i][j] = mod;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tint a, b, c; cin >> a >> b >> c; a--; b--;\\n\\t\\tcost[a][b] = c;\\n\\t}\\n\\trep(i, n) {\\n\\t\\trep(j, n) {\\n\\t\\t\\tswcost[i][j] = mod;\\n\\t\\t}\\n\\t\\tswcost[i][i] = d[i];\\n\\t\\tpriority_queue<P, vector<P>, greater<P>> q;\\n\\t\\tq.push({ d[i],i });\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tP p = q.top(); q.pop();\\n\\t\\t\\tint id = p.second;\\n\\t\\t\\tif (swcost[i][id] < p.first)continue;\\n\\t\\t\\trep(to, n) {\\n\\t\\t\\t\\tif (h[id] != h[to])continue;\\n\\t\\t\\t\\tint nd = p.first + d[to] + 2 * cost[id][to];\\n\\t\\t\\t\\tif (nd < swcost[i][to]) {\\n\\t\\t\\t\\t\\tswcost[i][to] = nd;\\n\\t\\t\\t\\t\\tq.push({ nd,to });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(j, n) {\\n\\t\\t\\tswcost[i][j] -= d[i] + d[j];\\n\\t\\t}\\n\\t}\\n\\n\\trep(i, n)rep(j, n)dist[i][j] = mod;\\n\\tdist[0][0] = 0;\\n\\tpriority_queue<speP, vector<speP>, greater<speP>> q;\\n\\tq.push({ 0,{0,0} });\\n\\twhile (!q.empty()) {\\n\\t\\tspeP p = q.top(); q.pop();\\n\\t\\tint x = p.second.first, y = p.second.second;\\n\\t\\tif (dist[x][y] < p.first)continue;\\n\\t\\trep(nx, n) {\\n\\t\\t\\tif (h[x] > h[nx])continue;\\n\\t\\t\\tint s = p.first + cost[x][nx] + d[nx];\\n\\t\\t\\tif (s < dist[nx][y]) {\\n\\t\\t\\t\\tdist[nx][y] = s;\\n\\t\\t\\t\\tq.push({ s,{nx,y} });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(ny, n) {\\n\\t\\t\\tif (h[y] > h[ny])continue;\\n\\t\\t\\tint s = p.first + cost[ny][y] + d[ny];\\n\\t\\t\\tif (s < dist[x][ny]) {\\n\\t\\t\\t\\tdist[x][ny] = s;\\n\\t\\t\\t\\tq.push({ s,{x,ny} });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (h[x] == h[y]&&x!=y) {\\n\\t\\t\\tint s = p.first + swcost[x][y];\\n\\t\\t\\tif (s < dist[y][x]) {\\n\\t\\t\\t\\tdist[y][x] = s;\\n\\t\\t\\t\\tq.push({ s,{y,x} });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(nx, n)rep(ny, n) {\\n\\t\\t\\tif (h[x] > h[nx] || h[y] > h[ny])continue;\\n\\t\\t\\tint s = p.first + cost[x][nx] + cost[ny][y] + d[nx] + d[ny];\\n\\t\\t\\tif (nx == ny)s -= d[nx];\\n\\t\\t\\tif (s < dist[nx][ny]) {\\n\\t\\t\\t\\t//cout << \\\"? \\\" << x << \\\" \\\" << y << \\\" \\\" << nx << \\\" \\\" << ny << \\\" \\\" << s << \\\"\\\\n\\\";\\n\\t\\t\\t\\tdist[nx][ny] = s;\\n\\t\\t\\t\\tq.push({ s,{nx,ny} });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t/*rep(i, n) {\\n\\t\\trep(j, n)cout << dist[i][j] << \\\" \\\";\\n\\t\\tcout << \\\"\\\\n\\\";\\n\\t}*/\\n\\t//cout << dist[1][2]<<\\\" \\\"<<swcost[1][2] << \\\"\\\\n\\\";\\n\\tint ans = dist[n - 1][n - 1];\\n\\tif (ans == mod)cout << -1 << \\\"\\\\n\\\";\\n\\telse cout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile (cin >> n >> m, n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 69076,\n \"score_of_the_acc\": -1.0134,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1324_4248759\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstring>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n#include <cstdint>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\n#define MP make_pair\\n#define PB push_back\\n#define inf 1000000007\\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\\n#define all(x) (x).begin(),(x).end()\\n\\ntemplate<typename A, size_t N, typename T>\\nvoid Fill(A (&array)[N], const T &val){\\n std::fill( (T*)array, (T*)(array+N), val );\\n}\\n \\ntemplate<class T> inline bool chmax(T &a, T b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T> inline bool chmin(T &a, T b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nint dp[51][51][1<<10];\\n\\nint main(){\\n int n,m;\\n while(1){\\n cin >> n >> m;\\n if(n==0)break;\\n vector<int>h(n);\\n map<int,int> ss;\\n vector<int> num(n);\\n vector<int> c(n);\\n rep(i,n-2){\\n cin >> c[i+1] >> h[i+1];\\n num[i+1] = ss[h[i+1]];\\n ss[h[i+1]]++;\\n }\\n rep(i,n)rep(j,n)rep(k,1<<10)dp[i][j][k] = inf;\\n h[0] = 0;\\n h[n-1] = 1000;\\n vector<vector<pii> > gu(n);\\n vector<vector<pii> > gd(n);\\n vector<vector<pii> > u(n);\\n vector<vector<pii> > d(n);\\n rep(i,m){\\n int a,b,e;\\n cin >> a >> b >> e;\\n a--;b--;\\n if(h[a]==h[b]){\\n gu[a].push_back(MP(b,e));\\n gd[b].push_back(MP(a,e));\\n u[a].push_back(MP(b,e));\\n d[b].push_back(MP(a,e));\\n }else if(h[a]<h[b]){\\n u[a].push_back(MP(b,e));\\n }else{\\n d[b].push_back(MP(a,e));\\n }\\n }\\n priority_queue<pair<pii,pair<int,int>>,vector<pair<pair<int,int>,pii>>,greater<pair<pair<int,int>,pii>> >pq;\\n dp[0][0][1] = 0;\\n pq.push(MP(MP(0,1),MP(0,0)));\\n while(!pq.empty()){\\n auto x = pq.top();\\n pq.pop();\\n int a = x.second.first;\\n int b = x.second.second;\\n int cost = x.first.first;\\n int reach = x.first.second;\\n if(dp[a][b][reach]!=cost)continue;\\n // cerr << a << \\\" \\\" << b << \\\" \\\" << cost << \\\" \\\" << reach << endl;\\n if(h[a]<=h[b]){\\n for(auto x:u[a]){\\n int nxt = x.first;\\n int dd = cost + x.second;\\n int nxtreach = reach;\\n if(h[nxt]<h[b]){\\n dd += c[nxt];\\n if(chmin(dp[nxt][b][nxtreach],dd)){\\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\\n }\\n }else if(h[nxt]>h[b]){\\n dd += c[nxt];\\n nxtreach = (1<<num[nxt]);\\n if(chmin(dp[nxt][b][nxtreach],dd)){\\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\\n }\\n }else{\\n if(nxt!=b){\\n dd += c[nxt];\\n nxtreach = reach|(1<<num[nxt]);\\n }\\n if(chmin(dp[nxt][b][nxtreach],dd)){\\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\\n }\\n }\\n }\\n }\\n if(h[b]<=h[a]){\\n for(auto x:d[b]){\\n int nxt = x.first;\\n int dd = cost + x.second;\\n int nxtreach = reach;\\n if(h[nxt]<h[a]){\\n dd += c[nxt];\\n if(chmin(dp[a][nxt][nxtreach],dd)){\\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\\n }\\n }else if(h[nxt]>h[a]){\\n dd += c[nxt];\\n nxtreach = (1<<num[nxt]);\\n if(chmin(dp[a][nxt][nxtreach],dd)){\\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\\n }\\n }else{\\n if(nxt!=a){\\n dd += c[nxt];\\n nxtreach = reach|(1<<num[nxt]);\\n }\\n if(chmin(dp[a][nxt][nxtreach],dd)){\\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\\n }\\n }\\n }\\n }\\n if(h[a]==h[b]){\\n for(auto x:gu[a]){\\n int nxt = x.first;\\n int dd = cost + x.second;\\n int nxtreach = reach;\\n \\n if(((reach>>num[nxt])&1)==0){\\n dd += c[nxt];\\n nxtreach = reach|(1<<num[nxt]);\\n }\\n if(chmin(dp[nxt][b][nxtreach],dd)){\\n pq.push(MP(MP(dp[nxt][b][nxtreach],nxtreach),MP(nxt,b)));\\n }\\n \\n }\\n for(auto x:gd[b]){\\n int nxt = x.first;\\n int dd = cost + x.second;\\n int nxtreach = reach;\\n \\n if(((reach>>num[nxt])&1)==0){\\n dd += c[nxt];\\n nxtreach = reach|(1<<num[nxt]);\\n }\\n if(chmin(dp[a][nxt][nxtreach],dd)){\\n pq.push(MP(MP(dp[a][nxt][nxtreach],nxtreach),MP(a,nxt)));\\n }\\n \\n }\\n }\\n }\\n if(dp[n-1][n-1][1]==inf){\\n cout << -1 << endl;\\n }else{\\n cout << dp[n-1][n-1][1] << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 15108,\n \"score_of_the_acc\": -0.2096,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":776,"cells":{"group_id":{"kind":"string","value":"aoj_1325_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nGinkgo Numbers\nWe will define Ginkgo numbers and multiplication on Ginkgo numbers.\nA\nGinkgo number\nis a pair <\nm\n,\nn\n> where\nm\nand\nn\nare integers. For example, <1, 1>, <-2, 1> and <-3,-1> are Ginkgo numbers.\nThe multiplication on Ginkgo numbers is defined by <\nm\n,\nn\n> · <\nx\n,\ny\n> = <\nmx\n−\nny\n,\nmy\n+\nnx\n>. For example, <1, 1> · <-2, 1> = <-3,-1>.\nA Ginkgo number <\nm\n,\nn\n> is called a divisor of a Ginkgo number <\np\n,\nq\n> if there exists a Ginkgo number <\nx\n,\ny\n> such that <\nm\n,\nn\n> · <\nx\n,\ny\n> = <\np\n,\nq\n>.\nFor any Ginkgo number <\nm\n,\nn\n>, Ginkgo numbers <1, 0>, <0, 1>, <-1, 0>, <0,-1>, <\nm\n,\nn\n>, <-\nn\n,\nm\n>, <-\nm\n,-\nn\n> and <\nn\n,-\nm\n> are divisors of <\nm\n,\nn\n>. If\nm\n2\n+\nn\n2\n> 1, these Ginkgo numbers are distinct. In other words, any Ginkgo number such that\nm\n2\n+\nn\n2\n> 1 has at least eight divisors.\nA Ginkgo number <\nm\n,\nn\n> is called a prime if\nm\n2\n+\nn\n2\n> 1 and it has exactly eight divisors. Your mission is to check whether a given Ginkgo number is a prime or not.\nThe following two facts might be useful to check whether a Ginkgo number is a divisor of another Ginkgo number.\nSuppose\nm\n2\n+\nn\n2\n> 0. Then, <\nm\n,\nn\n> is a divisor of <\np\n,\nq\n> if and only if the integer\nm\n2\n+\nn\n2\nis a common divisor of\nmp\n+\nnq\nand\nmq\n−\nnp\n.\nIf <\nm\n,\nn\n> · <\nx\n,\ny\n> = <\np\n,\nq\n>, then (\nm\n2\n+\nn\n2\n)(\nx\n2\n+\ny\n2\n) =\np\n2\n+\nq\n2\n.\nInput\nThe first line of the input contains a single integer, which is the number of datasets.\nThe rest of the input is a sequence of datasets. Each dataset is a line containing two integers\nm\nand\nn\n, separated by a space. They designate the Ginkgo number <\nm\n,\nn\n>. You can assume 1 <\nm\n2\n+\nn\n2\n< 20000.\nOutput\nFor each dataset, output a character '\nP\n' in a line if the Ginkgo number is a prime. Output a character '\nC\n' in a line otherwise.\nSample Input\n8\n10 0\n0 2\n-3 0\n4 2\n0 -13\n-4 1\n-2 -1\n3 -1\nOutput for the Sample Input\nC\nC\nP\nC\nC\nP\nP\nC"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1325_10853137","code_snippet":"#include<cstring>\n#include<string>\n#include<sstream>\n#include<fstream>\n#include<iostream>\n#include<iomanip>\n#include<cstdio>\n#include<cctype>\n#include<algorithm>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<vector>\n#include<stack>\n#include<ctime>\n#include<cstdlib>\n#include<functional>\n#include<cmath>\nusing namespace std;\n#define PI acos(-1.0)\n#define eps 1e-7\n#define INF 0x3F3F3F3F //0x7FFFFFFF\n#define LLINF 0x7FFFFFFFFFFFFFFF\n#define seed 1313131\n#define MOD 1000000007\n#define ll long long\n#define ull unsigned ll\n#define lson l,m,rt<<1\n#define rson m+1,r,rt<<1|1\nint main ()\n{\n int N;\n scanf(\"%d\",&N);\n while(N--)\n {\n int p,q;\n scanf(\"%d%d\",&p,&q);\n\n int flag = 1;\n for(int m=-150; m<150; m++)\n {\n if(flag == 0 ) break;\n for(int n=-150; n<150; n++)\n {\n if(m==0&&n==1) continue;\n if(m==0&&n==-1) continue;\n if(m==1&&n==0) continue;\n if(m==-1&&n==0) continue;\n if(m==p&&n==q) continue;\n if(m==-p&&n==-q) continue;\n if(m==-q&&n==p) continue;\n if(m==q&&n==-p) continue;\n if(m==0&&n==0) continue;\n\n int num =m*m+n*n;\n int he1 = m*p+n*q;\n int he2 = m*q-n*p;\n if(he1%num==0&&he2%num==0)\n {\n flag = 0;\n break;\n }\n }\n }\n if(flag == 0) printf(\"C\\n\");\n else printf(\"P\\n\");\n }\n\n}","accuracy":1,"time_ms":20,"memory_kb":3380,"score_of_the_acc":-0.1391,"final_rank":11},{"submission_id":"aoj_1325_10030644","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\n\nvoid solve() {\n int n,m;\n cin >> m >> n;\n\n int mx = n*n + m*m;\n\n reps(i,-150,150) {\n reps(j,-150,150) {\n if (i*i + j*j <= mx) {\n if ((i == 0 && j == 0) || (i == 1 && j == 0) || (i == 0 && j == 1) || (i == -1 && j == 0) || (i == 0 && j == -1) || (i == m && j == n) ||(i == -n && j == m) || (i == -m && j == -n) || (i == n && j == -m)) continue;\n if (gcd(i*m+j*n,i*n-j*m)%(i*i+j*j) == 0) {\n cout << 'C' << endl;\n return;\n }\n }\n }\n }\n\n cout << 'P' << endl;\n return;\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n int t;\n cin >> t;\n rep(i,t) {\n solve();\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3388,"score_of_the_acc":-0.1753,"final_rank":15},{"submission_id":"aoj_1325_9188501","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\nbool isPrime(int m, int n) {\n\tfor (int d = -142; d <= 142; d++) {\n\t\tfor (int e = -142; e <= 142; e++) {\n\t\t\tint d2pe2 = d * d + e * e;\n\t\t\tif (d2pe2 <= 1 || 20000 <= d2pe2 || d == m && e == n || d == -n && e == m || d == -m && e == -n || d == n && e == -m) continue;\n\n\t\t\tif ((d * m + e * n) % d2pe2 == 0 && (d * n - e * m) % d2pe2 == 0) return false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nint main() {\n\tint numof_data;\n\tcin >> numof_data;\n\n\tfor (int data = 0; data < numof_data; data++) {\n\t\tint m, n;\n\t\tcin >> m >> n;\n\n\t\tif (isPrime(m, n)) {\n\t\t\tcout << \"P\" << endl;\n\t\t} else {\n\t\t\tcout << \"C\" << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3336,"score_of_the_acc":-0.1185,"final_rank":8},{"submission_id":"aoj_1325_7138378","code_snippet":"// author: hanyu\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int t;\n cin >> t;\n\n while (t--) {\n int m, n;\n cin >> m >> n;\n\n int lim = max(abs(n), abs(m)), count = 0;\n for (int i = -lim; i <= lim; i++) {\n for (int j = -lim; j <= lim; j++) {\n if (i == 0 && j == 0) continue;\n int tmp = i * i + j * j;\n int x = m * i + n * j, y = n * i - m * j;\n if (x % tmp == 0 && y % tmp == 0) count++;\n }\n }\n\n if (count == 8) cout << \"P\" << endl;\n else cout << \"C\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3256,"score_of_the_acc":-0.0913,"final_rank":5},{"submission_id":"aoj_1325_6794709","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> pll;\ntypedef vector<ll> vll;\ntypedef vector<pll> vpll;\n#define mp make_pair\n#define pb push_back\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define rrep(i,l,r) for(int i=l;i<=r;i++)\n#define chmin(a,b) a=min(a,b)\n#define chmax(a,b) a=max(a,b)\n#define all(x) x.begin(),x.end()\n#define unq(x) sort(all(x));x.erase(unique(all(x)),x.end())\n//#define mod 1000000007\n#define mod 998244353\n//ll mod;\n#define ad(a,b) a=(a+b)%mod;\n#define mul(a,b) a=a*b%mod;\nvoid readv(vector<ll> &a,ll n){\n\trep(i,n){\n\t\tll x;\n\t\tcin>>x;\n\t\ta.push_back(x);\n\t}\n}\nvoid outv(vector<ll> &a,ll n){\n\trep(i,n){\n\t\tif(i>0)cout<<\" \";\n\t\tcout<<a[i];\n\t}\n\tcout<<\"\\n\";\n}\nll po(ll x,ll y){\n\tll res=1;\n\tfor(;y;y>>=1){\n\t\tif(y&1)res=res*x%mod;\n\t\tx=x*x%mod;\n\t}\n\treturn res;\n}\nll gcd(ll a,ll b){\n\treturn (b?gcd(b,a%b):a);\n}\n#define FACMAX 200010\nll fac[FACMAX],inv[FACMAX],ivf[FACMAX];\nvoid initfac(){\n\tfac[0]=ivf[0]=inv[1]=1;\n\tfor(ll i=1;i<FACMAX;i++)fac[i]=fac[i-1]*i%mod;\n\tfor(ll i=1;i<FACMAX;i++){\n\t\tif(i>1)inv[i]=(mod-mod/i*inv[mod%i]%mod)%mod;\n\t\tivf[i]=po(fac[i],mod-2);\n\t}\n}\nll P(ll n,ll k){\n\tif(n<0||n<k)return 0;\n\treturn fac[n]*ivf[n-k]%mod;\n}\nll C(ll n,ll k){\n\tif(k<0||n<k)return 0;\n\treturn fac[n]*ivf[n-k]%mod*ivf[k]%mod;\n}\nll H(ll n,ll k){\n\treturn C(n+k-1,k);\n}\n\nll p,q;\nbool judge(ll n,ll m){\n\tif(n*n+m*m==1)return 0;\n\tif(p==m&&q==n)return 0;\n\tif(p==-m&&q==-n)return 0;\n\tif(p==-n&&q==m)return 0;\n\tif(p==n&&q==-m)return 0;\n\treturn (m*p+n*q)%(m*m+n*n)==0&&(m*q-n*p)%(m*m+n*n)==0;\n}\nvoid solve(){\n\tcin>>p>>q;\n\tll val=p*p+q*q;\n\tbool ans=0;\n\tfor(ll d=1;d<=val;d++)if(val%d==0){\n\t\tfor(int n=0;n*n<=d;n++){\n\t\t\tint m=(int)sqrt(d-n*n);\n\t\t\trep(f,2){\n\t\t\t\trep(g,2){\n\t\t\t\t\tans|=judge(n,m);\n\t\t\t\t\tm*=-1;\n\t\t\t\t}\n\t\t\t\tn*=-1;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<(ans?\"C\":\"P\")<<endl;\n\n}\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tll q;\n\tcin>>q;\n\twhile(q--)solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.1294,"final_rank":9},{"submission_id":"aoj_1325_6376239","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nvoid solver(int m, int n){\n for(int x = -200; x <= 200; x++){\n for(int y = -200; y <= 200; y++){\n if(min(x, y) == 0 && max(x, y) == 1) continue;\n if(min(x, y) == -1 && max(x, y) == 0) continue;\n if(x == m && y == n) continue;\n if(x == -n && y == m) continue;\n if(x == -m && y == -n) continue;\n if(x == n && y == -m) continue;\n int tot = x*x + y*y;\n if(tot > 0){\n if((m*x+n*y)%tot == 0 && (x*n-y*m)%tot == 0){\n // cout << x << \" \" << y << \" \";\n cout << \"C\" << '\\n';\n return;\n }\n }\n }\n }\n cout << \"P\" << '\\n';\n}\n\nint main(){\n int t;\n cin >> t;\n while(t--){\n int m, n;\n cin >> m >> n;\n solver(m, n);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3260,"score_of_the_acc":-0.115,"final_rank":7},{"submission_id":"aoj_1325_6221257","code_snippet":"#include <stdio.h>\n#include <stdlib.h>\n#include <set>\nusing namespace std;\n\nint gn[65536][2];\nset<pair<int, int>> sieve;\n\nint cmp1(const void* a, const void* b) {\n int ai = *(int*)a;\n int bi = *(int*)b;\n int aj = *((int*)a + 1);\n int bj = *((int*)b + 1);\n return ai * ai + aj * aj > bi * bi + bj * bj ? 1 : ai * ai + aj * aj == bi * bi + bj * bj ? 0 : -1;\n}\n\nint main(void) {\n int cnt = 0, t, x, y;\n for (int i = -200; i <= 200; i++) {\n for (int j = -200; j <= 200; j++) {\n if (i * i + j * j < 20000) {\n gn[cnt][0] = i;\n gn[cnt++][1] = j;\n }\n }\n }\n qsort(gn, cnt, sizeof(int) * 2, cmp1);\n for (int i = 5; i < cnt; i++) {\n if (sieve.find(pair<int, int>(gn[i][0], gn[i][1])) != sieve.end()) continue;\n for (int j = 5; j < cnt; j++) {\n x = gn[i][0] * gn[j][0] - gn[i][1] * gn[j][1];\n y = gn[i][0] * gn[j][1] + gn[i][1] * gn[j][0];\n if (x * x + y * y > 20000) break;\n sieve.insert(pair<int, int>(x, y));\n }\n }\n //freopen(\"E:\\\\PS\\\\ICPC\\\\Asia Pacific\\\\Japan Regional\\\\2012\\\\InputsAndOutputs12\\\\A.in\", \"r\", stdin);\n //freopen(\"E:\\\\PS\\\\ICPC\\\\Asia Pacific\\\\Japan Regional\\\\2012\\\\InputsAndOutputs12\\\\A_t.out\", \"w\", stdout);\n scanf(\"%d\", &t);\n for (int tt = 0; tt < t; tt++) {\n scanf(\"%d %d\", &x, &y);\n if (sieve.find(pair<int, int>(x, y)) != sieve.end()) printf(\"C\\n\");\n else printf(\"P\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":5924,"score_of_the_acc":-1.0335,"final_rank":18},{"submission_id":"aoj_1325_5997974","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\nvll dx = { 1,-1,0 };\nvll dy = { 1,-1,0 };\nint main() {\n ll N;\n cin>>N;\n rep(n,N){\n ll M,N;\n cin>>M>>N;\n ll D=M*M+N*N;\n ll k=0;\n for(ll x=-D;x<=D;x++){\n ll B=D-x*x;\n B=sqrt(B)+1;\n for(ll y=-B;y<=B;y++){\n if(x+y==0)continue;\n ll C=x*x+y*y;\n if((M*x+N*y)%C==0&&(M*y-N*x)%C==0){\n k++;\n //cout<<x<<\" \"<<y<<endl;\n }\n }\n }\n cout<<(k==8?\"P\":\"C\")<<endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3208,"score_of_the_acc":-0.114,"final_rank":6},{"submission_id":"aoj_1325_5847349","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nusing P = pair<ll, ll>;\nconst int MAX = 20000;\n\nvoid solve() {\n ll m, n;\n cin >> m >> n;\n vector<P> kouho;\n for(ll a = 0; a <= MAX and a * a <= m * m + n * n; a++) {\n for(ll b = 0; b <= MAX and a * a + b * b <= m * m + n * n; b++) {\n if((a * a + b * b) == 0) continue;\n if((m * m + n * n) % (a * a + b * b) == 0) {\n kouho.emplace_back(a, b);\n kouho.emplace_back(-a, b);\n kouho.emplace_back(a, -b);\n kouho.emplace_back(-a, -b);\n }\n }\n }\n sort(ALL(kouho));\n kouho.erase(unique(ALL(kouho)), kouho.end());\n // debug(m, n);\n // debug(kouho);\n int sz = kouho.size();\n ll ans = 0;\n REP(i, sz) {\n auto [a1, b1] = kouho[i];\n if((a1*m + b1*n) % (a1*a1+b1*b1) != 0 or (a1*n - b1*m) % (a1*a1+b1*b1) != 0) continue;\n bool ok = false;\n REP(j, sz) {\n auto [a2, b2] = kouho[j];\n if((a1 * a1 + b1 * b1) * (a2 * a2 + b2 * b2) == (m * m + n * n)) {\n ok = true;\n break;\n }\n }\n // if(ok) debug(a1, b1);\n ans += ok;\n }\n // debug(ans);\n assert(ans >= 8);\n cout << (ans == 8 ? \"P\" : \"C\") << \"\\n\";\n}\n\nint main() {\n int T;\n cin >> T;\n while(T--) solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3484,"score_of_the_acc":-0.1689,"final_rank":13},{"submission_id":"aoj_1325_5757890","code_snippet":"#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n \n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n \n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n \n// name macro\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T = int>\nusing VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\nusing Tp = tuple<ll,ll,ll>;\n \n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n \n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"No\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n \n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n \ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n \n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v /= x;\n}\n \n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\ntemplate<typename T>\nT ADD(T a, T b){\n\tT res;\n\treturn __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\ntemplate<typename T>\nT MUL(T a, T b){\n\tT res;\n\treturn __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n \n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\n\n#pragma endregion\n\nusing R = long double;\nconstexpr R EPS=1E-11;\n\n// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.\nint sgn(const R& r){ return (r > EPS) - (r < -EPS); }\n// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.\nint sgn(const R& a, const R &b){ return sgn(a-b); }\n// a > 0 は sgn(a) > 0\n// a < b は sgn(a, b) < 0\n// a >= b は sgn(a, b) >= 0\n// のように書く.\n// return s * 10^n\n\n//https://atcoder.jp/contests/abc191/submissions/20028529\nlong long x10(const string& s, size_t n) {\n if (s.front() == '-') return -x10(s.substr(1), n);\n auto pos = s.find('.');\n if (pos == string::npos) return stoll(s + string(n, '0'));\n return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));\n}\n \nlong long ceildiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return (a + b - 1) / b;\n else return a / b;\n}\n \nlong long floordiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return a / b;\n else return (a - b + 1) / b;\n}\n \nlong long floorsqrt(long long x) {\n assert(x >= 0);\n long long ok = 0;\n long long ng = 1;\n while (ng * ng <= x) ng <<= 1;\n while (ng - ok > 1) {\n long long mid = (ng + ok) >> 1;\n if (mid * mid <= x) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n\ninline int topbit(unsigned long long x){\n\treturn x?63-__builtin_clzll(x):-1;\n}\n\ninline int popcount(unsigned long long x){\n\treturn __builtin_popcountll(x);\n}\n\ninline int parity(unsigned long long x){//popcount%2\n\treturn __builtin_parity(x);\n}\n\nconst int inf = 1e9;\nconst ll INF = 1e18;\n\n\n\nvoid main_() {\n\tint q;\n\tcin >> q;\n\tREP(i,q){\n\t int p,q;\n\t cin >> p >> q;\n\t bool ex = false;\n\t for(int i = -200;i <= 200;i++){\n\t for(int j = -200;j <= 200;j++){\n\t if(i == 0 && j == 0)continue;\n\t int n = q * i - p * j;\n\t int m = p * i + q * j;\n\t int sum = i * i + j * j;\n\t if(sum == 1 || sum == p * p + q * q)continue;\n\t if(n % sum == 0 && m % sum == 0){\n\t ex = true;\n\t }\n\t }\n\t }\n\t if(ex)cout << 'C' << endl;\n\t else cout << 'P' << endl;\n\t}\n}\n \nint main() {\n\tint t = 1;\n\t//cin >> t;\n\twhile(t--) main_();\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3396,"score_of_the_acc":-0.1725,"final_rank":14},{"submission_id":"aoj_1325_5751359","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) v.begin(),v.end()\n\nbool D(int a,int b){\n a=abs(a);b=abs(b);\n return (a%b)==0;\n}\n\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\n\nbool pr(int p,int q){\n for(int m=-200;m<=200;m++)for(int n=-200;n<=200;n++){\n if(m==0&&n==0)continue;\n bool out=false;\n REP(i,4)if(dx[i]==m&&dy[i]==n)out=true;\n if(m==p&&n==q)out=true;\n if(m==-q&&n==p)out=true;\n if(m==-p&&n==-q)out=true;\n if(m==q&&n==-p)out=true;\n if(out)continue;\n if(D(m*p+n*q,m*m+n*n)&&D(m*q-n*p,m*m+n*n))return false;\n }\n return true;\n}\n\nint main(){\n int x;cin>>x;\n while(x--){\n int p,q;cin>>p>>q;\n if(p*p+q*q==0)cout<<\"C\"<<endl;\n else if(pr(p,q))cout<<\"P\"<<endl;\n else cout<<\"C\"<<endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3268,"score_of_the_acc":-0.1345,"final_rank":10},{"submission_id":"aoj_1325_5557205","code_snippet":"#include <cmath>\n#include <deque>\n#include <algorithm>\n#include <iterator>\n#include <list>\n#include <tuple>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <set>\n#include <unordered_set>\n#include <stack>\n#include <string>\n#include <vector>\n#include <fstream>\n#include <iostream>\n#include <functional>\n#include <numeric>\n#include <iomanip> \n#include <stdio.h>\n//eolibraries\n#define lnf 3999999999999999999\n#define inf 999999999\n#define fi first\n#define se second\n#define pb push_back\n#define ll long long\n#define all(c) (c).begin(),(c).end()\n#define sz(c) (int)(c).size()\n#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())\n#define pii pair <int,int>\n#define rep(i,n) for(int i = 0 ; i < n ; i++) \n#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)\n#define crep(i,x,n) for(int i = x ; i < n ; i++)\n#define vi vector <int> \n#define vec(...) vector<__VA_ARGS__>\n#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);\n//eodefine\nusing namespace std;\n\nconst int max_n = 103002;\n\nvoid slv(int p,int q) {\n\tint ans=0;\n\tfor(int x=-200;x<=200;x++){\n\t\tfor(int y=-200;y<=200;y++) {\n\t\t\tif(x==0 and y==0)continue;\n\t\t\tint n = (q*x-p*y)/(y*y+x*x);\n\t\t\tint m = (q*y+p*x)/(y*y+x*x);\n\t\t\tif(m*x-n*y==p and m*y+n*x==q) ans++;\n\t\t\t// ans++;\n\t\t}\n\t}\n\tif(ans==8)cout<<\"P\\n\";\n\telse cout<<\"C\\n\";\n\t// cout<<ans<<\"\\n\";\n}\n\nint main(){\nfcin;\n\tint t;\n\tcin>>t;\n\twhile(t--) {\n\t\tint n,m;\n\t\tcin>>n>>m;\n\t\tslv(n,m);\n\t}\n/*\n*/\n return 0; \n}","accuracy":1,"time_ms":130,"memory_kb":3312,"score_of_the_acc":-0.1774,"final_rank":16},{"submission_id":"aoj_1325_5086426","code_snippet":"#include <bits/stdc++.h>\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n//#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\n\n//using namespace boost::multiprecision;\n//#include<atcoder/all>\n//#include<atcoder/segtree>\n//#include <atcoder/scc>\n//using namespace atcoder;\n\nusing dou =long double;\nstring yes=\"yes\";\nstring Yes=\"Yes\";\nstring YES=\"YES\";\nstring no=\"no\";\nstring No=\"No\";\nstring NO=\"NO\";\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nll mod = 998244353ll;\n//ll mod = 1000000007ll;\n//const ll mod = 4;\n\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\n\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n//#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define brep(n) for(int bit=0;bit<(1<<n);bit++)\n#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)\n#define erep(i,container) for (auto &i : container)\n#define itrep(i,container) for (auto i : container)\n#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)\n#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)\n#define reprep(i,j,h,w) rep(i,h)rep(j,w)\n#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];\n#define pb push_back\n#define pf push_front\n#define query int qq;std::cin >> qq;rep(qqq,qq)\n#define lb lower_bound\n#define ub upper_bound\n#define fi first\n#define se second\n#define itn int\n#define mp make_pair\n//#define sum(a) accumulate(all(a),0ll)\n#define keta fixed<<setprecision\n#define kout(d) std::cout << keta(10)<< d<< std::endl;\n#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;\n#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))\n//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))\n#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));\n#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));\n//#define case std::cout <<\"Case #\" <<qqq+1<<\":\"\n#define RES(a,iq,jq) a.resize(iq);rep(iii,iq)a[iii].resize(jq);\n\n#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){a[ii][jj].resize(k);};\n#define res resize\n#define as assign\n#define ffor for(;;)\n#define ppri(a,b) std::cout << a<<\" \"<<b << std::endl\n#define pppri(a,b,c) std::cout << a<<\" \"<<b <<\" \"<< c<<std::endl\n#define ppppri(a,b,c,d) std::cout << a<<\" \"<<b <<\" \"<< c<<' '<<d<<std::endl\n#define aall(x,n) (x).begin(),(x).begin()+(n)\n#define SUMI(a) accumulate(all(a),0) \n#define SUM(a) accumulate(all(a),0ll) \n#define stirng string\n#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;\n#define popcount __builtin_popcount\n#define permu(a) next_permutation(all(a))\n#define aru(a,d) a.find(d)!=a.end()\n#define nai(a,d) a.find(d)==a.end()\n//#define aru p.find(mp(x,y))!=p.end()\n//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];\n\n//typedef long long T;\nll ceili(ll a,ll b){\n return ((a+b-1)/b);\n}\nconst int INF = 2000000000;\n//const ll INF64 =922330720854775807ll;\nconst ll INF64 = 4223372036854775807ll;\n//const ll INF64 = 9223372036854775807ll;\n\n//const ll INF64 = 243'000'000'000'000'000'0;Q\n\n\n//const ll MOD = 1000000007ll;\nconst ll MOD = 998244353ll;\n//const ll MOD = 1000003ll;\nconst ll OD = 1000000000000007ll;\nconst dou pi=3.141592653589793;\n\nlong long modpow(long long a, long long n) { \n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\nvector< ll > divisor(ll n) { //約数の列挙\n vector< ll > ret;\n for(ll i = 1; i * i <= n; i++) {\n if(n % i == 0) {\n ret.push_back(i);\n if(i * i != n) ret.push_back(n / i);\n }\n }\n sort(begin(ret), end(ret));\n return (ret);\n}\n//メモ\n//ゲーム(Grundy数とか)の復習をする\n//リスニング力をどうにかする\n//個数制限付きナップサックの復習\n//戻すDP\n//全方位木DPとスライド最小値\n//ゲーム→パリティに注目するといいことあるかも\n//ゲーム→もとの状態に戻せる状態を探す\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//理由がなければLLを使え！\n//来週の月曜日に銀行へ行く\n//積率を調べる実験を来週の火曜日までにやる\n//レピュニット数\n//フェルマーの小定理\n//拡張ユークリッド\n\nint main(){\n std::set<int> st;\n rrep(i,0,12000){\n st.insert(i*i);\n }\n query{\n ll p,q;\n std::cin >> p>>q;\n int v=p*p+q*q;\n auto di=divisor(p*p+q*q);\n std::vector<bool> ok(di.size());\n int po=0;\n char c='P';\n erep(ii,di){\n if(ii==1||ii==p*p+q*q){\n 1==1;\n }\n else{\n bool ook=0;\n erep(i,st){\n if(aru(st,ii-i))ook=1;\n }\n ok[po]=ook;\n }\n //rep(i,ok.size())std::cout << ok[i] << ' ';\n //std::cout << std::endl;\n // ppri(po,ok.size()-1-po);\n if(ok[po]&ok[ok.size()-1-po])c='C';\n po++;\n }\n std::cout << c << std::endl;\n }\n}","accuracy":1,"time_ms":340,"memory_kb":3608,"score_of_the_acc":-0.3955,"final_rank":17},{"submission_id":"aoj_1325_4937879","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n// debug methods\n// usage: debug(x,y);\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef _DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\n#define MAX_N (1000006)\n#define INF (1LL << 60)\n#define eps 1e-9\nconst int MOD = (int)1e9 + 7;\n\n\nsigned main(){\n //cin.tie(nullptr);\n //std::ios::sync_with_stdio(false);\n\n int t;\n cin >> t;\n\n while(t--){\n int m,n;\n cin >> m >> n;\n\n int cnt = 0;\n int mx = abs(max(abs(m),abs(n)));\n for(int p=-mx; p<=mx; p++){\n for(int q=-mx; q<=mx; q++){\n int d = p*p + q*q;\n if(d==0) continue;\n int d1 = p*m + q*n;\n int d2 = p*n - q*m;\n if(d1%d==0 && d2%d==0) {\n debug(p,q);\n cnt++;\n }\n }\n }\n debug(cnt);\n cout << (cnt==8?\"P\":\"C\") << endl;\n }\n}\n\n/*\n\n\n*/","accuracy":1,"time_ms":40,"memory_kb":3072,"score_of_the_acc":-0.0454,"final_rank":2},{"submission_id":"aoj_1325_4886506","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve() {\n int p, q;\n cin >> p >> q;\n int cnt = 0;\n for (int m = -200; m <= 200; ++m) {\n for (int n = -200; n <= 200; ++n) {\n if (m == n && n == 0) continue;\n int x = m*m + n*n;\n int y = m*p + n*q;\n int z = m*q - n*p;\n if (y % x == 0 && z % x == 0) cnt++;\n }\n }\n cout << (cnt == 8 ? 'P' : 'C') << '\\n';\n}\n\nint main() {\n int t;\n cin >> t;\n while (t--) solve();\n}","accuracy":1,"time_ms":80,"memory_kb":3332,"score_of_the_acc":-0.1563,"final_rank":12},{"submission_id":"aoj_1325_4873041","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h> \n#include <functional>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr double eps = 1e-9;\n// constexpr ll mod = 1000000007;\nconstexpr ll mod = 998244353;\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// --------------------------------------------------------------------------\n\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int _;\n cin >> _;\n while(_--){\n int m,n;\n cin >> m >> n;\n int cnt = 0;\n for(int i=-1000; i<1000; i++){\n for(int j=-1000; j<1000; j++){\n // if(i*i+j*j > m*m+n*n) break;\n if(i*i+j*j < 1) continue;\n if((i*m+j*n)%(i*i+j*j)==0 && (i*n-j*m)%(i*i+j*j)==0) cnt++;\n }\n }\n if(cnt == 8){\n cout << \"P\\n\";\n }else{\n cout << \"C\\n\";\n }\n }\n return 0;\n}","accuracy":1,"time_ms":1800,"memory_kb":3356,"score_of_the_acc":-1.1253,"final_rank":19},{"submission_id":"aoj_1325_4873015","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h> \n#include <functional>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr double eps = 1e-9;\n// constexpr ll mod = 1000000007;\nconstexpr ll mod = 998244353;\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// --------------------------------------------------------------------------\n\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int _;\n cin >> _;\n while(_--){\n int m,n;\n cin >> m >> n;\n int cnt = 0;\n for(int i=-1000; i<1000; i++){\n for(int j=-1000; j<1000; j++){\n // if(i*i+j*j > m*m+n*n) break;\n if(i*i+j*j <= 1) continue;\n if((i*m+j*n)%(i*i+j*j)==0 && (i*n-j*m)%(i*i+j*j)==0) cnt++;\n }\n }\n if(cnt == 4){\n cout << \"P\\n\";\n }else{\n cout << \"C\\n\";\n }\n }\n return 0;\n}","accuracy":1,"time_ms":1800,"memory_kb":3380,"score_of_the_acc":-1.1335,"final_rank":20},{"submission_id":"aoj_1325_4773070","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 510000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n rep(i,a.size()) cout << a[i] << \" \";\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << \" \" << b << \"\\n\";}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nvoid solve(){\n\tint p,q; cin >> p >> q;\n\tint r = p*p + q*q;\n\tint cnt = 0;\n\tfor(int m=-150; m<=150; m++){\n\t\tfor(int n=-150; n<=150; n++){\n\t\t\tif(m==0 && n==0) continue;\n\t\t\tint s = m*m + n*n;\n\t\t\tif(r % s != 0) continue;\n\t\t\tint t = r / s;\n\t\t\tbool f = false;\n\t\t\tfor(int x=0; x<=150; x++){\n\t\t\t\tint Y = t - x*x;\n\t\t\t\tint y = sqrt(Y);\n\t\t\t\tif(y*y != Y) continue;\n\t\t\t\tf = true; break;\n\t\t\t}\n\t\t\tif((m*p + n*q) % s == 0 && (m*q - n*p) % s == 0) cnt++;\n\t\t}\n\t}\n\tif(cnt == 8) puts(\"P\");\n\telse puts(\"C\");\n}\n\nint main(){\n\tint t; cin >> t;\n\twhile(t--){\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":3092,"score_of_the_acc":-0.0578,"final_rank":3},{"submission_id":"aoj_1325_4770199","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> T;\n\twhile (T--) {\n\t\tcin >> N >> M;\n\t\tint ans = 0;\n\t\tfor (int i = -150; i <= 150; i++) {\n\t\t\tfor (int j = -150; j <= 150; j++) {\n\t\t\t\tif (!i && !j)continue;\n\t\t\t\tif ((i*N + j * M) % (i*i + j * j) == 0 && (i*M - j * N) % (i*i + j * j) == 0)ans++;\n\t\t\t}\n\t\t}\n\t\tif (ans == 8)cout << \"P\" << endl;\n\t\telse cout << \"C\" << endl;\n\t}\n}","accuracy":1,"time_ms":130,"memory_kb":3044,"score_of_the_acc":-0.0861,"final_rank":4},{"submission_id":"aoj_1325_4738311","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int T;\n cin >> T;\n for (int i = 0; i < T; i++){\n int m, n;\n cin >> m >> n;\n int s = m * m + n * n;\n bool prime = true;\n int a = sqrt(s - 1);\n for (int j = - a; j <= a; j++){\n int b = sqrt(s - j * j - 1);\n for (int k = - b; k <= b; k++){\n int t = j * j + k * k;\n if (abs(t) > 1){\n if ((j * m + k * n) % (j * j + k * k) == 0 && (j * n - k * m) % (j * j + k * k) == 0){\n prime = false;\n }\n }\n }\n }\n if (prime){\n cout << 'P' << endl;\n } else {\n cout << 'C' << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":2988,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1325_10853137\",\n \"code_snippet\": \"#include<cstring>\\n#include<string>\\n#include<sstream>\\n#include<fstream>\\n#include<iostream>\\n#include<iomanip>\\n#include<cstdio>\\n#include<cctype>\\n#include<algorithm>\\n#include<queue>\\n#include<deque>\\n#include<map>\\n#include<set>\\n#include<vector>\\n#include<stack>\\n#include<ctime>\\n#include<cstdlib>\\n#include<functional>\\n#include<cmath>\\nusing namespace std;\\n#define PI acos(-1.0)\\n#define eps 1e-7\\n#define INF 0x3F3F3F3F //0x7FFFFFFF\\n#define LLINF 0x7FFFFFFFFFFFFFFF\\n#define seed 1313131\\n#define MOD 1000000007\\n#define ll long long\\n#define ull unsigned ll\\n#define lson l,m,rt<<1\\n#define rson m+1,r,rt<<1|1\\nint main ()\\n{\\n int N;\\n scanf(\\\"%d\\\",&N);\\n while(N--)\\n {\\n int p,q;\\n scanf(\\\"%d%d\\\",&p,&q);\\n\\n int flag = 1;\\n for(int m=-150; m<150; m++)\\n {\\n if(flag == 0 ) break;\\n for(int n=-150; n<150; n++)\\n {\\n if(m==0&&n==1) continue;\\n if(m==0&&n==-1) continue;\\n if(m==1&&n==0) continue;\\n if(m==-1&&n==0) continue;\\n if(m==p&&n==q) continue;\\n if(m==-p&&n==-q) continue;\\n if(m==-q&&n==p) continue;\\n if(m==q&&n==-p) continue;\\n if(m==0&&n==0) continue;\\n\\n int num =m*m+n*n;\\n int he1 = m*p+n*q;\\n int he2 = m*q-n*p;\\n if(he1%num==0&&he2%num==0)\\n {\\n flag = 0;\\n break;\\n }\\n }\\n }\\n if(flag == 0) printf(\\\"C\\\\n\\\");\\n else printf(\\\"P\\\\n\\\");\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1391,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1325_10030644\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(a) a.begin(),a.end()\\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\\nconst long long mod = 1000000007;\\nconst long long INF = 1e18;\\nll myceil(ll a, ll b) {return (a+b-1)/b;}\\n\\n\\nvoid solve() {\\n int n,m;\\n cin >> m >> n;\\n\\n int mx = n*n + m*m;\\n\\n reps(i,-150,150) {\\n reps(j,-150,150) {\\n if (i*i + j*j <= mx) {\\n if ((i == 0 && j == 0) || (i == 1 && j == 0) || (i == 0 && j == 1) || (i == -1 && j == 0) || (i == 0 && j == -1) || (i == m && j == n) ||(i == -n && j == m) || (i == -m && j == -n) || (i == n && j == -m)) continue;\\n if (gcd(i*m+j*n,i*n-j*m)%(i*i+j*j) == 0) {\\n cout << 'C' << endl;\\n return;\\n }\\n }\\n }\\n }\\n\\n cout << 'P' << endl;\\n return;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n int t;\\n cin >> t;\\n rep(i,t) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.1753,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1325_9188501\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <string>\\n#include <vector>\\n\\nusing namespace std;\\n\\nbool isPrime(int m, int n) {\\n\\tfor (int d = -142; d <= 142; d++) {\\n\\t\\tfor (int e = -142; e <= 142; e++) {\\n\\t\\t\\tint d2pe2 = d * d + e * e;\\n\\t\\t\\tif (d2pe2 <= 1 || 20000 <= d2pe2 || d == m && e == n || d == -n && e == m || d == -m && e == -n || d == n && e == -m) continue;\\n\\n\\t\\t\\tif ((d * m + e * n) % d2pe2 == 0 && (d * n - e * m) % d2pe2 == 0) return false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nint main() {\\n\\tint numof_data;\\n\\tcin >> numof_data;\\n\\n\\tfor (int data = 0; data < numof_data; data++) {\\n\\t\\tint m, n;\\n\\t\\tcin >> m >> n;\\n\\n\\t\\tif (isPrime(m, n)) {\\n\\t\\t\\tcout << \\\"P\\\" << endl;\\n\\t\\t} else {\\n\\t\\t\\tcout << \\\"C\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.1185,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1325_7138378\",\n \"code_snippet\": \"// author: hanyu\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int t;\\n cin >> t;\\n\\n while (t--) {\\n int m, n;\\n cin >> m >> n;\\n\\n int lim = max(abs(n), abs(m)), count = 0;\\n for (int i = -lim; i <= lim; i++) {\\n for (int j = -lim; j <= lim; j++) {\\n if (i == 0 && j == 0) continue;\\n int tmp = i * i + j * j;\\n int x = m * i + n * j, y = n * i - m * j;\\n if (x % tmp == 0 && y % tmp == 0) count++;\\n }\\n }\\n\\n if (count == 8) cout << \\\"P\\\" << endl;\\n else cout << \\\"C\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.0913,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1325_6794709\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<ll> vll;\\ntypedef vector<pll> vpll;\\n#define mp make_pair\\n#define pb push_back\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define rrep(i,l,r) for(int i=l;i<=r;i++)\\n#define chmin(a,b) a=min(a,b)\\n#define chmax(a,b) a=max(a,b)\\n#define all(x) x.begin(),x.end()\\n#define unq(x) sort(all(x));x.erase(unique(all(x)),x.end())\\n//#define mod 1000000007\\n#define mod 998244353\\n//ll mod;\\n#define ad(a,b) a=(a+b)%mod;\\n#define mul(a,b) a=a*b%mod;\\nvoid readv(vector<ll> &a,ll n){\\n\\trep(i,n){\\n\\t\\tll x;\\n\\t\\tcin>>x;\\n\\t\\ta.push_back(x);\\n\\t}\\n}\\nvoid outv(vector<ll> &a,ll n){\\n\\trep(i,n){\\n\\t\\tif(i>0)cout<<\\\" \\\";\\n\\t\\tcout<<a[i];\\n\\t}\\n\\tcout<<\\\"\\\\n\\\";\\n}\\nll po(ll x,ll y){\\n\\tll res=1;\\n\\tfor(;y;y>>=1){\\n\\t\\tif(y&1)res=res*x%mod;\\n\\t\\tx=x*x%mod;\\n\\t}\\n\\treturn res;\\n}\\nll gcd(ll a,ll b){\\n\\treturn (b?gcd(b,a%b):a);\\n}\\n#define FACMAX 200010\\nll fac[FACMAX],inv[FACMAX],ivf[FACMAX];\\nvoid initfac(){\\n\\tfac[0]=ivf[0]=inv[1]=1;\\n\\tfor(ll i=1;i<FACMAX;i++)fac[i]=fac[i-1]*i%mod;\\n\\tfor(ll i=1;i<FACMAX;i++){\\n\\t\\tif(i>1)inv[i]=(mod-mod/i*inv[mod%i]%mod)%mod;\\n\\t\\tivf[i]=po(fac[i],mod-2);\\n\\t}\\n}\\nll P(ll n,ll k){\\n\\tif(n<0||n<k)return 0;\\n\\treturn fac[n]*ivf[n-k]%mod;\\n}\\nll C(ll n,ll k){\\n\\tif(k<0||n<k)return 0;\\n\\treturn fac[n]*ivf[n-k]%mod*ivf[k]%mod;\\n}\\nll H(ll n,ll k){\\n\\treturn C(n+k-1,k);\\n}\\n\\nll p,q;\\nbool judge(ll n,ll m){\\n\\tif(n*n+m*m==1)return 0;\\n\\tif(p==m&&q==n)return 0;\\n\\tif(p==-m&&q==-n)return 0;\\n\\tif(p==-n&&q==m)return 0;\\n\\tif(p==n&&q==-m)return 0;\\n\\treturn (m*p+n*q)%(m*m+n*n)==0&&(m*q-n*p)%(m*m+n*n)==0;\\n}\\nvoid solve(){\\n\\tcin>>p>>q;\\n\\tll val=p*p+q*q;\\n\\tbool ans=0;\\n\\tfor(ll d=1;d<=val;d++)if(val%d==0){\\n\\t\\tfor(int n=0;n*n<=d;n++){\\n\\t\\t\\tint m=(int)sqrt(d-n*n);\\n\\t\\t\\trep(f,2){\\n\\t\\t\\t\\trep(g,2){\\n\\t\\t\\t\\t\\tans|=judge(n,m);\\n\\t\\t\\t\\t\\tm*=-1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tn*=-1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<(ans?\\\"C\\\":\\\"P\\\")<<endl;\\n\\n}\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tll q;\\n\\tcin>>q;\\n\\twhile(q--)solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.1294,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1325_6376239\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nvoid solver(int m, int n){\\n for(int x = -200; x <= 200; x++){\\n for(int y = -200; y <= 200; y++){\\n if(min(x, y) == 0 && max(x, y) == 1) continue;\\n if(min(x, y) == -1 && max(x, y) == 0) continue;\\n if(x == m && y == n) continue;\\n if(x == -n && y == m) continue;\\n if(x == -m && y == -n) continue;\\n if(x == n && y == -m) continue;\\n int tot = x*x + y*y;\\n if(tot > 0){\\n if((m*x+n*y)%tot == 0 && (x*n-y*m)%tot == 0){\\n // cout << x << \\\" \\\" << y << \\\" \\\";\\n cout << \\\"C\\\" << '\\\\n';\\n return;\\n }\\n }\\n }\\n }\\n cout << \\\"P\\\" << '\\\\n';\\n}\\n\\nint main(){\\n int t;\\n cin >> t;\\n while(t--){\\n int m, n;\\n cin >> m >> n;\\n solver(m, n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.115,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1325_6221257\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <set>\\nusing namespace std;\\n\\nint gn[65536][2];\\nset<pair<int, int>> sieve;\\n\\nint cmp1(const void* a, const void* b) {\\n int ai = *(int*)a;\\n int bi = *(int*)b;\\n int aj = *((int*)a + 1);\\n int bj = *((int*)b + 1);\\n return ai * ai + aj * aj > bi * bi + bj * bj ? 1 : ai * ai + aj * aj == bi * bi + bj * bj ? 0 : -1;\\n}\\n\\nint main(void) {\\n int cnt = 0, t, x, y;\\n for (int i = -200; i <= 200; i++) {\\n for (int j = -200; j <= 200; j++) {\\n if (i * i + j * j < 20000) {\\n gn[cnt][0] = i;\\n gn[cnt++][1] = j;\\n }\\n }\\n }\\n qsort(gn, cnt, sizeof(int) * 2, cmp1);\\n for (int i = 5; i < cnt; i++) {\\n if (sieve.find(pair<int, int>(gn[i][0], gn[i][1])) != sieve.end()) continue;\\n for (int j = 5; j < cnt; j++) {\\n x = gn[i][0] * gn[j][0] - gn[i][1] * gn[j][1];\\n y = gn[i][0] * gn[j][1] + gn[i][1] * gn[j][0];\\n if (x * x + y * y > 20000) break;\\n sieve.insert(pair<int, int>(x, y));\\n }\\n }\\n //freopen(\\\"E:\\\\\\\\PS\\\\\\\\ICPC\\\\\\\\Asia Pacific\\\\\\\\Japan Regional\\\\\\\\2012\\\\\\\\InputsAndOutputs12\\\\\\\\A.in\\\", \\\"r\\\", stdin);\\n //freopen(\\\"E:\\\\\\\\PS\\\\\\\\ICPC\\\\\\\\Asia Pacific\\\\\\\\Japan Regional\\\\\\\\2012\\\\\\\\InputsAndOutputs12\\\\\\\\A_t.out\\\", \\\"w\\\", stdout);\\n scanf(\\\"%d\\\", &t);\\n for (int tt = 0; tt < t; tt++) {\\n scanf(\\\"%d %d\\\", &x, &y);\\n if (sieve.find(pair<int, int>(x, y)) != sieve.end()) printf(\\\"C\\\\n\\\");\\n else printf(\\\"P\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 5924,\n \"score_of_the_acc\": -1.0335,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1325_5997974\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\n\\nvll dx = { 1,-1,0 };\\nvll dy = { 1,-1,0 };\\nint main() {\\n ll N;\\n cin>>N;\\n rep(n,N){\\n ll M,N;\\n cin>>M>>N;\\n ll D=M*M+N*N;\\n ll k=0;\\n for(ll x=-D;x<=D;x++){\\n ll B=D-x*x;\\n B=sqrt(B)+1;\\n for(ll y=-B;y<=B;y++){\\n if(x+y==0)continue;\\n ll C=x*x+y*y;\\n if((M*x+N*y)%C==0&&(M*y-N*x)%C==0){\\n k++;\\n //cout<<x<<\\\" \\\"<<y<<endl;\\n }\\n }\\n }\\n cout<<(k==8?\\\"P\\\":\\\"C\\\")<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.114,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1325_5847349\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nusing P = pair<ll, ll>;\\nconst int MAX = 20000;\\n\\nvoid solve() {\\n ll m, n;\\n cin >> m >> n;\\n vector<P> kouho;\\n for(ll a = 0; a <= MAX and a * a <= m * m + n * n; a++) {\\n for(ll b = 0; b <= MAX and a * a + b * b <= m * m + n * n; b++) {\\n if((a * a + b * b) == 0) continue;\\n if((m * m + n * n) % (a * a + b * b) == 0) {\\n kouho.emplace_back(a, b);\\n kouho.emplace_back(-a, b);\\n kouho.emplace_back(a, -b);\\n kouho.emplace_back(-a, -b);\\n }\\n }\\n }\\n sort(ALL(kouho));\\n kouho.erase(unique(ALL(kouho)), kouho.end());\\n // debug(m, n);\\n // debug(kouho);\\n int sz = kouho.size();\\n ll ans = 0;\\n REP(i, sz) {\\n auto [a1, b1] = kouho[i];\\n if((a1*m + b1*n) % (a1*a1+b1*b1) != 0 or (a1*n - b1*m) % (a1*a1+b1*b1) != 0) continue;\\n bool ok = false;\\n REP(j, sz) {\\n auto [a2, b2] = kouho[j];\\n if((a1 * a1 + b1 * b1) * (a2 * a2 + b2 * b2) == (m * m + n * n)) {\\n ok = true;\\n break;\\n }\\n }\\n // if(ok) debug(a1, b1);\\n ans += ok;\\n }\\n // debug(ans);\\n assert(ans >= 8);\\n cout << (ans == 8 ? \\\"P\\\" : \\\"C\\\") << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n int T;\\n cin >> T;\\n while(T--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.1689,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1325_5757890\",\n \"code_snippet\": \"#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n \\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n \\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n \\n// name macro\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T = int>\\nusing VVV = std::vector<std::vector<std::vector<T>>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\nusing Tp = tuple<ll,ll,ll>;\\n \\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n \\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"No\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n \\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n \\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n \\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v /= x;\\n}\\n \\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\ntemplate<typename T>\\nT ADD(T a, T b){\\n\\tT res;\\n\\treturn __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\\n}\\n\\ntemplate<typename T>\\nT MUL(T a, T b){\\n\\tT res;\\n\\treturn __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\\n}\\n\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n \\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\n\\n#pragma endregion\\n\\nusing R = long double;\\nconstexpr R EPS=1E-11;\\n\\n// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.\\nint sgn(const R& r){ return (r > EPS) - (r < -EPS); }\\n// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.\\nint sgn(const R& a, const R &b){ return sgn(a-b); }\\n// a > 0 は sgn(a) > 0\\n// a < b は sgn(a, b) < 0\\n// a >= b は sgn(a, b) >= 0\\n// のように書く.\\n// return s * 10^n\\n\\n//https://atcoder.jp/contests/abc191/submissions/20028529\\nlong long x10(const string& s, size_t n) {\\n if (s.front() == '-') return -x10(s.substr(1), n);\\n auto pos = s.find('.');\\n if (pos == string::npos) return stoll(s + string(n, '0'));\\n return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));\\n}\\n \\nlong long ceildiv(long long a, long long b) {\\n if (b < 0) a = -a, b = -b;\\n if (a >= 0) return (a + b - 1) / b;\\n else return a / b;\\n}\\n \\nlong long floordiv(long long a, long long b) {\\n if (b < 0) a = -a, b = -b;\\n if (a >= 0) return a / b;\\n else return (a - b + 1) / b;\\n}\\n \\nlong long floorsqrt(long long x) {\\n assert(x >= 0);\\n long long ok = 0;\\n long long ng = 1;\\n while (ng * ng <= x) ng <<= 1;\\n while (ng - ok > 1) {\\n long long mid = (ng + ok) >> 1;\\n if (mid * mid <= x) ok = mid;\\n else ng = mid;\\n }\\n return ok;\\n}\\n\\ninline int topbit(unsigned long long x){\\n\\treturn x?63-__builtin_clzll(x):-1;\\n}\\n\\ninline int popcount(unsigned long long x){\\n\\treturn __builtin_popcountll(x);\\n}\\n\\ninline int parity(unsigned long long x){//popcount%2\\n\\treturn __builtin_parity(x);\\n}\\n\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n\\n\\n\\nvoid main_() {\\n\\tint q;\\n\\tcin >> q;\\n\\tREP(i,q){\\n\\t int p,q;\\n\\t cin >> p >> q;\\n\\t bool ex = false;\\n\\t for(int i = -200;i <= 200;i++){\\n\\t for(int j = -200;j <= 200;j++){\\n\\t if(i == 0 && j == 0)continue;\\n\\t int n = q * i - p * j;\\n\\t int m = p * i + q * j;\\n\\t int sum = i * i + j * j;\\n\\t if(sum == 1 || sum == p * p + q * q)continue;\\n\\t if(n % sum == 0 && m % sum == 0){\\n\\t ex = true;\\n\\t }\\n\\t }\\n\\t }\\n\\t if(ex)cout << 'C' << endl;\\n\\t else cout << 'P' << endl;\\n\\t}\\n}\\n \\nint main() {\\n\\tint t = 1;\\n\\t//cin >> t;\\n\\twhile(t--) main_();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.1725,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1325_5751359\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define ALL(v) v.begin(),v.end()\\n\\nbool D(int a,int b){\\n a=abs(a);b=abs(b);\\n return (a%b)==0;\\n}\\n\\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\n\\nbool pr(int p,int q){\\n for(int m=-200;m<=200;m++)for(int n=-200;n<=200;n++){\\n if(m==0&&n==0)continue;\\n bool out=false;\\n REP(i,4)if(dx[i]==m&&dy[i]==n)out=true;\\n if(m==p&&n==q)out=true;\\n if(m==-q&&n==p)out=true;\\n if(m==-p&&n==-q)out=true;\\n if(m==q&&n==-p)out=true;\\n if(out)continue;\\n if(D(m*p+n*q,m*m+n*n)&&D(m*q-n*p,m*m+n*n))return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n int x;cin>>x;\\n while(x--){\\n int p,q;cin>>p>>q;\\n if(p*p+q*q==0)cout<<\\\"C\\\"<<endl;\\n else if(pr(p,q))cout<<\\\"P\\\"<<endl;\\n else cout<<\\\"C\\\"<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.1345,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1325_5557205\",\n \"code_snippet\": \"#include <cmath>\\n#include <deque>\\n#include <algorithm>\\n#include <iterator>\\n#include <list>\\n#include <tuple>\\n#include <map>\\n#include <unordered_map>\\n#include <queue>\\n#include <set>\\n#include <unordered_set>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <fstream>\\n#include <iostream>\\n#include <functional>\\n#include <numeric>\\n#include <iomanip> \\n#include <stdio.h>\\n//eolibraries\\n#define lnf 3999999999999999999\\n#define inf 999999999\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ll long long\\n#define all(c) (c).begin(),(c).end()\\n#define sz(c) (int)(c).size()\\n#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())\\n#define pii pair <int,int>\\n#define rep(i,n) for(int i = 0 ; i < n ; i++) \\n#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)\\n#define crep(i,x,n) for(int i = x ; i < n ; i++)\\n#define vi vector <int> \\n#define vec(...) vector<__VA_ARGS__>\\n#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);\\n//eodefine\\nusing namespace std;\\n\\nconst int max_n = 103002;\\n\\nvoid slv(int p,int q) {\\n\\tint ans=0;\\n\\tfor(int x=-200;x<=200;x++){\\n\\t\\tfor(int y=-200;y<=200;y++) {\\n\\t\\t\\tif(x==0 and y==0)continue;\\n\\t\\t\\tint n = (q*x-p*y)/(y*y+x*x);\\n\\t\\t\\tint m = (q*y+p*x)/(y*y+x*x);\\n\\t\\t\\tif(m*x-n*y==p and m*y+n*x==q) ans++;\\n\\t\\t\\t// ans++;\\n\\t\\t}\\n\\t}\\n\\tif(ans==8)cout<<\\\"P\\\\n\\\";\\n\\telse cout<<\\\"C\\\\n\\\";\\n\\t// cout<<ans<<\\\"\\\\n\\\";\\n}\\n\\nint main(){\\nfcin;\\n\\tint t;\\n\\tcin>>t;\\n\\twhile(t--) {\\n\\t\\tint n,m;\\n\\t\\tcin>>n>>m;\\n\\t\\tslv(n,m);\\n\\t}\\n/*\\n*/\\n return 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.1774,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1325_5086426\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n\\n//using namespace boost::multiprecision;\\n//#include<atcoder/all>\\n//#include<atcoder/segtree>\\n//#include <atcoder/scc>\\n//using namespace atcoder;\\n\\nusing dou =long double;\\nstring yes=\\\"yes\\\";\\nstring Yes=\\\"Yes\\\";\\nstring YES=\\\"YES\\\";\\nstring no=\\\"no\\\";\\nstring No=\\\"No\\\";\\nstring NO=\\\"NO\\\";\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nll mod = 998244353ll;\\n//ll mod = 1000000007ll;\\n//const ll mod = 4;\\n\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\n\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\\n//#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define brep(n) for(int bit=0;bit<(1<<n);bit++)\\n#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)\\n#define erep(i,container) for (auto &i : container)\\n#define itrep(i,container) for (auto i : container)\\n#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)\\n#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)\\n#define reprep(i,j,h,w) rep(i,h)rep(j,w)\\n#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)\\n#define all(x) (x).begin(),(x).end()\\n#define rall(x) (x).rbegin(),(x).rend()\\n#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];\\n#define pb push_back\\n#define pf push_front\\n#define query int qq;std::cin >> qq;rep(qqq,qq)\\n#define lb lower_bound\\n#define ub upper_bound\\n#define fi first\\n#define se second\\n#define itn int\\n#define mp make_pair\\n//#define sum(a) accumulate(all(a),0ll)\\n#define keta fixed<<setprecision\\n#define kout(d) std::cout << keta(10)<< d<< std::endl;\\n#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;\\n#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))\\n//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))\\n#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));\\n#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));\\n//#define case std::cout <<\\\"Case #\\\" <<qqq+1<<\\\":\\\"\\n#define RES(a,iq,jq) a.resize(iq);rep(iii,iq)a[iii].resize(jq);\\n\\n#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){a[ii][jj].resize(k);};\\n#define res resize\\n#define as assign\\n#define ffor for(;;)\\n#define ppri(a,b) std::cout << a<<\\\" \\\"<<b << std::endl\\n#define pppri(a,b,c) std::cout << a<<\\\" \\\"<<b <<\\\" \\\"<< c<<std::endl\\n#define ppppri(a,b,c,d) std::cout << a<<\\\" \\\"<<b <<\\\" \\\"<< c<<' '<<d<<std::endl\\n#define aall(x,n) (x).begin(),(x).begin()+(n)\\n#define SUMI(a) accumulate(all(a),0) \\n#define SUM(a) accumulate(all(a),0ll) \\n#define stirng string\\n#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;\\n#define popcount __builtin_popcount\\n#define permu(a) next_permutation(all(a))\\n#define aru(a,d) a.find(d)!=a.end()\\n#define nai(a,d) a.find(d)==a.end()\\n//#define aru p.find(mp(x,y))!=p.end()\\n//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];\\n\\n//typedef long long T;\\nll ceili(ll a,ll b){\\n return ((a+b-1)/b);\\n}\\nconst int INF = 2000000000;\\n//const ll INF64 =922330720854775807ll;\\nconst ll INF64 = 4223372036854775807ll;\\n//const ll INF64 = 9223372036854775807ll;\\n\\n//const ll INF64 = 243'000'000'000'000'000'0;Q\\n\\n\\n//const ll MOD = 1000000007ll;\\nconst ll MOD = 998244353ll;\\n//const ll MOD = 1000003ll;\\nconst ll OD = 1000000000000007ll;\\nconst dou pi=3.141592653589793;\\n\\nlong long modpow(long long a, long long n) { \\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % MOD;\\n a = a * a % MOD;\\n n >>= 1;\\n }\\n return res;\\n}\\nvector< ll > divisor(ll n) { //約数の列挙\\n vector< ll > ret;\\n for(ll i = 1; i * i <= n; i++) {\\n if(n % i == 0) {\\n ret.push_back(i);\\n if(i * i != n) ret.push_back(n / i);\\n }\\n }\\n sort(begin(ret), end(ret));\\n return (ret);\\n}\\n//メモ\\n//ゲーム(Grundy数とか)の復習をする\\n//リスニング力をどうにかする\\n//個数制限付きナップサックの復習\\n//戻すDP\\n//全方位木DPとスライド最小値\\n//ゲーム→パリティに注目するといいことあるかも\\n//ゲーム→もとの状態に戻せる状態を探す\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//理由がなければLLを使え！\\n//来週の月曜日に銀行へ行く\\n//積率を調べる実験を来週の火曜日までにやる\\n//レピュニット数\\n//フェルマーの小定理\\n//拡張ユークリッド\\n\\nint main(){\\n std::set<int> st;\\n rrep(i,0,12000){\\n st.insert(i*i);\\n }\\n query{\\n ll p,q;\\n std::cin >> p>>q;\\n int v=p*p+q*q;\\n auto di=divisor(p*p+q*q);\\n std::vector<bool> ok(di.size());\\n int po=0;\\n char c='P';\\n erep(ii,di){\\n if(ii==1||ii==p*p+q*q){\\n 1==1;\\n }\\n else{\\n bool ook=0;\\n erep(i,st){\\n if(aru(st,ii-i))ook=1;\\n }\\n ok[po]=ook;\\n }\\n //rep(i,ok.size())std::cout << ok[i] << ' ';\\n //std::cout << std::endl;\\n // ppri(po,ok.size()-1-po);\\n if(ok[po]&ok[ok.size()-1-po])c='C';\\n po++;\\n }\\n std::cout << c << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.3955,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1325_4937879\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n// debug methods\\n// usage: debug(x,y);\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef _DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\n#define MAX_N (1000006)\\n#define INF (1LL << 60)\\n#define eps 1e-9\\nconst int MOD = (int)1e9 + 7;\\n\\n\\nsigned main(){\\n //cin.tie(nullptr);\\n //std::ios::sync_with_stdio(false);\\n\\n int t;\\n cin >> t;\\n\\n while(t--){\\n int m,n;\\n cin >> m >> n;\\n\\n int cnt = 0;\\n int mx = abs(max(abs(m),abs(n)));\\n for(int p=-mx; p<=mx; p++){\\n for(int q=-mx; q<=mx; q++){\\n int d = p*p + q*q;\\n if(d==0) continue;\\n int d1 = p*m + q*n;\\n int d2 = p*n - q*m;\\n if(d1%d==0 && d2%d==0) {\\n debug(p,q);\\n cnt++;\\n }\\n }\\n }\\n debug(cnt);\\n cout << (cnt==8?\\\"P\\\":\\\"C\\\") << endl;\\n }\\n}\\n\\n/*\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.0454,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1325_4886506\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve() {\\n int p, q;\\n cin >> p >> q;\\n int cnt = 0;\\n for (int m = -200; m <= 200; ++m) {\\n for (int n = -200; n <= 200; ++n) {\\n if (m == n && n == 0) continue;\\n int x = m*m + n*n;\\n int y = m*p + n*q;\\n int z = m*q - n*p;\\n if (y % x == 0 && z % x == 0) cnt++;\\n }\\n }\\n cout << (cnt == 8 ? 'P' : 'C') << '\\\\n';\\n}\\n\\nint main() {\\n int t;\\n cin >> t;\\n while (t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.1563,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1325_4873041\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h> \\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr double eps = 1e-9;\\n// constexpr ll mod = 1000000007;\\nconstexpr ll mod = 998244353;\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n// --------------------------------------------------------------------------\\n\\n\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int _;\\n cin >> _;\\n while(_--){\\n int m,n;\\n cin >> m >> n;\\n int cnt = 0;\\n for(int i=-1000; i<1000; i++){\\n for(int j=-1000; j<1000; j++){\\n // if(i*i+j*j > m*m+n*n) break;\\n if(i*i+j*j < 1) continue;\\n if((i*m+j*n)%(i*i+j*j)==0 && (i*n-j*m)%(i*i+j*j)==0) cnt++;\\n }\\n }\\n if(cnt == 8){\\n cout << \\\"P\\\\n\\\";\\n }else{\\n cout << \\\"C\\\\n\\\";\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -1.1253,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1325_4873015\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h> \\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr double eps = 1e-9;\\n// constexpr ll mod = 1000000007;\\nconstexpr ll mod = 998244353;\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n// --------------------------------------------------------------------------\\n\\n\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int _;\\n cin >> _;\\n while(_--){\\n int m,n;\\n cin >> m >> n;\\n int cnt = 0;\\n for(int i=-1000; i<1000; i++){\\n for(int j=-1000; j<1000; j++){\\n // if(i*i+j*j > m*m+n*n) break;\\n if(i*i+j*j <= 1) continue;\\n if((i*m+j*n)%(i*i+j*j)==0 && (i*n-j*m)%(i*i+j*j)==0) cnt++;\\n }\\n }\\n if(cnt == 4){\\n cout << \\\"P\\\\n\\\";\\n }else{\\n cout << \\\"C\\\\n\\\";\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -1.1335,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1325_4773070\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 510000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n rep(i,a.size()) cout << a[i] << \\\" \\\";\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << \\\" \\\" << b << \\\"\\\\n\\\";}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nvoid solve(){\\n\\tint p,q; cin >> p >> q;\\n\\tint r = p*p + q*q;\\n\\tint cnt = 0;\\n\\tfor(int m=-150; m<=150; m++){\\n\\t\\tfor(int n=-150; n<=150; n++){\\n\\t\\t\\tif(m==0 && n==0) continue;\\n\\t\\t\\tint s = m*m + n*n;\\n\\t\\t\\tif(r % s != 0) continue;\\n\\t\\t\\tint t = r / s;\\n\\t\\t\\tbool f = false;\\n\\t\\t\\tfor(int x=0; x<=150; x++){\\n\\t\\t\\t\\tint Y = t - x*x;\\n\\t\\t\\t\\tint y = sqrt(Y);\\n\\t\\t\\t\\tif(y*y != Y) continue;\\n\\t\\t\\t\\tf = true; break;\\n\\t\\t\\t}\\n\\t\\t\\tif((m*p + n*q) % s == 0 && (m*q - n*p) % s == 0) cnt++;\\n\\t\\t}\\n\\t}\\n\\tif(cnt == 8) puts(\\\"P\\\");\\n\\telse puts(\\\"C\\\");\\n}\\n\\nint main(){\\n\\tint t; cin >> t;\\n\\twhile(t--){\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.0578,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1325_4770199\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> T;\\n\\twhile (T--) {\\n\\t\\tcin >> N >> M;\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = -150; i <= 150; i++) {\\n\\t\\t\\tfor (int j = -150; j <= 150; j++) {\\n\\t\\t\\t\\tif (!i && !j)continue;\\n\\t\\t\\t\\tif ((i*N + j * M) % (i*i + j * j) == 0 && (i*M - j * N) % (i*i + j * j) == 0)ans++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans == 8)cout << \\\"P\\\" << endl;\\n\\t\\telse cout << \\\"C\\\" << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.0861,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1325_4738311\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int T;\\n cin >> T;\\n for (int i = 0; i < T; i++){\\n int m, n;\\n cin >> m >> n;\\n int s = m * m + n * n;\\n bool prime = true;\\n int a = sqrt(s - 1);\\n for (int j = - a; j <= a; j++){\\n int b = sqrt(s - j * j - 1);\\n for (int k = - b; k <= b; k++){\\n int t = j * j + k * k;\\n if (abs(t) > 1){\\n if ((j * m + k * n) % (j * j + k * k) == 0 && (j * n - k * m) % (j * j + k * k) == 0){\\n prime = false;\\n }\\n }\\n }\\n }\\n if (prime){\\n cout << 'P' << endl;\\n } else {\\n cout << 'C' << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2988,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":777,"cells":{"group_id":{"kind":"string","value":"aoj_1327_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nOne-Dimensional Cellular Automaton\nThere is a one-dimensional cellular automaton consisting of\nN\ncells. Cells are numbered from 0 to\nN\n− 1.\nEach cell has a state represented as a non-negative integer less than\nM\n. The states of cells evolve through discrete time steps. We denote the state of the i-th cell at time t as\nS\n(\ni\n,\nt\n). The state at time\nt\n+ 1 is defined by the equation\nS\n(\ni\n,\nt\n+ 1) = (\nA\n×\nS\n(\ni\n− 1,\nt\n) +\nB\n×\nS\n(\ni\n,\nt\n) +\nC\n×\nS\n(\ni\n+ 1,\nt\n)) mod\nM\n, (1)\nwhere\nA\n,\nB\nand\nC\nare non-negative integer constants. For\ni\n< 0 or\nN\n≤\ni\n, we define\nS\n(\ni\n,\nt\n) = 0.\nGiven an automaton definition and initial states of cells, your mission is to write a program that computes the states of the cells at a specified time\nT\n.\nInput\nThe input is a sequence of datasets. Each dataset is formatted as follows.\nN M A B C T\nS\n(0, 0)\nS\n(1, 0) ...\nS\n(\nN\n− 1, 0)\nThe first line of a dataset consists of six integers, namely\nN\n,\nM\n,\nA\n,\nB\n,\nC\nand\nT\n.\nN\nis the number of cells.\nM\nis the modulus in the equation (1).\nA\n,\nB\nand\nC\nare coefficients in the equation (1). Finally,\nT\nis the time for which you should compute the states.\nYou may assume that 0 <\nN\n≤ 50, 0 <\nM\n≤ 1000, 0 ≤\nA\n,\nB\n,\nC\n<\nM\nand 0 ≤\nT\n≤ 10\n9\n.\nThe second line consists of\nN\nintegers, each of which is non-negative and less than\nM\n. They represent the states of the cells at time zero.\nA line containing six zeros indicates the end of the input.\nOutput\nFor each dataset, output a line that contains the states of the cells at time\nT\n. The format of the output is as follows.\nS\n(0,\nT\n)\nS\n(1,\nT\n) ...\nS\n(\nN\n− 1,\nT\n)\nEach state must be represented as an integer and the integers must be separated by a space.\nSample Input\n5 4 1 3 2 0\n0 1 2 0 1\n5 7 1 3 2 1\n0 1 2 0 1\n5 13 1 3 2 11\n0 1 2 0 1\n5 5 2 0 1 100\n0 1 2 0 1\n6 6 0 2 3 1000\n0 1 2 0 1 4\n20 1000 0 2 3 1000000000\n0 1 2 0 1 0 1 2 0 1 0 1 2 0 1 0 1 2 0 1\n30 2 1 0 1 1000000000\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0\n30 2 1 1 1 1000000000\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n30 5 2 3 1 1000000000\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0\nOutput for the Sample Input\n0 1 2 0 1\n2 0 0 4 3\n2 12 10 9 11\n3 0 4 2 1\n0 4 2 0 4 4\n0 376 752 0 376 0 376 752 0 376 0 376 752 0 376 0 376 752 0 376\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 1 3 2 2 2 3 3 1 4 3 1 2 3 0 4 3 3 0 4 2 2 2 2 1 1 2 1 3 0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1327_11043071","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\n\nll mod = 998244353;\nconst ll INF = 1e18;\n\nifstream in;\nofstream out;\n\nint main(int argc, char** argv) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n if(argc > 2) {\n in.open(argv[1]);\n cin.rdbuf(in.rdbuf());\n out.open(argv[2]);\n cout.rdbuf(out.rdbuf());\n }\n\n while(1) {\n ll n, m, a, b, c, t;\n cin >> n >> m >> a >> b >> c >> t;\n if(n == 0) break;\n vector<ll> s(n);\n for(auto& x : s) cin >> x;\n\n vector<vector<vector<ll>>> mat(31, vector(n, vector<ll>(n, 0)));\n for(int i = 0; i < n; i++) {\n if(i) mat[0][i][i - 1] = a;\n mat[0][i][i] = b;\n if(i + 1 < n) mat[0][i][i + 1] = c;\n }\n\n auto mul = [&](vector<vector<ll>>& l, vector<vector<ll>>& r) {\n vector<vector<ll>> res(n, vector<ll>(n, 0));\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n for(int k = 0; k < n; k++) {\n res[i][j] += l[i][k] * r[k][j];\n res[i][j] %= m;\n }\n }\n }\n return res;\n };\n\n for(int i = 1; i <= 30; i++) {\n mat[i] = mul(mat[i - 1], mat[i - 1]);\n }\n\n vector<vector<ll>> p(n, vector<ll>(n, 0));\n for(int i = 0; i < n; i++) {\n p[i][i] = 1;\n }\n\n for(int i = 0; i <= 30; i++) {\n if((1 << i) & t) {\n p = mul(p, mat[i]);\n }\n }\n\n for(int i = 0; i < n; i++) {\n ll ans = 0;\n for(int j = 0; j < n; j++) {\n ans += p[i][j] * s[j];\n ans %= m;\n }\n cout << ans << \" \\n\"[i == n - 1];\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":500,"memory_kb":4352,"score_of_the_acc":-0.8262,"final_rank":17},{"submission_id":"aoj_1327_10885517","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\nvvi mul(vvi &a,vvi &b,int mod){\n assert(sz(a));assert(sz(b));\n assert(sz(a[0]) == sz(b));\n int n = sz(a),m = sz(b[0]);\n vvi res(n,vi(m));\n rep(i,0,n)rep(j,0,m)rep(k,0,sz(a[0])){\n (res[i][j] += a[i][k]*b[k][j]%mod)%= mod;\n }\n return res;\n}\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n ll n,m,T;\n vi coef(3);\n cin >> n >> m >> coef >> T;\n if(!n)break;\n vvi a(n,vi(1));cin >> a;\n vvi mat(n,vi(n));\n rep(i,0,n)rep(j,-1,2){\n int ni = i + j;\n if(ni < 0 || ni >= n)continue;\n mat[ni][i] = coef[1-j];\n }\n while(T){\n if(T & 1)a = mul(mat,a,m);\n T >>= 1;\n mat = mul(mat,mat,m);\n }\n rep(i,0,n)cout << a[i][0] << \" \\n\"[i+1 == n];\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":1240,"memory_kb":3480,"score_of_the_acc":-0.7008,"final_rank":16},{"submission_id":"aoj_1327_10851061","code_snippet":"#include<iostream>\n#include<stdio.h>\n#include<cstring>\nusing namespace std;\nconst int MAX = 55;\nint M;\n\n\nstruct Matrix\n{\n int v[MAX][MAX];\n};\n\nint n,k; //分别代表的是每个置换的长度\n//置换的一组的个数\n//以及一共置换的操作\n\nMatrix mtAdd(Matrix A, Matrix B) // 求矩阵 A + B\n{\n int i, j;\n Matrix C;\n for(i = 0; i < n; i ++)\n for(j = 0; j < n; j ++)\n C.v[i][j]=(A.v[i][j]+B.v[i][j])%M;\n return C;\n}\n\nMatrix mtMul(Matrix A, Matrix B) // 求矩阵 A * B\n{\n int i, j, k;\n Matrix C;\n for(i = 0; i < n; i ++)\n for(j = 0; j < n; j ++)\n {\n C.v[i][j] = 0;\n for(k = 0; k < n; k ++)\n C.v[i][j] = (A.v[i][k] * B.v[k][j] + C.v[i][j])%M;\n }\n return C;\n}\n\nMatrix mtPow(Matrix A, int k) // 求矩阵 A ^ k\n{\n if(k == 0)\n {\n memset(A.v, 0, sizeof(A.v));\n for(int i = 0; i < n; i ++)\n A.v[i][i] = 1;\n return A;\n }\n if(k == 1) return A;\n Matrix C = mtPow(A, k / 2);\n if(k % 2 == 0)\n return mtMul(C, C);\n else\n return mtMul(mtMul(C, C), A);\n}\n\nvoid out(Matrix A)\n{\n for(int i=0; i<n; i++)\n {\n for(int j=0; j<n; j++)\n cout<<A.v[i][j]<<\" \";\n cout<<endl;\n }\n cout<<endl;\n}\n\nint main ()\n{\n int A,B,C,T;\n Matrix NUM;\n while(~scanf(\"%d%d%d%d%d%d\",&n,&M,&A,&B,&C,&T)){\n if(n==0) break;\n for(int i=0;i<n;i++){\n scanf(\"%d\",&NUM.v[i][0]);\n }\n//out(NUM);\n Matrix yun;\n for(int i=0;i<n;i++){\n if(i-1>=0) yun.v[i][i-1]=A;\n yun.v[i][i]=B;\n if(i-1<n) yun.v[i][i+1]=C;\n }\n//out(yun);\n Matrix ans = mtPow(yun,T);\n//out(ans);\n NUM=mtMul(ans,NUM);\n//out(NUM);\n for(int i=0;i<n-1;i++) printf(\"%d \",NUM.v[i][0]);\n printf(\"%d\\n\",NUM.v[n-1][0]);\n }\n}","accuracy":1,"time_ms":780,"memory_kb":5048,"score_of_the_acc":-1.2816,"final_rank":19},{"submission_id":"aoj_1327_10684193","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint n,m,p,a,b,c,T,w[55];\nstruct st{\n\tint v[55][55];\n}k[55],ans;\nint read(){\n\tint f=1,ans=0;\n\tchar x=getchar();\n\twhile(x<'0'||x>'9'){\n\t\tif(x=='-'){\n\t\t\tf=-1;\n\t\t}\n\t\tx=getchar();\n\t}\n\twhile(x>='0'&&x<='9'){\n\t\tans=ans*10+x-'0';\n\t\tx=getchar();\n\t}\n\treturn ans*f;\n}\nvoid write(int x){\n\tchar c[10005]={};\n\tint i=0;\n\tif(x==0){\n\t\tputchar('0');\n\t}\n\tif(x<0){\n\t\tputchar('-');\n\t\tx*=-1;\n\t}\n\twhile(x){\n\t\tc[++i]=x%10;\n\t\tx/=10;\n\t}\n\twhile(i){\n\t\tputchar(c[i]+'0');\n\t\ti--;\n\t}\n\tputchar(' ');\n}\nvoid gmnb(int x,int y,int z,st &u,int a[55][55],int b[55][55],int mod){\n\tint k1[55][55]={};\n\tfor(int i=1;i<=x;i++){\n\t\tfor(int j=1;j<=z;j++){\n\t\t\tfor(int l=1;l<=y;l++){\n\t\t\t\tk1[i][j]=k1[i][j]+a[i][l]*b[l][j];\n\t\t\t\tk1[i][j]%=mod;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<=x;i++){\n\t\tfor(int j=1;j<=z;j++){\n\t\t\tu.v[i][j]=k1[i][j];\n\t\t}\n\t}\n}\nvoid lfnb(int x,int y,int mod){\n\tint cnt=1,r[55][55]={},q=1;\n\tbool f[55]={};\n\twhile(q<=x){\n\t\tq*=2;\n\t\tcnt++;\n\t\tgmnb(y,y,y,k[cnt],k[cnt-1].v,k[cnt-1].v,mod);\n\t}\n\tint cnt1=cnt;\n\twhile(cnt--){\n\t\tif(x>=q){\n\t\t\tx-=q;\n\t\t\tf[cnt+1]=1;\n\t\t}\n\t\tq/=2;\n\t}\n\tfor(int i=1;i<cnt1;i++){\n\t\tif(f[i]){\n\t\t\tgmnb(y,y,y,ans,ans.v,k[i].v,mod);\n\t\t}\n\t}\n}\nint main(){\n\twhile(1){\n\t\tn=read(),m=read(),a=read(),b=read(),c=read(),T=read();\n\t\tif(n==0&&m==0&&a==0&&b==0&&c==0&&T==0){\n\t\t\treturn 0;\n\t\t}\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tfor(int j=1;j<=n;j++){\n\t\t\t\tif(i==j+1){\n\t\t\t\t\tk[1].v[i][j]=c;\n\t\t\t\t\tans.v[i][j]=0;\n\t\t\t\t}else if(i+1==j){\n\t\t\t\t\tk[1].v[i][j]=a;\n\t\t\t\t\tans.v[i][j]=0;\n\t\t\t\t}else if(i==j){\n\t\t\t\t\tk[1].v[i][j]=b;\n\t\t\t\t\tans.v[i][j]=1;\n\t\t\t\t}else{\n\t\t\t\t\tk[1].v[i][j]=0;\n\t\t\t\t\tans.v[i][j]=0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tw[i]=read();\n\t\t}\n\t\tlfnb(T,n,m);\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tint h=0;\n\t\t\tfor(int j=1;j<=n;j++){\n\t\t\t\th+=w[j]*ans.v[j][i];\n\t\t\t\th%=m;\n\t\t\t}\n if (i == n) {printf(\"%lld\", h % m); continue;}\n\t\t\twrite(h%m);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":800,"memory_kb":3508,"score_of_the_acc":-0.5349,"final_rank":11},{"submission_id":"aoj_1327_10684188","code_snippet":"#include <iostream>\n#include <cstdio>\n#define ll long long\nusing namespace std;\n#define MAXN 60\n\nint n , m , a , b , c , t;\nstruct Matrix{\n\tll data[MAXN][MAXN];\n\tint heng , zong;\n\tvoid kind3(){\n\t\theng = zong = n;\n\t\tfor( int i = 1 ; i < MAXN ; i++ )\n\t\t\tfor( int j = 1 ; j < MAXN ; j++ )\n\t\t\t\tdata[i][j] = 0;\n\t}\n\tvoid kind4(){\n\t\tkind3();\n\t\tfor( int i = 1 ; i <= n ; i++ )\n\t\t\tdata[i][i] = 1;\n\t}\n\t\n\tvoid kind2(){\n\t\tkind3();\n\t\theng = zong = n;\n\t\tfor( int i = 1 ; i <= n ; i++ ){\n\t\t\tif(i>1) data[i][i-1] = a;\n\t\t\tdata[i][i] = b;\n\t\t\tif(i<n) data[i][i+1] = c;\n\t\t}\n\t}\n\tvoid print(){\n\t\tcout << \"[Martix] \" << heng << \" \" << zong << endl;\n\t\tfor( int i = 1 ; i <= zong ; i++ ){\n\t\t\tfor( int j = 1 ; j <= heng ; j++ )\n\t\t\t\tcout << data[i][j] << \" \";\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\nMatrix get0(){\n\tMatrix m1;\n\tm1.kind3();\n\treturn m1;\n}\nMatrix get1(){\n\tMatrix m1;\n\tm1.kind4();\n\treturn m1;\n}\nMatrix operator*( Matrix m1 , Matrix m2 ){\n\tMatrix m3; m3.kind3();\n\tfor( int i = 1 ; i <= n ; i++ )\n\t\tfor( int j = 1 ; j <= m2.heng ; j++ ){\n\t\t\tm3.data[i][j] = 0;\n\t\t\tfor( int k = 1 ; k <= n ; k++ ){\n\t\t\t\tm3.data[i][j] += m1.data[i][k] * m2.data[k][j];\n\t\t\t\tm3.data[i][j] %= m;\n\t\t\t}\n\t\t}\n\treturn m3;\n}\nMatrix pow( Matrix a , int b ){\n\tMatrix ret; ret = get1();\n\tMatrix now; now = a;\n\twhile( b ){\n\t\tif( b & 1 ) ret = ret * now;\n\t\tnow = now * now;\n \tb = b >> 1;\n\t}\n\treturn ret;\n}\n/*\nBC\n ABC\n ABC\n ...\n AB\n*/\nint main(){\n\t//freopen(\"C.txt\",\"r\",stdin);\n\tbool fir = 1;\n\twhile( 1 ){\n\t\tscanf(\"%d %d %d %d %d %d\",&n,&m,&a,&b,&c,&t);\n\t\tif( !fir ){\n\t\t\tputchar('\\n');\n\t\t}else fir = 0;\n\t\tif( n == 0 ) return 0;\n\t\t//cout << n << \" \" << m << \" \" << a << \" \" << b << \" \" << c << \" \" << t << endl;\n\t\tMatrix A; A.kind2();\n\t\tMatrix B; B.kind3(); B.heng = 1; B.zong = n;\n\t\tMatrix C; C.kind3();\n\t\tfor( int i = 1 ; i <= n ; i++ ){\n\t\t\tscanf(\"%lld\",&B.data[i][1]);\n\t\t}\n\t\t//B.print();\n\t\t//Matrix AA = A;\n\t\t//A.print();\n\t\tA = pow(A,t);\n\t\t//A.print();\n\t\t//AA = AA*AA;\n\t\t//AA.print();\n\t\t//cout << \"[Main] \\\"^\\\" Done\" << endl;\n\t\tC = A*B;\n\t\tfor( int i = 1 ; i < n ; i++ )\n\t\t\tprintf(\"%lld \",C.data[i][1]%m);\n\t\tprintf(\"%lld\",C.data[n][1]%m);\n\t\t//return 0;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1360,"memory_kb":3932,"score_of_the_acc":-0.9713,"final_rank":18},{"submission_id":"aoj_1327_10179895","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nstatic int64_t MOD = 998244353L;\n\nconst int MAX_N = 50;\nstatic int64_t X0[MAX_N];\n//------------------------------------------------------------------------------\ntypedef vector<vector<int64_t> > MAT;\ntypedef vector<int64_t> VEC;\n\n//------------------------------------------------------------------------------\nclass Matrix\n{\n public:\n int N;\n MAT data;\n\n Matrix(int size): N(size)\n {\n data.resize(N);\n for (int i=0; i<N; ++i) data[i].resize(N);\n for (int i=0; i<N; i++) for (int j=0; j<N; j++) data[i][j] = 0;\n }\n\n Matrix(const MAT& values): N(values.size()), data(values)\n {\n \n }\n\n static Matrix identity(int size)\n {\n MAT values(size, vector<int64_t>(size, 0));\n for (int i=0; i<size; ++i) values[i][i] = 1L;\n return Matrix(values);\n }\n\n static Matrix zero(int size)\n {\n MAT values(size, vector<int64_t>(size, 0L));\n return Matrix(values);\n }\n\n Matrix operator*(const Matrix& M1) const\n {\n Matrix R(N);\n for (int i=0; i<N; i++)\n for (int j=0; j<N; j++)\n for (int k=0; k<N; k++)\n {\n R.data[i][j] += data[i][k] * M1.data[k][j];\n if (R.data[i][j] >= MOD) R.data[i][j] %= MOD;\n }\n return R;\n\n }\n\n VEC operator*(const VEC& X) const\n {\n VEC Y(N, 0); //<----------\n for (int i=0; i<N; i++)\n for (int j=0; j<N; j++)\n {\n Y[i] += data[i][j] * X[j];\n if (Y[i] >= MOD) Y[i] %= MOD;\n }\n return Y;\n }\n\n static\n Matrix power(Matrix& A, int64_t x)\n {\n int N = A.N;\n Matrix R = identity(N);\n //int iterations = 3;\n //while (x > 0 && iterations--)\n while (x > 0)\n {\n if (x%2 == 1) R = R * A;\n A = A * A;\n x /= 2;\n }\n\n\n\n return R;\n }\n\n\n void debug()\n {\n for (int i=0; i<N; i++)\n {\n for (int j=0; j<N; j++) printf(\"%ld \",data[i][j]); printf(\"\\n\");\n }\n printf(\"\\n\");\n }\n};\n\n//------------------------------------------------------------------------------\nvoid vec_debug(const VEC& v)\n{\n int N = v.size();\n for (int i=0; i<N; ++i)\n {\n printf(\"%ld\", v[i]);\n if (i < N-1) printf(\" \");\n }\n printf(\"\\n\");\n}\n\n//------------------------------------------------------------------------------\nvoid solve(int N, int64_t M, int64_t A, int64_t B, int64_t C, int64_t K)\n{\n MOD = M;\n\n VEC x(N);\n for (int i=0; i<N; ++i) x[i] = X0[i];\n if (K == 0)\n {\n vec_debug(x);\n return;\n }\n\n MAT data(N, VEC(N, 0));\n for (int m=0; m<N; ++m)\n {\n if (m-1 >= 0) data[m][m-1] = A;\n data[m][m] = B;\n if (m+1 < N) data[m][m+1] = C;\n }\n Matrix Mat1(data);\n Matrix Mat2 = Matrix::power(Mat1, K);\n VEC y = Mat2*x;\n vec_debug(y);\n}\n//------------------------------------------------------------------------------\nvoid test()\n{\n}\n//------------------------------------------------------------------------------\nint main()\n{\n //DEBUG = true;\n //test(); return 0;\n //--------------------------------------------------------------------------\n int N, num;\n int64_t M, A, B, C, K;\n while (true)\n {\n num = scanf(\"%d %ld %ld %ld %ld %ld \", &N, &M, &A, &B, &C, &K);\n if (N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && K == 0) break;\n\n for (int i=0; i<N; ++i)\n {\n num = scanf(\"%ld \", &X0[i]);\n //if (X0[i] >= MOD) X0[i] %= MOD;\n }\n\n solve(N, M, A, B, C, K);\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":960,"memory_kb":3480,"score_of_the_acc":-0.5865,"final_rank":14},{"submission_id":"aoj_1327_9597887","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nll N, M, A, B, C, T;\n\nvector<vector<ll>> Mul(vector<vector<ll>>& X, vector<vector<ll>>& Y) {\n int n = X.size(), m = X[0].size(), l = Y[0].size();\n vector<vector<ll>> Z(n,vector<ll>(l,0));\n rep(i,0,n) {\n rep(j,0,m) {\n rep(k,0,l) {\n Z[i][k] += X[i][j] * Y[j][k];\n Z[i][k] %= M;\n }\n }\n }\n return Z;\n}\n\nvector<vector<ll>> Pow(vector<vector<ll>>& X, ll K) {\n int n = X.size();\n if (K == 0) {\n vector<vector<ll>> Z(n,vector<ll>(n,0));\n rep(i,0,n) Z[i][i] = 1 % M;\n return Z;\n }\n if (K % 2 == 0) {\n vector<vector<ll>> Z = Pow(X,K/2);\n return Mul(Z,Z);\n }\n vector<vector<ll>> Z = Pow(X,K-1);\n return Mul(Z,X);\n}\n\nint main() {\nwhile(1) {\n cin >> N >> M >> A >> B >> C >> T;\n if (N == 0) return 0;\n vector<vector<ll>> F(N,vector<ll>(N,0)), G(N,vector<ll>(1));\n rep(i,0,N) cin >> G[i][0];\n rep(i,0,N) {\n rep(j,-1,2) {\n if (0 <= i+j && i+j < N) {\n if (j==-1) F[i][i+j] = A;\n if (j==0) F[i][i+j] = B;\n if (j==1) F[i][i+j] = C;\n }\n }\n }\n F = Pow(F,T);\n G = Mul(F,G);\n rep(i,0,N) cout << G[i][0] << (i==N-1 ? '\\n' : ' ');\n}\n}","accuracy":1,"time_ms":880,"memory_kb":3380,"score_of_the_acc":-0.5048,"final_rank":9},{"submission_id":"aoj_1327_9532418","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nstruct SetupIO {\n SetupIO() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(30);\n }\n} setup_io;\nstruct Barrett {\n explicit Barrett(unsigned int m)\n : _m(m), im((unsigned long long)(-1) / m + 1) {}\n inline unsigned int umod() const {\n return _m;\n }\n inline unsigned int mul(unsigned int a, unsigned int b) const {\n unsigned long long z = a;\n z *= b;\n unsigned long long x = (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n unsigned int v = (unsigned int)(z - x * _m);\n if(_m <= v) v += _m;\n return v;\n }\n\n private:\n unsigned int _m;\n unsigned long long im;\n};\ntemplate <int id>\nstruct DynamicModint {\n using mint = DynamicModint;\n static int mod() {\n return (int)bt.umod();\n }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = Barrett(m);\n }\n static mint raw(int v) {\n mint a;\n a._v = v;\n return a;\n }\n DynamicModint()\n : _v(0) {}\n template <class T>\n DynamicModint(const T& v) {\n static_assert(is_integral_v<T>);\n if(is_signed_v<T>) {\n long long x = (long long)(v % (long long)(umod()));\n if(x < 0) x += umod();\n _v = (unsigned int)(x);\n } else _v = (unsigned int)(v % umod());\n }\n unsigned int val() const {\n return _v;\n }\n mint& operator++() {\n ++_v;\n if(_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if(_v == 0) _v = umod();\n --_v;\n return *this;\n }\n mint operator++(int) {\n mint res = *this;\n ++*this;\n return res;\n }\n mint operator--(int) {\n mint res = *this;\n --*this;\n return res;\n }\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if(_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if(_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) {\n return *this *= rhs.inv();\n }\n mint operator+() const {\n return *this;\n }\n mint operator-() const {\n return mint() - *this;\n }\n mint pow(long long n) const {\n assert(0 <= n);\n if(n == 0) return 1;\n mint x = *this, r = 1;\n while(1) {\n if(n & 1) r *= x;\n n >>= 1;\n if(n == 0) return r;\n x *= x;\n }\n }\n mint inv() const {\n auto eg = inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n friend istream& operator>>(istream& in, mint& x) {\n long long a;\n in >> a;\n x = a;\n return in;\n }\n friend ostream& operator<<(ostream& out, const mint& x) {\n return out << x.val();\n }\n\n private:\n unsigned int _v = 0;\n static Barrett bt;\n inline static unsigned int umod() {\n return bt.umod();\n }\n inline static pair<long long, long long> inv_gcd(long long a, long long b) {\n if(a == 0) return {b, 0};\n long long s = b, t = a, m0 = 0, m1 = 1;\n while(t) {\n const long long u = s / t;\n s -= t * u;\n m0 -= m1 * u;\n swap(s, t);\n swap(m0, m1);\n }\n if(m0 < 0) m0 += b / s;\n return {s, m0};\n }\n};\ntemplate <int id>\nBarrett DynamicModint<id>::bt(998244353);\nusing modint = DynamicModint<-1>;\nusing mint = modint;\ntemplate <typename T>\nstruct Matrix {\n Matrix(int h, int w, T val = 0)\n : h(h), w(w), A(h, vector<T>(w, val)) {}\n int H() const {\n return h;\n }\n int W() const {\n return w;\n }\n const vector<T>& operator[](int i) const {\n assert(0 <= i and i < h);\n return A[i];\n }\n vector<T>& operator[](int i) {\n assert(0 <= i and i < h);\n return A[i];\n }\n static Matrix I(int n) {\n Matrix mat(n, n);\n for(int i = 0; i < n; ++i) mat[i][i] = 1;\n return mat;\n }\n Matrix& operator+=(const Matrix& B) {\n assert(h == B.h and w == B.w);\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n (*this)[i][j] += B[i][j];\n }\n }\n return (*this);\n }\n Matrix& operator-=(const Matrix& B) {\n assert(h == B.h and w == B.w);\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n (*this)[i][j] -= B[i][j];\n }\n }\n return (*this);\n }\n Matrix& operator*=(const Matrix& B) {\n assert(w == B.h);\n vector<vector<T>> C(h, vector<T>(B.w, 0));\n for(int i = 0; i < h; ++i) {\n for(int k = 0; k < w; ++k) {\n for(int j = 0; j < B.w; ++j) {\n C[i][j] += (*this)[i][k] * B[k][j];\n }\n }\n }\n A.swap(C);\n return (*this);\n }\n Matrix& pow(long long t) {\n assert(h == w);\n assert(t >= 0);\n Matrix B = Matrix::I(h);\n while(t > 0) {\n if(t & 1ll) B *= (*this);\n (*this) *= (*this);\n t >>= 1ll;\n }\n A.swap(B.A);\n return (*this);\n }\n Matrix operator+(const Matrix& B) const {\n return (Matrix(*this) += B);\n }\n Matrix operator-(const Matrix& B) const {\n return (Matrix(*this) -= B);\n }\n Matrix operator*(const Matrix& B) const {\n return (Matrix(*this) *= B);\n }\n bool operator==(const Matrix& B) const {\n assert(h == B.H() and w == B.W());\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n if(A[i][j] != B[i][j]) return false;\n }\n }\n return true;\n }\n bool operator!=(const Matrix& B) const {\n assert(h == B.H() and w == B.W());\n for(int i = 0; i < h; ++i) {\n for(int j = 0; j < w; ++j) {\n if(A[i][j] != B[i][j]) return true;\n }\n }\n return false;\n }\n\n private:\n int h, w;\n vector<vector<T>> A;\n};\nint main(void) {\n while(true) {\n ll n, m, a, b, c, t;\n cin >> n >> m >> a >> b >> c >> t;\n if(n == 0) break;\n mint::set_mod(m);\n Matrix<mint> vec(n, 1);\n rep(i, 0, n) {\n cin >> vec[i][0];\n }\n Matrix<mint> mat(n, n);\n rep(i, 0, n) {\n if(i > 0) mat[i][i - 1] = a;\n mat[i][i] = b;\n if(i < n - 1) mat[i][i + 1] = c;\n }\n vec = mat.pow(t) * vec;\n rep(i, 0, n) {\n cout << vec[i][0] << \" \\n\"[i + 1 == n];\n }\n }\n}","accuracy":1,"time_ms":240,"memory_kb":3608,"score_of_the_acc":-0.3553,"final_rank":6},{"submission_id":"aoj_1327_9377609","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define pb push_back\n#define mk make_pair\n#define S second\n#define F first\nint M;\nvector<vector<int>> mul(vector<vector<int>> a, vector<vector<int>> b){\n\t int n = a.size();\n\t int m = b[0].size();\n\t vector<vector<int>> ans(n, vector<int>(m, 0));\n\t for(int i = 0; i<n; i++){\n\t \t for(int j = 0; j<m; j++){\n\t \t \t int sum = 0;\n\t \t \t for(int k = 0; k<a[0].size(); k++){\n\t \t \t \t sum += a[i][k]*b[k][j]%M;\n\t \t \t \t sum %= M;\n\t\t\t\t\t\t }\n\t\t\t\t\t\t ans[i][j] = sum;\n\t\t\t\t }\n\t\t }\n\t\t return ans;\n}\nvector<vector<int>> exp(vector<vector<int>> a, int n, vector<vector<int>> unit){\n\t auto ans = unit;\n\t auto x = a;\n\t if(n == 0) return unit;\n\t while(n > 0){\n\t \t if(n %2 == 1) ans = mul(x, ans);\n\t \t x = mul(x, x);\n\t \t n/=2;\n\t }\n\t return ans;\n}\nvoid solve(int n, int m, int a, int b, int c, int t){\n\t\n\tM = m;\n\tint arr[n+5];\n\tfor(int i = 0; i<n; i++) cin >> arr[i];\n\tvector<vector<int>> mt(n, vector<int>(n, 0));\n for(int i = 0; i<n; i++){\n \t mt[i][i] = b;\n \t if(i!=0) mt[i][i-1] = a;\n \t if(i!=n-1) mt[i][i+1] = c;\n\t}\n\tvector<vector<int>> unit(n, vector<int>(n, 0));\n\tfor(int i = 0; i<n; i++) unit[i][i] = 1;\n\tvector<vector<int>> init(n, vector<int>(1, 0));\n\tfor(int i = 0; i<n; i++) init[i][0] = arr[i];\n\tauto big = exp(mt, t, unit);\n\tauto ans = mul(big, init);\n\tfor(int i = 0; i<n; i++) {\n\t\tif(i < n-1) cout << ans[i][0] << \" \";\n\t\telse cout << ans[i][0];\n\t}\n\t\n}\nint main(){\n\t\n while(true){\n \t int n, m, a, b, c, t;\n\tcin >> n >> m >> a >> b >> c >> t;\n\t if(n == 0 && m == 0 && a == 0 && b == 0 && c == 0 && t == 0) break;\n\t solve(n, m, a, b, c, t);\n\t cout << '\\n';\n\t } \n\t\n}","accuracy":1,"time_ms":850,"memory_kb":3668,"score_of_the_acc":-0.6337,"final_rank":15},{"submission_id":"aoj_1327_9329181","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\n\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\n\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\n\n\tfor (int i = 0; i < ln; i++) {\n\t\tfor (int j = 0; j < rm; j++) {\n\t\t\tfor (int k = 0; k < lm; k++) {\n\t\t\t\tresult[i][j] += left[i][k] * right[k][j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\n\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\n\tfor (int i = 0; i < mat.size(); i++) {\n\t\tfor (int j = 0; j < mat[0].size(); j++) {\n\t\t\tresult[i][j] = mat[i][j] % M;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\n\tif (T == 0) {\n\t\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\t\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\n\t\treturn id;\n\t}\n\n\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\n\n\tif (T % 2 == 0) {\n\t\treturn (mat_half * mat_half) % M;\n\t} else {\n\t\treturn (mat_half * mat_half * mat) % M;\n\t}\n}\n\nint main(void) {\n\twhile (true) {\n\t\tint N, M, A, B, C, T;\n\t\tcin >> N >> M >> A >> B >> C >> T;\n\t\tif (N == 0) break;\n\t\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\n\t\tfor (int i = 0; i < N; i++) cin >> S[i][0];\n\n\t\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (i == j + 1) mat[i][j] = A;\n\t\t\t\telse if (i == j) mat[i][j] = B;\n\t\t\t\telse if (i == j - 1) mat[i][j] = C;\n\t\t\t}\n\t\t}\n\t\tmat = MatPow(mat, T, M);\n\n\t\tS = (mat * S) % M;\n\n\t\tfor (int i = 0; i < N; i++) cout << S[i][0] << \" \\n\"[i == N - 1] << flush;\n\t}\n\n\treturn 0;\n}\n\n/*\n\t\t\t [ B C 0 .. 0 ]\n\t\t\t | A B C .. 0 |\n\tS(t + 1) = | 0 A B .. 0 | * S(t)\n\t\t\t | : : : :: : |\n\t\t\t [ 0 0 0 .. B ]\n*/","accuracy":1,"time_ms":100,"memory_kb":3488,"score_of_the_acc":-0.2394,"final_rank":2},{"submission_id":"aoj_1327_9329172","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\n\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\n\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\n\n\tfor (int i = 0; i < ln; i++) {\n\t\tfor (int j = 0; j < rm; j++) {\n\t\t\tfor (int k = 0; k < lm; k++) {\n\t\t\t\tresult[i][j] += left[i][k] * right[k][j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\n\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\n\tfor (int i = 0; i < mat.size(); i++) {\n\t\tfor (int j = 0; j < mat[0].size(); j++) {\n\t\t\tresult[i][j] = mat[i][j] % M;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\n\tif (T == 0) {\n\t\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\t\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\n\t\treturn id;\n\t} else if (T == 1) {\n\t\treturn mat;\n\t}\n\n\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\n\n\tif (T % 2 == 0) {\n\t\treturn (mat_half * mat_half) % M;\n\t} else {\n\t\treturn (mat_half * mat_half * mat) % M;\n\t}\n}\n\nint main(void) {\n\twhile (true) {\n\t\tint N, M, A, B, C, T;\n\t\tcin >> N >> M >> A >> B >> C >> T;\n\t\tif (N == 0) break;\n\t\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\n\t\tfor (int i = 0; i < N; i++) cin >> S[i][0];\n\n\t\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (i == j + 1) mat[i][j] = A;\n\t\t\t\telse if (i == j) mat[i][j] = B;\n\t\t\t\telse if (i == j - 1) mat[i][j] = C;\n\t\t\t}\n\t\t}\n\t\tmat = MatPow(mat, T, M);\n\n\t\tS = (mat * S) % M;\n\n\t\tfor (int i = 0; i < N; i++) cout << S[i][0] << \" \\n\"[i == N - 1] << flush;\n\t}\n\n\treturn 0;\n}\n\n/*\n\t\t\t [ B C 0 .. 0 ]\n\t\t\t | A B C .. 0 |\n\tS(t + 1) = | 0 A B .. 0 | * S(t)\n\t\t\t | : : : :: : |\n\t\t\t [ 0 0 0 .. B ]\n*/","accuracy":1,"time_ms":90,"memory_kb":3628,"score_of_the_acc":-0.3039,"final_rank":3},{"submission_id":"aoj_1327_9329169","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\n\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\n\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\n\n\tfor (int i = 0; i < ln; i++) {\n\t\tfor (int j = 0; j < rm; j++) {\n\t\t\tfor (int k = 0; k < lm; k++) {\n\t\t\t\tresult[i][j] += left[i][k] * right[k][j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\n\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\n\tfor (int i = 0; i < mat.size(); i++) {\n\t\tfor (int j = 0; j < mat[0].size(); j++) {\n\t\t\tresult[i][j] = mat[i][j] % M;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\n\tif (T == 0) {\n\t\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\t\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\n\t\treturn id;\n\t} else if (T == 1) {\n\t\treturn mat;\n\t}\n\n\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\n\n\tif (T % 2 == 0) {\n\t\treturn (mat_half * mat_half) % M;\n\t} else {\n\t\treturn (((mat_half * mat_half) % M) * mat) % M;\n\t}\n}\n\nint main(void) {\n\twhile (true) {\n\t\tint N, M, A, B, C, T;\n\t\tcin >> N >> M >> A >> B >> C >> T;\n\t\tif (N == 0) break;\n\t\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\n\t\tfor (int i = 0; i < N; i++) cin >> S[i][0];\n\n\t\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (i == j + 1) mat[i][j] = A;\n\t\t\t\telse if (i == j) mat[i][j] = B;\n\t\t\t\telse if (i == j - 1) mat[i][j] = C;\n\t\t\t}\n\t\t}\n\t\tmat = MatPow(mat, T, M);\n\n\t\tS = (mat * S) % M;\n\n\t\tfor (int i = 0; i < N; i++) cout << S[i][0] << \" \\n\"[i == N - 1] << flush;\n\t}\n\n\treturn 0;\n}\n\n/*\n\t\t\t [ B C 0 .. 0 ]\n\t\t\t | A B C .. 0 |\n\tS(t + 1) = | 0 A B .. 0 | * S(t)\n\t\t\t | : : : :: : |\n\t\t\t [ 0 0 0 .. B ]\n*/","accuracy":1,"time_ms":110,"memory_kb":3676,"score_of_the_acc":-0.3356,"final_rank":4},{"submission_id":"aoj_1327_9328974","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\nusing ll = long long;\n\nvector<vector<ll>> MatMul(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\n\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\n\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\n\n\tfor (int i = 0; i < ln; i++) {\n\t\tfor (int j = 0; j < rm; j++) {\n\t\t\tfor (int k = 0; k < lm; k++) {\n\t\t\t\tresult[i][j] += left[i][k] * right[k][j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn result;\n}\n\nvector<vector<ll>> MatMod(const vector<vector<ll>>& mat, int M) {\n\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\n\tfor (int i = 0; i < mat.size(); i++) {\n\t\tfor (int j = 0; j < mat[0].size(); j++) {\n\t\t\tresult[i][j] = mat[i][j] % M;\n\t\t}\n\t}\n\n\treturn result;\n}\n\nclass {\n private:\n\tmap<int, vector<vector<ll>>> memo_;\n\n\tvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\n\t\tif (T == 0) {\n\t\t\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\n\t\t\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\n\t\t\treturn id;\n\t\t} else if (T == 1) {\n\t\t\treturn mat;\n\t\t}\n\n\t\tint T_half = T / 2;\n\t\tvector<vector<ll>> mat_half;\n\n\t\tif (memo_.find(T_half) == memo_.end()) {\n\t\t\tmat_half = this->operator()(mat, T_half, M);\n\t\t\tmemo_[T_half] = mat_half;\n\t\t} else mat_half = memo_[T_half];\n\n\t\tif (T % 2 == 0) {\n\t\t\treturn MatMod(MatMul(mat_half, mat_half), M);\n\t\t} else {\n\t\t\treturn MatMod(MatMul(MatMod(MatMul(mat_half, mat_half), M), mat), M);\n\t\t}\n\t}\n\n public:\n\tvector<vector<ll>> operator()(const vector<vector<ll>>& mat, int T, int M) {\n\t\tmemo_.clear();\n\t\treturn this->MatPow(mat, T, M);\n\t}\n} MatPow;\n\nint main(void) {\n\twhile (true) {\n\t\tint N, M, A, B, C, T;\n\t\tcin >> N >> M >> A >> B >> C >> T;\n\t\tif (N == 0) break;\n\t\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\n\t\tfor (int i = 0; i < N; i++) cin >> S[i][0];\n\n\t\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (i == j + 1) mat[i][j] = A;\n\t\t\t\telse if (i == j) mat[i][j] = B;\n\t\t\t\telse if (i == j - 1) mat[i][j] = C;\n\t\t\t}\n\t\t}\n\t\tmat = MatPow(mat, T, M);\n\n\t\tS = MatMod(MatMul(mat, S), M);\n\n\t\tfor (int i = 0; i < N; i++) cout << S[i][0] << \" \\n\"[i == N - 1] << flush;\n\t}\n\n\treturn 0;\n}\n\n/*\n\t\t\t [ B C 0 .. 0 ]\n\t\t\t | A B C .. 0 |\n\tS(t + 1) = | 0 A B .. 0 | * S(t)\n\t\t\t | : : : :: : |\n\t\t\t [ 0 0 0 .. B ]\n*/","accuracy":1,"time_ms":110,"memory_kb":4132,"score_of_the_acc":-0.5591,"final_rank":12},{"submission_id":"aoj_1327_9003401","code_snippet":"// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = 3.141592653589793;\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\ntemplate<typename T> vc<vc<T>> dot(vc<vc<T>> &A, vc<vc<T>> &B, int M){\n vc<vc<T>> ret;\n for (int i = 0; i < len(A); i++){\n vc<T> row;\n for (int j = 0; j < len(B[0]); j++){\n T ele = 0;\n for (int k = 0; k < len(A[0]); k++){\n ele += A[i][k] * B[k][j];\n ele %= M;\n }\n row.push_back(ele);\n }\n ret.push_back(row);\n }\n return ret;\n}\n\ntemplate<typename T> vc<vc<T>> multidot(vc<vc<T>> &A, ll N, int M){\n vc<vc<T>> ret(len(A), vc<T>(len(A), 0));\n for (int i = 0; i < len(A); i++) ret[i][i] = 1;\n while (N > 0){\n if (N & 1) ret = dot(ret, A, M);\n A = dot(A, A, M);\n N >>= 1;\n }\n return ret;\n}\n\nvi solve(int N, int M, int A, int B, int C, int T){\n vvi S(N, vi(1)); rep(i, N) cin >> S[i][0];\n vvi D(N, vi(N, 0));\n rep(i, N){\n if (i > 0) D[i][i - 1] = A;\n D[i][i] = B;\n if (i < N - 1) D[i][i + 1] = C;\n }\n auto E = multidot(D, T, M);\n auto F = dot(E, S, M);\n vi ans;\n rep(i, N) ans.push_back(F[i][0]);\n return ans;\n}\n\nint main(){\n vc<vi> ans;\n while (true){\n int N, M, A, B, C, T; cin >> N >> M >> A >> B >> C >> T;\n if (N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && T == 0) break;\n ans.push_back(solve(N, M, A, B, C, T));\n }\n for (auto x : ans){\n rep(i, len(x)) cout << x[i] << \" \\n\"[i == len(x) - 1];\n }\n}","accuracy":1,"time_ms":850,"memory_kb":3308,"score_of_the_acc":-0.4573,"final_rank":8},{"submission_id":"aoj_1327_7993117","code_snippet":"#include<stdio.h>\n\nchar space_or_indent[2] = { ' ', '\\n' };\n\nvoid matCopy( long long A[50][50], long long B[50][50], int size )\n{\n for( int i = 0; i < size; i++ )\n {\n for( int j = 0; j < size; j++ )\n {\n A[i][j] = B[i][j];\n }\n }\n}\n\nvoid calMatrix( long long A[50][50], long long B[50][50], long long C[50][50], int size, long long MOD )\n{\n long long sum;\n for( int i = 0; i < size; i++ )\n {\n for( int j = 0; j < size; j++ )\n {\n sum = 0;\n for( int k = 0; k < size; k++ )\n {\n sum = ( sum + A[i][k] * B[k][j] ) % MOD;\n }\n C[i][j] = sum;\n }\n }\n}\n\nvoid calPowMatrix( long long A[50][50], int size, int n, long long MOD )\n{\n long long tmp[50][50], res[50][50], ans[50][50];\n matCopy( res, A, size );\n for( int i = 0; i < size; i++ )\n {\n for( int j = 0; j < size; j++ )\n {\n ans[i][j] = i == j;\n }\n }\n\n for( int bit = 0; ( 1 << bit ) <= n; bit++ )\n {\n if( n & ( 1 << bit ) )\n {\n matCopy( tmp, ans, size );\n calMatrix( tmp, res, ans, size, MOD );\n }\n matCopy( tmp, res, size );\n calMatrix( tmp, tmp, res, size, MOD );\n }\n\n matCopy( A, ans, size );\n}\n\nint main( void )\n{\n long long N, M, A, B, C, T;\n long long S[50] = { 0 };\n long long matrix[50][50];\n while( 1 )\n {\n scanf( \"%lld %lld %lld %lld %lld %lld\", &N, &M, &A, &B, &C, &T );\n if( N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && T == 0 ) break;\n for( int i = 0; i < N; i++ )\n {\n scanf( \"%lld\", &S[i] );\n }\n for( int i = 0; i < N; i++ )\n {\n for( int j = 0; j < N; j++ )\n {\n if( i == j ) matrix[i][j] = B;\n else if( i == j + 1 ) matrix[i][j] = A;\n else if( i + 1 == j ) matrix[i][j] = C;\n else matrix[i][j] = 0;\n }\n }\n\n calPowMatrix( matrix, N, T, M );\n\n long long sum;\n for( int i = 0; i < N; i++ )\n {\n sum = 0;\n for( int j = 0; j < N; j++ )\n {\n sum = ( sum + matrix[i][j] * S[j] ) % M;\n }\n printf( \"%lld%c\", sum, space_or_indent[i == N - 1] );\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":1340,"memory_kb":3008,"score_of_the_acc":-0.5102,"final_rank":10},{"submission_id":"aoj_1327_7954369","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconstexpr int inf = 1 << 30;\nusing Matrix = vector<vector<int>>;\nint mod;\n\nMatrix matmul(const Matrix& lhs, const Matrix& rhs) {\n int n = lhs.size();\n int m = rhs.size();\n int l = (rhs.front()).size();\n Matrix result(n, vector<int>(l));\n for (int i = 0; i < n; i++) {\n for (int k = 0; k < l; k++) {\n for (int j = 0; j < m; j++) {\n result[i][k] += lhs[i][j] * rhs[j][k];\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < l; j++) {\n result[i][j] %= mod;\n }\n }\n return result;\n}\n\nMatrix matpow(Matrix mat, int p) {\n int n = mat.size();\n Matrix result(n, vector<int>(n));\n for (int i = 0; i < n; i++) {\n result[i][i] = 1;\n }\n while (p > 0) {\n if (p & 1) {\n result = matmul(result, mat);\n }\n mat = matmul(mat, mat);\n p >>= 1;\n }\n return result;\n}\n\nbool solve() {\n int n, m, t;\n int a[3];\n cin >> n >> m >> a[0] >> a[1] >> a[2] >> t;\n if (n == 0) return false;\n mod = m;\n Matrix dp(n, std::vector<int>(1));\n for (int i = 0; i < n; i++) {\n cin >> dp[i][0];\n }\n Matrix square(n, std::vector<int>(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < 3; j++) {\n if (i + j - 1 < 0 || i + j - 1 >= n) continue;\n square[i][i + j - 1] = a[j];\n }\n }\n square = matpow(square, t);\n dp = matmul(square, dp);\n for (int i = 0; i < n; i++) {\n cout << dp[i][0];\n if (i < n - 1) cout << ' '; \n }\n cout << '\\n';\n return true;\n}\n\nint main() {\n while (solve());\n}","accuracy":1,"time_ms":110,"memory_kb":3468,"score_of_the_acc":-0.2337,"final_rank":1},{"submission_id":"aoj_1327_7858676","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing Mat = vector<vector<int>>;\n\nint add(int a, int b, int mod) {\n return (a + b) % mod;\n}\n\nint mul(int a, int b, int mod) {\n return (a * b) % mod;\n}\n\nMat mul(Mat A, Mat B, int mod) {\n assert(A.size());\n assert(B.size());\n assert(A[0].size() == B.size());\n Mat res(A.size(), vector(B[0].size(), 0));\n for (int i = 0 ; i < (int)A.size() ; i++) {\n for (int j = 0 ; j < (int)B[0].size() ; j++) {\n for (int k = 0 ; k < (int)A[0].size() ; k++) {\n res[i][j] = add(res[i][j], mul(A[i][k], B[k][j], mod), mod);\n }\n }\n }\n return res;\n}\n\nMat pow(Mat A, int p, int mod) {\n assert(A.size());\n assert(A.size() == A[0].size());\n Mat res(A.size(), vector(A.size(), 0));\n for (int i = 0 ; i < (int)A.size() ; i++) res[i][i] = 1;\n while (p) {\n if (p & 1) {\n res = mul(res, A, mod);\n }\n A = mul(A, A, mod);\n p >>= 1;\n }\n return res;\n}\n\nvoid out(Mat A) {\n for (auto arr : A) {\n for (auto x : arr) cout << x << ' ';\n cout << endl;\n }\n}\n\nbool solve() {\n int N, M, A, B, C, T; cin >> N >> M >> A >> B >> C >> T;\n if (N == 0) return false;\n\n Mat OP(N, vector(N, 0));\n for (int i = 0 ; i < N ; i++) {\n if (i > 0) OP[i][i - 1] = A;\n OP[i][i] = B;\n if (i + 1 < N) OP[i][i + 1] = C;\n }\n\n // out(OP);\n // cout << \"----\" << endl;\n OP = pow(OP, T, M);\n // out(OP);\n\n Mat V(N, vector(1, 0));\n for (int i = 0 ; i < N ; i++) cin >> V[i][0];\n Mat ans = mul(OP, V, M);\n for (int i = 0 ; i < N ; i++) cout << ans[i][0] << (i + 1 == N ? '\\n' : ' ');\n\n return true;\n}\n\n\nint main() {\n while (solve()) ;\n}","accuracy":1,"time_ms":870,"memory_kb":3516,"score_of_the_acc":-0.5674,"final_rank":13},{"submission_id":"aoj_1327_6728644","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N, M, A, B, C, T;\n while(cin >> N >> M >> A >> B >> C >> T, N){\n vector<int> S(N);\n vector<vector<int>> D(N, vector<int>(N)), E(N, vector<int>(N));\n for(int i = 0; i < N; i++){\n cin >> S[i];\n E[i][i] = 1;\n if(i - 1 >= 0)D[i - 1][i] = C;\n D[i][i] = B;\n if(i + 1 < N)D[i + 1][i] = A;\n }\n auto mul = [&](vector<vector<int>> L, vector<vector<int>> R){\n vector<vector<int>> res(N, vector<int>(N));\n for(int i = 0; i < N; i++){\n for(int j = 0; j < N; j++){\n for(int k = 0; k < N; k++){\n (res[i][k] += L[i][j] * R[j][k]) %= M;\n }\n }\n }\n return res;\n };\n while(T){\n if(T & 1)E = mul(E, D);\n D = mul(D, D);\n T /= 2;\n }\n for(int i = 0; i < N; i++){\n int v = 0;\n for(int j = 0; j < N; j++){\n (v += E[i][j] * S[j]) %= M;\n }\n if(i)cout << \" \";\n cout << v;\n }\n cout << '\\n';\n }\n}","accuracy":1,"time_ms":280,"memory_kb":3564,"score_of_the_acc":-0.3501,"final_rank":5},{"submission_id":"aoj_1327_6640694","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\nvector<vector<int>> matmul(vector<vector<int>> A, vector<vector<int>> B, int M) {\n const int n = A.size();\n const int m = B[0].size();\n vector<vector<int>> C(n, vector<int>(m));\n rep(i,0,n) rep(j,0,m) rep(k,0,B.size()) C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;\n return C;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int N, M, A, B, C, T;\n cin >> N >> M >> A >> B >> C >> T;\n if (N == 0) break;\n vector<int> S(N);\n for (auto& x : S) cin >> x;\n\n vector<vector<int>> X(N, vector<int>(N));\n rep(i,0,N) {\n if (i > 0) X[i][i-1] = C;\n X[i][i] = B;\n if (i+1 < N) X[i][i+1] = A;\n }\n vector<vector<int>> ans(1, vector<int>(N));\n rep(i,0,N) ans[0][i] = S[i];\n while (T) {\n if (T & 1) {\n ans = matmul(ans, X, M);\n }\n X = matmul(X, X, M);\n T >>= 1;\n }\n rep(i,0,N) cout << ans[0][i] << (i < N-1 ? \" \" : \"\\n\");\n }\n}","accuracy":1,"time_ms":540,"memory_kb":3384,"score_of_the_acc":-0.368,"final_rank":7},{"submission_id":"aoj_1327_6640598","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\nbool chmax(ll& p, ll q) {\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nbool chmin(ll& p, ll q) {\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll sti(string S) {\n ll res = 0;\n rep(i, S.size()) {\n res += S[i] - '0';\n res *= 10;\n }\n return res / 10;\n}\n\nstring ist(ll n, ll L = -1) {\n string res = \"\";\n if (L >= 0)rep(l, L)res += '0';\n ll p = L - 1;\n if (L != -1)while (n > 0) {\n res[p] = char(n % 10 + '0');\n p--;\n n /= 10;\n }\n else {\n while (n > 0) {\n res.push_back(char(n % 10 + '0'));\n p--;\n n /= 10;\n }\n reverse(all(res));\n }\n return res;\n}\n\nll gcd(ll(a), ll(b)) {\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\nll mod = 998244353;\n\nvector<vector<vector<ll>>> matrixpow;\nvoid prematrixpow(vector<vll> matrix) {\n\tll N = matrix.size();\n\tmatrixpow.assign(70, vector<vll>(N, vll(N)));\n\trep(h, N) {\n\t\trep(w, N) {\n\t\t\tmatrixpow[0][h][w] = matrix[h][w];\n\t\t}\n\t}\n\trep(k, 69) {\n\t\trep(h, N) {\n\t\t\trep(w, N) {\n\t\t\t\tll S = 0;\n\t\t\t\trep(i, N) {\n\t\t\t\t\tS += matrixpow[k][h][i] * matrixpow[k][i][w];\n\t\t\t\t\tS %= mod;\n\t\t\t\t}\n\t\t\t\tmatrixpow[k + 1][h][w] = S;\n\t\t\t}\n\t\t}\n\t}\n\n}\nvector<vll> modmatrixpow(ll K) {\n\tll P = K;\n\tll N = matrixpow[0].size();\n\tvector<vll> res(N, vll(N, 0));\n\trep(i, N) {\n\t\tres[i][i] = 1;\n\t}\n\n\trep(j, 70) {\n\t\tif (P % 2 != 0) {\n\t\t\tvector<vll> res2(N, vll(N, 0));\n\n\t\t\trep(h, N) {\n\t\t\t\trep(w, N) {\n\t\t\t\t\tll S = 0;\n\t\t\t\t\trep(i, N) {\n\t\t\t\t\t\tS += matrixpow[j][h][i] * res[i][w];\n\t\t\t\t\t\tS %= mod;\n\t\t\t\t\t}\n\t\t\t\t\tres2[h][w] = S;\n\t\t\t\t}\n\t\t\t}\n\t\t\tres = res2;\n\t\t}\n\t\tP /= 2;\n\t}\n\n\treturn res;\n\n\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while(1){\n ll N,M,A,B,C,T;\n cin>>N>>M>>A>>B>>C>>T;\n if(N==0)return 0;\n vll D(N);\n rep(i,N)cin>>D[i];\n mod=M;\n vvll F(N,vll(N));\n rep(i,N){\n F[i][i]=B;\n if(i!=0){\n F[i-1][i]=C; \n F[i][i-1]=A;\n } \n }\n prematrixpow(F);\n auto k=modmatrixpow(T);\n vll AN(N,0);\n rep(i,N){\n rep(j,N){\n AN[i]+=k[i][j]*D[j];\n AN[i]%=M;\n }\n cout<<AN[i]<<(i==N-1?\"\\n\":\" \");\n }\n\n\n }\n\n}","accuracy":1,"time_ms":2540,"memory_kb":4780,"score_of_the_acc":-1.8686,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_1327_11043071\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<ll, 2>;\\nusing a3 = array<ll, 3>;\\n\\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\\n\\nll mod = 998244353;\\nconst ll INF = 1e18;\\n\\nifstream in;\\nofstream out;\\n\\nint main(int argc, char** argv) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n if(argc > 2) {\\n in.open(argv[1]);\\n cin.rdbuf(in.rdbuf());\\n out.open(argv[2]);\\n cout.rdbuf(out.rdbuf());\\n }\\n\\n while(1) {\\n ll n, m, a, b, c, t;\\n cin >> n >> m >> a >> b >> c >> t;\\n if(n == 0) break;\\n vector<ll> s(n);\\n for(auto& x : s) cin >> x;\\n\\n vector<vector<vector<ll>>> mat(31, vector(n, vector<ll>(n, 0)));\\n for(int i = 0; i < n; i++) {\\n if(i) mat[0][i][i - 1] = a;\\n mat[0][i][i] = b;\\n if(i + 1 < n) mat[0][i][i + 1] = c;\\n }\\n\\n auto mul = [&](vector<vector<ll>>& l, vector<vector<ll>>& r) {\\n vector<vector<ll>> res(n, vector<ll>(n, 0));\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n for(int k = 0; k < n; k++) {\\n res[i][j] += l[i][k] * r[k][j];\\n res[i][j] %= m;\\n }\\n }\\n }\\n return res;\\n };\\n\\n for(int i = 1; i <= 30; i++) {\\n mat[i] = mul(mat[i - 1], mat[i - 1]);\\n }\\n\\n vector<vector<ll>> p(n, vector<ll>(n, 0));\\n for(int i = 0; i < n; i++) {\\n p[i][i] = 1;\\n }\\n\\n for(int i = 0; i <= 30; i++) {\\n if((1 << i) & t) {\\n p = mul(p, mat[i]);\\n }\\n }\\n\\n for(int i = 0; i < n; i++) {\\n ll ans = 0;\\n for(int j = 0; j < n; j++) {\\n ans += p[i][j] * s[j];\\n ans %= m;\\n }\\n cout << ans << \\\" \\\\n\\\"[i == n - 1];\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -0.8262,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1327_10885517\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\nvvi mul(vvi &a,vvi &b,int mod){\\n assert(sz(a));assert(sz(b));\\n assert(sz(a[0]) == sz(b));\\n int n = sz(a),m = sz(b[0]);\\n vvi res(n,vi(m));\\n rep(i,0,n)rep(j,0,m)rep(k,0,sz(a[0])){\\n (res[i][j] += a[i][k]*b[k][j]%mod)%= mod;\\n }\\n return res;\\n}\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n ll n,m,T;\\n vi coef(3);\\n cin >> n >> m >> coef >> T;\\n if(!n)break;\\n vvi a(n,vi(1));cin >> a;\\n vvi mat(n,vi(n));\\n rep(i,0,n)rep(j,-1,2){\\n int ni = i + j;\\n if(ni < 0 || ni >= n)continue;\\n mat[ni][i] = coef[1-j];\\n }\\n while(T){\\n if(T & 1)a = mul(mat,a,m);\\n T >>= 1;\\n mat = mul(mat,mat,m);\\n }\\n rep(i,0,n)cout << a[i][0] << \\\" \\\\n\\\"[i+1 == n];\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1240,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.7008,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1327_10851061\",\n \"code_snippet\": \"#include<iostream>\\n#include<stdio.h>\\n#include<cstring>\\nusing namespace std;\\nconst int MAX = 55;\\nint M;\\n\\n\\nstruct Matrix\\n{\\n int v[MAX][MAX];\\n};\\n\\nint n,k; //分别代表的是每个置换的长度\\n//置换的一组的个数\\n//以及一共置换的操作\\n\\nMatrix mtAdd(Matrix A, Matrix B) // 求矩阵 A + B\\n{\\n int i, j;\\n Matrix C;\\n for(i = 0; i < n; i ++)\\n for(j = 0; j < n; j ++)\\n C.v[i][j]=(A.v[i][j]+B.v[i][j])%M;\\n return C;\\n}\\n\\nMatrix mtMul(Matrix A, Matrix B) // 求矩阵 A * B\\n{\\n int i, j, k;\\n Matrix C;\\n for(i = 0; i < n; i ++)\\n for(j = 0; j < n; j ++)\\n {\\n C.v[i][j] = 0;\\n for(k = 0; k < n; k ++)\\n C.v[i][j] = (A.v[i][k] * B.v[k][j] + C.v[i][j])%M;\\n }\\n return C;\\n}\\n\\nMatrix mtPow(Matrix A, int k) // 求矩阵 A ^ k\\n{\\n if(k == 0)\\n {\\n memset(A.v, 0, sizeof(A.v));\\n for(int i = 0; i < n; i ++)\\n A.v[i][i] = 1;\\n return A;\\n }\\n if(k == 1) return A;\\n Matrix C = mtPow(A, k / 2);\\n if(k % 2 == 0)\\n return mtMul(C, C);\\n else\\n return mtMul(mtMul(C, C), A);\\n}\\n\\nvoid out(Matrix A)\\n{\\n for(int i=0; i<n; i++)\\n {\\n for(int j=0; j<n; j++)\\n cout<<A.v[i][j]<<\\\" \\\";\\n cout<<endl;\\n }\\n cout<<endl;\\n}\\n\\nint main ()\\n{\\n int A,B,C,T;\\n Matrix NUM;\\n while(~scanf(\\\"%d%d%d%d%d%d\\\",&n,&M,&A,&B,&C,&T)){\\n if(n==0) break;\\n for(int i=0;i<n;i++){\\n scanf(\\\"%d\\\",&NUM.v[i][0]);\\n }\\n//out(NUM);\\n Matrix yun;\\n for(int i=0;i<n;i++){\\n if(i-1>=0) yun.v[i][i-1]=A;\\n yun.v[i][i]=B;\\n if(i-1<n) yun.v[i][i+1]=C;\\n }\\n//out(yun);\\n Matrix ans = mtPow(yun,T);\\n//out(ans);\\n NUM=mtMul(ans,NUM);\\n//out(NUM);\\n for(int i=0;i<n-1;i++) printf(\\\"%d \\\",NUM.v[i][0]);\\n printf(\\\"%d\\\\n\\\",NUM.v[n-1][0]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 5048,\n \"score_of_the_acc\": -1.2816,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1327_10684193\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint n,m,p,a,b,c,T,w[55];\\nstruct st{\\n\\tint v[55][55];\\n}k[55],ans;\\nint read(){\\n\\tint f=1,ans=0;\\n\\tchar x=getchar();\\n\\twhile(x<'0'||x>'9'){\\n\\t\\tif(x=='-'){\\n\\t\\t\\tf=-1;\\n\\t\\t}\\n\\t\\tx=getchar();\\n\\t}\\n\\twhile(x>='0'&&x<='9'){\\n\\t\\tans=ans*10+x-'0';\\n\\t\\tx=getchar();\\n\\t}\\n\\treturn ans*f;\\n}\\nvoid write(int x){\\n\\tchar c[10005]={};\\n\\tint i=0;\\n\\tif(x==0){\\n\\t\\tputchar('0');\\n\\t}\\n\\tif(x<0){\\n\\t\\tputchar('-');\\n\\t\\tx*=-1;\\n\\t}\\n\\twhile(x){\\n\\t\\tc[++i]=x%10;\\n\\t\\tx/=10;\\n\\t}\\n\\twhile(i){\\n\\t\\tputchar(c[i]+'0');\\n\\t\\ti--;\\n\\t}\\n\\tputchar(' ');\\n}\\nvoid gmnb(int x,int y,int z,st &u,int a[55][55],int b[55][55],int mod){\\n\\tint k1[55][55]={};\\n\\tfor(int i=1;i<=x;i++){\\n\\t\\tfor(int j=1;j<=z;j++){\\n\\t\\t\\tfor(int l=1;l<=y;l++){\\n\\t\\t\\t\\tk1[i][j]=k1[i][j]+a[i][l]*b[l][j];\\n\\t\\t\\t\\tk1[i][j]%=mod;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=1;i<=x;i++){\\n\\t\\tfor(int j=1;j<=z;j++){\\n\\t\\t\\tu.v[i][j]=k1[i][j];\\n\\t\\t}\\n\\t}\\n}\\nvoid lfnb(int x,int y,int mod){\\n\\tint cnt=1,r[55][55]={},q=1;\\n\\tbool f[55]={};\\n\\twhile(q<=x){\\n\\t\\tq*=2;\\n\\t\\tcnt++;\\n\\t\\tgmnb(y,y,y,k[cnt],k[cnt-1].v,k[cnt-1].v,mod);\\n\\t}\\n\\tint cnt1=cnt;\\n\\twhile(cnt--){\\n\\t\\tif(x>=q){\\n\\t\\t\\tx-=q;\\n\\t\\t\\tf[cnt+1]=1;\\n\\t\\t}\\n\\t\\tq/=2;\\n\\t}\\n\\tfor(int i=1;i<cnt1;i++){\\n\\t\\tif(f[i]){\\n\\t\\t\\tgmnb(y,y,y,ans,ans.v,k[i].v,mod);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tn=read(),m=read(),a=read(),b=read(),c=read(),T=read();\\n\\t\\tif(n==0&&m==0&&a==0&&b==0&&c==0&&T==0){\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tfor(int i=1;i<=n;i++){\\n\\t\\t\\tfor(int j=1;j<=n;j++){\\n\\t\\t\\t\\tif(i==j+1){\\n\\t\\t\\t\\t\\tk[1].v[i][j]=c;\\n\\t\\t\\t\\t\\tans.v[i][j]=0;\\n\\t\\t\\t\\t}else if(i+1==j){\\n\\t\\t\\t\\t\\tk[1].v[i][j]=a;\\n\\t\\t\\t\\t\\tans.v[i][j]=0;\\n\\t\\t\\t\\t}else if(i==j){\\n\\t\\t\\t\\t\\tk[1].v[i][j]=b;\\n\\t\\t\\t\\t\\tans.v[i][j]=1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tk[1].v[i][j]=0;\\n\\t\\t\\t\\t\\tans.v[i][j]=0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tw[i]=read();\\n\\t\\t}\\n\\t\\tlfnb(T,n,m);\\n\\t\\tfor(int i=1;i<=n;i++){\\n\\t\\t\\tint h=0;\\n\\t\\t\\tfor(int j=1;j<=n;j++){\\n\\t\\t\\t\\th+=w[j]*ans.v[j][i];\\n\\t\\t\\t\\th%=m;\\n\\t\\t\\t}\\n if (i == n) {printf(\\\"%lld\\\", h % m); continue;}\\n\\t\\t\\twrite(h%m);\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.5349,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1327_10684188\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#define ll long long\\nusing namespace std;\\n#define MAXN 60\\n\\nint n , m , a , b , c , t;\\nstruct Matrix{\\n\\tll data[MAXN][MAXN];\\n\\tint heng , zong;\\n\\tvoid kind3(){\\n\\t\\theng = zong = n;\\n\\t\\tfor( int i = 1 ; i < MAXN ; i++ )\\n\\t\\t\\tfor( int j = 1 ; j < MAXN ; j++ )\\n\\t\\t\\t\\tdata[i][j] = 0;\\n\\t}\\n\\tvoid kind4(){\\n\\t\\tkind3();\\n\\t\\tfor( int i = 1 ; i <= n ; i++ )\\n\\t\\t\\tdata[i][i] = 1;\\n\\t}\\n\\t\\n\\tvoid kind2(){\\n\\t\\tkind3();\\n\\t\\theng = zong = n;\\n\\t\\tfor( int i = 1 ; i <= n ; i++ ){\\n\\t\\t\\tif(i>1) data[i][i-1] = a;\\n\\t\\t\\tdata[i][i] = b;\\n\\t\\t\\tif(i<n) data[i][i+1] = c;\\n\\t\\t}\\n\\t}\\n\\tvoid print(){\\n\\t\\tcout << \\\"[Martix] \\\" << heng << \\\" \\\" << zong << endl;\\n\\t\\tfor( int i = 1 ; i <= zong ; i++ ){\\n\\t\\t\\tfor( int j = 1 ; j <= heng ; j++ )\\n\\t\\t\\t\\tcout << data[i][j] << \\\" \\\";\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n};\\nMatrix get0(){\\n\\tMatrix m1;\\n\\tm1.kind3();\\n\\treturn m1;\\n}\\nMatrix get1(){\\n\\tMatrix m1;\\n\\tm1.kind4();\\n\\treturn m1;\\n}\\nMatrix operator*( Matrix m1 , Matrix m2 ){\\n\\tMatrix m3; m3.kind3();\\n\\tfor( int i = 1 ; i <= n ; i++ )\\n\\t\\tfor( int j = 1 ; j <= m2.heng ; j++ ){\\n\\t\\t\\tm3.data[i][j] = 0;\\n\\t\\t\\tfor( int k = 1 ; k <= n ; k++ ){\\n\\t\\t\\t\\tm3.data[i][j] += m1.data[i][k] * m2.data[k][j];\\n\\t\\t\\t\\tm3.data[i][j] %= m;\\n\\t\\t\\t}\\n\\t\\t}\\n\\treturn m3;\\n}\\nMatrix pow( Matrix a , int b ){\\n\\tMatrix ret; ret = get1();\\n\\tMatrix now; now = a;\\n\\twhile( b ){\\n\\t\\tif( b & 1 ) ret = ret * now;\\n\\t\\tnow = now * now;\\n \\tb = b >> 1;\\n\\t}\\n\\treturn ret;\\n}\\n/*\\nBC\\n ABC\\n ABC\\n ...\\n AB\\n*/\\nint main(){\\n\\t//freopen(\\\"C.txt\\\",\\\"r\\\",stdin);\\n\\tbool fir = 1;\\n\\twhile( 1 ){\\n\\t\\tscanf(\\\"%d %d %d %d %d %d\\\",&n,&m,&a,&b,&c,&t);\\n\\t\\tif( !fir ){\\n\\t\\t\\tputchar('\\\\n');\\n\\t\\t}else fir = 0;\\n\\t\\tif( n == 0 ) return 0;\\n\\t\\t//cout << n << \\\" \\\" << m << \\\" \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\" \\\" << t << endl;\\n\\t\\tMatrix A; A.kind2();\\n\\t\\tMatrix B; B.kind3(); B.heng = 1; B.zong = n;\\n\\t\\tMatrix C; C.kind3();\\n\\t\\tfor( int i = 1 ; i <= n ; i++ ){\\n\\t\\t\\tscanf(\\\"%lld\\\",&B.data[i][1]);\\n\\t\\t}\\n\\t\\t//B.print();\\n\\t\\t//Matrix AA = A;\\n\\t\\t//A.print();\\n\\t\\tA = pow(A,t);\\n\\t\\t//A.print();\\n\\t\\t//AA = AA*AA;\\n\\t\\t//AA.print();\\n\\t\\t//cout << \\\"[Main] \\\\\\\"^\\\\\\\" Done\\\" << endl;\\n\\t\\tC = A*B;\\n\\t\\tfor( int i = 1 ; i < n ; i++ )\\n\\t\\t\\tprintf(\\\"%lld \\\",C.data[i][1]%m);\\n\\t\\tprintf(\\\"%lld\\\",C.data[n][1]%m);\\n\\t\\t//return 0;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1360,\n \"memory_kb\": 3932,\n \"score_of_the_acc\": -0.9713,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1327_10179895\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nstatic int64_t MOD = 998244353L;\\n\\nconst int MAX_N = 50;\\nstatic int64_t X0[MAX_N];\\n//------------------------------------------------------------------------------\\ntypedef vector<vector<int64_t> > MAT;\\ntypedef vector<int64_t> VEC;\\n\\n//------------------------------------------------------------------------------\\nclass Matrix\\n{\\n public:\\n int N;\\n MAT data;\\n\\n Matrix(int size): N(size)\\n {\\n data.resize(N);\\n for (int i=0; i<N; ++i) data[i].resize(N);\\n for (int i=0; i<N; i++) for (int j=0; j<N; j++) data[i][j] = 0;\\n }\\n\\n Matrix(const MAT& values): N(values.size()), data(values)\\n {\\n \\n }\\n\\n static Matrix identity(int size)\\n {\\n MAT values(size, vector<int64_t>(size, 0));\\n for (int i=0; i<size; ++i) values[i][i] = 1L;\\n return Matrix(values);\\n }\\n\\n static Matrix zero(int size)\\n {\\n MAT values(size, vector<int64_t>(size, 0L));\\n return Matrix(values);\\n }\\n\\n Matrix operator*(const Matrix& M1) const\\n {\\n Matrix R(N);\\n for (int i=0; i<N; i++)\\n for (int j=0; j<N; j++)\\n for (int k=0; k<N; k++)\\n {\\n R.data[i][j] += data[i][k] * M1.data[k][j];\\n if (R.data[i][j] >= MOD) R.data[i][j] %= MOD;\\n }\\n return R;\\n\\n }\\n\\n VEC operator*(const VEC& X) const\\n {\\n VEC Y(N, 0); //<----------\\n for (int i=0; i<N; i++)\\n for (int j=0; j<N; j++)\\n {\\n Y[i] += data[i][j] * X[j];\\n if (Y[i] >= MOD) Y[i] %= MOD;\\n }\\n return Y;\\n }\\n\\n static\\n Matrix power(Matrix& A, int64_t x)\\n {\\n int N = A.N;\\n Matrix R = identity(N);\\n //int iterations = 3;\\n //while (x > 0 && iterations--)\\n while (x > 0)\\n {\\n if (x%2 == 1) R = R * A;\\n A = A * A;\\n x /= 2;\\n }\\n\\n\\n\\n return R;\\n }\\n\\n\\n void debug()\\n {\\n for (int i=0; i<N; i++)\\n {\\n for (int j=0; j<N; j++) printf(\\\"%ld \\\",data[i][j]); printf(\\\"\\\\n\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n};\\n\\n//------------------------------------------------------------------------------\\nvoid vec_debug(const VEC& v)\\n{\\n int N = v.size();\\n for (int i=0; i<N; ++i)\\n {\\n printf(\\\"%ld\\\", v[i]);\\n if (i < N-1) printf(\\\" \\\");\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid solve(int N, int64_t M, int64_t A, int64_t B, int64_t C, int64_t K)\\n{\\n MOD = M;\\n\\n VEC x(N);\\n for (int i=0; i<N; ++i) x[i] = X0[i];\\n if (K == 0)\\n {\\n vec_debug(x);\\n return;\\n }\\n\\n MAT data(N, VEC(N, 0));\\n for (int m=0; m<N; ++m)\\n {\\n if (m-1 >= 0) data[m][m-1] = A;\\n data[m][m] = B;\\n if (m+1 < N) data[m][m+1] = C;\\n }\\n Matrix Mat1(data);\\n Matrix Mat2 = Matrix::power(Mat1, K);\\n VEC y = Mat2*x;\\n vec_debug(y);\\n}\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n}\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //DEBUG = true;\\n //test(); return 0;\\n //--------------------------------------------------------------------------\\n int N, num;\\n int64_t M, A, B, C, K;\\n while (true)\\n {\\n num = scanf(\\\"%d %ld %ld %ld %ld %ld \\\", &N, &M, &A, &B, &C, &K);\\n if (N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && K == 0) break;\\n\\n for (int i=0; i<N; ++i)\\n {\\n num = scanf(\\\"%ld \\\", &X0[i]);\\n //if (X0[i] >= MOD) X0[i] %= MOD;\\n }\\n\\n solve(N, M, A, B, C, K);\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.5865,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1327_9597887\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nll N, M, A, B, C, T;\\n\\nvector<vector<ll>> Mul(vector<vector<ll>>& X, vector<vector<ll>>& Y) {\\n int n = X.size(), m = X[0].size(), l = Y[0].size();\\n vector<vector<ll>> Z(n,vector<ll>(l,0));\\n rep(i,0,n) {\\n rep(j,0,m) {\\n rep(k,0,l) {\\n Z[i][k] += X[i][j] * Y[j][k];\\n Z[i][k] %= M;\\n }\\n }\\n }\\n return Z;\\n}\\n\\nvector<vector<ll>> Pow(vector<vector<ll>>& X, ll K) {\\n int n = X.size();\\n if (K == 0) {\\n vector<vector<ll>> Z(n,vector<ll>(n,0));\\n rep(i,0,n) Z[i][i] = 1 % M;\\n return Z;\\n }\\n if (K % 2 == 0) {\\n vector<vector<ll>> Z = Pow(X,K/2);\\n return Mul(Z,Z);\\n }\\n vector<vector<ll>> Z = Pow(X,K-1);\\n return Mul(Z,X);\\n}\\n\\nint main() {\\nwhile(1) {\\n cin >> N >> M >> A >> B >> C >> T;\\n if (N == 0) return 0;\\n vector<vector<ll>> F(N,vector<ll>(N,0)), G(N,vector<ll>(1));\\n rep(i,0,N) cin >> G[i][0];\\n rep(i,0,N) {\\n rep(j,-1,2) {\\n if (0 <= i+j && i+j < N) {\\n if (j==-1) F[i][i+j] = A;\\n if (j==0) F[i][i+j] = B;\\n if (j==1) F[i][i+j] = C;\\n }\\n }\\n }\\n F = Pow(F,T);\\n G = Mul(F,G);\\n rep(i,0,N) cout << G[i][0] << (i==N-1 ? '\\\\n' : ' ');\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.5048,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1327_9532418\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nstruct SetupIO {\\n SetupIO() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout << fixed << setprecision(30);\\n }\\n} setup_io;\\nstruct Barrett {\\n explicit Barrett(unsigned int m)\\n : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n inline unsigned int umod() const {\\n return _m;\\n }\\n inline unsigned int mul(unsigned int a, unsigned int b) const {\\n unsigned long long z = a;\\n z *= b;\\n unsigned long long x = (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n unsigned int v = (unsigned int)(z - x * _m);\\n if(_m <= v) v += _m;\\n return v;\\n }\\n\\n private:\\n unsigned int _m;\\n unsigned long long im;\\n};\\ntemplate <int id>\\nstruct DynamicModint {\\n using mint = DynamicModint;\\n static int mod() {\\n return (int)bt.umod();\\n }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = Barrett(m);\\n }\\n static mint raw(int v) {\\n mint a;\\n a._v = v;\\n return a;\\n }\\n DynamicModint()\\n : _v(0) {}\\n template <class T>\\n DynamicModint(const T& v) {\\n static_assert(is_integral_v<T>);\\n if(is_signed_v<T>) {\\n long long x = (long long)(v % (long long)(umod()));\\n if(x < 0) x += umod();\\n _v = (unsigned int)(x);\\n } else _v = (unsigned int)(v % umod());\\n }\\n unsigned int val() const {\\n return _v;\\n }\\n mint& operator++() {\\n ++_v;\\n if(_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if(_v == 0) _v = umod();\\n --_v;\\n return *this;\\n }\\n mint operator++(int) {\\n mint res = *this;\\n ++*this;\\n return res;\\n }\\n mint operator--(int) {\\n mint res = *this;\\n --*this;\\n return res;\\n }\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if(_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if(_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) {\\n return *this *= rhs.inv();\\n }\\n mint operator+() const {\\n return *this;\\n }\\n mint operator-() const {\\n return mint() - *this;\\n }\\n mint pow(long long n) const {\\n assert(0 <= n);\\n if(n == 0) return 1;\\n mint x = *this, r = 1;\\n while(1) {\\n if(n & 1) r *= x;\\n n >>= 1;\\n if(n == 0) return r;\\n x *= x;\\n }\\n }\\n mint inv() const {\\n auto eg = inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n friend istream& operator>>(istream& in, mint& x) {\\n long long a;\\n in >> a;\\n x = a;\\n return in;\\n }\\n friend ostream& operator<<(ostream& out, const mint& x) {\\n return out << x.val();\\n }\\n\\n private:\\n unsigned int _v = 0;\\n static Barrett bt;\\n inline static unsigned int umod() {\\n return bt.umod();\\n }\\n inline static pair<long long, long long> inv_gcd(long long a, long long b) {\\n if(a == 0) return {b, 0};\\n long long s = b, t = a, m0 = 0, m1 = 1;\\n while(t) {\\n const long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u;\\n swap(s, t);\\n swap(m0, m1);\\n }\\n if(m0 < 0) m0 += b / s;\\n return {s, m0};\\n }\\n};\\ntemplate <int id>\\nBarrett DynamicModint<id>::bt(998244353);\\nusing modint = DynamicModint<-1>;\\nusing mint = modint;\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(int h, int w, T val = 0)\\n : h(h), w(w), A(h, vector<T>(w, val)) {}\\n int H() const {\\n return h;\\n }\\n int W() const {\\n return w;\\n }\\n const vector<T>& operator[](int i) const {\\n assert(0 <= i and i < h);\\n return A[i];\\n }\\n vector<T>& operator[](int i) {\\n assert(0 <= i and i < h);\\n return A[i];\\n }\\n static Matrix I(int n) {\\n Matrix mat(n, n);\\n for(int i = 0; i < n; ++i) mat[i][i] = 1;\\n return mat;\\n }\\n Matrix& operator+=(const Matrix& B) {\\n assert(h == B.h and w == B.w);\\n for(int i = 0; i < h; ++i) {\\n for(int j = 0; j < w; ++j) {\\n (*this)[i][j] += B[i][j];\\n }\\n }\\n return (*this);\\n }\\n Matrix& operator-=(const Matrix& B) {\\n assert(h == B.h and w == B.w);\\n for(int i = 0; i < h; ++i) {\\n for(int j = 0; j < w; ++j) {\\n (*this)[i][j] -= B[i][j];\\n }\\n }\\n return (*this);\\n }\\n Matrix& operator*=(const Matrix& B) {\\n assert(w == B.h);\\n vector<vector<T>> C(h, vector<T>(B.w, 0));\\n for(int i = 0; i < h; ++i) {\\n for(int k = 0; k < w; ++k) {\\n for(int j = 0; j < B.w; ++j) {\\n C[i][j] += (*this)[i][k] * B[k][j];\\n }\\n }\\n }\\n A.swap(C);\\n return (*this);\\n }\\n Matrix& pow(long long t) {\\n assert(h == w);\\n assert(t >= 0);\\n Matrix B = Matrix::I(h);\\n while(t > 0) {\\n if(t & 1ll) B *= (*this);\\n (*this) *= (*this);\\n t >>= 1ll;\\n }\\n A.swap(B.A);\\n return (*this);\\n }\\n Matrix operator+(const Matrix& B) const {\\n return (Matrix(*this) += B);\\n }\\n Matrix operator-(const Matrix& B) const {\\n return (Matrix(*this) -= B);\\n }\\n Matrix operator*(const Matrix& B) const {\\n return (Matrix(*this) *= B);\\n }\\n bool operator==(const Matrix& B) const {\\n assert(h == B.H() and w == B.W());\\n for(int i = 0; i < h; ++i) {\\n for(int j = 0; j < w; ++j) {\\n if(A[i][j] != B[i][j]) return false;\\n }\\n }\\n return true;\\n }\\n bool operator!=(const Matrix& B) const {\\n assert(h == B.H() and w == B.W());\\n for(int i = 0; i < h; ++i) {\\n for(int j = 0; j < w; ++j) {\\n if(A[i][j] != B[i][j]) return true;\\n }\\n }\\n return false;\\n }\\n\\n private:\\n int h, w;\\n vector<vector<T>> A;\\n};\\nint main(void) {\\n while(true) {\\n ll n, m, a, b, c, t;\\n cin >> n >> m >> a >> b >> c >> t;\\n if(n == 0) break;\\n mint::set_mod(m);\\n Matrix<mint> vec(n, 1);\\n rep(i, 0, n) {\\n cin >> vec[i][0];\\n }\\n Matrix<mint> mat(n, n);\\n rep(i, 0, n) {\\n if(i > 0) mat[i][i - 1] = a;\\n mat[i][i] = b;\\n if(i < n - 1) mat[i][i + 1] = c;\\n }\\n vec = mat.pow(t) * vec;\\n rep(i, 0, n) {\\n cout << vec[i][0] << \\\" \\\\n\\\"[i + 1 == n];\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.3553,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1327_9377609\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define pb push_back\\n#define mk make_pair\\n#define S second\\n#define F first\\nint M;\\nvector<vector<int>> mul(vector<vector<int>> a, vector<vector<int>> b){\\n\\t int n = a.size();\\n\\t int m = b[0].size();\\n\\t vector<vector<int>> ans(n, vector<int>(m, 0));\\n\\t for(int i = 0; i<n; i++){\\n\\t \\t for(int j = 0; j<m; j++){\\n\\t \\t \\t int sum = 0;\\n\\t \\t \\t for(int k = 0; k<a[0].size(); k++){\\n\\t \\t \\t \\t sum += a[i][k]*b[k][j]%M;\\n\\t \\t \\t \\t sum %= M;\\n\\t\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t\\t ans[i][j] = sum;\\n\\t\\t\\t\\t }\\n\\t\\t }\\n\\t\\t return ans;\\n}\\nvector<vector<int>> exp(vector<vector<int>> a, int n, vector<vector<int>> unit){\\n\\t auto ans = unit;\\n\\t auto x = a;\\n\\t if(n == 0) return unit;\\n\\t while(n > 0){\\n\\t \\t if(n %2 == 1) ans = mul(x, ans);\\n\\t \\t x = mul(x, x);\\n\\t \\t n/=2;\\n\\t }\\n\\t return ans;\\n}\\nvoid solve(int n, int m, int a, int b, int c, int t){\\n\\t\\n\\tM = m;\\n\\tint arr[n+5];\\n\\tfor(int i = 0; i<n; i++) cin >> arr[i];\\n\\tvector<vector<int>> mt(n, vector<int>(n, 0));\\n for(int i = 0; i<n; i++){\\n \\t mt[i][i] = b;\\n \\t if(i!=0) mt[i][i-1] = a;\\n \\t if(i!=n-1) mt[i][i+1] = c;\\n\\t}\\n\\tvector<vector<int>> unit(n, vector<int>(n, 0));\\n\\tfor(int i = 0; i<n; i++) unit[i][i] = 1;\\n\\tvector<vector<int>> init(n, vector<int>(1, 0));\\n\\tfor(int i = 0; i<n; i++) init[i][0] = arr[i];\\n\\tauto big = exp(mt, t, unit);\\n\\tauto ans = mul(big, init);\\n\\tfor(int i = 0; i<n; i++) {\\n\\t\\tif(i < n-1) cout << ans[i][0] << \\\" \\\";\\n\\t\\telse cout << ans[i][0];\\n\\t}\\n\\t\\n}\\nint main(){\\n\\t\\n while(true){\\n \\t int n, m, a, b, c, t;\\n\\tcin >> n >> m >> a >> b >> c >> t;\\n\\t if(n == 0 && m == 0 && a == 0 && b == 0 && c == 0 && t == 0) break;\\n\\t solve(n, m, a, b, c, t);\\n\\t cout << '\\\\n';\\n\\t } \\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3668,\n \"score_of_the_acc\": -0.6337,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1327_9329181\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_set>\\n#include <vector>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\\n\\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\\n\\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\\n\\n\\tfor (int i = 0; i < ln; i++) {\\n\\t\\tfor (int j = 0; j < rm; j++) {\\n\\t\\t\\tfor (int k = 0; k < lm; k++) {\\n\\t\\t\\t\\tresult[i][j] += left[i][k] * right[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\\n\\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\n\\tfor (int i = 0; i < mat.size(); i++) {\\n\\t\\tfor (int j = 0; j < mat[0].size(); j++) {\\n\\t\\t\\tresult[i][j] = mat[i][j] % M;\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\\n\\tif (T == 0) {\\n\\t\\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\t\\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\\n\\t\\treturn id;\\n\\t}\\n\\n\\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\\n\\n\\tif (T % 2 == 0) {\\n\\t\\treturn (mat_half * mat_half) % M;\\n\\t} else {\\n\\t\\treturn (mat_half * mat_half * mat) % M;\\n\\t}\\n}\\n\\nint main(void) {\\n\\twhile (true) {\\n\\t\\tint N, M, A, B, C, T;\\n\\t\\tcin >> N >> M >> A >> B >> C >> T;\\n\\t\\tif (N == 0) break;\\n\\t\\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) cin >> S[i][0];\\n\\n\\t\\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (i == j + 1) mat[i][j] = A;\\n\\t\\t\\t\\telse if (i == j) mat[i][j] = B;\\n\\t\\t\\t\\telse if (i == j - 1) mat[i][j] = C;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = MatPow(mat, T, M);\\n\\n\\t\\tS = (mat * S) % M;\\n\\n\\t\\tfor (int i = 0; i < N; i++) cout << S[i][0] << \\\" \\\\n\\\"[i == N - 1] << flush;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/*\\n\\t\\t\\t [ B C 0 .. 0 ]\\n\\t\\t\\t | A B C .. 0 |\\n\\tS(t + 1) = | 0 A B .. 0 | * S(t)\\n\\t\\t\\t | : : : :: : |\\n\\t\\t\\t [ 0 0 0 .. B ]\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.2394,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1327_9329172\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_set>\\n#include <vector>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\\n\\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\\n\\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\\n\\n\\tfor (int i = 0; i < ln; i++) {\\n\\t\\tfor (int j = 0; j < rm; j++) {\\n\\t\\t\\tfor (int k = 0; k < lm; k++) {\\n\\t\\t\\t\\tresult[i][j] += left[i][k] * right[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\\n\\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\n\\tfor (int i = 0; i < mat.size(); i++) {\\n\\t\\tfor (int j = 0; j < mat[0].size(); j++) {\\n\\t\\t\\tresult[i][j] = mat[i][j] % M;\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\\n\\tif (T == 0) {\\n\\t\\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\t\\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\\n\\t\\treturn id;\\n\\t} else if (T == 1) {\\n\\t\\treturn mat;\\n\\t}\\n\\n\\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\\n\\n\\tif (T % 2 == 0) {\\n\\t\\treturn (mat_half * mat_half) % M;\\n\\t} else {\\n\\t\\treturn (mat_half * mat_half * mat) % M;\\n\\t}\\n}\\n\\nint main(void) {\\n\\twhile (true) {\\n\\t\\tint N, M, A, B, C, T;\\n\\t\\tcin >> N >> M >> A >> B >> C >> T;\\n\\t\\tif (N == 0) break;\\n\\t\\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) cin >> S[i][0];\\n\\n\\t\\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (i == j + 1) mat[i][j] = A;\\n\\t\\t\\t\\telse if (i == j) mat[i][j] = B;\\n\\t\\t\\t\\telse if (i == j - 1) mat[i][j] = C;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = MatPow(mat, T, M);\\n\\n\\t\\tS = (mat * S) % M;\\n\\n\\t\\tfor (int i = 0; i < N; i++) cout << S[i][0] << \\\" \\\\n\\\"[i == N - 1] << flush;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/*\\n\\t\\t\\t [ B C 0 .. 0 ]\\n\\t\\t\\t | A B C .. 0 |\\n\\tS(t + 1) = | 0 A B .. 0 | * S(t)\\n\\t\\t\\t | : : : :: : |\\n\\t\\t\\t [ 0 0 0 .. B ]\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.3039,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1327_9329169\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_set>\\n#include <vector>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nvector<vector<ll>> operator*(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\\n\\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\\n\\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\\n\\n\\tfor (int i = 0; i < ln; i++) {\\n\\t\\tfor (int j = 0; j < rm; j++) {\\n\\t\\t\\tfor (int k = 0; k < lm; k++) {\\n\\t\\t\\t\\tresult[i][j] += left[i][k] * right[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> operator%(const vector<vector<ll>>& mat, int M) {\\n\\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\n\\tfor (int i = 0; i < mat.size(); i++) {\\n\\t\\tfor (int j = 0; j < mat[0].size(); j++) {\\n\\t\\t\\tresult[i][j] = mat[i][j] % M;\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\\n\\tif (T == 0) {\\n\\t\\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\t\\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\\n\\t\\treturn id;\\n\\t} else if (T == 1) {\\n\\t\\treturn mat;\\n\\t}\\n\\n\\tvector<vector<ll>> mat_half = MatPow(mat, T / 2, M);\\n\\n\\tif (T % 2 == 0) {\\n\\t\\treturn (mat_half * mat_half) % M;\\n\\t} else {\\n\\t\\treturn (((mat_half * mat_half) % M) * mat) % M;\\n\\t}\\n}\\n\\nint main(void) {\\n\\twhile (true) {\\n\\t\\tint N, M, A, B, C, T;\\n\\t\\tcin >> N >> M >> A >> B >> C >> T;\\n\\t\\tif (N == 0) break;\\n\\t\\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) cin >> S[i][0];\\n\\n\\t\\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (i == j + 1) mat[i][j] = A;\\n\\t\\t\\t\\telse if (i == j) mat[i][j] = B;\\n\\t\\t\\t\\telse if (i == j - 1) mat[i][j] = C;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = MatPow(mat, T, M);\\n\\n\\t\\tS = (mat * S) % M;\\n\\n\\t\\tfor (int i = 0; i < N; i++) cout << S[i][0] << \\\" \\\\n\\\"[i == N - 1] << flush;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/*\\n\\t\\t\\t [ B C 0 .. 0 ]\\n\\t\\t\\t | A B C .. 0 |\\n\\tS(t + 1) = | 0 A B .. 0 | * S(t)\\n\\t\\t\\t | : : : :: : |\\n\\t\\t\\t [ 0 0 0 .. B ]\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.3356,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1327_9328974\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_set>\\n#include <vector>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nvector<vector<ll>> MatMul(const vector<vector<ll>>& left, const vector<vector<ll>>& right) {\\n\\tint ln = left.size(), lm = left[0].size(), rm = right[0].size();\\n\\tvector<vector<ll>> result(ln, vector<ll>(rm, 0ll));\\n\\n\\tfor (int i = 0; i < ln; i++) {\\n\\t\\tfor (int j = 0; j < rm; j++) {\\n\\t\\t\\tfor (int k = 0; k < lm; k++) {\\n\\t\\t\\t\\tresult[i][j] += left[i][k] * right[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nvector<vector<ll>> MatMod(const vector<vector<ll>>& mat, int M) {\\n\\tvector<vector<ll>> result(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\n\\tfor (int i = 0; i < mat.size(); i++) {\\n\\t\\tfor (int j = 0; j < mat[0].size(); j++) {\\n\\t\\t\\tresult[i][j] = mat[i][j] % M;\\n\\t\\t}\\n\\t}\\n\\n\\treturn result;\\n}\\n\\nclass {\\n private:\\n\\tmap<int, vector<vector<ll>>> memo_;\\n\\n\\tvector<vector<ll>> MatPow(const vector<vector<ll>>& mat, int T, int M) {\\n\\t\\tif (T == 0) {\\n\\t\\t\\tvector<vector<ll>> id(mat.size(), vector<ll>(mat[0].size(), 0ll));\\n\\t\\t\\tfor (int k = 0; k < id.size(); k++) id[k][k] = 1;\\n\\t\\t\\treturn id;\\n\\t\\t} else if (T == 1) {\\n\\t\\t\\treturn mat;\\n\\t\\t}\\n\\n\\t\\tint T_half = T / 2;\\n\\t\\tvector<vector<ll>> mat_half;\\n\\n\\t\\tif (memo_.find(T_half) == memo_.end()) {\\n\\t\\t\\tmat_half = this->operator()(mat, T_half, M);\\n\\t\\t\\tmemo_[T_half] = mat_half;\\n\\t\\t} else mat_half = memo_[T_half];\\n\\n\\t\\tif (T % 2 == 0) {\\n\\t\\t\\treturn MatMod(MatMul(mat_half, mat_half), M);\\n\\t\\t} else {\\n\\t\\t\\treturn MatMod(MatMul(MatMod(MatMul(mat_half, mat_half), M), mat), M);\\n\\t\\t}\\n\\t}\\n\\n public:\\n\\tvector<vector<ll>> operator()(const vector<vector<ll>>& mat, int T, int M) {\\n\\t\\tmemo_.clear();\\n\\t\\treturn this->MatPow(mat, T, M);\\n\\t}\\n} MatPow;\\n\\nint main(void) {\\n\\twhile (true) {\\n\\t\\tint N, M, A, B, C, T;\\n\\t\\tcin >> N >> M >> A >> B >> C >> T;\\n\\t\\tif (N == 0) break;\\n\\t\\tvector<vector<ll>> S(N, vector<ll>(1, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) cin >> S[i][0];\\n\\n\\t\\tvector<vector<ll>> mat(N, vector<ll>(N, 0ll));\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (i == j + 1) mat[i][j] = A;\\n\\t\\t\\t\\telse if (i == j) mat[i][j] = B;\\n\\t\\t\\t\\telse if (i == j - 1) mat[i][j] = C;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = MatPow(mat, T, M);\\n\\n\\t\\tS = MatMod(MatMul(mat, S), M);\\n\\n\\t\\tfor (int i = 0; i < N; i++) cout << S[i][0] << \\\" \\\\n\\\"[i == N - 1] << flush;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/*\\n\\t\\t\\t [ B C 0 .. 0 ]\\n\\t\\t\\t | A B C .. 0 |\\n\\tS(t + 1) = | 0 A B .. 0 | * S(t)\\n\\t\\t\\t | : : : :: : |\\n\\t\\t\\t [ 0 0 0 .. B ]\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4132,\n \"score_of_the_acc\": -0.5591,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1327_9003401\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = 3.141592653589793;\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\ntemplate<typename T> vc<vc<T>> dot(vc<vc<T>> &A, vc<vc<T>> &B, int M){\\n vc<vc<T>> ret;\\n for (int i = 0; i < len(A); i++){\\n vc<T> row;\\n for (int j = 0; j < len(B[0]); j++){\\n T ele = 0;\\n for (int k = 0; k < len(A[0]); k++){\\n ele += A[i][k] * B[k][j];\\n ele %= M;\\n }\\n row.push_back(ele);\\n }\\n ret.push_back(row);\\n }\\n return ret;\\n}\\n\\ntemplate<typename T> vc<vc<T>> multidot(vc<vc<T>> &A, ll N, int M){\\n vc<vc<T>> ret(len(A), vc<T>(len(A), 0));\\n for (int i = 0; i < len(A); i++) ret[i][i] = 1;\\n while (N > 0){\\n if (N & 1) ret = dot(ret, A, M);\\n A = dot(A, A, M);\\n N >>= 1;\\n }\\n return ret;\\n}\\n\\nvi solve(int N, int M, int A, int B, int C, int T){\\n vvi S(N, vi(1)); rep(i, N) cin >> S[i][0];\\n vvi D(N, vi(N, 0));\\n rep(i, N){\\n if (i > 0) D[i][i - 1] = A;\\n D[i][i] = B;\\n if (i < N - 1) D[i][i + 1] = C;\\n }\\n auto E = multidot(D, T, M);\\n auto F = dot(E, S, M);\\n vi ans;\\n rep(i, N) ans.push_back(F[i][0]);\\n return ans;\\n}\\n\\nint main(){\\n vc<vi> ans;\\n while (true){\\n int N, M, A, B, C, T; cin >> N >> M >> A >> B >> C >> T;\\n if (N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && T == 0) break;\\n ans.push_back(solve(N, M, A, B, C, T));\\n }\\n for (auto x : ans){\\n rep(i, len(x)) cout << x[i] << \\\" \\\\n\\\"[i == len(x) - 1];\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.4573,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1327_7993117\",\n \"code_snippet\": \"#include<stdio.h>\\n\\nchar space_or_indent[2] = { ' ', '\\\\n' };\\n\\nvoid matCopy( long long A[50][50], long long B[50][50], int size )\\n{\\n for( int i = 0; i < size; i++ )\\n {\\n for( int j = 0; j < size; j++ )\\n {\\n A[i][j] = B[i][j];\\n }\\n }\\n}\\n\\nvoid calMatrix( long long A[50][50], long long B[50][50], long long C[50][50], int size, long long MOD )\\n{\\n long long sum;\\n for( int i = 0; i < size; i++ )\\n {\\n for( int j = 0; j < size; j++ )\\n {\\n sum = 0;\\n for( int k = 0; k < size; k++ )\\n {\\n sum = ( sum + A[i][k] * B[k][j] ) % MOD;\\n }\\n C[i][j] = sum;\\n }\\n }\\n}\\n\\nvoid calPowMatrix( long long A[50][50], int size, int n, long long MOD )\\n{\\n long long tmp[50][50], res[50][50], ans[50][50];\\n matCopy( res, A, size );\\n for( int i = 0; i < size; i++ )\\n {\\n for( int j = 0; j < size; j++ )\\n {\\n ans[i][j] = i == j;\\n }\\n }\\n\\n for( int bit = 0; ( 1 << bit ) <= n; bit++ )\\n {\\n if( n & ( 1 << bit ) )\\n {\\n matCopy( tmp, ans, size );\\n calMatrix( tmp, res, ans, size, MOD );\\n }\\n matCopy( tmp, res, size );\\n calMatrix( tmp, tmp, res, size, MOD );\\n }\\n\\n matCopy( A, ans, size );\\n}\\n\\nint main( void )\\n{\\n long long N, M, A, B, C, T;\\n long long S[50] = { 0 };\\n long long matrix[50][50];\\n while( 1 )\\n {\\n scanf( \\\"%lld %lld %lld %lld %lld %lld\\\", &N, &M, &A, &B, &C, &T );\\n if( N == 0 && M == 0 && A == 0 && B == 0 && C == 0 && T == 0 ) break;\\n for( int i = 0; i < N; i++ )\\n {\\n scanf( \\\"%lld\\\", &S[i] );\\n }\\n for( int i = 0; i < N; i++ )\\n {\\n for( int j = 0; j < N; j++ )\\n {\\n if( i == j ) matrix[i][j] = B;\\n else if( i == j + 1 ) matrix[i][j] = A;\\n else if( i + 1 == j ) matrix[i][j] = C;\\n else matrix[i][j] = 0;\\n }\\n }\\n\\n calPowMatrix( matrix, N, T, M );\\n\\n long long sum;\\n for( int i = 0; i < N; i++ )\\n {\\n sum = 0;\\n for( int j = 0; j < N; j++ )\\n {\\n sum = ( sum + matrix[i][j] * S[j] ) % M;\\n }\\n printf( \\\"%lld%c\\\", sum, space_or_indent[i == N - 1] );\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1340,\n \"memory_kb\": 3008,\n \"score_of_the_acc\": -0.5102,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1327_7954369\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconstexpr int inf = 1 << 30;\\nusing Matrix = vector<vector<int>>;\\nint mod;\\n\\nMatrix matmul(const Matrix& lhs, const Matrix& rhs) {\\n int n = lhs.size();\\n int m = rhs.size();\\n int l = (rhs.front()).size();\\n Matrix result(n, vector<int>(l));\\n for (int i = 0; i < n; i++) {\\n for (int k = 0; k < l; k++) {\\n for (int j = 0; j < m; j++) {\\n result[i][k] += lhs[i][j] * rhs[j][k];\\n }\\n }\\n }\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < l; j++) {\\n result[i][j] %= mod;\\n }\\n }\\n return result;\\n}\\n\\nMatrix matpow(Matrix mat, int p) {\\n int n = mat.size();\\n Matrix result(n, vector<int>(n));\\n for (int i = 0; i < n; i++) {\\n result[i][i] = 1;\\n }\\n while (p > 0) {\\n if (p & 1) {\\n result = matmul(result, mat);\\n }\\n mat = matmul(mat, mat);\\n p >>= 1;\\n }\\n return result;\\n}\\n\\nbool solve() {\\n int n, m, t;\\n int a[3];\\n cin >> n >> m >> a[0] >> a[1] >> a[2] >> t;\\n if (n == 0) return false;\\n mod = m;\\n Matrix dp(n, std::vector<int>(1));\\n for (int i = 0; i < n; i++) {\\n cin >> dp[i][0];\\n }\\n Matrix square(n, std::vector<int>(n));\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < 3; j++) {\\n if (i + j - 1 < 0 || i + j - 1 >= n) continue;\\n square[i][i + j - 1] = a[j];\\n }\\n }\\n square = matpow(square, t);\\n dp = matmul(square, dp);\\n for (int i = 0; i < n; i++) {\\n cout << dp[i][0];\\n if (i < n - 1) cout << ' '; \\n }\\n cout << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.2337,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1327_7858676\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing Mat = vector<vector<int>>;\\n\\nint add(int a, int b, int mod) {\\n return (a + b) % mod;\\n}\\n\\nint mul(int a, int b, int mod) {\\n return (a * b) % mod;\\n}\\n\\nMat mul(Mat A, Mat B, int mod) {\\n assert(A.size());\\n assert(B.size());\\n assert(A[0].size() == B.size());\\n Mat res(A.size(), vector(B[0].size(), 0));\\n for (int i = 0 ; i < (int)A.size() ; i++) {\\n for (int j = 0 ; j < (int)B[0].size() ; j++) {\\n for (int k = 0 ; k < (int)A[0].size() ; k++) {\\n res[i][j] = add(res[i][j], mul(A[i][k], B[k][j], mod), mod);\\n }\\n }\\n }\\n return res;\\n}\\n\\nMat pow(Mat A, int p, int mod) {\\n assert(A.size());\\n assert(A.size() == A[0].size());\\n Mat res(A.size(), vector(A.size(), 0));\\n for (int i = 0 ; i < (int)A.size() ; i++) res[i][i] = 1;\\n while (p) {\\n if (p & 1) {\\n res = mul(res, A, mod);\\n }\\n A = mul(A, A, mod);\\n p >>= 1;\\n }\\n return res;\\n}\\n\\nvoid out(Mat A) {\\n for (auto arr : A) {\\n for (auto x : arr) cout << x << ' ';\\n cout << endl;\\n }\\n}\\n\\nbool solve() {\\n int N, M, A, B, C, T; cin >> N >> M >> A >> B >> C >> T;\\n if (N == 0) return false;\\n\\n Mat OP(N, vector(N, 0));\\n for (int i = 0 ; i < N ; i++) {\\n if (i > 0) OP[i][i - 1] = A;\\n OP[i][i] = B;\\n if (i + 1 < N) OP[i][i + 1] = C;\\n }\\n\\n // out(OP);\\n // cout << \\\"----\\\" << endl;\\n OP = pow(OP, T, M);\\n // out(OP);\\n\\n Mat V(N, vector(1, 0));\\n for (int i = 0 ; i < N ; i++) cin >> V[i][0];\\n Mat ans = mul(OP, V, M);\\n for (int i = 0 ; i < N ; i++) cout << ans[i][0] << (i + 1 == N ? '\\\\n' : ' ');\\n\\n return true;\\n}\\n\\n\\nint main() {\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.5674,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1327_6728644\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int N, M, A, B, C, T;\\n while(cin >> N >> M >> A >> B >> C >> T, N){\\n vector<int> S(N);\\n vector<vector<int>> D(N, vector<int>(N)), E(N, vector<int>(N));\\n for(int i = 0; i < N; i++){\\n cin >> S[i];\\n E[i][i] = 1;\\n if(i - 1 >= 0)D[i - 1][i] = C;\\n D[i][i] = B;\\n if(i + 1 < N)D[i + 1][i] = A;\\n }\\n auto mul = [&](vector<vector<int>> L, vector<vector<int>> R){\\n vector<vector<int>> res(N, vector<int>(N));\\n for(int i = 0; i < N; i++){\\n for(int j = 0; j < N; j++){\\n for(int k = 0; k < N; k++){\\n (res[i][k] += L[i][j] * R[j][k]) %= M;\\n }\\n }\\n }\\n return res;\\n };\\n while(T){\\n if(T & 1)E = mul(E, D);\\n D = mul(D, D);\\n T /= 2;\\n }\\n for(int i = 0; i < N; i++){\\n int v = 0;\\n for(int j = 0; j < N; j++){\\n (v += E[i][j] * S[j]) %= M;\\n }\\n if(i)cout << \\\" \\\";\\n cout << v;\\n }\\n cout << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.3501,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1327_6640694\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\nvector<vector<int>> matmul(vector<vector<int>> A, vector<vector<int>> B, int M) {\\n const int n = A.size();\\n const int m = B[0].size();\\n vector<vector<int>> C(n, vector<int>(m));\\n rep(i,0,n) rep(j,0,m) rep(k,0,B.size()) C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % M;\\n return C;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int N, M, A, B, C, T;\\n cin >> N >> M >> A >> B >> C >> T;\\n if (N == 0) break;\\n vector<int> S(N);\\n for (auto& x : S) cin >> x;\\n\\n vector<vector<int>> X(N, vector<int>(N));\\n rep(i,0,N) {\\n if (i > 0) X[i][i-1] = C;\\n X[i][i] = B;\\n if (i+1 < N) X[i][i+1] = A;\\n }\\n vector<vector<int>> ans(1, vector<int>(N));\\n rep(i,0,N) ans[0][i] = S[i];\\n while (T) {\\n if (T & 1) {\\n ans = matmul(ans, X, M);\\n }\\n X = matmul(X, X, M);\\n T >>= 1;\\n }\\n rep(i,0,N) cout << ans[0][i] << (i < N-1 ? \\\" \\\" : \\\"\\\\n\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.368,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1327_6640598\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\nbool chmax(ll& p, ll q) {\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nbool chmin(ll& p, ll q) {\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll sti(string S) {\\n ll res = 0;\\n rep(i, S.size()) {\\n res += S[i] - '0';\\n res *= 10;\\n }\\n return res / 10;\\n}\\n\\nstring ist(ll n, ll L = -1) {\\n string res = \\\"\\\";\\n if (L >= 0)rep(l, L)res += '0';\\n ll p = L - 1;\\n if (L != -1)while (n > 0) {\\n res[p] = char(n % 10 + '0');\\n p--;\\n n /= 10;\\n }\\n else {\\n while (n > 0) {\\n res.push_back(char(n % 10 + '0'));\\n p--;\\n n /= 10;\\n }\\n reverse(all(res));\\n }\\n return res;\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\n\\nll mod = 998244353;\\n\\nvector<vector<vector<ll>>> matrixpow;\\nvoid prematrixpow(vector<vll> matrix) {\\n\\tll N = matrix.size();\\n\\tmatrixpow.assign(70, vector<vll>(N, vll(N)));\\n\\trep(h, N) {\\n\\t\\trep(w, N) {\\n\\t\\t\\tmatrixpow[0][h][w] = matrix[h][w];\\n\\t\\t}\\n\\t}\\n\\trep(k, 69) {\\n\\t\\trep(h, N) {\\n\\t\\t\\trep(w, N) {\\n\\t\\t\\t\\tll S = 0;\\n\\t\\t\\t\\trep(i, N) {\\n\\t\\t\\t\\t\\tS += matrixpow[k][h][i] * matrixpow[k][i][w];\\n\\t\\t\\t\\t\\tS %= mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmatrixpow[k + 1][h][w] = S;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n}\\nvector<vll> modmatrixpow(ll K) {\\n\\tll P = K;\\n\\tll N = matrixpow[0].size();\\n\\tvector<vll> res(N, vll(N, 0));\\n\\trep(i, N) {\\n\\t\\tres[i][i] = 1;\\n\\t}\\n\\n\\trep(j, 70) {\\n\\t\\tif (P % 2 != 0) {\\n\\t\\t\\tvector<vll> res2(N, vll(N, 0));\\n\\n\\t\\t\\trep(h, N) {\\n\\t\\t\\t\\trep(w, N) {\\n\\t\\t\\t\\t\\tll S = 0;\\n\\t\\t\\t\\t\\trep(i, N) {\\n\\t\\t\\t\\t\\t\\tS += matrixpow[j][h][i] * res[i][w];\\n\\t\\t\\t\\t\\t\\tS %= mod;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tres2[h][w] = S;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tres = res2;\\n\\t\\t}\\n\\t\\tP /= 2;\\n\\t}\\n\\n\\treturn res;\\n\\n\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n while(1){\\n ll N,M,A,B,C,T;\\n cin>>N>>M>>A>>B>>C>>T;\\n if(N==0)return 0;\\n vll D(N);\\n rep(i,N)cin>>D[i];\\n mod=M;\\n vvll F(N,vll(N));\\n rep(i,N){\\n F[i][i]=B;\\n if(i!=0){\\n F[i-1][i]=C; \\n F[i][i-1]=A;\\n } \\n }\\n prematrixpow(F);\\n auto k=modmatrixpow(T);\\n vll AN(N,0);\\n rep(i,N){\\n rep(j,N){\\n AN[i]+=k[i][j]*D[j];\\n AN[i]%=M;\\n }\\n cout<<AN[i]<<(i==N-1?\\\"\\\\n\\\":\\\" \\\");\\n }\\n\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2540,\n \"memory_kb\": 4780,\n \"score_of_the_acc\": -1.8686,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":778,"cells":{"group_id":{"kind":"string","value":"aoj_1328_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nFind the Outlier\nProfessor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function\nf\n(\nx\n) =\nx\n2\n+ 2\nx\n+ 1, for instance, a possible expected calculation result is 1 (=\nf\n(0)), 4 (=\nf\n(1)), 9 (=\nf\n(2)), 16 (=\nf\n(3)), and 25 (=\nf\n(4)).\nIt is a pity, however, the engine seemingly has faulty components and exactly one value among those calculated simultaneously is always wrong. With the same polynomial function as above, it can, for instance, output 1, 4, 12, 16, and 25 instead of 1, 4, 9, 16, and 25.\nYou are requested to help the professor identify the faulty components. As the first step, you should write a program that scans calculation results of the engine and finds the wrong values.\nInput\nThe input is a sequence of datasets, each representing a calculation result in the following format.\nd\nv\n0\nv\n1\n...\nv\nd\n+2\nHere,\nd\nin the first line is a positive integer that represents the degree of the polynomial, namely, the highest exponent of the variable. For instance, the degree of 4\nx\n5\n+ 3\nx\n+ 0.5 is five and that of 2.4\nx\n+ 3.8 is one.\nd\nis at most five.\nThe following\nd\n+ 3 lines contain the calculation result of\nf\n(0),\nf\n(1), ... , and\nf\n(\nd\n+ 2) in this order, where\nf\nis the polynomial function. Each of the lines contains a decimal fraction between -100.0 and 100.0, exclusive.\nYou can assume that the wrong value, which is exactly one of\nf\n(0),\nf\n(1), ... , and\nf\n(\nd\n+2), has an error greater than 1.0. Since rounding errors are inevitable, the other values may also have errors but they are small and never exceed 10\n-6\n.\nThe end of the input is indicated by a line containing a zero.\nOutput\nFor each dataset, output\ni\nin a line when\nv\ni\nis wrong.\nSample Input\n2\n1.0\n4.0\n12.0\n16.0\n25.0\n1\n-30.5893962764\n5.76397083962\n39.3853798058\n74.3727663177\n4\n42.4715310246\n79.5420238202\n28.0282396675\n-30.3627807522\n-49.8363481393\n-25.5101480106\n7.58575761381\n5\n-21.9161699038\n-48.469304271\n-24.3188578417\n-2.35085940324\n-9.70239202086\n-47.2709510623\n-93.5066246072\n-82.5073836498\n0\nOutput for the Sample Input\n2\n1\n1\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1328_10496662","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint d;\ndouble a[1003][1004];\ndouble k[20005];\nbool solve(){\n//\tfor(int i=1;i<=d+3;i++){\n\t////\tfor(int j=1;j<=d+2;j++){\n\t//\t\tcout<<a[i][j]<<\" \";\n\t//\t}\n\t//\tcout<<endl;\n\t//}\n\tint n=d+1,m=d+2;\n\t\n\t/*for(int i=1;i<=n;i++){\n\t\tint maxx=i;\n\t\tfor(int j=i+1;j<=n;j++){\n\t\t\tif(fabs(a[j][i])>fabs(a[maxx][i])){\n\t\t\t\tmaxx=j;\n\t\t\t}\n\t\t}\n\t\tif(fabs(a[maxx][i])>1e-4) swap(a[i],a[maxx]);\n\t\telse continue;\n\t\tfor(int j=n+1;j>=i;j--) a[i][j]/=a[i][i]; \n\t\tfor(int j=1;j<=n+1;j++){\n\t\t\tif(j==i) continue;\n\t\t\tfor(int k=n+1;k>=i;k--){\n\t\t\t\ta[j][k]-=a[j][i]*a[i][k];\n\t\t\t}\n\t\t}\n\t}*/\n\tint line=1;\n\tfor(int i=1;i<=n;i++){\n\t\tint id=line;\n\t\tfor(int j=id+1;j<=m;j++){\n\t\t\tif(fabs(a[j][i])>fabs(a[id][i])){\n\t\t\t\tid=j;\n\t\t\t}\n\t\t}\n\t\tif(fabs(a[id][i])>1e-10) swap(a[line],a[id]);\n\t\telse continue;\n\t\tfor(int j=n+1;j>=i;j--) a[line][j]/=a[line][i];\n\t\tfor(int j=1;j<=m;j++){\n\t\t\tif(line==j){\n\t\t\t\tcontinue;\n\t\t\t} \n\t\t\tfor(int k=n+1;k>=i;k--) a[j][k]-=a[j][i]*a[line][k];\n\t\t}\n\t\tline++;\n\t}\n//\tcout<<\"x: \"<<\"\\n\";\n//\tfor(int i=1;i<=d+3;i++){\n//\t\tfor(int j=1;j<=d+2;j++){\n//\t\t\tcout<<a[i][j]<<\" \";\n//\t\t}\n//\t\tcout<<endl;\n//\t}\n//\tcout<<a[d+2][d+2]<<endl;\n\tfor(int i=line;i<=m;i++) {\n\t\tif(fabs(a[i][n+1])>1e-5){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n\n}\nint power(int c,int b){\n\tint res=1;\n\twhile(b){\n\t\tif(b&1){\n\t\t\tres=res*c;\n\t\t}\n\t\tc=c*c;\n\t\tb>>=1;\n\t}\n\treturn res;\n}\nsigned main(){\n\twhile(cin>>d){\n\t\tif(!d) break;\n\t\telse{\n\t\t\t\n\t\t\tfor(int i=1;i<=d+3;i++){\n\t\t\t\tcin>>k[i];\n\t\t\t\t//cin>>a[i][d+2];\n\t\t\t\tfor(int j=1;j<=d;j++) a[i][j]=i;\n\t\t\t}\n\t\t\tfor(int i=1;i<=d+3;i++){\n\t\t\t\tfor(int j=1;j<=d+3;j++){\n\t\t\t\t\tfor(int p=1;p<=d+2;p++) a[j][p]=(p==d+2)?k[j]:power(j-1,d+1-p);\n\t\t\t\t}\n\t\t\t\tfor(int j=i;j<=d+2;j++) swap(a[j],a[j+1]);\n\t\t\t//cout<<\"x \"<<i<<endl;\n\t\t\t\tif(solve()){\n\t\t\t\t\tcout<<i-1<<endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n/*\n2\n1.0\n4.0\n12.0\n16.0\n25.0\n1\n-30.5893962764\n5.76397083962\n39.3853798058\n74.3727663177\n4\n42.4715310246\n79.5420238202\n28.0282396675\n-30.3627807522\n-49.8363481393\n-25.5101480106\n7.58575761381\n5\n-21.9161699038\n-48.469304271\n-24.3188578417\n-2.35085940324\n-9.70239202086\n-47.2709510623\n-93.5066246072\n-82.5073836498\n0\n\n*/","accuracy":1,"time_ms":10,"memory_kb":3488,"score_of_the_acc":-0.4358,"final_rank":15},{"submission_id":"aoj_1328_10036047","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <typename T>\nstruct mat {\n\tint n, m;\n\tvector<vector<T>> a;\n\tmat(int n_, int m_) : n(n_), m(m_), a(n_, vector<T>(m_)) {}\n};\ntemplate <typename T>\nvector<T> solveLSE(mat<T> a, vector<T> b) { // ax=b\n\tassert(a.n == b.size() && a.m == b.size());\n\tint n = a.n;\n\tfor (int i = 0; i < n; i++) {\n\t\tint p = i;\n\t\tfor (int j = p; j < n; j++) {\n\t\t\tif (a.a[i][j] > a.a[i][p]) p = j;\n\t\t}\n\t\tswap(a.a[i], a.a[p]);\n\t\tswap(b[i], b[p]);\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (j != i) a.a[i][j] /= a.a[i][i];\n\t\t}\n\t\tb[i] /= a.a[i][i];\n\t\ta.a[i][i] = 1;\n\t\tfor (int k = 0; k < n; k++) {\n\t\t\tif (i == k) continue;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (j != i) a.a[k][j] -= a.a[i][j] * a.a[k][i];\n\t\t\t}\n\t\t\tb[k] -= b[i] * a.a[k][i];\n\t\t\ta.a[k][i] = 0;\n\t\t}\n\t}\n\treturn b;\n}\nint main() {\n\tmt19937 mt(time(NULL));\n\twhile (1) {\n\t\tint d;\n\t\tcin >> d;\n\t\tif (d == 0) break;\n\t\tuniform_int_distribution<int> rd(0, d + 2);\n\t\tvector<double> v(d + 3);\n\t\tfor (int i = 0; i < d + 3; i++) {\n\t\t\tcin >> v[i];\n\t\t}\n\t\tint ans = -1;\n\t\tdouble bestscore = 1e100;\n\t\tfor (int igni = 0; igni < d + 3; igni++) {\n\t\t\tmat<double> a(d + 1, d + 1);\n\t\t\tvector<int> idx;\n\t\t\tfor (int i = 0; i < d + 3; i++) {\n\t\t\t\tif (i == igni) continue;\n\t\t\t\tidx.push_back(i);\n\t\t\t}\n\t\t\tshuffle(idx.begin(), idx.end(), mt);\n\t\t\tidx.pop_back();\n\t\t\tvector<double> b(d + 1);\n\t\t\t{\n\t\t\t\tint i = 0;\n\t\t\t\tfor (int ri : idx) {\n\t\t\t\t\tfor (int j = 0; j < d + 1; j++) {\n\t\t\t\t\t\ta.a[i][j] = pow(ri, j);\n\t\t\t\t\t}\n\t\t\t\t\tb[i] = v[ri];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tauto res = solveLSE(a, b);\n\t\t\tassert(res.size() == d + 1);\n\t\t\tauto f = [&](int x) {\n\t\t\t\tdouble r = 0;\n\t\t\t\tfor (int j = 0; j <= d; j++) {\n\t\t\t\t\tr += res[j] * pow(x, j);\n\t\t\t\t}\n\t\t\t\treturn r;\n\t\t\t};\n\t\t\tdouble igerror = 0, nomerror = 0;\n\t\t\tfor (int i = 0; i < d + 3; i++) {\n\t\t\t\tif (i == igni) {\n\t\t\t\t\tigerror += abs(f(i) - v[i]);\n\t\t\t\t} else {\n\t\t\t\t\tnomerror += abs(f(i) - v[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble score = nomerror / igerror;\n\t\t\tif (bestscore > score) {\n\t\t\t\t// for (int i = 0; i < d + 1; i++) {\n\t\t\t\t// \tcerr << res[i] << \" \";\n\t\t\t\t// }\n\t\t\t\t// cerr << endl;\n\t\t\t\tbestscore = score;\n\t\t\t\tans = igni;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3900,"score_of_the_acc":-0.9083,"final_rank":17},{"submission_id":"aoj_1328_8740978","code_snippet":"//\n// 実数行列 (行列累乗と、掃き出し法)\n//\n// verified:\n// AOJ 2171 Strange Couple\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2171\n//\n// AOJ 1328 Find the Outlier\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1328\n//\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n// basic settings\nlong double EPS = 1e-10; // to be set appropriately\n\n// matrix\ntemplate<class T> struct Matrix {\n // inner value\n vector<vector<T>> val;\n \n // constructors\n Matrix(int H, int W, T x = 0) : val(H, vector<T>(W, x)) {}\n Matrix(const Matrix &mat) : val(mat.val) {}\n void init(int H, int W, T x = 0) {\n val.assign(H, vector<T>(W, x));\n }\n void resize(int H, int W) {\n val.resize(H);\n for (int i = 0; i < H; ++i) val[i].resize(W);\n }\n \n // getter and debugger\n constexpr int height() const { return (int)val.size(); }\n constexpr int width() const { return (int)val[0].size(); }\n vector<T>& operator [] (int i) { return val[i]; }\n constexpr vector<T>& operator [] (int i) const { return val[i]; }\n friend constexpr ostream& operator << (ostream &os, const Matrix<T> &mat) {\n os << endl;\n for (int i = 0; i < mat.height(); ++i) {\n for (int j = 0; j < mat.width(); ++j) {\n if (j) os << \", \";\n os << mat.val[i][j];\n }\n os << endl;\n }\n return os;\n }\n \n // comparison operators\n constexpr bool operator == (const Matrix &r) const {\n return this->val == r.val;\n }\n constexpr bool operator != (const Matrix &r) const {\n return this->val != r.val;\n }\n \n // arithmetic operators\n constexpr Matrix& operator += (const Matrix &r) {\n assert(height() == r.height());\n assert(width() == r.width());\n for (int i = 0; i < height(); ++i) {\n for (int j = 0; j < width(); ++j) {\n val[i][j] += r[i][j];\n }\n }\n return *this;\n }\n constexpr Matrix& operator -= (const Matrix &r) {\n assert(height() == r.height());\n assert(width() == r.width());\n for (int i = 0; i < height(); ++i) {\n for (int j = 0; j < width(); ++j) {\n val[i][j] -= r[i][j];\n }\n }\n return *this;\n }\n constexpr Matrix& operator *= (T v) {\n for (int i = 0; i < height(); ++i)\n for (int j = 0; j < width(); ++j)\n val[i][j] *= v;\n return *this;\n }\n constexpr Matrix& operator *= (const Matrix &r) {\n assert(width() == r.height());\n Matrix<T> res(height(), r.width());\n for (int i = 0; i < height(); ++i)\n for (int j = 0; j < r.width(); ++j)\n for (int k = 0; k < width(); ++k)\n res[i][j] += val[i][k] * r[k][j];\n return (*this) = res;\n }\n constexpr Matrix operator + () const { return Matrix(*this); }\n constexpr Matrix operator - () const { return Matrix(*this) *= T(-1); }\n constexpr Matrix operator + (const Matrix &r) const { return Matrix(*this) += r; }\n constexpr Matrix operator - (const Matrix &r) const { return Matrix(*this) -= r; }\n constexpr Matrix operator * (T v) const { return Matrix(*this) *= v; }\n constexpr Matrix operator * (const Matrix &r) const { return Matrix(*this) *= r; }\n \n // pow\n constexpr Matrix pow(long long n) const {\n assert(height() == width());\n Matrix<T> res(height(), width()), mul(*this);\n while (n > 0) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend constexpr Matrix<T> pow(const Matrix<T> &mat, long long n) {\n return mat.pow(n);\n }\n \n // gauss-jordan\n constexpr int find_pivot(int cur_rank, int col) const {\n int pivot = -1;\n T max_v = EPS;\n for (int row = cur_rank; row < height(); ++row) {\n if (abs(val[row][col]) > max_v) {\n max_v = abs(val[row][col]);\n pivot = row;\n }\n }\n return pivot;\n }\n constexpr void sweep(int cur_rank, int col, int pivot) {\n swap(val[pivot], val[cur_rank]);\n auto fac = val[cur_rank][col];\n for (int col2 = 0; col2 < width(); ++col2) {\n val[cur_rank][col2] /= fac;\n }\n for (int row = 0; row < height(); ++row) {\n if (row != cur_rank && abs(val[row][col]) > EPS) {\n auto fac = val[row][col];\n for (int col2 = 0; col2 < width(); ++col2) {\n val[row][col2] -= val[cur_rank][col2] * fac;\n }\n }\n }\n }\n constexpr int gauss_jordan(int not_sweep_width = 0) {\n int rank = 0;\n for (int col = 0; col < width(); ++col) {\n if (col == width() - not_sweep_width) break;\n int pivot = find_pivot(rank, col);\n if (pivot == -1) continue;\n sweep(rank++, col, pivot);\n }\n return rank;\n }\n friend constexpr int gauss_jordan(Matrix<T> &mat, int not_sweep_width = 0) {\n return mat.gauss_jordan(not_sweep_width);\n }\n friend constexpr vector<T> linear_equation(const Matrix<T> &mat, const vector<T> &b) {\n // extend\n Matrix<T> A(mat.height(), mat.width() + 1);\n for (int i = 0; i < mat.height(); ++i) {\n for (int j = 0; j < mat.width(); ++j) A[i][j] = mat.val[i][j];\n A[i].back() = b[i];\n }\n int rank = A.gauss_jordan(1);\n \n // check if it has no solution\n vector<T> res;\n for (int row = rank; row < mat.height(); ++row)\n if (abs(A[row].back()) > EPS)\n return res;\n\n // answer\n res.assign(mat.width(), 0);\n for (int i = 0; i < rank; ++i) res[i] = A[i].back();\n return res;\n }\n};\n\n\n\n/*/////////////////////////////*/\n// Examples\n/*/////////////////////////////*/\n\nvoid AOJ_2171() {\n int N, s, t;\n while (cin >> N >> s >> t, N) {\n --s, --t;\n vector<int> q(N);\n vector<vector<int>> a(N, vector<int>(N));\n for (int i = 0; i < N; ++i) cin >> q[i];\n for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) cin >> a[i][j];\n\n // Dijkstra\n const int INF = 1<<29;\n vector<int> dist(N, INF);\n vector<bool> seen(N, 0);\n dist[t] = 0;\n for (int iter = 0; iter < N; ++iter) {\n int curd = INF;\n int v = -1;\n for (int i = 0; i < N; ++i) {\n if (seen[i]) continue;\n if (curd > dist[i]) {\n curd = dist[i];\n v = i;\n }\n }\n if (v == -1) break;\n for (int w = 0; w < N; ++w) {\n if (w == v) continue;\n if (a[v][w] == 0) continue;\n dist[w] = min(dist[w], curd + a[v][w]);\n }\n seen[v] = true;\n }\n if (dist[s] >= INF) {\n cout << \"impossible\" << endl;\n return;\n }\n\n // 連立一次方程式を作る\n Matrix<double> A(N, N, 0);\n vector<double> b(N, 0);\n for (int v = 0; v < N; ++v) {\n if (v == t) {\n A[v][v] = 1;\n b[v] = 0;\n }\n else {\n vector<int> neigbor;\n for (int w = 0; w < N; ++w) {\n if (a[v][w] == 0) continue;\n if (q[v] == 1 && dist[w] + a[v][w] != dist[v]) continue;\n neigbor.push_back(w);\n }\n int K = neigbor.size();\n for (auto w : neigbor) {\n A[v][w] -= 1;\n b[v] += a[v][w];\n }\n A[v][v] += K;\n }\n }\n \n // 解く\n auto res = linear_equation(A, b);\n if (res.empty()) cout << \"impossible\" << endl;\n else cout << fixed << setprecision(15) << res[s] << endl;\n }\n}\n\nvoid AOJ_1328() {\n using D = long double;\n EPS = 1e-5; // set EPS\n \n auto dpow = [&](D a, int n) -> D {\n D res = 1.0;\n for (int i = 0; i < n; ++i) res *= a;\n return res;\n };\n auto func = [&](const vector<D> &coef, int i) -> D {\n D res = 0.0;\n for (int p = 0; p < (int)coef.size(); ++p)\n res += coef[p] * pow(i, p);\n return res;\n };\n \n int d;\n while (cin >> d, d) {\n vector<D> v(d + 3);\n for (int i = 0; i < d + 3; ++i) cin >> v[i];\n\n bool finish = false;\n int res = 0;\n for (int i = 0; i < d + 3 && !finish; ++i) {\n for (int j = i + 1; j < d + 3 && !finish; ++j) {\n Matrix<D> A(d + 1, d + 1);\n vector<D> b(d + 1);\n for (int k = 0, iter = 0; k < d+3; ++k) {\n if (k == i || k == j) continue;\n for (int p = 0; p < d + 1; ++p) {\n A[iter][p] = pow(k, p);\n b[iter] = v[k];\n }\n ++iter;\n }\n vector<D> ans = linear_equation(A, b);\n if (ans.empty()) continue;\n D vi = func(ans, i), vj = func(ans, j);\n int num = 0;\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\n if (num == 1) goto end;\n }\n }\n end:\n cout << res << endl;\n }\n}\n\n\nint main() {\n //AOJ_2171();\n AOJ_1328();\n}","accuracy":1,"time_ms":10,"memory_kb":3840,"score_of_the_acc":-0.8394,"final_rank":16},{"submission_id":"aoj_1328_7233740","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ld = long double;\nusing point = pair<ld,ld>;\n\nld compute(const vector<point>& points, const ld& x) {\n int n = points.size();\n\n vector<ld> vals;\n for (int i = 0; i < n; i++) {\n ld val = points[i].second;\n\n for (int j = 0; j < n; j++) {\n if(i == j)continue;\n val *= (x - points[j].first);\n val /= (points[i].first - points[j].first);\n }\n\n vals.push_back(val);\n }\n sort(vals.begin(),vals.end());\n\n return accumulate(vals.begin(),vals.end(), 0.0l);\n}\n\nvoid solve(int d) {\n ld v[d + 3];\n for (int i = 0; i < d + 3; i++) {\n cin >> v[i];\n }\n\n vector<pair<ld,int>> diffs;\n\n for (int exclude = 0; exclude < d + 3; exclude++) {\n vector<point> points;\n for (int i = 0; i < d + 3; i++) {\n if(i == exclude) continue;\n points.emplace_back(i, v[i]);\n }\n\n random_shuffle(points.begin(), points.end());\n points.resize(d + 1);\n\n ld diff = 0.0l;\n for (int i = 0; i < d + 3; i++) {\n if(i == exclude) continue;\n diff += powl(compute(points, i) - v[i], 2.0l);\n }\n diffs.emplace_back(diff, exclude);\n }\n\n sort(diffs.begin(), diffs.end());\n cout << diffs.front().second << endl;\n}\n\nint main() {\n int d;\n while(true) {\n cin >> d;\n if(d == 0) break;\n solve(d);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3328,"score_of_the_acc":-0.2523,"final_rank":10},{"submission_id":"aoj_1328_5491188","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000001\n\ndouble eps = 1e-2;\nvector<double> add(vector<double> a,vector<double> b){\n\tvector<double> c(max((int)a.size(),(int)b.size()),0.0);\n\trep(i,a.size())c[i] += a[i];\n\trep(i,b.size())c[i] += b[i];\n\treturn c;\n}\n\nvector<double> mul(vector<double> a,vector<double> b){\n\tvector<double> c(a.size()+b.size()-1,0.0);\n\trep(i,a.size()){\n\t\trep(j,b.size()){\n\t\t\tc[i+j] += a[i]*b[j];\n\t\t}\n\t}\n\treturn c;\n}\n\ndouble get(vector<double> a,double x){\n\tdouble ret = 0.0;\n\trep(i,a.size()){\n\t\tret += pow(x,i) * a[i];\n\t}\n\treturn ret;\n}\n\nvector<double> Find(vector<double> x,vector<double> y){\n\tvector<double> ret;\n\t\n\trep(i,x.size()){\n\t\tvector<double> t(1,1.0);\n\t\trep(j,x.size()){\n\t\t\tif(i==j)continue;\n\t\t\tt = mul(t,{-x[j],1.0});\n\t\t}\n\t\tdouble A = y[i];\n\t\tA /= get(t,x[i]);\n\t\tt = mul(t,{A});\n\t\tret = add(ret,t);\n\t}\n\treturn ret;\n}\n\nint main(){\n\t\n\twhile(true){\n\t\tint d;\n\t\tcin>>d;\n\t\tif(d==0)break;\n\t\tvector<double> v(d+3);\n\t\trep(i,d+3)cin>>v[i];\n\t\t\n\t\tint ans = -1;\n\t\trep(i,d+3){\n\t\t\trep(j,d+3){\n\t\t\t\tif(i==j)continue;\n\t\t\t\tvector<double> x,y;\n\t\t\t\trep(k,d+3){\n\t\t\t\t\tif(i==k||j==k)continue;\n\t\t\t\t\tx.push_back(k);\n\t\t\t\t\ty.push_back(v[k]);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tauto ret = Find(x,y);\n\t\t\t\tbool f0 = true,f1 = true;\n\t\t\t\tif(abs(get(ret,i)-v[i])<eps)f0=false;\n\t\t\t\tif(abs(get(ret,j)-v[j])<eps)f1=false;\n\t\t\t\tif(f0&&f1)continue;\n\t\t\t\tif(f0)ans = i;\n\t\t\t\telse ans = j;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout<<ans<<endl;\n\t\t\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3920,"score_of_the_acc":-1.4766,"final_rank":20},{"submission_id":"aoj_1328_4963196","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cmath>\n#include<ctime>\n#include<queue>\n#include<cassert>\n#include<set>\n\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vector<int> >;\nusing pii = pair<int, int>;\nusing ppi = pair<pii, int>;\n\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\n\nconst double EPS = 1e-8;\nvec gauss_jordan(const mat& A, const vec& b){\n int n = A.size();\n mat B(n, vec(n + 1));\n for(int i = 0; i < n; i++)\n for(int j = 0; j < n; j++) B[i][j] = A[i][j];\n for(int i = 0; i < n; i++) B[i][n] = b[i];\n for(int i = 0; i < n; i++){\n int pivot = i;\n for(int j = i; j < n; j++){\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n }\n swap(B[i], B[pivot]);\n\n if(abs(B[i][i]) < EPS) return vec();\n\n for(int j = i+1; j <= n; j++) B[i][j] /= B[i][i];\n for(int j = 0; j < n; j++){\n if(i != j){\n for(int k = i+1; k <= n; k++) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n }\n vec x(n);\n for(int i = 0; i < n; i++) x[i] = B[i][n];\n return x;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int ti = clock();\n // start-----------------------------------------------\n int d;\n while(cin >> d, d){\n vec v(d+3);\n for(int i = 0; i < d+3; i++) cin >> v[i];\n int ans = 0;\n mat m(d+3, vec(d+2));\n for(int i = 0; i < d+3; i++){\n for(int j = 0; j < d+1; j++) m[i][j] = pow(1.0*i, j);\n }\n for(int i = 0; i < d+3; i++){\n for(int j = i+1; j < d+3; j++){\n vec b(d+1);\n mat A(d+1, vec(d+1));\n for(int k = 0, l = 0; k < d+3; k++)\n if(i != k && j != k) A[l] = m[k], b[l] = v[k], l++;\n vec x = gauss_jordan(A, b);\n double res[2] = {};\n for(int k = 0; k < d+1; k++){\n res[0] += x[k] * m[i][k];\n res[1] += x[k] * m[j][k];\n }\n if(abs(res[0] - v[i]) + 1e-5 > 1.0 && abs(res[1] - v[j]) < 1e-5) ans = i;\n if(abs(res[0] - v[i]) < 1e-5 && abs(res[1] - v[j]) + 1e-5 > 1.0) ans = j;\n }\n }\n cout << ans << endl;\n }\n\n // end-----------------------------------------------\n // cerr << 1.0 * (clock() - ti) / CLOCKS_PER_SEC << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3980,"score_of_the_acc":-1,"final_rank":18},{"submission_id":"aoj_1328_4954188","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\n#include <iomanip>\n#include <random>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 510000;\n// ll dy[8] = {0,-1,0,1,1,-1,-1,1};\n// ll dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-4;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\ntypedef vector<vector<double>> mat;\n\nmat matinv(mat a){\n int n = a.size();\n mat b(n,vector<double>(n*2));\n rep(i,n){\n rep(j,n){\n b[i][j] = a[i][j];\n }\n }\n rep(i,n) b[i][n+i] = 1;\n rep(i,n){\n int pivot = i;\n for(int j=i; j<n; j++){\n if(abs(b[j][i]) > abs(b[pivot][i])) pivot = j;\n }\n if(abs(b[pivot][i]) < eps){\n b.clear();\n return b;\n }\n swap(b[i], b[pivot]);\n for(int j=i+1; j<2*n; j++) b[i][j] /= b[i][i];\n rep(j,n){\n if(i != j){\n for(int k=i+1; k<2*n; k++) b[j][k] -= b[j][i] * b[i][k];\n }\n }\n }\n mat ret(n,vector<double>(n));\n rep(i,n) rep(j,n) ret[i][j] = b[i][n+j];\n return ret;\n}\n\nmat matmul(mat &a, mat &b){\n mat c(a.size(), vector<double>(b[0].size()));\n for(int i=0; i<a.size(); i++){\n for(int k=0; k<b.size(); k++){\n for(int j=0; j<b[0].size(); j++){\n c[i][j] += a[i][k] * b[k][j];\n }\n }\n }\n return c;\n}\n\nint main(){\n while(1){\n int d; cin >> d;\n if(!d) break;\n vector<double> f(d+3);\n rep(i,d+3) cin >> f[i];\n bool det = false;\n int ans = -1;\n rep(i,d+3){\n rep(j,i){\n mat a(d+1,vector<double>(d+1));\n mat b(d+1,vector<double>(1));\n int id = 0;\n rep(k,d+3){\n if(k == j || k == i) continue;\n b[id][0] = f[k];\n rep(l,d+1){\n a[id][l] = pow(k,l);\n }\n id++;\n }\n // rep(k,d+1){\n // rep(l,d+1) cout << a[k][l] << \" \";\n // cout << \"\\n\";\n // }\n mat inv = matinv(a);\n // rep(k,d+1){\n // rep(l,d+1) cout << inv[k][l] << \" \";\n // cout << \"\\n\";\n // }\n // rep(k,d+1) cout << b[k][0] << \" \";\n // cout << \"\\n\";\n // cout << \"\\n\";\n if(inv.empty()) continue;\n mat res = matmul(inv,b);\n auto val = [&](int t) -> double {\n double ret = 0.0;\n rep(k,d+1) ret += res[k][0] * pow(t,k);\n return ret;\n };\n // rep(k,d+1) cout << res[k][0] << \" \";\n // cout << \"\\n\";\n bool ff = abs(val(i) - f[i]) > eps;\n bool gg = abs(val(j) - f[j]) > eps;\n if(ff != gg){\n det = true;\n if(ff) ans = i;\n else ans = j;\n break;\n }\n }\n if(det) break;\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3428,"score_of_the_acc":-0.367,"final_rank":14},{"submission_id":"aoj_1328_4943483","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-3, PI = acos(-1);\n//ここから編集\nbool eq(double a, double b){ return fabs(a-b) < EPS; }\nlong double lagrange_interpolation(vector<long double> xi, vector<long double> fi, long double x){\n int n = xi.size()-1;\n long double ret = 0.0;\n for(int i=0; i<=n; i++){\n long double t = 1.0;\n for(int j=0; j<=n; j++){\n if(i == j) continue;\n t *= (x-xi[j])/(xi[i]-xi[j]);\n }\n ret += t*fi[i];\n }\n return ret;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n int d;\n while(cin >> d, d){\n\n vector<long double> v(d+3);\n vector<long double> x(d+3);\n REP(i,d+3) {\n cin >> v[i];\n x[i] = i;\n }\n vector<bool> ok(8, false);\n int ans = 0;\n for(int i=0; i<=d+2; i++){\n for(int j=0; j<=d+2; j++){\n vector<long double> xi, fi;\n for(int k=0; k<=d+2; k++){\n if(i == k || j == k) continue;\n xi.push_back(k);\n fi.push_back(v[k]);\n }\n if(eq(lagrange_interpolation(xi, fi, i), v[i])) ok[i]=true;\n if(eq(lagrange_interpolation(xi, fi, j), v[j])) ok[j]=true;\n }\n } \n for(int i=0; i<=d+2; i++) if(!ok[i]) cout << i << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3224,"score_of_the_acc":-0.2239,"final_rank":9},{"submission_id":"aoj_1328_4908086","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n//container utill\n#define ALL(v) (v).begin(),(v).end()\n#define CR [](auto element1, auto element2){return element1>element2;}\n#define LB lower_bound\n#define UP upper_bound\n#define PB push_back\n#define MP make_pair\n#define MT make_tuple\n\nusing LD = long double;\nconst LD EPS = 1e-10;\nconst LD R_EPS = 1e-3;\n\ntemplate<class T> struct Matrix {\n vector<vector<T> > val;\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\n size_t size() const {return val.size();}\n inline vector<T>& operator [] (int i) {return val[i];}\n};\n\ntemplate<class T> ostream& operator << (ostream& s, Matrix<T> A) {\n s << endl; \n for (int i = 0; i < A.size(); ++i) {\n for (int j = 0; j < A[i].size(); ++j) {\n s << A[i][j] << \", \";\n }\n s << endl;\n }\n return s;\n}\n\ntemplate<class T> Matrix<T> operator * (Matrix<T> A, Matrix<T> B) {\n Matrix<T> R(A.size(), B[0].size());\n for (int i = 0; i < A.size(); ++i)\n for (int j = 0; j < B[0].size(); ++j)\n for (int k = 0; k < B.size(); ++k)\n R[i][j] += A[i][k] * B[k][j];\n return R;\n}\n\ntemplate<class T> Matrix<T> pow(Matrix<T> A, long long n) {\n Matrix<T> R(A.size(), A.size());\n for (int i = 0; i < A.size(); ++i) R[i][i] = 1;\n while (n > 0) {\n if (n & 1) R = R * A;\n A = A * A;\n n >>= 1;\n }\n return R;\n}\n\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\n int m = A.size(), n = A[0].size();\n int rank = 0;\n for (int col = 0; col < n; ++col) {\n if (is_extended && col == n-1) break;\n int pivot = -1;\n T ma = EPS;\n for (int row = rank; row < m; ++row) {\n if (abs(A[row][col]) > ma) {\n ma = abs(A[row][col]);\n pivot = row;\n }\n }\n if (pivot == -1) continue;\n swap(A[pivot], A[rank]);\n auto fac = A[rank][col];\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\n for (int row = 0; row < m; ++row) {\n if (row != rank && abs(A[row][col]) > EPS) {\n auto fac = A[row][col];\n for (int col2 = 0; col2 < n; ++col2) {\n A[row][col2] -= A[rank][col2] * fac;\n }\n }\n }\n ++rank;\n }\n return rank;\n}\n\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\n // extended\n int m = A.size(), n = A[0].size();\n Matrix<T> M(m, n + 1);\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\n M[i][n] = b[i];\n }\n int rank = GaussJordan(M, true);\n \n // check if it has no solution\n vector<T> res;\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\n\n // answer\n res.assign(n, 0);\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\n return res;\n}\n\nvoid nextind(int d, vector<int> &ind){\n int s=ind.size();\n while(ind[s-1]==(d+2)+(s-(d+1))){\n auto t=ind.end();\n t--;\n ind.erase(t);\n s=ind.size();\n }\n ind[s-1]++;\n while(s<d+1){\n ind.PB(ind[s-1]+1);\n s=ind.size();\n }\n}\n\nvoid solve(int d){\n LD f[d+3];\n int i,j,k;\n for(i=0; i<d+3; i++){\n cin >> f[i];\n }\n vector<vector<LD> > coef;\n vector<int> ind;\n for(i=0; i<d; i++){\n ind.PB(i);\n }\n ind.PB(d-1);\n vector<vector<int> > indind;\n for(i=0; i<((d+3)*(d+2))/2; i++){\n nextind(d,ind);\n indind.PB(ind);\n Matrix<LD> A(d+1,d+1);\n for(j=0; j<d+1; j++){\n int ele=1;\n for(k=0; k<d+1; k++){\n A[j][k]=ele;\n ele*=ind[j];\n }\n }\n vector<LD> b;\n for(j=0; j<d+1; j++){\n b.PB(f[ind[j]]);\n }\n coef.PB(linear_equation(A,b));\n }\n vector<bool> safe(d+3,0);\n bool now;\n for(i=0; i<((d+3)*(d+2))/2; i++){\n now=0;\n for(j=i+1; j<((d+3)*(d+2))/2; j++){\n for(k=0; k<d+1; k++){\n if(abs(coef[i][k]-coef[j][k])>R_EPS) break;\n }\n if(k<d+1) continue;\n now=1;\n }\n if(now==1){\n for(j=0; j<d+1; j++){\n safe[indind[i][j]]=1;\n }\n }\n }\n for(i=0; i<d+3; i++){\n if(safe[i]==0) break;\n }\n cout << i << endl;\n}\n\nint main(){\n int d;\n while(cin >> d, d>0){\n solve(d);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3108,"score_of_the_acc":-0.0909,"final_rank":4},{"submission_id":"aoj_1328_4699696","code_snippet":"#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <queue>\n#include <stack>\n#include <set>\n#include <map>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <random>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <bitset>\n#include <functional>\n#include <iomanip>\n#include <random>\n\n#define FOR_LT(i, beg, end) for (int i = (int)(beg); i < (int)(end); i++)\n#define FOR_LE(i, beg, end) for (int i = (int)(beg); i <= (int)(end); i++)\n#define FOR_DW(i, beg, end) for (int i = (int)(beg); (int)(end) <= i; i--)\n#define REP(n) for (int repeat_index = 0; repeat_index < (int)n; repeat_index++)\n\nusing namespace std;\n//=============================================================================\n// Matrix\n//=============================================================================\n\ntemplate <typename T>\nstruct Matrix {\n Matrix(size_t m, size_t n, T x = 0) : val_(vector<vector<T>>(m, vector<T>(n, x))) {}\n\n void Init(size_t m, size_t n, T x = 0)\n {\n this->val_.assign(vector<vector<T>>(m, vector<T>(n, x)));\n }\n\n size_t size() {\n return this->val_.size();\n }\n\n inline vector<T>& operator [] (int i) { return this->val_[i]; }\n\n void print() {\n for (auto& v : val_) {\n for (auto& t : v) {\ncout << t << \" \";\n }\n cout << endl;\n }\n }\n\n vector<vector<T>> val_;\n};\n\n//=============================================================================\n// REAL\n//=============================================================================\nstatic const double kEPS = 1e-10;\n\ntemplate<class T>\nint gauss_jordan(Matrix<T>& A, bool is_extended = false) {\n int m = A.size(), n = A[0].size();\n\n int rank = 0;\n for (int col = 0; col < n; ++col) {\n if (is_extended && col == n - 1) break;\n\n int pivot = -1;\n T ma = kEPS;\n for (int row = rank; row < m; ++row) {\n if (abs(A[row][col]) > ma) {\n ma = abs(A[row][col]);\n pivot = row;\n }\n }\n if (pivot == -1) continue;\n\n swap(A[pivot], A[rank]);\n {\n auto fac = A[rank][col];\n\n for (int col2 = 0; col2 < n; ++col2) {\n A[rank][col2] /= fac;\n }\n }\n\n for (int row = 0; row < m; ++row) {\n if (row != rank && abs(A[row][col]) > kEPS) {\n auto fac = A[row][col];\n for (int col2 = 0; col2 < n; ++col2) {\n A[row][col2] -= A[rank][col2] * fac;\n }\n }\n }\n\n ++rank;\n }\n\n return rank;\n}\n\n\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b)\n{\n int m = A.size(), n = A[0].size();\n\n Matrix<T> M(m, n + 1);\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\n M[i][n] = b[i];\n }\n int rank = gauss_jordan(M, true);\n\n vector<T> res;\n for (int row = rank; row < m; ++row) {\n if (abs(M[row][n]) > kEPS) return res;\n }\n\n res.assign(n, 0);\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\n return res;\n}\n\nvoid solve(int d)\n{\n vector<double> y(d + 3);\n FOR_LT(i, 0, d + 3) {\n cin >> y[i];\n }\n\n vector<int> s;\n vector<vector<int>> sc;\n vector<vector<double>> v;\n FOR_LT(i, 0, (1 << (d + 3))) {\n {\n int c = 0;\n FOR_LT(j, 0, (d + 3)) {\n if (i & (1 << j)) c++;\n }\n if (c != d + 1) continue;\n }\n\n\n Matrix<double> A(d + 1, d + 1);\n vector<double> b(d + 1);\n\n int c = 0;\n FOR_LT(j, 0, d + 3) {\n if (i & (1 << j)) {\n FOR_LE(k, 0, d) {\n A[c][k] = pow(j, k);\n }\n b[c] = y[j];\n c++;\n }\n\t\t}\n\n vector<double> ans = linear_equation(A, b);\n assert(!ans.empty());\n\n {\n bool is_same = false;\n FOR_LT(j, 0, s.size()) {\n bool is_c_same = true;\n FOR_LT(k, 0, d + 1) {\n if (abs(v[j][k] - ans[k]) >= 10E-4) {\n is_c_same = false;\n break;\n }\n }\n if (is_c_same) {\n is_same = true;\n s[j]++;\n FOR_LT(k, 0, d + 3) {\n if (i & (1 << k)) {\n sc[j][k]++;\n }\n }\n break;\n }\n }\n if (!is_same) {\n s.push_back(1);\n v.push_back(ans);\n vector<int> scc(d + 3);\n FOR_LT(k, 0, d + 3) {\n if (i & (1 << k)) {\n scc[k]++;\n }\n }\n sc.push_back(scc);\n }\n }\n\t}\n\n int argmax = -1;\n int maxv = 0;\n FOR_LT(i, 0, s.size()) {\n if (maxv < s[i]) {\n argmax = i;\n maxv = s[i];\n }\n }\n\n FOR_LT(i, 0, d + 3) {\n if (sc[argmax][i] == 0) {\n cout << i << endl;\n return;\n }\n }\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\tcout << fixed << setprecision(20);\n\n\twhile (true) {\n\t\tint d; cin >> d;\n\t\tif (d == 0) break;\n\t\tsolve(d);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3344,"score_of_the_acc":-0.3616,"final_rank":13},{"submission_id":"aoj_1328_4368376","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <climits>\n#include <cstring>\n#include <cassert>\n\n#define rep(i, m, n) for(int i=int(m);i<int(n);i++)\n#define all(c) begin(c),end(c)\n\ntemplate<typename T1, typename T2>\ninline void chmin(T1 &a, T2 b) { if (a > b) a = b; }\n\ntemplate<typename T1, typename T2>\ninline void chmax(T1 &a, T2 b) { if (a < b) a = b; }\n\ntypedef long long int ll;\nusing ll = long long int;\nusing ull = long long unsigned int;\nusing Int = long long int;\nusing uInt = long long unsigned int;\nusing Double = long double;\nusing namespace std;\n#define INF (1 << 30) - 1\n#define INFl (ll)5e15\n#define DEBUG 0\n#define dump(x) cerr << #x << \" = \" << (x) << endl\n#define MOD 1000000007\n\n\n//edit\nconst double EPS = 1E-7;\ntypedef vector<Double> vec;\ntypedef vector<vec> mat;\n\n//Ax = b を解く。Aは正方行列\n// 解がないか、一意でない場合は長さ0の配列を返す\nvec gauss_jordan(const mat &A, const vec &b) {\n int n = A.size();\n mat B(n, vec(n + 1));\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) B[i][j] = A[i][j];\n //行列Aの後ろにbを並べ、同時に処理する。\n for (int i = 0; i < n; i++) B[i][n] = b[i];\n\n for (int i = 0; i < n; i++) {\n //注目している変数の係数の絶対値が大きい式をi番目に持ってくる\n int pivot = i;\n for (int j = i; j < n; j++) {\n if (abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n }\n swap(B[i], B[pivot]);\n\n //解がないか一意でない\n if (abs(B[i][i]) < EPS) return vec();\n\n //注目している変数の係数を1にする\n for (int j = i + 1; j <= n; j++) B[i][j] /= B[i][i];\n for (int j = 0; j < n; j++) {\n if (i != j) {\n //j番目の式からi番目の変数を削除\n for (int k = i + 1; k <= n; k++) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n }\n vec x(n);\n for (int i = 0; i < n; i++) x[i] = B[i][n];\n return x;\n}\n\n\nclass Solve {\npublic:\n Int n;\n vector<Double> v;\n\n vector<Double> calc(vector<int> idx) {\n vector<vector<Double>> A(idx.size(), vector<Double>(idx.size()));\n vector<Double> b(idx.size());\n\n for (int i = 0; i < idx.size(); ++i) {\n for (int j = 0; j < idx.size(); ++j) {\n Double tmp = pow(idx[i], j);\n A[i][j] = tmp;\n }\n }\n for (int i = 0; i < idx.size(); ++i) {\n b[i] = v[idx[i]];\n }\n\n auto ret = gauss_jordan(A, b);\n return ret;\n }\n\n bool eq_vec(vector<Double> &v1, vector<Double> &v2) {\n for (int i = 0; i < v1.size(); ++i) {\n if (abs(v1[i] - v2[i]) > 0.1) {\n return false;\n }\n }\n return true;\n }\n\n bool is_wrong(int p) {\n vector<int> idx1, idx2;\n for (int i = 0; i < v.size(); ++i) {\n if (i != p) {\n idx1.push_back(i);\n idx2.push_back(i);\n }\n }\n idx1.pop_back();\n idx2.erase(idx2.begin());\n\n auto x1 = calc(idx1);\n auto x2 = calc(idx2);\n\n bool ret = eq_vec(x1, x2);\n return ret;\n }\n\n bool solve() {\n cin >> n;\n if (n == 0) return false;\n v.resize(n + 3);\n rep(i, 0, n + 3) cin >> v[i];\n\n int ans = -1;\n for (int i = 0; i <= n + 2; ++i) {\n if (is_wrong(i)) {\n ans = i;\n }\n }\n cout << ans << endl;\n\n return true;\n }\n};\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n// std::ifstream in(\"input.txt\");\n// std::cin.rdbuf(in.rdbuf());\n\n while (Solve().solve());\n\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.3257,"final_rank":11},{"submission_id":"aoj_1328_4267647","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-5L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define seg_size 262144LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\n// geometry library\n\ntypedef complex<long double> Point;\ntypedef pair<complex<long double>, complex<long double>> Line;\n\ntypedef struct Circle {\n complex<long double> center;\n long double r;\n}Circle;\n\n//内積、 dot(a,b) = |a||b|cos()\nlong double dot(Point a, Point b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n//外積、cross(a,b) = |a||b|sin()\nlong double cross(Point a, Point b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\n//線分と点の距離\nlong double Dist_Line_Point(Line a, Point b) {\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\n}\n\n//線分の交差判定\nint is_intersected_ls(Line a, Line b) {\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < 0) &&\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < 0);\n}\n\n//線分の交点\nPoint intersection_l(Line a, Line b) {\n Point da = a.second - a.first;\n Point db = b.second - b.first;\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\n}\n\n//線分と線分の距離\nlong double Dist_Line_Line(Line a, Line b) {\n if (is_intersected_ls(a, b) == 1) {\n return 0;\n }\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\n}\n\n//円と円の交点\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\n long double dist = abs(a.center - b.center);\n assert(dist <= eps + a.r + b.r);\n assert(dist+eps >= abs(a.r - b.r));\n Point target = b.center - a.center;\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\n long double aa = pointer + a.r * a.r - b.r * b.r;\n aa /= 2.0L;\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\n r = r + a.center;\n l = l + a.center;\n return mp(l, r);\n}\n\n//end of geometry\n\n\n\nvoid init() {\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\n\nunsigned long xor128() {\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n unsigned long t = (x ^ (x << 11));\n x = y; y = z; z = w;\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\n#define int ll\n\ntemplate<typename A>\nvector<A> solve_algebra_equations(vector<vector<A>> now) {\n for (int q = 0; q < now.size(); ++q) {\n if (now[q][q] == 0) {\n for (int j = q + 1; j < now.size(); ++j) {\n if (now[j][q] != 0) {\n swap(now[j], now[q]);\n break;\n }\n }\n }\n for (int j = now[q].size() - 1; j >= 0; --j) {\n now[q][j] /= now[q][q];\n }\n for (int j = 0; j < now.size();++j) {\n if (j == q) continue;\n A val = now[j][q];\n for (int t = 0; t < now[j].size(); ++t) {\n now[j][t] -= val * now[q][t];\n }\n }\n }\n vector<A> ans;\n REP(i, now.size()) {\n ans.push_back(now[i].back());\n }\n return ans;\n}\n\nvoid solve(){\n while (true) {\n int d;\n cin >> d;\n if (d == 0) return;\n vector<long double> inputs;\n REP(i, d + 3) {\n long double a;\n cin >> a;\n inputs.push_back(a);\n }\n int ans = -1;\n REP(i, inputs.size()) {\n for (int q = i + 1; q < inputs.size(); ++q) {\n vector<vector<long double>> neko;\n vector<vector<long double>> check;\n REP(j, inputs.size()) {\n vector<long double> now;\n now.push_back(inputs[j]);\n long double geko = 1;\n for (int t = 0; t <= d; ++t) {\n now.push_back(geko);\n geko *= j;\n }\n reverse(ALL(now));\n if (i == j || q == j) {\n check.push_back(now);\n }\n else {\n neko.push_back(now);\n }\n }\n vector<long double> geko = solve_algebra_equations<long double>(neko);\n REP(t, 2) {\n long double now_check = 0;\n for (int q = 0; q < geko.size(); ++q) {\n now_check += geko[q] * check[t][q];\n }\n if (abs(now_check - check[t].back()) < eps) {\n if (t == 0) {\n ans = q;\n }\n else {\n ans = i;\n }\n break;\n }\n }\n }\n if (ans != -1) break;\n }\n cout << ans << endl;\n }\n}\n\n#undef int\nint main() {\n init();\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3204,"score_of_the_acc":-0.1101,"final_rank":5},{"submission_id":"aoj_1328_4189068","code_snippet":"#include <bits/stdc++.h>\ndouble lagrange_interpolation(std::vector<double> x, std::vector<double> y, double T) {\n const long long n = x.size() - 1;\n double ret = 0;\n for(int i=0;i<n+1;++i) {\n double t = 1;\n for(int j=0;j<n+1;++j) {\n if(i == j) continue;\n t *= T-x[j];\n t /= x[i]-x[j];\n }\n ret += t * y[i];\n }\n return ret;\n}\nstd::vector<double> lagrange_interpolation(std::vector<double> x, std::vector<double> y) {\n const long long n = x.size() - 1;\n const double eps = 1e-6;\n for(int i=0;i<n+1;++i) {\n double t = 1;\n for(int j=0;j<n+1;++j) {\n if(i != j) t *= x[i]-x[j];\n }\n y[i] /= t;\n }\n long long cur = 0, nxt = 1;\n std::vector<std::vector<double>> dp(2, std::vector<double>(n+2));\n dp[0][0] = -1 * x[0], dp[0][1] = 1;\n for(int i=1;i<n+1;++i) {\n for(int j=0;j<n+2;++j) {\n dp[nxt][j] = dp[cur][j] * -1 * x[i];\n if(j >= 1) dp[nxt][j] += dp[cur][j-1];\n }\n std::swap(nxt, cur);\n }\n std::vector<double> ret(n+1);\n for(int i=0;i<n+1;++i) {\n if(y[i]==0) continue;\n if(abs(x[i]) < eps) {\n for(int j=0;j<n+1;++j) ret[j] += dp[cur][j+1] * y[i];\n } else {\n ret[0] -= dp[cur][0] / x[i] * y[i];\n double pre = -1 * dp[cur][0] / x[i];\n for(int j=1;j<n+1;++j) {\n ret[j] -= (dp[cur][j] - pre) / x[i] * y[i];\n pre = -1 * (dp[cur][j] - pre) / x[i];\n }\n }\n }\n return ret;\n}\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nconst double eps = 1e-4;\nconst ll MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\ntemplate<typename T1, typename T2>\nostream& operator<<(ostream &os, const pair<T1, T2> p) {\n os << p.first << \":\" << p.second;\n return os;\n}\nbool operator== (const vector<double> &v1, const vector<double> &v2) {\n if((int)(v1.size()) == (int)(v2.size())) {\n bool res = true;\n for(int i=0;i<(int)(v1.size());++i) {\n res &= abs(v1[i] - v2[i]) < eps;\n }\n return res;\n } else {\n return false;\n }\n}\ndouble err (const vector<double> &v1, const vector<double> &v2) {\n double res = 0;\n for(int i=0;i<(int)(v1.size());++i) {\n res += abs(v1[i] - v2[i]);\n }\n return res;\n}\nvoid solve(int d) {\n vector<double> x, y;\n for(int i=0;i<d+3;++i) {\n x.push_back(i);\n double tmp; cin >> tmp;\n y.push_back(tmp);\n }\n vector<pair<double, int>> vp;\n for(int i=0;i<d+3;++i) {\n vector<vector<double>> v;\n for(int j=0;j<d+3;++j) {\n if(j == i) continue;\n vector<double> nx, ny;\n for(int k=0;k<d+3;++k) {\n if(k == i || k == j) continue;\n nx.push_back(x[k]);\n ny.push_back(y[k]);\n }\n v.emplace_back(lagrange_interpolation(nx, ny));\n }\n bool ok = true;\n double ma = 0;\n for(int j=0;j<d+2;++j) {\n ma = max(ma, err(v[j], v[(j+1)%(d+2)]));\n }\n vp.push_back({ma, i});\n }\n sort(vp.begin(), vp.end());\n cout << vp[0].second << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n while(1) {\n int d; cin >> d;\n if(d == 0) break;\n solve(d);\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3220,"score_of_the_acc":-0.2193,"final_rank":8},{"submission_id":"aoj_1328_3992060","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\n\n#define fs first\n#define sc second\n\nconst LL MOD = 1e9+7;\nconst double EPS = 1e-10;\n\ntemplate<class T>bool chmax(T &a, const T &b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate<class T>bool chmin(T &a, const T &b) {\n if (b < a) { a = b; return true; }\n return false;\n}\n\n// std::vector Declaration\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\n// std::vector Declaration and Initialization\ntemplate<typename T>\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\ntemplate<typename T, typename U, typename... Ts>\nauto make_vector(size_t a, U b, Ts... ts) {\n return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));\n}\n\n// std::vector Input\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (auto &e : v) {\n is >> e;\n }\n return is;\n}\n\n// std::vector Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::array Debug\ntemplate<typename T, size_t n>\nostream& operator<<(ostream& os, const array<T, n>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::deque Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const deque<T>& d) {\n os << \"[\";\n bool a = 1;\n for (auto e : d) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::pair Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << \"(\" << p.first << \" \" << p.second << \")\";\n return os;\n}\n\n// std::set Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const set<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::multiset Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const multiset<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::map Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const map<T, U>& mp) {\n os << \"{\";\n bool a = 1;\n for (auto e : mp) {\n os << (a ? \"\" : \" \");\n os << e.first << \":\" << e.second;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::tuple Debug\ntemplate<int N, class Tuple>\nvoid out(ostream& os, const Tuple& t){}\ntemplate<int N, class Tuple, class H, class ...Ts>\nvoid out(ostream& os, const Tuple& t) {\n if (N) os << \" \";\n os << get<N>(t);\n out<N+1,Tuple,Ts...>(os, t);\n}\ntemplate<class ...Ts>\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\n os << \"(\";\n out<0,tuple<Ts...>,Ts...>(os, t);\n os << \")\";\n return os;\n}\n\n// Debug\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n\n// Weighted edge\ntemplate<typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n\n friend ostream& operator<<(ostream& os, const edge& e) {\n return os << \"(\" << e.src << \"->\" << e.to << \":\" << e.cost << \")\";\n }\n};\n\ntemplate<typename T>\nusing Edges = vector<edge<T>>;\ntemplate<typename T>\nusing WeightedGraph = vector<Edges<T>>;\nusing UnWeightedGraph = vector<vector<int>>;\ntemplate<typename T>\nusing MatrixGraph = vector<vector<T>>;\n\nusing Matrix = vector<vector<double>>;\n\npair<Matrix,Matrix> LUDecomposition(const Matrix& A) {\n // A: Squere Matirix\n int n = A.size();\n const double INF = numeric_limits<double>::max();\n Matrix L = make_v<double>(n, n),\n U = make_v<double>(n, n);\n\n for (int i = 0; i < n; ++i) {\n L[i][i] = 1;\n }\n\n for (int i = 0; i < n; ++i) {\n // L\n for (int j = 0; j < i; ++j) {\n double total = 0;\n for (int k = 0; k < j; ++k) {\n total += L[i][k] * U[k][j];\n }\n L[i][j] = (A[i][j] - total) / U[j][j];\n }\n\n // U\n for (int j = i; j < n; ++j) {\n double total = 0;\n for (int k = 0; k < i; ++k) {\n total += L[i][k] * U[k][j];\n }\n U[i][j] = A[i][j] - total;\n }\n }\n\n return make_pair(L, U);\n}\n\nusing Vector = vector<double>;\n\nVector solve(const Matrix& A, const Vector& b) {\n // A: Squere Matrix\n int n = A.size();\n Matrix L, U;\n tie(L, U) = LUDecomposition(A);\n\n Vector y(n);\n for (int i = 0; i < n; ++i) {\n double total = 0;\n for (int j = 0; j < i; ++j) {\n total += y[j] * L[i][j];\n }\n y[i] = b[i] - total;\n }\n\n Vector x(n);\n for (int i = n-1; i >= 0; --i) {\n double total = 0;\n for (int j = n-1; j > i; --j) {\n total += U[i][j] * x[j];\n }\n x[i] = (y[i] - total) / U[i][i];\n }\n\n return x;\n}\n\nint main()\n{\n while (true) {\n int d; cin >> d;\n if (d == 0) {\n break;\n }\n\n vector<double> v(d+3); cin >> v;\n vector<double> ans(d+3);\n\n for (int m = 0; m < d+3; ++m) {\n\n int check = (d+1+m) % (d+3);\n\n Matrix A = make_v<double>(d+1, d+1);\n for (int i = 0; i <= d; ++i) {\n for (int k = 0; k <= d; ++k) {\n A[i][k] = pow((i+m) % (d+3), k);\n }\n }\n\n Vector b(d+1);\n for (int i = 0; i <= d; ++i) {\n b[i] = v[(i+m) % (d+3)];\n }\n\n Vector a = solve(A, b);\n\n double sum = 0;\n for (int i = 0; i <= d; ++i) {\n sum += a[i] * pow(check, i);\n }\n\n ans[(check+1) % (d+3)] = abs(sum - v[check]);\n }\n\n cout << distance(ans.begin(), min_element(ans.begin(), ans.end())) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.1376,"final_rank":6},{"submission_id":"aoj_1328_3839063","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n\nusing Bool = bool;\nusing Int = long long int;\nusing Real = long double;\ntemplate <class T>\nusing Vector = std::vector<T>;\n\nconstexpr Real EPS = 1e-3;\n\n// pol * (x - d)\nVector<Real> mul(Vector<Real> pol, Real d) {\n pol.insert(pol.begin(), 0);\n for (Int i = 0; i + 1 < pol.size(); ++i) {\n pol[i] -= pol[i + 1] * d;\n }\n return pol;\n}\n\n// pol / d\nVector<Real> divc(Vector<Real> pol, Real d) {\n for (auto& a : pol) a /= d;\n return pol;\n}\n\nVector<Real> add(Vector<Real> pol1, Vector<Real> pol2) {\n for (Int i = 0; i < pol1.size(); ++i) {\n pol1[i] += pol2[i];\n }\n return pol1;\n}\n\nReal apply(const Vector<Real> pol, Real x) {\n Real ret = 0, acc = 1;\n for (auto a : pol) {\n ret += a * acc;\n acc *= x;\n }\n return ret;\n}\n\nBool solve() {\n Int n;\n std::cin >> n;\n if (n == 0) return false;\n\n Vector<Real> v(n + 3);\n for (auto& a : v) std::cin >> a;\n\n for (Int i = 0; i <= n + 1; ++i) {\n // v[i]が偽と仮定\n Vector<Real> res(n + 1, 0);\n\n for (Int j = 0; j <= n + 1; ++j) {\n if (j == i) continue;\n\n Vector<Real> pol(1, v[j]);\n for (Int k = 0; k <= n + 1; ++k) {\n if (k == i || k == j) continue;\n pol = mul(pol, k); // * (x - k)\n pol = divc(pol, j - k); // / (j - k)\n }\n res = add(res, pol);\n }\n\n Real err = apply(res, Real(n + 2)) - v[n + 2];\n if (std::abs(err) < EPS) {\n std::cout << i << std::endl;\n return true;\n }\n }\n\n std::cout << n + 2 << std::endl;\n return true;\n}\n\nint main() {\n while (solve()) {}\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3164,"score_of_the_acc":-0.0642,"final_rank":2},{"submission_id":"aoj_1328_3814750","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n#pragma warning (disable: 4996)\n\nlong double Gauss(vector<vector<long double>>a, vector<long double>b) {\n\tint N = a.size();\n\tif (N == 1) return b[0] / a[0][0];\n\n\tvector<vector<long double>> c = a;\n\tvector<long double> d = b;\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) c[i][j] = a[i][j] / a[i][0];\n\t\td[i] = b[i] / a[i][0];\n\t}\n\n\tvector<vector<long double>> e(N - 1, vector<long double>(N - 1, 0));\n\tvector<long double> f(N - 1, 0);\n\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tfor (int j = 0; j < N - 1; j++) {\n\t\t\te[i][j] = c[i + 1][j + 1] - c[i][j + 1];\n\t\t}\n\t\tf[i] = d[i + 1] - d[i];\n\t}\n\n\treturn Gauss(e, f);\n}\n\nvector<long double> Gauss_Erase(vector<vector<long double>> e, vector<long double>f) {\n\tint N = e.size(); vector<long double> res;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tlong double T = Gauss(e, f);\n\t\tres.push_back(T);\n\t\t\n\t\tvector<vector<long double>> a(e.size() - 1, vector<long double>(e.size() - 1, 0));\n\t\tvector<long double> b(e.size() - 1, 0);\n\t\t\n\t\tfor (int j = 0; j < N - 1 - i; j++) {\n\t\t\tfor (int k = 0; k < N - 1 - i; k++) a[j][k] = e[j][k];\n\t\t\tb[j] = f[j] - T * e[j][e.size() - 1];\n\t\t}\n\t\te = a;\n\t\tf = b;\n\t}\n\n\treverse(res.begin(), res.end());\n\treturn res;\n}\n\nvector<long double> getans(vector<pair<long double, long double>> J) {\n\tint N = J.size();\n\tvector<vector<long double>> a(N, vector<long double>(N, 0));\n\tvector<long double> b(N, 0);\n\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) a[i][j] = 1.0L * pow(J[i].first, 1.0L*(N - 1 - j));\n\t\tb[i] = J[i].second;\n\t}\n\t\n\tvector<long double> ret = Gauss_Erase(a, b);\n\treturn ret;\n}\n\nbool different(vector<long double> A, vector<long double> B) {\n\tfor (int i = 0; i < A.size(); i++) {\n\t\tif (fabs(A[i] - B[i]) > 1e-2) return true;\n\t}\n\treturn false;\n}\n\nint solve(vector<long double> S) {\n\tint N = S.size() - 3;\n\tfor (int i = 0; i <= N + 2; i++) {\n\t\tvector<long double> goal; bool flag = false;\n\t\tfor (int j = 0; j <= N + 2; j++) {\n\t\t\tif (i == j) continue;\n\t\t\tvector<pair<long double, long double>> G;\n\t\t\tfor (int k = 0; k <= N + 2; k++) {\n\t\t\t\tif (k != i && k != j) G.push_back(make_pair(1.0L * k + 1.0L, S[k]));\n\t\t\t}\n\t\t\tvector<long double> V = getans(G);\n\t\t\tif (goal.size() == 0) goal = V;\n\t\t\telse if (different(goal, V) == true) flag = true;\n\t\t}\n\t\tif (flag == false) return i;\n\t}\n\treturn -1;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N; cin >> N; if (N == 0) break;\n\t\tvector<long double> A(N + 3, 0);\n\t\tfor (int i = 0; i < N + 3; i++) cin >> A[i];\n\n\t\tint ans = solve(A);\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3456,"score_of_the_acc":-1.3991,"final_rank":19},{"submission_id":"aoj_1328_3435542","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\n// Gauss Jordan\nusing D = long double;\nconst D EPS = 1e-5;\ntemplate<class T> struct Matrix {\n vector<vector<T> > val;\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\n size_t size() const {return val.size();}\n inline vector<T>& operator [] (int i) {return val[i];}\n};\n\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\n int m = A.size(), n = A[0].size();\n int rank = 0;\n for (int col = 0; col < n; ++col) {\n if (is_extended && col == n-1) break;\n int pivot = -1;\n T ma = EPS;\n for (int row = rank; row < m; ++row) {\n if (abs(A[row][col]) > ma) {\n ma = abs(A[row][col]);\n pivot = row;\n }\n }\n if (pivot == -1) continue;\n swap(A[pivot], A[rank]);\n auto fac = A[rank][col];\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\n for (int row = 0; row < m; ++row) {\n if (row != rank && abs(A[row][col]) > EPS) {\n auto fac = A[row][col];\n for (int col2 = 0; col2 < n; ++col2) {\n A[row][col2] -= A[rank][col2] * fac;\n }\n }\n }\n ++rank;\n }\n return rank;\n}\n\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\n int m = A.size(), n = A[0].size();\n Matrix<T> M(m, n + 1);\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\n M[i][n] = b[i];\n }\n int rank = GaussJordan(M, true);\n vector<T> res;\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\n res.assign(n, 0);\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\n return res;\n}\n\n\n\n\nD pow(D a, int n) {\n D res = 1.0;\n for (int i = 0; i < n; ++i) res *= a;\n return res;\n}\n\nD func(const vector<D> &coef, int i) {\n D res = 0.0;\n for (int p = 0; p < coef.size(); ++p) res += coef[p] * pow(i, p);\n return res;\n}\n\nint main() {\n int d;\n while (cin >> d, d) {\n vector<D> v(d+3);\n for (int i = 0; i < d+3; ++i) cin >> v[i];\n\n int res = 0;\n for (int i = 0; i < d+3; ++i) {\n for (int j = i+1; j < d+3; ++j) {\n Matrix<D> A(d+1, d+1);\n vector<D> b(d+1);\n for (int k = 0, iter = 0; k < d+3; ++k) {\n if (k == i || k == j) continue;\n for (int p = 0; p < d+1; ++p) {\n A[iter][p] = pow(k, p);\n b[iter] = v[k];\n }\n ++iter;\n }\n vector<D> ans = linear_equation(A, b);\n if (ans.empty()) continue;\n D vi = func(ans, i), vj = func(ans, j);\n int num = 0;\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\n if (num == 1) goto end;\n }\n }\n end:\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3172,"score_of_the_acc":-0.0734,"final_rank":3},{"submission_id":"aoj_1328_3435541","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <algorithm>\nusing namespace std;\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\n\n// Gauss Jordan\nusing D = long double;\nconst D EPS = 1e-5;\ntemplate<class T> struct Matrix {\n vector<vector<T> > val;\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\n size_t size() const {return val.size();}\n inline vector<T>& operator [] (int i) {return val[i];}\n};\n\ntemplate<class T> ostream& operator << (ostream& s, Matrix<T> A) {\n s << endl; \n for (int i = 0; i < A.size(); ++i) {\n for (int j = 0; j < A[i].size(); ++j) {\n s << A[i][j] << \", \";\n }\n s << endl;\n }\n return s;\n}\n\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\n int m = A.size(), n = A[0].size();\n int rank = 0;\n for (int col = 0; col < n; ++col) {\n if (is_extended && col == n-1) break;\n int pivot = -1;\n T ma = EPS;\n for (int row = rank; row < m; ++row) {\n if (abs(A[row][col]) > ma) {\n ma = abs(A[row][col]);\n pivot = row;\n }\n }\n if (pivot == -1) continue;\n swap(A[pivot], A[rank]);\n auto fac = A[rank][col];\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\n for (int row = 0; row < m; ++row) {\n if (row != rank && abs(A[row][col]) > EPS) {\n auto fac = A[row][col];\n for (int col2 = 0; col2 < n; ++col2) {\n A[row][col2] -= A[rank][col2] * fac;\n }\n }\n }\n ++rank;\n }\n return rank;\n}\n\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\n int m = A.size(), n = A[0].size();\n Matrix<T> M(m, n + 1);\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\n M[i][n] = b[i];\n }\n int rank = GaussJordan(M, true);\n vector<T> res;\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\n res.assign(n, 0);\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\n return res;\n}\n\n\n\n\nD pow(D a, int n) {\n D res = 1.0;\n for (int i = 0; i < n; ++i) res *= a;\n return res;\n}\n\nD func(const vector<D> &coef, int i) {\n D res = 0.0;\n for (int p = 0; p < coef.size(); ++p) res += coef[p] * pow(i, p);\n return res;\n}\n\nint main() {\n int d;\n while (cin >> d, d) {\n vector<D> v(d+3);\n for (int i = 0; i < d+3; ++i) cin >> v[i];\n\n int res = 0;\n for (int i = 0; i < d+3; ++i) {\n for (int j = i+1; j < d+3; ++j) {\n Matrix<D> A(d+1, d+1);\n vector<D> b(d+1);\n for (int k = 0, iter = 0; k < d+3; ++k) {\n if (k == i || k == j) continue;\n for (int p = 0; p < d+1; ++p) {\n A[iter][p] = pow(k, p);\n b[iter] = v[k];\n }\n ++iter;\n }\n vector<D> ans = linear_equation(A, b);\n if (ans.empty()) continue;\n D vi = func(ans, i), vj = func(ans, j);\n int num = 0;\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\n if (num == 1) goto end;\n }\n }\n end:\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3160,"score_of_the_acc":-0.0596,"final_rank":1},{"submission_id":"aoj_1328_3338746","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\nusing ld = long double;\n\ntemplate <class T>\nvector<T> solve(const vector<vector<T>> &A, const vector<T> &y) {\n int N = y.size();\n vector<T> x(N, 0);\n vector<vector<T>> tmp(N, vector<T>(N * 2, 0));\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n tmp[i][j] = A[i][j];\n for (int i = 0; i < N; i++)\n tmp[i][N + i] = 1;\n \n for (int i = 0; i < N; i++) {\n if (tmp[i][i] == 0) tmp[i][i] += 1e-10;\n T sc = tmp[i][i];\n for (int k = 0; k < N * 2; k++)\n tmp[i][k] /= sc;\n for (int j = 0; j < N; j++) {\n if (i == j) continue;\n sc = tmp[j][i];\n for (int k = 0; k < N * 2; k++) {\n tmp[j][k] -= tmp[i][k] * sc;\n }\n }\n }\n\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n x[i] += tmp[i][N + j] * y[j];\n }\n }\n return x;\n}\n\nsigned main() {\n while (1) {\n int d;\n cin >> d;\n if (d == 0) break;\n vector<ld> v(d + 3);\n for (int i = 0; i < d + 3; i++) {\n cin >> v[i];\n }\n \n for (int i = 0; i < d + 3; i++) {\n for (int l = i + 1; l < d + 3; l++) {\n vector<ld> y;\n y.reserve(d + 2);\n auto p = y;\n for (int j = 0; j < d + 3; j++) {\n if (i == j || l == j) continue;\n y.push_back(v[j]);\n p.push_back(j);\n }\n vector<vector<ld>> A(d + 1, vector<ld>(d + 1, 0));\n for (int j = 0; j < d + 1; j++) {\n ld x = p[j];\n for (ld k = 0; k < d + 1; k++) {\n A[j][k] = pow(x, k);\n }\n }\n \n auto value = [&](const vector<ld> &c, ld p) {\n ld ret = 0;\n for (int k = 0; k < c.size(); k++) {\n ret += c[k] * pow(p, k);\n }\n return ret;\n };\n\n auto c = solve(A, y);\n\n int cnt = 0;\n int idx = 0;\n for (int j = 0; j < d + 3; j++) {\n if (abs(value(c, j) - v[j]) > 1e-4) {\n cnt++;\n idx = j;\n }\n }\n if (cnt == 1) {\n cout << idx << endl;\n goto next_case;\n }\n }\n }\n next_case:;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3420,"score_of_the_acc":-0.3578,"final_rank":12},{"submission_id":"aoj_1328_3321821","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int ui;\nconst ll mod = 998244353;\nconst ll INF = (ll)1000000007 * 1000000007;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef long double ld;\ntypedef complex<ld> Point;\nconst ld eps = 1e-3;\nconst ld pi = acos(-1.0);\ntypedef pair<ll, ll> LP;\ntypedef pair<ld, ld> LDP;\n\ntypedef vector<ld> vec;\ntypedef vector<vec> mat;\nvoid debag_matrix(const mat &A) {\n\trep(i, A.size()) {\n\t\trep(j, A[i].size()){\n\t\t\tcout << A[i][j] << \" \";\n\t }\n\t\tcout << endl;\n\t}\n}\nvoid gauss_hakidasi(mat &A) {\n\tint n = A.size(), m = A[0].size();\n\tint t = min(n, m);\n\trep(k, t) {\n\t\tint chk = -1;\n\t\tRep(i,k, n) {\n\t\t\tif (abs(A[i][k]) > eps) {\n\t\t\t\tchk = i; break;\n\t\t\t}\n\t\t}\n\t\tif (chk < 0)return;\n\t\tswap(A[k], A[chk]);\n\t\tld x = A[k][k];\n\t\trep(i, m) {\n\t\t\tA[k][i] /= x;\n\t\t}\n\t\trep(i, n) {\n\t\t\tif (i == k)continue;\n\t\t\tx = A[i][k];\n\t\t\trep(j, m) {\n\t\t\t\tA[i][j] -= x * A[k][j];\n\t\t\t}\n\t\t}\n\t}\n}\nint n;\nld d[10];\n\nbool valid(int id, mat A) {\n\tgauss_hakidasi(A);\n\t//debag_matrix(A);\n\tld sum = 0;\n\tld cur = 1;\n\tper(i, n + 1) {\n\t\tsum += A[i][n+1] * cur; cur *= id;\n\t}\n\treturn abs(sum - d[id]) < eps;\n}\nint main() {\n\twhile (cin >> n, n) {\n\t\trep(i, n + 3)cin >> d[i];\n\t\trep(i, n + 3) {\n\t\t\tmat A; int ck = 0;\n\t\t\tper(j, n + 3) {\n\t\t\t\tif (i == j)continue;\n\t\t\t\tvector<ld> v;\n\t\t\t\tld cur = 1;\n\t\t\t\trep(k, n + 1) {\n\t\t\t\t\tv.push_back(cur);\n\t\t\t\t\tcur *= j;\n\t\t\t\t}\n\t\t\t\treverse(v.begin(), v.end());\n\t\t\t\tv.push_back(d[j]);\n\t\t\t\tif (A.size() < n + 1)A.push_back(v);\n\t\t\t\telse ck = j;\n\t\t\t}\n\t\t\t//debag_matrix(A);\n\t\t\t//cout << ck << endl;\n\t\t\tif (valid(ck, A)) {\n\t\t\t\tcout << i << endl; break;\n\t\t\t}\n\n\t\t}\n\t\t//cout << \"finish\" << endl;\n\t}\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3284,"score_of_the_acc":-0.2018,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_1328_10496662\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint d;\\ndouble a[1003][1004];\\ndouble k[20005];\\nbool solve(){\\n//\\tfor(int i=1;i<=d+3;i++){\\n\\t////\\tfor(int j=1;j<=d+2;j++){\\n\\t//\\t\\tcout<<a[i][j]<<\\\" \\\";\\n\\t//\\t}\\n\\t//\\tcout<<endl;\\n\\t//}\\n\\tint n=d+1,m=d+2;\\n\\t\\n\\t/*for(int i=1;i<=n;i++){\\n\\t\\tint maxx=i;\\n\\t\\tfor(int j=i+1;j<=n;j++){\\n\\t\\t\\tif(fabs(a[j][i])>fabs(a[maxx][i])){\\n\\t\\t\\t\\tmaxx=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(fabs(a[maxx][i])>1e-4) swap(a[i],a[maxx]);\\n\\t\\telse continue;\\n\\t\\tfor(int j=n+1;j>=i;j--) a[i][j]/=a[i][i]; \\n\\t\\tfor(int j=1;j<=n+1;j++){\\n\\t\\t\\tif(j==i) continue;\\n\\t\\t\\tfor(int k=n+1;k>=i;k--){\\n\\t\\t\\t\\ta[j][k]-=a[j][i]*a[i][k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}*/\\n\\tint line=1;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\tint id=line;\\n\\t\\tfor(int j=id+1;j<=m;j++){\\n\\t\\t\\tif(fabs(a[j][i])>fabs(a[id][i])){\\n\\t\\t\\t\\tid=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(fabs(a[id][i])>1e-10) swap(a[line],a[id]);\\n\\t\\telse continue;\\n\\t\\tfor(int j=n+1;j>=i;j--) a[line][j]/=a[line][i];\\n\\t\\tfor(int j=1;j<=m;j++){\\n\\t\\t\\tif(line==j){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t} \\n\\t\\t\\tfor(int k=n+1;k>=i;k--) a[j][k]-=a[j][i]*a[line][k];\\n\\t\\t}\\n\\t\\tline++;\\n\\t}\\n//\\tcout<<\\\"x: \\\"<<\\\"\\\\n\\\";\\n//\\tfor(int i=1;i<=d+3;i++){\\n//\\t\\tfor(int j=1;j<=d+2;j++){\\n//\\t\\t\\tcout<<a[i][j]<<\\\" \\\";\\n//\\t\\t}\\n//\\t\\tcout<<endl;\\n//\\t}\\n//\\tcout<<a[d+2][d+2]<<endl;\\n\\tfor(int i=line;i<=m;i++) {\\n\\t\\tif(fabs(a[i][n+1])>1e-5){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n\\n}\\nint power(int c,int b){\\n\\tint res=1;\\n\\twhile(b){\\n\\t\\tif(b&1){\\n\\t\\t\\tres=res*c;\\n\\t\\t}\\n\\t\\tc=c*c;\\n\\t\\tb>>=1;\\n\\t}\\n\\treturn res;\\n}\\nsigned main(){\\n\\twhile(cin>>d){\\n\\t\\tif(!d) break;\\n\\t\\telse{\\n\\t\\t\\t\\n\\t\\t\\tfor(int i=1;i<=d+3;i++){\\n\\t\\t\\t\\tcin>>k[i];\\n\\t\\t\\t\\t//cin>>a[i][d+2];\\n\\t\\t\\t\\tfor(int j=1;j<=d;j++) a[i][j]=i;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=1;i<=d+3;i++){\\n\\t\\t\\t\\tfor(int j=1;j<=d+3;j++){\\n\\t\\t\\t\\t\\tfor(int p=1;p<=d+2;p++) a[j][p]=(p==d+2)?k[j]:power(j-1,d+1-p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int j=i;j<=d+2;j++) swap(a[j],a[j+1]);\\n\\t\\t\\t//cout<<\\\"x \\\"<<i<<endl;\\n\\t\\t\\t\\tif(solve()){\\n\\t\\t\\t\\t\\tcout<<i-1<<endl;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n/*\\n2\\n1.0\\n4.0\\n12.0\\n16.0\\n25.0\\n1\\n-30.5893962764\\n5.76397083962\\n39.3853798058\\n74.3727663177\\n4\\n42.4715310246\\n79.5420238202\\n28.0282396675\\n-30.3627807522\\n-49.8363481393\\n-25.5101480106\\n7.58575761381\\n5\\n-21.9161699038\\n-48.469304271\\n-24.3188578417\\n-2.35085940324\\n-9.70239202086\\n-47.2709510623\\n-93.5066246072\\n-82.5073836498\\n0\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.4358,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1328_10036047\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <typename T>\\nstruct mat {\\n\\tint n, m;\\n\\tvector<vector<T>> a;\\n\\tmat(int n_, int m_) : n(n_), m(m_), a(n_, vector<T>(m_)) {}\\n};\\ntemplate <typename T>\\nvector<T> solveLSE(mat<T> a, vector<T> b) { // ax=b\\n\\tassert(a.n == b.size() && a.m == b.size());\\n\\tint n = a.n;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tint p = i;\\n\\t\\tfor (int j = p; j < n; j++) {\\n\\t\\t\\tif (a.a[i][j] > a.a[i][p]) p = j;\\n\\t\\t}\\n\\t\\tswap(a.a[i], a.a[p]);\\n\\t\\tswap(b[i], b[p]);\\n\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\tif (j != i) a.a[i][j] /= a.a[i][i];\\n\\t\\t}\\n\\t\\tb[i] /= a.a[i][i];\\n\\t\\ta.a[i][i] = 1;\\n\\t\\tfor (int k = 0; k < n; k++) {\\n\\t\\t\\tif (i == k) continue;\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (j != i) a.a[k][j] -= a.a[i][j] * a.a[k][i];\\n\\t\\t\\t}\\n\\t\\t\\tb[k] -= b[i] * a.a[k][i];\\n\\t\\t\\ta.a[k][i] = 0;\\n\\t\\t}\\n\\t}\\n\\treturn b;\\n}\\nint main() {\\n\\tmt19937 mt(time(NULL));\\n\\twhile (1) {\\n\\t\\tint d;\\n\\t\\tcin >> d;\\n\\t\\tif (d == 0) break;\\n\\t\\tuniform_int_distribution<int> rd(0, d + 2);\\n\\t\\tvector<double> v(d + 3);\\n\\t\\tfor (int i = 0; i < d + 3; i++) {\\n\\t\\t\\tcin >> v[i];\\n\\t\\t}\\n\\t\\tint ans = -1;\\n\\t\\tdouble bestscore = 1e100;\\n\\t\\tfor (int igni = 0; igni < d + 3; igni++) {\\n\\t\\t\\tmat<double> a(d + 1, d + 1);\\n\\t\\t\\tvector<int> idx;\\n\\t\\t\\tfor (int i = 0; i < d + 3; i++) {\\n\\t\\t\\t\\tif (i == igni) continue;\\n\\t\\t\\t\\tidx.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tshuffle(idx.begin(), idx.end(), mt);\\n\\t\\t\\tidx.pop_back();\\n\\t\\t\\tvector<double> b(d + 1);\\n\\t\\t\\t{\\n\\t\\t\\t\\tint i = 0;\\n\\t\\t\\t\\tfor (int ri : idx) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j < d + 1; j++) {\\n\\t\\t\\t\\t\\t\\ta.a[i][j] = pow(ri, j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tb[i] = v[ri];\\n\\t\\t\\t\\t\\ti++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tauto res = solveLSE(a, b);\\n\\t\\t\\tassert(res.size() == d + 1);\\n\\t\\t\\tauto f = [&](int x) {\\n\\t\\t\\t\\tdouble r = 0;\\n\\t\\t\\t\\tfor (int j = 0; j <= d; j++) {\\n\\t\\t\\t\\t\\tr += res[j] * pow(x, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn r;\\n\\t\\t\\t};\\n\\t\\t\\tdouble igerror = 0, nomerror = 0;\\n\\t\\t\\tfor (int i = 0; i < d + 3; i++) {\\n\\t\\t\\t\\tif (i == igni) {\\n\\t\\t\\t\\t\\tigerror += abs(f(i) - v[i]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnomerror += abs(f(i) - v[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdouble score = nomerror / igerror;\\n\\t\\t\\tif (bestscore > score) {\\n\\t\\t\\t\\t// for (int i = 0; i < d + 1; i++) {\\n\\t\\t\\t\\t// \\tcerr << res[i] << \\\" \\\";\\n\\t\\t\\t\\t// }\\n\\t\\t\\t\\t// cerr << endl;\\n\\t\\t\\t\\tbestscore = score;\\n\\t\\t\\t\\tans = igni;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.9083,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1328_8740978\",\n \"code_snippet\": \"//\\n// 実数行列 (行列累乗と、掃き出し法)\\n//\\n// verified:\\n// AOJ 2171 Strange Couple\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2171\\n//\\n// AOJ 1328 Find the Outlier\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1328\\n//\\n\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n// basic settings\\nlong double EPS = 1e-10; // to be set appropriately\\n\\n// matrix\\ntemplate<class T> struct Matrix {\\n // inner value\\n vector<vector<T>> val;\\n \\n // constructors\\n Matrix(int H, int W, T x = 0) : val(H, vector<T>(W, x)) {}\\n Matrix(const Matrix &mat) : val(mat.val) {}\\n void init(int H, int W, T x = 0) {\\n val.assign(H, vector<T>(W, x));\\n }\\n void resize(int H, int W) {\\n val.resize(H);\\n for (int i = 0; i < H; ++i) val[i].resize(W);\\n }\\n \\n // getter and debugger\\n constexpr int height() const { return (int)val.size(); }\\n constexpr int width() const { return (int)val[0].size(); }\\n vector<T>& operator [] (int i) { return val[i]; }\\n constexpr vector<T>& operator [] (int i) const { return val[i]; }\\n friend constexpr ostream& operator << (ostream &os, const Matrix<T> &mat) {\\n os << endl;\\n for (int i = 0; i < mat.height(); ++i) {\\n for (int j = 0; j < mat.width(); ++j) {\\n if (j) os << \\\", \\\";\\n os << mat.val[i][j];\\n }\\n os << endl;\\n }\\n return os;\\n }\\n \\n // comparison operators\\n constexpr bool operator == (const Matrix &r) const {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Matrix &r) const {\\n return this->val != r.val;\\n }\\n \\n // arithmetic operators\\n constexpr Matrix& operator += (const Matrix &r) {\\n assert(height() == r.height());\\n assert(width() == r.width());\\n for (int i = 0; i < height(); ++i) {\\n for (int j = 0; j < width(); ++j) {\\n val[i][j] += r[i][j];\\n }\\n }\\n return *this;\\n }\\n constexpr Matrix& operator -= (const Matrix &r) {\\n assert(height() == r.height());\\n assert(width() == r.width());\\n for (int i = 0; i < height(); ++i) {\\n for (int j = 0; j < width(); ++j) {\\n val[i][j] -= r[i][j];\\n }\\n }\\n return *this;\\n }\\n constexpr Matrix& operator *= (T v) {\\n for (int i = 0; i < height(); ++i)\\n for (int j = 0; j < width(); ++j)\\n val[i][j] *= v;\\n return *this;\\n }\\n constexpr Matrix& operator *= (const Matrix &r) {\\n assert(width() == r.height());\\n Matrix<T> res(height(), r.width());\\n for (int i = 0; i < height(); ++i)\\n for (int j = 0; j < r.width(); ++j)\\n for (int k = 0; k < width(); ++k)\\n res[i][j] += val[i][k] * r[k][j];\\n return (*this) = res;\\n }\\n constexpr Matrix operator + () const { return Matrix(*this); }\\n constexpr Matrix operator - () const { return Matrix(*this) *= T(-1); }\\n constexpr Matrix operator + (const Matrix &r) const { return Matrix(*this) += r; }\\n constexpr Matrix operator - (const Matrix &r) const { return Matrix(*this) -= r; }\\n constexpr Matrix operator * (T v) const { return Matrix(*this) *= v; }\\n constexpr Matrix operator * (const Matrix &r) const { return Matrix(*this) *= r; }\\n \\n // pow\\n constexpr Matrix pow(long long n) const {\\n assert(height() == width());\\n Matrix<T> res(height(), width()), mul(*this);\\n while (n > 0) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend constexpr Matrix<T> pow(const Matrix<T> &mat, long long n) {\\n return mat.pow(n);\\n }\\n \\n // gauss-jordan\\n constexpr int find_pivot(int cur_rank, int col) const {\\n int pivot = -1;\\n T max_v = EPS;\\n for (int row = cur_rank; row < height(); ++row) {\\n if (abs(val[row][col]) > max_v) {\\n max_v = abs(val[row][col]);\\n pivot = row;\\n }\\n }\\n return pivot;\\n }\\n constexpr void sweep(int cur_rank, int col, int pivot) {\\n swap(val[pivot], val[cur_rank]);\\n auto fac = val[cur_rank][col];\\n for (int col2 = 0; col2 < width(); ++col2) {\\n val[cur_rank][col2] /= fac;\\n }\\n for (int row = 0; row < height(); ++row) {\\n if (row != cur_rank && abs(val[row][col]) > EPS) {\\n auto fac = val[row][col];\\n for (int col2 = 0; col2 < width(); ++col2) {\\n val[row][col2] -= val[cur_rank][col2] * fac;\\n }\\n }\\n }\\n }\\n constexpr int gauss_jordan(int not_sweep_width = 0) {\\n int rank = 0;\\n for (int col = 0; col < width(); ++col) {\\n if (col == width() - not_sweep_width) break;\\n int pivot = find_pivot(rank, col);\\n if (pivot == -1) continue;\\n sweep(rank++, col, pivot);\\n }\\n return rank;\\n }\\n friend constexpr int gauss_jordan(Matrix<T> &mat, int not_sweep_width = 0) {\\n return mat.gauss_jordan(not_sweep_width);\\n }\\n friend constexpr vector<T> linear_equation(const Matrix<T> &mat, const vector<T> &b) {\\n // extend\\n Matrix<T> A(mat.height(), mat.width() + 1);\\n for (int i = 0; i < mat.height(); ++i) {\\n for (int j = 0; j < mat.width(); ++j) A[i][j] = mat.val[i][j];\\n A[i].back() = b[i];\\n }\\n int rank = A.gauss_jordan(1);\\n \\n // check if it has no solution\\n vector<T> res;\\n for (int row = rank; row < mat.height(); ++row)\\n if (abs(A[row].back()) > EPS)\\n return res;\\n\\n // answer\\n res.assign(mat.width(), 0);\\n for (int i = 0; i < rank; ++i) res[i] = A[i].back();\\n return res;\\n }\\n};\\n\\n\\n\\n/*/////////////////////////////*/\\n// Examples\\n/*/////////////////////////////*/\\n\\nvoid AOJ_2171() {\\n int N, s, t;\\n while (cin >> N >> s >> t, N) {\\n --s, --t;\\n vector<int> q(N);\\n vector<vector<int>> a(N, vector<int>(N));\\n for (int i = 0; i < N; ++i) cin >> q[i];\\n for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) cin >> a[i][j];\\n\\n // Dijkstra\\n const int INF = 1<<29;\\n vector<int> dist(N, INF);\\n vector<bool> seen(N, 0);\\n dist[t] = 0;\\n for (int iter = 0; iter < N; ++iter) {\\n int curd = INF;\\n int v = -1;\\n for (int i = 0; i < N; ++i) {\\n if (seen[i]) continue;\\n if (curd > dist[i]) {\\n curd = dist[i];\\n v = i;\\n }\\n }\\n if (v == -1) break;\\n for (int w = 0; w < N; ++w) {\\n if (w == v) continue;\\n if (a[v][w] == 0) continue;\\n dist[w] = min(dist[w], curd + a[v][w]);\\n }\\n seen[v] = true;\\n }\\n if (dist[s] >= INF) {\\n cout << \\\"impossible\\\" << endl;\\n return;\\n }\\n\\n // 連立一次方程式を作る\\n Matrix<double> A(N, N, 0);\\n vector<double> b(N, 0);\\n for (int v = 0; v < N; ++v) {\\n if (v == t) {\\n A[v][v] = 1;\\n b[v] = 0;\\n }\\n else {\\n vector<int> neigbor;\\n for (int w = 0; w < N; ++w) {\\n if (a[v][w] == 0) continue;\\n if (q[v] == 1 && dist[w] + a[v][w] != dist[v]) continue;\\n neigbor.push_back(w);\\n }\\n int K = neigbor.size();\\n for (auto w : neigbor) {\\n A[v][w] -= 1;\\n b[v] += a[v][w];\\n }\\n A[v][v] += K;\\n }\\n }\\n \\n // 解く\\n auto res = linear_equation(A, b);\\n if (res.empty()) cout << \\\"impossible\\\" << endl;\\n else cout << fixed << setprecision(15) << res[s] << endl;\\n }\\n}\\n\\nvoid AOJ_1328() {\\n using D = long double;\\n EPS = 1e-5; // set EPS\\n \\n auto dpow = [&](D a, int n) -> D {\\n D res = 1.0;\\n for (int i = 0; i < n; ++i) res *= a;\\n return res;\\n };\\n auto func = [&](const vector<D> &coef, int i) -> D {\\n D res = 0.0;\\n for (int p = 0; p < (int)coef.size(); ++p)\\n res += coef[p] * pow(i, p);\\n return res;\\n };\\n \\n int d;\\n while (cin >> d, d) {\\n vector<D> v(d + 3);\\n for (int i = 0; i < d + 3; ++i) cin >> v[i];\\n\\n bool finish = false;\\n int res = 0;\\n for (int i = 0; i < d + 3 && !finish; ++i) {\\n for (int j = i + 1; j < d + 3 && !finish; ++j) {\\n Matrix<D> A(d + 1, d + 1);\\n vector<D> b(d + 1);\\n for (int k = 0, iter = 0; k < d+3; ++k) {\\n if (k == i || k == j) continue;\\n for (int p = 0; p < d + 1; ++p) {\\n A[iter][p] = pow(k, p);\\n b[iter] = v[k];\\n }\\n ++iter;\\n }\\n vector<D> ans = linear_equation(A, b);\\n if (ans.empty()) continue;\\n D vi = func(ans, i), vj = func(ans, j);\\n int num = 0;\\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\\n if (num == 1) goto end;\\n }\\n }\\n end:\\n cout << res << endl;\\n }\\n}\\n\\n\\nint main() {\\n //AOJ_2171();\\n AOJ_1328();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.8394,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1328_7233740\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ld = long double;\\nusing point = pair<ld,ld>;\\n\\nld compute(const vector<point>& points, const ld& x) {\\n int n = points.size();\\n\\n vector<ld> vals;\\n for (int i = 0; i < n; i++) {\\n ld val = points[i].second;\\n\\n for (int j = 0; j < n; j++) {\\n if(i == j)continue;\\n val *= (x - points[j].first);\\n val /= (points[i].first - points[j].first);\\n }\\n\\n vals.push_back(val);\\n }\\n sort(vals.begin(),vals.end());\\n\\n return accumulate(vals.begin(),vals.end(), 0.0l);\\n}\\n\\nvoid solve(int d) {\\n ld v[d + 3];\\n for (int i = 0; i < d + 3; i++) {\\n cin >> v[i];\\n }\\n\\n vector<pair<ld,int>> diffs;\\n\\n for (int exclude = 0; exclude < d + 3; exclude++) {\\n vector<point> points;\\n for (int i = 0; i < d + 3; i++) {\\n if(i == exclude) continue;\\n points.emplace_back(i, v[i]);\\n }\\n\\n random_shuffle(points.begin(), points.end());\\n points.resize(d + 1);\\n\\n ld diff = 0.0l;\\n for (int i = 0; i < d + 3; i++) {\\n if(i == exclude) continue;\\n diff += powl(compute(points, i) - v[i], 2.0l);\\n }\\n diffs.emplace_back(diff, exclude);\\n }\\n\\n sort(diffs.begin(), diffs.end());\\n cout << diffs.front().second << endl;\\n}\\n\\nint main() {\\n int d;\\n while(true) {\\n cin >> d;\\n if(d == 0) break;\\n solve(d);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.2523,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1328_5491188\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define Inf 1000000001\\n\\ndouble eps = 1e-2;\\nvector<double> add(vector<double> a,vector<double> b){\\n\\tvector<double> c(max((int)a.size(),(int)b.size()),0.0);\\n\\trep(i,a.size())c[i] += a[i];\\n\\trep(i,b.size())c[i] += b[i];\\n\\treturn c;\\n}\\n\\nvector<double> mul(vector<double> a,vector<double> b){\\n\\tvector<double> c(a.size()+b.size()-1,0.0);\\n\\trep(i,a.size()){\\n\\t\\trep(j,b.size()){\\n\\t\\t\\tc[i+j] += a[i]*b[j];\\n\\t\\t}\\n\\t}\\n\\treturn c;\\n}\\n\\ndouble get(vector<double> a,double x){\\n\\tdouble ret = 0.0;\\n\\trep(i,a.size()){\\n\\t\\tret += pow(x,i) * a[i];\\n\\t}\\n\\treturn ret;\\n}\\n\\nvector<double> Find(vector<double> x,vector<double> y){\\n\\tvector<double> ret;\\n\\t\\n\\trep(i,x.size()){\\n\\t\\tvector<double> t(1,1.0);\\n\\t\\trep(j,x.size()){\\n\\t\\t\\tif(i==j)continue;\\n\\t\\t\\tt = mul(t,{-x[j],1.0});\\n\\t\\t}\\n\\t\\tdouble A = y[i];\\n\\t\\tA /= get(t,x[i]);\\n\\t\\tt = mul(t,{A});\\n\\t\\tret = add(ret,t);\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\t\\n\\twhile(true){\\n\\t\\tint d;\\n\\t\\tcin>>d;\\n\\t\\tif(d==0)break;\\n\\t\\tvector<double> v(d+3);\\n\\t\\trep(i,d+3)cin>>v[i];\\n\\t\\t\\n\\t\\tint ans = -1;\\n\\t\\trep(i,d+3){\\n\\t\\t\\trep(j,d+3){\\n\\t\\t\\t\\tif(i==j)continue;\\n\\t\\t\\t\\tvector<double> x,y;\\n\\t\\t\\t\\trep(k,d+3){\\n\\t\\t\\t\\t\\tif(i==k||j==k)continue;\\n\\t\\t\\t\\t\\tx.push_back(k);\\n\\t\\t\\t\\t\\ty.push_back(v[k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tauto ret = Find(x,y);\\n\\t\\t\\t\\tbool f0 = true,f1 = true;\\n\\t\\t\\t\\tif(abs(get(ret,i)-v[i])<eps)f0=false;\\n\\t\\t\\t\\tif(abs(get(ret,j)-v[j])<eps)f1=false;\\n\\t\\t\\t\\tif(f0&&f1)continue;\\n\\t\\t\\t\\tif(f0)ans = i;\\n\\t\\t\\t\\telse ans = j;\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout<<ans<<endl;\\n\\t\\t\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3920,\n \"score_of_the_acc\": -1.4766,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1328_4963196\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cmath>\\n#include<ctime>\\n#include<queue>\\n#include<cassert>\\n#include<set>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int> >;\\nusing pii = pair<int, int>;\\nusing ppi = pair<pii, int>;\\n\\ntypedef vector<double> vec;\\ntypedef vector<vec> mat;\\n\\nconst double EPS = 1e-8;\\nvec gauss_jordan(const mat& A, const vec& b){\\n int n = A.size();\\n mat B(n, vec(n + 1));\\n for(int i = 0; i < n; i++)\\n for(int j = 0; j < n; j++) B[i][j] = A[i][j];\\n for(int i = 0; i < n; i++) B[i][n] = b[i];\\n for(int i = 0; i < n; i++){\\n int pivot = i;\\n for(int j = i; j < n; j++){\\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\\n }\\n swap(B[i], B[pivot]);\\n\\n if(abs(B[i][i]) < EPS) return vec();\\n\\n for(int j = i+1; j <= n; j++) B[i][j] /= B[i][i];\\n for(int j = 0; j < n; j++){\\n if(i != j){\\n for(int k = i+1; k <= n; k++) B[j][k] -= B[j][i] * B[i][k];\\n }\\n }\\n }\\n vec x(n);\\n for(int i = 0; i < n; i++) x[i] = B[i][n];\\n return x;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int ti = clock();\\n // start-----------------------------------------------\\n int d;\\n while(cin >> d, d){\\n vec v(d+3);\\n for(int i = 0; i < d+3; i++) cin >> v[i];\\n int ans = 0;\\n mat m(d+3, vec(d+2));\\n for(int i = 0; i < d+3; i++){\\n for(int j = 0; j < d+1; j++) m[i][j] = pow(1.0*i, j);\\n }\\n for(int i = 0; i < d+3; i++){\\n for(int j = i+1; j < d+3; j++){\\n vec b(d+1);\\n mat A(d+1, vec(d+1));\\n for(int k = 0, l = 0; k < d+3; k++)\\n if(i != k && j != k) A[l] = m[k], b[l] = v[k], l++;\\n vec x = gauss_jordan(A, b);\\n double res[2] = {};\\n for(int k = 0; k < d+1; k++){\\n res[0] += x[k] * m[i][k];\\n res[1] += x[k] * m[j][k];\\n }\\n if(abs(res[0] - v[i]) + 1e-5 > 1.0 && abs(res[1] - v[j]) < 1e-5) ans = i;\\n if(abs(res[0] - v[i]) < 1e-5 && abs(res[1] - v[j]) + 1e-5 > 1.0) ans = j;\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n // end-----------------------------------------------\\n // cerr << 1.0 * (clock() - ti) / CLOCKS_PER_SEC << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1328_4954188\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\n#include <iomanip>\\n#include <random>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 510000;\\n// ll dy[8] = {0,-1,0,1,1,-1,-1,1};\\n// ll dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-4;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\ntypedef vector<vector<double>> mat;\\n\\nmat matinv(mat a){\\n int n = a.size();\\n mat b(n,vector<double>(n*2));\\n rep(i,n){\\n rep(j,n){\\n b[i][j] = a[i][j];\\n }\\n }\\n rep(i,n) b[i][n+i] = 1;\\n rep(i,n){\\n int pivot = i;\\n for(int j=i; j<n; j++){\\n if(abs(b[j][i]) > abs(b[pivot][i])) pivot = j;\\n }\\n if(abs(b[pivot][i]) < eps){\\n b.clear();\\n return b;\\n }\\n swap(b[i], b[pivot]);\\n for(int j=i+1; j<2*n; j++) b[i][j] /= b[i][i];\\n rep(j,n){\\n if(i != j){\\n for(int k=i+1; k<2*n; k++) b[j][k] -= b[j][i] * b[i][k];\\n }\\n }\\n }\\n mat ret(n,vector<double>(n));\\n rep(i,n) rep(j,n) ret[i][j] = b[i][n+j];\\n return ret;\\n}\\n\\nmat matmul(mat &a, mat &b){\\n mat c(a.size(), vector<double>(b[0].size()));\\n for(int i=0; i<a.size(); i++){\\n for(int k=0; k<b.size(); k++){\\n for(int j=0; j<b[0].size(); j++){\\n c[i][j] += a[i][k] * b[k][j];\\n }\\n }\\n }\\n return c;\\n}\\n\\nint main(){\\n while(1){\\n int d; cin >> d;\\n if(!d) break;\\n vector<double> f(d+3);\\n rep(i,d+3) cin >> f[i];\\n bool det = false;\\n int ans = -1;\\n rep(i,d+3){\\n rep(j,i){\\n mat a(d+1,vector<double>(d+1));\\n mat b(d+1,vector<double>(1));\\n int id = 0;\\n rep(k,d+3){\\n if(k == j || k == i) continue;\\n b[id][0] = f[k];\\n rep(l,d+1){\\n a[id][l] = pow(k,l);\\n }\\n id++;\\n }\\n // rep(k,d+1){\\n // rep(l,d+1) cout << a[k][l] << \\\" \\\";\\n // cout << \\\"\\\\n\\\";\\n // }\\n mat inv = matinv(a);\\n // rep(k,d+1){\\n // rep(l,d+1) cout << inv[k][l] << \\\" \\\";\\n // cout << \\\"\\\\n\\\";\\n // }\\n // rep(k,d+1) cout << b[k][0] << \\\" \\\";\\n // cout << \\\"\\\\n\\\";\\n // cout << \\\"\\\\n\\\";\\n if(inv.empty()) continue;\\n mat res = matmul(inv,b);\\n auto val = [&](int t) -> double {\\n double ret = 0.0;\\n rep(k,d+1) ret += res[k][0] * pow(t,k);\\n return ret;\\n };\\n // rep(k,d+1) cout << res[k][0] << \\\" \\\";\\n // cout << \\\"\\\\n\\\";\\n bool ff = abs(val(i) - f[i]) > eps;\\n bool gg = abs(val(j) - f[j]) > eps;\\n if(ff != gg){\\n det = true;\\n if(ff) ans = i;\\n else ans = j;\\n break;\\n }\\n }\\n if(det) break;\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.367,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1328_4943483\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-3, PI = acos(-1);\\n//ここから編集\\nbool eq(double a, double b){ return fabs(a-b) < EPS; }\\nlong double lagrange_interpolation(vector<long double> xi, vector<long double> fi, long double x){\\n int n = xi.size()-1;\\n long double ret = 0.0;\\n for(int i=0; i<=n; i++){\\n long double t = 1.0;\\n for(int j=0; j<=n; j++){\\n if(i == j) continue;\\n t *= (x-xi[j])/(xi[i]-xi[j]);\\n }\\n ret += t*fi[i];\\n }\\n return ret;\\n}\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n int d;\\n while(cin >> d, d){\\n\\n vector<long double> v(d+3);\\n vector<long double> x(d+3);\\n REP(i,d+3) {\\n cin >> v[i];\\n x[i] = i;\\n }\\n vector<bool> ok(8, false);\\n int ans = 0;\\n for(int i=0; i<=d+2; i++){\\n for(int j=0; j<=d+2; j++){\\n vector<long double> xi, fi;\\n for(int k=0; k<=d+2; k++){\\n if(i == k || j == k) continue;\\n xi.push_back(k);\\n fi.push_back(v[k]);\\n }\\n if(eq(lagrange_interpolation(xi, fi, i), v[i])) ok[i]=true;\\n if(eq(lagrange_interpolation(xi, fi, j), v[j])) ok[j]=true;\\n }\\n } \\n for(int i=0; i<=d+2; i++) if(!ok[i]) cout << i << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.2239,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1328_4908086\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n//container utill\\n#define ALL(v) (v).begin(),(v).end()\\n#define CR [](auto element1, auto element2){return element1>element2;}\\n#define LB lower_bound\\n#define UP upper_bound\\n#define PB push_back\\n#define MP make_pair\\n#define MT make_tuple\\n\\nusing LD = long double;\\nconst LD EPS = 1e-10;\\nconst LD R_EPS = 1e-3;\\n\\ntemplate<class T> struct Matrix {\\n vector<vector<T> > val;\\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\\n size_t size() const {return val.size();}\\n inline vector<T>& operator [] (int i) {return val[i];}\\n};\\n\\ntemplate<class T> ostream& operator << (ostream& s, Matrix<T> A) {\\n s << endl; \\n for (int i = 0; i < A.size(); ++i) {\\n for (int j = 0; j < A[i].size(); ++j) {\\n s << A[i][j] << \\\", \\\";\\n }\\n s << endl;\\n }\\n return s;\\n}\\n\\ntemplate<class T> Matrix<T> operator * (Matrix<T> A, Matrix<T> B) {\\n Matrix<T> R(A.size(), B[0].size());\\n for (int i = 0; i < A.size(); ++i)\\n for (int j = 0; j < B[0].size(); ++j)\\n for (int k = 0; k < B.size(); ++k)\\n R[i][j] += A[i][k] * B[k][j];\\n return R;\\n}\\n\\ntemplate<class T> Matrix<T> pow(Matrix<T> A, long long n) {\\n Matrix<T> R(A.size(), A.size());\\n for (int i = 0; i < A.size(); ++i) R[i][i] = 1;\\n while (n > 0) {\\n if (n & 1) R = R * A;\\n A = A * A;\\n n >>= 1;\\n }\\n return R;\\n}\\n\\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\\n int m = A.size(), n = A[0].size();\\n int rank = 0;\\n for (int col = 0; col < n; ++col) {\\n if (is_extended && col == n-1) break;\\n int pivot = -1;\\n T ma = EPS;\\n for (int row = rank; row < m; ++row) {\\n if (abs(A[row][col]) > ma) {\\n ma = abs(A[row][col]);\\n pivot = row;\\n }\\n }\\n if (pivot == -1) continue;\\n swap(A[pivot], A[rank]);\\n auto fac = A[rank][col];\\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\\n for (int row = 0; row < m; ++row) {\\n if (row != rank && abs(A[row][col]) > EPS) {\\n auto fac = A[row][col];\\n for (int col2 = 0; col2 < n; ++col2) {\\n A[row][col2] -= A[rank][col2] * fac;\\n }\\n }\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\\n // extended\\n int m = A.size(), n = A[0].size();\\n Matrix<T> M(m, n + 1);\\n for (int i = 0; i < m; ++i) {\\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\\n M[i][n] = b[i];\\n }\\n int rank = GaussJordan(M, true);\\n \\n // check if it has no solution\\n vector<T> res;\\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\\n\\n // answer\\n res.assign(n, 0);\\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\\n return res;\\n}\\n\\nvoid nextind(int d, vector<int> &ind){\\n int s=ind.size();\\n while(ind[s-1]==(d+2)+(s-(d+1))){\\n auto t=ind.end();\\n t--;\\n ind.erase(t);\\n s=ind.size();\\n }\\n ind[s-1]++;\\n while(s<d+1){\\n ind.PB(ind[s-1]+1);\\n s=ind.size();\\n }\\n}\\n\\nvoid solve(int d){\\n LD f[d+3];\\n int i,j,k;\\n for(i=0; i<d+3; i++){\\n cin >> f[i];\\n }\\n vector<vector<LD> > coef;\\n vector<int> ind;\\n for(i=0; i<d; i++){\\n ind.PB(i);\\n }\\n ind.PB(d-1);\\n vector<vector<int> > indind;\\n for(i=0; i<((d+3)*(d+2))/2; i++){\\n nextind(d,ind);\\n indind.PB(ind);\\n Matrix<LD> A(d+1,d+1);\\n for(j=0; j<d+1; j++){\\n int ele=1;\\n for(k=0; k<d+1; k++){\\n A[j][k]=ele;\\n ele*=ind[j];\\n }\\n }\\n vector<LD> b;\\n for(j=0; j<d+1; j++){\\n b.PB(f[ind[j]]);\\n }\\n coef.PB(linear_equation(A,b));\\n }\\n vector<bool> safe(d+3,0);\\n bool now;\\n for(i=0; i<((d+3)*(d+2))/2; i++){\\n now=0;\\n for(j=i+1; j<((d+3)*(d+2))/2; j++){\\n for(k=0; k<d+1; k++){\\n if(abs(coef[i][k]-coef[j][k])>R_EPS) break;\\n }\\n if(k<d+1) continue;\\n now=1;\\n }\\n if(now==1){\\n for(j=0; j<d+1; j++){\\n safe[indind[i][j]]=1;\\n }\\n }\\n }\\n for(i=0; i<d+3; i++){\\n if(safe[i]==0) break;\\n }\\n cout << i << endl;\\n}\\n\\nint main(){\\n int d;\\n while(cin >> d, d>0){\\n solve(d);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3108,\n \"score_of_the_acc\": -0.0909,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1328_4699696\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <array>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <string>\\n#include <sstream>\\n#include <algorithm>\\n#include <random>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <bitset>\\n#include <functional>\\n#include <iomanip>\\n#include <random>\\n\\n#define FOR_LT(i, beg, end) for (int i = (int)(beg); i < (int)(end); i++)\\n#define FOR_LE(i, beg, end) for (int i = (int)(beg); i <= (int)(end); i++)\\n#define FOR_DW(i, beg, end) for (int i = (int)(beg); (int)(end) <= i; i--)\\n#define REP(n) for (int repeat_index = 0; repeat_index < (int)n; repeat_index++)\\n\\nusing namespace std;\\n//=============================================================================\\n// Matrix\\n//=============================================================================\\n\\ntemplate <typename T>\\nstruct Matrix {\\n Matrix(size_t m, size_t n, T x = 0) : val_(vector<vector<T>>(m, vector<T>(n, x))) {}\\n\\n void Init(size_t m, size_t n, T x = 0)\\n {\\n this->val_.assign(vector<vector<T>>(m, vector<T>(n, x)));\\n }\\n\\n size_t size() {\\n return this->val_.size();\\n }\\n\\n inline vector<T>& operator [] (int i) { return this->val_[i]; }\\n\\n void print() {\\n for (auto& v : val_) {\\n for (auto& t : v) {\\ncout << t << \\\" \\\";\\n }\\n cout << endl;\\n }\\n }\\n\\n vector<vector<T>> val_;\\n};\\n\\n//=============================================================================\\n// REAL\\n//=============================================================================\\nstatic const double kEPS = 1e-10;\\n\\ntemplate<class T>\\nint gauss_jordan(Matrix<T>& A, bool is_extended = false) {\\n int m = A.size(), n = A[0].size();\\n\\n int rank = 0;\\n for (int col = 0; col < n; ++col) {\\n if (is_extended && col == n - 1) break;\\n\\n int pivot = -1;\\n T ma = kEPS;\\n for (int row = rank; row < m; ++row) {\\n if (abs(A[row][col]) > ma) {\\n ma = abs(A[row][col]);\\n pivot = row;\\n }\\n }\\n if (pivot == -1) continue;\\n\\n swap(A[pivot], A[rank]);\\n {\\n auto fac = A[rank][col];\\n\\n for (int col2 = 0; col2 < n; ++col2) {\\n A[rank][col2] /= fac;\\n }\\n }\\n\\n for (int row = 0; row < m; ++row) {\\n if (row != rank && abs(A[row][col]) > kEPS) {\\n auto fac = A[row][col];\\n for (int col2 = 0; col2 < n; ++col2) {\\n A[row][col2] -= A[rank][col2] * fac;\\n }\\n }\\n }\\n\\n ++rank;\\n }\\n\\n return rank;\\n}\\n\\n\\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b)\\n{\\n int m = A.size(), n = A[0].size();\\n\\n Matrix<T> M(m, n + 1);\\n for (int i = 0; i < m; ++i) {\\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\\n M[i][n] = b[i];\\n }\\n int rank = gauss_jordan(M, true);\\n\\n vector<T> res;\\n for (int row = rank; row < m; ++row) {\\n if (abs(M[row][n]) > kEPS) return res;\\n }\\n\\n res.assign(n, 0);\\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\\n return res;\\n}\\n\\nvoid solve(int d)\\n{\\n vector<double> y(d + 3);\\n FOR_LT(i, 0, d + 3) {\\n cin >> y[i];\\n }\\n\\n vector<int> s;\\n vector<vector<int>> sc;\\n vector<vector<double>> v;\\n FOR_LT(i, 0, (1 << (d + 3))) {\\n {\\n int c = 0;\\n FOR_LT(j, 0, (d + 3)) {\\n if (i & (1 << j)) c++;\\n }\\n if (c != d + 1) continue;\\n }\\n\\n\\n Matrix<double> A(d + 1, d + 1);\\n vector<double> b(d + 1);\\n\\n int c = 0;\\n FOR_LT(j, 0, d + 3) {\\n if (i & (1 << j)) {\\n FOR_LE(k, 0, d) {\\n A[c][k] = pow(j, k);\\n }\\n b[c] = y[j];\\n c++;\\n }\\n\\t\\t}\\n\\n vector<double> ans = linear_equation(A, b);\\n assert(!ans.empty());\\n\\n {\\n bool is_same = false;\\n FOR_LT(j, 0, s.size()) {\\n bool is_c_same = true;\\n FOR_LT(k, 0, d + 1) {\\n if (abs(v[j][k] - ans[k]) >= 10E-4) {\\n is_c_same = false;\\n break;\\n }\\n }\\n if (is_c_same) {\\n is_same = true;\\n s[j]++;\\n FOR_LT(k, 0, d + 3) {\\n if (i & (1 << k)) {\\n sc[j][k]++;\\n }\\n }\\n break;\\n }\\n }\\n if (!is_same) {\\n s.push_back(1);\\n v.push_back(ans);\\n vector<int> scc(d + 3);\\n FOR_LT(k, 0, d + 3) {\\n if (i & (1 << k)) {\\n scc[k]++;\\n }\\n }\\n sc.push_back(scc);\\n }\\n }\\n\\t}\\n\\n int argmax = -1;\\n int maxv = 0;\\n FOR_LT(i, 0, s.size()) {\\n if (maxv < s[i]) {\\n argmax = i;\\n maxv = s[i];\\n }\\n }\\n\\n FOR_LT(i, 0, d + 3) {\\n if (sc[argmax][i] == 0) {\\n cout << i << endl;\\n return;\\n }\\n }\\n}\\n\\nint main()\\n{\\n\\tios_base::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\tcout << fixed << setprecision(20);\\n\\n\\twhile (true) {\\n\\t\\tint d; cin >> d;\\n\\t\\tif (d == 0) break;\\n\\t\\tsolve(d);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.3616,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1328_4368376\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#include <climits>\\n#include <cstring>\\n#include <cassert>\\n\\n#define rep(i, m, n) for(int i=int(m);i<int(n);i++)\\n#define all(c) begin(c),end(c)\\n\\ntemplate<typename T1, typename T2>\\ninline void chmin(T1 &a, T2 b) { if (a > b) a = b; }\\n\\ntemplate<typename T1, typename T2>\\ninline void chmax(T1 &a, T2 b) { if (a < b) a = b; }\\n\\ntypedef long long int ll;\\nusing ll = long long int;\\nusing ull = long long unsigned int;\\nusing Int = long long int;\\nusing uInt = long long unsigned int;\\nusing Double = long double;\\nusing namespace std;\\n#define INF (1 << 30) - 1\\n#define INFl (ll)5e15\\n#define DEBUG 0\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl\\n#define MOD 1000000007\\n\\n\\n//edit\\nconst double EPS = 1E-7;\\ntypedef vector<Double> vec;\\ntypedef vector<vec> mat;\\n\\n//Ax = b を解く。Aは正方行列\\n// 解がないか、一意でない場合は長さ0の配列を返す\\nvec gauss_jordan(const mat &A, const vec &b) {\\n int n = A.size();\\n mat B(n, vec(n + 1));\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++) B[i][j] = A[i][j];\\n //行列Aの後ろにbを並べ、同時に処理する。\\n for (int i = 0; i < n; i++) B[i][n] = b[i];\\n\\n for (int i = 0; i < n; i++) {\\n //注目している変数の係数の絶対値が大きい式をi番目に持ってくる\\n int pivot = i;\\n for (int j = i; j < n; j++) {\\n if (abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\\n }\\n swap(B[i], B[pivot]);\\n\\n //解がないか一意でない\\n if (abs(B[i][i]) < EPS) return vec();\\n\\n //注目している変数の係数を1にする\\n for (int j = i + 1; j <= n; j++) B[i][j] /= B[i][i];\\n for (int j = 0; j < n; j++) {\\n if (i != j) {\\n //j番目の式からi番目の変数を削除\\n for (int k = i + 1; k <= n; k++) B[j][k] -= B[j][i] * B[i][k];\\n }\\n }\\n }\\n vec x(n);\\n for (int i = 0; i < n; i++) x[i] = B[i][n];\\n return x;\\n}\\n\\n\\nclass Solve {\\npublic:\\n Int n;\\n vector<Double> v;\\n\\n vector<Double> calc(vector<int> idx) {\\n vector<vector<Double>> A(idx.size(), vector<Double>(idx.size()));\\n vector<Double> b(idx.size());\\n\\n for (int i = 0; i < idx.size(); ++i) {\\n for (int j = 0; j < idx.size(); ++j) {\\n Double tmp = pow(idx[i], j);\\n A[i][j] = tmp;\\n }\\n }\\n for (int i = 0; i < idx.size(); ++i) {\\n b[i] = v[idx[i]];\\n }\\n\\n auto ret = gauss_jordan(A, b);\\n return ret;\\n }\\n\\n bool eq_vec(vector<Double> &v1, vector<Double> &v2) {\\n for (int i = 0; i < v1.size(); ++i) {\\n if (abs(v1[i] - v2[i]) > 0.1) {\\n return false;\\n }\\n }\\n return true;\\n }\\n\\n bool is_wrong(int p) {\\n vector<int> idx1, idx2;\\n for (int i = 0; i < v.size(); ++i) {\\n if (i != p) {\\n idx1.push_back(i);\\n idx2.push_back(i);\\n }\\n }\\n idx1.pop_back();\\n idx2.erase(idx2.begin());\\n\\n auto x1 = calc(idx1);\\n auto x2 = calc(idx2);\\n\\n bool ret = eq_vec(x1, x2);\\n return ret;\\n }\\n\\n bool solve() {\\n cin >> n;\\n if (n == 0) return false;\\n v.resize(n + 3);\\n rep(i, 0, n + 3) cin >> v[i];\\n\\n int ans = -1;\\n for (int i = 0; i <= n + 2; ++i) {\\n if (is_wrong(i)) {\\n ans = i;\\n }\\n }\\n cout << ans << endl;\\n\\n return true;\\n }\\n};\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n// std::ifstream in(\\\"input.txt\\\");\\n// std::cin.rdbuf(in.rdbuf());\\n\\n while (Solve().solve());\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.3257,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1328_4267647\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-5L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define seg_size 262144LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\n// geometry library\\n\\ntypedef complex<long double> Point;\\ntypedef pair<complex<long double>, complex<long double>> Line;\\n\\ntypedef struct Circle {\\n complex<long double> center;\\n long double r;\\n}Circle;\\n\\n//内積、 dot(a,b) = |a||b|cos()\\nlong double dot(Point a, Point b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n//外積、cross(a,b) = |a||b|sin()\\nlong double cross(Point a, Point b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\n//線分と点の距離\\nlong double Dist_Line_Point(Line a, Point b) {\\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\\n}\\n\\n//線分の交差判定\\nint is_intersected_ls(Line a, Line b) {\\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < 0) &&\\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < 0);\\n}\\n\\n//線分の交点\\nPoint intersection_l(Line a, Line b) {\\n Point da = a.second - a.first;\\n Point db = b.second - b.first;\\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\\n}\\n\\n//線分と線分の距離\\nlong double Dist_Line_Line(Line a, Line b) {\\n if (is_intersected_ls(a, b) == 1) {\\n return 0;\\n }\\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\\n}\\n\\n//円と円の交点\\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\\n long double dist = abs(a.center - b.center);\\n assert(dist <= eps + a.r + b.r);\\n assert(dist+eps >= abs(a.r - b.r));\\n Point target = b.center - a.center;\\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\\n long double aa = pointer + a.r * a.r - b.r * b.r;\\n aa /= 2.0L;\\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\\n r = r + a.center;\\n l = l + a.center;\\n return mp(l, r);\\n}\\n\\n//end of geometry\\n\\n\\n\\nvoid init() {\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\n\\nunsigned long xor128() {\\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n unsigned long t = (x ^ (x << 11));\\n x = y; y = z; z = w;\\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\\n}\\n\\n#define int ll\\n\\ntemplate<typename A>\\nvector<A> solve_algebra_equations(vector<vector<A>> now) {\\n for (int q = 0; q < now.size(); ++q) {\\n if (now[q][q] == 0) {\\n for (int j = q + 1; j < now.size(); ++j) {\\n if (now[j][q] != 0) {\\n swap(now[j], now[q]);\\n break;\\n }\\n }\\n }\\n for (int j = now[q].size() - 1; j >= 0; --j) {\\n now[q][j] /= now[q][q];\\n }\\n for (int j = 0; j < now.size();++j) {\\n if (j == q) continue;\\n A val = now[j][q];\\n for (int t = 0; t < now[j].size(); ++t) {\\n now[j][t] -= val * now[q][t];\\n }\\n }\\n }\\n vector<A> ans;\\n REP(i, now.size()) {\\n ans.push_back(now[i].back());\\n }\\n return ans;\\n}\\n\\nvoid solve(){\\n while (true) {\\n int d;\\n cin >> d;\\n if (d == 0) return;\\n vector<long double> inputs;\\n REP(i, d + 3) {\\n long double a;\\n cin >> a;\\n inputs.push_back(a);\\n }\\n int ans = -1;\\n REP(i, inputs.size()) {\\n for (int q = i + 1; q < inputs.size(); ++q) {\\n vector<vector<long double>> neko;\\n vector<vector<long double>> check;\\n REP(j, inputs.size()) {\\n vector<long double> now;\\n now.push_back(inputs[j]);\\n long double geko = 1;\\n for (int t = 0; t <= d; ++t) {\\n now.push_back(geko);\\n geko *= j;\\n }\\n reverse(ALL(now));\\n if (i == j || q == j) {\\n check.push_back(now);\\n }\\n else {\\n neko.push_back(now);\\n }\\n }\\n vector<long double> geko = solve_algebra_equations<long double>(neko);\\n REP(t, 2) {\\n long double now_check = 0;\\n for (int q = 0; q < geko.size(); ++q) {\\n now_check += geko[q] * check[t][q];\\n }\\n if (abs(now_check - check[t].back()) < eps) {\\n if (t == 0) {\\n ans = q;\\n }\\n else {\\n ans = i;\\n }\\n break;\\n }\\n }\\n }\\n if (ans != -1) break;\\n }\\n cout << ans << endl;\\n }\\n}\\n\\n#undef int\\nint main() {\\n init();\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -0.1101,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1328_4189068\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ndouble lagrange_interpolation(std::vector<double> x, std::vector<double> y, double T) {\\n const long long n = x.size() - 1;\\n double ret = 0;\\n for(int i=0;i<n+1;++i) {\\n double t = 1;\\n for(int j=0;j<n+1;++j) {\\n if(i == j) continue;\\n t *= T-x[j];\\n t /= x[i]-x[j];\\n }\\n ret += t * y[i];\\n }\\n return ret;\\n}\\nstd::vector<double> lagrange_interpolation(std::vector<double> x, std::vector<double> y) {\\n const long long n = x.size() - 1;\\n const double eps = 1e-6;\\n for(int i=0;i<n+1;++i) {\\n double t = 1;\\n for(int j=0;j<n+1;++j) {\\n if(i != j) t *= x[i]-x[j];\\n }\\n y[i] /= t;\\n }\\n long long cur = 0, nxt = 1;\\n std::vector<std::vector<double>> dp(2, std::vector<double>(n+2));\\n dp[0][0] = -1 * x[0], dp[0][1] = 1;\\n for(int i=1;i<n+1;++i) {\\n for(int j=0;j<n+2;++j) {\\n dp[nxt][j] = dp[cur][j] * -1 * x[i];\\n if(j >= 1) dp[nxt][j] += dp[cur][j-1];\\n }\\n std::swap(nxt, cur);\\n }\\n std::vector<double> ret(n+1);\\n for(int i=0;i<n+1;++i) {\\n if(y[i]==0) continue;\\n if(abs(x[i]) < eps) {\\n for(int j=0;j<n+1;++j) ret[j] += dp[cur][j+1] * y[i];\\n } else {\\n ret[0] -= dp[cur][0] / x[i] * y[i];\\n double pre = -1 * dp[cur][0] / x[i];\\n for(int j=1;j<n+1;++j) {\\n ret[j] -= (dp[cur][j] - pre) / x[i] * y[i];\\n pre = -1 * (dp[cur][j] - pre) / x[i];\\n }\\n }\\n }\\n return ret;\\n}\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nconst double eps = 1e-4;\\nconst ll MOD = 1000000007;\\nconst int INF = 1000000000;\\nconst ll LINF = 1ll<<50;\\ntemplate<typename T>\\nvoid printv(const vector<T>& s) {\\n for(int i=0;i<(int)(s.size());++i) {\\n cout << s[i];\\n if(i == (int)(s.size())-1) cout << endl;\\n else cout << \\\" \\\";\\n }\\n}\\ntemplate<typename T1, typename T2>\\nostream& operator<<(ostream &os, const pair<T1, T2> p) {\\n os << p.first << \\\":\\\" << p.second;\\n return os;\\n}\\nbool operator== (const vector<double> &v1, const vector<double> &v2) {\\n if((int)(v1.size()) == (int)(v2.size())) {\\n bool res = true;\\n for(int i=0;i<(int)(v1.size());++i) {\\n res &= abs(v1[i] - v2[i]) < eps;\\n }\\n return res;\\n } else {\\n return false;\\n }\\n}\\ndouble err (const vector<double> &v1, const vector<double> &v2) {\\n double res = 0;\\n for(int i=0;i<(int)(v1.size());++i) {\\n res += abs(v1[i] - v2[i]);\\n }\\n return res;\\n}\\nvoid solve(int d) {\\n vector<double> x, y;\\n for(int i=0;i<d+3;++i) {\\n x.push_back(i);\\n double tmp; cin >> tmp;\\n y.push_back(tmp);\\n }\\n vector<pair<double, int>> vp;\\n for(int i=0;i<d+3;++i) {\\n vector<vector<double>> v;\\n for(int j=0;j<d+3;++j) {\\n if(j == i) continue;\\n vector<double> nx, ny;\\n for(int k=0;k<d+3;++k) {\\n if(k == i || k == j) continue;\\n nx.push_back(x[k]);\\n ny.push_back(y[k]);\\n }\\n v.emplace_back(lagrange_interpolation(nx, ny));\\n }\\n bool ok = true;\\n double ma = 0;\\n for(int j=0;j<d+2;++j) {\\n ma = max(ma, err(v[j], v[(j+1)%(d+2)]));\\n }\\n vp.push_back({ma, i});\\n }\\n sort(vp.begin(), vp.end());\\n cout << vp[0].second << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n while(1) {\\n int d; cin >> d;\\n if(d == 0) break;\\n solve(d);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.2193,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1328_3992060\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing LL = long long;\\n\\n#define fs first\\n#define sc second\\n\\nconst LL MOD = 1e9+7;\\nconst double EPS = 1e-10;\\n\\ntemplate<class T>bool chmax(T &a, const T &b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate<class T>bool chmin(T &a, const T &b) {\\n if (b < a) { a = b; return true; }\\n return false;\\n}\\n\\n// std::vector Declaration\\ntemplate<typename T>\\nvector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\n// std::vector Declaration and Initialization\\ntemplate<typename T>\\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\\ntemplate<typename T, typename U, typename... Ts>\\nauto make_vector(size_t a, U b, Ts... ts) {\\n return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));\\n}\\n\\n// std::vector Input\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n for (auto &e : v) {\\n is >> e;\\n }\\n return is;\\n}\\n\\n// std::vector Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::array Debug\\ntemplate<typename T, size_t n>\\nostream& operator<<(ostream& os, const array<T, n>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::deque Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const deque<T>& d) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : d) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::pair Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << \\\"(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\n// std::set Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const set<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::multiset Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const multiset<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::map Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const map<T, U>& mp) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : mp) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e.first << \\\":\\\" << e.second;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::tuple Debug\\ntemplate<int N, class Tuple>\\nvoid out(ostream& os, const Tuple& t){}\\ntemplate<int N, class Tuple, class H, class ...Ts>\\nvoid out(ostream& os, const Tuple& t) {\\n if (N) os << \\\" \\\";\\n os << get<N>(t);\\n out<N+1,Tuple,Ts...>(os, t);\\n}\\ntemplate<class ...Ts>\\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\\n os << \\\"(\\\";\\n out<0,tuple<Ts...>,Ts...>(os, t);\\n os << \\\")\\\";\\n return os;\\n}\\n\\n// Debug\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n\\n// Weighted edge\\ntemplate<typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n\\n operator int() const { return to; }\\n\\n friend ostream& operator<<(ostream& os, const edge& e) {\\n return os << \\\"(\\\" << e.src << \\\"->\\\" << e.to << \\\":\\\" << e.cost << \\\")\\\";\\n }\\n};\\n\\ntemplate<typename T>\\nusing Edges = vector<edge<T>>;\\ntemplate<typename T>\\nusing WeightedGraph = vector<Edges<T>>;\\nusing UnWeightedGraph = vector<vector<int>>;\\ntemplate<typename T>\\nusing MatrixGraph = vector<vector<T>>;\\n\\nusing Matrix = vector<vector<double>>;\\n\\npair<Matrix,Matrix> LUDecomposition(const Matrix& A) {\\n // A: Squere Matirix\\n int n = A.size();\\n const double INF = numeric_limits<double>::max();\\n Matrix L = make_v<double>(n, n),\\n U = make_v<double>(n, n);\\n\\n for (int i = 0; i < n; ++i) {\\n L[i][i] = 1;\\n }\\n\\n for (int i = 0; i < n; ++i) {\\n // L\\n for (int j = 0; j < i; ++j) {\\n double total = 0;\\n for (int k = 0; k < j; ++k) {\\n total += L[i][k] * U[k][j];\\n }\\n L[i][j] = (A[i][j] - total) / U[j][j];\\n }\\n\\n // U\\n for (int j = i; j < n; ++j) {\\n double total = 0;\\n for (int k = 0; k < i; ++k) {\\n total += L[i][k] * U[k][j];\\n }\\n U[i][j] = A[i][j] - total;\\n }\\n }\\n\\n return make_pair(L, U);\\n}\\n\\nusing Vector = vector<double>;\\n\\nVector solve(const Matrix& A, const Vector& b) {\\n // A: Squere Matrix\\n int n = A.size();\\n Matrix L, U;\\n tie(L, U) = LUDecomposition(A);\\n\\n Vector y(n);\\n for (int i = 0; i < n; ++i) {\\n double total = 0;\\n for (int j = 0; j < i; ++j) {\\n total += y[j] * L[i][j];\\n }\\n y[i] = b[i] - total;\\n }\\n\\n Vector x(n);\\n for (int i = n-1; i >= 0; --i) {\\n double total = 0;\\n for (int j = n-1; j > i; --j) {\\n total += U[i][j] * x[j];\\n }\\n x[i] = (y[i] - total) / U[i][i];\\n }\\n\\n return x;\\n}\\n\\nint main()\\n{\\n while (true) {\\n int d; cin >> d;\\n if (d == 0) {\\n break;\\n }\\n\\n vector<double> v(d+3); cin >> v;\\n vector<double> ans(d+3);\\n\\n for (int m = 0; m < d+3; ++m) {\\n\\n int check = (d+1+m) % (d+3);\\n\\n Matrix A = make_v<double>(d+1, d+1);\\n for (int i = 0; i <= d; ++i) {\\n for (int k = 0; k <= d; ++k) {\\n A[i][k] = pow((i+m) % (d+3), k);\\n }\\n }\\n\\n Vector b(d+1);\\n for (int i = 0; i <= d; ++i) {\\n b[i] = v[(i+m) % (d+3)];\\n }\\n\\n Vector a = solve(A, b);\\n\\n double sum = 0;\\n for (int i = 0; i <= d; ++i) {\\n sum += a[i] * pow(check, i);\\n }\\n\\n ans[(check+1) % (d+3)] = abs(sum - v[check]);\\n }\\n\\n cout << distance(ans.begin(), min_element(ans.begin(), ans.end())) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.1376,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1328_3839063\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n\\nusing Bool = bool;\\nusing Int = long long int;\\nusing Real = long double;\\ntemplate <class T>\\nusing Vector = std::vector<T>;\\n\\nconstexpr Real EPS = 1e-3;\\n\\n// pol * (x - d)\\nVector<Real> mul(Vector<Real> pol, Real d) {\\n pol.insert(pol.begin(), 0);\\n for (Int i = 0; i + 1 < pol.size(); ++i) {\\n pol[i] -= pol[i + 1] * d;\\n }\\n return pol;\\n}\\n\\n// pol / d\\nVector<Real> divc(Vector<Real> pol, Real d) {\\n for (auto& a : pol) a /= d;\\n return pol;\\n}\\n\\nVector<Real> add(Vector<Real> pol1, Vector<Real> pol2) {\\n for (Int i = 0; i < pol1.size(); ++i) {\\n pol1[i] += pol2[i];\\n }\\n return pol1;\\n}\\n\\nReal apply(const Vector<Real> pol, Real x) {\\n Real ret = 0, acc = 1;\\n for (auto a : pol) {\\n ret += a * acc;\\n acc *= x;\\n }\\n return ret;\\n}\\n\\nBool solve() {\\n Int n;\\n std::cin >> n;\\n if (n == 0) return false;\\n\\n Vector<Real> v(n + 3);\\n for (auto& a : v) std::cin >> a;\\n\\n for (Int i = 0; i <= n + 1; ++i) {\\n // v[i]が偽と仮定\\n Vector<Real> res(n + 1, 0);\\n\\n for (Int j = 0; j <= n + 1; ++j) {\\n if (j == i) continue;\\n\\n Vector<Real> pol(1, v[j]);\\n for (Int k = 0; k <= n + 1; ++k) {\\n if (k == i || k == j) continue;\\n pol = mul(pol, k); // * (x - k)\\n pol = divc(pol, j - k); // / (j - k)\\n }\\n res = add(res, pol);\\n }\\n\\n Real err = apply(res, Real(n + 2)) - v[n + 2];\\n if (std::abs(err) < EPS) {\\n std::cout << i << std::endl;\\n return true;\\n }\\n }\\n\\n std::cout << n + 2 << std::endl;\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.0642,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1328_3814750\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\n#pragma warning (disable: 4996)\\n\\nlong double Gauss(vector<vector<long double>>a, vector<long double>b) {\\n\\tint N = a.size();\\n\\tif (N == 1) return b[0] / a[0][0];\\n\\n\\tvector<vector<long double>> c = a;\\n\\tvector<long double> d = b;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) c[i][j] = a[i][j] / a[i][0];\\n\\t\\td[i] = b[i] / a[i][0];\\n\\t}\\n\\n\\tvector<vector<long double>> e(N - 1, vector<long double>(N - 1, 0));\\n\\tvector<long double> f(N - 1, 0);\\n\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tfor (int j = 0; j < N - 1; j++) {\\n\\t\\t\\te[i][j] = c[i + 1][j + 1] - c[i][j + 1];\\n\\t\\t}\\n\\t\\tf[i] = d[i + 1] - d[i];\\n\\t}\\n\\n\\treturn Gauss(e, f);\\n}\\n\\nvector<long double> Gauss_Erase(vector<vector<long double>> e, vector<long double>f) {\\n\\tint N = e.size(); vector<long double> res;\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tlong double T = Gauss(e, f);\\n\\t\\tres.push_back(T);\\n\\t\\t\\n\\t\\tvector<vector<long double>> a(e.size() - 1, vector<long double>(e.size() - 1, 0));\\n\\t\\tvector<long double> b(e.size() - 1, 0);\\n\\t\\t\\n\\t\\tfor (int j = 0; j < N - 1 - i; j++) {\\n\\t\\t\\tfor (int k = 0; k < N - 1 - i; k++) a[j][k] = e[j][k];\\n\\t\\t\\tb[j] = f[j] - T * e[j][e.size() - 1];\\n\\t\\t}\\n\\t\\te = a;\\n\\t\\tf = b;\\n\\t}\\n\\n\\treverse(res.begin(), res.end());\\n\\treturn res;\\n}\\n\\nvector<long double> getans(vector<pair<long double, long double>> J) {\\n\\tint N = J.size();\\n\\tvector<vector<long double>> a(N, vector<long double>(N, 0));\\n\\tvector<long double> b(N, 0);\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) a[i][j] = 1.0L * pow(J[i].first, 1.0L*(N - 1 - j));\\n\\t\\tb[i] = J[i].second;\\n\\t}\\n\\t\\n\\tvector<long double> ret = Gauss_Erase(a, b);\\n\\treturn ret;\\n}\\n\\nbool different(vector<long double> A, vector<long double> B) {\\n\\tfor (int i = 0; i < A.size(); i++) {\\n\\t\\tif (fabs(A[i] - B[i]) > 1e-2) return true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint solve(vector<long double> S) {\\n\\tint N = S.size() - 3;\\n\\tfor (int i = 0; i <= N + 2; i++) {\\n\\t\\tvector<long double> goal; bool flag = false;\\n\\t\\tfor (int j = 0; j <= N + 2; j++) {\\n\\t\\t\\tif (i == j) continue;\\n\\t\\t\\tvector<pair<long double, long double>> G;\\n\\t\\t\\tfor (int k = 0; k <= N + 2; k++) {\\n\\t\\t\\t\\tif (k != i && k != j) G.push_back(make_pair(1.0L * k + 1.0L, S[k]));\\n\\t\\t\\t}\\n\\t\\t\\tvector<long double> V = getans(G);\\n\\t\\t\\tif (goal.size() == 0) goal = V;\\n\\t\\t\\telse if (different(goal, V) == true) flag = true;\\n\\t\\t}\\n\\t\\tif (flag == false) return i;\\n\\t}\\n\\treturn -1;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N; cin >> N; if (N == 0) break;\\n\\t\\tvector<long double> A(N + 3, 0);\\n\\t\\tfor (int i = 0; i < N + 3; i++) cin >> A[i];\\n\\n\\t\\tint ans = solve(A);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.3991,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1328_3435542\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\n// Gauss Jordan\\nusing D = long double;\\nconst D EPS = 1e-5;\\ntemplate<class T> struct Matrix {\\n vector<vector<T> > val;\\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\\n size_t size() const {return val.size();}\\n inline vector<T>& operator [] (int i) {return val[i];}\\n};\\n\\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\\n int m = A.size(), n = A[0].size();\\n int rank = 0;\\n for (int col = 0; col < n; ++col) {\\n if (is_extended && col == n-1) break;\\n int pivot = -1;\\n T ma = EPS;\\n for (int row = rank; row < m; ++row) {\\n if (abs(A[row][col]) > ma) {\\n ma = abs(A[row][col]);\\n pivot = row;\\n }\\n }\\n if (pivot == -1) continue;\\n swap(A[pivot], A[rank]);\\n auto fac = A[rank][col];\\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\\n for (int row = 0; row < m; ++row) {\\n if (row != rank && abs(A[row][col]) > EPS) {\\n auto fac = A[row][col];\\n for (int col2 = 0; col2 < n; ++col2) {\\n A[row][col2] -= A[rank][col2] * fac;\\n }\\n }\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\\n int m = A.size(), n = A[0].size();\\n Matrix<T> M(m, n + 1);\\n for (int i = 0; i < m; ++i) {\\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\\n M[i][n] = b[i];\\n }\\n int rank = GaussJordan(M, true);\\n vector<T> res;\\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\\n res.assign(n, 0);\\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\\n return res;\\n}\\n\\n\\n\\n\\nD pow(D a, int n) {\\n D res = 1.0;\\n for (int i = 0; i < n; ++i) res *= a;\\n return res;\\n}\\n\\nD func(const vector<D> &coef, int i) {\\n D res = 0.0;\\n for (int p = 0; p < coef.size(); ++p) res += coef[p] * pow(i, p);\\n return res;\\n}\\n\\nint main() {\\n int d;\\n while (cin >> d, d) {\\n vector<D> v(d+3);\\n for (int i = 0; i < d+3; ++i) cin >> v[i];\\n\\n int res = 0;\\n for (int i = 0; i < d+3; ++i) {\\n for (int j = i+1; j < d+3; ++j) {\\n Matrix<D> A(d+1, d+1);\\n vector<D> b(d+1);\\n for (int k = 0, iter = 0; k < d+3; ++k) {\\n if (k == i || k == j) continue;\\n for (int p = 0; p < d+1; ++p) {\\n A[iter][p] = pow(k, p);\\n b[iter] = v[k];\\n }\\n ++iter;\\n }\\n vector<D> ans = linear_equation(A, b);\\n if (ans.empty()) continue;\\n D vi = func(ans, i), vj = func(ans, j);\\n int num = 0;\\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\\n if (num == 1) goto end;\\n }\\n }\\n end:\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.0734,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1328_3435541\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <algorithm>\\nusing namespace std;\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\n\\n// Gauss Jordan\\nusing D = long double;\\nconst D EPS = 1e-5;\\ntemplate<class T> struct Matrix {\\n vector<vector<T> > val;\\n Matrix(int n, int m, T x = 0) : val(n, vector<T>(m, x)) {}\\n void init(int n, int m, T x = 0) {val.assign(n, vector<T>(m, x));}\\n size_t size() const {return val.size();}\\n inline vector<T>& operator [] (int i) {return val[i];}\\n};\\n\\ntemplate<class T> ostream& operator << (ostream& s, Matrix<T> A) {\\n s << endl; \\n for (int i = 0; i < A.size(); ++i) {\\n for (int j = 0; j < A[i].size(); ++j) {\\n s << A[i][j] << \\\", \\\";\\n }\\n s << endl;\\n }\\n return s;\\n}\\n\\ntemplate<class T> int GaussJordan(Matrix<T> &A, bool is_extended = false) {\\n int m = A.size(), n = A[0].size();\\n int rank = 0;\\n for (int col = 0; col < n; ++col) {\\n if (is_extended && col == n-1) break;\\n int pivot = -1;\\n T ma = EPS;\\n for (int row = rank; row < m; ++row) {\\n if (abs(A[row][col]) > ma) {\\n ma = abs(A[row][col]);\\n pivot = row;\\n }\\n }\\n if (pivot == -1) continue;\\n swap(A[pivot], A[rank]);\\n auto fac = A[rank][col];\\n for (int col2 = 0; col2 < n; ++col2) A[rank][col2] /= fac;\\n for (int row = 0; row < m; ++row) {\\n if (row != rank && abs(A[row][col]) > EPS) {\\n auto fac = A[row][col];\\n for (int col2 = 0; col2 < n; ++col2) {\\n A[row][col2] -= A[rank][col2] * fac;\\n }\\n }\\n }\\n ++rank;\\n }\\n return rank;\\n}\\n\\ntemplate<class T> vector<T> linear_equation(Matrix<T> A, vector<T> b) {\\n int m = A.size(), n = A[0].size();\\n Matrix<T> M(m, n + 1);\\n for (int i = 0; i < m; ++i) {\\n for (int j = 0; j < n; ++j) M[i][j] = A[i][j];\\n M[i][n] = b[i];\\n }\\n int rank = GaussJordan(M, true);\\n vector<T> res;\\n for (int row = rank; row < m; ++row) if (abs(M[row][n]) > EPS) return res;\\n res.assign(n, 0);\\n for (int i = 0; i < rank; ++i) res[i] = M[i][n];\\n return res;\\n}\\n\\n\\n\\n\\nD pow(D a, int n) {\\n D res = 1.0;\\n for (int i = 0; i < n; ++i) res *= a;\\n return res;\\n}\\n\\nD func(const vector<D> &coef, int i) {\\n D res = 0.0;\\n for (int p = 0; p < coef.size(); ++p) res += coef[p] * pow(i, p);\\n return res;\\n}\\n\\nint main() {\\n int d;\\n while (cin >> d, d) {\\n vector<D> v(d+3);\\n for (int i = 0; i < d+3; ++i) cin >> v[i];\\n\\n int res = 0;\\n for (int i = 0; i < d+3; ++i) {\\n for (int j = i+1; j < d+3; ++j) {\\n Matrix<D> A(d+1, d+1);\\n vector<D> b(d+1);\\n for (int k = 0, iter = 0; k < d+3; ++k) {\\n if (k == i || k == j) continue;\\n for (int p = 0; p < d+1; ++p) {\\n A[iter][p] = pow(k, p);\\n b[iter] = v[k];\\n }\\n ++iter;\\n }\\n vector<D> ans = linear_equation(A, b);\\n if (ans.empty()) continue;\\n D vi = func(ans, i), vj = func(ans, j);\\n int num = 0;\\n if (fabs(vi - v[i]) > EPS) res = i, ++num;\\n if (fabs(vj - v[j]) > EPS) res = j, ++num;\\n if (num == 1) goto end;\\n }\\n }\\n end:\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.0596,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1328_3338746\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\nusing ld = long double;\\n\\ntemplate <class T>\\nvector<T> solve(const vector<vector<T>> &A, const vector<T> &y) {\\n int N = y.size();\\n vector<T> x(N, 0);\\n vector<vector<T>> tmp(N, vector<T>(N * 2, 0));\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < N; j++)\\n tmp[i][j] = A[i][j];\\n for (int i = 0; i < N; i++)\\n tmp[i][N + i] = 1;\\n \\n for (int i = 0; i < N; i++) {\\n if (tmp[i][i] == 0) tmp[i][i] += 1e-10;\\n T sc = tmp[i][i];\\n for (int k = 0; k < N * 2; k++)\\n tmp[i][k] /= sc;\\n for (int j = 0; j < N; j++) {\\n if (i == j) continue;\\n sc = tmp[j][i];\\n for (int k = 0; k < N * 2; k++) {\\n tmp[j][k] -= tmp[i][k] * sc;\\n }\\n }\\n }\\n\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n x[i] += tmp[i][N + j] * y[j];\\n }\\n }\\n return x;\\n}\\n\\nsigned main() {\\n while (1) {\\n int d;\\n cin >> d;\\n if (d == 0) break;\\n vector<ld> v(d + 3);\\n for (int i = 0; i < d + 3; i++) {\\n cin >> v[i];\\n }\\n \\n for (int i = 0; i < d + 3; i++) {\\n for (int l = i + 1; l < d + 3; l++) {\\n vector<ld> y;\\n y.reserve(d + 2);\\n auto p = y;\\n for (int j = 0; j < d + 3; j++) {\\n if (i == j || l == j) continue;\\n y.push_back(v[j]);\\n p.push_back(j);\\n }\\n vector<vector<ld>> A(d + 1, vector<ld>(d + 1, 0));\\n for (int j = 0; j < d + 1; j++) {\\n ld x = p[j];\\n for (ld k = 0; k < d + 1; k++) {\\n A[j][k] = pow(x, k);\\n }\\n }\\n \\n auto value = [&](const vector<ld> &c, ld p) {\\n ld ret = 0;\\n for (int k = 0; k < c.size(); k++) {\\n ret += c[k] * pow(p, k);\\n }\\n return ret;\\n };\\n\\n auto c = solve(A, y);\\n\\n int cnt = 0;\\n int idx = 0;\\n for (int j = 0; j < d + 3; j++) {\\n if (abs(value(c, j) - v[j]) > 1e-4) {\\n cnt++;\\n idx = j;\\n }\\n }\\n if (cnt == 1) {\\n cout << idx << endl;\\n goto next_case;\\n }\\n }\\n }\\n next_case:;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.3578,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1328_3321821\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int ui;\\nconst ll mod = 998244353;\\nconst ll INF = (ll)1000000007 * 1000000007;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-3;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ll, ll> LP;\\ntypedef pair<ld, ld> LDP;\\n\\ntypedef vector<ld> vec;\\ntypedef vector<vec> mat;\\nvoid debag_matrix(const mat &A) {\\n\\trep(i, A.size()) {\\n\\t\\trep(j, A[i].size()){\\n\\t\\t\\tcout << A[i][j] << \\\" \\\";\\n\\t }\\n\\t\\tcout << endl;\\n\\t}\\n}\\nvoid gauss_hakidasi(mat &A) {\\n\\tint n = A.size(), m = A[0].size();\\n\\tint t = min(n, m);\\n\\trep(k, t) {\\n\\t\\tint chk = -1;\\n\\t\\tRep(i,k, n) {\\n\\t\\t\\tif (abs(A[i][k]) > eps) {\\n\\t\\t\\t\\tchk = i; break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (chk < 0)return;\\n\\t\\tswap(A[k], A[chk]);\\n\\t\\tld x = A[k][k];\\n\\t\\trep(i, m) {\\n\\t\\t\\tA[k][i] /= x;\\n\\t\\t}\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (i == k)continue;\\n\\t\\t\\tx = A[i][k];\\n\\t\\t\\trep(j, m) {\\n\\t\\t\\t\\tA[i][j] -= x * A[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint n;\\nld d[10];\\n\\nbool valid(int id, mat A) {\\n\\tgauss_hakidasi(A);\\n\\t//debag_matrix(A);\\n\\tld sum = 0;\\n\\tld cur = 1;\\n\\tper(i, n + 1) {\\n\\t\\tsum += A[i][n+1] * cur; cur *= id;\\n\\t}\\n\\treturn abs(sum - d[id]) < eps;\\n}\\nint main() {\\n\\twhile (cin >> n, n) {\\n\\t\\trep(i, n + 3)cin >> d[i];\\n\\t\\trep(i, n + 3) {\\n\\t\\t\\tmat A; int ck = 0;\\n\\t\\t\\tper(j, n + 3) {\\n\\t\\t\\t\\tif (i == j)continue;\\n\\t\\t\\t\\tvector<ld> v;\\n\\t\\t\\t\\tld cur = 1;\\n\\t\\t\\t\\trep(k, n + 1) {\\n\\t\\t\\t\\t\\tv.push_back(cur);\\n\\t\\t\\t\\t\\tcur *= j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treverse(v.begin(), v.end());\\n\\t\\t\\t\\tv.push_back(d[j]);\\n\\t\\t\\t\\tif (A.size() < n + 1)A.push_back(v);\\n\\t\\t\\t\\telse ck = j;\\n\\t\\t\\t}\\n\\t\\t\\t//debag_matrix(A);\\n\\t\\t\\t//cout << ck << endl;\\n\\t\\t\\tif (valid(ck, A)) {\\n\\t\\t\\t\\tcout << i << endl; break;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\t//cout << \\\"finish\\\" << endl;\\n\\t}\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.2018,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":779,"cells":{"group_id":{"kind":"string","value":"aoj_1326_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nStylish\nStylish\nis a programming language whose syntax comprises\nnames\n, that are sequences of Latin alphabet letters, three types of\ngrouping symbols\n, periods ('.'), and newlines. Grouping symbols, namely round brackets ('(' and ')'), curly brackets ('{' and '}'), and square brackets ('[' and ']'), must match and be nested properly. Unlike most other programming languages, Stylish uses periods instead of whitespaces for the purpose of term separation. The following is an example of a Stylish program.\n1 ( Welcome .to\n2 ......... Stylish )\n3 { Stylish .is\n4 .....[.( a. programming . language .fun .to. learn )\n5 .......]\n6 ..... Maybe .[\n7 ....... It. will .be.an. official . ICPC . language\n8 .......]\n9 .....}\nAs you see in the example, a Stylish program is indented by periods. The\namount of indentation\nof a line is the number of leading periods of it.\nYour mission is to visit Stylish masters, learn their indentation styles, and become the youngest Stylish master. An indentation style for\nwell-indented\nStylish programs is defined by a triple of integers, (\nR\n,\nC\n,\nS\n), satisfying 1 ≤\nR\n,\nC\n,\nS\n≤ 20.\nR\n,\nC\nand\nS\nare amounts of indentation introduced by an open round bracket, an open curly bracket, and an open square bracket, respectively.\nIn a well-indented program, the amount of indentation of a line is given by\nR\n(\nr\no\n−\nr\nc\n) +\nC\n(\nc\no\n−\nc\nc\n) +\nS\n(\ns\no\n−\ns\nc\n), where\nr\no\n,\nc\no\n, and\ns\no\nare the numbers of occurrences of open round, curly, and square brackets in all preceding lines, respectively, and\nr\nc\n,\nc\nc\n, and\ns\nc\nare those of close brackets. The first line has no indentation in any well-indented program.\nThe above example is formatted in the indentation style (\nR\n,\nC\n,\nS\n) = (9, 5, 2). The only grouping symbol occurring in the first line of the above program is an open round bracket. Therefore the amount of indentation for the second line is 9 · (1 − 0) + 5 · (0 − 0) + 2 ·(0 − 0) = 9. The first four lines contain two open round brackets, one open curly bracket, one open square bracket, two close round brackets, but no close curly nor square bracket. Therefore the amount of indentation for the fifth line is 9 · (2 − 2) + 5 · (1 − 0) + 2 · (1 − 0) = 7.\nStylish masters write only well-indented Stylish programs. Every master has his/her own indentation style.\nWrite a program that imitates indentation styles of Stylish masters.\nInput\nThe input consists of multiple datasets. The first line of a dataset contains two integers\np\n(1 ≤\np\n≤ 10) and\nq\n(1 ≤\nq\n≤ 10). The next\np\nlines form a well-indented program\nP\nwritten by a\nStylish master and the following\nq\nlines form another program\nQ\n. You may assume that every line of both programs has at least one character and at most 80 characters. Also, you may assume that no line of\nQ\nstarts with a period.\nThe last dataset is followed by a line containing two zeros.\nOutput\nApply the indentation style of\nP\nto\nQ\nand output the appropriate amount of indentation for each line of\nQ\n. The amounts must b\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1326_9614938","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nstruct Data {\n int A, B, C;\n Data(int a, int b, int c) : A(a), B(b), C(c) {};\n};\n\nbool Check(vector<string>& S, int A, int B, int C) {\n int CA = 0, CB = 0, CC = 0;\n int N = S.size();\n rep(i,0,N) {\n int COUNT = 0;\n while(COUNT < S[i].size()) {\n if (S[i][COUNT] == '.') COUNT++;\n else break;\n }\n if (COUNT != CA * A + CB * B + CC * C) return false;\n rep(j,0,S[i].size()) {\n if (S[i][j] == '(') CA++;\n if (S[i][j] == ')') CA--;\n if (S[i][j] == '{') CB++;\n if (S[i][j] == '}') CB--;\n if (S[i][j] == '[') CC++;\n if (S[i][j] == ']') CC--;\n }\n }\n return true;\n}\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vector<string> S(N), T(M);\n rep(i,0,N) cin >> S[i];\n rep(i,0,M) cin >> T[i];\n vector<Data> X;\n rep(i,1,21) {\n rep(j,1,21) {\n rep(k,1,21) {\n if (Check(S,i,j,k)) X.push_back(Data(i,j,k));\n }\n }\n }\n int CA = 0, CB = 0, CC = 0;\n rep(i,0,M) {\n vector<int> ANS;\n for (Data D : X) {\n ANS.push_back(CA * D.A + CB * D.B + CC * D.C);\n }\n UNIQUE(ANS);\n cout << (ANS.size() == 1 ? ANS[0] : -1) << (i == M - 1 ? '\\n' : ' ');\n rep(j,0,T[i].size()) {\n if (T[i][j] == '(') CA++;\n if (T[i][j] == ')') CA--;\n if (T[i][j] == '{') CB++;\n if (T[i][j] == '}') CB--;\n if (T[i][j] == '[') CC++;\n if (T[i][j] == ']') CC--;\n }\n }\n}\n}","accuracy":1,"time_ms":90,"memory_kb":3544,"score_of_the_acc":-0.4368,"final_rank":12},{"submission_id":"aoj_1326_7558864","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, v) for (auto &e : v)\n#define MM << \" \" <<\n#define pb push_back\n#define eb emplace_back\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\n\ntemplate <typename T>\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <typename T>\nusing maxheap = priority_queue<T>;\n\ntemplate <typename T>\nbool chmax(T &x, const T &y) {\n return (x < y) ? (x = y, true) : false;\n}\n\ntemplate <typename T>\nbool chmin(T &x, const T &y) {\n return (x > y) ? (x = y, true) : false;\n}\n\ntemplate <typename T>\nint flg(T x, int i) {\n return (x >> i) & 1;\n}\n\ntemplate <typename T>\nvoid print(const vector<T> &v, T x = 0) {\n int n = v.size();\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (v.empty()) cout << '\\n';\n}\n\ntemplate <typename T>\nvoid printn(const vector<T> &v, T x = 0) {\n int n = v.size();\n for (int i = 0; i < n; i++) cout << v[i] + x << '\\n';\n}\n\ntemplate <typename T>\nint lb(const vector<T> &v, T x) {\n return lower_bound(begin(v), end(v), x) - begin(v);\n}\n\ntemplate <typename T>\nint ub(const vector<T> &v, T x) {\n return upper_bound(begin(v), end(v), x) - begin(v);\n}\n\ntemplate <typename T>\nvoid rearrange(vector<T> &v) {\n sort(begin(v), end(v));\n v.erase(unique(begin(v), end(v)), end(v));\n}\n\ntemplate <typename T>\nvector<int> id_sort(const vector<T> &v, bool greater = false) {\n int n = v.size();\n vector<int> ret(n);\n iota(begin(ret), end(ret), 0);\n sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });\n return ret;\n}\n\ntemplate <typename S, typename T>\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first + q.first, p.second + q.second);\n}\n\ntemplate <typename S, typename T>\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\n return make_pair(p.first - q.first, p.second - q.second);\n}\n\ntemplate <typename S, typename T>\nistream &operator>>(istream &is, pair<S, T> &p) {\n S a;\n T b;\n is >> a >> b;\n p = make_pair(a, b);\n return is;\n}\n\ntemplate <typename S, typename T>\nostream &operator<<(ostream &os, const pair<S, T> &p) {\n return os << p.first << ' ' << p.second;\n}\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n// const int MOD = 1000000007;\nconst int MOD = 998244353;\n\nvoid solve() {\n int N, M;\n cin >> N >> M;\n\n if (N == 0) exit(0);\n\n vector<string> S(N), T(M);\n rep(i, N) cin >> S[i];\n rep(i, M) cin >> T[i];\n\n vector<int> indent(N, 0);\n rep(i, N) {\n while (indent[i] < sz(S[i]) && S[i][indent[i]] == '.') indent[i]++;\n }\n\n vector<tuple<int, int, int>> candi;\n\n auto check = [&](int r, int c, int s) {\n int sum = 0;\n rep(i, N) {\n if (sum != indent[i]) return false;\n each(e, S[i]) {\n if (e == '(') sum += r;\n if (e == ')') sum -= r;\n if (e == '{') sum += c;\n if (e == '}') sum -= c;\n if (e == '[') sum += s;\n if (e == ']') sum -= s;\n }\n }\n return true;\n };\n\n rep2(r, 1, 21) rep2(c, 1, 21) rep2(s, 1, 21) {\n if (check(r, c, s)) candi.eb(r, c, s);\n }\n\n vector<vector<int>> indents(M);\n for (auto [r, c, s] : candi) {\n int sum = 0;\n rep(i, M) {\n indents[i].eb(sum);\n each(e, T[i]) {\n if (e == '(') sum += r;\n if (e == ')') sum -= r;\n if (e == '{') sum += c;\n if (e == '}') sum -= c;\n if (e == '[') sum += s;\n if (e == ']') sum -= s;\n }\n }\n }\n\n vector<int> ans(M);\n rep(i, M) {\n rearrange(indents[i]);\n if (sz(indents[i]) != 1) {\n ans[i] = -1;\n } else {\n ans[i] = indents[i][0];\n }\n }\n\n print(ans);\n}\n\nint main() {\n while (true) solve();\n}","accuracy":1,"time_ms":90,"memory_kb":3552,"score_of_the_acc":-0.4411,"final_rank":13},{"submission_id":"aoj_1326_7117360","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\n\n#define all(c) std::begin(c), std::end(c)\n\n#ifdef LOCAL\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\ntemplate <class T, class ...Args> void debug_impl(string s, T&& f, Args &&...args) {\n cerr << \"(\" << s << \"): \" << \"(\" << forward<T>(f);\n ((cerr << \", \" << forward<Args>(args)), ..., (cerr << \")\\n\"));\n}\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\n\n\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\n for (auto& e : v) in >> e;\n return in;\n}\ntemplate <class ...Args> void read(Args&... args) {\n (cin >> ... >> args);\n}\n\ntemplate <class T> ostream& operator>>(ostream& out, const vector<T>& v) {\n int n = v.size();\n rep(i, n) {\n out << v[i];\n if (i + 1 != n) out << ' ';\n }\n return out;\n}\n\ntemplate <class T, class ...Tails> void print(T&& h, Tails &&... tails) {\n cout << h, ((cout << ' ' << forward<Tails>(tails)), ..., (cout << '\\n'));\n}\n\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\n#define si(c) (int)(c).size()\n#define eb emplace_back\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int p, q;\n while(cin >> p >> q) {\n if(p == 0 and q == 0) break;\n vvc<int> ans(q);\n vc<string> s(p + q); read(s);\n for(int x = 1; x <= 20; ++ x) {\n for(int y = 1; y <= 20; ++ y) {\n for(int z = 1; z <= 20; ++ z) {\n int cx = 0, cy = 0, cz = 0;\n bool ok = 1;\n rep(i, p) {\n int cnt = 0;\n while(cnt < (int)s[i].size() and s[i][cnt] == '.') {\n ++ cnt;\n }\n // debug(cnt);\n if(x * cx + y * cy + z * cz != cnt) {\n ok = 0;\n }\n for(char c: s[i]) {\n if(c == '(') ++ cx;\n else if(c == ')') -- cx;\n\n if(c == '{') ++ cy;\n else if(c == '}') -- cy;\n\n if(c == '[') ++ cz;\n else if(c == ']') -- cz;\n }\n }\n cx = 0, cy = 0, cz = 0;\n rep(j, q) {\n int i = j + p;\n // int cnt = 0;\n // while(cnt < (int)s[i].size() and s[i][cnt] == '.') {\n // ++ cnt;\n // }\n if(ok) {\n ans[j].eb(x * cx + y * cy + z * cz);\n }\n for(char c: s[i]) {\n if(c == '(') ++ cx;\n else if(c == ')') -- cx;\n\n if(c == '{') ++ cy;\n else if(c == '}') -- cy;\n\n if(c == '[') ++ cz;\n else if(c == ']') -- cz;\n }\n }\n }\n }\n }\n vc<int> vs;\n rep(i, q) {\n sort(all(ans[i]));\n ans[i].erase(unique(all(ans[i])), ans[i].end());\n // debug(ans[i]);\n int val = (si(ans[i]) == 1 ? ans[i][0] : -1);\n cout << val << \" \\n\"[i == q - 1];\n }\n }\n}","accuracy":1,"time_ms":570,"memory_kb":3540,"score_of_the_acc":-1.2918,"final_rank":20},{"submission_id":"aoj_1326_6553033","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nvector<int> func(int p,int q){\n {\n string tmp;\n getline(cin,tmp);\n }\n method(readIndent,int,string str){\n rep(i,str.size()){\n if(str[i]!='.')return i;\n }\n return -1;\n };\n method(readLine,string){\n string str;\n getline(cin,str);\n return str;\n };\n using Brackets = array<int,3>;\n method(readBrackets,Brackets,string str){\n Brackets res;\n foreach(i,res)i=0;\n foreach(c,str){\n if(c=='(')++res[0];\n if(c=='{')++res[1];\n if(c=='[')++res[2];\n if(c==')')--res[0];\n if(c=='}')--res[1];\n if(c==']')--res[2];\n }\n return res;\n };\n vector<int> indents(p);\n vector<string> line(p);\n vector<Brackets> shifts(p);\n foreach(i,shifts)foreach(j,i)j=0;\n foreach(i,line)i=readLine();\n set<Brackets> cans;\n rep(i,p){\n indents[i] = readIndent(line[i]);\n if(i){\n rep(j,3)shifts[i][j] += shifts[i-1][j];\n auto add =readBrackets(line[i-1]);\n rep(j,3)shifts[i][j] += add[j];\n }\n }\n method(getCan,set<Brackets>,int indent,Brackets shift){\n set<Brackets> res;\n rep(a,1,21){\n rep(b,1,21){\n rep(c,1,21){\n if(shift[0] * a + shift[1] * b + shift[2] * c == indent){\n res.emplace(Brackets({a,b,c}));\n }\n }\n }\n }\n return res;\n };\n set<Brackets> can = getCan(indents[0],shifts[0]);\n rep(i,1,p){\n auto adds = getCan(indents[i],shifts[i]);\n set<Brackets> next;\n foreach(c,can){\n if(adds.count(c))next.emplace(c);\n }\n swap(can,next);\n }\n vector<int> res;\n Brackets shift;\n foreach(i,shift)i=0;\n rep(_,q){\n string str = readLine();\n set<int> ans;\n foreach(c,can){\n ans.emplace(shift[0] * c[0] + shift[1] * c[1] + shift[2] * c[2]);\n }\n if(ans.size()==1){\n res.emplace_back(*ans.begin());\n }else{\n res.emplace_back(-1);\n }\n auto add = readBrackets(str);\n rep(i,3){\n shift[i] += add[i];\n }\n }\n return res;\n}\n\nint main(){\n while(true){\n int p = in();\n int q = in();\n if(p==0)break;\n println(func(p,q));\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":4860,"score_of_the_acc":-1.1607,"final_rank":19},{"submission_id":"aoj_1326_5064779","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\n\nint solve(vector<int> &v, map<vector<int>, int> &mp){\n int ans = -1;\n for(int x = 1; x <= 20; x++){\n for(int y = 1; y <= 20; y++){\n for(int z = 1; z <= 20; z++){\n bool g = true;\n for(auto itr = mp.begin(); itr != mp.end(); itr++){\n if((itr->first)[0] * x + (itr->first)[1] * y + (itr->first)[2] * z != itr->second){\n g = false;\n }\n }\n if(g){\n int s = v[0] * x + v[1] * y + v[2] * z;\n if(ans == -1) ans = s;\n else if(ans != s) ans = -2;\n }\n }\n }\n }\n if(ans < 0) ans = -1;\n return ans;\n}\n\nint main()\n{\n while(true){\n int n, m;\n cin >> n >> m;\n if(n == 0 && m == 0) break;\n string p[12], q[12];\n for(int i = 0; i < n; i++) cin >> p[i];\n for(int i = 0; i < m; i++) cin >> q[i];\n map<vector<int>, int> mp;\n vector<int> r(3);\n for(int i = 0; i < n; i++){\n int l = 0;\n while(p[i][l] == '.') l++;\n mp[r] = l;\n for(int j = l; j < (int)p[i].size(); j++){\n if(p[i][j] == '(') r[0]++;\n if(p[i][j] == ')') r[0]--;\n if(p[i][j] == '[') r[1]++;\n if(p[i][j] == ']') r[1]--;\n if(p[i][j] == '{') r[2]++;\n if(p[i][j] == '}') r[2]--;\n }\n }\n vector<int> v(3);\n for(int i = 0; i < m; i++){\n if(i > 0) cout << \" \";\n cout << solve(v, mp);\n for(int j = 0; j < (int)q[i].size(); j++){\n if(q[i][j] == '(') v[0]++;\n if(q[i][j] == ')') v[0]--;\n if(q[i][j] == '[') v[1]++;\n if(q[i][j] == ']') v[1]--;\n if(q[i][j] == '{') v[2]++;\n if(q[i][j] == '}') v[2]--;\n }\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3068,"score_of_the_acc":-0.0565,"final_rank":1},{"submission_id":"aoj_1326_5036953","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 4020000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nint main(){\n while(1){\n int n,m; cin >> n >> m;\n if(!n) break;\n vector<string> a(n), b(m);\n rep(i,n) cin >> a[i];\n rep(i,m) cin >> b[i];\n vector<int> ans(m,inf);\n bool no = false;\n for(int R=1; R<=20; R++){\n for(int C=1; C<=20; C++){\n for(int S=1; S<=20; S++){\n int r=0,c=0,s=0;\n bool f = true;\n rep(i,n){\n int cnt = 0;\n while(cnt < a[i].size() && a[i][cnt] == '.') cnt++;\n if(cnt != R*r+C*c+S*s) f = false;\n for(auto j : a[i]){\n if(j == '(') r++;\n if(j == ')') r--;\n if(j == '{') c++;\n if(j == '}') c--;\n if(j == '[') s++;\n if(j == ']') s--;\n }\n }\n if(!f) continue;\n rep(i,m){\n int res = R*r + C*c + S*s;\n if(ans[i] != inf && ans[i] != res){\n ans[i] = -1;\n }else if(ans[i] != -1){\n ans[i] = res;\n }\n for(auto j : b[i]){\n if(j == '(') r++;\n if(j == ')') r--;\n if(j == '{') c++;\n if(j == '}') c--;\n if(j == '[') s++;\n if(j == ']') s--;\n }\n }\n }\n }\n }\n rep(i,m) cout << ans[i] << \" \\n\"[i==m-1];\n }\n}","accuracy":1,"time_ms":410,"memory_kb":3172,"score_of_the_acc":-0.8087,"final_rank":18},{"submission_id":"aoj_1326_4967066","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nstring P[10], Q[10];\nint p, q;\n\nbool match(int R, int C, int S) {\n int r = 0, c = 0, s = 0;\n for (int i = 0; i < p; i++) {\n int pos = 0;\n while (pos < P[i].size() && P[i][pos] == '.')\n pos++;\n if (pos != R * r + C * c + S * s) {\n return false;\n }\n while (pos < P[i].size()) {\n if (P[i][pos] == '(')\n r++;\n else if (P[i][pos] == ')')\n r--;\n else if (P[i][pos] == '{')\n c++;\n else if (P[i][pos] == '}')\n c--;\n else if (P[i][pos] == '[')\n s++;\n else if (P[i][pos] == ']')\n s--;\n pos++;\n }\n }\n return true;\n}\n\nint main() {\n while (1) {\n cin >> p >> q;\n if (p == 0)\n break;\n getchar();\n for (int i = 0; i < p; i++) {\n getline(cin, P[i]);\n }\n for (int i = 0; i < q; i++) {\n getline(cin, Q[i]);\n }\n int cnt = 0;\n vector<int> R, C, S;\n for (int i = 1; i <= 20; i++) {\n for (int j = 1; j <= 20; j++) {\n for (int k = 1; k <= 20; k++) {\n if (match(i, j, k)) {\n R.push_back(i);\n C.push_back(j);\n S.push_back(k);\n }\n }\n }\n }\n vector<int> ans;\n int r = 0, c = 0, s = 0;\n for (int i = 0; i < q; i++) {\n bool ok = 0;\n int indent = -1;\n for (int j = 0; j < R.size(); j++) {\n int x = R[j] * r + C[j] * c + S[j] * s;\n if (indent == -1) {\n indent = x;\n ok = 1;\n } else if (indent != x) {\n ok = 0;\n }\n }\n if (ok)\n ans.push_back(indent);\n else\n ans.push_back(-1);\n int pos = 0;\n while (pos < Q[i].size()) {\n if (Q[i][pos] == '(')\n r++;\n else if (Q[i][pos] == ')')\n r--;\n else if (Q[i][pos] == '{')\n c++;\n else if (Q[i][pos] == '}')\n c--;\n else if (Q[i][pos] == '[')\n s++;\n else if (Q[i][pos] == ']')\n s--;\n pos++;\n }\n }\n cout << ans[0];\n for (int i = 1; i < q; i++)\n cout << \" \" << ans[i];\n cout << '\\n';\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3476,"score_of_the_acc":-0.3647,"final_rank":9},{"submission_id":"aoj_1326_4931380","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h> \n#include <functional>\n#include <cassert>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\nbool solve(){\n int N,M;\n cin >> N >> M;\n if(N==0 && M==0) return false;\n vector<string> GN(N);\n for(int i=0; i<N; i++) cin >> GN[i];\n vector<string> GM(M);\n for(int i=0; i<M; i++) cin >> GM[i]; \n // (){}[]cnt\n vector<pair<vector<int>,int>> p;\n vector<int> cnt(3,0);\n string in = \"({[\";\n string out = \")}]\";\n for(int i=0; i<N; i++){\n int num = 0;\n for(int j=0; j<GN[i].size(); j++){\n if(GN[i][j] != '.') break;\n num++;\n }\n p.emplace_back(cnt,num);\n for(int j=0; j<GN[i].size(); j++){\n for(int k=0; k<3; k++){\n if(GN[i][j] == in[k]) cnt[k]++;\n if(GN[i][j] == out[k]) cnt[k]--;\n }\n }\n }\n vector<vector<int>> num;\n for(int i=1; i<=20; i++){\n for(int j=1; j<=20; j++){\n for(int k=1; k<=20; k++){\n bool ok = true;\n for(int l=0; l<p.size(); l++){\n vector<int> now;\n int cnt;\n tie(now,cnt) = p[l];\n if(i*now[0]+j*now[1]+k*now[2] != cnt) ok = false;\n }\n if(ok){\n vector<int> pu(3);\n pu[0] = i;\n pu[1] = j;\n pu[2] = k;\n num.emplace_back(pu);\n }\n }\n }\n }\n vector<int> ans(M,-1);\n for(int i=0; i<M; i++){\n set<int> can;\n for(int j=0; j<num.size(); j++){\n int now = 0;\n for(int k=0; k<3; k++){\n now += cnt[k]*num[j][k];\n }\n can.emplace(now);\n }\n if(can.size() == 1) ans[i] = *can.begin();\n for(int j=0; j<GM[i].size(); j++){\n for(int k=0; k<3; k++){\n if(GM[i][j] == in[k]) cnt[k]++;\n if(GM[i][j] == out[k]) cnt[k]--;\n }\n }\n }\n for(int i=0; i<M; i++){\n cout << ans[i] << \" \\n\"[i+1==M];\n }\n return true;\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4116,"score_of_the_acc":-0.6366,"final_rank":16},{"submission_id":"aoj_1326_4416871","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define SZ(x) (int)(x.size())\n#define REP(i, n) for(int i=0;i<(n);++i)\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RREP(i, n) for(int i=(int)(n)-1;i>=0;--i)\n#define RFOR(i, a, b) for(int i=(int)(b)-1;i>=(a);--i)\n#define ALL(a) a.begin(),a.end()\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n#define DEBUG(x) cerr<<#x<<\" = \"<<(x)<<\" (L\"<<__LINE__<<\")\"<< endl;\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing P = pair<int, int>;\nconst double eps = 1e-8;\nconst ll MOD = 1000000007;\nconst int INF = INT_MAX / 2;\nconst ll LINF = LLONG_MAX / 2;\ntemplate <typename T1, typename T2>\nbool chmax(T1 &a, const T2 &b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate <typename T1, typename T2>\nbool chmin(T1 &a, const T2 &b) {\n if (a > b) { a = b; return true; }\n return false;\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n os << p.first << \":\" << p.second;\n return os;\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const map<T1, T2> &mp) {\n os << \"{\";\n int a = 0;\n for (auto &tp : mp) {\n if (a) os << \", \"; a = 1;\n os << tp;\n }\n return os << \"}\";\n}\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n os << \"[\";\n REP(i, SZ(v)) {\n if (i) os << \", \";\n os << v[i];\n }\n return os << \"]\";\n}\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n for (;;) {\n int p, q; cin >> p >> q;\n if (p == 0) break;\n vector<map<char,int>> cnt(p);\n vector<int> indent(p);\n map<char,int> count;\n REP(i, p) {\n string s; cin >> s;\n int j = 0;\n while (j < SZ(s) and s[j] == '.') ++j;\n indent[i] = j;\n for (; j < SZ(s); ++j) {\n if (s[j] == '(') ++count['('];\n if (s[j] == ')') --count['('];\n if (s[j] == '{') ++count['{'];\n if (s[j] == '}') --count['{'];\n if (s[j] == '[') ++count['['];\n if (s[j] == ']') --count['['];\n }\n cnt[i] = count;\n }\n\n vector<tuple<int,int,int>> cands;\n FOR(r, 1, 21) {\n FOR(c, 1, 21) {\n FOR(s, 1, 21) {\n int valid = 1;\n REP(i, p-1) {\n if (r * cnt[i]['('] + c * cnt[i]['{'] + s * cnt[i]['['] != indent[i+1]) valid = 0;\n }\n if (valid) {\n cands.emplace_back(r, c, s);\n }\n }\n }\n }\n\n count.clear();\n vi ans(q);\n REP(i, q) {\n string s; cin >> s;\n if (i == q-1) continue;\n for (char c : s) {\n if (c == '(') ++count['('];\n if (c == ')') --count['('];\n if (c == '{') ++count['{'];\n if (c == '}') --count['{'];\n if (c == '[') ++count['['];\n if (c == ']') --count['['];\n }\n\n map<int,int> value;\n for (auto &tp : cands) {\n int r, c, s; tie(r, c, s) = tp;\n value[r * count['('] + c * count['{'] + s * count['[']] = 1;\n }\n if (value.size() > 1) ans[i+1] = -1;\n else ans[i+1] = value.begin()->first;\n }\n\n REP(i, q) {\n if (i) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3352,"score_of_the_acc":-0.191,"final_rank":5},{"submission_id":"aoj_1326_3967206","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n#include <tuple>\nusing namespace std;\n\nint main() {\n int p, q;\n while (cin >> p >> q, p) {\n vector<vector<int>> a(p, vector<int>(3));\n vector<int> b(p);\n {\n map<char, int> cnt;\n for (int i = 0; i < p; i++) {\n a[i][0] = cnt['('] - cnt[')'];\n a[i][1] = cnt['{'] - cnt['}'];\n a[i][2] = cnt['['] - cnt[']'];\n string s; cin >> s;\n int& ind = b[i];\n while (ind < s.size() && s[ind] == '.') ind++;\n for (auto c: s) cnt[c]++;\n }\n }\n set<tuple<int, int, int>> se;\n for (int r = 1; r <= 20; r++) {\n for (int c = 1; c <= 20; c++) {\n for (int s = 1; s <= 20; s++) {\n bool ok = true;\n for (int i = 0; i < p; i++) {\n ok &= a[i][0] * r + a[i][1] * c + a[i][2] * s == b[i];\n }\n if (ok) se.emplace(r, c, s);\n }\n }\n }\n vector<int> res(q); {\n map<char, int> cnt;\n for (int i = 0; i < q; i++) {\n set<int> ans;\n for (auto &t: se) {\n int tmp = 0;\n tmp += (cnt['('] - cnt[')']) * get<0>(t);\n tmp += (cnt['{'] - cnt['}']) * get<1>(t);\n tmp += (cnt['['] - cnt[']']) * get<2>(t);\n ans.emplace(tmp);\n }\n res[i] = ans.size() == 1 ? *ans.begin() : -1;\n string s; cin >> s;\n for (auto c: s) cnt[c]++;\n }\n }\n for (int i = 0; i < q; i++) cout << res[i] << \" \\n\"[i == q - 1];\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3644,"score_of_the_acc":-0.3476,"final_rank":7},{"submission_id":"aoj_1326_3896889","code_snippet":"#include <bits/stdc++.h>\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\n#define pr1(a) (#a)<<\"=\"<<(a)<<\" \"\n#define pr2(a,b) pr1(a)<<pr1(b)\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\n#define prArr(a) {cerr<<(#a)<<\"={\";int i=0;for(auto t:(a))cerr<<(i++?\", \":\"\")<<t;cerr<<\"}\"<<endl;}\nusing namespace std;\nusing Int = long long;\nusing _int = int;\nusing ll = long long;\nusing Double = long double;\nconst Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18\nconst Int mod = (1e9)+7;\nconst Double EPS = 1e-8;\nconst Double PI = 6.0 * asin((Double)0.5);\nusing P = pair<Int,Int>;\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\n return o<<\"(\"<<get<0>(t)<<\",\"<<get<1>(t)<<\",\"<<get<2>(t)<<\")\";}\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?\" \":\"\")<<t;return o;}\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\n//INSERT ABOVE HERE\n\n\n\nvoid count(Int &a, Int &b, Int &c, char ch){\n if(ch == '(') a++;\n if(ch == ')') a--;\n if(ch == '{') b++;\n if(ch == '}') b--;\n if(ch == '[') c++;\n if(ch == ']') c--;\n assert(a >= 0 && b >= 0 && c >= 0);\n}\n\nInt check(vector<string> &code, Int R, Int C, Int S){\n Int a = 0, b = 0, c = 0;\n for(string &s: code){\n Int idx = 0;\n Int cnt = 0;\n while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;\n\n if(R * a + C * b + S * c != cnt) return 0;\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\n }\n assert(a == 0 && b == 0 && c == 0);\n return 1;\n}\n\nusing T = tuple<Int,Int,Int>;\nmap<T, Int> calcMem(vector<string> &code){\n Int a = 0, b = 0, c = 0;\n map<T, Int> res;\n for(string &s: code){\n Int idx = 0;\n Int cnt = 0;\n while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;\n res[T(a, b, c)] = cnt;\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\n }\n return res;\n}\n\n\n\n\nsigned main(){\n srand((unsigned)time(NULL));\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n while(1){\n Int n, m;\n cin>>n>>m;\n if(n == 0 && m == 0) break;\n vector<string> code1(n);\n cin>>code1;\n vector<string> code2(m);\n cin>>code2;\n\n set<Int> R, C, S;\n for(Int i=1;i<=20;i++)\n for(Int j=1;j<=20;j++)\n for(Int k=1;k<=20;k++){\n if(!check(code1, i, j, k)) continue;\n R.insert(i);\n C.insert(j);\n S.insert(k);\n }\n\n {\n map<T, Int> mem = calcMem(code1);\n vector<Int> ans;\n Int a = 0, b = 0, c = 0;\n for(string s:code2){\n Int num = 0;\n Int valid = 1;\n if(a != 0){\n valid &= R.size() == 1;\n if(valid) num += *R.begin() * a;\n }\n if(b != 0){\n valid &= C.size() == 1;\n if(valid) num += *C.begin() * b;\n }\n if(c != 0){\n valid &= S.size() == 1;\n if(valid) num += *S.begin() * c;\n }\n\n if(mem.count(T(a, b, c))) {valid = 1, num = mem[T(a, b, c)];}\n\n Int idx = 0;\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\n if(!valid) ans.push_back(-1);\n else ans.push_back(num);\n }\n cout<<ans<<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3228,"score_of_the_acc":-0.3745,"final_rank":10},{"submission_id":"aoj_1326_3832743","code_snippet":"#if __has_include(\"../library/Basic/Debug.hpp\")\n\n#include \"../library/Basic/Debug.hpp\"\n\n#else\n\n/* ----- Header Files ----- */\n// IO\n#include <cstdio>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n\n// algorithm\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n\n// container\n#include <vector>\n#include <string>\n#include <tuple>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <deque>\n\n// others\n#include <random>\n#include <limits>\n#include <functional>\n#include <ctime>\n#include <cassert>\n#include <cstdint>\n\n\n/* ----- Type Alias ----- */\nusing Int = long long int;\nusing Real = long double;\nusing String = std::string;\ntemplate <class... Ts>\nusing Tuple = std::tuple<Ts...>;\n\ntemplate <class T>\nusing Vector = std::vector<T>;\ntemplate <class T>\nusing Queue = std::queue<T>;\ntemplate <class T>\nusing Stack = std::stack<T>;\ntemplate <class T>\nusing Deque = std::deque<T>;\n\ntemplate <class T>\nusing MaxHeap = std::priority_queue<T>;\ntemplate <class T>\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T>\nusing Set = std::set<T>;\ntemplate <class T, class U>\nusing Map = std::map<T, U>;\n\ntemplate <class T, class... Us>\nusing Func = std::function<T(Us...)>;\n\ntemplate <class T>\nT genv(T v) { return v; }\n\ntemplate <class T, class... Ts>\nauto genv(size_t l, Ts... ts) {\n return Vector<decltype(genv<T>(ts...))>(l, Vector<T>(ts...));\n}\n\ntemplate <class Cost = Int>\nstruct Edge {\n Int src, dst;\n Cost cost;\n Edge(Int src = -1, Int dst = -1, Cost cost = 1)\n : src(src), dst(dst), cost(cost){};\n\n bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }\n bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }\n};\n\ntemplate <class Cost = Int>\nusing Edges = Vector<Edge<Cost>>;\ntemplate <class Cost = Int>\nusing Graph = Vector<Vector<Edge<Cost>>>;\n\n#endif\n\n/* ----- Misc ----- */\nvoid fastio() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n}\n\nstruct Fout {\n Int precision;\n Fout(Int precision) : precision(precision) {}\n};\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\n os << std::fixed << std::setprecision(fio.precision);\n return os;\n}\n\n\n/* ----- Constants ----- */\n// constexpr Int INF = std::numeric_limits<Int>::max() / 1000;\n// constexpr Int MOD = 1000000007;\n// constexpr Real PI = acos(-1);\n// constexpr Real EPS = 1e-10;\n// std::mt19937 mt(int(std::time(nullptr)));\n\nInt parse(const String& s, Vector<Int>& cnt) {\n Int i;\n for (i = 0; s[i] == '.'; ++i) {}\n\n for (char c : s) {\n switch (c) {\n case '(':\n ++cnt[0];\n break;\n case ')':\n --cnt[0];\n break;\n case '{':\n ++cnt[1];\n break;\n case '}':\n --cnt[1];\n break;\n case '[':\n ++cnt[2];\n break;\n case ']':\n --cnt[2];\n break;\n default:\n break;\n }\n }\n return i;\n}\n\nbool solve() {\n Int n, m;\n std::cin >> n >> m;\n if (n == 0) return false;\n\n Vector<Tuple<Vector<Int>, Int>> lines(n);\n Vector<Int> cnt(3, 0);\n for (auto& l : lines) {\n String s;\n std::cin >> s;\n\n Vector<Int> prev = cnt;\n Int dots = parse(s, cnt);\n l = std::make_tuple(prev, dots);\n }\n\n Vector<Vector<Int>> pos;\n Vector<Int> x(3);\n for (x[0] = 1; x[0] <= 20; ++x[0]) {\n for (x[1] = 1; x[1] <= 20; ++x[1]) {\n for (x[2] = 1; x[2] <= 20; ++x[2]) {\n bool judge = true;\n\n for (auto l : lines) {\n Vector<Int> v;\n Int s;\n std::tie(v, s) = l;\n\n for (Int i = 0; i < 3; ++i) s -= v[i] * x[i];\n if (s != 0) judge = false;\n }\n\n if (judge) pos.push_back(x);\n }\n }\n }\n\n fill(cnt.begin(), cnt.end(), 0);\n for (Int i = 0; i < m; ++i) {\n String s;\n std::cin >> s;\n\n Vector<Int> prev = cnt;\n parse(s, cnt);\n\n Set<Int> ans;\n for (const auto& x : pos) {\n Int sum = 0;\n for (Int i = 0; i < 3; ++i) sum += x[i] * prev[i];\n ans.insert(sum);\n }\n\n std::cout << (ans.size() == 1 ? *ans.begin() : -1) << \" \\n\"[i == m - 1];\n }\n return true;\n}\n\nint main() {\n while (solve()) {}\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3392,"score_of_the_acc":-0.4089,"final_rank":11},{"submission_id":"aoj_1326_3703883","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e16;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\nll p,q;\n\nvector<string> PP,Q;\nvector<ll> ans;\n\nchar ot[] = {'(','{','['};\nchar ct[] = {')','}',']'};\n\nbool check(ll r,ll c,ll s){\n ll cost[] = {r,c,s};\n ll sum = 0;\n rep(i,PP.size() - 1){\n ll cnt = 0;\n rep(j,PP[i].size()){\n rep(k,3){\n if(ot[k] == PP[i][j])sum += cost[k];\n if(ct[k] == PP[i][j])sum -= cost[k];\n }\n }\n\n rep(j,PP[i+1].size()){\n if(PP[i+1][j] != '.')break;\n cnt++;\n }\n if(cnt != sum)return false;\n }\n return true;\n}\n\nvoid solve(ll r,ll c,ll s){\n ll cnt[3] = {}; \n rep(i,Q.size() - 1){\n rep(j,Q[i].size()){\n rep(k,3){\n if(ot[k] == Q[i][j])cnt[k]++;\n if(ct[k] == Q[i][j])cnt[k]--;\n }\n }\n ll nn = cnt[0]*r + cnt[1]*c + cnt[2]*s;\n if(ans[i] == 0)ans[i] = nn;\n else if(ans[i] != nn)ans[i] = -1;\n }\n}\n\nint main(){\n while(cin >> p >> q && p){\n PP.clear();\n Q.clear();\n ans.clear();\n ans.resize(q-1,0);\n rep(i,p){\n string s;\n cin >> s;\n PP.push_back(s);\n }\n rep(i,q){\n string s;\n cin >> s;\n Q.push_back(s);\n }\n FOR(r,1,21){\n FOR(c,1,21){\n FOR(s,1,21){\n if(check(r,c,s)){\n // cout << r << \" \" << c << \" \" << s << endl;\n solve(r,c,s);\n }\n }\n }\n }\n cout << 0 << \" \";\n rep(i,ans.size()){\n if(i != ans.size() - 1)cout << ans[i] << \" \";\n else cout << ans[i] << endl;\n }\n }\n}","accuracy":1,"time_ms":300,"memory_kb":3140,"score_of_the_acc":-0.5951,"final_rank":15},{"submission_id":"aoj_1326_3637837","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nint a[100][100][100];\n\nvoid solve(int n,int m){\n map<int,int> mp;\n int x=0,y=0,z=0;\n rep(i,n){\n string s;cin>>s;\n int c=0;\n while(c<s.size()&&s[c]=='.')++c;\n mp[10000*x+100*y+z]=c;\n rep(j,s.size()){\n if(s[j]=='(')++x;\n if(s[j]==')')--x;\n if(s[j]=='{')++y;\n if(s[j]=='}')--y;\n if(s[j]=='[')++z;\n if(s[j]==']')--z;\n }\n }\n vector<int> P,Q,R;\n REP(i,1,21)REP(j,1,21)REP(k,1,21){\n bool ok=true;\n for(auto p : mp){\n if(i*(p.first/10000)+j*(p.first/100%100)+k*(p.first%100)!=p.second)ok=false;\n }\n if(ok){\n P.push_back(i);\n Q.push_back(j);\n R.push_back(k);\n }\n }\n x=0,y=0,z=0;\n rep(i,m){\n string s;\n cin>>s;\n if(mp.count(10000*x+100*y+z))cout<<mp[10000*x+100*y+z];\n else {\n set<int> st;\n rep(j,P.size()){\n st.insert(x*P[j]+y*Q[j]+z*R[j]);\n }\n if(st.size()==1)cout<<*st.begin();\n else cout<<-1;\n }\n rep(j,s.size()){\n if(s[j]=='(')++x;\n if(s[j]==')')--x;\n if(s[j]=='{')++y;\n if(s[j]=='}')--y;\n if(s[j]=='[')++z;\n if(s[j]==']')--z;\n }\n if(i!=m-1)cout<<\" \";\n else cout<<endl;\n }\n}\nint main(){\n int n,m;\n while(cin>>n>>m,n)solve(n,m);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3344,"score_of_the_acc":-0.1867,"final_rank":4},{"submission_id":"aoj_1326_3635083","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <iomanip>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = uint32_t;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\nvoid solve(int p, int q){\n vector<string> v(p), u(q);\n for (auto &&i : v) cin >> i;\n for (auto &&i : u) cin >> i;\n vector<int> ans(q, -2);\n for (int R = 1; R <= 20; ++R) {\n for (int C = 1; C <= 20; ++C) {\n for (int S = 1; S <= 20; ++S) {\n int cnt1 = 0, cnt2 = 0, cnt3 = 0;\n int ok = 1;\n for (int i = 0; i < p; ++i) {\n int x = 0;\n for (auto &&j : v[i]) {\n if(j == '.') x++;\n else break;\n }\n if(x != R*cnt1+C*cnt2+S*cnt3){\n ok = 0;\n break;\n }\n for (auto &&j : v[i]) {\n if(j == '(') cnt1++;\n if(j == ')') cnt1--;\n if(j == '{') cnt2++;\n if(j == '}') cnt2--;\n if(j == '[') cnt3++;\n if(j == ']') cnt3--;\n }\n }\n if(!ok) continue;\n for (int i = 0; i < q; ++i) {\n if(ans[i] == -2){\n ans[i] = R*cnt1+C*cnt2+S*cnt3;\n } else if(ans[i] != R*cnt1+C*cnt2+S*cnt3){\n ans[i] = -1;\n }\n for (auto &&j : u[i]) {\n if(j == '(') cnt1++;\n if(j == ')') cnt1--;\n if(j == '{') cnt2++;\n if(j == '}') cnt2--;\n if(j == '[') cnt3++;\n if(j == ']') cnt3--;\n }\n }\n }\n }\n }\n for (int i = 0; i < q; ++i) {\n if(i) printf(\" \");\n printf(\"%d\", ans[i]);\n }\n puts(\"\");\n}\nint main() {\n int p, q;\n while(cin >> p >> q, p){\n solve(p, q);\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3180,"score_of_the_acc":-0.3487,"final_rank":8},{"submission_id":"aoj_1326_3372204","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint n,m;\nstring ss[10];\nmain()\n{\n\twhile(cin>>n>>m,n)\n\t{\n\t\tfor(int i=0;i<n;i++)cin>>ss[i];\n\t\tvector<int>R,C,S;\n\t\tfor(int r=1;r<21;r++)for(int c=1;c<21;c++)for(int s=1;s<21;s++)\n\t\t{\n\t\t\tbool flag=1;\n\t\t\tint cr=0,cc=0,cs=0;\n\t\t\tfor(int i=0;i<n;i++)\n\t\t\t{\n\t\t\t\tint cnt=0;\n\t\t\t\tfor(int j=0;j<ss[i].size()&&ss[i][j]=='.';j++)cnt++;\n\t\t\t\tif(cr*r+cc*c+cs*s!=cnt)\n\t\t\t\t{\n\t\t\t\t\tflag=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfor(int j=0;j<ss[i].size();j++)\n\t\t\t\t{\n\t\t\t\t\tif(ss[i][j]=='(')cr++;\n\t\t\t\t\telse if(ss[i][j]==')')cr--;\n\t\t\t\t\telse if(ss[i][j]=='{')cc++;\n\t\t\t\t\telse if(ss[i][j]=='}')cc--;\n\t\t\t\t\telse if(ss[i][j]=='[')cs++;\n\t\t\t\t\telse if(ss[i][j]==']')cs--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flag)\n\t\t\t{\n\t\t\t\tR.push_back(r);\n\t\t\t\tC.push_back(c);\n\t\t\t\tS.push_back(s);\n\t\t\t}\n\t\t}\n\t\tvector<int>ans;\n\t\tint cr=0,cc=0,cs=0;\n\t\tfor(;m--;)\n\t\t{\n\t\t\tstring t;cin>>t;\n\t\t\tint cnt=-1;\n\t\t\tfor(int j=0;j<R.size();j++)\n\t\t\t{\n\t\t\t\tint now=cr*R[j]+cc*C[j]+cs*S[j];\n\t\t\t\tif(cnt<0)cnt=now;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(cnt!=now)cnt=114514;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cnt==114514)ans.push_back(-1);\n\t\t\telse ans.push_back(cnt);\n\t\t\tfor(int j=0;j<t.size();j++)\n\t\t\t{\n\t\t\t\tif(t[j]=='(')cr++;\n\t\t\t\telse if(t[j]==')')cr--;\n\t\t\t\telse if(t[j]=='{')cc++;\n\t\t\t\telse if(t[j]=='}')cc--;\n\t\t\t\telse if(t[j]=='[')cs++;\n\t\t\t\telse if(t[j]==']')cs--;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<ans.size();i++)cout<<ans[i]<<(i+1==ans.size()?\"\\n\":\" \");\n\t}\n}","accuracy":1,"time_ms":90,"memory_kb":3284,"score_of_the_acc":-0.2974,"final_rank":6},{"submission_id":"aoj_1326_3315042","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int p,int q){\n cin.ignore();\n string buf;\n int ro=0,rc=0,co=0,cc=0,so=0,sc=0;\n auto incl=[&](string str){\n ro+=count(str.begin(),str.end(),'(');\n rc+=count(str.begin(),str.end(),')');\n co+=count(str.begin(),str.end(),'{');\n cc+=count(str.begin(),str.end(),'}');\n so+=count(str.begin(),str.end(),'[');\n sc+=count(str.begin(),str.end(),']');\n };\n auto cntIndent=[](string str){\n int res=0;\n for(int i=0;i<str.size();i++){\n if(str[i]!='.') break;\n res++;\n }\n return res;\n };\n vector<tuple<int,int,int>> rcs;\n for(int i=0;i<20;i++){\n for(int j=0;j<20;j++){\n for(int k=0;k<20;k++){\n rcs.push_back(make_tuple(i+1,j+1,k+1));\n }\n }\n }\n for(int i=0;i<p;i++){\n string str;\n getline(cin,str);\n vector<tuple<int,int,int>> tmp;\n int x=cntIndent(str);\n for(int i=0;i<rcs.size();i++){\n if(get<0>(rcs[i])*(ro-rc)+get<1>(rcs[i])*(co-cc)+get<2>(rcs[i])*(so-sc)==x){\n tmp.push_back(rcs[i]);\n }\n }\n rcs=tmp;\n incl(str);\n }\n ro=rc=0,co=cc=0,so=sc=0;\n vector<int> res;\n for(int i=0;i<q;i++){\n string str;\n getline(cin,str);\n int y=get<0>(rcs[0])*(ro-rc)+get<1>(rcs[0])*(co-cc)+get<2>(rcs[0])*(so-sc);\n for(int i=0;i<rcs.size();i++){\n if(get<0>(rcs[i])*(ro-rc)+get<1>(rcs[i])*(co-cc)+get<2>(rcs[i])*(so-sc)!=y){\n y=-1;\n }\n }\n res.push_back(y);\n incl(str);\n }\n for(int i=0;i<q;i++){\n cout<<res[i]<<(i+1==q ? \"\\n\" : \" \");\n }\n return;\n}\nint main(){\n int p,q;\n while(cin>>p>>q,p){\n solve(p,q);\n }\n return 0; \n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.1245,"final_rank":2},{"submission_id":"aoj_1326_3167991","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,m;\n while(cin>>n>>m,n){\n string s1[11],s2[11];\n for(int i=0;i<n;i++)cin>>s1[i];\n for(int i=0;i<m;i++)cin>>s2[i];\n\n int pi[11];\n for(int i=0;i<n;i++){\n int j=0;\n while(s1[i][j]=='.'){\n j++;\n }\n pi[i]=j;\n }\n\n // for(int i=0;i<n;i++)cout<<\"p \"<<pi[i]<<endl;\n \n int ans[11];\n fill_n(ans,11,-2);\n ans[0]=0;\n \n for(int r=1;r<=20;r++){\n for(int c=1;c<=20;c++){\n for(int s=1;s<=20;s++){\n\t//cout<<r<<\" \"<<c<<\" \"<<s<<endl;\n\tint f=1;\n\t\n\tint cnt[3]={};\n\tfor(int i=0;i<n;i++){\n\t \n\t int t=r*cnt[0]+c*cnt[1]+s*cnt[2];\n\t //if(r==9&&c==5&&s==2)cout<<pi[i]<<\" \"<<t<<endl;\n\t if(t!=pi[i])f=0;\n\t \n\t for(int j=0;j<s1[i].size();j++){\n\t if(s1[i][j]=='(')cnt[0]++;\n\t if(s1[i][j]==')')cnt[0]--;\n\t if(s1[i][j]=='{')cnt[1]++;\n\t if(s1[i][j]=='}')cnt[1]--;\n\t if(s1[i][j]=='[')cnt[2]++;\n\t if(s1[i][j]==']')cnt[2]--;\n\t }\n\t}\n\t\n\tif(f==0)continue;\n\t//cout<<r<<\" \"<<c<<\" \"<<s<<endl;\n\t\n\tcnt[0]=cnt[1]=cnt[2]=0;\n\tfor(int i=0;i<m;i++){\n\t \n\t int t=r*cnt[0]+c*cnt[1]+s*cnt[2];\n\t \n\t if(ans[i]==-2)ans[i]=t;\n\t else if(ans[i]!=t)ans[i]=-1;\n\t \n\t for(int j=0;j<s2[i].size();j++){\n\t if(s2[i][j]=='(')cnt[0]++;\n\t if(s2[i][j]==')')cnt[0]--;\n\t if(s2[i][j]=='{')cnt[1]++;\n\t if(s2[i][j]=='}')cnt[1]--;\n\t if(s2[i][j]=='[')cnt[2]++;\n\t if(s2[i][j]==']')cnt[2]--;\n\t }\n\t}\n\t\n }\n }\n }\n for(int i=0;i<m;i++){\n if(i)cout<<\" \";\n cout<<ans[i];\n }\n\n cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":2996,"score_of_the_acc":-0.5,"final_rank":14},{"submission_id":"aoj_1326_2876276","code_snippet":"#include <iostream>\n#include <string>\n#include <tuple>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n while (true) {\n int p, q;\n cin >> p >> q;\n if (p == 0 && q == 0) {\n return 0;\n }\n\n vector<string> P;\n for (int i = 0; i < p; ++i) {\n string a;\n cin >> a;\n P.push_back(a);\n }\n\n auto processLine = [](const string& line) {\n auto aoi = 0;\n auto groupingNotFound = true;\n auto cr = make_pair(0, 0);\n auto cc = make_pair(0, 0);\n auto cs = make_pair(0, 0);\n for (char i : line) {\n if (groupingNotFound && i == '.') {\n aoi += 1;\n }\n else {\n groupingNotFound = false;\n if (i == '(')\n cr.first += 1;\n else if (i == ')') {\n cr.second += 1;\n }\n else if (i == '{') {\n cc.first += 1;\n }\n else if (i == '}') {\n cc.second += 1;\n }\n else if (i == '[') {\n cs.first += 1;\n }\n else if (i == ']') {\n cs.second += 1;\n }\n }\n }\n return make_tuple(aoi, cr, cc, cs);\n };\n auto computeAoi = [](const tuple<int, int, int>& param,\n const pair<int, int>& r, const pair<int, int>& c,\n const pair<int, int>& s) {\n int R, C, S;\n tie(R, C, S) = param;\n return R * (r.first - r.second) + C * (c.first - c.second) +\n S * (s.first - s.second);\n };\n auto addPair = [](auto& a, const auto& b) {\n a.first += b.first;\n a.second += b.second;\n };\n\n auto candidates = [processLine, computeAoi,\n addPair](const vector<string>& v) {\n auto r = make_pair(0, 0);\n auto c = make_pair(0, 0);\n auto s = make_pair(0, 0);\n vector<tuple<int, int, int>> remainCandidates;\n for (int R = 1; R <= 20; ++R) {\n for (int C = 1; C <= 20; ++C) {\n for (int S = 1; S <= 20; ++S) {\n remainCandidates.emplace_back(R, C, S);\n }\n }\n }\n for (auto&& line : v) {\n int aoi;\n pair<int, int> cr, cc, cs;\n tie(aoi, cr, cc, cs) = processLine(line);\n\n vector<tuple<int, int, int>> temp;\n for (auto&& j : remainCandidates) {\n if (computeAoi(j, r, c, s) == aoi) {\n temp.push_back(move(j));\n }\n }\n swap(remainCandidates, temp);\n addPair(r, cr);\n addPair(c, cc);\n addPair(s, cs);\n }\n return remainCandidates;\n };\n const auto candidates_ = candidates(P);\n auto normalize = [](const vector<tuple<int, int, int>>& v) {\n tuple<unordered_set<int>, unordered_set<int>, unordered_set<int>> n;\n unordered_set<int> r, c, s;\n tie(r, c, s) = n;\n for (auto&& i : v) {\n int rr, cc, ss;\n tie(rr, cc, ss) = i;\n r.insert(rr);\n c.insert(cc);\n s.insert(ss);\n }\n return n;\n };\n const auto nn = normalize(candidates_);\n\n vector<string> Q;\n for (int i = 0; i < q; ++i) {\n string a;\n cin >> a;\n Q.push_back(a);\n }\n\n auto computeAoiByCandidates = [&candidates_,\n computeAoi](const pair<int, int>& r,\n const pair<int, int>& c,\n const pair<int, int>& s) {\n bool first = true;\n int current = -1;\n for (auto&& candidate : candidates_) {\n if (first) {\n current = computeAoi(candidate, r, c, s);\n first = false;\n }\n else {\n auto r_ = computeAoi(candidate, r, c, s);\n if (r_ != current) {\n return -1;\n }\n else {\n current = r_;\n }\n }\n }\n return current;\n };\n\n auto r = make_pair(0, 0);\n auto c = make_pair(0, 0);\n auto s = make_pair(0, 0);\n vector<int> results;\n for (auto&& line : Q) {\n int aoi;\n pair<int, int> cr, cc, cs;\n tie(aoi, cr, cc, cs) = processLine(line);\n results.push_back(computeAoiByCandidates(r, c, s));\n addPair(r, cr);\n addPair(c, cc);\n addPair(s, cs);\n }\n for (size_t i = 0; i < results.size(); ++i) {\n cout << results[i];\n if (i == results.size() - 1) {\n cout << endl;\n }\n else {\n cout << \" \";\n }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3284,"score_of_the_acc":-0.1545,"final_rank":3},{"submission_id":"aoj_1326_2869025","code_snippet":"#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(ll i=0;i<ll(n);++i)\n#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)\n#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)\n#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)\n#define ALL(v) (v).begin(),(v).end()\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\n#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << \" \"; else cout << endl; }\n#define INF 1000000001ll\n#define MOD 1000000007ll\n#define EPS 1e-9\n\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\n\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vi> vvi;\ntypedef vector<vl> vvl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nll max(ll a, int b) { return max(a, ll(b)); }\nll max(int a, ll b) { return max(ll(a), b); }\nll min(ll a, int b) { return min(a, ll(b)); }\nll min(int a, ll b) { return min(ll(a), b); }\n\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint n, m;\n\twhile (cin >> n >> m, n) {\n\t\tvector<string> p(n), q(m);\n\t\tREP(i, n)cin >> p[i];\n\t\tREP(i, m)cin >> q[i];\n\t\tvi ind(n);\n\t\tREP(i, n) {\n\t\t\tint cnt = 0;\n\t\t\tREP(j, p[i].size()) {\n\t\t\t\tif (p[i][j] != '.')break;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tind[i] = cnt;\n\t\t}\n\t\tvi res(m, -1);\n\t\tREP(i, 20)REP(j, 20)REP(k, 20) {\n\t\t\tint r = 0, c = 0, s = 0;\n\t\t\tbool ok = true;\n\t\t\tREP(a, n) {\n\t\t\t\tif (ind[a] != (i + 1)*r + (j + 1)*c + (k + 1)*s)ok = false;\n\t\t\t\tREP(b, p[a].size()) {\n\t\t\t\t\tif (p[a][b] == '(')r++;\n\t\t\t\t\telse if (p[a][b] == ')')r--;\n\t\t\t\t\telse if (p[a][b] == '{')c++;\n\t\t\t\t\telse if (p[a][b] == '}')c--;\n\t\t\t\t\telse if (p[a][b] == '[')s++;\n\t\t\t\t\telse if (p[a][b] == ']')s--;\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tif (!ok)continue;\n\t\t\tr = 0, c = 0, s = 0;\n\t\t\n\t\t\tREP(a, m) {\n\t\t\t\tif(res[a]==-1)res[a] = (i + 1)*r + (j + 1)*c + (k + 1)*s;\n\t\t\t\telse if(res[a]!=(i + 1)*r + (j + 1)*c + (k + 1)*s)res[a] = INF;\n\t\t\t\tREP(b, q[a].size()) {\n\t\t\t\t\tif (q[a][b] == '(')r++;\n\t\t\t\t\telse if (q[a][b] == ')')r--;\n\t\t\t\t\telse if (q[a][b] == '{')c++;\n\t\t\t\t\telse if (q[a][b] == '}')c--;\n\t\t\t\t\telse if (q[a][b] == '[')s++;\n\t\t\t\t\telse if (q[a][b] == ']')s--;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\tREP(i, m) {\n\t\t\tif (i)cout << \" \";\n\t\t\tif (res[i] == INF)cout << -1;\n\t\t\telse cout << res[i];\n\t\t}\n\t\tcout << endl;\n\t}\n}","accuracy":1,"time_ms":360,"memory_kb":3140,"score_of_the_acc":-0.7023,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_1326_9614938\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nstruct Data {\\n int A, B, C;\\n Data(int a, int b, int c) : A(a), B(b), C(c) {};\\n};\\n\\nbool Check(vector<string>& S, int A, int B, int C) {\\n int CA = 0, CB = 0, CC = 0;\\n int N = S.size();\\n rep(i,0,N) {\\n int COUNT = 0;\\n while(COUNT < S[i].size()) {\\n if (S[i][COUNT] == '.') COUNT++;\\n else break;\\n }\\n if (COUNT != CA * A + CB * B + CC * C) return false;\\n rep(j,0,S[i].size()) {\\n if (S[i][j] == '(') CA++;\\n if (S[i][j] == ')') CA--;\\n if (S[i][j] == '{') CB++;\\n if (S[i][j] == '}') CB--;\\n if (S[i][j] == '[') CC++;\\n if (S[i][j] == ']') CC--;\\n }\\n }\\n return true;\\n}\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vector<string> S(N), T(M);\\n rep(i,0,N) cin >> S[i];\\n rep(i,0,M) cin >> T[i];\\n vector<Data> X;\\n rep(i,1,21) {\\n rep(j,1,21) {\\n rep(k,1,21) {\\n if (Check(S,i,j,k)) X.push_back(Data(i,j,k));\\n }\\n }\\n }\\n int CA = 0, CB = 0, CC = 0;\\n rep(i,0,M) {\\n vector<int> ANS;\\n for (Data D : X) {\\n ANS.push_back(CA * D.A + CB * D.B + CC * D.C);\\n }\\n UNIQUE(ANS);\\n cout << (ANS.size() == 1 ? ANS[0] : -1) << (i == M - 1 ? '\\\\n' : ' ');\\n rep(j,0,T[i].size()) {\\n if (T[i][j] == '(') CA++;\\n if (T[i][j] == ')') CA--;\\n if (T[i][j] == '{') CB++;\\n if (T[i][j] == '}') CB--;\\n if (T[i][j] == '[') CC++;\\n if (T[i][j] == ']') CC--;\\n }\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.4368,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1326_7558864\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, v) for (auto &e : v)\\n#define MM << \\\" \\\" <<\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\n\\ntemplate <typename T>\\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <typename T>\\nusing maxheap = priority_queue<T>;\\n\\ntemplate <typename T>\\nbool chmax(T &x, const T &y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\n\\ntemplate <typename T>\\nbool chmin(T &x, const T &y) {\\n return (x > y) ? (x = y, true) : false;\\n}\\n\\ntemplate <typename T>\\nint flg(T x, int i) {\\n return (x >> i) & 1;\\n}\\n\\ntemplate <typename T>\\nvoid print(const vector<T> &v, T x = 0) {\\n int n = v.size();\\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (v.empty()) cout << '\\\\n';\\n}\\n\\ntemplate <typename T>\\nvoid printn(const vector<T> &v, T x = 0) {\\n int n = v.size();\\n for (int i = 0; i < n; i++) cout << v[i] + x << '\\\\n';\\n}\\n\\ntemplate <typename T>\\nint lb(const vector<T> &v, T x) {\\n return lower_bound(begin(v), end(v), x) - begin(v);\\n}\\n\\ntemplate <typename T>\\nint ub(const vector<T> &v, T x) {\\n return upper_bound(begin(v), end(v), x) - begin(v);\\n}\\n\\ntemplate <typename T>\\nvoid rearrange(vector<T> &v) {\\n sort(begin(v), end(v));\\n v.erase(unique(begin(v), end(v)), end(v));\\n}\\n\\ntemplate <typename T>\\nvector<int> id_sort(const vector<T> &v, bool greater = false) {\\n int n = v.size();\\n vector<int> ret(n);\\n iota(begin(ret), end(ret), 0);\\n sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });\\n return ret;\\n}\\n\\ntemplate <typename S, typename T>\\npair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {\\n return make_pair(p.first + q.first, p.second + q.second);\\n}\\n\\ntemplate <typename S, typename T>\\npair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {\\n return make_pair(p.first - q.first, p.second - q.second);\\n}\\n\\ntemplate <typename S, typename T>\\nistream &operator>>(istream &is, pair<S, T> &p) {\\n S a;\\n T b;\\n is >> a >> b;\\n p = make_pair(a, b);\\n return is;\\n}\\n\\ntemplate <typename S, typename T>\\nostream &operator<<(ostream &os, const pair<S, T> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n// const int MOD = 1000000007;\\nconst int MOD = 998244353;\\n\\nvoid solve() {\\n int N, M;\\n cin >> N >> M;\\n\\n if (N == 0) exit(0);\\n\\n vector<string> S(N), T(M);\\n rep(i, N) cin >> S[i];\\n rep(i, M) cin >> T[i];\\n\\n vector<int> indent(N, 0);\\n rep(i, N) {\\n while (indent[i] < sz(S[i]) && S[i][indent[i]] == '.') indent[i]++;\\n }\\n\\n vector<tuple<int, int, int>> candi;\\n\\n auto check = [&](int r, int c, int s) {\\n int sum = 0;\\n rep(i, N) {\\n if (sum != indent[i]) return false;\\n each(e, S[i]) {\\n if (e == '(') sum += r;\\n if (e == ')') sum -= r;\\n if (e == '{') sum += c;\\n if (e == '}') sum -= c;\\n if (e == '[') sum += s;\\n if (e == ']') sum -= s;\\n }\\n }\\n return true;\\n };\\n\\n rep2(r, 1, 21) rep2(c, 1, 21) rep2(s, 1, 21) {\\n if (check(r, c, s)) candi.eb(r, c, s);\\n }\\n\\n vector<vector<int>> indents(M);\\n for (auto [r, c, s] : candi) {\\n int sum = 0;\\n rep(i, M) {\\n indents[i].eb(sum);\\n each(e, T[i]) {\\n if (e == '(') sum += r;\\n if (e == ')') sum -= r;\\n if (e == '{') sum += c;\\n if (e == '}') sum -= c;\\n if (e == '[') sum += s;\\n if (e == ']') sum -= s;\\n }\\n }\\n }\\n\\n vector<int> ans(M);\\n rep(i, M) {\\n rearrange(indents[i]);\\n if (sz(indents[i]) != 1) {\\n ans[i] = -1;\\n } else {\\n ans[i] = indents[i][0];\\n }\\n }\\n\\n print(ans);\\n}\\n\\nint main() {\\n while (true) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.4411,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1326_7117360\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\\n\\n#define all(c) std::begin(c), std::end(c)\\n\\n#ifdef LOCAL\\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\\ntemplate <class T, class ...Args> void debug_impl(string s, T&& f, Args &&...args) {\\n cerr << \\\"(\\\" << s << \\\"): \\\" << \\\"(\\\" << forward<T>(f);\\n ((cerr << \\\", \\\" << forward<Args>(args)), ..., (cerr << \\\")\\\\n\\\"));\\n}\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <class T> bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\\ntemplate <class T> bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\\n\\n\\ntemplate <class T> istream& operator>>(istream& in, vector<T>& v) {\\n for (auto& e : v) in >> e;\\n return in;\\n}\\ntemplate <class ...Args> void read(Args&... args) {\\n (cin >> ... >> args);\\n}\\n\\ntemplate <class T> ostream& operator>>(ostream& out, const vector<T>& v) {\\n int n = v.size();\\n rep(i, n) {\\n out << v[i];\\n if (i + 1 != n) out << ' ';\\n }\\n return out;\\n}\\n\\ntemplate <class T, class ...Tails> void print(T&& h, Tails &&... tails) {\\n cout << h, ((cout << ' ' << forward<Tails>(tails)), ..., (cout << '\\\\n'));\\n}\\n\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\n#define si(c) (int)(c).size()\\n#define eb emplace_back\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int p, q;\\n while(cin >> p >> q) {\\n if(p == 0 and q == 0) break;\\n vvc<int> ans(q);\\n vc<string> s(p + q); read(s);\\n for(int x = 1; x <= 20; ++ x) {\\n for(int y = 1; y <= 20; ++ y) {\\n for(int z = 1; z <= 20; ++ z) {\\n int cx = 0, cy = 0, cz = 0;\\n bool ok = 1;\\n rep(i, p) {\\n int cnt = 0;\\n while(cnt < (int)s[i].size() and s[i][cnt] == '.') {\\n ++ cnt;\\n }\\n // debug(cnt);\\n if(x * cx + y * cy + z * cz != cnt) {\\n ok = 0;\\n }\\n for(char c: s[i]) {\\n if(c == '(') ++ cx;\\n else if(c == ')') -- cx;\\n\\n if(c == '{') ++ cy;\\n else if(c == '}') -- cy;\\n\\n if(c == '[') ++ cz;\\n else if(c == ']') -- cz;\\n }\\n }\\n cx = 0, cy = 0, cz = 0;\\n rep(j, q) {\\n int i = j + p;\\n // int cnt = 0;\\n // while(cnt < (int)s[i].size() and s[i][cnt] == '.') {\\n // ++ cnt;\\n // }\\n if(ok) {\\n ans[j].eb(x * cx + y * cy + z * cz);\\n }\\n for(char c: s[i]) {\\n if(c == '(') ++ cx;\\n else if(c == ')') -- cx;\\n\\n if(c == '{') ++ cy;\\n else if(c == '}') -- cy;\\n\\n if(c == '[') ++ cz;\\n else if(c == ']') -- cz;\\n }\\n }\\n }\\n }\\n }\\n vc<int> vs;\\n rep(i, q) {\\n sort(all(ans[i]));\\n ans[i].erase(unique(all(ans[i])), ans[i].end());\\n // debug(ans[i]);\\n int val = (si(ans[i]) == 1 ? ans[i][0] : -1);\\n cout << val << \\\" \\\\n\\\"[i == q - 1];\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -1.2918,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1326_6553033\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nvector<int> func(int p,int q){\\n {\\n string tmp;\\n getline(cin,tmp);\\n }\\n method(readIndent,int,string str){\\n rep(i,str.size()){\\n if(str[i]!='.')return i;\\n }\\n return -1;\\n };\\n method(readLine,string){\\n string str;\\n getline(cin,str);\\n return str;\\n };\\n using Brackets = array<int,3>;\\n method(readBrackets,Brackets,string str){\\n Brackets res;\\n foreach(i,res)i=0;\\n foreach(c,str){\\n if(c=='(')++res[0];\\n if(c=='{')++res[1];\\n if(c=='[')++res[2];\\n if(c==')')--res[0];\\n if(c=='}')--res[1];\\n if(c==']')--res[2];\\n }\\n return res;\\n };\\n vector<int> indents(p);\\n vector<string> line(p);\\n vector<Brackets> shifts(p);\\n foreach(i,shifts)foreach(j,i)j=0;\\n foreach(i,line)i=readLine();\\n set<Brackets> cans;\\n rep(i,p){\\n indents[i] = readIndent(line[i]);\\n if(i){\\n rep(j,3)shifts[i][j] += shifts[i-1][j];\\n auto add =readBrackets(line[i-1]);\\n rep(j,3)shifts[i][j] += add[j];\\n }\\n }\\n method(getCan,set<Brackets>,int indent,Brackets shift){\\n set<Brackets> res;\\n rep(a,1,21){\\n rep(b,1,21){\\n rep(c,1,21){\\n if(shift[0] * a + shift[1] * b + shift[2] * c == indent){\\n res.emplace(Brackets({a,b,c}));\\n }\\n }\\n }\\n }\\n return res;\\n };\\n set<Brackets> can = getCan(indents[0],shifts[0]);\\n rep(i,1,p){\\n auto adds = getCan(indents[i],shifts[i]);\\n set<Brackets> next;\\n foreach(c,can){\\n if(adds.count(c))next.emplace(c);\\n }\\n swap(can,next);\\n }\\n vector<int> res;\\n Brackets shift;\\n foreach(i,shift)i=0;\\n rep(_,q){\\n string str = readLine();\\n set<int> ans;\\n foreach(c,can){\\n ans.emplace(shift[0] * c[0] + shift[1] * c[1] + shift[2] * c[2]);\\n }\\n if(ans.size()==1){\\n res.emplace_back(*ans.begin());\\n }else{\\n res.emplace_back(-1);\\n }\\n auto add = readBrackets(str);\\n rep(i,3){\\n shift[i] += add[i];\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n while(true){\\n int p = in();\\n int q = in();\\n if(p==0)break;\\n println(func(p,q));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 4860,\n \"score_of_the_acc\": -1.1607,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1326_5064779\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\nint solve(vector<int> &v, map<vector<int>, int> &mp){\\n int ans = -1;\\n for(int x = 1; x <= 20; x++){\\n for(int y = 1; y <= 20; y++){\\n for(int z = 1; z <= 20; z++){\\n bool g = true;\\n for(auto itr = mp.begin(); itr != mp.end(); itr++){\\n if((itr->first)[0] * x + (itr->first)[1] * y + (itr->first)[2] * z != itr->second){\\n g = false;\\n }\\n }\\n if(g){\\n int s = v[0] * x + v[1] * y + v[2] * z;\\n if(ans == -1) ans = s;\\n else if(ans != s) ans = -2;\\n }\\n }\\n }\\n }\\n if(ans < 0) ans = -1;\\n return ans;\\n}\\n\\nint main()\\n{\\n while(true){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0 && m == 0) break;\\n string p[12], q[12];\\n for(int i = 0; i < n; i++) cin >> p[i];\\n for(int i = 0; i < m; i++) cin >> q[i];\\n map<vector<int>, int> mp;\\n vector<int> r(3);\\n for(int i = 0; i < n; i++){\\n int l = 0;\\n while(p[i][l] == '.') l++;\\n mp[r] = l;\\n for(int j = l; j < (int)p[i].size(); j++){\\n if(p[i][j] == '(') r[0]++;\\n if(p[i][j] == ')') r[0]--;\\n if(p[i][j] == '[') r[1]++;\\n if(p[i][j] == ']') r[1]--;\\n if(p[i][j] == '{') r[2]++;\\n if(p[i][j] == '}') r[2]--;\\n }\\n }\\n vector<int> v(3);\\n for(int i = 0; i < m; i++){\\n if(i > 0) cout << \\\" \\\";\\n cout << solve(v, mp);\\n for(int j = 0; j < (int)q[i].size(); j++){\\n if(q[i][j] == '(') v[0]++;\\n if(q[i][j] == ')') v[0]--;\\n if(q[i][j] == '[') v[1]++;\\n if(q[i][j] == ']') v[1]--;\\n if(q[i][j] == '{') v[2]++;\\n if(q[i][j] == '}') v[2]--;\\n }\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3068,\n \"score_of_the_acc\": -0.0565,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1326_5036953\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 4020000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nint main(){\\n while(1){\\n int n,m; cin >> n >> m;\\n if(!n) break;\\n vector<string> a(n), b(m);\\n rep(i,n) cin >> a[i];\\n rep(i,m) cin >> b[i];\\n vector<int> ans(m,inf);\\n bool no = false;\\n for(int R=1; R<=20; R++){\\n for(int C=1; C<=20; C++){\\n for(int S=1; S<=20; S++){\\n int r=0,c=0,s=0;\\n bool f = true;\\n rep(i,n){\\n int cnt = 0;\\n while(cnt < a[i].size() && a[i][cnt] == '.') cnt++;\\n if(cnt != R*r+C*c+S*s) f = false;\\n for(auto j : a[i]){\\n if(j == '(') r++;\\n if(j == ')') r--;\\n if(j == '{') c++;\\n if(j == '}') c--;\\n if(j == '[') s++;\\n if(j == ']') s--;\\n }\\n }\\n if(!f) continue;\\n rep(i,m){\\n int res = R*r + C*c + S*s;\\n if(ans[i] != inf && ans[i] != res){\\n ans[i] = -1;\\n }else if(ans[i] != -1){\\n ans[i] = res;\\n }\\n for(auto j : b[i]){\\n if(j == '(') r++;\\n if(j == ')') r--;\\n if(j == '{') c++;\\n if(j == '}') c--;\\n if(j == '[') s++;\\n if(j == ']') s--;\\n }\\n }\\n }\\n }\\n }\\n rep(i,m) cout << ans[i] << \\\" \\\\n\\\"[i==m-1];\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.8087,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1326_4967066\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nstring P[10], Q[10];\\nint p, q;\\n\\nbool match(int R, int C, int S) {\\n int r = 0, c = 0, s = 0;\\n for (int i = 0; i < p; i++) {\\n int pos = 0;\\n while (pos < P[i].size() && P[i][pos] == '.')\\n pos++;\\n if (pos != R * r + C * c + S * s) {\\n return false;\\n }\\n while (pos < P[i].size()) {\\n if (P[i][pos] == '(')\\n r++;\\n else if (P[i][pos] == ')')\\n r--;\\n else if (P[i][pos] == '{')\\n c++;\\n else if (P[i][pos] == '}')\\n c--;\\n else if (P[i][pos] == '[')\\n s++;\\n else if (P[i][pos] == ']')\\n s--;\\n pos++;\\n }\\n }\\n return true;\\n}\\n\\nint main() {\\n while (1) {\\n cin >> p >> q;\\n if (p == 0)\\n break;\\n getchar();\\n for (int i = 0; i < p; i++) {\\n getline(cin, P[i]);\\n }\\n for (int i = 0; i < q; i++) {\\n getline(cin, Q[i]);\\n }\\n int cnt = 0;\\n vector<int> R, C, S;\\n for (int i = 1; i <= 20; i++) {\\n for (int j = 1; j <= 20; j++) {\\n for (int k = 1; k <= 20; k++) {\\n if (match(i, j, k)) {\\n R.push_back(i);\\n C.push_back(j);\\n S.push_back(k);\\n }\\n }\\n }\\n }\\n vector<int> ans;\\n int r = 0, c = 0, s = 0;\\n for (int i = 0; i < q; i++) {\\n bool ok = 0;\\n int indent = -1;\\n for (int j = 0; j < R.size(); j++) {\\n int x = R[j] * r + C[j] * c + S[j] * s;\\n if (indent == -1) {\\n indent = x;\\n ok = 1;\\n } else if (indent != x) {\\n ok = 0;\\n }\\n }\\n if (ok)\\n ans.push_back(indent);\\n else\\n ans.push_back(-1);\\n int pos = 0;\\n while (pos < Q[i].size()) {\\n if (Q[i][pos] == '(')\\n r++;\\n else if (Q[i][pos] == ')')\\n r--;\\n else if (Q[i][pos] == '{')\\n c++;\\n else if (Q[i][pos] == '}')\\n c--;\\n else if (Q[i][pos] == '[')\\n s++;\\n else if (Q[i][pos] == ']')\\n s--;\\n pos++;\\n }\\n }\\n cout << ans[0];\\n for (int i = 1; i < q; i++)\\n cout << \\\" \\\" << ans[i];\\n cout << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.3647,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1326_4931380\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h> \\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nconstexpr ll INF = 1e18;\\nconstexpr int inf = 1e9;\\nconstexpr ll mod = 1000000007;\\nconstexpr ll mod2 = 998244353;\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n// ---------------------------------------------------------------------------\\n\\nbool solve(){\\n int N,M;\\n cin >> N >> M;\\n if(N==0 && M==0) return false;\\n vector<string> GN(N);\\n for(int i=0; i<N; i++) cin >> GN[i];\\n vector<string> GM(M);\\n for(int i=0; i<M; i++) cin >> GM[i]; \\n // (){}[]cnt\\n vector<pair<vector<int>,int>> p;\\n vector<int> cnt(3,0);\\n string in = \\\"({[\\\";\\n string out = \\\")}]\\\";\\n for(int i=0; i<N; i++){\\n int num = 0;\\n for(int j=0; j<GN[i].size(); j++){\\n if(GN[i][j] != '.') break;\\n num++;\\n }\\n p.emplace_back(cnt,num);\\n for(int j=0; j<GN[i].size(); j++){\\n for(int k=0; k<3; k++){\\n if(GN[i][j] == in[k]) cnt[k]++;\\n if(GN[i][j] == out[k]) cnt[k]--;\\n }\\n }\\n }\\n vector<vector<int>> num;\\n for(int i=1; i<=20; i++){\\n for(int j=1; j<=20; j++){\\n for(int k=1; k<=20; k++){\\n bool ok = true;\\n for(int l=0; l<p.size(); l++){\\n vector<int> now;\\n int cnt;\\n tie(now,cnt) = p[l];\\n if(i*now[0]+j*now[1]+k*now[2] != cnt) ok = false;\\n }\\n if(ok){\\n vector<int> pu(3);\\n pu[0] = i;\\n pu[1] = j;\\n pu[2] = k;\\n num.emplace_back(pu);\\n }\\n }\\n }\\n }\\n vector<int> ans(M,-1);\\n for(int i=0; i<M; i++){\\n set<int> can;\\n for(int j=0; j<num.size(); j++){\\n int now = 0;\\n for(int k=0; k<3; k++){\\n now += cnt[k]*num[j][k];\\n }\\n can.emplace(now);\\n }\\n if(can.size() == 1) ans[i] = *can.begin();\\n for(int j=0; j<GM[i].size(); j++){\\n for(int k=0; k<3; k++){\\n if(GM[i][j] == in[k]) cnt[k]++;\\n if(GM[i][j] == out[k]) cnt[k]--;\\n }\\n }\\n }\\n for(int i=0; i<M; i++){\\n cout << ans[i] << \\\" \\\\n\\\"[i+1==M];\\n }\\n return true;\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4116,\n \"score_of_the_acc\": -0.6366,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1326_4416871\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define SZ(x) (int)(x.size())\\n#define REP(i, n) for(int i=0;i<(n);++i)\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define RREP(i, n) for(int i=(int)(n)-1;i>=0;--i)\\n#define RFOR(i, a, b) for(int i=(int)(b)-1;i>=(a);--i)\\n#define ALL(a) a.begin(),a.end()\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n#define DEBUG(x) cerr<<#x<<\\\" = \\\"<<(x)<<\\\" (L\\\"<<__LINE__<<\\\")\\\"<< endl;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing P = pair<int, int>;\\nconst double eps = 1e-8;\\nconst ll MOD = 1000000007;\\nconst int INF = INT_MAX / 2;\\nconst ll LINF = LLONG_MAX / 2;\\ntemplate <typename T1, typename T2>\\nbool chmax(T1 &a, const T2 &b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate <typename T1, typename T2>\\nbool chmin(T1 &a, const T2 &b) {\\n if (a > b) { a = b; return true; }\\n return false;\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n os << p.first << \\\":\\\" << p.second;\\n return os;\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const map<T1, T2> &mp) {\\n os << \\\"{\\\";\\n int a = 0;\\n for (auto &tp : mp) {\\n if (a) os << \\\", \\\"; a = 1;\\n os << tp;\\n }\\n return os << \\\"}\\\";\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n os << \\\"[\\\";\\n REP(i, SZ(v)) {\\n if (i) os << \\\", \\\";\\n os << v[i];\\n }\\n return os << \\\"]\\\";\\n}\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n for (;;) {\\n int p, q; cin >> p >> q;\\n if (p == 0) break;\\n vector<map<char,int>> cnt(p);\\n vector<int> indent(p);\\n map<char,int> count;\\n REP(i, p) {\\n string s; cin >> s;\\n int j = 0;\\n while (j < SZ(s) and s[j] == '.') ++j;\\n indent[i] = j;\\n for (; j < SZ(s); ++j) {\\n if (s[j] == '(') ++count['('];\\n if (s[j] == ')') --count['('];\\n if (s[j] == '{') ++count['{'];\\n if (s[j] == '}') --count['{'];\\n if (s[j] == '[') ++count['['];\\n if (s[j] == ']') --count['['];\\n }\\n cnt[i] = count;\\n }\\n\\n vector<tuple<int,int,int>> cands;\\n FOR(r, 1, 21) {\\n FOR(c, 1, 21) {\\n FOR(s, 1, 21) {\\n int valid = 1;\\n REP(i, p-1) {\\n if (r * cnt[i]['('] + c * cnt[i]['{'] + s * cnt[i]['['] != indent[i+1]) valid = 0;\\n }\\n if (valid) {\\n cands.emplace_back(r, c, s);\\n }\\n }\\n }\\n }\\n\\n count.clear();\\n vi ans(q);\\n REP(i, q) {\\n string s; cin >> s;\\n if (i == q-1) continue;\\n for (char c : s) {\\n if (c == '(') ++count['('];\\n if (c == ')') --count['('];\\n if (c == '{') ++count['{'];\\n if (c == '}') --count['{'];\\n if (c == '[') ++count['['];\\n if (c == ']') --count['['];\\n }\\n\\n map<int,int> value;\\n for (auto &tp : cands) {\\n int r, c, s; tie(r, c, s) = tp;\\n value[r * count['('] + c * count['{'] + s * count['[']] = 1;\\n }\\n if (value.size() > 1) ans[i+1] = -1;\\n else ans[i+1] = value.begin()->first;\\n }\\n\\n REP(i, q) {\\n if (i) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.191,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1326_3967206\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <set>\\n#include <tuple>\\nusing namespace std;\\n\\nint main() {\\n int p, q;\\n while (cin >> p >> q, p) {\\n vector<vector<int>> a(p, vector<int>(3));\\n vector<int> b(p);\\n {\\n map<char, int> cnt;\\n for (int i = 0; i < p; i++) {\\n a[i][0] = cnt['('] - cnt[')'];\\n a[i][1] = cnt['{'] - cnt['}'];\\n a[i][2] = cnt['['] - cnt[']'];\\n string s; cin >> s;\\n int& ind = b[i];\\n while (ind < s.size() && s[ind] == '.') ind++;\\n for (auto c: s) cnt[c]++;\\n }\\n }\\n set<tuple<int, int, int>> se;\\n for (int r = 1; r <= 20; r++) {\\n for (int c = 1; c <= 20; c++) {\\n for (int s = 1; s <= 20; s++) {\\n bool ok = true;\\n for (int i = 0; i < p; i++) {\\n ok &= a[i][0] * r + a[i][1] * c + a[i][2] * s == b[i];\\n }\\n if (ok) se.emplace(r, c, s);\\n }\\n }\\n }\\n vector<int> res(q); {\\n map<char, int> cnt;\\n for (int i = 0; i < q; i++) {\\n set<int> ans;\\n for (auto &t: se) {\\n int tmp = 0;\\n tmp += (cnt['('] - cnt[')']) * get<0>(t);\\n tmp += (cnt['{'] - cnt['}']) * get<1>(t);\\n tmp += (cnt['['] - cnt[']']) * get<2>(t);\\n ans.emplace(tmp);\\n }\\n res[i] = ans.size() == 1 ? *ans.begin() : -1;\\n string s; cin >> s;\\n for (auto c: s) cnt[c]++;\\n }\\n }\\n for (int i = 0; i < q; i++) cout << res[i] << \\\" \\\\n\\\"[i == q - 1];\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.3476,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1326_3896889\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME\\n#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl\\n#define pr1(a) (#a)<<\\\"=\\\"<<(a)<<\\\" \\\"\\n#define pr2(a,b) pr1(a)<<pr1(b)\\n#define pr3(a,b,c) pr1(a)<<pr2(b,c)\\n#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)\\n#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)\\n#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)\\n#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)\\n#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)\\n#define prArr(a) {cerr<<(#a)<<\\\"={\\\";int i=0;for(auto t:(a))cerr<<(i++?\\\", \\\":\\\"\\\")<<t;cerr<<\\\"}\\\"<<endl;}\\nusing namespace std;\\nusing Int = long long;\\nusing _int = int;\\nusing ll = long long;\\nusing Double = long double;\\nconst Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18\\nconst Int mod = (1e9)+7;\\nconst Double EPS = 1e-8;\\nconst Double PI = 6.0 * asin((Double)0.5);\\nusing P = pair<Int,Int>;\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\ntemplate<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){\\n return o<<\\\"(\\\"<<get<0>(t)<<\\\",\\\"<<get<1>(t)<<\\\",\\\"<<get<2>(t)<<\\\")\\\";}\\ntemplate<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}\\ntemplate<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?\\\" \\\":\\\"\\\")<<t;return o;}\\ntemplate<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}\\n//INSERT ABOVE HERE\\n\\n\\n\\nvoid count(Int &a, Int &b, Int &c, char ch){\\n if(ch == '(') a++;\\n if(ch == ')') a--;\\n if(ch == '{') b++;\\n if(ch == '}') b--;\\n if(ch == '[') c++;\\n if(ch == ']') c--;\\n assert(a >= 0 && b >= 0 && c >= 0);\\n}\\n\\nInt check(vector<string> &code, Int R, Int C, Int S){\\n Int a = 0, b = 0, c = 0;\\n for(string &s: code){\\n Int idx = 0;\\n Int cnt = 0;\\n while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;\\n\\n if(R * a + C * b + S * c != cnt) return 0;\\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\\n }\\n assert(a == 0 && b == 0 && c == 0);\\n return 1;\\n}\\n\\nusing T = tuple<Int,Int,Int>;\\nmap<T, Int> calcMem(vector<string> &code){\\n Int a = 0, b = 0, c = 0;\\n map<T, Int> res;\\n for(string &s: code){\\n Int idx = 0;\\n Int cnt = 0;\\n while(idx < (Int)s.size() && s[idx] == '.') idx++, cnt++;\\n res[T(a, b, c)] = cnt;\\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\\n }\\n return res;\\n}\\n\\n\\n\\n\\nsigned main(){\\n srand((unsigned)time(NULL));\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n while(1){\\n Int n, m;\\n cin>>n>>m;\\n if(n == 0 && m == 0) break;\\n vector<string> code1(n);\\n cin>>code1;\\n vector<string> code2(m);\\n cin>>code2;\\n\\n set<Int> R, C, S;\\n for(Int i=1;i<=20;i++)\\n for(Int j=1;j<=20;j++)\\n for(Int k=1;k<=20;k++){\\n if(!check(code1, i, j, k)) continue;\\n R.insert(i);\\n C.insert(j);\\n S.insert(k);\\n }\\n\\n {\\n map<T, Int> mem = calcMem(code1);\\n vector<Int> ans;\\n Int a = 0, b = 0, c = 0;\\n for(string s:code2){\\n Int num = 0;\\n Int valid = 1;\\n if(a != 0){\\n valid &= R.size() == 1;\\n if(valid) num += *R.begin() * a;\\n }\\n if(b != 0){\\n valid &= C.size() == 1;\\n if(valid) num += *C.begin() * b;\\n }\\n if(c != 0){\\n valid &= S.size() == 1;\\n if(valid) num += *S.begin() * c;\\n }\\n\\n if(mem.count(T(a, b, c))) {valid = 1, num = mem[T(a, b, c)];}\\n\\n Int idx = 0;\\n while(idx < (Int)s.size()) count(a, b, c, s[idx++]);\\n if(!valid) ans.push_back(-1);\\n else ans.push_back(num);\\n }\\n cout<<ans<<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.3745,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1326_3832743\",\n \"code_snippet\": \"#if __has_include(\\\"../library/Basic/Debug.hpp\\\")\\n\\n#include \\\"../library/Basic/Debug.hpp\\\"\\n\\n#else\\n\\n/* ----- Header Files ----- */\\n// IO\\n#include <cstdio>\\n#include <iomanip>\\n#include <ios>\\n#include <iostream>\\n\\n// algorithm\\n#include <algorithm>\\n#include <cmath>\\n#include <numeric>\\n\\n// container\\n#include <vector>\\n#include <string>\\n#include <tuple>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n\\n// others\\n#include <random>\\n#include <limits>\\n#include <functional>\\n#include <ctime>\\n#include <cassert>\\n#include <cstdint>\\n\\n\\n/* ----- Type Alias ----- */\\nusing Int = long long int;\\nusing Real = long double;\\nusing String = std::string;\\ntemplate <class... Ts>\\nusing Tuple = std::tuple<Ts...>;\\n\\ntemplate <class T>\\nusing Vector = std::vector<T>;\\ntemplate <class T>\\nusing Queue = std::queue<T>;\\ntemplate <class T>\\nusing Stack = std::stack<T>;\\ntemplate <class T>\\nusing Deque = std::deque<T>;\\n\\ntemplate <class T>\\nusing MaxHeap = std::priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T>\\nusing Set = std::set<T>;\\ntemplate <class T, class U>\\nusing Map = std::map<T, U>;\\n\\ntemplate <class T, class... Us>\\nusing Func = std::function<T(Us...)>;\\n\\ntemplate <class T>\\nT genv(T v) { return v; }\\n\\ntemplate <class T, class... Ts>\\nauto genv(size_t l, Ts... ts) {\\n return Vector<decltype(genv<T>(ts...))>(l, Vector<T>(ts...));\\n}\\n\\ntemplate <class Cost = Int>\\nstruct Edge {\\n Int src, dst;\\n Cost cost;\\n Edge(Int src = -1, Int dst = -1, Cost cost = 1)\\n : src(src), dst(dst), cost(cost){};\\n\\n bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }\\n bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }\\n};\\n\\ntemplate <class Cost = Int>\\nusing Edges = Vector<Edge<Cost>>;\\ntemplate <class Cost = Int>\\nusing Graph = Vector<Vector<Edge<Cost>>>;\\n\\n#endif\\n\\n/* ----- Misc ----- */\\nvoid fastio() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n}\\n\\nstruct Fout {\\n Int precision;\\n Fout(Int precision) : precision(precision) {}\\n};\\nstd::ostream& operator<<(std::ostream& os, const Fout& fio) {\\n os << std::fixed << std::setprecision(fio.precision);\\n return os;\\n}\\n\\n\\n/* ----- Constants ----- */\\n// constexpr Int INF = std::numeric_limits<Int>::max() / 1000;\\n// constexpr Int MOD = 1000000007;\\n// constexpr Real PI = acos(-1);\\n// constexpr Real EPS = 1e-10;\\n// std::mt19937 mt(int(std::time(nullptr)));\\n\\nInt parse(const String& s, Vector<Int>& cnt) {\\n Int i;\\n for (i = 0; s[i] == '.'; ++i) {}\\n\\n for (char c : s) {\\n switch (c) {\\n case '(':\\n ++cnt[0];\\n break;\\n case ')':\\n --cnt[0];\\n break;\\n case '{':\\n ++cnt[1];\\n break;\\n case '}':\\n --cnt[1];\\n break;\\n case '[':\\n ++cnt[2];\\n break;\\n case ']':\\n --cnt[2];\\n break;\\n default:\\n break;\\n }\\n }\\n return i;\\n}\\n\\nbool solve() {\\n Int n, m;\\n std::cin >> n >> m;\\n if (n == 0) return false;\\n\\n Vector<Tuple<Vector<Int>, Int>> lines(n);\\n Vector<Int> cnt(3, 0);\\n for (auto& l : lines) {\\n String s;\\n std::cin >> s;\\n\\n Vector<Int> prev = cnt;\\n Int dots = parse(s, cnt);\\n l = std::make_tuple(prev, dots);\\n }\\n\\n Vector<Vector<Int>> pos;\\n Vector<Int> x(3);\\n for (x[0] = 1; x[0] <= 20; ++x[0]) {\\n for (x[1] = 1; x[1] <= 20; ++x[1]) {\\n for (x[2] = 1; x[2] <= 20; ++x[2]) {\\n bool judge = true;\\n\\n for (auto l : lines) {\\n Vector<Int> v;\\n Int s;\\n std::tie(v, s) = l;\\n\\n for (Int i = 0; i < 3; ++i) s -= v[i] * x[i];\\n if (s != 0) judge = false;\\n }\\n\\n if (judge) pos.push_back(x);\\n }\\n }\\n }\\n\\n fill(cnt.begin(), cnt.end(), 0);\\n for (Int i = 0; i < m; ++i) {\\n String s;\\n std::cin >> s;\\n\\n Vector<Int> prev = cnt;\\n parse(s, cnt);\\n\\n Set<Int> ans;\\n for (const auto& x : pos) {\\n Int sum = 0;\\n for (Int i = 0; i < 3; ++i) sum += x[i] * prev[i];\\n ans.insert(sum);\\n }\\n\\n std::cout << (ans.size() == 1 ? *ans.begin() : -1) << \\\" \\\\n\\\"[i == m - 1];\\n }\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.4089,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1326_3703883\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e16;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\nll p,q;\\n\\nvector<string> PP,Q;\\nvector<ll> ans;\\n\\nchar ot[] = {'(','{','['};\\nchar ct[] = {')','}',']'};\\n\\nbool check(ll r,ll c,ll s){\\n ll cost[] = {r,c,s};\\n ll sum = 0;\\n rep(i,PP.size() - 1){\\n ll cnt = 0;\\n rep(j,PP[i].size()){\\n rep(k,3){\\n if(ot[k] == PP[i][j])sum += cost[k];\\n if(ct[k] == PP[i][j])sum -= cost[k];\\n }\\n }\\n\\n rep(j,PP[i+1].size()){\\n if(PP[i+1][j] != '.')break;\\n cnt++;\\n }\\n if(cnt != sum)return false;\\n }\\n return true;\\n}\\n\\nvoid solve(ll r,ll c,ll s){\\n ll cnt[3] = {}; \\n rep(i,Q.size() - 1){\\n rep(j,Q[i].size()){\\n rep(k,3){\\n if(ot[k] == Q[i][j])cnt[k]++;\\n if(ct[k] == Q[i][j])cnt[k]--;\\n }\\n }\\n ll nn = cnt[0]*r + cnt[1]*c + cnt[2]*s;\\n if(ans[i] == 0)ans[i] = nn;\\n else if(ans[i] != nn)ans[i] = -1;\\n }\\n}\\n\\nint main(){\\n while(cin >> p >> q && p){\\n PP.clear();\\n Q.clear();\\n ans.clear();\\n ans.resize(q-1,0);\\n rep(i,p){\\n string s;\\n cin >> s;\\n PP.push_back(s);\\n }\\n rep(i,q){\\n string s;\\n cin >> s;\\n Q.push_back(s);\\n }\\n FOR(r,1,21){\\n FOR(c,1,21){\\n FOR(s,1,21){\\n if(check(r,c,s)){\\n // cout << r << \\\" \\\" << c << \\\" \\\" << s << endl;\\n solve(r,c,s);\\n }\\n }\\n }\\n }\\n cout << 0 << \\\" \\\";\\n rep(i,ans.size()){\\n if(i != ans.size() - 1)cout << ans[i] << \\\" \\\";\\n else cout << ans[i] << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.5951,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1326_3637837\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nint a[100][100][100];\\n\\nvoid solve(int n,int m){\\n map<int,int> mp;\\n int x=0,y=0,z=0;\\n rep(i,n){\\n string s;cin>>s;\\n int c=0;\\n while(c<s.size()&&s[c]=='.')++c;\\n mp[10000*x+100*y+z]=c;\\n rep(j,s.size()){\\n if(s[j]=='(')++x;\\n if(s[j]==')')--x;\\n if(s[j]=='{')++y;\\n if(s[j]=='}')--y;\\n if(s[j]=='[')++z;\\n if(s[j]==']')--z;\\n }\\n }\\n vector<int> P,Q,R;\\n REP(i,1,21)REP(j,1,21)REP(k,1,21){\\n bool ok=true;\\n for(auto p : mp){\\n if(i*(p.first/10000)+j*(p.first/100%100)+k*(p.first%100)!=p.second)ok=false;\\n }\\n if(ok){\\n P.push_back(i);\\n Q.push_back(j);\\n R.push_back(k);\\n }\\n }\\n x=0,y=0,z=0;\\n rep(i,m){\\n string s;\\n cin>>s;\\n if(mp.count(10000*x+100*y+z))cout<<mp[10000*x+100*y+z];\\n else {\\n set<int> st;\\n rep(j,P.size()){\\n st.insert(x*P[j]+y*Q[j]+z*R[j]);\\n }\\n if(st.size()==1)cout<<*st.begin();\\n else cout<<-1;\\n }\\n rep(j,s.size()){\\n if(s[j]=='(')++x;\\n if(s[j]==')')--x;\\n if(s[j]=='{')++y;\\n if(s[j]=='}')--y;\\n if(s[j]=='[')++z;\\n if(s[j]==']')--z;\\n }\\n if(i!=m-1)cout<<\\\" \\\";\\n else cout<<endl;\\n }\\n}\\nint main(){\\n int n,m;\\n while(cin>>n>>m,n)solve(n,m);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.1867,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1326_3635083\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <iomanip>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <stack>\\n#include <numeric>\\n#include <bitset>\\n#include <cmath>\\n\\nstatic const int MOD = 1000000007;\\nusing ll = long long;\\nusing u32 = uint32_t;\\nusing namespace std;\\n\\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\\nvoid solve(int p, int q){\\n vector<string> v(p), u(q);\\n for (auto &&i : v) cin >> i;\\n for (auto &&i : u) cin >> i;\\n vector<int> ans(q, -2);\\n for (int R = 1; R <= 20; ++R) {\\n for (int C = 1; C <= 20; ++C) {\\n for (int S = 1; S <= 20; ++S) {\\n int cnt1 = 0, cnt2 = 0, cnt3 = 0;\\n int ok = 1;\\n for (int i = 0; i < p; ++i) {\\n int x = 0;\\n for (auto &&j : v[i]) {\\n if(j == '.') x++;\\n else break;\\n }\\n if(x != R*cnt1+C*cnt2+S*cnt3){\\n ok = 0;\\n break;\\n }\\n for (auto &&j : v[i]) {\\n if(j == '(') cnt1++;\\n if(j == ')') cnt1--;\\n if(j == '{') cnt2++;\\n if(j == '}') cnt2--;\\n if(j == '[') cnt3++;\\n if(j == ']') cnt3--;\\n }\\n }\\n if(!ok) continue;\\n for (int i = 0; i < q; ++i) {\\n if(ans[i] == -2){\\n ans[i] = R*cnt1+C*cnt2+S*cnt3;\\n } else if(ans[i] != R*cnt1+C*cnt2+S*cnt3){\\n ans[i] = -1;\\n }\\n for (auto &&j : u[i]) {\\n if(j == '(') cnt1++;\\n if(j == ')') cnt1--;\\n if(j == '{') cnt2++;\\n if(j == '}') cnt2--;\\n if(j == '[') cnt3++;\\n if(j == ']') cnt3--;\\n }\\n }\\n }\\n }\\n }\\n for (int i = 0; i < q; ++i) {\\n if(i) printf(\\\" \\\");\\n printf(\\\"%d\\\", ans[i]);\\n }\\n puts(\\\"\\\");\\n}\\nint main() {\\n int p, q;\\n while(cin >> p >> q, p){\\n solve(p, q);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.3487,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1326_3372204\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\nint n,m;\\nstring ss[10];\\nmain()\\n{\\n\\twhile(cin>>n>>m,n)\\n\\t{\\n\\t\\tfor(int i=0;i<n;i++)cin>>ss[i];\\n\\t\\tvector<int>R,C,S;\\n\\t\\tfor(int r=1;r<21;r++)for(int c=1;c<21;c++)for(int s=1;s<21;s++)\\n\\t\\t{\\n\\t\\t\\tbool flag=1;\\n\\t\\t\\tint cr=0,cc=0,cs=0;\\n\\t\\t\\tfor(int i=0;i<n;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt=0;\\n\\t\\t\\t\\tfor(int j=0;j<ss[i].size()&&ss[i][j]=='.';j++)cnt++;\\n\\t\\t\\t\\tif(cr*r+cc*c+cs*s!=cnt)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tflag=0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int j=0;j<ss[i].size();j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(ss[i][j]=='(')cr++;\\n\\t\\t\\t\\t\\telse if(ss[i][j]==')')cr--;\\n\\t\\t\\t\\t\\telse if(ss[i][j]=='{')cc++;\\n\\t\\t\\t\\t\\telse if(ss[i][j]=='}')cc--;\\n\\t\\t\\t\\t\\telse if(ss[i][j]=='[')cs++;\\n\\t\\t\\t\\t\\telse if(ss[i][j]==']')cs--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(flag)\\n\\t\\t\\t{\\n\\t\\t\\t\\tR.push_back(r);\\n\\t\\t\\t\\tC.push_back(c);\\n\\t\\t\\t\\tS.push_back(s);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int>ans;\\n\\t\\tint cr=0,cc=0,cs=0;\\n\\t\\tfor(;m--;)\\n\\t\\t{\\n\\t\\t\\tstring t;cin>>t;\\n\\t\\t\\tint cnt=-1;\\n\\t\\t\\tfor(int j=0;j<R.size();j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint now=cr*R[j]+cc*C[j]+cs*S[j];\\n\\t\\t\\t\\tif(cnt<0)cnt=now;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(cnt!=now)cnt=114514;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt==114514)ans.push_back(-1);\\n\\t\\t\\telse ans.push_back(cnt);\\n\\t\\t\\tfor(int j=0;j<t.size();j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(t[j]=='(')cr++;\\n\\t\\t\\t\\telse if(t[j]==')')cr--;\\n\\t\\t\\t\\telse if(t[j]=='{')cc++;\\n\\t\\t\\t\\telse if(t[j]=='}')cc--;\\n\\t\\t\\t\\telse if(t[j]=='[')cs++;\\n\\t\\t\\t\\telse if(t[j]==']')cs--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<ans.size();i++)cout<<ans[i]<<(i+1==ans.size()?\\\"\\\\n\\\":\\\" \\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.2974,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1326_3315042\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int p,int q){\\n cin.ignore();\\n string buf;\\n int ro=0,rc=0,co=0,cc=0,so=0,sc=0;\\n auto incl=[&](string str){\\n ro+=count(str.begin(),str.end(),'(');\\n rc+=count(str.begin(),str.end(),')');\\n co+=count(str.begin(),str.end(),'{');\\n cc+=count(str.begin(),str.end(),'}');\\n so+=count(str.begin(),str.end(),'[');\\n sc+=count(str.begin(),str.end(),']');\\n };\\n auto cntIndent=[](string str){\\n int res=0;\\n for(int i=0;i<str.size();i++){\\n if(str[i]!='.') break;\\n res++;\\n }\\n return res;\\n };\\n vector<tuple<int,int,int>> rcs;\\n for(int i=0;i<20;i++){\\n for(int j=0;j<20;j++){\\n for(int k=0;k<20;k++){\\n rcs.push_back(make_tuple(i+1,j+1,k+1));\\n }\\n }\\n }\\n for(int i=0;i<p;i++){\\n string str;\\n getline(cin,str);\\n vector<tuple<int,int,int>> tmp;\\n int x=cntIndent(str);\\n for(int i=0;i<rcs.size();i++){\\n if(get<0>(rcs[i])*(ro-rc)+get<1>(rcs[i])*(co-cc)+get<2>(rcs[i])*(so-sc)==x){\\n tmp.push_back(rcs[i]);\\n }\\n }\\n rcs=tmp;\\n incl(str);\\n }\\n ro=rc=0,co=cc=0,so=sc=0;\\n vector<int> res;\\n for(int i=0;i<q;i++){\\n string str;\\n getline(cin,str);\\n int y=get<0>(rcs[0])*(ro-rc)+get<1>(rcs[0])*(co-cc)+get<2>(rcs[0])*(so-sc);\\n for(int i=0;i<rcs.size();i++){\\n if(get<0>(rcs[i])*(ro-rc)+get<1>(rcs[i])*(co-cc)+get<2>(rcs[i])*(so-sc)!=y){\\n y=-1;\\n }\\n }\\n res.push_back(y);\\n incl(str);\\n }\\n for(int i=0;i<q;i++){\\n cout<<res[i]<<(i+1==q ? \\\"\\\\n\\\" : \\\" \\\");\\n }\\n return;\\n}\\nint main(){\\n int p,q;\\n while(cin>>p>>q,p){\\n solve(p,q);\\n }\\n return 0; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.1245,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1326_3167991\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int n,m;\\n while(cin>>n>>m,n){\\n string s1[11],s2[11];\\n for(int i=0;i<n;i++)cin>>s1[i];\\n for(int i=0;i<m;i++)cin>>s2[i];\\n\\n int pi[11];\\n for(int i=0;i<n;i++){\\n int j=0;\\n while(s1[i][j]=='.'){\\n j++;\\n }\\n pi[i]=j;\\n }\\n\\n // for(int i=0;i<n;i++)cout<<\\\"p \\\"<<pi[i]<<endl;\\n \\n int ans[11];\\n fill_n(ans,11,-2);\\n ans[0]=0;\\n \\n for(int r=1;r<=20;r++){\\n for(int c=1;c<=20;c++){\\n for(int s=1;s<=20;s++){\\n\\t//cout<<r<<\\\" \\\"<<c<<\\\" \\\"<<s<<endl;\\n\\tint f=1;\\n\\t\\n\\tint cnt[3]={};\\n\\tfor(int i=0;i<n;i++){\\n\\t \\n\\t int t=r*cnt[0]+c*cnt[1]+s*cnt[2];\\n\\t //if(r==9&&c==5&&s==2)cout<<pi[i]<<\\\" \\\"<<t<<endl;\\n\\t if(t!=pi[i])f=0;\\n\\t \\n\\t for(int j=0;j<s1[i].size();j++){\\n\\t if(s1[i][j]=='(')cnt[0]++;\\n\\t if(s1[i][j]==')')cnt[0]--;\\n\\t if(s1[i][j]=='{')cnt[1]++;\\n\\t if(s1[i][j]=='}')cnt[1]--;\\n\\t if(s1[i][j]=='[')cnt[2]++;\\n\\t if(s1[i][j]==']')cnt[2]--;\\n\\t }\\n\\t}\\n\\t\\n\\tif(f==0)continue;\\n\\t//cout<<r<<\\\" \\\"<<c<<\\\" \\\"<<s<<endl;\\n\\t\\n\\tcnt[0]=cnt[1]=cnt[2]=0;\\n\\tfor(int i=0;i<m;i++){\\n\\t \\n\\t int t=r*cnt[0]+c*cnt[1]+s*cnt[2];\\n\\t \\n\\t if(ans[i]==-2)ans[i]=t;\\n\\t else if(ans[i]!=t)ans[i]=-1;\\n\\t \\n\\t for(int j=0;j<s2[i].size();j++){\\n\\t if(s2[i][j]=='(')cnt[0]++;\\n\\t if(s2[i][j]==')')cnt[0]--;\\n\\t if(s2[i][j]=='{')cnt[1]++;\\n\\t if(s2[i][j]=='}')cnt[1]--;\\n\\t if(s2[i][j]=='[')cnt[2]++;\\n\\t if(s2[i][j]==']')cnt[2]--;\\n\\t }\\n\\t}\\n\\t\\n }\\n }\\n }\\n for(int i=0;i<m;i++){\\n if(i)cout<<\\\" \\\";\\n cout<<ans[i];\\n }\\n\\n cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 2996,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1326_2876276\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <tuple>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n while (true) {\\n int p, q;\\n cin >> p >> q;\\n if (p == 0 && q == 0) {\\n return 0;\\n }\\n\\n vector<string> P;\\n for (int i = 0; i < p; ++i) {\\n string a;\\n cin >> a;\\n P.push_back(a);\\n }\\n\\n auto processLine = [](const string& line) {\\n auto aoi = 0;\\n auto groupingNotFound = true;\\n auto cr = make_pair(0, 0);\\n auto cc = make_pair(0, 0);\\n auto cs = make_pair(0, 0);\\n for (char i : line) {\\n if (groupingNotFound && i == '.') {\\n aoi += 1;\\n }\\n else {\\n groupingNotFound = false;\\n if (i == '(')\\n cr.first += 1;\\n else if (i == ')') {\\n cr.second += 1;\\n }\\n else if (i == '{') {\\n cc.first += 1;\\n }\\n else if (i == '}') {\\n cc.second += 1;\\n }\\n else if (i == '[') {\\n cs.first += 1;\\n }\\n else if (i == ']') {\\n cs.second += 1;\\n }\\n }\\n }\\n return make_tuple(aoi, cr, cc, cs);\\n };\\n auto computeAoi = [](const tuple<int, int, int>& param,\\n const pair<int, int>& r, const pair<int, int>& c,\\n const pair<int, int>& s) {\\n int R, C, S;\\n tie(R, C, S) = param;\\n return R * (r.first - r.second) + C * (c.first - c.second) +\\n S * (s.first - s.second);\\n };\\n auto addPair = [](auto& a, const auto& b) {\\n a.first += b.first;\\n a.second += b.second;\\n };\\n\\n auto candidates = [processLine, computeAoi,\\n addPair](const vector<string>& v) {\\n auto r = make_pair(0, 0);\\n auto c = make_pair(0, 0);\\n auto s = make_pair(0, 0);\\n vector<tuple<int, int, int>> remainCandidates;\\n for (int R = 1; R <= 20; ++R) {\\n for (int C = 1; C <= 20; ++C) {\\n for (int S = 1; S <= 20; ++S) {\\n remainCandidates.emplace_back(R, C, S);\\n }\\n }\\n }\\n for (auto&& line : v) {\\n int aoi;\\n pair<int, int> cr, cc, cs;\\n tie(aoi, cr, cc, cs) = processLine(line);\\n\\n vector<tuple<int, int, int>> temp;\\n for (auto&& j : remainCandidates) {\\n if (computeAoi(j, r, c, s) == aoi) {\\n temp.push_back(move(j));\\n }\\n }\\n swap(remainCandidates, temp);\\n addPair(r, cr);\\n addPair(c, cc);\\n addPair(s, cs);\\n }\\n return remainCandidates;\\n };\\n const auto candidates_ = candidates(P);\\n auto normalize = [](const vector<tuple<int, int, int>>& v) {\\n tuple<unordered_set<int>, unordered_set<int>, unordered_set<int>> n;\\n unordered_set<int> r, c, s;\\n tie(r, c, s) = n;\\n for (auto&& i : v) {\\n int rr, cc, ss;\\n tie(rr, cc, ss) = i;\\n r.insert(rr);\\n c.insert(cc);\\n s.insert(ss);\\n }\\n return n;\\n };\\n const auto nn = normalize(candidates_);\\n\\n vector<string> Q;\\n for (int i = 0; i < q; ++i) {\\n string a;\\n cin >> a;\\n Q.push_back(a);\\n }\\n\\n auto computeAoiByCandidates = [&candidates_,\\n computeAoi](const pair<int, int>& r,\\n const pair<int, int>& c,\\n const pair<int, int>& s) {\\n bool first = true;\\n int current = -1;\\n for (auto&& candidate : candidates_) {\\n if (first) {\\n current = computeAoi(candidate, r, c, s);\\n first = false;\\n }\\n else {\\n auto r_ = computeAoi(candidate, r, c, s);\\n if (r_ != current) {\\n return -1;\\n }\\n else {\\n current = r_;\\n }\\n }\\n }\\n return current;\\n };\\n\\n auto r = make_pair(0, 0);\\n auto c = make_pair(0, 0);\\n auto s = make_pair(0, 0);\\n vector<int> results;\\n for (auto&& line : Q) {\\n int aoi;\\n pair<int, int> cr, cc, cs;\\n tie(aoi, cr, cc, cs) = processLine(line);\\n results.push_back(computeAoiByCandidates(r, c, s));\\n addPair(r, cr);\\n addPair(c, cc);\\n addPair(s, cs);\\n }\\n for (size_t i = 0; i < results.size(); ++i) {\\n cout << results[i];\\n if (i == results.size() - 1) {\\n cout << endl;\\n }\\n else {\\n cout << \\\" \\\";\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.1545,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1326_2869025\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#define REP(i,n) for(ll i=0;i<ll(n);++i)\\n#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)\\n#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)\\n#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)\\n#define ALL(v) (v).begin(),(v).end()\\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\\n#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << \\\" \\\"; else cout << endl; }\\n#define INF 1000000001ll\\n#define MOD 1000000007ll\\n#define EPS 1e-9\\n\\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\\n\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<vi> vvi;\\ntypedef vector<vl> vvl;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nll max(ll a, int b) { return max(a, ll(b)); }\\nll max(int a, ll b) { return max(ll(a), b); }\\nll min(ll a, int b) { return min(a, ll(b)); }\\nll min(int a, ll b) { return min(ll(a), b); }\\n\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tint n, m;\\n\\twhile (cin >> n >> m, n) {\\n\\t\\tvector<string> p(n), q(m);\\n\\t\\tREP(i, n)cin >> p[i];\\n\\t\\tREP(i, m)cin >> q[i];\\n\\t\\tvi ind(n);\\n\\t\\tREP(i, n) {\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tREP(j, p[i].size()) {\\n\\t\\t\\t\\tif (p[i][j] != '.')break;\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t}\\n\\t\\t\\tind[i] = cnt;\\n\\t\\t}\\n\\t\\tvi res(m, -1);\\n\\t\\tREP(i, 20)REP(j, 20)REP(k, 20) {\\n\\t\\t\\tint r = 0, c = 0, s = 0;\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tREP(a, n) {\\n\\t\\t\\t\\tif (ind[a] != (i + 1)*r + (j + 1)*c + (k + 1)*s)ok = false;\\n\\t\\t\\t\\tREP(b, p[a].size()) {\\n\\t\\t\\t\\t\\tif (p[a][b] == '(')r++;\\n\\t\\t\\t\\t\\telse if (p[a][b] == ')')r--;\\n\\t\\t\\t\\t\\telse if (p[a][b] == '{')c++;\\n\\t\\t\\t\\t\\telse if (p[a][b] == '}')c--;\\n\\t\\t\\t\\t\\telse if (p[a][b] == '[')s++;\\n\\t\\t\\t\\t\\telse if (p[a][b] == ']')s--;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok)continue;\\n\\t\\t\\tr = 0, c = 0, s = 0;\\n\\t\\t\\n\\t\\t\\tREP(a, m) {\\n\\t\\t\\t\\tif(res[a]==-1)res[a] = (i + 1)*r + (j + 1)*c + (k + 1)*s;\\n\\t\\t\\t\\telse if(res[a]!=(i + 1)*r + (j + 1)*c + (k + 1)*s)res[a] = INF;\\n\\t\\t\\t\\tREP(b, q[a].size()) {\\n\\t\\t\\t\\t\\tif (q[a][b] == '(')r++;\\n\\t\\t\\t\\t\\telse if (q[a][b] == ')')r--;\\n\\t\\t\\t\\t\\telse if (q[a][b] == '{')c++;\\n\\t\\t\\t\\t\\telse if (q[a][b] == '}')c--;\\n\\t\\t\\t\\t\\telse if (q[a][b] == '[')s++;\\n\\t\\t\\t\\t\\telse if (q[a][b] == ']')s--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tREP(i, m) {\\n\\t\\t\\tif (i)cout << \\\" \\\";\\n\\t\\t\\tif (res[i] == INF)cout << -1;\\n\\t\\t\\telse cout << res[i];\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.7023,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":780,"cells":{"group_id":{"kind":"string","value":"aoj_1336_cpp"},"problem_description":{"kind":"string","value":"Problem B:\nThe Last Ant\nA straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When two ants meet, they try to pass each other. However, some sections of the tunnel are narrow and two ants cannot pass each other. When two ants meet at a narrow section, they turn around and start walking in the opposite directions. When an ant reaches either end of the tunnel, it leaves the tunnel.\nThe tunnel has an integer length in centimeters. Every narrow section of the tunnel is integer centimeters distant from the both ends. Except for these sections, the tunnel is wide enough for ants to pass each other. All ants start walking at distinct narrow sections. No ants will newly enter the tunnel. Consequently, all the ants in the tunnel will eventually leave it. Your task is to write a program that tells which is the last ant to leave the tunnel and when it will.\nFigure B.1 shows the movements of the ants during the first two seconds in a tunnel 6 centimeters long. Initially, three ants, numbered 1, 2, and 3, start walking at narrow sections, 1, 2, and 5 centimeters distant from the left end, respectively. After 0.5 seconds, the ants 1 and 2 meet at a wide section, and they pass each other. Two seconds after the start, the ants 1 and 3 meet at a narrow section, and they turn around.\nFigure B.1 corresponds to the first dataset of the sample input.\nFigure B.1. Movements of ants\nInput\nThe input consists of one or more datasets. Each dataset is formatted as follows.\nn\nl\nd\n1\np\n1\nd\n2\np\n2\n...\nd\nn\np\nn\nThe first line of a dataset contains two integers separated by a space.\nn\n(1 ≤\nn\n≤ 20) represents the number of ants, and\nl\n(\nn\n+ 1 ≤\nl\n≤ 100) represents the length of the tunnel in centimeters. The following\nn\nlines describe the initial states of ants. Each of the lines has two items,\nd\ni\nand\np\ni\n, separated by a space. Ants are given numbers 1 through\nn\n. The ant numbered\ni\nhas the initial direction\nd\ni\nand the initial position\np\ni\n. The initial direction\nd\ni\n(1 ≤\ni\n≤\nn\n) is\nL\n(to the\nleft) or\nR\n(to the right). The initial position\np\ni\n(1 ≤\ni\n≤\nn\n) is an integer specifying the distance from the left end of the tunnel in centimeters. Ants are listed in the left to right order, that is, 1 ≤\np\n1\n<\np\n2\n< ... <\np\nn\n≤\nl\n- 1.\nThe last dataset is followed by a line containing two zeros separated by a space.\nOutput\nFor each dataset, output how many seconds it will take before all the ants leave the tunnel, and which of the ants will be the last. The last ant is identified by its number. If two ants will leave at the same time, output the number indicating the ant that will leave through the left end of the tunnel.\nSample Input\n3 6\nR 1\nL 2\nL 5\n1 10\nR 1\n2 10\nR 5\nL 7\n2 10\nR 3\nL 8\n2 99\nR 1\nL 98\n4 10\nL 1\nR 2\nL 8\nR 9\n6 10\nR 2\nR 3\nL 4\nR 6\nL 7\nL 8\n0 0\nOutput for the Sample Input\n5 1\n9 1\n7 1\n8 2\n98 2\n8 2\n8 3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1336_10881257","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int n,L;cin >> n >> L;\n if(!n)break;\n vector<pii> v(n);\n vi C(L+1);\n rep(i,0,n){\n char d;int p;cin >> d >> p;\n if(d == 'L')v[i] = {p,-1};\n else v[i] = {p,1};\n C[p]++;\n }\n int lst = -1,tm = -1;\n rep(_,0,n*n*(L+1)+10){\n rep(i,0,n){\n auto &[p,d] = v[i];\n if(p == 0 || p == L)continue;\n C[p]--;p += d;C[p]++;\n if(p == 0){lst = i+1;tm = _;}\n else if(p == L){\n if(tm != _){lst = i+1;tm = _;}\n }\n }\n rep(i,0,n){\n auto &[p,d] = v[i];\n if(p != 0 && p != L && C[p] > 1)d *= -1;\n }\n }\n cout << tm+1 << \" \" << lst << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3304,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_1336_6791127","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while (1) {\n ll N,L;\n cin>>N>>L;\n if(N==0)return 0;\n vll D(N,-1),P(N);\n vll AN(N,-1);\n rep(i,N){\n char C;\n cin>>C>>P[i];\n if(C=='R')D[i]=1;\n }\n ll an=0;\n ll A=-1;\n rep(j,10000){\n map<ll,ll> M;\n rep(i,N){\n P[i]+=D[i];\n //cout<<i<<\" \"<<P[i]<<endl;\n M[P[i]]++;\n }\n rep(i,N){\n if(M[P[i]]>=2){\n D[i]*=-1;\n }\n \n if(P[i]==L){\n P[i]=1e17;\n if(an==j)continue;\n //cout<<\"#\"<<i<<\" \"<<j<<endl;\n an=j;\n A=i+1;\n }\n if(P[i]==0){\n P[i]=1e17;\n //cout<<i<<\" \"<<j<<endl;\n an=j;\n A=i+1;\n }\n }\n }\n cout<<an+1<<\" \"<<A<<endl;\n\n\n }\n\n}","accuracy":1,"time_ms":210,"memory_kb":3148,"score_of_the_acc":-1.9251,"final_rank":7},{"submission_id":"aoj_1336_2089488","code_snippet":"#include <iostream>\n#include <fstream>\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <cstring>\n#include <string>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n \n#define REP(i,n) for(int i=0; i<n; ++i)\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\n#define pi M_PI\n \ntypedef long long ll;\ntypedef vector<int> VI;\ntypedef vector<ll> VL;\ntypedef vector<VI> VVI;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nint main() {\n int n, l;\n while (cin >> n >> l && n){\n VI p(n), v(n);\n REP(i,n){\n char c;\n cin >> c >> p[i];\n if (c == 'R') v[i] = 1;\n else v[i] = -1;\n }\n FOR(t,1,l){\n map<int, int> a;\n REP(i,n){\n p[i] += v[i];\n a[p[i]]++;\n }\n FOR(i,1,l-1){\n if (a[i] >= 2){\n REP(j,n){\n if (p[j] == i) v[j] *= -1;\n }\n }\n }\n bool f = 1;\n REP(i,n) if (p[i] > 0 && p[i] < l) f = 0;\n if (f){\n int ans;\n REP(i,n) if (p[i] == l) ans = i+1;\n REP(i,n) if (p[i] == 0) ans = i+1;\n cout << t << \" \" << ans << endl;\n break;\n }\n }\n\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3072,"score_of_the_acc":-0.8887,"final_rank":5},{"submission_id":"aoj_1336_1389694","code_snippet":"// Header {{{\n// includes {{{\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <sys/time.h>\n#include <unistd.h>\n#include <vector>\n// }}}\nusing namespace std;\n// consts {{{\nstatic const int INF = 1e9;\nstatic const double PI = acos(-1.0);\nstatic const double EPS = 1e-10;\n// }}}\n// typedefs {{{\ntypedef long long int LL;\ntypedef unsigned long long int ULL;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\ntypedef vector<ULL> VULL;\ntypedef vector<VULL> VVULL;\ntypedef vector<double> VD;\ntypedef vector<VD> VVD;\ntypedef vector<bool> VB;\ntypedef vector<VB> VVB;\ntypedef vector<char> VC;\ntypedef vector<VC> VVC;\ntypedef vector<string> VS;\ntypedef vector<VS> VVS;\ntypedef pair<int, int> PII;\ntypedef complex<int> P;\n// }}}\n// macros & inline functions {{{\n// syntax sugars {{{\n#define FOR(i, b, e) for (typeof(e) i = (b); i < (e); ++i)\n#define FORI(i, b, e) for (typeof(e) i = (b); i <= (e); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define REPI(i, n) FORI(i, 0, n)\n#define OPOVER(_op, _type) inline bool operator _op (const _type &t) const\n// }}}\n// conversion {{{\ninline int toInt(string s) { int v; istringstream sin(s); sin>>v; return v; }\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout<<x; return sout.str(); }\n// }}}\n// array and STL {{{\n#define ARRSIZE(a) ( sizeof(a) / sizeof(a[0]) )\n#define ZERO(a, v) ( assert(v == 0 || v == -1), memset(a, v, sizeof(a)) )\n#define F first\n#define S second\n#define MP(a, b) make_pair(a, b)\n#define SIZE(a) ((LL)a.size())\n#define PB(e) push_back(e)\n#define SORT(v) sort((v).begin(), (v).end())\n#define RSORT(v) sort((v).rbegin(), (v).rend())\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define EACH(c, it) for(typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)\n#define REACH(c, it) for(typeof((c).rbegin()) it=(c).rbegin(); it!=(c).rend(); ++it)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n// }}}\n// bit manipulation {{{\n// singed integers are not for bitwise operations, specifically arithmetic shifts ('>>', and maybe not good for '<<' too)\n#define IS_UNSIGNED(n) (!numeric_limits<typeof(n)>::is_signed)\n#define BIT(n) (assert(IS_UNSIGNED(n)), assert(n < 64), (1ULL << (n)))\n#define BITOF(n, m) (assert(IS_UNSIGNED(n)), assert(m < 64), ((ULL)(n) >> (m) & 1))\ninline int BITS_COUNT(ULL b) { int c = 0; while(b != 0) { c += (b & 1); b >>= 1; } return c; }\ninline int MSB(ULL b) { int c = 0; while(b != 0) { ++c; b >>= 1; } return c-1; }\ninline int MAKE_MASK(ULL upper, ULL lower) { assert(lower < 64 && upper < 64 && lower <= upper); return (BIT(upper) - 1) ^ (BIT(lower) - 1); }\n// }}}\n// for readable code {{{\n#define EVEN(n) (n % 2 == 0)\n#define ODD(n) (!EVEN(n))\n// }}}\n// debug {{{\n#define arrsz(a) ( sizeof(a) / sizeof(a[0]) )\n#define dprt(fmt, ...) if (opt_debug) { fprintf(stderr, fmt, ##__VA_ARGS__); }\n#define darr(a) if (opt_debug) { copy( (a), (a) + arrsz(a), ostream_iterator<int>(cerr, \" \") ); cerr << endl; }\n#define darr_range(a, f, t) if (opt_debug) { copy( (a) + (f), (a) + (t), ostream_iterator<int>(cerr, \" \") ); cerr << endl; }\n#define dvec(v) if (opt_debug) { copy( ALL(v), ostream_iterator<int>(cerr, \" \") ); cerr << endl; }\n#define darr2(a) if (opt_debug) { FOR(__i, 0, (arrsz(a))){ darr( (a)[__i] ); } }\n#define WAIT() if (opt_debug) { string _wait_; cerr << \"(hit return to continue)\" << endl; getline(cin, _wait_); }\n#define dump(x) if (opt_debug) { cerr << \" [L\" << __LINE__ << \"] \" << #x << \" = \" << (x) << endl; }\n#define dumpl(x) if (opt_debug) { cerr << \" [L\" << __LINE__ << \"] \" << #x << endl << (x) << endl; }\n#define dumpf() if (opt_debug) { cerr << __PRETTY_FUNCTION__ << endl; }\n#define where() if (opt_debug) { cerr << __FILE__ << \": \" << __PRETTY_FUNCTION__ << \" [L: \" << __LINE__ << \"]\" << endl; }\n#define show_bits(b, s) if(opt_debug) { REP(i, s) { cerr << BITOF(b, s-1-i); if(i%4 == 3) cerr << ' '; } cerr << endl; }\n\n// ostreams {{{\n// complex\ntemplate<typename T> ostream& operator<<(ostream& s, const complex<T>& d) {return s << \"(\" << d.real() << \", \" << d.imag() << \")\";}\n\n// pair\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& d) {return s << \"(\" << d.first << \", \" << d.second << \")\";}\n\n// vector\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d) {\n\tint len = d.size();\n\tREP (i, len) {\n\t\ts << d[i]; if (i < len - 1) s << \"\\t\";\n\t}\n\treturn s;\n}\n\n// 2 dimentional vector\ntemplate<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& d) {\n\tint len = d.size();\n\tREP (i, len) {\n\t\ts << d[i] << endl;\n\t}\n\treturn s;\n}\n\n// map\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {\n\ts << \"{\" << endl;\n\tfor (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr) {\n\t\ts << \"\\t\" << (*itr).first << \" : \" << (*itr).second << endl;\n\t}\n\ts << \"}\" << endl;\n\treturn s;\n}\n// }}}\n// }}}\n// }}}\n// time {{{\ninline double now(){ struct timeval tv; gettimeofday(&tv, NULL); return (static_cast<double>(tv.tv_sec) + static_cast<double>(tv.tv_usec) * 1e-6); }\n// }}}\n// string manipulation {{{\ninline VS split(string s, char delimiter) { VS v; string t; REP(i, s.length()) { if(s[i] == delimiter) v.PB(t), t = \"\"; else t += s[i]; } v.PB(t); return v; }\ninline string join(VS s, string j) { string t; REP(i, s.size()) { t += s[i] + j; } return t; }\n// }}}\n// geometry {{{\n#define Y real()\n#define X imag()\n// }}}\n// 2 dimentional array {{{\nP dydx4[4] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1) };\nP dydx8[8] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1), P(-1, 1), P(1, 1), P(1, -1), P(-1, -1) };\nint g_height, g_width;\nbool in_field(P p) {\n\treturn (0 <= p.Y && p.Y < g_height) && (0 <= p.X && p.X < g_width);\n}\n// }}}\n// input and output {{{\ninline void input(string filename) {\n\tfreopen(filename.c_str(), \"r\", stdin);\n}\ninline void output(string filename) {\n\tfreopen(filename.c_str(), \"w\", stdout);\n}\n// }}}\n// }}}\n\n// Header under development {{{\n\nint LCM(int a, int b) {\n\t// FIXME\n\treturn a * b;\n}\n\n// Fraction class {{{\n// ref: http://martin-thoma.com/fractions-in-cpp/\nclass Fraction {\n\tpublic:\n\t\tULL numerator;\n\t\tULL denominator;\n\t\tFraction(ULL _numerator, ULL _denominator) {\n\t\t\tassert(_denominator > 0);\n\t\t\tnumerator = _numerator;\n\t\t\tdenominator = _denominator;\n\t\t};\n\n\t\tFraction operator*(const ULL rhs) {\n\t\t\treturn Fraction(this->numerator * rhs, this->denominator);\n\t\t};\n\n\t\tFraction operator*(const Fraction& rhs) {\n\t\t\treturn Fraction(this->numerator * rhs.numerator, this->denominator * rhs.denominator);\n\t\t}\n\n\t\tFraction operator+(const Fraction& rhs) {\n\t\t\tULL lcm = LCM(this->denominator, rhs.denominator);\n\t\t\tULL numer_lhs = this->numerator * (this->denominator / lcm);\n\t\t\tULL numer_rhs = rhs.numerator * (rhs.numerator / lcm);\n\t\t\treturn Fraction(numer_lhs + numer_rhs, lcm);\n\t\t}\n\n\t\tFraction& operator+=(const Fraction& rhs) {\n\t\t\tFraction result = (*this) + rhs;\n\t\t\tthis->numerator = result.numerator;\n\t\t\tthis->denominator = result.denominator;\n\t\t\treturn *this;\n\t\t}\n};\n\nstd::ostream& operator<<(std::ostream &s, const Fraction &a) {\n\tif (a.denominator == 1) {\n\t\ts << a.numerator;\n\t} else {\n\t\ts << a.numerator << \"/\" << a.denominator;\n\t}\n\treturn s;\n}\n\n// }}}\n\n// }}}\n\nbool opt_debug = false;\n\nclass Ant {\n\tpublic:\n\t\tint id;\n\t\tchar direction;\n\t\tAnt(int _id, char _direction) : id(_id), direction(_direction) {\n\t\t}\n};\n\nint main(int argc, char** argv) {\n\tstd::ios_base::sync_with_stdio(false);\n\t// set options {{{\n\tint __c;\n\twhile ( (__c = getopt(argc, argv, \"d\")) != -1 ) {\n\t\tswitch (__c) {\n\t\t\tcase 'd':\n\t\t\t\topt_debug = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tabort();\n\t\t}\n\t}\n\t// }}}\n\n\t// input(\"./inputs/0.txt\");\n\t// output(\"./outputs/0.txt\");\n\n\tint n, l;\n\twhile(cin >> n >> l, n | l) {\n\t\tvector< vector<Ant> > ants(l + 1, vector<Ant>());\n\t\tint n_ants = n;\n\t\tREP (i, n) {\n\t\t\tchar d; int p; cin >> d >> p;\n\t\t\tAnt a(i+1, d);\n\t\t\tants[p].PB(a);\n\t\t}\n\n\t\tint sec = 0;\n\t\tAnt ans(0, ' ');\n\t\twhile (n_ants) {\n\t\t\tsec++;\n\t\t\tvector< vector<Ant> > next_ants(l + 1, vector<Ant>());\n\t\t\t// REP (i, l + 1) {\n\t\t\tfor (int i = l; i >= 0; --i) {\n\t\t\t\tif (i == l && ants[i].size()) {\n\t\t\t\t\tans = ants[i][0];\n\t\t\t\t\tn_ants--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (i == 0 && ants[i].size()) {\n\t\t\t\t\tans = ants[i][0];\n\t\t\t\t\tn_ants--;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tEACH (ants[i], itr) {\n\t\t\t\t\tAnt& ant = *itr;\n\t\t\t\t\tif (ant.direction == 'L') {\n\t\t\t\t\t\tnext_ants[i-1].PB(ant);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnext_ants[i+1].PB(ant);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tREP (i, l + 1) {\n\t\t\t\tassert(next_ants[i].size() <= 2);\n\t\t\t\tif (next_ants[i].size() == 2) {\n\t\t\t\t\tEACH (next_ants[i], itr) {\n\t\t\t\t\t\t(*itr).direction = (*itr).direction == 'L' ? 'R' : 'L';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tants = next_ants;\n\t\t}\n\n\t\tcout << sec - 1 << \" \" << ans.id << endl;\n\t}\n\n\treturn 0;\n}\n\n// vim: foldmethod=marker","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.0077,"final_rank":2},{"submission_id":"aoj_1336_1194579","code_snippet":"#include <bits/stdc++.h>\n#include <regex>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (k); i < (n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) begin(a),end(a)\n#define MS(m,v) memset(m,v,sizeof(m))\n#define D10 fixed<<setprecision(10)\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> P;\ntypedef complex<double> Point;\ntypedef long long ll;\nconst int INF = 1145141919;\nconst int MOD = 100000007;\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\nstruct edge\n{\n\tint from, to, cost;\n\tbool operator < (const edge& e) const { return cost < e.cost; }\n\tbool operator >(const edge& e) const { return cost > e.cost; }\n};\n///*************************************************************************************///\n///*************************************************************************************///\n///*************************************************************************************///\n\nint main()\n{\n\tint n, l;\n\twhile (cin >> n >> l,n)\n\t{\n\t\tvector<P> v;\n\t\tREP(i, n)\n\t\t{\n\t\t\tchar c; int p;\n\t\t\tcin >> c >> p;\n\t\t\tv.push_back(P(c == 'L' ? -1 : 1, p));\n\t\t}\n\t\tint res = n;\n\t\tint cnt = 0;\n\t\tP lastl,lastr;\n\t\twhile (res)\n\t\t{\n\t\t\tcnt++;\n\t\t\tmap<int, vector<int>> m;\n\t\t\tREP(i, v.size())\n\t\t\t{\n\t\t\t\tv[i].second += v[i].first;\n\t\t\t\tm[v[i].second].push_back(i);\n\t\t\t\tif (v[i].second == 0)\n\t\t\t\t{\n\t\t\t\t\tlastl = P(cnt, i);\n\t\t\t\t\tres--;\n\t\t\t\t}\n\t\t\t\tif (v[i].second == l)\n\t\t\t\t{\n\t\t\t\t\tlastr = P(cnt, i);\n\t\t\t\t\tres--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tREP(i, l)\n\t\t\t{\n\t\t\t\tif (m[i].size() == 2)\n\t\t\t\t{\n\t\t\t\t\tswap(v[m[i][0]].first, v[m[i][1]].first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << cnt << \" \" << (lastl.first >= lastr.first ? lastl.second + 1 : lastr.second + 1) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1220,"score_of_the_acc":-0.05,"final_rank":4},{"submission_id":"aoj_1336_1114218","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 110\n\nbool check(int ant[MAX],int L){\n for(int i = 0 ; i < L ; i++){\n if(ant[i] != 0) return false;\n }\n return true;\n}\n\nint main(){\n int N,L,p;\n char d;\n while(cin >> N >> L, N){\n int ant[MAX]={0};\n vector<int> tunnel[MAX],id[MAX];\n L--;\n for(int i = 0 ; i < N ; i++){\n cin >> d >> p;\n ant[p-1]++;\n id[p-1].push_back(i+1);\n tunnel[p-1].push_back((d == 'L' ? 1 : 2));\n }\n int t = 0,last;\n while(!check(ant,L)){\n vector<int> next[MAX],nid[MAX];\n last = -1;\n for(int i = 0 ; i < L ; i++){\n next[i].clear();\n nid[i].clear();\n if(ant[i] && last == -1){\n last = id[i][0];\n }\n }\n for(int i = 0 ; i < L ; i++){\n while(tunnel[i].size()){\n if(tunnel[i][0] == 1){\n tunnel[i].erase(tunnel[i].begin());\n if(i-1 >= 0){\n next[i-1].push_back(1);\n nid[i-1].push_back(id[i][0]);\n id[i].erase(id[i].begin());\n }\n }else if(tunnel[i][0] == 2){\n tunnel[i].erase(tunnel[i].begin());\n if(i+1 < L){\n next[i+1].push_back(2);\n nid[i+1].push_back(id[i][0]);\n id[i].erase(id[i].begin());\n }\n }\n }\n }\n for(int i = 0 ; i < L ; i++){\n tunnel[i] = next[i];\n id[i] = nid[i];\n if(tunnel[i].size() == 2){\n swap(tunnel[i][0],tunnel[i][1]);\n }\n ant[i] = tunnel[i].size();\n }\n t++;\n }\n cout << t << \" \" << last << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.0077,"final_rank":2},{"submission_id":"aoj_1336_1114217","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 110\ntypedef pair<char,int> P;\n\nbool check(int ant[MAX],int L){\n for(int i = 0 ; i < L ; i++){\n if(ant[i] != 0) return false;\n }\n return true;\n}\n\nint main(){\n int N,L,p;\n char d;\n while(cin >> N >> L, N){\n int ant[MAX]={0};\n vector<int> tunnel[MAX],id[MAX];\n L--;\n for(int i = 0 ; i < N ; i++){\n cin >> d >> p;\n ant[p-1]++;\n id[p-1].push_back(i+1);\n tunnel[p-1].push_back((d == 'L' ? 1 : 2));\n }\n int t = 0,last;\n while(!check(ant,L)){\n vector<int> next[MAX],nid[MAX];\n last = -1;\n for(int i = 0 ; i < L ; i++){\n next[i].clear();\n nid[i].clear();\n if(ant[i] && last == -1){\n last = id[i][0];\n }\n }\n for(int i = 0 ; i < L ; i++){\n while(tunnel[i].size()){\n if(tunnel[i][0] == 1){\n tunnel[i].erase(tunnel[i].begin());\n if(i-1 >= 0){\n next[i-1].push_back(1);\n nid[i-1].push_back(id[i][0]);\n id[i].erase(id[i].begin());\n }\n }else if(tunnel[i][0] == 2){\n tunnel[i].erase(tunnel[i].begin());\n if(i+1 < L){\n next[i+1].push_back(2);\n nid[i+1].push_back(id[i][0]);\n id[i].erase(id[i].begin());\n }\n }\n }\n }\n for(int i = 0 ; i < L ; i++){\n tunnel[i] = next[i];\n id[i] = nid[i];\n if(tunnel[i].size() == 2){\n swap(tunnel[i][0],tunnel[i][1]);\n }\n ant[i] = tunnel[i].size();\n }\n t++;\n }\n cout << t << \" \" << last << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1232,"score_of_the_acc":-0.0058,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1336_10881257\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;i--)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int n,L;cin >> n >> L;\\n if(!n)break;\\n vector<pii> v(n);\\n vi C(L+1);\\n rep(i,0,n){\\n char d;int p;cin >> d >> p;\\n if(d == 'L')v[i] = {p,-1};\\n else v[i] = {p,1};\\n C[p]++;\\n }\\n int lst = -1,tm = -1;\\n rep(_,0,n*n*(L+1)+10){\\n rep(i,0,n){\\n auto &[p,d] = v[i];\\n if(p == 0 || p == L)continue;\\n C[p]--;p += d;C[p]++;\\n if(p == 0){lst = i+1;tm = _;}\\n else if(p == L){\\n if(tm != _){lst = i+1;tm = _;}\\n }\\n }\\n rep(i,0,n){\\n auto &[p,d] = v[i];\\n if(p != 0 && p != L && C[p] > 1)d *= -1;\\n }\\n }\\n cout << tm+1 << \\\" \\\" << lst << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1336_6791127\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n while (1) {\\n ll N,L;\\n cin>>N>>L;\\n if(N==0)return 0;\\n vll D(N,-1),P(N);\\n vll AN(N,-1);\\n rep(i,N){\\n char C;\\n cin>>C>>P[i];\\n if(C=='R')D[i]=1;\\n }\\n ll an=0;\\n ll A=-1;\\n rep(j,10000){\\n map<ll,ll> M;\\n rep(i,N){\\n P[i]+=D[i];\\n //cout<<i<<\\\" \\\"<<P[i]<<endl;\\n M[P[i]]++;\\n }\\n rep(i,N){\\n if(M[P[i]]>=2){\\n D[i]*=-1;\\n }\\n \\n if(P[i]==L){\\n P[i]=1e17;\\n if(an==j)continue;\\n //cout<<\\\"#\\\"<<i<<\\\" \\\"<<j<<endl;\\n an=j;\\n A=i+1;\\n }\\n if(P[i]==0){\\n P[i]=1e17;\\n //cout<<i<<\\\" \\\"<<j<<endl;\\n an=j;\\n A=i+1;\\n }\\n }\\n }\\n cout<<an+1<<\\\" \\\"<<A<<endl;\\n\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -1.9251,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1336_2089488\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <cstdio>\\n#include <cmath>\\n#include <vector>\\n#include <cstring>\\n#include <string>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n \\n#define REP(i,n) for(int i=0; i<n; ++i)\\n#define FOR(i,a,b) for(int i=a; i<=b; ++i)\\n#define FORR(i,a,b) for (int i=a; i>=b; --i)\\n#define pi M_PI\\n \\ntypedef long long ll;\\ntypedef vector<int> VI;\\ntypedef vector<ll> VL;\\ntypedef vector<VI> VVI;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nint main() {\\n int n, l;\\n while (cin >> n >> l && n){\\n VI p(n), v(n);\\n REP(i,n){\\n char c;\\n cin >> c >> p[i];\\n if (c == 'R') v[i] = 1;\\n else v[i] = -1;\\n }\\n FOR(t,1,l){\\n map<int, int> a;\\n REP(i,n){\\n p[i] += v[i];\\n a[p[i]]++;\\n }\\n FOR(i,1,l-1){\\n if (a[i] >= 2){\\n REP(j,n){\\n if (p[j] == i) v[j] *= -1;\\n }\\n }\\n }\\n bool f = 1;\\n REP(i,n) if (p[i] > 0 && p[i] < l) f = 0;\\n if (f){\\n int ans;\\n REP(i,n) if (p[i] == l) ans = i+1;\\n REP(i,n) if (p[i] == 0) ans = i+1;\\n cout << t << \\\" \\\" << ans << endl;\\n break;\\n }\\n }\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.8887,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1336_1389694\",\n \"code_snippet\": \"// Header {{{\\n// includes {{{\\n#include <algorithm>\\n#include <cassert>\\n#include <cctype>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <sys/time.h>\\n#include <unistd.h>\\n#include <vector>\\n// }}}\\nusing namespace std;\\n// consts {{{\\nstatic const int INF = 1e9;\\nstatic const double PI = acos(-1.0);\\nstatic const double EPS = 1e-10;\\n// }}}\\n// typedefs {{{\\ntypedef long long int LL;\\ntypedef unsigned long long int ULL;\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\ntypedef vector<ULL> VULL;\\ntypedef vector<VULL> VVULL;\\ntypedef vector<double> VD;\\ntypedef vector<VD> VVD;\\ntypedef vector<bool> VB;\\ntypedef vector<VB> VVB;\\ntypedef vector<char> VC;\\ntypedef vector<VC> VVC;\\ntypedef vector<string> VS;\\ntypedef vector<VS> VVS;\\ntypedef pair<int, int> PII;\\ntypedef complex<int> P;\\n// }}}\\n// macros & inline functions {{{\\n// syntax sugars {{{\\n#define FOR(i, b, e) for (typeof(e) i = (b); i < (e); ++i)\\n#define FORI(i, b, e) for (typeof(e) i = (b); i <= (e); ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define REPI(i, n) FORI(i, 0, n)\\n#define OPOVER(_op, _type) inline bool operator _op (const _type &t) const\\n// }}}\\n// conversion {{{\\ninline int toInt(string s) { int v; istringstream sin(s); sin>>v; return v; }\\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout<<x; return sout.str(); }\\n// }}}\\n// array and STL {{{\\n#define ARRSIZE(a) ( sizeof(a) / sizeof(a[0]) )\\n#define ZERO(a, v) ( assert(v == 0 || v == -1), memset(a, v, sizeof(a)) )\\n#define F first\\n#define S second\\n#define MP(a, b) make_pair(a, b)\\n#define SIZE(a) ((LL)a.size())\\n#define PB(e) push_back(e)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define RSORT(v) sort((v).rbegin(), (v).rend())\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define EACH(c, it) for(typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)\\n#define REACH(c, it) for(typeof((c).rbegin()) it=(c).rbegin(); it!=(c).rend(); ++it)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n// }}}\\n// bit manipulation {{{\\n// singed integers are not for bitwise operations, specifically arithmetic shifts ('>>', and maybe not good for '<<' too)\\n#define IS_UNSIGNED(n) (!numeric_limits<typeof(n)>::is_signed)\\n#define BIT(n) (assert(IS_UNSIGNED(n)), assert(n < 64), (1ULL << (n)))\\n#define BITOF(n, m) (assert(IS_UNSIGNED(n)), assert(m < 64), ((ULL)(n) >> (m) & 1))\\ninline int BITS_COUNT(ULL b) { int c = 0; while(b != 0) { c += (b & 1); b >>= 1; } return c; }\\ninline int MSB(ULL b) { int c = 0; while(b != 0) { ++c; b >>= 1; } return c-1; }\\ninline int MAKE_MASK(ULL upper, ULL lower) { assert(lower < 64 && upper < 64 && lower <= upper); return (BIT(upper) - 1) ^ (BIT(lower) - 1); }\\n// }}}\\n// for readable code {{{\\n#define EVEN(n) (n % 2 == 0)\\n#define ODD(n) (!EVEN(n))\\n// }}}\\n// debug {{{\\n#define arrsz(a) ( sizeof(a) / sizeof(a[0]) )\\n#define dprt(fmt, ...) if (opt_debug) { fprintf(stderr, fmt, ##__VA_ARGS__); }\\n#define darr(a) if (opt_debug) { copy( (a), (a) + arrsz(a), ostream_iterator<int>(cerr, \\\" \\\") ); cerr << endl; }\\n#define darr_range(a, f, t) if (opt_debug) { copy( (a) + (f), (a) + (t), ostream_iterator<int>(cerr, \\\" \\\") ); cerr << endl; }\\n#define dvec(v) if (opt_debug) { copy( ALL(v), ostream_iterator<int>(cerr, \\\" \\\") ); cerr << endl; }\\n#define darr2(a) if (opt_debug) { FOR(__i, 0, (arrsz(a))){ darr( (a)[__i] ); } }\\n#define WAIT() if (opt_debug) { string _wait_; cerr << \\\"(hit return to continue)\\\" << endl; getline(cin, _wait_); }\\n#define dump(x) if (opt_debug) { cerr << \\\" [L\\\" << __LINE__ << \\\"] \\\" << #x << \\\" = \\\" << (x) << endl; }\\n#define dumpl(x) if (opt_debug) { cerr << \\\" [L\\\" << __LINE__ << \\\"] \\\" << #x << endl << (x) << endl; }\\n#define dumpf() if (opt_debug) { cerr << __PRETTY_FUNCTION__ << endl; }\\n#define where() if (opt_debug) { cerr << __FILE__ << \\\": \\\" << __PRETTY_FUNCTION__ << \\\" [L: \\\" << __LINE__ << \\\"]\\\" << endl; }\\n#define show_bits(b, s) if(opt_debug) { REP(i, s) { cerr << BITOF(b, s-1-i); if(i%4 == 3) cerr << ' '; } cerr << endl; }\\n\\n// ostreams {{{\\n// complex\\ntemplate<typename T> ostream& operator<<(ostream& s, const complex<T>& d) {return s << \\\"(\\\" << d.real() << \\\", \\\" << d.imag() << \\\")\\\";}\\n\\n// pair\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& d) {return s << \\\"(\\\" << d.first << \\\", \\\" << d.second << \\\")\\\";}\\n\\n// vector\\ntemplate<typename T> ostream& operator<<(ostream& s, const vector<T>& d) {\\n\\tint len = d.size();\\n\\tREP (i, len) {\\n\\t\\ts << d[i]; if (i < len - 1) s << \\\"\\\\t\\\";\\n\\t}\\n\\treturn s;\\n}\\n\\n// 2 dimentional vector\\ntemplate<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& d) {\\n\\tint len = d.size();\\n\\tREP (i, len) {\\n\\t\\ts << d[i] << endl;\\n\\t}\\n\\treturn s;\\n}\\n\\n// map\\ntemplate<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {\\n\\ts << \\\"{\\\" << endl;\\n\\tfor (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr) {\\n\\t\\ts << \\\"\\\\t\\\" << (*itr).first << \\\" : \\\" << (*itr).second << endl;\\n\\t}\\n\\ts << \\\"}\\\" << endl;\\n\\treturn s;\\n}\\n// }}}\\n// }}}\\n// }}}\\n// time {{{\\ninline double now(){ struct timeval tv; gettimeofday(&tv, NULL); return (static_cast<double>(tv.tv_sec) + static_cast<double>(tv.tv_usec) * 1e-6); }\\n// }}}\\n// string manipulation {{{\\ninline VS split(string s, char delimiter) { VS v; string t; REP(i, s.length()) { if(s[i] == delimiter) v.PB(t), t = \\\"\\\"; else t += s[i]; } v.PB(t); return v; }\\ninline string join(VS s, string j) { string t; REP(i, s.size()) { t += s[i] + j; } return t; }\\n// }}}\\n// geometry {{{\\n#define Y real()\\n#define X imag()\\n// }}}\\n// 2 dimentional array {{{\\nP dydx4[4] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1) };\\nP dydx8[8] = { P(-1, 0), P(0, 1), P(1, 0), P(0, -1), P(-1, 1), P(1, 1), P(1, -1), P(-1, -1) };\\nint g_height, g_width;\\nbool in_field(P p) {\\n\\treturn (0 <= p.Y && p.Y < g_height) && (0 <= p.X && p.X < g_width);\\n}\\n// }}}\\n// input and output {{{\\ninline void input(string filename) {\\n\\tfreopen(filename.c_str(), \\\"r\\\", stdin);\\n}\\ninline void output(string filename) {\\n\\tfreopen(filename.c_str(), \\\"w\\\", stdout);\\n}\\n// }}}\\n// }}}\\n\\n// Header under development {{{\\n\\nint LCM(int a, int b) {\\n\\t// FIXME\\n\\treturn a * b;\\n}\\n\\n// Fraction class {{{\\n// ref: http://martin-thoma.com/fractions-in-cpp/\\nclass Fraction {\\n\\tpublic:\\n\\t\\tULL numerator;\\n\\t\\tULL denominator;\\n\\t\\tFraction(ULL _numerator, ULL _denominator) {\\n\\t\\t\\tassert(_denominator > 0);\\n\\t\\t\\tnumerator = _numerator;\\n\\t\\t\\tdenominator = _denominator;\\n\\t\\t};\\n\\n\\t\\tFraction operator*(const ULL rhs) {\\n\\t\\t\\treturn Fraction(this->numerator * rhs, this->denominator);\\n\\t\\t};\\n\\n\\t\\tFraction operator*(const Fraction& rhs) {\\n\\t\\t\\treturn Fraction(this->numerator * rhs.numerator, this->denominator * rhs.denominator);\\n\\t\\t}\\n\\n\\t\\tFraction operator+(const Fraction& rhs) {\\n\\t\\t\\tULL lcm = LCM(this->denominator, rhs.denominator);\\n\\t\\t\\tULL numer_lhs = this->numerator * (this->denominator / lcm);\\n\\t\\t\\tULL numer_rhs = rhs.numerator * (rhs.numerator / lcm);\\n\\t\\t\\treturn Fraction(numer_lhs + numer_rhs, lcm);\\n\\t\\t}\\n\\n\\t\\tFraction& operator+=(const Fraction& rhs) {\\n\\t\\t\\tFraction result = (*this) + rhs;\\n\\t\\t\\tthis->numerator = result.numerator;\\n\\t\\t\\tthis->denominator = result.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n};\\n\\nstd::ostream& operator<<(std::ostream &s, const Fraction &a) {\\n\\tif (a.denominator == 1) {\\n\\t\\ts << a.numerator;\\n\\t} else {\\n\\t\\ts << a.numerator << \\\"/\\\" << a.denominator;\\n\\t}\\n\\treturn s;\\n}\\n\\n// }}}\\n\\n// }}}\\n\\nbool opt_debug = false;\\n\\nclass Ant {\\n\\tpublic:\\n\\t\\tint id;\\n\\t\\tchar direction;\\n\\t\\tAnt(int _id, char _direction) : id(_id), direction(_direction) {\\n\\t\\t}\\n};\\n\\nint main(int argc, char** argv) {\\n\\tstd::ios_base::sync_with_stdio(false);\\n\\t// set options {{{\\n\\tint __c;\\n\\twhile ( (__c = getopt(argc, argv, \\\"d\\\")) != -1 ) {\\n\\t\\tswitch (__c) {\\n\\t\\t\\tcase 'd':\\n\\t\\t\\t\\topt_debug = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tabort();\\n\\t\\t}\\n\\t}\\n\\t// }}}\\n\\n\\t// input(\\\"./inputs/0.txt\\\");\\n\\t// output(\\\"./outputs/0.txt\\\");\\n\\n\\tint n, l;\\n\\twhile(cin >> n >> l, n | l) {\\n\\t\\tvector< vector<Ant> > ants(l + 1, vector<Ant>());\\n\\t\\tint n_ants = n;\\n\\t\\tREP (i, n) {\\n\\t\\t\\tchar d; int p; cin >> d >> p;\\n\\t\\t\\tAnt a(i+1, d);\\n\\t\\t\\tants[p].PB(a);\\n\\t\\t}\\n\\n\\t\\tint sec = 0;\\n\\t\\tAnt ans(0, ' ');\\n\\t\\twhile (n_ants) {\\n\\t\\t\\tsec++;\\n\\t\\t\\tvector< vector<Ant> > next_ants(l + 1, vector<Ant>());\\n\\t\\t\\t// REP (i, l + 1) {\\n\\t\\t\\tfor (int i = l; i >= 0; --i) {\\n\\t\\t\\t\\tif (i == l && ants[i].size()) {\\n\\t\\t\\t\\t\\tans = ants[i][0];\\n\\t\\t\\t\\t\\tn_ants--;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (i == 0 && ants[i].size()) {\\n\\t\\t\\t\\t\\tans = ants[i][0];\\n\\t\\t\\t\\t\\tn_ants--;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tEACH (ants[i], itr) {\\n\\t\\t\\t\\t\\tAnt& ant = *itr;\\n\\t\\t\\t\\t\\tif (ant.direction == 'L') {\\n\\t\\t\\t\\t\\t\\tnext_ants[i-1].PB(ant);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tnext_ants[i+1].PB(ant);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tREP (i, l + 1) {\\n\\t\\t\\t\\tassert(next_ants[i].size() <= 2);\\n\\t\\t\\t\\tif (next_ants[i].size() == 2) {\\n\\t\\t\\t\\t\\tEACH (next_ants[i], itr) {\\n\\t\\t\\t\\t\\t\\t(*itr).direction = (*itr).direction == 'L' ? 'R' : 'L';\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tants = next_ants;\\n\\t\\t}\\n\\n\\t\\tcout << sec - 1 << \\\" \\\" << ans.id << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n// vim: foldmethod=marker\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.0077,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1336_1194579\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <regex>\\nusing namespace std;\\n#define FOR(i,k,n) for(int i = (k); i < (n); i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(a) begin(a),end(a)\\n#define MS(m,v) memset(m,v,sizeof(m))\\n#define D10 fixed<<setprecision(10)\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> P;\\ntypedef complex<double> Point;\\ntypedef long long ll;\\nconst int INF = 1145141919;\\nconst int MOD = 100000007;\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nstruct edge\\n{\\n\\tint from, to, cost;\\n\\tbool operator < (const edge& e) const { return cost < e.cost; }\\n\\tbool operator >(const edge& e) const { return cost > e.cost; }\\n};\\n///*************************************************************************************///\\n///*************************************************************************************///\\n///*************************************************************************************///\\n\\nint main()\\n{\\n\\tint n, l;\\n\\twhile (cin >> n >> l,n)\\n\\t{\\n\\t\\tvector<P> v;\\n\\t\\tREP(i, n)\\n\\t\\t{\\n\\t\\t\\tchar c; int p;\\n\\t\\t\\tcin >> c >> p;\\n\\t\\t\\tv.push_back(P(c == 'L' ? -1 : 1, p));\\n\\t\\t}\\n\\t\\tint res = n;\\n\\t\\tint cnt = 0;\\n\\t\\tP lastl,lastr;\\n\\t\\twhile (res)\\n\\t\\t{\\n\\t\\t\\tcnt++;\\n\\t\\t\\tmap<int, vector<int>> m;\\n\\t\\t\\tREP(i, v.size())\\n\\t\\t\\t{\\n\\t\\t\\t\\tv[i].second += v[i].first;\\n\\t\\t\\t\\tm[v[i].second].push_back(i);\\n\\t\\t\\t\\tif (v[i].second == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tlastl = P(cnt, i);\\n\\t\\t\\t\\t\\tres--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (v[i].second == l)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tlastr = P(cnt, i);\\n\\t\\t\\t\\t\\tres--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, l)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (m[i].size() == 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tswap(v[m[i][0]].first, v[m[i][1]].first);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << cnt << \\\" \\\" << (lastl.first >= lastr.first ? lastl.second + 1 : lastr.second + 1) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.05,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1336_1114218\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 110\\n\\nbool check(int ant[MAX],int L){\\n for(int i = 0 ; i < L ; i++){\\n if(ant[i] != 0) return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n int N,L,p;\\n char d;\\n while(cin >> N >> L, N){\\n int ant[MAX]={0};\\n vector<int> tunnel[MAX],id[MAX];\\n L--;\\n for(int i = 0 ; i < N ; i++){\\n cin >> d >> p;\\n ant[p-1]++;\\n id[p-1].push_back(i+1);\\n tunnel[p-1].push_back((d == 'L' ? 1 : 2));\\n }\\n int t = 0,last;\\n while(!check(ant,L)){\\n vector<int> next[MAX],nid[MAX];\\n last = -1;\\n for(int i = 0 ; i < L ; i++){\\n next[i].clear();\\n nid[i].clear();\\n if(ant[i] && last == -1){\\n last = id[i][0];\\n }\\n }\\n for(int i = 0 ; i < L ; i++){\\n while(tunnel[i].size()){\\n if(tunnel[i][0] == 1){\\n tunnel[i].erase(tunnel[i].begin());\\n if(i-1 >= 0){\\n next[i-1].push_back(1);\\n nid[i-1].push_back(id[i][0]);\\n id[i].erase(id[i].begin());\\n }\\n }else if(tunnel[i][0] == 2){\\n tunnel[i].erase(tunnel[i].begin());\\n if(i+1 < L){\\n next[i+1].push_back(2);\\n nid[i+1].push_back(id[i][0]);\\n id[i].erase(id[i].begin());\\n }\\n }\\n }\\n }\\n for(int i = 0 ; i < L ; i++){\\n tunnel[i] = next[i];\\n id[i] = nid[i];\\n if(tunnel[i].size() == 2){\\n swap(tunnel[i][0],tunnel[i][1]);\\n }\\n ant[i] = tunnel[i].size();\\n }\\n t++;\\n }\\n cout << t << \\\" \\\" << last << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.0077,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1336_1114217\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 110\\ntypedef pair<char,int> P;\\n\\nbool check(int ant[MAX],int L){\\n for(int i = 0 ; i < L ; i++){\\n if(ant[i] != 0) return false;\\n }\\n return true;\\n}\\n\\nint main(){\\n int N,L,p;\\n char d;\\n while(cin >> N >> L, N){\\n int ant[MAX]={0};\\n vector<int> tunnel[MAX],id[MAX];\\n L--;\\n for(int i = 0 ; i < N ; i++){\\n cin >> d >> p;\\n ant[p-1]++;\\n id[p-1].push_back(i+1);\\n tunnel[p-1].push_back((d == 'L' ? 1 : 2));\\n }\\n int t = 0,last;\\n while(!check(ant,L)){\\n vector<int> next[MAX],nid[MAX];\\n last = -1;\\n for(int i = 0 ; i < L ; i++){\\n next[i].clear();\\n nid[i].clear();\\n if(ant[i] && last == -1){\\n last = id[i][0];\\n }\\n }\\n for(int i = 0 ; i < L ; i++){\\n while(tunnel[i].size()){\\n if(tunnel[i][0] == 1){\\n tunnel[i].erase(tunnel[i].begin());\\n if(i-1 >= 0){\\n next[i-1].push_back(1);\\n nid[i-1].push_back(id[i][0]);\\n id[i].erase(id[i].begin());\\n }\\n }else if(tunnel[i][0] == 2){\\n tunnel[i].erase(tunnel[i].begin());\\n if(i+1 < L){\\n next[i+1].push_back(2);\\n nid[i+1].push_back(id[i][0]);\\n id[i].erase(id[i].begin());\\n }\\n }\\n }\\n }\\n for(int i = 0 ; i < L ; i++){\\n tunnel[i] = next[i];\\n id[i] = nid[i];\\n if(tunnel[i].size() == 2){\\n swap(tunnel[i][0],tunnel[i][1]);\\n }\\n ant[i] = tunnel[i].size();\\n }\\n t++;\\n }\\n cout << t << \\\" \\\" << last << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1232,\n \"score_of_the_acc\": -0.0058,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":781,"cells":{"group_id":{"kind":"string","value":"aoj_1331_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nLet There Be Light\nSuppose that there are some light sources and many spherical balloons. All light sources have sizes small enough to be modeled as point light sources, and they emit light in all directions. The surfaces of the balloons absorb light and do not reflect light. Surprisingly in this world, balloons may overlap.\nYou want the total illumination intensity at an objective point as high as possible. For this purpose, some of the balloons obstructing lights can be removed. Because of the removal costs, however, there is a certain limit on the number of balloons to be removed. Thus, you would like to remove an appropriate set of balloons so as to maximize the illumination intensity at the objective point.\nThe following figure illustrates the configuration specified in the first dataset of the sample input given below. The figure shows the\nxy\n-plane, which is enough because, in this dataset, the\nz\n-coordinates of all the light sources, balloon centers, and the objective point are zero. In the figure, light sources are shown as stars and balloons as circles. The objective point is at the origin, and you may remove up to 4 balloons. In this case, the dashed circles in the figure correspond to the balloons to be removed.\nFigure G.1: First dataset of the sample input.\nInput\nThe input is a sequence of datasets. Each dataset is formatted as follows.\nN M R\nS\n1\nx\nS\n1\ny\nS\n1\nz\nS\n1\nr\n...\nS\nNx\nS\nNy\nS\nNz\nS\nNr\nT\n1\nx\nT\n1\ny\nT\n1\nz\nT\n1\nb\n...\nT\nMx\nT\nMy\nT\nMz\nT\nMb\nE\nx\nE\ny\nE\nz\nThe first line of a dataset contains three positive integers,\nN\n,\nM\nand\nR\n, separated by a single space.\nN\nmeans the number of balloons that does not exceed 2000.\nM\nmeans the number of light sources that does not exceed 15.\nR\nmeans the number of balloons that may be removed, which does not exceed\nN\n.\nEach of the\nN\nlines following the first line contains four integers separated by a single space. (\nS\nix\n,\nS\niy\n,\nS\niz\n) means the center position of the\ni\n-th balloon and\nS\nir\nmeans its radius.\nEach of the following\nM\nlines contains four integers separated by a single space. (\nT\njx\n,\nT\njy\n,\nT\njz\n) means the position of the\nj\n-th light source and\nT\njb\nmeans its brightness.\nThe last line of a dataset contains three integers separated by a single space. (\nE\nx\n,\nE\ny\n,\nE\nz\n) means the position of the objective point.\nS\nix\n,\nS\niy\n,\nS\niz\n,\nT\njx\n,\nT\njy\n,\nT\njz\n,\nE\nx\n,\nE\ny\nand\nE\nz\nare greater than -500, and less than 500.\nS\nir\nis greater than 0, and less than 500.\nT\njb\nis greater than 0, and less than 80000.\nAt the objective point, the intensity of the light from the\nj\n-th light source is in inverse proportion to the square of the distance, namely\nT\njb\n/ { (\nT\njx\n−\nE\nx\n)\n2\n+ (\nT\njy\n−\nE\ny\n)\n2\n+ (\nT\njz\n−\nE\nz\n)\n2\n},\nif there is no balloon interrupting the light. The total illumination intensity is the sum of the above.\nYou may assume the following.\nThe distance between the objective point and any light source is not less than 1.\nFor every\ni\nand\nj\n, even if\nS\nir\nchanges by ε (|ε| < 0.01), whether\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1331_10958572","code_snippet":"#include <cstdio>\n#include <set>\n#include <cmath>\nusing namespace std;\nstruct Point\n{\n double x;\n double y;\n double z;\n void read()\n {\n scanf(\"%lf %lf %lf\",&x,&y,&z);\n }\n Point(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\n Point operator +(const Point &ano)\n {\n return Point(x+ano.x,y+ano.y,z+ano.z);\n }\n Point operator -(const Point &ano)\n {\n return Point(x-ano.x,y-ano.y,z-ano.z);\n }\n Point operator *(double p)\n {\n return Point(x*p,y*p,z*p);\n }\n Point operator /(double p)\n {\n return Point(x/p,y/p,z/p);\n }\n void print()\n {\n printf(\"%f %f %f\\n\",x,y,z);\n }\n}E;\nstruct S\n{\n double x;\n double y;\n double z;\n double r;\n void read()\n {\n scanf(\"%lf %lf %lf %lf\",&x,&y,&z,&r);\n }\n Point get()\n {\n return Point(x,y,z);\n }\n}s[2100];\ntypedef Point Vector;\nstruct T\n{\n double x;\n double y;\n double z;\n double b;\n void read()\n {\n scanf(\"%lf %lf %lf %lf\",&x,&y,&z,&b);\n }\n Point get()\n {\n return Point(x,y,z);\n }\n}t[20];\nVector Cross(Vector a,Vector b)\n{\n return Vector(a.y*b.z - a.z*b.y,a.z*b.x -a.x * b.z,a.x*b.y-a.y*b.x);\n}\nconst double eps=1e-3;\ndouble Dot(Vector a,Vector b)\n{\n return a.x*b.x + a.y*b.y +a.z *b.z;\n}\ndouble Length(Vector a)\n{\n return sqrt(Dot(a,a));\n}\ndouble distanceToLine(Point p,Point a,Point b)\n{\n Vector v1=b-a;\n Vector v2=p-a;\n return Length(Cross(v1,v2))/Length(v1);\n}\nint dcmp(double p)\n{\n if(fabs(p)<eps)\n return 0;\n return p<0?-1:1;\n}\nbool Intersect(Point a,Point b,S s)\n{\n int a1=dcmp(Length(a-s.get())-s.r);\n int a2=dcmp(Length(b-s.get())-s.r);\n if(a1 * a2<0)\n return true;\n if(a1<=0 && a2<=0)\n return false;\n double dis = distanceToLine(s.get(),a,b);\n if(dcmp(dis-s.r)>=0)\n return false;\n double d1=Length(b-s.get());\n double d2=Length(a-s.get());\n double x1=d1*d1-dis*dis;\n double x2=d2*d2-dis*dis;\n x1=sqrt(x1);\n x2=sqrt(x2);\n if(dcmp(x1+x2-Length(b-a))==0)\n return true;\n if(dcmp(fabs(x1-x2)-Length(b-a))==0)\n return false;\n 1/0;\n}\nset<int> p[3000];\nint main()\n{\n int n,m,r;\n while(~scanf(\"%d %d %d\",&n,&m,&r))\n {\n if(n+m+r==0)\n break;\n for(int i=0;i<n;i++)\n p[i].clear();\n for(int i=0;i<n;i++)\n s[i].read();\n for(int i=0;i<m;i++)\n t[i].read();\n E.read();\n for(int i=0;i<n;i++)\n for(int j=0;j<m;j++)\n {\n if(Intersect(t[j].get(),E,s[i]))\n p[i].insert(j);\n }\n double ans=0;\n for(int i=0;i<(1<<m);i++)\n {\n double sum=0;\n for(int j=0;j<m;j++)\n if(i&(1<<j))\n sum+=t[j].b/(Dot(t[j].get()-E,t[j].get()-E));\n if(sum<ans)\n continue;\n int t=0;\n for(int k=0;k<n;k++)\n for(int j=0;j<m;j++)\n {\n if(i&(1<<j) && p[k].count(j))\n {\n t++;\n break;\n }\n }\n if(t>r)\n continue;\n if(sum>ans)\n ans=sum;\n }\n printf(\"%lf\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":3612,"score_of_the_acc":-0.8814,"final_rank":10},{"submission_id":"aoj_1331_10853177","code_snippet":"#include<cstdio>\n#include<cmath>\n#include<vector>\nusing namespace std;\nconst double eps = 1e-9;\nstruct point\n{\n double x,y,z;\n //不吃參數的建構子跟吃參數的建構子QQ\n point():x(0),y(0),z(0){}\n point(double _x,double _y,double _z):x(_x),y(_y),z(_z){}\n\n point operator+(const point &p) const{ return point(x+p.x, y+p.y, z+p.z);}\n point operator-(const point &p) const{ return point(x-p.x, y-p.y, z-p.z);}\n point operator*(const double &d) const{ return point(x*d, y*d, z*d);}\n point operator/(const double &d) const{ return point(x/d, y/d, z/d);}\n};\nstruct sphere\n{\n point p;\n double r;\n sphere(point _p,double _r):p(_p),r(_r){}\n};\nstruct line\n{\n point a,b;\n line(point _a,point _b):a(_a),b(_b){}\n};\n\nint n,m,r;\npoint obj;//objective point ;\nvector <sphere> bal;\nvector <point> light;\ndouble bright[16]; //brightness\nvector <int> rmv[16]; //rmv these balloons to get the light\n\npoint start(0.0,0.0,0.0);\ndouble length2(point a,point b)\n{\n double ans=(a.x-b.x)*(a.x-b.x);\n ans+=(a.y-b.y)*(a.y-b.y);\n ans+=(a.z-b.z)*(a.z-b.z);\n return ans;\n}\n/*\ninline double norm(const point &a){ return a.x*a.x+a.y*a.y+a.z*a.z;}\ninline double abs(const point &a){ return sqrt(norm(a));}\ninline double dot(const point &a, const point &b){ return a.x*b.x+a.y*b.y+a.z*b.z;}\npoint proj(const line &l, const point &p){\n double t = dot(p-l.a, l.a-l.b) / norm(l.a-l.b);\n return l.a+(l.a-l.b)*t;\n}\nbool corss(const line &l, const sphere &s){\n point a = l.a-s.p, b = l.b-s.p, c = proj(l,s.p)-s.p;\n if(abs(a) < s.r-eps and abs(b) < s.r-eps and abs(c) < s.r-eps)\n\t{\n\t\treturn 0; // contain\n\t}\n if(abs(c) > s.r+eps) return 0; // far\n if(abs(a) < s.r-eps or abs(b) < s.r-eps) return 1; // intersect\n if(abs(a-c)+abs(b-c)<abs(a-b)+eps) return 1; // intersect\n return 0;\n}\n*/\n//12312312313\ndouble abs(point a)\n{\n\treturn sqrt(length2(a,start));\n}\n\nbool corss(line ln,sphere sph)\n{\n\tpoint a=ln.a;\n\tpoint b=ln.b;\n\tbool flag1=0,flag2=0;\n\tif(sqrt(length2(a,sph.p))<sph.r-eps) flag1=1;\n\tif(sqrt(length2(b,sph.p))<sph.r-eps) flag2=1;\n\tif(flag1&&flag2)\n\t{\n\t\treturn 0;\n\t\t//printf(\"A\");\n\t}\n\telse if(flag1||flag2) return 1;\n\t//now to consider two point are outside of the sphere\n\t// ( ap X ab ) / length(ab) = lenth(line,sphere)\n\tpoint ap(sph.p.x-a.x,sph.p.y-a.y,sph.p.z-a.z);\n\tpoint ab(b.x-a.x,b.y-a.y,b.z-a.z);\n\tpoint ba(a.x-b.x,a.y-b.y,a.z-b.z);\n\tpoint tmp(ap.y*ab.z-ap.z*ab.y,ap.z*ab.x-ap.x*ab.z,ap.x*ab.y-ap.y*ab.x);\n\t\n\tdouble len1=sqrt(tmp.x*tmp.x+tmp.y*tmp.y+tmp.z*tmp.z);\n\tdouble len2=sqrt(length2(a,b));\n\tif((len1/len2)>(sph.r-eps)) return 0;\n\telse\n\t{\n\t\tpoint bp(sph.p.x-b.x,sph.p.y-b.y,sph.p.z-b.z);\n\t\t// ap． bp <0 return 1;\n\t\t//there're still some details to consider\n\t\t//printf(\"%lf\\n\",(ap.x*bp.x)+(ap.y*bp.y)+(ap.z*bp.z));\n\t\tif((ap.x*bp.x)+(ap.y*bp.y)+(ap.z*bp.z)<0.0) return 1;\n\t\tif((ab.x*ap.x)+(ab.y*ap.y)+(ab.z*ap.z)<0.0) return 0;\n\t\tif((ba.x*bp.x)+(ba.y*bp.y)+(ba.z*bp.z)<0.0) return 0;\n\t\treturn 1; \n\t}\n}\n//1231321313223\nvoid solve()\n{\n int i,j,k;\n for(i=0;i<m;i++) rmv[i].clear();\n for(i=0;i<m;i++)\n {\n for(j=0;j<n;j++)\n {\n if(corss(line(light[i],obj),bal[j]))\n\t\t\t{\n\t\t\t\trmv[i].push_back(j);\n\t\t\t}\n }\n }\n double ans=0.0;\n for(k=0;k<(1<<m);k++)\n {\n bool rmvv[2048]={}; //balloons<2000\n int cnt=0;\n double sum=0.0;\n for(i=0;i<m;i++)\n {\n if((k>>i)&1)\n {\n for(j=0;j<rmv[i].size();j++)\n {\n if(!rmvv[rmv[i][j]]) //rmb[i][j] is the index of the balloon\n {//if this balloon is not removed yet\n rmvv[rmv[i][j]]=1;\n cnt++;\n }\n }\n sum+=bright[i]/length2(light[i],obj);\n }\n }\n\t\t\n if(cnt<=r) ans=max(ans,sum);\n }\n printf(\"%lf\\n\",ans);\n}\n\nbool input()\n{\n scanf(\"%d %d %d\",&n,&m,&r);\n if(n+m+r==0) return 0;\n\n int x,y,z,r;\n bal.clear();\n light.clear();\n for(int i=0;i<n;i++)\n {//eat the ballons\n scanf(\"%d %d %d %d\",&x,&y,&z,&r);\n bal.push_back(sphere(point(x,y,z),r));\n }\n for(int i=0;i<m;i++)\n {//eat the light sources\n scanf(\"%d %d %d %d\",&x,&y,&z,&r);\n light.push_back(point(x,y,z));\n bright[i]=r;\n }\n //eat the objective point\n scanf(\"%d %d %d\",&x,&y,&z);\n obj=point(x,y,z);\n\n return 1;\n}\n\nint main()\n{\n while(input()) solve();\n return 0;\n}","accuracy":1,"time_ms":1470,"memory_kb":3080,"score_of_the_acc":-0.1711,"final_rank":1},{"submission_id":"aoj_1331_10684649","code_snippet":"#include<bits/stdc++.h>\n#define pb push_back\n#define db double\nusing namespace std;\ndb sqr(db x){return x*x;}\nstruct B{\n\tdb x, y, z, r;\n};\nstruct L{\n\tdb x, y, z, b;\n\tdb val;\n};\nstruct P{\n\tdb x, y, z;\n\tP(db x, db y, db z):x(x), y(y), z(z){}\n\tP(B &bl):x(bl.x), y(bl.y), z(bl.z){}\n\tP(L &ls):x(ls.x), y(ls.y), z(ls.z){}\n\tP(){}\n\tdb dis(P &p){return sqr(p.x-x)+sqr(p.y-y)+sqr(p.z-z);}\n};\nstruct V{\n\tdb x, y, z;\n\tV(){}\n\tV(P &p1, P &p2):x(p2.x-p1.x), y(p2.y-p1.y), z(p2.z-p1.z){}\n\tV(V &a, V &b):x(a.y*b.z-a.z*b.y), y(a.x*b.z-a.z*b.x), z(a.x*b.y-a.y*b.x){}\n\tdb dot(V &v){return x*v.x+y*v.y+z*v.z;}\n\tdb mod(){return x*x+y*y+z*z;}\n};\ndb dis(P &p, P &p1, P &p2){\n\tV v1(p1, p), v2(p1, p2), v3(p2, p), v4(p2, p1), v5(v2, v1);\n\tif(v1.dot(v2)<0) return p.dis(p1);\n\tif(v3.dot(v4)<0) return p.dis(p2);\n\treturn (db)v5.mod()/(db)v2.mod();\n}\nconst int MAX_N=2e3+50, MAX_M=1000;\nbool vis[MAX_N];\nbool block[MAX_M][MAX_N];\nB bl[MAX_N];\nL ls[MAX_M];\nint N, M, R;\nP obj;\nbool is_block(int i, int j){\n\tP a(ls[i]), b(bl[j]);\n\tif(b.dis(a)<sqr(bl[j].r)&&b.dis(obj)<sqr(bl[j].r)) return false;\n\treturn dis(b, a, obj)<(db)sqr(bl[j].r);\n}\nbool ok(int x){\n\tint cnt=0;\n\tmemset(vis, 0, sizeof(vis));\n\tfor(int i=0; i<M; i++){\n\t\tif(!(x&1<<i)) continue;\n\t\tfor(int j=0; j<N; j++)\n\t\t\tif(block[i][j]&&!vis[j]) vis[j]=true, cnt++;\n\t\tif(cnt>R) return false;\n\t}\n\treturn true;\n}\ndb calc(int x){\n\tdb ans=0;\n\tfor(int i=0; i<M; i++){\n\t\tif(!(x&1<<i)) continue;\n\t\tans+=ls[i].val;\n\t}\n\treturn ans;\n}\nvoid solve(){\n\tdouble ans=0;\n\tfor(int i=0; i<(1<<M); i++){\n\t\tif(ok(i)) ans=max(ans, calc(i));\n\t}\n\tprintf(\"%.9f\\n\", ans);\n}\nint main(){\n\t//freopen(\"in\", \"r\", stdin);\n\twhile(~scanf(\"%d%d%d\", &N, &M, &R)){\n\t\tif(N||M||R){\n\t\t\tfor(int i=0; i<N; i++)\n\t\t\t\tscanf(\"%lf%lf%lf%lf\", &bl[i].x, &bl[i].y, &bl[i].z, &bl[i].r);\n\t\t\tfor(int i=0; i<M; i++){\n\t\t\t\tscanf(\"%lf%lf%lf%lf\", &ls[i].x, &ls[i].y, &ls[i].z, &ls[i].b);\n\t\t\t}\n\t\t\tscanf(\"%lf%lf%lf\", &obj.x, &obj.y, &obj.z);\n\t\t\tfor(int i=0; i<N; i++){\n\t\t\t\tP p(ls[i]);\n\t\t\t\tls[i].val=(db)ls[i].b/(db)obj.dis(p);\n\t\t\t}\n\t\t\tfor(int i=0; i<M; i++)\n\t\t\t\tfor(int j=0; j<N; j++)\n\t\t\t\t\tblock[i][j]=is_block(i, j);\n\t\t\tsolve();\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6490,"memory_kb":3664,"score_of_the_acc":-1.8052,"final_rank":19},{"submission_id":"aoj_1331_10684636","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#include <set>\n#define eps 1.0e-9\nusing namespace std;\nint n,m;\ndouble r[2333],w[20];\nbool vis[555],g[20][555];\nstruct point\n{\n double x,y,z;\n}p[2333],q[20],e;\ndouble sgn(double f)\n{\n if(fabs(f)<eps) return 0;\n else return f<0?-1:1;\n}\ndouble dis(point a,point b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z);}\nint check(point p,point c,double r)\n{\n int d=dis(p,c);\n if(d<r*r) return -1;\n else if(d==r*r) return 0;\n else return 1;\n}\nbool cal(double a,double b,double c)\n{\n double delt=b*b-4*a*c;\n if(delt<=0) return false;\n else\n {\n delt=sqrt(delt);\n double x1=(-b+delt)/(2*a),x2=(-b-delt)/(2*a);\n if((sgn(x1)>0&&sgn(x1-1)<0)||(sgn(x2)>0&&sgn(x2-1)<0)) return true;\n else return false;\n }\n}\nvoid init()\n{\n memset(g,0,sizeof(g));\n for(int i=0;i<m;i++)\n {\n if(e.x==q[i].x&&e.y==q[i].y&&e.z==q[i].z) continue;\n for(int j=0;j<n;j++)\n {\n int a=check(e,p[j],r[j]),b=check(q[i],p[j],r[j]);\n //if(a==0||b==0) continue;\n double ka,kb,kc;\n ka=dis(e,q[i]);\n kb=2*((e.x-p[j].x)*(q[i].x-e.x)+(e.y-p[j].y)*(q[i].y-e.y)+(e.z-p[j].z)*(q[i].z-e.z));\n kc=dis(e,p[j])-r[j]*r[j];\n if(cal(ka,kb,kc)) g[i][j]=1;\n }\n }\n}\nint main()\n{\n int N;\n while(scanf(\"%d%d%d\",&n,&m,&N)==3)\n {\n if(n==0&&m==0&&N==0) break;\n for(int i=0;i<n;i++) scanf(\"%lf%lf%lf%lf\",&p[i].x,&p[i].y,&p[i].z,&r[i]);\n for(int i=0;i<m;i++) scanf(\"%lf%lf%lf%lf\",&q[i].x,&q[i].y,&q[i].z,&w[i]);\n scanf(\"%lf%lf%lf\",&e.x,&e.y,&e.z);\n init();\n int M=1<<m;\n double ans=0,tb[20];\n for(int i=0;i<m;i++) tb[i]=w[i]/dis(e,q[i]);\n for(int i=1;i<M;i++)\n {\n memset(vis,0,sizeof(vis));\n int cnt=0;\n bool ok=true;\n double tp=0;\n for(int j=0;j<m;j++)\n {\n if((i&(1<<j))==0) continue;\n for(int k=0;k<n;k++)\n {\n if(vis[k]) continue;\n if(g[j][k])\n {\n vis[k]=true;\n cnt++;\n if(cnt>N)\n {\n ok=false;\n break;\n }\n }\n }\n if(!ok) break;\n tp+=tb[j];\n }\n if(ok) ans=max(ans,tp);\n }\n printf(\"%.10f\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":5360,"memory_kb":3404,"score_of_the_acc":-1.234,"final_rank":18},{"submission_id":"aoj_1331_10036546","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntemplate <typename T>\nstruct vec {\n\tT x, y, z;\n\tvec(const T &x, const T &y, const T &z) : x(x), y(y), z(z) {}\n\tvec() : x(0), y(0), z(0) {}\n\tvec operator-(const vec &rhs) const {\n\t\treturn {x - rhs.x, y - rhs.y, z - rhs.z};\n\t}\n\tvec<ld> operator/(const ld &rhs) const {\n\t\treturn {x / rhs, y / rhs, z / rhs};\n\t}\n\tvec operator*(const ld &rhs) const {\n\t\treturn {x * rhs, y * rhs, z * rhs};\n\t}\n\tvec<ld> unit() const { return (*this) / (*this).norm(); }\n\tT norm2() const { return x * x + y * y + z * z; }\n\tld norm() const { return sqrtl((*this).norm2()); }\n\tT dot(const vec &rhs) const { return x * rhs.x + y * rhs.y + z * rhs.z; }\n\t// vec cross(vec rhs) const { return {y * rhs.z - z * rhs.y, z * rhs.x - x * rhs.z, x * rhs.y - y * rhs.x}; }\n};\nstruct sph {\n\tvec<int> p;\n\tint r;\n};\nbool isBlock(const vec<int> &from, const vec<int> &to, const sph &s) {\n\tauto isIn = [&](const vec<int> &p) {\n\t\treturn (s.p - p).norm2() <= s.r * s.r;\n\t};\n\tif (isIn(from) && isIn(to)) return false;\n\tif (isIn(from) ^ isIn(to)) return true;\n\tvec<int> dif = to - from;\n\tvec<int> v = s.p - from;\n\tif (dif.dot(v) < 0 || (from - to).dot(s.p - to) < 0) return false;\n\tauto convd = [&](const vec<int> &v) {\n\t\treturn vec<ld>(v.x, v.y, v.z);\n\t};\n\tvec<ld> uni = dif.unit();\n\tvec<ld> shaw = uni * (uni.dot(convd(v)));\n\tif ((convd(v) - shaw).norm2() <= s.r * s.r) {\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\nint main() {\n\twhile (1) {\n\t\tint n, m, r;\n\t\tscanf(\"%d%d%d\", &n, &m, &r);\n\t\tif (n == 0 && m == 0 && r == 0) break;\n\t\t// printf(\"%d %d %d\\n\", n, m, r);\n\t\tvector<sph> s(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tscanf(\"%d %d %d %d\", &s[i].p.x, &s[i].p.y, &s[i].p.z, &s[i].r);\n\t\t}\n\t\tvector<vec<int>> lightp(m);\n\t\tvector<int> bright(m);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tscanf(\"%d %d %d %d\", &lightp[i].x, &lightp[i].y, &lightp[i].z, &bright[i]);\n\t\t}\n\t\tvec<int> pto;\n\t\tscanf(\"%d %d %d\", &pto.x, &pto.y, &pto.z);\n\t\t// cerr << \"ok\" << endl;\n\t\tld ans = 0;\n\t\tconst int M = 2010;\n\t\tvector<bitset<M>> isBlkb(m);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tif (isBlock(lightp[i], pto, s[j])) {\n\t\t\t\t\tisBlkb[i].set(j, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int bit = 0; bit < (1 << m); bit++) {\n\t\t\tbitset<M> dels;\n\t\t\tint cnt = 0;\n\t\t\tld tot = 0;\n\t\t\tfor (int i = 0; i < m; i++) {\n\t\t\t\tif ((bit >> i) & 1) {\n\t\t\t\t\ttot += (ld)bright[i] / (lightp[i] - pto).norm2();\n\t\t\t\t\tdels |= isBlkb[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (dels.count() > r) continue;\n\t\t\t// cerr << \"bit: \" << bit << endl;\n\t\t\t// cerr << \"tot: \" << tot << endl;\n\t\t\tans = max(ans, tot);\n\t\t}\n\t\tprintf(\"%.10Lf\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":270,"memory_kb":3292,"score_of_the_acc":-0.3369,"final_rank":3},{"submission_id":"aoj_1331_9947504","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nbool solve(){\n\tint N, M, R;\n\tcin >> N >> M >> R;\n\n\tif(N == 0 && M == 0 && R == 0) return false;\n\n\tvector<tuple<ll, ll, ll, ll>> S(N), T(M);\n\tfor(auto&[x, y, z, r] : S) cin >> x >> y >> z >> r;\n\tfor(auto&[x, y, z, r] : T) cin >> x >> y >> z >> r;\n\tll X, Y, Z; cin >> X >> Y >> Z;\n\n\tfor(auto&[x, y, z, r] : S) x -= X, y -= Y, z -= Z;\n\tfor(auto&[x, y, z, r] : T) x -= X, y -= Y, z -= Z;\n\n\tauto judge = [&](int bl, int li){\n\t\tauto[xb, yb, zb, rb] = S[bl];\n\t\tauto[xl, yl, zl, rl] = T[li];\n\n\t\tbool both_outside = false;\n\t\t//両方内側\n\t\t{\n\t\t\tll dist1 = (xb-xl)*(xb-xl) + (yb-yl)*(yb-yl) + (zb-zl)*(zb-zl);\n\t\t\tll dist2 = xb*xb + yb*yb + zb*zb;\n\t\t\tif(dist1 <= rb*rb && dist2 <= rb*rb) return true;\n\t\t\tif(dist1 >= rb*rb && dist2 >= rb*rb) both_outside = true;\n\t\t}\n\n\t\t//内外が違う\n\t\tif(!both_outside) return false;\n\n\t\t//B:ライト, A:風船\n\t\tll A = xb*xb + yb*yb + zb*zb;\n\t\tll B = xl*xl + yl*yl + zl*zl;\n\t\tll dot = xb*xl + yb*yl + zb*zl;\n\t\tll r = rb*rb;\n\t\t//風船がライトとの直線に干渉しない\n\t\tif(r*B <= A*B-dot*dot) return true;\n\n\t\t//ライトと風船が反対側\n\t\tif(dot<0) return true;\n\n\t\treturn B<=A;\n\t};\n\n\tvector<vector<int>> rem(M);\n\tfor(int i = 0; i < M; i++){\n\t\tfor(int j = 0; j < N; j++){\n\t\t\tif(!judge(j, i)) rem[i].push_back(j);\n\t\t}\n\t}\n\n\t/*for(int i = 0; i < M; i++){\n\t\tcout << \"rem\" << i+1 << ' ';\n\t\tfor(int j : rem[i]) cout << j+1 << ' ';\n\t\tcout << endl;\n\t}*/\n\n\tdouble ans = 0;\n\tfor(int bt = 0; bt < 1<<M; bt++){\n\t\tvector<bool> removed(N, false);\n\t\tdouble res = 0;\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tif(bt >> i & 1){\n\t\t\t\tfor(int j : rem[i]) removed[j] = true;\n\t\t\t\tauto[xl, yl, zl, rl] = T[i];\n\t\t\t\tdouble val = 1.0*rl / (xl*xl + yl*yl + zl*zl);\n\t\t\t\tres += val;\n\t\t\t}\n\t\t}\n\t\tint cnt = 0;\n\t\tfor(int i = 0; i < N; i++) if(removed[i]) cnt++;\n\t\t//cout << \"cnt:\" << cnt << endl;\n\t\tif(cnt <= R) ans = max(ans, res);\n\t}\n\n\tprintf(\"%.10lf\\n\", ans);\n\treturn true;\n}\n\nint main(){\n\twhile(solve());\n}","accuracy":1,"time_ms":1450,"memory_kb":3536,"score_of_the_acc":-0.8898,"final_rank":11},{"submission_id":"aoj_1331_9711061","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct Balloon {\n ll X, Y, Z, R;\n Balloon(ll x, ll y, ll z, ll r) : X(x), Y(y), Z(z), R(r) {};\n};\n\nstruct Light {\n ll X, Y, Z, B;\n Light(ll x, ll y, ll z, ll b) : X(x), Y(y), Z(z), B(b) {};\n};\n\nbool isin(Balloon S, ll X, ll Y, ll Z) {\n return ((X-S.X)*(X-S.X)+(Y-S.Y)*(Y-S.Y)+(Z-S.Z)*(Z-S.Z) < S.R*S.R);\n}\n\nll Dot(ll X1, ll Y1, ll Z1, ll X2, ll Y2, ll Z2) {\n return X1*X2+Y1*Y2+Z1*Z2;\n}\n\nint isCross(Balloon S, Light T) {\n if (isin(S,T.X,T.Y,T.Z) && isin(S,0,0,0)) return false;\n if (isin(S,T.X,T.Y,T.Z) && !isin(S,0,0,0)) return true;\n if (!isin(S,T.X,T.Y,T.Z) && isin(S,0,0,0)) return true;\n if (Dot(S.X,S.Y,S.Z,T.X,T.Y,T.Z) <= 0) return false;\n if (Dot(S.X-T.X,S.Y-T.Y,S.Z-T.Z,-T.X,-T.Y,-T.Z) <= 0) return false;\n return (S.Y*T.Z-S.Z*T.Y)*(S.Y*T.Z-S.Z*T.Y)+\n (S.Z*T.X-S.X*T.Z)*(S.Z*T.X-S.X*T.Z)+\n (S.X*T.Y-S.Y*T.X)*(S.X*T.Y-S.Y*T.X) <= S.R * S.R * (T.X*T.X+T.Y*T.Y+T.Z*T.Z);\n}\n\nint main() {\n while(1) {\n int N, M, K;\n cin >> N >> M >> K;\n if (N == 0) return 0;\n vector<Balloon> S;\n vector<Light> T;\n rep(i,0,N) {\n ll x, y, z, r;\n cin >> x >> y >> z >> r;\n S.push_back(Balloon(x,y,z,r));\n }\n rep(i,0,M) {\n ll x, y, z, b;\n cin >> x >> y >> z >> b;\n T.push_back(Light(x,y,z,b));\n }\n ll EX, EY, EZ;\n cin >> EX >> EY >> EZ;\n rep(i,0,N) S[i].X -= EX, S[i].Y -= EY, S[i].Z -= EZ;\n rep(i,0,M) T[i].X -= EX, T[i].Y -= EY, T[i].Z -= EZ;\n vector<bitset<2000>> C(M);\n rep(i,0,N) {\n rep(j,0,M) {\n if(isCross(S[i],T[j])) C[j].set(i,1);\n }\n }\n double ANS = 0.0;\n rep(i,0,1<<M) {\n double SUM = 0.0;\n bitset<2000> B;\n rep(j,0,M) {\n if (i&(1<<j)) {\n SUM += (double)T[j].B / (double)(T[j].X*T[j].X+T[j].Y*T[j].Y+T[j].Z*T[j].Z);\n B |= C[j];\n }\n }\n if (B.count() <= K) chmax(ANS,SUM);\n }\n printf(\"%.12f\\n\",ANS);\n}\n}","accuracy":1,"time_ms":260,"memory_kb":3608,"score_of_the_acc":-0.8354,"final_rank":8},{"submission_id":"aoj_1331_8998178","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\n\n#define EPS (1e-7)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nclass Point3d {\n public:\n double x, y, z;\n\n Point3d(double x = 0, double y = 0, double z = 0) : x(x), y(y), z(z) {}\n\n Point3d operator+(const Point3d& a) {\n return Point3d(x + a.x, y + a.y, z + a.z);\n }\n Point3d operator-(const Point3d& a) {\n return Point3d(x - a.x, y - a.y, z - a.z);\n }\n Point3d operator*(const double& d) {\n return Point3d(x * d, y * d, z * d);\n }\n Point3d operator/(const double& d) {\n return Point3d(x / d, y / d, z / d);\n }\n\n bool operator<(const Point3d& p) const {\n if (!equals(x, p.x)) return x < p.x;\n if (!equals(y, p.y)) return y < p.y;\n if (!equals(z, p.z)) return z < p.z;\n return false;\n }\n\n bool operator==(const Point3d& p) const {\n return equals(x, p.x) && equals(y, p.y) && equals(z, p.z);\n }\n};\n\nstruct Segment3d {\n Point3d p[2];\n Segment3d(Point3d p1 = Point3d(), Point3d p2 = Point3d()) {\n p[0] = p1, p[1] = p2;\n }\n bool operator==(const Segment3d& seg) const {\n return (p[0] == seg.p[0] && p[1] == seg.p[1]) || (p[0] == seg.p[1] && p[1] == seg.p[0]);\n }\n};\n\nusing Line3d = Segment3d;\nusing Vector3d = Point3d;\n\nostream& operator<<(ostream& os, const Point3d& p) {\n return os << \"(\" << p.x << \",\" << p.y << \",\" << p.z << \")\";\n}\n\nostream& operator<<(ostream& os, const Segment3d& seg) {\n return os << \"(\" << seg.p[0] << \",\" << seg.p[1] << \")\";\n}\n\ndouble dot(const Point3d& a, const Point3d& b) {\n return a.x * b.x + a.y * b.y + a.z * b.z;\n}\n\nVector3d cross(const Point3d& a, const Point3d& b) {\n return Vector3d(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);\n}\n\ninline double norm(const Point3d& p) {\n return p.x * p.x + p.y * p.y + p.z * p.z;\n}\n\ninline double abs(const Point3d& p) {\n return sqrt(norm(p));\n}\n\ninline double toRad(double theta) {\n return theta * M_PI / 180.0;\n}\n\ndouble distanceLP(Line3d line, Point3d p) {\n return abs(cross(line.p[1] - line.p[0], p - line.p[0])) / abs(line.p[1] - line.p[0]);\n}\n\nPoint3d project(Segment3d seg, Point3d p) {\n Vector3d base = seg.p[1] - seg.p[0];\n double t = dot(p - seg.p[0], base) / norm(base);\n return seg.p[0] + base * t;\n}\n\nPoint3d reflect(Segment3d seg, Point3d p) {\n return p + (project(seg, p) - p) * 2.0;\n}\n\nbool on_line3d(Line3d line, Point3d p) {\n return equals(abs(cross(line.p[1] - p, line.p[0] - p)), 0);\n}\n\nbool on_segment3d(Segment3d seg, Point3d p) {\n if (!on_line3d(seg, p)) return false;\n double dist[3] = {abs(seg.p[1] - seg.p[0]), abs(p - seg.p[0]), abs(p - seg.p[1])};\n return on_line3d(seg, p) && equals(dist[0], dist[1] + dist[2]);\n}\n\ndouble distanceSP(Segment3d seg, Point3d p) {\n Point3d r = project(seg, p);\n if (on_segment3d(seg, r)) return abs(p - r);\n return min(abs(seg.p[0] - p), abs(seg.p[1] - p));\n}\n\ndouble solve(int N, int M, int R) {\n vector<Point3d> Sp(N);\n vector<double> Sr(N);\n for(int i : rep(N)) Sp[i].x = in(), Sp[i].y = in(), Sp[i].z = in(), Sr[i] = in();\n vector<Point3d> Tp(M);\n vector<double> Tb(M);\n for(int i : rep(M)) Tp[i].x = in(), Tp[i].y = in(), Tp[i].z = in(), Tb[i] = in();\n Point3d E;\n E.x = in(), E.y = in(), E.z = in();\n\n const int MAX_N = 2000;\n vector<bitset<MAX_N>> erase(M);\n for(int i : rep(M)) {\n for(int j : rep(N)) {\n bool touch = [&] {\n if(abs(E - Sp[j]) <= Sr[j] and abs(Tp[i] - Sp[j]) <= Sr[j]) return false;\n return distanceSP(Segment3d(E, Tp[i]), Sp[j]) <= Sr[j];\n }();\n\n erase[i][j] = touch;\n }\n }\n\n double ans = 0;\n for(int set : rep(1 << M)) {\n bitset<MAX_N> need;\n double score = 0;\n for(int i : rep(M)) if(set & (1 << i)) {\n need |= erase[i];\n score += Tb[i] / norm(Tp[i] - E);\n }\n if(need.count() <= R) chmax(ans, score);\n }\n return ans;\n}\n\nint main() {\n while(true) {\n int N = in(), M = in(), R = in();\n if(make_tuple(N, M, R) == make_tuple(0, 0, 0)) return 0;\n printer::precision(20);\n print(solve(N, M, R));\n }\n}","accuracy":1,"time_ms":270,"memory_kb":3588,"score_of_the_acc":-0.8052,"final_rank":6},{"submission_id":"aoj_1331_8492718","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nstruct P {\n double x, y, z;\n P() {}\n P(double x, double y, double z) : x(x), y(y), z(z) {}\n};\n\nP operator+(P p, P q) {\n return P(p.x + q.x, p.y + q.y, p.z + q.z);\n}\n\nP operator-(P p, P q) {\n return P(p.x - q.x, p.y - q.y, p.z - q.z);\n}\n\ndouble p2(double x) {\n return x * x;\n}\n\ndouble dist(P p, P q) {\n return p2(p.x - q.x) + p2(p.y - q.y) + p2(p.z - q.z);\n}\n\ndouble dot(P p, P q) {\n return p.x * q.x + p.y * q.y + p.z * q.z;\n}\n\nP proj(P a, P b, P p) {\n P dap = p - a, dab = b - a;\n double t = dot(dap, dab) / dist(dab, P(0, 0, 0));\n return a + P(dab.x * t, dab.y * t, dab.z * t);\n}\n\ndouble dist(P a, P b, P p) {\n P h = proj(a, b, p);\n if (dot(h - a, b - a) < 0)\n return dist(a, p);\n if (dot(h - b, a - b) < 0)\n return dist(b, p);\n return dist(h, p);\n}\n\nint main() {\n while (1) {\n int n, m, r;\n cin >> n >> m >> r;\n if (!n)\n break;\n vector<int> xs(n), ys(n), zs(n), rs(n);\n rep(i, n) cin >> xs[i] >> ys[i] >> zs[i] >> rs[i];\n vector<P> ps(n);\n rep(i, n) ps[i] = P(xs[i], ys[i], zs[i]);\n vector<int> xt(m), yt(m), zt(m), bt(m);\n rep(i, m) cin >> xt[i] >> yt[i] >> zt[i] >> bt[i];\n vector<P> pt(m);\n rep(i, m) pt[i] = P(xt[i], yt[i], zt[i]);\n int x0, y0, z0;\n cin >> x0 >> y0 >> z0;\n P p0(x0, y0, z0);\n vector<vector<bool>> inter(n, vector<bool>(m));\n rep(i, n) rep(j, m) {\n double d0 = dist(p0, ps[i]), dj = dist(pt[j], ps[i]);\n if (max(d0, dj) < p2(rs[i]))\n inter[i][j] = false;\n else inter[i][j] = (dist(p0, pt[j], ps[i]) < p2(rs[i]));\n }\n vector<int> ng(n, 0);\n rep(i, n) rep(j, m) if (inter[i][j]) ng[i] |= 1 << j;\n double ans = 0;\n rep(t, 1 << m) {\n int cnt = 0;\n rep(i, n) if (ng[i] & t) cnt++;\n if (cnt > r)\n continue;\n double val = 0;\n rep(i, m) if (t >> i & 1) val += bt[i] / dist(p0, pt[i]);\n chmax(ans, val);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":260,"memory_kb":3632,"score_of_the_acc":-0.8734,"final_rank":9},{"submission_id":"aoj_1331_8492601","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nstruct P {\n double x, y, z;\n P() {}\n P(double x, double y, double z) : x(x), y(y), z(z) {}\n};\n\nP operator+(P p, P q) {\n return P(p.x + q.x, p.y + q.y, p.z + q.z);\n}\n\nP operator-(P p, P q) {\n return P(p.x - q.x, p.y - q.y, p.z - q.z);\n}\n\ndouble p2(double x) {\n return x * x;\n}\n\ndouble dist(P p, P q) {\n return p2(p.x - q.x) + p2(p.y - q.y) + p2(p.z - q.z);\n}\n\ndouble dot(P p, P q) {\n return p.x * q.x + p.y * q.y + p.z * q.z;\n}\n\nP proj(P a, P b, P p) {\n P dap = p - a, dab = b - a;\n double t = dot(dap, dab) / dist(dab, P(0, 0, 0));\n return a + P(dab.x * t, dab.y * t, dab.z * t);\n}\n\ndouble dist(P a, P b, P p) {\n P h = proj(a, b, p);\n if (dot(h - a, b - a) < 0)\n return dist(a, p);\n if (dot(h - b, a - b) < 0)\n return dist(b, p);\n return dist(h, p);\n}\n\nint main() {\n while (1) {\n int n, m, r;\n cin >> n >> m >> r;\n if (!n)\n break;\n vector<int> xs(n), ys(n), zs(n), rs(n);\n rep(i, n) cin >> xs[i] >> ys[i] >> zs[i] >> rs[i];\n vector<P> ps(n);\n rep(i, n) ps[i] = P(xs[i], ys[i], zs[i]);\n vector<int> xt(m), yt(m), zt(m), bt(m);\n rep(i, m) cin >> xt[i] >> yt[i] >> zt[i] >> bt[i];\n vector<P> pt(m);\n rep(i, m) pt[i] = P(xt[i], yt[i], zt[i]);\n int x0, y0, z0;\n cin >> x0 >> y0 >> z0;\n P p0(x0, y0, z0);\n vector<vector<bool>> inter(n, vector<bool>(m));\n rep(i, n) rep(j, m) {\n double d0 = dist(p0, ps[i]), dj = dist(pt[j], ps[i]);\n if (max(d0, dj) < p2(rs[i]))\n inter[i][j] = false;\n else inter[i][j] = (dist(p0, pt[j], ps[i]) < p2(rs[i]));\n }\n double ans = 0;\n rep(t, 1 << m) {\n vector<int> f(n, 0);\n double val = 0;\n rep(i, m) {\n if (t >> i & 1) {\n rep(j, n) if (inter[j][i]) f[j] = 1;\n val += bt[i] / dist(p0, pt[i]);\n }\n }\n if (accumulate(all(f), 0) > r)\n continue;\n chmax(ans, val);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":7330,"memory_kb":3648,"score_of_the_acc":-1.8987,"final_rank":20},{"submission_id":"aoj_1331_7980272","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define foa(c, v) for (auto &c : v)\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n#define all(v) v.begin(), v.end()\n#define sz(v) int(size(v))\ntemplate <class T>\nbool chmin(T &a, T b)\n{\n return a > b ? (a = b, 1) : 0;\n}\n\ntemplate <class T>\nbool chmax(T &a, T b)\n{\n return a < b ? (a = b, 1) : 0;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &vec)\n{\n os << \"{ \";\n foa(c, vec)\n {\n os << c << \", \";\n }\n os << \"}\";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<vector<T>> &vv)\n{\n os << \"{ \";\n foa(v, vv)\n {\n os << \"\\n\\t\" << v << \", \";\n }\n os << \"\\n}\";\n return os;\n}\n\n#ifdef LOCAL\n#define debug(x) cerr << __LINE__ << \", \" << #x << \": \" << x << endl;\n#else\n#define debug(x) void(0)\n#endif\n\nusing R = long double;\nconstexpr int dim = 3;\nusing point = array<R, dim>;\n\npoint operator+(point a, point b)\n{\n point c;\n rep(i, dim) c[i] = a[i] + b[i];\n return c;\n}\n\npoint operator-(point a, point b)\n{\n point c;\n rep(i, dim) c[i] = a[i] - b[i];\n return c;\n}\n\nR dot(point a, point b)\n{\n R res = 0;\n rep(i, dim) res += a[i] * b[i];\n return res;\n}\n\nR dsq(point a, point b)\n{\n R res = 0;\n rep(i, dim) res += pow(a[i] - b[i], 2);\n return res;\n}\n\nR distance(point a, point b)\n{\n return sqrt(dsq(a, b));\n}\n\nR dist_from_center(point a)\n{\n R res = 0;\n rep(i, dim) res += pow(a[i], 2);\n return sqrt(res);\n}\n\nR angle(point a, point b, point c)\n{\n a = a - b;\n c = c - b;\n return acos(dot(a, c) / (dist_from_center(a) * dist_from_center(c)));\n}\n\nistream &operator>>(istream &is, point &c)\n{\n rep(i, dim) is >> c[i];\n return is;\n}\n\nostream &operator<<(ostream &os, const point &c)\n{\n os << \"(\";\n rep(i, dim) os << c[i] << \", \";\n os << \")\";\n return os;\n}\n\nusing points = vector<point>;\n\nint bnum;\nvoid solve()\n{\n int lnum, remove_limit;\n cin >> lnum >> remove_limit;\n\n vector<point> balloons(bnum), lights(lnum);\n vector<R> radii(bnum), bright(lnum);\n\n rep(i, bnum)\n {\n cin >> balloons[i];\n cin >> radii[i];\n }\n\n rep(j, lnum)\n {\n cin >> lights[j] >> bright[j];\n }\n\n point goal;\n cin >> goal;\n\n debug(balloons);\n debug(goal);\n\n rep(j, lnum)\n bright[j] /= dsq(goal, lights[j]);\n\n vector<bitset<2123>> barricade(lnum);\n\n auto inside = [&](int bid, point p) -> bool\n {\n return distance(balloons[bid], p) < radii[bid];\n };\n\n auto absorbed = [&](int bid, int lid) -> bool\n {\n const point &light = lights[lid], bcenter = balloons[bid];\n R dl = distance(goal, light), db = distance(goal, bcenter), r = radii[bid];\n\n if (inside(bid, goal))\n return !inside(bid, light);\n\n if (inside(bid, light))\n return true;\n\n assert(db > r);\n R tang = sqrt(db * db - r * r);\n\n if (tang > dl)\n return false;\n\n return angle(light, goal, bcenter) < asin(r / db);\n };\n\n rep(bid, bnum)\n {\n rep(lid, lnum)\n {\n if (absorbed(bid, lid))\n {\n barricade[lid].set(bid, 1);\n }\n }\n }\n\n R ans = 0;\n\n rep(bits, (1 << lnum))\n {\n bitset<2123> b;\n R res = 0;\n rep(lid, lnum) if ((1 << lid) & bits)\n {\n b |= barricade[lid];\n res += bright[lid];\n }\n if (int(b.count()) > remove_limit)\n continue;\n chmax(ans, res);\n }\n\n cout << ans << endl;\n}\n\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (cin >> bnum && bnum)\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":3708,"score_of_the_acc":-1.0092,"final_rank":15},{"submission_id":"aoj_1331_7237186","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ld = long double;\nusing point = tuple<ld,ld,ld>;\n\nbool cross(point balloon, ld radius, point light) {\n auto [lx, ly, lz] = light;\n auto [bx, by, bz] = balloon;\n\n if(hypot(bx, by, bz) <= radius) {\n return hypot(lx - bx, ly - by, lz - bz) > radius;\n }\n\n ld low = 0.0l;\n ld high = 1.0l;\n\n while(high - low >= 1e-7) {\n ld c1 = (low * 2.0l + high) / 3.0l;\n ld c2 = (low + high * 2.0l) / 3.0l;\n\n ld x1 = c1 * lx, y1 = c1 * ly, z1 = c1 * lz;\n ld x2 = c2 * lx, y2 = c2 * ly, z2 = c2 * lz;\n\n ld f1 = hypot(x1 - bx, y1 - by, z1 - bz);\n ld f2 = hypot(x2 - bx, y2 - by, z2 - bz);\n\n if(f1 > f2) low = c1;\n else high = c2;\n }\n\n ld x = low * lx, y = low * ly, z = low * lz;\n return hypot(x - bx, y - by, z - bz) <= radius;\n}\n\nvoid solve(int N, int M, int R) {\n point balloons[N];\n ld radiuses[N];\n\n for (int i = 0; i < N; i++) {\n ld x,y,z;\n cin >> x >> y >> z >> radiuses[i];\n balloons[i] = {x,y,z};\n }\n\n point lights[N];\n ld T[N];\n for (int i = 0; i < M; i++) {\n ld x,y,z;\n cin >> x >> y >> z >> T[i];\n lights[i] = {x,y,z};\n }\n\n ld Ex, Ey, Ez;\n cin >> Ex >> Ey >> Ez;\n for (int i = 0; i < N; i++) {\n auto [x, y, z] = balloons[i];\n balloons[i] = {x - Ex, y - Ey, z - Ez};\n }\n for (int i = 0; i < M; i++) {\n auto [x, y, z] = lights[i];\n lights[i] = {x - Ex, y - Ey, z - Ez};\n }\n\n bitset<2000> obstacles[M];\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n if(cross(balloons[i], radiuses[i], lights[j])) {\n obstacles[j].set(i, true);\n }\n }\n }\n\n ld ans = numeric_limits<ld>::min();\n\n for (int bits = 0; bits < (1 << M); bits++) {\n bitset<2000> obs;\n for (int i = 0; i < M; i++) {\n if(bits & (1 << i)) obs |= obstacles[i];\n }\n if(obs.count() > R) continue;\n\n ld score = 0;\n\n for (int i = 0; i < M; i++) {\n if(bits & (1 << i)) {\n auto [x, y, z] = lights[i];\n score += T[i] / powl(hypot(x, y, z), 2.0l);\n }\n }\n\n ans = max(ans, score);\n }\n\n cout << fixed << setprecision(10) << ans << endl;\n}\n\nint main() {\n int N, M, R;\n\n while(true) {\n cin >> N >> M >> R;\n if(N == 0 && M == 0 && R == 0) break;\n solve(N, M, R);\n }\n}","accuracy":1,"time_ms":610,"memory_kb":3712,"score_of_the_acc":-1.0495,"final_rank":16},{"submission_id":"aoj_1331_6581220","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\nusing T = double;\nconstexpr T eps = 1e-12;\ninline bool eq(T a, T b) { return std::abs(a - b) < eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a < b + eps; }\n\nstruct Vec {\n T x, y, z;\n Vec() = default;\n constexpr Vec(T x, T y, T z) : x(x), y(y), z(z) {}\n constexpr Vec& operator+=(const Vec& r) { x += r.x; y += r.y; z += r.z; return *this; }\n constexpr Vec& operator-=(const Vec& r) { x -= r.x; y -= r.y; z -= r.z; return *this; }\n constexpr Vec& operator*=(T r) { x *= r; y *= r; z *= r; return *this; }\n constexpr Vec& operator/=(T r) { x /= r; y /= r; z /= r; return *this; }\n constexpr Vec operator-() const { return Vec(-x, -y, -z); }\n constexpr Vec operator+(const Vec& r) const { return Vec(*this) += r; }\n constexpr Vec operator-(const Vec& r) const { return Vec(*this) -= r; }\n constexpr Vec operator*(T r) const { return Vec(*this) *= r; }\n constexpr Vec operator/(T r) const { return Vec(*this) /= r; }\n friend constexpr Vec operator*(T r, const Vec& v) { return v * r; }\n};\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y, z;\n is >> x >> y >> z;\n p = {x, y, z};\n return is;\n}\n\nT dot(const Vec& a, const Vec& b) {\n return a.x*b.x + a.y*b.y + a.z*b.z;\n}\n\nVec cross(const Vec& a, const Vec& b) {\n return Vec(a.y*b.z-a.z*b.y, a.z*b.x-a.x*b.z, a.x*b.y-a.y*b.x);\n}\n\nnamespace std {\nT norm(const Vec& a) { return dot(a, a); }\nT abs(const Vec& a) { return std::sqrt(std::norm(a)); }\n}\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nT dist(const Segment& s, const Vec& p) {\n if (lt(dot(p - s.p1, s.dir()), 0)) return std::abs(p - s.p1);\n if (lt(dot(p - s.p2, -s.dir()), 0)) return std::abs(p - s.p2);\n return std::abs(cross(p - s.p1, s.dir())) / std::abs(s.dir());\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int N, M, R;\n cin >> N >> M >> R;\n if (N == 0 && M == 0 && R == 0) break;\n vector<Vec> S(N), T(M);\n vector<double> r(N), b(M);\n rep(i,0,N) cin >> S[i] >> r[i];\n rep(i,0,M) cin >> T[i] >> b[i];\n Vec E;\n cin >> E;\n vector<double> score(M);\n rep(j,0,M) score[j] = b[j] / norm(T[j] - E);\n vector<int> interrupt(N);\n rep(i,0,N) rep(j,0,M) {\n if (lt(abs(E-S[i]), r[i]) && lt(abs(T[j]-S[i]), r[i])) continue;\n if (lt(dist(Segment(E, T[j]), S[i]), r[i])) {\n interrupt[i] |= 1<<j;\n }\n }\n double ans = 0;\n for (int B = 0; B < 1 << M; ++B) {\n int cnt = 0;\n rep(i,0,N) {\n if (interrupt[i] & B) ++cnt;\n }\n if (cnt > R) continue;\n double c = 0;\n rep(j,0,M) if (B>>j&1) c += score[j];\n chmax(ans, c);\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":400,"memory_kb":3584,"score_of_the_acc":-0.8173,"final_rank":7},{"submission_id":"aoj_1331_6391174","code_snippet":"#include <algorithm>\n#include<bits/stdc++.h>\n#include <new>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing vvvvector = vvector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nstring twoChar(int n){\n if(n<10)return \"0\" + to_string(n);\n return to_string(n);\n}\n\nstring toString(int h,int m,int s){\n return twoChar(h)+\":\"+twoChar(m)+\":\"+twoChar(s);\n}\n\nstring toString(vector<int> line){\n return toString(line[0],line[1],line[2]);\n}\n\nvector<int> toTimes(int n){\n return {n/3600,n%3600/60,n%60};\n}\n\nvector<int> expectedTimes(vector<int> times){\n set<int> expected;\n sort(all(times));\n do{\n rep(rotate,60){\n vector<int> adds;\n foreach(i,times)adds.emplace_back((i+rotate)%60);\n int hour = adds[0];\n int minutes = adds[1];\n int secs = adds[2];\n if(hour%5!=minutes/12)continue;\n expected.emplace(hour/5*3600+minutes*60+secs);\n }\n }while(next_permutation(all(times)));\n vector<int> res(all(expected));\n return res;\n}\n\nstring func(int n){\n vvector<int> line(n,vector<int>(3));\n foreach(i,line)foreach(j,i)j=in();\n vector<queue<int>> oks;\n foreach(i,line){\n queue<int> adds;\n foreach(j,expectedTimes(i)){\n adds.emplace(j);\n }\n oks.emplace_back(adds);\n }\n int mint = INF;\n int maxt = 0;\n int dist = INF;\n while(true){\n {\n bool flag = false;\n foreach(i,oks)if(i.empty())flag=true;\n if(flag)break;\n }\n int mins = INF;\n int maxs = 0;\n foreach(i,oks){\n chmax(maxs,i.front());\n chmin(mins,i.front());\n }\n if(chmin(dist,maxs-mins)){\n mint = mins;\n maxt = maxs;\n }\n foreach(i,oks)if(i.front()==mins)i.pop();\n }\n return toString(toTimes(mint)) + \" \" + toString(toTimes(maxt));\n}\n\n\ntemplate<class t>\nclass Vector3{\n\tpublic:\n\t\tt x;\n\t\tt y;\n\t\tt z;\n\t\tVector3():x(0), y(0), z(0){}\n\t\tVector3(t a, t b, t c):x(a), y(b), z(c){}\n\t\tVector3(const Vector3 &o):x(o.x), y(o.y), z(o.z){}\n\n\t\tVector3& operator+=(Vector3 o){x+=o.x;y+=o.y;z+=o.z;return *this;}\n\t\tVector3& operator-=(Vector3 o){x-=o.x;y-=o.y;z-=o.z;return *this;}\n\t\tVector3& operator*=(t o){x*=o;y*=o;z*=o;return *this;}\n\t\tVector3& operator/=(t o){x/=o;y/=o;z/=o;return *this;}\n\n\t\tVector3 operator+(Vector3 o){return Vector3(*this)+=o;}\n\t\tVector3 operator-(Vector3 o){return Vector3(*this)-=o;}\n\t\tVector3 operator*(t o){return Vector3(*this)*=o;}\n\t\tVector3 operator/(t o){return Vector3(*this)/=o;}\n};\n\ntemplate<class t>\ndouble abs(Vector3<t> x){\n\treturn sqrt(x.x * x.x + x.y * x.y + x.z * x.z);\n}\n\ntemplate<class t>\ndouble dot(Vector3<t> x, Vector3<t> y){\n\treturn x.x * y.x + x.y * y.y + x.z * y.z;\n}\n\ntemplate<class t>\nVector3<t> cross(Vector3<t> x, Vector3<t> y){\n\tt rx = x.y * y.z - x.z * y.y;\n\tt ry = x.z * y.x - x.x * y.z;\n\tt rz = x.x * y.y - x.y * y.x;\n\treturn Vector3<t>(rx, ry, rz); \n}\nusing vector3= Vector3<double>;\n\nclass Sphere{\npublic:\n vector3 p;\n double r;\n Sphere(vector3 p,double r):p(p),r(r){}\n};\n\nclass Light{\npublic:\n vector3 p;\n double i;\n Light(vector3 p,double i):p(p),i(i){}\n};\n\nbool isIn(Sphere s,vector3 p){\n return abs(s.p - p) < s.r;\n}\n\nbool isTouch(Sphere s,vector3 from,vector3 to){\n if(isIn(s,from) and isIn(s,to))return false;\n vector3 v1 = to - from;\n vector3 v2 = s.p - from;\n vector3 n = v1 / abs(v1);\n double k = dot(n,v2);\n if(0 < k){\n v2 = v2 - n * min(k,abs(v1));\n }\n return abs(v2) < s.r;\n}\n\ndouble func(int n,int m,int r){\n vector<Sphere> baloons;\n vector<Light> lights;\n rep(_,n){\n int x = in();\n int y = in();\n int z = in();\n int r = in();\n baloons.emplace_back(vector3(x,y,z),r);\n }\n rep(_,m){\n int x = in();\n int y = in();\n int z = in();\n int i = in();\n lights.emplace_back(vector3(x,y,z),i);\n }\n vector3 object = (lambda(vector3){\n int x = in();\n int y = in();\n int z = in();\n return vector3(x,y,z);\n })();\n vvector<int> brokens;\n foreach(light,lights){\n vector<int> broken;\n foreach(baloon,baloons){\n if(isTouch(baloon,object,light.p)){\n broken.emplace_back(1);\n }else{\n broken.emplace_back(0);\n }\n }\n brokens.emplace_back(broken);\n }\n\n vector<int> broken(n,0);\n\n method(rec,double,int p,double sum){\n if(p==m){\n int cnt = 0;\n foreach(i,broken)cnt += i != 0;\n if(cnt > r)return 0;\n return sum;\n }\n double res = 0;\n chmax(res,rec(p+1,sum));\n rep(i,n){\n broken[i] += brokens[p][i];\n }\n chmax(res,rec(p+1,sum + lights[p].i / pow(abs(object-lights[p].p),2)));\n rep(i,n){\n broken[i] -= brokens[p][i];\n }\n return res;\n };\n return rec(0,0);\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(true){\n int n = in();\n int m = in();\n int r = in();\n if(n==0)break;\n println(func(n,m,r));\n }\n\n return 0;\n}","accuracy":1,"time_ms":760,"memory_kb":3660,"score_of_the_acc":-0.9884,"final_rank":14},{"submission_id":"aoj_1331_6367548","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\ntypedef string::const_iterator State;\n#define eps 1e-8L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\ntypedef long double ld;\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\n#define ALL(x) (x).begin(), (x).end()\n\n#define int long long\nld dist(tuple<ld, ld, ld> a, tuple<ld, ld, ld> b)\n{\n return pow(get<0>(a) - get<0>(b), 2.0) + pow(get<1>(a) - get<1>(b), 2.0) + pow(get<2>(a) - get<2>(b), 2.0);\n}\n\nvoid solve()\n{\n int n, m, r;\n cin >> n >> m >> r;\n if (n == 0)\n exit(0);\n vector<pair<tuple<ld, ld, ld>, ld>> Balloon;\n REP(i, n)\n {\n ld a, b, c, d;\n cin >> a >> b >> c >> d;\n Balloon.push_back({{a, b, c}, d});\n }\n vector<pair<tuple<ld, ld, ld>, ld>> lights;\n REP(i, m)\n {\n ld a, b, c, d;\n cin >> a >> b >> c >> d;\n lights.push_back({{a, b, c}, d});\n }\n tuple<ld, ld, ld> e;\n cin >> get<0>(e) >> get<1>(e) >> get<2>(e);\n\n vector<int> light_target(n, 0);\n REP(i, m)\n {\n lights[i].second /= dist(e, lights[i].first);\n REP(q, n)\n {\n if (max(dist(e, Balloon[q].first), dist(lights[i].first, Balloon[q].first)) <= Balloon[q].second * Balloon[q].second + eps)\n {\n continue;\n }\n ld bot = 0;\n ld top = 1;\n ld now_min_dist = 1e18;\n REP(t, 100)\n {\n ld botter = (bot + bot + top) / 3.0;\n ld topper = (bot + top + top) / 3.0;\n tuple<ld, ld, ld> target = e;\n get<0>(target) *= botter;\n get<1>(target) *= botter;\n get<2>(target) *= botter;\n\n get<0>(target) += (1.0L - botter) * get<0>(lights[i].first);\n get<1>(target) += (1.0L - botter) * get<1>(lights[i].first);\n get<2>(target) += (1.0L - botter) * get<2>(lights[i].first);\n\n ld dis[2] = {};\n dis[0] = dist(target, Balloon[q].first);\n\n target = e;\n get<0>(target) *= topper;\n get<1>(target) *= topper;\n get<2>(target) *= topper;\n\n get<0>(target) += (1.0L - topper) * get<0>(lights[i].first);\n get<1>(target) += (1.0L - topper) * get<1>(lights[i].first);\n get<2>(target) += (1.0L - topper) * get<2>(lights[i].first);\n\n dis[1] = dist(target, Balloon[q].first);\n if (dis[0] < dis[1])\n {\n top = topper;\n }\n else\n {\n bot = botter;\n }\n\n now_min_dist = min({now_min_dist, dis[0], dis[1]});\n }\n if (now_min_dist <= Balloon[q].second * Balloon[q].second + eps)\n {\n light_target[q] |= (1 << i);\n }\n }\n }\n ld ans = 0;\n REP(i, (1 << m))\n {\n ld now = 0;\n int cnt = 0;\n REP(q, m)\n {\n if ((1 << q) & i)\n now += lights[q].second;\n }\n REP(q, n)\n {\n if (i & light_target[q])\n {\n cnt++;\n }\n }\n if (cnt <= r)\n {\n ans = max(ans, now);\n }\n }\n cout << ans << endl;\n}\n#undef int\n\n// generated by oj-template v4.7.2\n// (https://github.com/online-judge-tools/template-generator)\nint main()\n{\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 10000;\n // cin >> t; // comment out if solving multi testcase\n for (int testCase = 1; testCase <= t; ++testCase)\n {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":890,"memory_kb":3632,"score_of_the_acc":-0.9625,"final_rank":13},{"submission_id":"aoj_1331_6024869","code_snippet":"#include<iostream>\n#include<ostream>\n#include<cmath>\n#include<cstdio>\n#include<cassert>\n#include<bitset>\n\nusing namespace std;\n\n#define EPS (1e-7)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nclass Point3d{\npublic:\n double x,y,z;\n \n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\n \n Point3d operator + (const Point3d& a){\n return Point3d(x+a.x,y+a.y,z+a.z);\n }\n Point3d operator - (const Point3d& a){\n return Point3d(x-a.x,y-a.y,z-a.z);\n }\n Point3d operator * (const double& d){\n return Point3d(x*d,y*d,z*d);\n }\n Point3d operator / (const double& d){\n return Point3d(x/d,y/d,z/d);\n }\n \n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\n \n bool operator == (const Point3d& p)const{\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\n }\n \n};\n \nstruct Segment3d{\n Point3d p[2];\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\n p[0] = p1, p[1] = p2;\n }\n bool operator == (const Segment3d& seg)const{\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\n }\n};\n \ntypedef Point3d Vector3d;\ntypedef Segment3d Line3d;\n \nostream& operator << (ostream& os,const Point3d& p){\n return os << \"(\" << p.x << \",\" << p.y << \",\" << p.z << \")\";\n}\n \nostream& operator << (ostream& os,const Segment3d& seg){\n return os << \"(\" << seg.p[0] << \",\" << seg.p[1] << \")\";\n}\n \ndouble dot(const Point3d& a,const Point3d& b){\n return a.x*b.x + a.y*b.y + a.z*b.z;\n}\n \nVector3d cross(const Point3d& a,const Point3d& b){\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\n}\n \ninline double norm(const Point3d &p){\n return p.x*p.x + p.y*p.y + p.z*p.z;\n}\n \ninline double abs(const Point3d &p){\n return sqrt(norm(p));\n}\n \ninline double toRad(double theta){\n return theta * M_PI / 180.0;\n}\n\ndouble distanceLP(Line3d line,Point3d p){\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\n}\n \nPoint3d project(Segment3d seg,Point3d p){\n Vector3d base = seg.p[1] - seg.p[0];\n double t = dot(p-seg.p[0],base) / norm(base);\n return seg.p[0] + base * t;\n}\n \nPoint3d reflect(Segment3d seg,Point3d p){\n return p + (project(seg,p)-p) * 2.0;\n}\n\nbool on_line3d(Line3d line,Point3d p){\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\n}\n \nbool on_segment3d(Segment3d seg,Point3d p){\n if( !on_line3d(seg,p) ) return false;\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\n}\n\ndouble distanceSP(Segment3d seg,Point3d p){\n Point3d r = project(seg,p);\n if( on_segment3d(seg,r) ) return abs(p-r);\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\n}\n\nusing namespace std;\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\n\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\n\nclass Point3DwithWeight {\npublic:\n Point3d p;\n double weight;\n};\n\nconst int MAX_N = 2100;\nconst int MAX_M = 20;\nint N,M,R;\nbitset<2100> remove_cost[MAX_M];\nPoint3DwithWeight S[MAX_N],T[MAX_M];\nPoint3DwithWeight E;\n\nint getType(double a,double b){\n if( LT(a,b) ) return -1;\n return 1;\n}\n\nvoid init(){\n rep(i,M) remove_cost[i] = 0; \n rep(i,M) {\n rep(j,N){\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\n if( type[0] == type[1] && type[0] == -1 ) continue;\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\n }\n }\n}\n\n#define pow2(a) ((a)*(a))\nvoid compute(){\n init();\n double maxi = 0;\n rep(bitmask,(1<<M)){\n bitset<2100> BIT(0);\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\n if( BIT.count() <= R ) {\n double cost = 0;\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\n maxi = max(maxi,cost);\n }\n }\n printf(\"%.10lf\\n\",maxi);\n}\n\nint main(){\n while( cin >> N >> M >> R, N|M|R ){\n assert( N <= 2000);\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\n cin >> E.p.x >> E.p.y >> E.p.z;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":3284,"score_of_the_acc":-0.3426,"final_rank":4},{"submission_id":"aoj_1331_6024788","code_snippet":"#include <bits/stdc++.h>\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define EPS (1e-7)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nclass Point3d{\npublic:\n double x,y,z;\n \n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\n \n Point3d operator + (const Point3d& a){\n return Point3d(x+a.x,y+a.y,z+a.z);\n }\n Point3d operator - (const Point3d& a){\n return Point3d(x-a.x,y-a.y,z-a.z);\n }\n Point3d operator * (const double& d){\n return Point3d(x*d,y*d,z*d);\n }\n Point3d operator / (const double& d){\n return Point3d(x/d,y/d,z/d);\n }\n \n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\n \n bool operator == (const Point3d& p)const{\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\n }\n \n};\n \nstruct Segment3d{\n Point3d p[2];\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\n p[0] = p1, p[1] = p2;\n }\n bool operator == (const Segment3d& seg)const{\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\n }\n};\n \ntypedef Point3d Vector3d;\ntypedef Segment3d Line3d;\n \nostream& operator << (ostream& os,const Point3d& p){\n return os << \"(\" << p.x << \",\" << p.y << \",\" << p.z << \")\";\n}\n \nostream& operator << (ostream& os,const Segment3d& seg){\n return os << \"(\" << seg.p[0] << \",\" << seg.p[1] << \")\";\n}\n \ndouble dot(const Point3d& a,const Point3d& b){\n return a.x*b.x + a.y*b.y + a.z*b.z;\n}\n \nVector3d cross(const Point3d& a,const Point3d& b){\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\n}\n \ninline double norm(const Point3d &p){\n return p.x*p.x + p.y*p.y + p.z*p.z;\n}\n \ninline double abs(const Point3d &p){\n return sqrt(norm(p));\n}\n \ninline double toRad(double theta){\n return theta * M_PI / 180.0;\n}\n\ndouble distanceLP(Line3d line,Point3d p){\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\n}\n \nPoint3d project(Segment3d seg,Point3d p){\n Vector3d base = seg.p[1] - seg.p[0];\n double t = dot(p-seg.p[0],base) / norm(base);\n return seg.p[0] + base * t;\n}\n \nPoint3d reflect(Segment3d seg,Point3d p){\n return p + (project(seg,p)-p) * 2.0;\n}\n\nbool on_line3d(Line3d line,Point3d p){\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\n}\n \nbool on_segment3d(Segment3d seg,Point3d p){\n if( !on_line3d(seg,p) ) return false;\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\n}\n\ndouble distanceSP(Segment3d seg,Point3d p){\n Point3d r = project(seg,p);\n if( on_segment3d(seg,r) ) return abs(p-r);\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\n}\n\nusing namespace std;\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\n\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\n\nclass Point3DwithWeight {\npublic:\n Point3d p;\n double weight;\n};\n\nconst int MAX_N = 2100;\nconst int MAX_M = 20;\nint N,M,R;\nbitset<2100> remove_cost[MAX_M];\nPoint3DwithWeight S[MAX_N],T[MAX_M];\nPoint3DwithWeight E;\n\nint getType(double a,double b){\n if( LT(a,b) ) return -1;\n return 1;\n}\n\nvoid init(){\n rep(i,M) remove_cost[i] = 0; \n rep(i,M) {\n rep(j,N){\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\n if( type[0] == type[1] && type[0] == -1 ) continue;\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\n }\n }\n}\n\n#define pow2(a) ((a)*(a))\nvoid compute(){\n init();\n double maxi = 0;\n rep(bitmask,(1<<M)){\n bitset<2100> BIT(0);\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\n if( BIT.count() <= R ) {\n double cost = 0;\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\n maxi = max(maxi,cost);\n }\n }\n printf(\"%.10lf\\n\",maxi);\n}\n\nint main(){\n while( cin >> N >> M >> R, N|M|R ){\n assert( N <= 2000);\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\n cin >> E.p.x >> E.p.y >> E.p.z;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":3368,"score_of_the_acc":-0.4755,"final_rank":5},{"submission_id":"aoj_1331_6024746","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define EPS (1e-7)\n#define equals(a,b) (fabs((a)-(b))<EPS)\n\nclass Point3d{\npublic:\n double x,y,z;\n \n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\n \n Point3d operator + (const Point3d& a){\n return Point3d(x+a.x,y+a.y,z+a.z);\n }\n Point3d operator - (const Point3d& a){\n return Point3d(x-a.x,y-a.y,z-a.z);\n }\n Point3d operator * (const double& d){\n return Point3d(x*d,y*d,z*d);\n }\n Point3d operator / (const double& d){\n return Point3d(x/d,y/d,z/d);\n }\n \n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\n \n bool operator == (const Point3d& p)const{\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\n }\n \n};\n \nstruct Segment3d{\n Point3d p[2];\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\n p[0] = p1, p[1] = p2;\n }\n bool operator == (const Segment3d& seg)const{\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\n }\n};\n \ntypedef Point3d Vector3d;\ntypedef Segment3d Line3d;\n \nostream& operator << (ostream& os,const Point3d& p){\n return os << \"(\" << p.x << \",\" << p.y << \",\" << p.z << \")\";\n}\n \nostream& operator << (ostream& os,const Segment3d& seg){\n return os << \"(\" << seg.p[0] << \",\" << seg.p[1] << \")\";\n}\n \ndouble dot(const Point3d& a,const Point3d& b){\n return a.x*b.x + a.y*b.y + a.z*b.z;\n}\n \nVector3d cross(const Point3d& a,const Point3d& b){\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\n}\n \ninline double norm(const Point3d &p){\n return p.x*p.x + p.y*p.y + p.z*p.z;\n}\n \ninline double abs(const Point3d &p){\n return sqrt(norm(p));\n}\n \ninline double toRad(double theta){\n return theta * M_PI / 180.0;\n}\n\ndouble distanceLP(Line3d line,Point3d p){\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\n}\n \nPoint3d project(Segment3d seg,Point3d p){\n Vector3d base = seg.p[1] - seg.p[0];\n double t = dot(p-seg.p[0],base) / norm(base);\n return seg.p[0] + base * t;\n}\n \nPoint3d reflect(Segment3d seg,Point3d p){\n return p + (project(seg,p)-p) * 2.0;\n}\n\nbool on_line3d(Line3d line,Point3d p){\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\n}\n \nbool on_segment3d(Segment3d seg,Point3d p){\n if( !on_line3d(seg,p) ) return false;\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\n}\n\ndouble distanceSP(Segment3d seg,Point3d p){\n Point3d r = project(seg,p);\n if( on_segment3d(seg,r) ) return abs(p-r);\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\n}\n \n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\n\nclass Point3DwithWeight {\npublic:\n Point3d p;\n double weight;\n};\n\nconst int MAX_N = 2100;\nconst int MAX_M = 20;\nint N,M,R;\nbitset<2100> remove_cost[MAX_M];\nPoint3DwithWeight S[MAX_N],T[MAX_M];\nPoint3DwithWeight E;\n\nint getType(double a,double b){\n if( LT(a,b) ) return -1;\n return 1;\n}\n\nvoid init(){\n rep(i,M) remove_cost[i] = 0; \n rep(i,M) {\n rep(j,N){\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\n if( type[0] == type[1] && type[0] == -1 ) continue;\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\n }\n }\n}\n\n#define pow2(a) ((a)*(a))\nvoid compute(){\n init();\n double maxi = 0;\n rep(bitmask,(1<<M)){\n bitset<2100> BIT(0);\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\n if( BIT.count() <= R ) {\n double cost = 0;\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\n maxi = max(maxi,cost);\n }\n }\n printf(\"%.10lf\\n\",maxi);\n}\n\nint main(){\n while( cin >> N >> M >> R, N|M|R ){\n assert( N <= 2000);\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\n cin >> E.p.x >> E.p.y >> E.p.z;\n compute();\n }\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":3232,"score_of_the_acc":-0.2603,"final_rank":2},{"submission_id":"aoj_1331_5973812","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\n// 3D points\n// AOJ 1331\nstruct _3Dpoint{\n double x,y,z;\n _3Dpoint(){}\n _3Dpoint(double x,double y,double z):x(x),y(y),z(z){}\n _3Dpoint& operator-=(const _3Dpoint &p){\n x -= p.x; y -= p.y; z -= p.z;\n return *this;\n }\n _3Dpoint& operator+=(const _3Dpoint &p){\n x += p.x; y += p.y; z += p.z;\n return *this;\n }\n _3Dpoint& operator*=(double d){\n x *= d; y *= d; z *= d;\n return *this;\n }\n _3Dpoint& operator/=(double d){\n x /= d; y /= d; z /= d;\n return *this;\n }\n const _3Dpoint operator+ (const _3Dpoint& p) const;\n const _3Dpoint operator- (const _3Dpoint& p) const;\n const _3Dpoint operator* (double d) const;\n const _3Dpoint operator/ (double d) const;\n};\nconst _3Dpoint _3Dpoint::operator+ (const _3Dpoint& p) const{\n _3Dpoint res(*this); return res += p;\n}\nconst _3Dpoint _3Dpoint::operator- (const _3Dpoint& p) const{\n _3Dpoint res(*this); return res -= p;\n}\nconst _3Dpoint _3Dpoint::operator* (double d) const{\n _3Dpoint res(*this); return res *= d;\n}\nconst _3Dpoint _3Dpoint::operator/ (double d) const{\n _3Dpoint res(*this); return res /= d;\n}\nstruct _3Dline{\n _3Dpoint A,B;\n _3Dline(_3Dpoint A,_3Dpoint B):A(A),B(B){}\n};\n// A to B\n_3Dpoint vec(_3Dline L){\n return L.B-L.A;\n}\ndouble abs(_3Dpoint P){\n return sqrt(P.x*P.x+P.y*P.y+P.z*P.z);\n}\ndouble dist(_3Dpoint A,_3Dpoint B){\n return abs(A-B);\n}\ndouble dot(_3Dpoint A,_3Dpoint B){\n return A.x*B.x+A.y*B.y+A.z*B.z;\n}\n_3Dpoint cross(_3Dpoint A,_3Dpoint B){\n return _3Dpoint(A.x*B.y-B.x*A.y, A.y*B.z-B.y*A.z, A.z*B.x-B.z*A.x);\n}\n// 点と直線の距離\ndouble Point_line_distance(_3Dpoint P,_3Dline L){\n return abs(cross(P-L.A,vec(L)))/abs(vec(L));\n}\n// 点と線分の距離\ndouble Point_segment_distance(_3Dpoint P,_3Dline L){\n if(dot(P-L.A,vec(L))<0) return dist(P,L.A);\n else if(dot(P-L.B,vec(L))>0) return dist(P,L.B);\n else return Point_line_distance(P,L);\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int N,M,R;\n while(cin >> N >> M >> R,N){\n vector<_3Dpoint> s(N);\n vector<double> r(N);\n for(int i=0;i<N;i++){\n cin >> s[i].x >> s[i].y >> s[i].z >> r[i];\n }\n vector<_3Dpoint> t(M);\n vector<double> b(M);\n for(int i=0;i<M;i++){\n cin >> t[i].x >> t[i].y >> t[i].z >> b[i];\n }\n _3Dpoint E;\n cin >> E.x >> E.y >> E.z;\n double res=0.0;\n vector<vector<int>> cover(M);\n for(int i=0;i<M;i++){\n _3Dline L(E,t[i]);\n for(int j=0;j<N;j++){\n if(dist(t[i],s[j])<r[j] and dist(E,s[j])<r[j])continue;\n if(Point_segment_distance(s[j],L)<r[j]){\n cover[i].push_back(j);\n }\n }\n }\n vector<int> flg(N);\n for(int i=0;i<(1<<M);i++){\n fill(flg.begin(), flg.end(),0);\n int cnt=0;\n for(int j=0;j<M;j++){\n if((1<<j)&i){\n for(int k:cover[j]){\n if(!flg[k])cnt++;\n flg[k]=1;\n }\n }\n }\n if(cnt<=R){\n double sum=0.0;\n for(int j=0;j<M;j++){\n if((1<<j)&i){\n sum+=b[j]/dist(E,t[j])/dist(E,t[j]);\n }\n }\n res=max(res,sum);\n }\n }\n printf(\"%.10f\\n\",res);\n }\n}","accuracy":1,"time_ms":680,"memory_kb":3620,"score_of_the_acc":-0.9138,"final_rank":12},{"submission_id":"aoj_1331_5768760","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst double EPS = 1e-8;\ninline bool EQ(double a, double b) { return fabs(b - a) < EPS; }\n\nstruct Point {\n double x, y, z;\n Point() {}\n Point(double x, double y, double z) : x(x), y(y), z(z) {}\n Point operator-() const { return Point(-x, -y, -z); }\n Point operator+(const Point& p) const { return Point(x + p.x, y + p.y, z + p.z); }\n Point operator-(const Point& p) const { return Point(x - p.x, y - p.y, z - p.z); }\n Point operator*(const double& t) const { return Point(x * t, y * t, z * t); }\n Point operator/(const double& t) const { return Point(x / t, y / t, z / t); }\n};\nstruct Line {\n Point a, b;\n Line() {}\n Line(Point a, Point b) : a(a), b(b) {}\n};\nstruct Segment : Line {\n Segment() {}\n Segment(Point a, Point b) : Line(a, b) {}\n};\nstruct Sphere {\n Point c;\n double r;\n Sphere(Point c, double r) : c(c), r(r) {}\n};\n\ndouble dot(const Point& a, const Point& b) { return a.x * b.x + a.y * b.y + a.z * b.z; }\ndouble norm(const Point& p) { return p.x * p.x + p.y * p.y + p.z * p.z; }\ndouble abs(const Point& p) { return sqrt(norm(p)); }\n\nPoint projection(const Line& l, const Point& p) {\n double t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\n return l.a + (l.b - l.a) * t;\n}\n\nint intersect(const Sphere& c, const Segment& s) {\n Point h = projection(s, c.c);\n double d1 = abs(c.c - s.a), d2 = abs(c.c - s.b);\n if (norm(h - c.c) - c.r * c.r > EPS) return 0;\n if (d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n if ((d1 < c.r - EPS && d2 > c.r + EPS) || (d1 > c.r + EPS && d2 < c.r - EPS)) return 1;\n if (dot(s.a - h, s.b - h) < 0) return 2;\n return 0;\n}\n\nvoid solve(int N, int M, int R) {\n vector<Sphere> B;\n for (int i = 0; i < N; i++) {\n int x, y, z, r;\n cin >> x >> y >> z >> r;\n B.emplace_back(Point(x, y, z), r);\n }\n vector<Point> L;\n vector<double> b(M);\n for (int i = 0; i < M; i++) {\n int x, y, z;\n cin >> x >> y >> z >> b[i];\n L.emplace_back(x, y, z);\n }\n Point t;\n {\n int x, y, z;\n cin >> x >> y >> z;\n t = Point(x, y, z);\n }\n\n for (int i = 0; i < M; i++) {\n Point p = L[i];\n b[i] /= norm(p - t);\n }\n vector<vector<int>> interupt(M, vector<int>(N));\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < N; j++) {\n Segment s(L[i], t);\n int cross = intersect(B[j], s);\n interupt[i][j] = (cross > 0);\n }\n }\n\n double ans = 0;\n for (int mask = 0; mask < (1 << M); mask++) {\n vector<int> check(N, false);\n double res = 0;\n for (int i = 0; i < M; i++) {\n if (!(mask >> i & 1)) continue;\n res += b[i];\n for (int j = 0; j < N; j++) check[j] |= interupt[i][j];\n }\n int sum = accumulate(check.begin(), check.end(), 0);\n if (sum > R) continue;\n ans = max(ans, res);\n }\n\n cout << ans << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n int N, M, R;\n while (cin >> N >> M >> R, N && M && R) solve(N, M, R);\n return 0;\n}","accuracy":1,"time_ms":2180,"memory_kb":3632,"score_of_the_acc":-1.145,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_1331_10958572\",\n \"code_snippet\": \"#include <cstdio>\\n#include <set>\\n#include <cmath>\\nusing namespace std;\\nstruct Point\\n{\\n double x;\\n double y;\\n double z;\\n void read()\\n {\\n scanf(\\\"%lf %lf %lf\\\",&x,&y,&z);\\n }\\n Point(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\\n Point operator +(const Point &ano)\\n {\\n return Point(x+ano.x,y+ano.y,z+ano.z);\\n }\\n Point operator -(const Point &ano)\\n {\\n return Point(x-ano.x,y-ano.y,z-ano.z);\\n }\\n Point operator *(double p)\\n {\\n return Point(x*p,y*p,z*p);\\n }\\n Point operator /(double p)\\n {\\n return Point(x/p,y/p,z/p);\\n }\\n void print()\\n {\\n printf(\\\"%f %f %f\\\\n\\\",x,y,z);\\n }\\n}E;\\nstruct S\\n{\\n double x;\\n double y;\\n double z;\\n double r;\\n void read()\\n {\\n scanf(\\\"%lf %lf %lf %lf\\\",&x,&y,&z,&r);\\n }\\n Point get()\\n {\\n return Point(x,y,z);\\n }\\n}s[2100];\\ntypedef Point Vector;\\nstruct T\\n{\\n double x;\\n double y;\\n double z;\\n double b;\\n void read()\\n {\\n scanf(\\\"%lf %lf %lf %lf\\\",&x,&y,&z,&b);\\n }\\n Point get()\\n {\\n return Point(x,y,z);\\n }\\n}t[20];\\nVector Cross(Vector a,Vector b)\\n{\\n return Vector(a.y*b.z - a.z*b.y,a.z*b.x -a.x * b.z,a.x*b.y-a.y*b.x);\\n}\\nconst double eps=1e-3;\\ndouble Dot(Vector a,Vector b)\\n{\\n return a.x*b.x + a.y*b.y +a.z *b.z;\\n}\\ndouble Length(Vector a)\\n{\\n return sqrt(Dot(a,a));\\n}\\ndouble distanceToLine(Point p,Point a,Point b)\\n{\\n Vector v1=b-a;\\n Vector v2=p-a;\\n return Length(Cross(v1,v2))/Length(v1);\\n}\\nint dcmp(double p)\\n{\\n if(fabs(p)<eps)\\n return 0;\\n return p<0?-1:1;\\n}\\nbool Intersect(Point a,Point b,S s)\\n{\\n int a1=dcmp(Length(a-s.get())-s.r);\\n int a2=dcmp(Length(b-s.get())-s.r);\\n if(a1 * a2<0)\\n return true;\\n if(a1<=0 && a2<=0)\\n return false;\\n double dis = distanceToLine(s.get(),a,b);\\n if(dcmp(dis-s.r)>=0)\\n return false;\\n double d1=Length(b-s.get());\\n double d2=Length(a-s.get());\\n double x1=d1*d1-dis*dis;\\n double x2=d2*d2-dis*dis;\\n x1=sqrt(x1);\\n x2=sqrt(x2);\\n if(dcmp(x1+x2-Length(b-a))==0)\\n return true;\\n if(dcmp(fabs(x1-x2)-Length(b-a))==0)\\n return false;\\n 1/0;\\n}\\nset<int> p[3000];\\nint main()\\n{\\n int n,m,r;\\n while(~scanf(\\\"%d %d %d\\\",&n,&m,&r))\\n {\\n if(n+m+r==0)\\n break;\\n for(int i=0;i<n;i++)\\n p[i].clear();\\n for(int i=0;i<n;i++)\\n s[i].read();\\n for(int i=0;i<m;i++)\\n t[i].read();\\n E.read();\\n for(int i=0;i<n;i++)\\n for(int j=0;j<m;j++)\\n {\\n if(Intersect(t[j].get(),E,s[i]))\\n p[i].insert(j);\\n }\\n double ans=0;\\n for(int i=0;i<(1<<m);i++)\\n {\\n double sum=0;\\n for(int j=0;j<m;j++)\\n if(i&(1<<j))\\n sum+=t[j].b/(Dot(t[j].get()-E,t[j].get()-E));\\n if(sum<ans)\\n continue;\\n int t=0;\\n for(int k=0;k<n;k++)\\n for(int j=0;j<m;j++)\\n {\\n if(i&(1<<j) && p[k].count(j))\\n {\\n t++;\\n break;\\n }\\n }\\n if(t>r)\\n continue;\\n if(sum>ans)\\n ans=sum;\\n }\\n printf(\\\"%lf\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.8814,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1331_10853177\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cmath>\\n#include<vector>\\nusing namespace std;\\nconst double eps = 1e-9;\\nstruct point\\n{\\n double x,y,z;\\n //不吃參數的建構子跟吃參數的建構子QQ\\n point():x(0),y(0),z(0){}\\n point(double _x,double _y,double _z):x(_x),y(_y),z(_z){}\\n\\n point operator+(const point &p) const{ return point(x+p.x, y+p.y, z+p.z);}\\n point operator-(const point &p) const{ return point(x-p.x, y-p.y, z-p.z);}\\n point operator*(const double &d) const{ return point(x*d, y*d, z*d);}\\n point operator/(const double &d) const{ return point(x/d, y/d, z/d);}\\n};\\nstruct sphere\\n{\\n point p;\\n double r;\\n sphere(point _p,double _r):p(_p),r(_r){}\\n};\\nstruct line\\n{\\n point a,b;\\n line(point _a,point _b):a(_a),b(_b){}\\n};\\n\\nint n,m,r;\\npoint obj;//objective point ;\\nvector <sphere> bal;\\nvector <point> light;\\ndouble bright[16]; //brightness\\nvector <int> rmv[16]; //rmv these balloons to get the light\\n\\npoint start(0.0,0.0,0.0);\\ndouble length2(point a,point b)\\n{\\n double ans=(a.x-b.x)*(a.x-b.x);\\n ans+=(a.y-b.y)*(a.y-b.y);\\n ans+=(a.z-b.z)*(a.z-b.z);\\n return ans;\\n}\\n/*\\ninline double norm(const point &a){ return a.x*a.x+a.y*a.y+a.z*a.z;}\\ninline double abs(const point &a){ return sqrt(norm(a));}\\ninline double dot(const point &a, const point &b){ return a.x*b.x+a.y*b.y+a.z*b.z;}\\npoint proj(const line &l, const point &p){\\n double t = dot(p-l.a, l.a-l.b) / norm(l.a-l.b);\\n return l.a+(l.a-l.b)*t;\\n}\\nbool corss(const line &l, const sphere &s){\\n point a = l.a-s.p, b = l.b-s.p, c = proj(l,s.p)-s.p;\\n if(abs(a) < s.r-eps and abs(b) < s.r-eps and abs(c) < s.r-eps)\\n\\t{\\n\\t\\treturn 0; // contain\\n\\t}\\n if(abs(c) > s.r+eps) return 0; // far\\n if(abs(a) < s.r-eps or abs(b) < s.r-eps) return 1; // intersect\\n if(abs(a-c)+abs(b-c)<abs(a-b)+eps) return 1; // intersect\\n return 0;\\n}\\n*/\\n//12312312313\\ndouble abs(point a)\\n{\\n\\treturn sqrt(length2(a,start));\\n}\\n\\nbool corss(line ln,sphere sph)\\n{\\n\\tpoint a=ln.a;\\n\\tpoint b=ln.b;\\n\\tbool flag1=0,flag2=0;\\n\\tif(sqrt(length2(a,sph.p))<sph.r-eps) flag1=1;\\n\\tif(sqrt(length2(b,sph.p))<sph.r-eps) flag2=1;\\n\\tif(flag1&&flag2)\\n\\t{\\n\\t\\treturn 0;\\n\\t\\t//printf(\\\"A\\\");\\n\\t}\\n\\telse if(flag1||flag2) return 1;\\n\\t//now to consider two point are outside of the sphere\\n\\t// ( ap X ab ) / length(ab) = lenth(line,sphere)\\n\\tpoint ap(sph.p.x-a.x,sph.p.y-a.y,sph.p.z-a.z);\\n\\tpoint ab(b.x-a.x,b.y-a.y,b.z-a.z);\\n\\tpoint ba(a.x-b.x,a.y-b.y,a.z-b.z);\\n\\tpoint tmp(ap.y*ab.z-ap.z*ab.y,ap.z*ab.x-ap.x*ab.z,ap.x*ab.y-ap.y*ab.x);\\n\\t\\n\\tdouble len1=sqrt(tmp.x*tmp.x+tmp.y*tmp.y+tmp.z*tmp.z);\\n\\tdouble len2=sqrt(length2(a,b));\\n\\tif((len1/len2)>(sph.r-eps)) return 0;\\n\\telse\\n\\t{\\n\\t\\tpoint bp(sph.p.x-b.x,sph.p.y-b.y,sph.p.z-b.z);\\n\\t\\t// ap． bp <0 return 1;\\n\\t\\t//there're still some details to consider\\n\\t\\t//printf(\\\"%lf\\\\n\\\",(ap.x*bp.x)+(ap.y*bp.y)+(ap.z*bp.z));\\n\\t\\tif((ap.x*bp.x)+(ap.y*bp.y)+(ap.z*bp.z)<0.0) return 1;\\n\\t\\tif((ab.x*ap.x)+(ab.y*ap.y)+(ab.z*ap.z)<0.0) return 0;\\n\\t\\tif((ba.x*bp.x)+(ba.y*bp.y)+(ba.z*bp.z)<0.0) return 0;\\n\\t\\treturn 1; \\n\\t}\\n}\\n//1231321313223\\nvoid solve()\\n{\\n int i,j,k;\\n for(i=0;i<m;i++) rmv[i].clear();\\n for(i=0;i<m;i++)\\n {\\n for(j=0;j<n;j++)\\n {\\n if(corss(line(light[i],obj),bal[j]))\\n\\t\\t\\t{\\n\\t\\t\\t\\trmv[i].push_back(j);\\n\\t\\t\\t}\\n }\\n }\\n double ans=0.0;\\n for(k=0;k<(1<<m);k++)\\n {\\n bool rmvv[2048]={}; //balloons<2000\\n int cnt=0;\\n double sum=0.0;\\n for(i=0;i<m;i++)\\n {\\n if((k>>i)&1)\\n {\\n for(j=0;j<rmv[i].size();j++)\\n {\\n if(!rmvv[rmv[i][j]]) //rmb[i][j] is the index of the balloon\\n {//if this balloon is not removed yet\\n rmvv[rmv[i][j]]=1;\\n cnt++;\\n }\\n }\\n sum+=bright[i]/length2(light[i],obj);\\n }\\n }\\n\\t\\t\\n if(cnt<=r) ans=max(ans,sum);\\n }\\n printf(\\\"%lf\\\\n\\\",ans);\\n}\\n\\nbool input()\\n{\\n scanf(\\\"%d %d %d\\\",&n,&m,&r);\\n if(n+m+r==0) return 0;\\n\\n int x,y,z,r;\\n bal.clear();\\n light.clear();\\n for(int i=0;i<n;i++)\\n {//eat the ballons\\n scanf(\\\"%d %d %d %d\\\",&x,&y,&z,&r);\\n bal.push_back(sphere(point(x,y,z),r));\\n }\\n for(int i=0;i<m;i++)\\n {//eat the light sources\\n scanf(\\\"%d %d %d %d\\\",&x,&y,&z,&r);\\n light.push_back(point(x,y,z));\\n bright[i]=r;\\n }\\n //eat the objective point\\n scanf(\\\"%d %d %d\\\",&x,&y,&z);\\n obj=point(x,y,z);\\n\\n return 1;\\n}\\n\\nint main()\\n{\\n while(input()) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1470,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.1711,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1331_10684649\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define pb push_back\\n#define db double\\nusing namespace std;\\ndb sqr(db x){return x*x;}\\nstruct B{\\n\\tdb x, y, z, r;\\n};\\nstruct L{\\n\\tdb x, y, z, b;\\n\\tdb val;\\n};\\nstruct P{\\n\\tdb x, y, z;\\n\\tP(db x, db y, db z):x(x), y(y), z(z){}\\n\\tP(B &bl):x(bl.x), y(bl.y), z(bl.z){}\\n\\tP(L &ls):x(ls.x), y(ls.y), z(ls.z){}\\n\\tP(){}\\n\\tdb dis(P &p){return sqr(p.x-x)+sqr(p.y-y)+sqr(p.z-z);}\\n};\\nstruct V{\\n\\tdb x, y, z;\\n\\tV(){}\\n\\tV(P &p1, P &p2):x(p2.x-p1.x), y(p2.y-p1.y), z(p2.z-p1.z){}\\n\\tV(V &a, V &b):x(a.y*b.z-a.z*b.y), y(a.x*b.z-a.z*b.x), z(a.x*b.y-a.y*b.x){}\\n\\tdb dot(V &v){return x*v.x+y*v.y+z*v.z;}\\n\\tdb mod(){return x*x+y*y+z*z;}\\n};\\ndb dis(P &p, P &p1, P &p2){\\n\\tV v1(p1, p), v2(p1, p2), v3(p2, p), v4(p2, p1), v5(v2, v1);\\n\\tif(v1.dot(v2)<0) return p.dis(p1);\\n\\tif(v3.dot(v4)<0) return p.dis(p2);\\n\\treturn (db)v5.mod()/(db)v2.mod();\\n}\\nconst int MAX_N=2e3+50, MAX_M=1000;\\nbool vis[MAX_N];\\nbool block[MAX_M][MAX_N];\\nB bl[MAX_N];\\nL ls[MAX_M];\\nint N, M, R;\\nP obj;\\nbool is_block(int i, int j){\\n\\tP a(ls[i]), b(bl[j]);\\n\\tif(b.dis(a)<sqr(bl[j].r)&&b.dis(obj)<sqr(bl[j].r)) return false;\\n\\treturn dis(b, a, obj)<(db)sqr(bl[j].r);\\n}\\nbool ok(int x){\\n\\tint cnt=0;\\n\\tmemset(vis, 0, sizeof(vis));\\n\\tfor(int i=0; i<M; i++){\\n\\t\\tif(!(x&1<<i)) continue;\\n\\t\\tfor(int j=0; j<N; j++)\\n\\t\\t\\tif(block[i][j]&&!vis[j]) vis[j]=true, cnt++;\\n\\t\\tif(cnt>R) return false;\\n\\t}\\n\\treturn true;\\n}\\ndb calc(int x){\\n\\tdb ans=0;\\n\\tfor(int i=0; i<M; i++){\\n\\t\\tif(!(x&1<<i)) continue;\\n\\t\\tans+=ls[i].val;\\n\\t}\\n\\treturn ans;\\n}\\nvoid solve(){\\n\\tdouble ans=0;\\n\\tfor(int i=0; i<(1<<M); i++){\\n\\t\\tif(ok(i)) ans=max(ans, calc(i));\\n\\t}\\n\\tprintf(\\\"%.9f\\\\n\\\", ans);\\n}\\nint main(){\\n\\t//freopen(\\\"in\\\", \\\"r\\\", stdin);\\n\\twhile(~scanf(\\\"%d%d%d\\\", &N, &M, &R)){\\n\\t\\tif(N||M||R){\\n\\t\\t\\tfor(int i=0; i<N; i++)\\n\\t\\t\\t\\tscanf(\\\"%lf%lf%lf%lf\\\", &bl[i].x, &bl[i].y, &bl[i].z, &bl[i].r);\\n\\t\\t\\tfor(int i=0; i<M; i++){\\n\\t\\t\\t\\tscanf(\\\"%lf%lf%lf%lf\\\", &ls[i].x, &ls[i].y, &ls[i].z, &ls[i].b);\\n\\t\\t\\t}\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\", &obj.x, &obj.y, &obj.z);\\n\\t\\t\\tfor(int i=0; i<N; i++){\\n\\t\\t\\t\\tP p(ls[i]);\\n\\t\\t\\t\\tls[i].val=(db)ls[i].b/(db)obj.dis(p);\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0; i<M; i++)\\n\\t\\t\\t\\tfor(int j=0; j<N; j++)\\n\\t\\t\\t\\t\\tblock[i][j]=is_block(i, j);\\n\\t\\t\\tsolve();\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6490,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -1.8052,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1331_10684636\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <cstring>\\n#include <cstdio>\\n#include <vector>\\n#include <cmath>\\n#include <set>\\n#define eps 1.0e-9\\nusing namespace std;\\nint n,m;\\ndouble r[2333],w[20];\\nbool vis[555],g[20][555];\\nstruct point\\n{\\n double x,y,z;\\n}p[2333],q[20],e;\\ndouble sgn(double f)\\n{\\n if(fabs(f)<eps) return 0;\\n else return f<0?-1:1;\\n}\\ndouble dis(point a,point b) {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z);}\\nint check(point p,point c,double r)\\n{\\n int d=dis(p,c);\\n if(d<r*r) return -1;\\n else if(d==r*r) return 0;\\n else return 1;\\n}\\nbool cal(double a,double b,double c)\\n{\\n double delt=b*b-4*a*c;\\n if(delt<=0) return false;\\n else\\n {\\n delt=sqrt(delt);\\n double x1=(-b+delt)/(2*a),x2=(-b-delt)/(2*a);\\n if((sgn(x1)>0&&sgn(x1-1)<0)||(sgn(x2)>0&&sgn(x2-1)<0)) return true;\\n else return false;\\n }\\n}\\nvoid init()\\n{\\n memset(g,0,sizeof(g));\\n for(int i=0;i<m;i++)\\n {\\n if(e.x==q[i].x&&e.y==q[i].y&&e.z==q[i].z) continue;\\n for(int j=0;j<n;j++)\\n {\\n int a=check(e,p[j],r[j]),b=check(q[i],p[j],r[j]);\\n //if(a==0||b==0) continue;\\n double ka,kb,kc;\\n ka=dis(e,q[i]);\\n kb=2*((e.x-p[j].x)*(q[i].x-e.x)+(e.y-p[j].y)*(q[i].y-e.y)+(e.z-p[j].z)*(q[i].z-e.z));\\n kc=dis(e,p[j])-r[j]*r[j];\\n if(cal(ka,kb,kc)) g[i][j]=1;\\n }\\n }\\n}\\nint main()\\n{\\n int N;\\n while(scanf(\\\"%d%d%d\\\",&n,&m,&N)==3)\\n {\\n if(n==0&&m==0&&N==0) break;\\n for(int i=0;i<n;i++) scanf(\\\"%lf%lf%lf%lf\\\",&p[i].x,&p[i].y,&p[i].z,&r[i]);\\n for(int i=0;i<m;i++) scanf(\\\"%lf%lf%lf%lf\\\",&q[i].x,&q[i].y,&q[i].z,&w[i]);\\n scanf(\\\"%lf%lf%lf\\\",&e.x,&e.y,&e.z);\\n init();\\n int M=1<<m;\\n double ans=0,tb[20];\\n for(int i=0;i<m;i++) tb[i]=w[i]/dis(e,q[i]);\\n for(int i=1;i<M;i++)\\n {\\n memset(vis,0,sizeof(vis));\\n int cnt=0;\\n bool ok=true;\\n double tp=0;\\n for(int j=0;j<m;j++)\\n {\\n if((i&(1<<j))==0) continue;\\n for(int k=0;k<n;k++)\\n {\\n if(vis[k]) continue;\\n if(g[j][k])\\n {\\n vis[k]=true;\\n cnt++;\\n if(cnt>N)\\n {\\n ok=false;\\n break;\\n }\\n }\\n }\\n if(!ok) break;\\n tp+=tb[j];\\n }\\n if(ok) ans=max(ans,tp);\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5360,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -1.234,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1331_10036546\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntemplate <typename T>\\nstruct vec {\\n\\tT x, y, z;\\n\\tvec(const T &x, const T &y, const T &z) : x(x), y(y), z(z) {}\\n\\tvec() : x(0), y(0), z(0) {}\\n\\tvec operator-(const vec &rhs) const {\\n\\t\\treturn {x - rhs.x, y - rhs.y, z - rhs.z};\\n\\t}\\n\\tvec<ld> operator/(const ld &rhs) const {\\n\\t\\treturn {x / rhs, y / rhs, z / rhs};\\n\\t}\\n\\tvec operator*(const ld &rhs) const {\\n\\t\\treturn {x * rhs, y * rhs, z * rhs};\\n\\t}\\n\\tvec<ld> unit() const { return (*this) / (*this).norm(); }\\n\\tT norm2() const { return x * x + y * y + z * z; }\\n\\tld norm() const { return sqrtl((*this).norm2()); }\\n\\tT dot(const vec &rhs) const { return x * rhs.x + y * rhs.y + z * rhs.z; }\\n\\t// vec cross(vec rhs) const { return {y * rhs.z - z * rhs.y, z * rhs.x - x * rhs.z, x * rhs.y - y * rhs.x}; }\\n};\\nstruct sph {\\n\\tvec<int> p;\\n\\tint r;\\n};\\nbool isBlock(const vec<int> &from, const vec<int> &to, const sph &s) {\\n\\tauto isIn = [&](const vec<int> &p) {\\n\\t\\treturn (s.p - p).norm2() <= s.r * s.r;\\n\\t};\\n\\tif (isIn(from) && isIn(to)) return false;\\n\\tif (isIn(from) ^ isIn(to)) return true;\\n\\tvec<int> dif = to - from;\\n\\tvec<int> v = s.p - from;\\n\\tif (dif.dot(v) < 0 || (from - to).dot(s.p - to) < 0) return false;\\n\\tauto convd = [&](const vec<int> &v) {\\n\\t\\treturn vec<ld>(v.x, v.y, v.z);\\n\\t};\\n\\tvec<ld> uni = dif.unit();\\n\\tvec<ld> shaw = uni * (uni.dot(convd(v)));\\n\\tif ((convd(v) - shaw).norm2() <= s.r * s.r) {\\n\\t\\treturn true;\\n\\t} else {\\n\\t\\treturn false;\\n\\t}\\n}\\nint main() {\\n\\twhile (1) {\\n\\t\\tint n, m, r;\\n\\t\\tscanf(\\\"%d%d%d\\\", &n, &m, &r);\\n\\t\\tif (n == 0 && m == 0 && r == 0) break;\\n\\t\\t// printf(\\\"%d %d %d\\\\n\\\", n, m, r);\\n\\t\\tvector<sph> s(n);\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tscanf(\\\"%d %d %d %d\\\", &s[i].p.x, &s[i].p.y, &s[i].p.z, &s[i].r);\\n\\t\\t}\\n\\t\\tvector<vec<int>> lightp(m);\\n\\t\\tvector<int> bright(m);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tscanf(\\\"%d %d %d %d\\\", &lightp[i].x, &lightp[i].y, &lightp[i].z, &bright[i]);\\n\\t\\t}\\n\\t\\tvec<int> pto;\\n\\t\\tscanf(\\\"%d %d %d\\\", &pto.x, &pto.y, &pto.z);\\n\\t\\t// cerr << \\\"ok\\\" << endl;\\n\\t\\tld ans = 0;\\n\\t\\tconst int M = 2010;\\n\\t\\tvector<bitset<M>> isBlkb(m);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tif (isBlock(lightp[i], pto, s[j])) {\\n\\t\\t\\t\\t\\tisBlkb[i].set(j, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int bit = 0; bit < (1 << m); bit++) {\\n\\t\\t\\tbitset<M> dels;\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tld tot = 0;\\n\\t\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\t\\tif ((bit >> i) & 1) {\\n\\t\\t\\t\\t\\ttot += (ld)bright[i] / (lightp[i] - pto).norm2();\\n\\t\\t\\t\\t\\tdels |= isBlkb[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (dels.count() > r) continue;\\n\\t\\t\\t// cerr << \\\"bit: \\\" << bit << endl;\\n\\t\\t\\t// cerr << \\\"tot: \\\" << tot << endl;\\n\\t\\t\\tans = max(ans, tot);\\n\\t\\t}\\n\\t\\tprintf(\\\"%.10Lf\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -0.3369,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1331_9947504\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nbool solve(){\\n\\tint N, M, R;\\n\\tcin >> N >> M >> R;\\n\\n\\tif(N == 0 && M == 0 && R == 0) return false;\\n\\n\\tvector<tuple<ll, ll, ll, ll>> S(N), T(M);\\n\\tfor(auto&[x, y, z, r] : S) cin >> x >> y >> z >> r;\\n\\tfor(auto&[x, y, z, r] : T) cin >> x >> y >> z >> r;\\n\\tll X, Y, Z; cin >> X >> Y >> Z;\\n\\n\\tfor(auto&[x, y, z, r] : S) x -= X, y -= Y, z -= Z;\\n\\tfor(auto&[x, y, z, r] : T) x -= X, y -= Y, z -= Z;\\n\\n\\tauto judge = [&](int bl, int li){\\n\\t\\tauto[xb, yb, zb, rb] = S[bl];\\n\\t\\tauto[xl, yl, zl, rl] = T[li];\\n\\n\\t\\tbool both_outside = false;\\n\\t\\t//両方内側\\n\\t\\t{\\n\\t\\t\\tll dist1 = (xb-xl)*(xb-xl) + (yb-yl)*(yb-yl) + (zb-zl)*(zb-zl);\\n\\t\\t\\tll dist2 = xb*xb + yb*yb + zb*zb;\\n\\t\\t\\tif(dist1 <= rb*rb && dist2 <= rb*rb) return true;\\n\\t\\t\\tif(dist1 >= rb*rb && dist2 >= rb*rb) both_outside = true;\\n\\t\\t}\\n\\n\\t\\t//内外が違う\\n\\t\\tif(!both_outside) return false;\\n\\n\\t\\t//B:ライト, A:風船\\n\\t\\tll A = xb*xb + yb*yb + zb*zb;\\n\\t\\tll B = xl*xl + yl*yl + zl*zl;\\n\\t\\tll dot = xb*xl + yb*yl + zb*zl;\\n\\t\\tll r = rb*rb;\\n\\t\\t//風船がライトとの直線に干渉しない\\n\\t\\tif(r*B <= A*B-dot*dot) return true;\\n\\n\\t\\t//ライトと風船が反対側\\n\\t\\tif(dot<0) return true;\\n\\n\\t\\treturn B<=A;\\n\\t};\\n\\n\\tvector<vector<int>> rem(M);\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tfor(int j = 0; j < N; j++){\\n\\t\\t\\tif(!judge(j, i)) rem[i].push_back(j);\\n\\t\\t}\\n\\t}\\n\\n\\t/*for(int i = 0; i < M; i++){\\n\\t\\tcout << \\\"rem\\\" << i+1 << ' ';\\n\\t\\tfor(int j : rem[i]) cout << j+1 << ' ';\\n\\t\\tcout << endl;\\n\\t}*/\\n\\n\\tdouble ans = 0;\\n\\tfor(int bt = 0; bt < 1<<M; bt++){\\n\\t\\tvector<bool> removed(N, false);\\n\\t\\tdouble res = 0;\\n\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\tif(bt >> i & 1){\\n\\t\\t\\t\\tfor(int j : rem[i]) removed[j] = true;\\n\\t\\t\\t\\tauto[xl, yl, zl, rl] = T[i];\\n\\t\\t\\t\\tdouble val = 1.0*rl / (xl*xl + yl*yl + zl*zl);\\n\\t\\t\\t\\tres += val;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint cnt = 0;\\n\\t\\tfor(int i = 0; i < N; i++) if(removed[i]) cnt++;\\n\\t\\t//cout << \\\"cnt:\\\" << cnt << endl;\\n\\t\\tif(cnt <= R) ans = max(ans, res);\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\", ans);\\n\\treturn true;\\n}\\n\\nint main(){\\n\\twhile(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1450,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.8898,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1331_9711061\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct Balloon {\\n ll X, Y, Z, R;\\n Balloon(ll x, ll y, ll z, ll r) : X(x), Y(y), Z(z), R(r) {};\\n};\\n\\nstruct Light {\\n ll X, Y, Z, B;\\n Light(ll x, ll y, ll z, ll b) : X(x), Y(y), Z(z), B(b) {};\\n};\\n\\nbool isin(Balloon S, ll X, ll Y, ll Z) {\\n return ((X-S.X)*(X-S.X)+(Y-S.Y)*(Y-S.Y)+(Z-S.Z)*(Z-S.Z) < S.R*S.R);\\n}\\n\\nll Dot(ll X1, ll Y1, ll Z1, ll X2, ll Y2, ll Z2) {\\n return X1*X2+Y1*Y2+Z1*Z2;\\n}\\n\\nint isCross(Balloon S, Light T) {\\n if (isin(S,T.X,T.Y,T.Z) && isin(S,0,0,0)) return false;\\n if (isin(S,T.X,T.Y,T.Z) && !isin(S,0,0,0)) return true;\\n if (!isin(S,T.X,T.Y,T.Z) && isin(S,0,0,0)) return true;\\n if (Dot(S.X,S.Y,S.Z,T.X,T.Y,T.Z) <= 0) return false;\\n if (Dot(S.X-T.X,S.Y-T.Y,S.Z-T.Z,-T.X,-T.Y,-T.Z) <= 0) return false;\\n return (S.Y*T.Z-S.Z*T.Y)*(S.Y*T.Z-S.Z*T.Y)+\\n (S.Z*T.X-S.X*T.Z)*(S.Z*T.X-S.X*T.Z)+\\n (S.X*T.Y-S.Y*T.X)*(S.X*T.Y-S.Y*T.X) <= S.R * S.R * (T.X*T.X+T.Y*T.Y+T.Z*T.Z);\\n}\\n\\nint main() {\\n while(1) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n if (N == 0) return 0;\\n vector<Balloon> S;\\n vector<Light> T;\\n rep(i,0,N) {\\n ll x, y, z, r;\\n cin >> x >> y >> z >> r;\\n S.push_back(Balloon(x,y,z,r));\\n }\\n rep(i,0,M) {\\n ll x, y, z, b;\\n cin >> x >> y >> z >> b;\\n T.push_back(Light(x,y,z,b));\\n }\\n ll EX, EY, EZ;\\n cin >> EX >> EY >> EZ;\\n rep(i,0,N) S[i].X -= EX, S[i].Y -= EY, S[i].Z -= EZ;\\n rep(i,0,M) T[i].X -= EX, T[i].Y -= EY, T[i].Z -= EZ;\\n vector<bitset<2000>> C(M);\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if(isCross(S[i],T[j])) C[j].set(i,1);\\n }\\n }\\n double ANS = 0.0;\\n rep(i,0,1<<M) {\\n double SUM = 0.0;\\n bitset<2000> B;\\n rep(j,0,M) {\\n if (i&(1<<j)) {\\n SUM += (double)T[j].B / (double)(T[j].X*T[j].X+T[j].Y*T[j].Y+T[j].Z*T[j].Z);\\n B |= C[j];\\n }\\n }\\n if (B.count() <= K) chmax(ANS,SUM);\\n }\\n printf(\\\"%.12f\\\\n\\\",ANS);\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.8354,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1331_8998178\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\n\\n#define EPS (1e-7)\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\n\\nclass Point3d {\\n public:\\n double x, y, z;\\n\\n Point3d(double x = 0, double y = 0, double z = 0) : x(x), y(y), z(z) {}\\n\\n Point3d operator+(const Point3d& a) {\\n return Point3d(x + a.x, y + a.y, z + a.z);\\n }\\n Point3d operator-(const Point3d& a) {\\n return Point3d(x - a.x, y - a.y, z - a.z);\\n }\\n Point3d operator*(const double& d) {\\n return Point3d(x * d, y * d, z * d);\\n }\\n Point3d operator/(const double& d) {\\n return Point3d(x / d, y / d, z / d);\\n }\\n\\n bool operator<(const Point3d& p) const {\\n if (!equals(x, p.x)) return x < p.x;\\n if (!equals(y, p.y)) return y < p.y;\\n if (!equals(z, p.z)) return z < p.z;\\n return false;\\n }\\n\\n bool operator==(const Point3d& p) const {\\n return equals(x, p.x) && equals(y, p.y) && equals(z, p.z);\\n }\\n};\\n\\nstruct Segment3d {\\n Point3d p[2];\\n Segment3d(Point3d p1 = Point3d(), Point3d p2 = Point3d()) {\\n p[0] = p1, p[1] = p2;\\n }\\n bool operator==(const Segment3d& seg) const {\\n return (p[0] == seg.p[0] && p[1] == seg.p[1]) || (p[0] == seg.p[1] && p[1] == seg.p[0]);\\n }\\n};\\n\\nusing Line3d = Segment3d;\\nusing Vector3d = Point3d;\\n\\nostream& operator<<(ostream& os, const Point3d& p) {\\n return os << \\\"(\\\" << p.x << \\\",\\\" << p.y << \\\",\\\" << p.z << \\\")\\\";\\n}\\n\\nostream& operator<<(ostream& os, const Segment3d& seg) {\\n return os << \\\"(\\\" << seg.p[0] << \\\",\\\" << seg.p[1] << \\\")\\\";\\n}\\n\\ndouble dot(const Point3d& a, const Point3d& b) {\\n return a.x * b.x + a.y * b.y + a.z * b.z;\\n}\\n\\nVector3d cross(const Point3d& a, const Point3d& b) {\\n return Vector3d(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);\\n}\\n\\ninline double norm(const Point3d& p) {\\n return p.x * p.x + p.y * p.y + p.z * p.z;\\n}\\n\\ninline double abs(const Point3d& p) {\\n return sqrt(norm(p));\\n}\\n\\ninline double toRad(double theta) {\\n return theta * M_PI / 180.0;\\n}\\n\\ndouble distanceLP(Line3d line, Point3d p) {\\n return abs(cross(line.p[1] - line.p[0], p - line.p[0])) / abs(line.p[1] - line.p[0]);\\n}\\n\\nPoint3d project(Segment3d seg, Point3d p) {\\n Vector3d base = seg.p[1] - seg.p[0];\\n double t = dot(p - seg.p[0], base) / norm(base);\\n return seg.p[0] + base * t;\\n}\\n\\nPoint3d reflect(Segment3d seg, Point3d p) {\\n return p + (project(seg, p) - p) * 2.0;\\n}\\n\\nbool on_line3d(Line3d line, Point3d p) {\\n return equals(abs(cross(line.p[1] - p, line.p[0] - p)), 0);\\n}\\n\\nbool on_segment3d(Segment3d seg, Point3d p) {\\n if (!on_line3d(seg, p)) return false;\\n double dist[3] = {abs(seg.p[1] - seg.p[0]), abs(p - seg.p[0]), abs(p - seg.p[1])};\\n return on_line3d(seg, p) && equals(dist[0], dist[1] + dist[2]);\\n}\\n\\ndouble distanceSP(Segment3d seg, Point3d p) {\\n Point3d r = project(seg, p);\\n if (on_segment3d(seg, r)) return abs(p - r);\\n return min(abs(seg.p[0] - p), abs(seg.p[1] - p));\\n}\\n\\ndouble solve(int N, int M, int R) {\\n vector<Point3d> Sp(N);\\n vector<double> Sr(N);\\n for(int i : rep(N)) Sp[i].x = in(), Sp[i].y = in(), Sp[i].z = in(), Sr[i] = in();\\n vector<Point3d> Tp(M);\\n vector<double> Tb(M);\\n for(int i : rep(M)) Tp[i].x = in(), Tp[i].y = in(), Tp[i].z = in(), Tb[i] = in();\\n Point3d E;\\n E.x = in(), E.y = in(), E.z = in();\\n\\n const int MAX_N = 2000;\\n vector<bitset<MAX_N>> erase(M);\\n for(int i : rep(M)) {\\n for(int j : rep(N)) {\\n bool touch = [&] {\\n if(abs(E - Sp[j]) <= Sr[j] and abs(Tp[i] - Sp[j]) <= Sr[j]) return false;\\n return distanceSP(Segment3d(E, Tp[i]), Sp[j]) <= Sr[j];\\n }();\\n\\n erase[i][j] = touch;\\n }\\n }\\n\\n double ans = 0;\\n for(int set : rep(1 << M)) {\\n bitset<MAX_N> need;\\n double score = 0;\\n for(int i : rep(M)) if(set & (1 << i)) {\\n need |= erase[i];\\n score += Tb[i] / norm(Tp[i] - E);\\n }\\n if(need.count() <= R) chmax(ans, score);\\n }\\n return ans;\\n}\\n\\nint main() {\\n while(true) {\\n int N = in(), M = in(), R = in();\\n if(make_tuple(N, M, R) == make_tuple(0, 0, 0)) return 0;\\n printer::precision(20);\\n print(solve(N, M, R));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.8052,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1331_8492718\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nstruct P {\\n double x, y, z;\\n P() {}\\n P(double x, double y, double z) : x(x), y(y), z(z) {}\\n};\\n\\nP operator+(P p, P q) {\\n return P(p.x + q.x, p.y + q.y, p.z + q.z);\\n}\\n\\nP operator-(P p, P q) {\\n return P(p.x - q.x, p.y - q.y, p.z - q.z);\\n}\\n\\ndouble p2(double x) {\\n return x * x;\\n}\\n\\ndouble dist(P p, P q) {\\n return p2(p.x - q.x) + p2(p.y - q.y) + p2(p.z - q.z);\\n}\\n\\ndouble dot(P p, P q) {\\n return p.x * q.x + p.y * q.y + p.z * q.z;\\n}\\n\\nP proj(P a, P b, P p) {\\n P dap = p - a, dab = b - a;\\n double t = dot(dap, dab) / dist(dab, P(0, 0, 0));\\n return a + P(dab.x * t, dab.y * t, dab.z * t);\\n}\\n\\ndouble dist(P a, P b, P p) {\\n P h = proj(a, b, p);\\n if (dot(h - a, b - a) < 0)\\n return dist(a, p);\\n if (dot(h - b, a - b) < 0)\\n return dist(b, p);\\n return dist(h, p);\\n}\\n\\nint main() {\\n while (1) {\\n int n, m, r;\\n cin >> n >> m >> r;\\n if (!n)\\n break;\\n vector<int> xs(n), ys(n), zs(n), rs(n);\\n rep(i, n) cin >> xs[i] >> ys[i] >> zs[i] >> rs[i];\\n vector<P> ps(n);\\n rep(i, n) ps[i] = P(xs[i], ys[i], zs[i]);\\n vector<int> xt(m), yt(m), zt(m), bt(m);\\n rep(i, m) cin >> xt[i] >> yt[i] >> zt[i] >> bt[i];\\n vector<P> pt(m);\\n rep(i, m) pt[i] = P(xt[i], yt[i], zt[i]);\\n int x0, y0, z0;\\n cin >> x0 >> y0 >> z0;\\n P p0(x0, y0, z0);\\n vector<vector<bool>> inter(n, vector<bool>(m));\\n rep(i, n) rep(j, m) {\\n double d0 = dist(p0, ps[i]), dj = dist(pt[j], ps[i]);\\n if (max(d0, dj) < p2(rs[i]))\\n inter[i][j] = false;\\n else inter[i][j] = (dist(p0, pt[j], ps[i]) < p2(rs[i]));\\n }\\n vector<int> ng(n, 0);\\n rep(i, n) rep(j, m) if (inter[i][j]) ng[i] |= 1 << j;\\n double ans = 0;\\n rep(t, 1 << m) {\\n int cnt = 0;\\n rep(i, n) if (ng[i] & t) cnt++;\\n if (cnt > r)\\n continue;\\n double val = 0;\\n rep(i, m) if (t >> i & 1) val += bt[i] / dist(p0, pt[i]);\\n chmax(ans, val);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.8734,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1331_8492601\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nstruct P {\\n double x, y, z;\\n P() {}\\n P(double x, double y, double z) : x(x), y(y), z(z) {}\\n};\\n\\nP operator+(P p, P q) {\\n return P(p.x + q.x, p.y + q.y, p.z + q.z);\\n}\\n\\nP operator-(P p, P q) {\\n return P(p.x - q.x, p.y - q.y, p.z - q.z);\\n}\\n\\ndouble p2(double x) {\\n return x * x;\\n}\\n\\ndouble dist(P p, P q) {\\n return p2(p.x - q.x) + p2(p.y - q.y) + p2(p.z - q.z);\\n}\\n\\ndouble dot(P p, P q) {\\n return p.x * q.x + p.y * q.y + p.z * q.z;\\n}\\n\\nP proj(P a, P b, P p) {\\n P dap = p - a, dab = b - a;\\n double t = dot(dap, dab) / dist(dab, P(0, 0, 0));\\n return a + P(dab.x * t, dab.y * t, dab.z * t);\\n}\\n\\ndouble dist(P a, P b, P p) {\\n P h = proj(a, b, p);\\n if (dot(h - a, b - a) < 0)\\n return dist(a, p);\\n if (dot(h - b, a - b) < 0)\\n return dist(b, p);\\n return dist(h, p);\\n}\\n\\nint main() {\\n while (1) {\\n int n, m, r;\\n cin >> n >> m >> r;\\n if (!n)\\n break;\\n vector<int> xs(n), ys(n), zs(n), rs(n);\\n rep(i, n) cin >> xs[i] >> ys[i] >> zs[i] >> rs[i];\\n vector<P> ps(n);\\n rep(i, n) ps[i] = P(xs[i], ys[i], zs[i]);\\n vector<int> xt(m), yt(m), zt(m), bt(m);\\n rep(i, m) cin >> xt[i] >> yt[i] >> zt[i] >> bt[i];\\n vector<P> pt(m);\\n rep(i, m) pt[i] = P(xt[i], yt[i], zt[i]);\\n int x0, y0, z0;\\n cin >> x0 >> y0 >> z0;\\n P p0(x0, y0, z0);\\n vector<vector<bool>> inter(n, vector<bool>(m));\\n rep(i, n) rep(j, m) {\\n double d0 = dist(p0, ps[i]), dj = dist(pt[j], ps[i]);\\n if (max(d0, dj) < p2(rs[i]))\\n inter[i][j] = false;\\n else inter[i][j] = (dist(p0, pt[j], ps[i]) < p2(rs[i]));\\n }\\n double ans = 0;\\n rep(t, 1 << m) {\\n vector<int> f(n, 0);\\n double val = 0;\\n rep(i, m) {\\n if (t >> i & 1) {\\n rep(j, n) if (inter[j][i]) f[j] = 1;\\n val += bt[i] / dist(p0, pt[i]);\\n }\\n }\\n if (accumulate(all(f), 0) > r)\\n continue;\\n chmax(ans, val);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7330,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -1.8987,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1331_7980272\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define foa(c, v) for (auto &c : v)\\n#define rep(i, n) for (int i = 0; i < int(n); i++)\\n#define all(v) v.begin(), v.end()\\n#define sz(v) int(size(v))\\ntemplate <class T>\\nbool chmin(T &a, T b)\\n{\\n return a > b ? (a = b, 1) : 0;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, T b)\\n{\\n return a < b ? (a = b, 1) : 0;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &vec)\\n{\\n os << \\\"{ \\\";\\n foa(c, vec)\\n {\\n os << c << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<vector<T>> &vv)\\n{\\n os << \\\"{ \\\";\\n foa(v, vv)\\n {\\n os << \\\"\\\\n\\\\t\\\" << v << \\\", \\\";\\n }\\n os << \\\"\\\\n}\\\";\\n return os;\\n}\\n\\n#ifdef LOCAL\\n#define debug(x) cerr << __LINE__ << \\\", \\\" << #x << \\\": \\\" << x << endl;\\n#else\\n#define debug(x) void(0)\\n#endif\\n\\nusing R = long double;\\nconstexpr int dim = 3;\\nusing point = array<R, dim>;\\n\\npoint operator+(point a, point b)\\n{\\n point c;\\n rep(i, dim) c[i] = a[i] + b[i];\\n return c;\\n}\\n\\npoint operator-(point a, point b)\\n{\\n point c;\\n rep(i, dim) c[i] = a[i] - b[i];\\n return c;\\n}\\n\\nR dot(point a, point b)\\n{\\n R res = 0;\\n rep(i, dim) res += a[i] * b[i];\\n return res;\\n}\\n\\nR dsq(point a, point b)\\n{\\n R res = 0;\\n rep(i, dim) res += pow(a[i] - b[i], 2);\\n return res;\\n}\\n\\nR distance(point a, point b)\\n{\\n return sqrt(dsq(a, b));\\n}\\n\\nR dist_from_center(point a)\\n{\\n R res = 0;\\n rep(i, dim) res += pow(a[i], 2);\\n return sqrt(res);\\n}\\n\\nR angle(point a, point b, point c)\\n{\\n a = a - b;\\n c = c - b;\\n return acos(dot(a, c) / (dist_from_center(a) * dist_from_center(c)));\\n}\\n\\nistream &operator>>(istream &is, point &c)\\n{\\n rep(i, dim) is >> c[i];\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const point &c)\\n{\\n os << \\\"(\\\";\\n rep(i, dim) os << c[i] << \\\", \\\";\\n os << \\\")\\\";\\n return os;\\n}\\n\\nusing points = vector<point>;\\n\\nint bnum;\\nvoid solve()\\n{\\n int lnum, remove_limit;\\n cin >> lnum >> remove_limit;\\n\\n vector<point> balloons(bnum), lights(lnum);\\n vector<R> radii(bnum), bright(lnum);\\n\\n rep(i, bnum)\\n {\\n cin >> balloons[i];\\n cin >> radii[i];\\n }\\n\\n rep(j, lnum)\\n {\\n cin >> lights[j] >> bright[j];\\n }\\n\\n point goal;\\n cin >> goal;\\n\\n debug(balloons);\\n debug(goal);\\n\\n rep(j, lnum)\\n bright[j] /= dsq(goal, lights[j]);\\n\\n vector<bitset<2123>> barricade(lnum);\\n\\n auto inside = [&](int bid, point p) -> bool\\n {\\n return distance(balloons[bid], p) < radii[bid];\\n };\\n\\n auto absorbed = [&](int bid, int lid) -> bool\\n {\\n const point &light = lights[lid], bcenter = balloons[bid];\\n R dl = distance(goal, light), db = distance(goal, bcenter), r = radii[bid];\\n\\n if (inside(bid, goal))\\n return !inside(bid, light);\\n\\n if (inside(bid, light))\\n return true;\\n\\n assert(db > r);\\n R tang = sqrt(db * db - r * r);\\n\\n if (tang > dl)\\n return false;\\n\\n return angle(light, goal, bcenter) < asin(r / db);\\n };\\n\\n rep(bid, bnum)\\n {\\n rep(lid, lnum)\\n {\\n if (absorbed(bid, lid))\\n {\\n barricade[lid].set(bid, 1);\\n }\\n }\\n }\\n\\n R ans = 0;\\n\\n rep(bits, (1 << lnum))\\n {\\n bitset<2123> b;\\n R res = 0;\\n rep(lid, lnum) if ((1 << lid) & bits)\\n {\\n b |= barricade[lid];\\n res += bright[lid];\\n }\\n if (int(b.count()) > remove_limit)\\n continue;\\n chmax(ans, res);\\n }\\n\\n cout << ans << endl;\\n}\\n\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (cin >> bnum && bnum)\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -1.0092,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1331_7237186\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ld = long double;\\nusing point = tuple<ld,ld,ld>;\\n\\nbool cross(point balloon, ld radius, point light) {\\n auto [lx, ly, lz] = light;\\n auto [bx, by, bz] = balloon;\\n\\n if(hypot(bx, by, bz) <= radius) {\\n return hypot(lx - bx, ly - by, lz - bz) > radius;\\n }\\n\\n ld low = 0.0l;\\n ld high = 1.0l;\\n\\n while(high - low >= 1e-7) {\\n ld c1 = (low * 2.0l + high) / 3.0l;\\n ld c2 = (low + high * 2.0l) / 3.0l;\\n\\n ld x1 = c1 * lx, y1 = c1 * ly, z1 = c1 * lz;\\n ld x2 = c2 * lx, y2 = c2 * ly, z2 = c2 * lz;\\n\\n ld f1 = hypot(x1 - bx, y1 - by, z1 - bz);\\n ld f2 = hypot(x2 - bx, y2 - by, z2 - bz);\\n\\n if(f1 > f2) low = c1;\\n else high = c2;\\n }\\n\\n ld x = low * lx, y = low * ly, z = low * lz;\\n return hypot(x - bx, y - by, z - bz) <= radius;\\n}\\n\\nvoid solve(int N, int M, int R) {\\n point balloons[N];\\n ld radiuses[N];\\n\\n for (int i = 0; i < N; i++) {\\n ld x,y,z;\\n cin >> x >> y >> z >> radiuses[i];\\n balloons[i] = {x,y,z};\\n }\\n\\n point lights[N];\\n ld T[N];\\n for (int i = 0; i < M; i++) {\\n ld x,y,z;\\n cin >> x >> y >> z >> T[i];\\n lights[i] = {x,y,z};\\n }\\n\\n ld Ex, Ey, Ez;\\n cin >> Ex >> Ey >> Ez;\\n for (int i = 0; i < N; i++) {\\n auto [x, y, z] = balloons[i];\\n balloons[i] = {x - Ex, y - Ey, z - Ez};\\n }\\n for (int i = 0; i < M; i++) {\\n auto [x, y, z] = lights[i];\\n lights[i] = {x - Ex, y - Ey, z - Ez};\\n }\\n\\n bitset<2000> obstacles[M];\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < M; j++) {\\n if(cross(balloons[i], radiuses[i], lights[j])) {\\n obstacles[j].set(i, true);\\n }\\n }\\n }\\n\\n ld ans = numeric_limits<ld>::min();\\n\\n for (int bits = 0; bits < (1 << M); bits++) {\\n bitset<2000> obs;\\n for (int i = 0; i < M; i++) {\\n if(bits & (1 << i)) obs |= obstacles[i];\\n }\\n if(obs.count() > R) continue;\\n\\n ld score = 0;\\n\\n for (int i = 0; i < M; i++) {\\n if(bits & (1 << i)) {\\n auto [x, y, z] = lights[i];\\n score += T[i] / powl(hypot(x, y, z), 2.0l);\\n }\\n }\\n\\n ans = max(ans, score);\\n }\\n\\n cout << fixed << setprecision(10) << ans << endl;\\n}\\n\\nint main() {\\n int N, M, R;\\n\\n while(true) {\\n cin >> N >> M >> R;\\n if(N == 0 && M == 0 && R == 0) break;\\n solve(N, M, R);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -1.0495,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1331_6581220\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\nusing T = double;\\nconstexpr T eps = 1e-12;\\ninline bool eq(T a, T b) { return std::abs(a - b) < eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a < b + eps; }\\n\\nstruct Vec {\\n T x, y, z;\\n Vec() = default;\\n constexpr Vec(T x, T y, T z) : x(x), y(y), z(z) {}\\n constexpr Vec& operator+=(const Vec& r) { x += r.x; y += r.y; z += r.z; return *this; }\\n constexpr Vec& operator-=(const Vec& r) { x -= r.x; y -= r.y; z -= r.z; return *this; }\\n constexpr Vec& operator*=(T r) { x *= r; y *= r; z *= r; return *this; }\\n constexpr Vec& operator/=(T r) { x /= r; y /= r; z /= r; return *this; }\\n constexpr Vec operator-() const { return Vec(-x, -y, -z); }\\n constexpr Vec operator+(const Vec& r) const { return Vec(*this) += r; }\\n constexpr Vec operator-(const Vec& r) const { return Vec(*this) -= r; }\\n constexpr Vec operator*(T r) const { return Vec(*this) *= r; }\\n constexpr Vec operator/(T r) const { return Vec(*this) /= r; }\\n friend constexpr Vec operator*(T r, const Vec& v) { return v * r; }\\n};\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y, z;\\n is >> x >> y >> z;\\n p = {x, y, z};\\n return is;\\n}\\n\\nT dot(const Vec& a, const Vec& b) {\\n return a.x*b.x + a.y*b.y + a.z*b.z;\\n}\\n\\nVec cross(const Vec& a, const Vec& b) {\\n return Vec(a.y*b.z-a.z*b.y, a.z*b.x-a.x*b.z, a.x*b.y-a.y*b.x);\\n}\\n\\nnamespace std {\\nT norm(const Vec& a) { return dot(a, a); }\\nT abs(const Vec& a) { return std::sqrt(std::norm(a)); }\\n}\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nT dist(const Segment& s, const Vec& p) {\\n if (lt(dot(p - s.p1, s.dir()), 0)) return std::abs(p - s.p1);\\n if (lt(dot(p - s.p2, -s.dir()), 0)) return std::abs(p - s.p2);\\n return std::abs(cross(p - s.p1, s.dir())) / std::abs(s.dir());\\n}\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int N, M, R;\\n cin >> N >> M >> R;\\n if (N == 0 && M == 0 && R == 0) break;\\n vector<Vec> S(N), T(M);\\n vector<double> r(N), b(M);\\n rep(i,0,N) cin >> S[i] >> r[i];\\n rep(i,0,M) cin >> T[i] >> b[i];\\n Vec E;\\n cin >> E;\\n vector<double> score(M);\\n rep(j,0,M) score[j] = b[j] / norm(T[j] - E);\\n vector<int> interrupt(N);\\n rep(i,0,N) rep(j,0,M) {\\n if (lt(abs(E-S[i]), r[i]) && lt(abs(T[j]-S[i]), r[i])) continue;\\n if (lt(dist(Segment(E, T[j]), S[i]), r[i])) {\\n interrupt[i] |= 1<<j;\\n }\\n }\\n double ans = 0;\\n for (int B = 0; B < 1 << M; ++B) {\\n int cnt = 0;\\n rep(i,0,N) {\\n if (interrupt[i] & B) ++cnt;\\n }\\n if (cnt > R) continue;\\n double c = 0;\\n rep(j,0,M) if (B>>j&1) c += score[j];\\n chmax(ans, c);\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.8173,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1331_6391174\",\n \"code_snippet\": \"#include <algorithm>\\n#include<bits/stdc++.h>\\n#include <new>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing vvvvector = vvector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nstring twoChar(int n){\\n if(n<10)return \\\"0\\\" + to_string(n);\\n return to_string(n);\\n}\\n\\nstring toString(int h,int m,int s){\\n return twoChar(h)+\\\":\\\"+twoChar(m)+\\\":\\\"+twoChar(s);\\n}\\n\\nstring toString(vector<int> line){\\n return toString(line[0],line[1],line[2]);\\n}\\n\\nvector<int> toTimes(int n){\\n return {n/3600,n%3600/60,n%60};\\n}\\n\\nvector<int> expectedTimes(vector<int> times){\\n set<int> expected;\\n sort(all(times));\\n do{\\n rep(rotate,60){\\n vector<int> adds;\\n foreach(i,times)adds.emplace_back((i+rotate)%60);\\n int hour = adds[0];\\n int minutes = adds[1];\\n int secs = adds[2];\\n if(hour%5!=minutes/12)continue;\\n expected.emplace(hour/5*3600+minutes*60+secs);\\n }\\n }while(next_permutation(all(times)));\\n vector<int> res(all(expected));\\n return res;\\n}\\n\\nstring func(int n){\\n vvector<int> line(n,vector<int>(3));\\n foreach(i,line)foreach(j,i)j=in();\\n vector<queue<int>> oks;\\n foreach(i,line){\\n queue<int> adds;\\n foreach(j,expectedTimes(i)){\\n adds.emplace(j);\\n }\\n oks.emplace_back(adds);\\n }\\n int mint = INF;\\n int maxt = 0;\\n int dist = INF;\\n while(true){\\n {\\n bool flag = false;\\n foreach(i,oks)if(i.empty())flag=true;\\n if(flag)break;\\n }\\n int mins = INF;\\n int maxs = 0;\\n foreach(i,oks){\\n chmax(maxs,i.front());\\n chmin(mins,i.front());\\n }\\n if(chmin(dist,maxs-mins)){\\n mint = mins;\\n maxt = maxs;\\n }\\n foreach(i,oks)if(i.front()==mins)i.pop();\\n }\\n return toString(toTimes(mint)) + \\\" \\\" + toString(toTimes(maxt));\\n}\\n\\n\\ntemplate<class t>\\nclass Vector3{\\n\\tpublic:\\n\\t\\tt x;\\n\\t\\tt y;\\n\\t\\tt z;\\n\\t\\tVector3():x(0), y(0), z(0){}\\n\\t\\tVector3(t a, t b, t c):x(a), y(b), z(c){}\\n\\t\\tVector3(const Vector3 &o):x(o.x), y(o.y), z(o.z){}\\n\\n\\t\\tVector3& operator+=(Vector3 o){x+=o.x;y+=o.y;z+=o.z;return *this;}\\n\\t\\tVector3& operator-=(Vector3 o){x-=o.x;y-=o.y;z-=o.z;return *this;}\\n\\t\\tVector3& operator*=(t o){x*=o;y*=o;z*=o;return *this;}\\n\\t\\tVector3& operator/=(t o){x/=o;y/=o;z/=o;return *this;}\\n\\n\\t\\tVector3 operator+(Vector3 o){return Vector3(*this)+=o;}\\n\\t\\tVector3 operator-(Vector3 o){return Vector3(*this)-=o;}\\n\\t\\tVector3 operator*(t o){return Vector3(*this)*=o;}\\n\\t\\tVector3 operator/(t o){return Vector3(*this)/=o;}\\n};\\n\\ntemplate<class t>\\ndouble abs(Vector3<t> x){\\n\\treturn sqrt(x.x * x.x + x.y * x.y + x.z * x.z);\\n}\\n\\ntemplate<class t>\\ndouble dot(Vector3<t> x, Vector3<t> y){\\n\\treturn x.x * y.x + x.y * y.y + x.z * y.z;\\n}\\n\\ntemplate<class t>\\nVector3<t> cross(Vector3<t> x, Vector3<t> y){\\n\\tt rx = x.y * y.z - x.z * y.y;\\n\\tt ry = x.z * y.x - x.x * y.z;\\n\\tt rz = x.x * y.y - x.y * y.x;\\n\\treturn Vector3<t>(rx, ry, rz); \\n}\\nusing vector3= Vector3<double>;\\n\\nclass Sphere{\\npublic:\\n vector3 p;\\n double r;\\n Sphere(vector3 p,double r):p(p),r(r){}\\n};\\n\\nclass Light{\\npublic:\\n vector3 p;\\n double i;\\n Light(vector3 p,double i):p(p),i(i){}\\n};\\n\\nbool isIn(Sphere s,vector3 p){\\n return abs(s.p - p) < s.r;\\n}\\n\\nbool isTouch(Sphere s,vector3 from,vector3 to){\\n if(isIn(s,from) and isIn(s,to))return false;\\n vector3 v1 = to - from;\\n vector3 v2 = s.p - from;\\n vector3 n = v1 / abs(v1);\\n double k = dot(n,v2);\\n if(0 < k){\\n v2 = v2 - n * min(k,abs(v1));\\n }\\n return abs(v2) < s.r;\\n}\\n\\ndouble func(int n,int m,int r){\\n vector<Sphere> baloons;\\n vector<Light> lights;\\n rep(_,n){\\n int x = in();\\n int y = in();\\n int z = in();\\n int r = in();\\n baloons.emplace_back(vector3(x,y,z),r);\\n }\\n rep(_,m){\\n int x = in();\\n int y = in();\\n int z = in();\\n int i = in();\\n lights.emplace_back(vector3(x,y,z),i);\\n }\\n vector3 object = (lambda(vector3){\\n int x = in();\\n int y = in();\\n int z = in();\\n return vector3(x,y,z);\\n })();\\n vvector<int> brokens;\\n foreach(light,lights){\\n vector<int> broken;\\n foreach(baloon,baloons){\\n if(isTouch(baloon,object,light.p)){\\n broken.emplace_back(1);\\n }else{\\n broken.emplace_back(0);\\n }\\n }\\n brokens.emplace_back(broken);\\n }\\n\\n vector<int> broken(n,0);\\n\\n method(rec,double,int p,double sum){\\n if(p==m){\\n int cnt = 0;\\n foreach(i,broken)cnt += i != 0;\\n if(cnt > r)return 0;\\n return sum;\\n }\\n double res = 0;\\n chmax(res,rec(p+1,sum));\\n rep(i,n){\\n broken[i] += brokens[p][i];\\n }\\n chmax(res,rec(p+1,sum + lights[p].i / pow(abs(object-lights[p].p),2)));\\n rep(i,n){\\n broken[i] -= brokens[p][i];\\n }\\n return res;\\n };\\n return rec(0,0);\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(true){\\n int n = in();\\n int m = in();\\n int r = in();\\n if(n==0)break;\\n println(func(n,m,r));\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 3660,\n \"score_of_the_acc\": -0.9884,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1331_6367548\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\n#define eps 1e-8L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\ntypedef long double ld;\\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\\n#define ALL(x) (x).begin(), (x).end()\\n\\n#define int long long\\nld dist(tuple<ld, ld, ld> a, tuple<ld, ld, ld> b)\\n{\\n return pow(get<0>(a) - get<0>(b), 2.0) + pow(get<1>(a) - get<1>(b), 2.0) + pow(get<2>(a) - get<2>(b), 2.0);\\n}\\n\\nvoid solve()\\n{\\n int n, m, r;\\n cin >> n >> m >> r;\\n if (n == 0)\\n exit(0);\\n vector<pair<tuple<ld, ld, ld>, ld>> Balloon;\\n REP(i, n)\\n {\\n ld a, b, c, d;\\n cin >> a >> b >> c >> d;\\n Balloon.push_back({{a, b, c}, d});\\n }\\n vector<pair<tuple<ld, ld, ld>, ld>> lights;\\n REP(i, m)\\n {\\n ld a, b, c, d;\\n cin >> a >> b >> c >> d;\\n lights.push_back({{a, b, c}, d});\\n }\\n tuple<ld, ld, ld> e;\\n cin >> get<0>(e) >> get<1>(e) >> get<2>(e);\\n\\n vector<int> light_target(n, 0);\\n REP(i, m)\\n {\\n lights[i].second /= dist(e, lights[i].first);\\n REP(q, n)\\n {\\n if (max(dist(e, Balloon[q].first), dist(lights[i].first, Balloon[q].first)) <= Balloon[q].second * Balloon[q].second + eps)\\n {\\n continue;\\n }\\n ld bot = 0;\\n ld top = 1;\\n ld now_min_dist = 1e18;\\n REP(t, 100)\\n {\\n ld botter = (bot + bot + top) / 3.0;\\n ld topper = (bot + top + top) / 3.0;\\n tuple<ld, ld, ld> target = e;\\n get<0>(target) *= botter;\\n get<1>(target) *= botter;\\n get<2>(target) *= botter;\\n\\n get<0>(target) += (1.0L - botter) * get<0>(lights[i].first);\\n get<1>(target) += (1.0L - botter) * get<1>(lights[i].first);\\n get<2>(target) += (1.0L - botter) * get<2>(lights[i].first);\\n\\n ld dis[2] = {};\\n dis[0] = dist(target, Balloon[q].first);\\n\\n target = e;\\n get<0>(target) *= topper;\\n get<1>(target) *= topper;\\n get<2>(target) *= topper;\\n\\n get<0>(target) += (1.0L - topper) * get<0>(lights[i].first);\\n get<1>(target) += (1.0L - topper) * get<1>(lights[i].first);\\n get<2>(target) += (1.0L - topper) * get<2>(lights[i].first);\\n\\n dis[1] = dist(target, Balloon[q].first);\\n if (dis[0] < dis[1])\\n {\\n top = topper;\\n }\\n else\\n {\\n bot = botter;\\n }\\n\\n now_min_dist = min({now_min_dist, dis[0], dis[1]});\\n }\\n if (now_min_dist <= Balloon[q].second * Balloon[q].second + eps)\\n {\\n light_target[q] |= (1 << i);\\n }\\n }\\n }\\n ld ans = 0;\\n REP(i, (1 << m))\\n {\\n ld now = 0;\\n int cnt = 0;\\n REP(q, m)\\n {\\n if ((1 << q) & i)\\n now += lights[q].second;\\n }\\n REP(q, n)\\n {\\n if (i & light_target[q])\\n {\\n cnt++;\\n }\\n }\\n if (cnt <= r)\\n {\\n ans = max(ans, now);\\n }\\n }\\n cout << ans << endl;\\n}\\n#undef int\\n\\n// generated by oj-template v4.7.2\\n// (https://github.com/online-judge-tools/template-generator)\\nint main()\\n{\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 10000;\\n // cin >> t; // comment out if solving multi testcase\\n for (int testCase = 1; testCase <= t; ++testCase)\\n {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.9625,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1331_6024869\",\n \"code_snippet\": \"#include<iostream>\\n#include<ostream>\\n#include<cmath>\\n#include<cstdio>\\n#include<cassert>\\n#include<bitset>\\n\\nusing namespace std;\\n\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nclass Point3d{\\npublic:\\n double x,y,z;\\n \\n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\\n \\n Point3d operator + (const Point3d& a){\\n return Point3d(x+a.x,y+a.y,z+a.z);\\n }\\n Point3d operator - (const Point3d& a){\\n return Point3d(x-a.x,y-a.y,z-a.z);\\n }\\n Point3d operator * (const double& d){\\n return Point3d(x*d,y*d,z*d);\\n }\\n Point3d operator / (const double& d){\\n return Point3d(x/d,y/d,z/d);\\n }\\n \\n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\\n \\n bool operator == (const Point3d& p)const{\\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\\n }\\n \\n};\\n \\nstruct Segment3d{\\n Point3d p[2];\\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\\n p[0] = p1, p[1] = p2;\\n }\\n bool operator == (const Segment3d& seg)const{\\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\\n }\\n};\\n \\ntypedef Point3d Vector3d;\\ntypedef Segment3d Line3d;\\n \\nostream& operator << (ostream& os,const Point3d& p){\\n return os << \\\"(\\\" << p.x << \\\",\\\" << p.y << \\\",\\\" << p.z << \\\")\\\";\\n}\\n \\nostream& operator << (ostream& os,const Segment3d& seg){\\n return os << \\\"(\\\" << seg.p[0] << \\\",\\\" << seg.p[1] << \\\")\\\";\\n}\\n \\ndouble dot(const Point3d& a,const Point3d& b){\\n return a.x*b.x + a.y*b.y + a.z*b.z;\\n}\\n \\nVector3d cross(const Point3d& a,const Point3d& b){\\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\\n}\\n \\ninline double norm(const Point3d &p){\\n return p.x*p.x + p.y*p.y + p.z*p.z;\\n}\\n \\ninline double abs(const Point3d &p){\\n return sqrt(norm(p));\\n}\\n \\ninline double toRad(double theta){\\n return theta * M_PI / 180.0;\\n}\\n\\ndouble distanceLP(Line3d line,Point3d p){\\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\\n}\\n \\nPoint3d project(Segment3d seg,Point3d p){\\n Vector3d base = seg.p[1] - seg.p[0];\\n double t = dot(p-seg.p[0],base) / norm(base);\\n return seg.p[0] + base * t;\\n}\\n \\nPoint3d reflect(Segment3d seg,Point3d p){\\n return p + (project(seg,p)-p) * 2.0;\\n}\\n\\nbool on_line3d(Line3d line,Point3d p){\\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\\n}\\n \\nbool on_segment3d(Segment3d seg,Point3d p){\\n if( !on_line3d(seg,p) ) return false;\\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \\n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\\n}\\n\\ndouble distanceSP(Segment3d seg,Point3d p){\\n Point3d r = project(seg,p);\\n if( on_segment3d(seg,r) ) return abs(p-r);\\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\\n}\\n\\nusing namespace std;\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\n\\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\\n\\nclass Point3DwithWeight {\\npublic:\\n Point3d p;\\n double weight;\\n};\\n\\nconst int MAX_N = 2100;\\nconst int MAX_M = 20;\\nint N,M,R;\\nbitset<2100> remove_cost[MAX_M];\\nPoint3DwithWeight S[MAX_N],T[MAX_M];\\nPoint3DwithWeight E;\\n\\nint getType(double a,double b){\\n if( LT(a,b) ) return -1;\\n return 1;\\n}\\n\\nvoid init(){\\n rep(i,M) remove_cost[i] = 0; \\n rep(i,M) {\\n rep(j,N){\\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\\n if( type[0] == type[1] && type[0] == -1 ) continue;\\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\\n }\\n }\\n}\\n\\n#define pow2(a) ((a)*(a))\\nvoid compute(){\\n init();\\n double maxi = 0;\\n rep(bitmask,(1<<M)){\\n bitset<2100> BIT(0);\\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\\n if( BIT.count() <= R ) {\\n double cost = 0;\\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\\n maxi = max(maxi,cost);\\n }\\n }\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n}\\n\\nint main(){\\n while( cin >> N >> M >> R, N|M|R ){\\n assert( N <= 2000);\\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\\n cin >> E.p.x >> E.p.y >> E.p.z;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.3426,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1331_6024788\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nclass Point3d{\\npublic:\\n double x,y,z;\\n \\n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\\n \\n Point3d operator + (const Point3d& a){\\n return Point3d(x+a.x,y+a.y,z+a.z);\\n }\\n Point3d operator - (const Point3d& a){\\n return Point3d(x-a.x,y-a.y,z-a.z);\\n }\\n Point3d operator * (const double& d){\\n return Point3d(x*d,y*d,z*d);\\n }\\n Point3d operator / (const double& d){\\n return Point3d(x/d,y/d,z/d);\\n }\\n \\n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\\n \\n bool operator == (const Point3d& p)const{\\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\\n }\\n \\n};\\n \\nstruct Segment3d{\\n Point3d p[2];\\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\\n p[0] = p1, p[1] = p2;\\n }\\n bool operator == (const Segment3d& seg)const{\\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\\n }\\n};\\n \\ntypedef Point3d Vector3d;\\ntypedef Segment3d Line3d;\\n \\nostream& operator << (ostream& os,const Point3d& p){\\n return os << \\\"(\\\" << p.x << \\\",\\\" << p.y << \\\",\\\" << p.z << \\\")\\\";\\n}\\n \\nostream& operator << (ostream& os,const Segment3d& seg){\\n return os << \\\"(\\\" << seg.p[0] << \\\",\\\" << seg.p[1] << \\\")\\\";\\n}\\n \\ndouble dot(const Point3d& a,const Point3d& b){\\n return a.x*b.x + a.y*b.y + a.z*b.z;\\n}\\n \\nVector3d cross(const Point3d& a,const Point3d& b){\\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\\n}\\n \\ninline double norm(const Point3d &p){\\n return p.x*p.x + p.y*p.y + p.z*p.z;\\n}\\n \\ninline double abs(const Point3d &p){\\n return sqrt(norm(p));\\n}\\n \\ninline double toRad(double theta){\\n return theta * M_PI / 180.0;\\n}\\n\\ndouble distanceLP(Line3d line,Point3d p){\\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\\n}\\n \\nPoint3d project(Segment3d seg,Point3d p){\\n Vector3d base = seg.p[1] - seg.p[0];\\n double t = dot(p-seg.p[0],base) / norm(base);\\n return seg.p[0] + base * t;\\n}\\n \\nPoint3d reflect(Segment3d seg,Point3d p){\\n return p + (project(seg,p)-p) * 2.0;\\n}\\n\\nbool on_line3d(Line3d line,Point3d p){\\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\\n}\\n \\nbool on_segment3d(Segment3d seg,Point3d p){\\n if( !on_line3d(seg,p) ) return false;\\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \\n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\\n}\\n\\ndouble distanceSP(Segment3d seg,Point3d p){\\n Point3d r = project(seg,p);\\n if( on_segment3d(seg,r) ) return abs(p-r);\\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\\n}\\n\\nusing namespace std;\\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\n\\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\\n\\nclass Point3DwithWeight {\\npublic:\\n Point3d p;\\n double weight;\\n};\\n\\nconst int MAX_N = 2100;\\nconst int MAX_M = 20;\\nint N,M,R;\\nbitset<2100> remove_cost[MAX_M];\\nPoint3DwithWeight S[MAX_N],T[MAX_M];\\nPoint3DwithWeight E;\\n\\nint getType(double a,double b){\\n if( LT(a,b) ) return -1;\\n return 1;\\n}\\n\\nvoid init(){\\n rep(i,M) remove_cost[i] = 0; \\n rep(i,M) {\\n rep(j,N){\\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\\n if( type[0] == type[1] && type[0] == -1 ) continue;\\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\\n }\\n }\\n}\\n\\n#define pow2(a) ((a)*(a))\\nvoid compute(){\\n init();\\n double maxi = 0;\\n rep(bitmask,(1<<M)){\\n bitset<2100> BIT(0);\\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\\n if( BIT.count() <= R ) {\\n double cost = 0;\\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\\n maxi = max(maxi,cost);\\n }\\n }\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n}\\n\\nint main(){\\n while( cin >> N >> M >> R, N|M|R ){\\n assert( N <= 2000);\\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\\n cin >> E.p.x >> E.p.y >> E.p.z;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.4755,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1331_6024746\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define EPS (1e-7)\\n#define equals(a,b) (fabs((a)-(b))<EPS)\\n\\nclass Point3d{\\npublic:\\n double x,y,z;\\n \\n Point3d(double x=0,double y=0,double z=0):x(x),y(y),z(z){}\\n \\n Point3d operator + (const Point3d& a){\\n return Point3d(x+a.x,y+a.y,z+a.z);\\n }\\n Point3d operator - (const Point3d& a){\\n return Point3d(x-a.x,y-a.y,z-a.z);\\n }\\n Point3d operator * (const double& d){\\n return Point3d(x*d,y*d,z*d);\\n }\\n Point3d operator / (const double& d){\\n return Point3d(x/d,y/d,z/d);\\n }\\n \\n bool operator < (const Point3d& p)const { return !equals(x,p.x)?x<p.x:((!equals(y,p.y))?y<p.y:(!equals(z,p.z)&&z<p.z)); }\\n \\n bool operator == (const Point3d& p)const{\\n return equals(x,p.x) && equals(y,p.y) && equals(z,p.z);\\n }\\n \\n};\\n \\nstruct Segment3d{\\n Point3d p[2];\\n Segment3d(Point3d p1=Point3d(),Point3d p2=Point3d()){\\n p[0] = p1, p[1] = p2;\\n }\\n bool operator == (const Segment3d& seg)const{\\n return ( p[0] == seg.p[0] && p[1] == seg.p[1] ) || ( p[0] == seg.p[1] && p[1] == seg.p[0] );\\n }\\n};\\n \\ntypedef Point3d Vector3d;\\ntypedef Segment3d Line3d;\\n \\nostream& operator << (ostream& os,const Point3d& p){\\n return os << \\\"(\\\" << p.x << \\\",\\\" << p.y << \\\",\\\" << p.z << \\\")\\\";\\n}\\n \\nostream& operator << (ostream& os,const Segment3d& seg){\\n return os << \\\"(\\\" << seg.p[0] << \\\",\\\" << seg.p[1] << \\\")\\\";\\n}\\n \\ndouble dot(const Point3d& a,const Point3d& b){\\n return a.x*b.x + a.y*b.y + a.z*b.z;\\n}\\n \\nVector3d cross(const Point3d& a,const Point3d& b){\\n return Vector3d(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);\\n}\\n \\ninline double norm(const Point3d &p){\\n return p.x*p.x + p.y*p.y + p.z*p.z;\\n}\\n \\ninline double abs(const Point3d &p){\\n return sqrt(norm(p));\\n}\\n \\ninline double toRad(double theta){\\n return theta * M_PI / 180.0;\\n}\\n\\ndouble distanceLP(Line3d line,Point3d p){\\n return abs(cross(line.p[1]-line.p[0],p-line.p[0])) / abs(line.p[1]-line.p[0]);\\n}\\n \\nPoint3d project(Segment3d seg,Point3d p){\\n Vector3d base = seg.p[1] - seg.p[0];\\n double t = dot(p-seg.p[0],base) / norm(base);\\n return seg.p[0] + base * t;\\n}\\n \\nPoint3d reflect(Segment3d seg,Point3d p){\\n return p + (project(seg,p)-p) * 2.0;\\n}\\n\\nbool on_line3d(Line3d line,Point3d p){\\n return equals(abs(cross(line.p[1]-p,line.p[0]-p)),0);\\n}\\n \\nbool on_segment3d(Segment3d seg,Point3d p){\\n if( !on_line3d(seg,p) ) return false;\\n double dist[3] = { abs(seg.p[1]-seg.p[0]), abs(p-seg.p[0]), abs(p-seg.p[1]) }; \\n return on_line3d(seg,p) && equals(dist[0],dist[1]+dist[2]);\\n}\\n\\ndouble distanceSP(Segment3d seg,Point3d p){\\n Point3d r = project(seg,p);\\n if( on_segment3d(seg,r) ) return abs(p-r);\\n return min(abs(seg.p[0]-p),abs(seg.p[1]-p));\\n}\\n \\n\\n#define REP(i,s,n) for(int i=s;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\n\\nbool LT(double x, double y){ return !equals(x,y) && x < y; }\\nbool LTE(double x, double y){ return equals(x,y) || x < y; }\\n\\nclass Point3DwithWeight {\\npublic:\\n Point3d p;\\n double weight;\\n};\\n\\nconst int MAX_N = 2100;\\nconst int MAX_M = 20;\\nint N,M,R;\\nbitset<2100> remove_cost[MAX_M];\\nPoint3DwithWeight S[MAX_N],T[MAX_M];\\nPoint3DwithWeight E;\\n\\nint getType(double a,double b){\\n if( LT(a,b) ) return -1;\\n return 1;\\n}\\n\\nvoid init(){\\n rep(i,M) remove_cost[i] = 0; \\n rep(i,M) {\\n rep(j,N){\\n int type[2] = { getType(abs(E.p-S[j].p),S[j].weight), getType(abs(T[i].p-S[j].p),S[j].weight) };\\n if( type[0] == type[1] && type[0] == -1 ) continue;\\n double dist = distanceSP(Segment3d(E.p,T[i].p),S[j].p);\\n if( LTE(dist,S[j].weight) ) remove_cost[i][j] = 1;\\n }\\n }\\n}\\n\\n#define pow2(a) ((a)*(a))\\nvoid compute(){\\n init();\\n double maxi = 0;\\n rep(bitmask,(1<<M)){\\n bitset<2100> BIT(0);\\n rep(i,M) if( (bitmask>>i) & 1 ) BIT |= remove_cost[i];\\n if( BIT.count() <= R ) {\\n double cost = 0;\\n rep(i,M) if( (bitmask>>i) & 1 ) cost += T[i].weight / ( pow2(T[i].p.x-E.p.x) + pow2(T[i].p.y-E.p.y) + pow2(T[i].p.z-E.p.z) );\\n maxi = max(maxi,cost);\\n }\\n }\\n printf(\\\"%.10lf\\\\n\\\",maxi);\\n}\\n\\nint main(){\\n while( cin >> N >> M >> R, N|M|R ){\\n assert( N <= 2000);\\n rep(i,N) cin >> S[i].p.x >> S[i].p.y >> S[i].p.z >> S[i].weight;\\n rep(i,M) cin >> T[i].p.x >> T[i].p.y >> T[i].p.z >> T[i].weight;\\n cin >> E.p.x >> E.p.y >> E.p.z;\\n compute();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -0.2603,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1331_5973812\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\n\\n// 3D points\\n// AOJ 1331\\nstruct _3Dpoint{\\n double x,y,z;\\n _3Dpoint(){}\\n _3Dpoint(double x,double y,double z):x(x),y(y),z(z){}\\n _3Dpoint& operator-=(const _3Dpoint &p){\\n x -= p.x; y -= p.y; z -= p.z;\\n return *this;\\n }\\n _3Dpoint& operator+=(const _3Dpoint &p){\\n x += p.x; y += p.y; z += p.z;\\n return *this;\\n }\\n _3Dpoint& operator*=(double d){\\n x *= d; y *= d; z *= d;\\n return *this;\\n }\\n _3Dpoint& operator/=(double d){\\n x /= d; y /= d; z /= d;\\n return *this;\\n }\\n const _3Dpoint operator+ (const _3Dpoint& p) const;\\n const _3Dpoint operator- (const _3Dpoint& p) const;\\n const _3Dpoint operator* (double d) const;\\n const _3Dpoint operator/ (double d) const;\\n};\\nconst _3Dpoint _3Dpoint::operator+ (const _3Dpoint& p) const{\\n _3Dpoint res(*this); return res += p;\\n}\\nconst _3Dpoint _3Dpoint::operator- (const _3Dpoint& p) const{\\n _3Dpoint res(*this); return res -= p;\\n}\\nconst _3Dpoint _3Dpoint::operator* (double d) const{\\n _3Dpoint res(*this); return res *= d;\\n}\\nconst _3Dpoint _3Dpoint::operator/ (double d) const{\\n _3Dpoint res(*this); return res /= d;\\n}\\nstruct _3Dline{\\n _3Dpoint A,B;\\n _3Dline(_3Dpoint A,_3Dpoint B):A(A),B(B){}\\n};\\n// A to B\\n_3Dpoint vec(_3Dline L){\\n return L.B-L.A;\\n}\\ndouble abs(_3Dpoint P){\\n return sqrt(P.x*P.x+P.y*P.y+P.z*P.z);\\n}\\ndouble dist(_3Dpoint A,_3Dpoint B){\\n return abs(A-B);\\n}\\ndouble dot(_3Dpoint A,_3Dpoint B){\\n return A.x*B.x+A.y*B.y+A.z*B.z;\\n}\\n_3Dpoint cross(_3Dpoint A,_3Dpoint B){\\n return _3Dpoint(A.x*B.y-B.x*A.y, A.y*B.z-B.y*A.z, A.z*B.x-B.z*A.x);\\n}\\n// 点と直線の距離\\ndouble Point_line_distance(_3Dpoint P,_3Dline L){\\n return abs(cross(P-L.A,vec(L)))/abs(vec(L));\\n}\\n// 点と線分の距離\\ndouble Point_segment_distance(_3Dpoint P,_3Dline L){\\n if(dot(P-L.A,vec(L))<0) return dist(P,L.A);\\n else if(dot(P-L.B,vec(L))>0) return dist(P,L.B);\\n else return Point_line_distance(P,L);\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int N,M,R;\\n while(cin >> N >> M >> R,N){\\n vector<_3Dpoint> s(N);\\n vector<double> r(N);\\n for(int i=0;i<N;i++){\\n cin >> s[i].x >> s[i].y >> s[i].z >> r[i];\\n }\\n vector<_3Dpoint> t(M);\\n vector<double> b(M);\\n for(int i=0;i<M;i++){\\n cin >> t[i].x >> t[i].y >> t[i].z >> b[i];\\n }\\n _3Dpoint E;\\n cin >> E.x >> E.y >> E.z;\\n double res=0.0;\\n vector<vector<int>> cover(M);\\n for(int i=0;i<M;i++){\\n _3Dline L(E,t[i]);\\n for(int j=0;j<N;j++){\\n if(dist(t[i],s[j])<r[j] and dist(E,s[j])<r[j])continue;\\n if(Point_segment_distance(s[j],L)<r[j]){\\n cover[i].push_back(j);\\n }\\n }\\n }\\n vector<int> flg(N);\\n for(int i=0;i<(1<<M);i++){\\n fill(flg.begin(), flg.end(),0);\\n int cnt=0;\\n for(int j=0;j<M;j++){\\n if((1<<j)&i){\\n for(int k:cover[j]){\\n if(!flg[k])cnt++;\\n flg[k]=1;\\n }\\n }\\n }\\n if(cnt<=R){\\n double sum=0.0;\\n for(int j=0;j<M;j++){\\n if((1<<j)&i){\\n sum+=b[j]/dist(E,t[j])/dist(E,t[j]);\\n }\\n }\\n res=max(res,sum);\\n }\\n }\\n printf(\\\"%.10f\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.9138,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1331_5768760\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst double EPS = 1e-8;\\ninline bool EQ(double a, double b) { return fabs(b - a) < EPS; }\\n\\nstruct Point {\\n double x, y, z;\\n Point() {}\\n Point(double x, double y, double z) : x(x), y(y), z(z) {}\\n Point operator-() const { return Point(-x, -y, -z); }\\n Point operator+(const Point& p) const { return Point(x + p.x, y + p.y, z + p.z); }\\n Point operator-(const Point& p) const { return Point(x - p.x, y - p.y, z - p.z); }\\n Point operator*(const double& t) const { return Point(x * t, y * t, z * t); }\\n Point operator/(const double& t) const { return Point(x / t, y / t, z / t); }\\n};\\nstruct Line {\\n Point a, b;\\n Line() {}\\n Line(Point a, Point b) : a(a), b(b) {}\\n};\\nstruct Segment : Line {\\n Segment() {}\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\nstruct Sphere {\\n Point c;\\n double r;\\n Sphere(Point c, double r) : c(c), r(r) {}\\n};\\n\\ndouble dot(const Point& a, const Point& b) { return a.x * b.x + a.y * b.y + a.z * b.z; }\\ndouble norm(const Point& p) { return p.x * p.x + p.y * p.y + p.z * p.z; }\\ndouble abs(const Point& p) { return sqrt(norm(p)); }\\n\\nPoint projection(const Line& l, const Point& p) {\\n double t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\\n return l.a + (l.b - l.a) * t;\\n}\\n\\nint intersect(const Sphere& c, const Segment& s) {\\n Point h = projection(s, c.c);\\n double d1 = abs(c.c - s.a), d2 = abs(c.c - s.b);\\n if (norm(h - c.c) - c.r * c.r > EPS) return 0;\\n if (d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n if ((d1 < c.r - EPS && d2 > c.r + EPS) || (d1 > c.r + EPS && d2 < c.r - EPS)) return 1;\\n if (dot(s.a - h, s.b - h) < 0) return 2;\\n return 0;\\n}\\n\\nvoid solve(int N, int M, int R) {\\n vector<Sphere> B;\\n for (int i = 0; i < N; i++) {\\n int x, y, z, r;\\n cin >> x >> y >> z >> r;\\n B.emplace_back(Point(x, y, z), r);\\n }\\n vector<Point> L;\\n vector<double> b(M);\\n for (int i = 0; i < M; i++) {\\n int x, y, z;\\n cin >> x >> y >> z >> b[i];\\n L.emplace_back(x, y, z);\\n }\\n Point t;\\n {\\n int x, y, z;\\n cin >> x >> y >> z;\\n t = Point(x, y, z);\\n }\\n\\n for (int i = 0; i < M; i++) {\\n Point p = L[i];\\n b[i] /= norm(p - t);\\n }\\n vector<vector<int>> interupt(M, vector<int>(N));\\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j < N; j++) {\\n Segment s(L[i], t);\\n int cross = intersect(B[j], s);\\n interupt[i][j] = (cross > 0);\\n }\\n }\\n\\n double ans = 0;\\n for (int mask = 0; mask < (1 << M); mask++) {\\n vector<int> check(N, false);\\n double res = 0;\\n for (int i = 0; i < M; i++) {\\n if (!(mask >> i & 1)) continue;\\n res += b[i];\\n for (int j = 0; j < N; j++) check[j] |= interupt[i][j];\\n }\\n int sum = accumulate(check.begin(), check.end(), 0);\\n if (sum > R) continue;\\n ans = max(ans, res);\\n }\\n\\n cout << ans << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n int N, M, R;\\n while (cin >> N >> M >> R, N && M && R) solve(N, M, R);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2180,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -1.145,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":782,"cells":{"group_id":{"kind":"string","value":"aoj_1333_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nBeautiful Spacing\nText is a sequence of words, and a word consists of characters. Your task is to put words into a grid with\nW\ncolumns and sufficiently many lines. For the beauty of the layout, the following conditions have to be satisfied.\nThe words in the text must be placed keeping their original order. The following figures show correct and incorrect layout examples for a 4 word text \"This is a pen\" into 11 columns.\nFigure I.1: A good layout.\nFigure I.2: BAD | Do not reorder words.\nBetween two words adjacent in the same line, you must place at least one space character. You sometimes have to put more than one space in order to meet other conditions.\nFigure I.3: BAD | Words must be separated by spaces.\nA word must occupy the same number of consecutive columns as the number of characters in it. You cannot break a single word into two or more by breaking it into lines or by inserting spaces.\nFigure I.4: BAD | Characters in a single word must be contiguous.\nThe text must be justified to the both sides. That is, the first word of a line must startfrom the first column of the line, and except the last line, the last word of a line must end at the last column.\nFigure I.5: BAD | Lines must be justi\fed to both the left and the right sides.\nThe text is the most beautifully laid out when there is no unnecessarily long spaces. For instance, the layout in Figure I.6 has at most 2 contiguous spaces, which is more beautiful than that in Figure I.1, having 3 contiguous spaces. Given an input text and the number of columns, please find a layout such that the length of the longest contiguous spaces between words is minimum.\nFigure I.6: A good and the most beautiful layout.\nInput\nThe input consists of multiple datasets, each in the following format.\nW N\nx\n1\nx\n2\n...\nx\nN\nW\n,\nN\n, and\nx\ni\nare all integers.\nW\nis the number of columns (3 ≤\nW\n≤ 80,000).\nN\nis the number of words (2 ≤\nN\n≤ 50,000).\nx\ni\nis the number of characters in the\ni\n-th word (1 ≤\nx\ni\n≤ (\nW\n−1)/2 ). Note that the upper bound on\nx\ni\nassures that there always exists a layout satisfying the conditions.\nThe last dataset is followed by a line containing two zeros.\nOutput\nFor each dataset, print the smallest possible number of the longest contiguous spaces between words.\nSample Input\n11 4\n4 2 1 3\n5 7\n1 1 1 2 2 1 2\n11 7\n3 1 3 1 3 3 4\n100 3\n30 30 39\n30 3\n2 5 3\n0 0\nOutput for the Sample Input\n2\n1\n2\n40\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1333_10851267","code_snippet":"//#include<CSpreadSheet.h>\n\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<sstream>\n#include<cstdlib>\n#include<string>\n#include<string.h>\n#include<cstring>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n#include<queue>\n#include<ctime>\n#include<bitset>\n#include<cmath>\n#define eps 1e-6\n#define INF 0x3f3f3f3f\n#define PI acos(-1.0)\n#define ll __int64\n#define LL long long\n#define lson l,m,(rt<<1)\n#define rson m+1,r,(rt<<1)|1\n#define M 1000000007\n//#pragma comment(linker, \"/STACK:1024000000,1024000000\")\nusing namespace std;\n\n#define Maxn 51000\n\nbool dp[Maxn];\nint n,w;\nLL sum[Maxn];\n\nbool iscan(int m)\n{\n if(sum[n]+n-1<=w)\n return true;\n\n memset(dp,0,sizeof(dp));\n dp[0]=1;\n int la=0;\n\n for(int i=0;i<=n-2;i++)\n {\n if(!dp[i])\n continue;\n for(int j=max(i+1,la+1);j<=n;j++)\n {\n if(sum[j]-sum[i]+j-i-1>w)\n break;\n if(sum[j]-sum[i]+(j-i-1)*m<w)\n continue;\n dp[j]=true;\n la=j;\n if(sum[n]-sum[j]+n-j-1<=w)\n return true;\n }\n }\n return false;\n}\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n //freopen(\"out.txt\",\"w\",stdout);\n while(scanf(\"%d%d\",&w,&n)&&w+n)\n {\n sum[0]=0;\n for(int i=1;i<=n;i++)\n {\n LL temp;\n scanf(\"%lld\",&temp);\n sum[i]=sum[i-1]+temp;\n }\n int l=1,r=w,m,ans;\n\n while(l<=r)\n {\n m=(l+r)>>1;\n if(iscan(m))\n {\n ans=m;\n r=m-1;\n }\n else\n l=m+1;\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":4008,"score_of_the_acc":-0.206,"final_rank":2},{"submission_id":"aoj_1333_9796048","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\ntemplate<typename T>struct BIT{\n int n; T all=0; vector<T> val;\n BIT(int _n=0):n(_n),val(_n+10){}\n void clear(){val.assign(n+10,0); all=T();}\n void add(int i,T x){\n for(i++;i<=n;i+=(i&-i))val[i]=val[i]+x;\n all+=x;\n }\n T sum(int i){\n T res=0;\n for(;i;i-=(i&-i))res+=val[i];\n return res;\n }\n T sum(int L,int R){return sum(R)-sum(L);} // [L,R)\n\n int lower_bound(T x){\n int ret=0,len=1;\n while(2*len<=n)len<<=1;\n for(;len>=1;len>>=1){\n if(ret+len<=n and val[ret+len]<x){\n ret+=len;\n x-=val[ret];\n }\n }\n return ret;\n }\n};\n\n/**\n * @brief Binary Indexed Tree\n */\n\nint main() {\nwhile(1) {\n ll M, N;\n cin >> M >> N;\n if (N == 0) return 0;\n vector<ll> X(N);\n rep(i,0,N) cin >> X[i];\n vector<ll> XS(N+1,0);\n rep(i,0,N) XS[i+1] = XS[i] + X[i];\n auto Calc = [&](int L, int R, ll Len) -> ll {\n return XS[R] - XS[L] + Len*(R-L-1);\n };\n auto Judge = [&](ll Len) -> bool {\n BIT<ll> Seg(N);\n Seg.add(0,1);\n rep(i,1,N) {\n int NG = -1, OK = i;\n while(OK - NG > 1) {\n int MID = (OK + NG) / 2;\n if (Calc(MID,i,1LL) <= M) OK = MID;\n else NG = MID;\n }\n int Left = OK;\n OK = -1, NG = i;\n while(NG - OK > 1) {\n int MID = (OK + NG) / 2;\n if (Calc(MID,i,Len) >= M) OK = MID;\n else NG = MID;\n }\n int Right = OK;\n if (Seg.sum(Left, Right+1) >= 1) Seg.add(i,1);\n }\n {\n int NG = -1, OK = N;\n while(OK - NG > 1) {\n int MID = (OK + NG) / 2;\n if (Calc(MID,N,1LL) <= M) OK = MID;\n else NG = MID;\n }\n if (Seg.sum(OK,N) >= 1) return true;\n else return false;\n }\n };\n {\n int OK = M, NG = 0;\n while(OK - NG > 1) {\n int MID = (OK + NG) / 2;\n if (Judge(MID)) OK = MID;\n else NG = MID;\n }\n cout << OK << endl;\n }\n}\n}","accuracy":1,"time_ms":6710,"memory_kb":4268,"score_of_the_acc":-1.171,"final_rank":18},{"submission_id":"aoj_1333_8527795","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n while (1) {\n int w, n;\n cin >> w >> n;\n if (!w)\n break;\n vector<int> x(n);\n rep(i, n) cin >> x[i];\n vector<ll> sum(n + 1, 0);\n rep(i, n) sum[i + 1] = sum[i] + x[i];\n auto check1 = [&](int l, int r) {\n return sum[r] - sum[l] + r - l - 1 <= w;\n };\n auto check2 = [&](int l, int r, ll k) {\n return sum[r] - sum[l] + k * (r - l - 1) < w;\n };\n int ok = w, ng = 0;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n vector<int> dp(n + 2, 0);\n dp[0] = 1, dp[1] = -1;\n int idx1 = 0, idx2 = 0;\n bool f = false;\n rep(i, n) {\n if (i)\n dp[i] += dp[i - 1];\n while (idx1 < n + 1 && check1(i, idx1)) idx1++;\n while (idx2 < n + 1 && check2(i, idx2, mid)) idx2++;\n if (dp[i]) {\n if (idx1 == n + 1)\n f = true;\n else\n dp[idx2]++, dp[idx1]--;\n }\n }\n (f ? ok : ng) = mid;\n }\n cout << ok << '\\n';\n }\n}","accuracy":1,"time_ms":610,"memory_kb":3960,"score_of_the_acc":-0.2089,"final_rank":3},{"submission_id":"aoj_1333_8516434","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nbool is_end = false;\n\ntemplate< typename Monoid >\nstruct SegmentTree {\n\tusing F = function< Monoid(Monoid, Monoid) >;\n\n\tint sz;\n\tvector< Monoid > seg;\n\n\tconst F f;\n\tconst Monoid M1;\n\n\tSegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {\n\t\tsz = 1;\n\t\twhile(sz < n) sz <<= 1;\n\t\tseg.assign(2 * sz, M1);\n\t}\n\n\tvoid set(int k, const Monoid &x) {\n\t\tseg[k + sz] = x;\n\t}\n\n\tvoid build() {\n\t\tfor(int k = sz - 1; k > 0; k--) {\n\t\t\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n\t\t}\n\t}\n\n\tvoid update(int k, const Monoid &x) {\n\t\tk += sz;\n\t\tseg[k] = x;\n\t\twhile(k >>= 1) {\n\t\t\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n\t\t}\n\t}\n\n\tMonoid query(int a, int b) {\n\t\tMonoid L = M1, R = M1;\n\t\tfor(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif(a & 1) L = f(L, seg[a++]);\n\t\t\tif(b & 1) R = f(seg[--b], R);\n\t\t}\n\t\treturn f(L, R);\n\t}\n\n\tMonoid operator[](const int &k) const {\n\t\treturn seg[k + sz];\n\t}\n\t\n};\n\nll op(ll a, ll b) {return max(a, b);}\nll e = 0;\n\nbool isOK(ll mid, ll W, vector<ll> &A)\n{\n\tll N = A.size();\n\t\n\tvector<ll> lower(N+1, 0), upper(N+1, 0);\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tlower[i+1] = lower[i] + A[i] + 1;\n\t\tupper[i+1] = upper[i] + A[i] + mid;\n\t}\n\t\n\tll lst = 0;\n\tSegmentTree<ll> seg(N+1, op, e);\n\tseg.update(0, 1);\n\t\n\t// cerr << mid << endl;\n\tfor (ll i = 1; i <= N; ++i)\n\t{\n\t\tauto itrl = lower_bound(lower.begin(), lower.end(), lower[i] - (W + 1));\n\t\tll mn = itrl - lower.begin();\n\t\tauto itru = upper_bound(upper.begin(), upper.end(), upper[i] - (W + mid));\n\t\tll mx = itru - upper.begin() - 1;\n\t\t\n\t\tmx = min(mx, i-2);\n\t\tif (mx < 0) continue;\n\t\t\n\t\tll res = seg.query(mn, mx+1);\n\t\tseg.update(i, res);\n\t\tif (res > 0) {lst = i;}\n\t\t// cerr << i << \": \" << mx << \" \" << mn << \" \" << res << endl;\n\t}\n\t\n\treturn lower[N] - lower[lst] <= W + 1;\n}\n\n\nvoid calc()\n{\n\tll W, N; cin >> W >> N;\n\t\n\tif (W == 0 && N == 0)\n\t{\n\t\tis_end = true;\n\t\treturn;\n\t}\n\t\n\tvector<ll> A(N);\n\tfor (int i = 0; i < N; ++i) {cin >> A[i];}\n\t\n\tll ng = 0, ok = W;\n\twhile (abs(ok - ng) > 1)\n\t{\n\t\tll mid = (ok + ng) / 2;\n\t\tif (isOK(mid, W, A)) ok = mid;\n\t\telse ng = mid;\n\t}\n\t\n\tcout << ok << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\twhile (!is_end)\n\t{\n\t\tcalc();\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":7660,"memory_kb":5208,"score_of_the_acc":-1.6537,"final_rank":20},{"submission_id":"aoj_1333_7177685","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int w,n;\n while(cin >> w >> n,n){\n vector<int> x(n);\n vector<ll> sum(n+1);\n for(int i=0;i<n;i++){\n cin >> x[i];\n sum[i+1] = sum[i]+x[i];\n }\n auto slv = [&](ll mid)->bool{\n vector<int> dp(n+2);\n dp[0] = 1; dp[1] = -1;\n for(int i=0;i<n;i++){\n dp[i+1] += dp[i];\n if(!dp[i]) continue;\n int l = i, r = n;\n while(r-l>1){\n int m = (l+r)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(ll)(m-i)*mid >= w){\n r = m;\n }\n else{\n l = m;\n }\n }\n if(r == n) return true;\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\n int nl = r, nr = n;\n while(nr-nl>1){\n int m = (nl+nr)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(m-i) <= w){\n nl = m;\n }\n else{\n nr = m;\n }\n }\n // [r,nl]\n dp[r+1]++;\n dp[nl+2]--;\n if(nl+1 == n) return true; // 枝刈り\n }\n return dp[n];\n };\n int l = 0, r = w;\n while(r-l>1){\n int mid = (l+r)/2;\n if(slv(mid)){\n r = mid;\n }\n else{\n l = mid;\n }\n }\n cout << r << \"\\n\";\n }\n}","accuracy":1,"time_ms":4160,"memory_kb":3876,"score_of_the_acc":-0.6706,"final_rank":10},{"submission_id":"aoj_1333_7177673","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int w,n;\n while(cin >> w >> n,n){\n vector<int> x(n);\n vector<ll> sum(n+1);\n for(int i=0;i<n;i++){\n cin >> x[i];\n sum[i+1] = sum[i]+x[i];\n }\n auto slv = [&](ll mid)->bool{\n vector<int> dp(n+2);\n dp[0] = 1; dp[1] = -1;\n for(int i=0;i<n;i++){\n dp[i+1] += dp[i];\n if(!dp[i]) continue;\n { // 枝刈り\n ll s = sum[n]-sum[i];\n if(s+(ll)(n-1-i)*mid < w) return true;\n }\n int l = i, r = n;\n while(r-l>1){\n int m = (l+r)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(ll)(m-i)*mid >= w){\n r = m;\n }\n else{\n l = m;\n }\n }\n // if(r == n) return true;\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\n int nl = r, nr = n;\n while(nr-nl>1){\n int m = (nl+nr)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(m-i) <= w){\n nl = m;\n }\n else{\n nr = m;\n }\n }\n // [r,nl]\n dp[r+1]++;\n dp[min(n+1,nl+2)]--;\n }\n return dp[n];\n };\n int l = 0, r = w;\n while(r-l>1){\n int mid = (l+r)/2;\n if(slv(mid)){\n r = mid;\n }\n else{\n l = mid;\n }\n }\n cout << r << \"\\n\";\n }\n}","accuracy":1,"time_ms":4220,"memory_kb":3960,"score_of_the_acc":-0.7103,"final_rank":12},{"submission_id":"aoj_1333_7177662","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int w,n;\n while(cin >> w >> n,n){\n vector<int> x(n);\n vector<ll> sum(n+1);\n for(int i=0;i<n;i++){\n cin >> x[i];\n sum[i+1] = sum[i]+x[i];\n }\n auto slv = [&](ll mid)->bool{\n vector<int> dp(n+2);\n dp[0] = 1; dp[1] = -1;\n for(int i=0;i<n;i++){\n dp[i+1] += dp[i];\n if(!dp[i]) continue;\n int l = i, r = n;\n while(r-l>1){\n int m = (l+r)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(ll)(m-i)*mid >= w){\n r = m;\n }\n else{\n l = m;\n }\n }\n if(r == n) return true;\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\n int nl = r, nr = n;\n while(nr-nl>1){\n int m = (nl+nr)/2;\n ll s = sum[m+1]-sum[i];\n if(s+(m-i) <= w){\n nl = m;\n }\n else{\n nr = m;\n }\n }\n // [r,nl]\n dp[r+1]++;\n dp[min(n+1,nl+2)]--;\n }\n return dp[n];\n };\n int l = 0, r = w;\n while(r-l>1){\n int mid = (l+r)/2;\n if(slv(mid)){\n r = mid;\n }\n else{\n l = mid;\n }\n }\n cout << r << \"\\n\";\n }\n}","accuracy":1,"time_ms":4170,"memory_kb":3876,"score_of_the_acc":-0.672,"final_rank":11},{"submission_id":"aoj_1333_6676969","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\ntemplate<class T> void scan(T& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ cout << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nvoid solve() {\n int w, n;\n while(cin >> w >> n) {\n if(w == 0 && n == 0) break;\n VEC(int, x, n);\n vc<int> sum(n + 1, 0);\n rep(i, n) {\n sum[i + 1] = sum[i] + x[i];\n }\n auto check = [&](int len) -> bool {\n debug(len);\n vc<int> dp(n + 2, 0);\n dp[0] = 1;\n dp[1] = -1;\n rep(i, n) {\n if(i - 1 >= 0) dp[i] += dp[i - 1];\n if(dp[i] == 0) continue;\n debug(i, dp[i]);\n // debug(i, sum[n] - sum[i] + (n - i - 1));\n if(sum[n] - sum[i] + (n - i - 1) <= w) return true;\n int ok = i + 2, ng = n;\n auto ck1 = [&](int id) -> bool {\n // debug(i, id, sum[id] - sum[i] + id - i - 1);\n return sum[id] - sum[i] + (id - i - 1) <= w;\n };\n while(ng - ok > 1) {\n int mid = (ok + ng) / 2;\n if(ck1(mid)) ok = mid;\n else ng = mid;\n }\n debug(i, ok);\n int mx = ok;\n ng = i + 1;\n auto ck2 = [&](int id) -> bool {\n if(sum[id] - sum[i] > w) return false;\n // (w - (sum[id] - sum[i])) / (id - i - 1) <= len\n return len * (id - i - 1) >= w - (sum[id] - sum[i]);\n };\n if(!ck2(mx)) continue;\n while(ok - ng > 1) {\n int mid = (ok + ng) / 2;\n if(ck2(mid)) ok = mid;\n else ng = mid;\n }\n debug(i, ok, mx);\n dp[ok] ++;\n dp[mx + 1] --;\n }\n return false;\n };\n int ok = w, ng = 0;\n while(ok - ng > 1) {\n int mid = (ok + ng) / 2;\n if(check(mid)) ok = mid;\n else ng = mid;\n }\n out(ok);\n }\n}\n\nsigned main() {\n int testcase = 1;\n // in(testcase);\n while(testcase--) solve();\n return 0;\n}","accuracy":1,"time_ms":3030,"memory_kb":4296,"score_of_the_acc":-0.6704,"final_rank":9},{"submission_id":"aoj_1333_6663561","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int W, N;\n cin >> W >> N;\n if (W == 0) break;\n vector<ll> x(N);\n for (auto& y : x) cin >> y;\n x.push_back(1e9);\n int lb = 0, ub = W;\n while (ub - lb > 1) {\n int m = (lb + ub) / 2;\n vector<int> reachable(N+2);\n ll small = x[0] + m, big = x[0] + 1;\n int j = 0, k = 0;\n reachable[0] = 1;\n reachable[1] = -1;\n bool ok = true;\n\n rep(i,0,N) {\n while (j < N && small < W+m) {\n small += x[++j] + m;\n }\n while (k < N && big <= W+1) {\n big += x[++k] + 1;\n }\n if (reachable[i] && min(j+1, N) < k+1) {\n ++reachable[min(j+1, N)];\n --reachable[k+1];\n }\n small -= x[i] + m;\n big -= x[i] + 1;\n reachable[i+1] += reachable[i];\n }\n if (reachable[N]) {\n ub = m;\n } else {\n lb = m;\n }\n }\n cout << ub << \"\\n\";\n }\n}","accuracy":1,"time_ms":540,"memory_kb":4164,"score_of_the_acc":-0.2753,"final_rank":5},{"submission_id":"aoj_1333_6366925","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2022.03.01 15:08:03 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region fenwick_tree\n\ntemplate <class T = long long>\nstruct binary_indexed_tree {\n\tstd::vector<T> data;\n\tint n;\n\tint pw2 = 1;\n\tbinary_indexed_tree(const int &sz) : data(sz + 1, 0), n(sz) {\n\t\twhile(pw2 << 1 <= n) pw2 <<= 1;\n\t}\n\tvoid add(const int &place, const T &val, const int &index = 0) {\n\t\tfor(int x = place + 1 - index; x <= n; x += x & -x) data[x] += val;\n\t}\n\n\t// [0, a)\n\tconst T sum0(const int &a, const int &index = 0) const {\n\t\tT ret = 0;\n\t\tfor(int x = a - index; x > 0; x -= x & -x) ret += data[x];\n\t\treturn ret;\n\t}\n\n\t// [0, b)\n\tconst T sum(const int &a, const int &b, const int &index = 0) const { return sum0(b, index) - sum0(a, index); }\n\n\t// point get\n\tconst T get(const int &idx) const { return sum(idx, idx + 1, 0); }\n\tconst T operator[](const int &idx) const { return get(idx); }\n\n\tvoid update(const int &place, const T &val, const int &index = 0) {\n\t\tadd(place, val + sum0(place, index) - sum0(place + 1, index), index);\n\t}\n\n\t/*\n\t\tconstraints: for all $i, data[i] >= 0\n\t\treturns $i which satisfies:\n\t\t\tstart <= i,\n\t\t\tsum[start, i-1) < val <= \\sum_[start, i)\n\t\tsum[start, n+1) := infinity, sum[start, start-1] := -infinity\n\t*/\n\tconst int lower_bound(T val, const int &start = 0) const {\n\t\tif(val <= 0) return start;\n\t\tval += sum0(start);\n\t\tint x = 0;\n\t\tfor(int k = pw2; k > 0; k >>= 1) {\n\t\t\tif(x + k <= n && data[x + k] < val) {\n\t\t\t\tval -= data[x + k];\n\t\t\t\tx += k;\n\t\t\t}\n\t\t}\n\t\treturn x + 1;\n\t}\n\n\t/*\n\t\tconstraints: for all $i, data[i] >= 0\n\t\treturns $i which satisfies:\n\t\t\tstart <= i,\n\t\t\tsum[start, i-1) <= val < \\sum_[start, i) .\n\t\tsum[start, n+1) := infinity, sum[start, start-1] := -infinity\n\t*/\n\tconst int upper_bound(T val, const int &start = 0) const {\n\t\tif(val < 0) return start;\n\t\tval += sum0(start);\n\t\tint x = 0;\n\t\tfor(int k = pw2; k > 0; k >>= 1) {\n\t\t\tif(x + k <= n && data[x + k] <= val) {\n\t\t\t\tval -= data[x + k];\n\t\t\t\tx += k;\n\t\t\t}\n\t\t}\n\t\treturn x + 1;\n\t}\n\n\tvoid print() const {\n#ifdef LOCAL\n\t\tstd::cerr << \"{ \";\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tstd::cerr << get(i) << (i == n - 1 ? \" }\\n\" : \", \");\n\t\t}\n#endif\n\t}\n};\n\n#pragma endregion\n\nint solve(int w) {\n\tint n;\n\tcin >> n;\n\tVEC(int, lens, n);\n\t// binary_indexed_tree<ll> len_sum(n);\n\t// rep(i, n) len_sum.add(i, ll(lens[i]));\n\n\tauto bs = [](int ok, int ng, auto is_ok) -> int {\n\t\twhile(abs(ok - ng) > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\t(is_ok(mid) ? ok : ng) = mid;\n\t\t}\n\t\treturn ok;\n\t};\n\n\tauto judge = [&](int maxspacelength) -> bool {\n\t\t// vector<int> dp(n);\n\t\t// dp.front() = 1;\n\t\t// auto len_minimum = [&](int lef, int rig) -> ll {\n\t\t// \tassert(lef-\\\\ \\\\< rig);\n\t\t// \treturn len_sum.s\\um(lef, rig, 0) + ll(rig - lef - 1);\n\t\t// };\n\t\t// auto len_maximum = [&](int lef, int rig) {\n\t\t// \tassert(lef < rig);\n\t\t// \treturn len_sum.sum(lef, rig) + ll(rig - lef - 1) * maxspacelength;\n\t\t// };\n\n\t\tbinary_indexed_tree<int> dp(n);\n\t\tdp.add(0, 1);\n\t\tint nxt = 1;\n\t\t// auto traceable = [&](int from) {\n\t\t// \tll maxlen = len_maximum(from, nxt);\n\t\t// \treturn maxlen >= ll(w);\n\t\t// };\n\t\t// auto packable = [&](int from) {\n\t\t// \tll minilen = len_minimum(from, nxt);\n\t\t// \treturn minilen <= ll(w);\n\t\t// };\n\n\t\tint left = 0;\n\t\tint right = 0;\n\t\t// left = right = lens.front();\n\t\tll minlensum = -1;\n\t\tll maxlensum = -maxspacelength;\n\t\tint sum = 0;\n\t\tfor(; nxt <= n; nxt++) {\n\t\t\tdebug(left, right, nxt, maxspacelength);\n\t\t\tminlensum += 1 + lens[nxt - 1];\n\t\t\tmaxlensum += maxspacelength + lens[nxt - 1];\n\t\t\tdebug(minlensum, maxlensum);\n\t\t\twhile(minlensum > w) {\n\t\t\t\tdebug(left);\n\t\t\t\tminlensum -= lens[left] + 1;\n\t\t\t\t// sum -= dp[left++];\n\t\t\t\tleft++;\n\t\t\t}\n\t\t\tif(nxt == n) return dp.sum(left, n);\n\t\t\t// maxlensum += maxspacelength + lens[nxt];\n\t\t\twhile(maxlensum >= w && right + 1 < nxt) {\n\t\t\t\tdebug(right);\n\t\t\t\tmaxlensum -= maxspacelength + lens[right];\n\t\t\t\t// sum += dp[right++];\n\t\t\t\tright++;\n\t\t\t}\n\n\t\t\tdebug(left, right);\n\n\t\t\t// if(nxt == n - 1) break;\n\t\t\t// int left = bs(nxt - 1, -1, packable);\n\t\t\t// int right = bs(-1, nxt, traceable);\n\t\t\t// if(right == nxt - 1) right--;\n\t\t\tif(right < left) continue;\n\t\t\t// int righttemp = right;\n\t\t\t// if(right == nxt ) righttemp--;\n\t\t\tsum = dp.sum(left, right);\n\t\t\tif(sum > 0) dp.add(nxt, 1);\n\t\t}\n\t\t// left = bs(n, -1, packable);\n\t\treturn bool(dp.sum(left, n));\n\t};\n\n\treturn bs(w + 10, 0, judge);\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint w;\n\twhile(cin >> w && w) {\n\t\tcout << solve(w) << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":1600,"memory_kb":3620,"score_of_the_acc":-0.2195,"final_rank":4},{"submission_id":"aoj_1333_6085440","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(v) (v).begin(),(v).end()\nusing ll=long long int;\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\n\n\n\nint main(){\n int W,n;\n while(cin>>W>>n){\n if(n==0)break;\n vector<int> a(n);\n rep(i,0,n)cin>>a[i];\n vector<int> rui(n+1);\n rep(i,0,n)rui[i+1]=rui[i]+a[i];\n\n auto ok1=[&](int L,int R)->bool{\n return rui[R+1]-rui[L]+R-L<=W;\n };\n auto ok2=[&](int L,int R,int x)->bool{\n return rui[R+1]-rui[L]+(R-L)*x>=W;\n };\n auto check=[&](int x)->bool{\n if(ok1(0,n-1))return true;\n vector<int> dp(n+1);\n dp[0]=1;\n int sum=0,ok=0,ng=0;\n rep(i,0,n){\n while(ng<=i and !ok1(ng,i)){\n if(dp[ng])sum--;\n ng++;\n }\n while(ok<=i and ok2(ok,i,x)){\n if(dp[ok])sum++;\n ok++;\n }\n if(sum){\n dp[i+1]=1;\n if(ok1(i+1,n-1))return true;\n }\n }\n return false;\n };\n\n int L=0,R=W;\n while(R-L>1){\n int mid=(L+R)>>1;\n if(check(mid))R=mid;\n else L=mid;\n }\n cout<<R<<'\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":830,"memory_kb":3664,"score_of_the_acc":-0.129,"final_rank":1},{"submission_id":"aoj_1333_6066013","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\ntemplate <class T>\nstruct BIT {\n int N;\n vector<T> bit;\n BIT(int N) : N(N) { bit = vector<T>(N + 1, T(0)); }\n void add(int i, T x) {\n i++;\n while (i <= N) {\n bit[i] += x;\n i += i & -i;\n }\n return;\n }\n T sum(int i) {\n i++;\n T res = T(0);\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) { // [l,r]\n assert(l <= r);\n if (l == 0)\n return sum(r);\n else\n return sum(r) - sum(l - 1);\n }\n};\n\nbool solve() {\n ll W;\n int N;\n cin >> W >> N;\n if (W == 0 && N == 0) return false;\n vector<ll> x(N);\n cin >> x;\n\n vector<ll> y(N + 1);\n for (int i = 0; i < N; i++) y[i + 1] = y[i] + x[i];\n\n auto range = [&](ll a, ll b, int id, ll K) {\n int L, R;\n {\n int l = -1, r = id;\n while (r - l > 1) {\n int mid = (l + r) / 2;\n if (y[mid] + mid >= a)\n r = mid;\n else\n l = mid;\n }\n L = r;\n }\n {\n if (y[0] > b) return make_pair(1, 0);\n int l = 0, r = id;\n while (r - l > 1) {\n int mid = (l + r) / 2;\n if (y[mid] + K * mid <= b)\n l = mid;\n else\n r = mid;\n }\n R = l;\n }\n return make_pair(L, R);\n };\n\n auto check = [&](ll K) {\n BIT<int> bit(N + 1);\n bit.add(0, 1);\n for (int i = 1; i <= N; i++) {\n ll a = i - 1 + y[i] - W;\n ll b = K * (i - 1) + y[i] - W;\n auto [l, r] = range(a, b, i, K);\n if (l > r) continue;\n if (bit.sum(l, r) > 0) bit.add(i, 1);\n }\n for (int i = 0; i <= N; i++) {\n if (bit.sum(i, i) == 0) continue;\n if (y[N] - y[i] + (N - i - 1) * K <= W) return true;\n }\n return false;\n };\n\n ll l = 0, r = W;\n while (r - l > 1) {\n ll mid = (l + r) / 2ll;\n if (check(mid))\n r = mid;\n else\n l = mid;\n }\n cout << r << endl;\n return true;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n while (solve()) {}\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":6070,"memory_kb":4192,"score_of_the_acc":-1.0538,"final_rank":17},{"submission_id":"aoj_1333_5896208","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll W, N;\n while (cin >> W >> N, W) {\n W++;\n vector<ll> X(N);\n for (auto&& x : X) {\n cin >> x;\n x++;\n }\n vector<ll> acc(N + 1);\n for (int i = 0; i < N; i++) {\n acc[i + 1] = acc[i] + X[i];\n }\n\n vector<ll> accwithspace(N + 1);\n vector<int> imos(N + 1);\n auto check = [&](ll maxspace) {\n accwithspace[0] = 0;\n for (int i = 0; i < N; i++) {\n accwithspace[i + 1] = accwithspace[i] + X[i] + maxspace;\n }\n imos[0] = 0;\n for (int i = 0; i < N; i++) {\n bool canbefront = false;\n if (i == 0)\n canbefront = true;\n else if (i == 1)\n canbefront = false;\n else {\n int l, r;\n l = lower_bound(cbegin(acc), cend(acc), acc[i] - W) - acc.begin();\n r = lower_bound(cbegin(accwithspace), cend(accwithspace), accwithspace[i] - maxspace - W + 1) - accwithspace.begin();\n canbefront = imos[r] - imos[l];\n }\n imos[i + 1] = imos[i] + canbefront;\n if (canbefront && ((acc.back() - acc[i]) <= W))\n return true;\n }\n return false;\n };\n\n int ok = W;\n int ng = -1;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n if (check(mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n\n cout << ok + 1 << endl;\n }\n}","accuracy":1,"time_ms":3490,"memory_kb":4328,"score_of_the_acc":-0.7462,"final_rank":13},{"submission_id":"aoj_1333_5896195","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll W, N;\n while (cin >> W >> N, W) {\n W++;\n vector<ll> X(N);\n for (auto&& x : X) {\n cin >> x;\n x++;\n }\n vector<ll> acc(N + 1);\n for (int i = 0; i < N; i++) {\n acc[i + 1] = acc[i] + X[i];\n }\n\n auto check = [&](ll maxspace) {\n vector<ll> accwithspace(N + 1);\n for (int i = 0; i < N; i++) {\n accwithspace[i + 1] = accwithspace[i] + X[i] + maxspace;\n }\n vector<int> imos(N + 1);\n for (int i = 0; i < N; i++) {\n bool canbefront = false;\n if (i == 0)\n canbefront = true;\n else if (i == 1)\n canbefront = false;\n else {\n int l, r;\n l = lower_bound(cbegin(acc), cend(acc), acc[i] - W) - acc.begin();\n r = lower_bound(cbegin(accwithspace), cend(accwithspace), accwithspace[i] - maxspace - W + 1) - accwithspace.begin();\n canbefront = imos[r] - imos[l];\n }\n imos[i + 1] = imos[i] + canbefront;\n if (canbefront && ((acc.back() - acc[i]) <= W))\n return true;\n }\n return false;\n };\n\n int ok = W;\n int ng = -1;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n if (check(mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n\n cout << ok + 1 << endl;\n }\n}","accuracy":1,"time_ms":3490,"memory_kb":4540,"score_of_the_acc":-0.8253,"final_rank":15},{"submission_id":"aoj_1333_5358559","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while (true){\n int W, N;\n cin >> W >> N;\n if (W == 0 && N == 0){\n break;\n }\n vector<int> x(N);\n for (int i = 0; i < N; i++){\n cin >> x[i];\n }\n vector<int> S(N + 1);\n S[0] = 0;\n for (int i = 0; i < N; i++){\n S[i + 1] = S[i] + x[i];\n }\n int tv = W - 2, fv = 0;\n while (tv - fv > 1){\n \tint mid = (tv + fv) / 2;\n vector<bool> dp(N + 1, false);\n dp[0] = true;\n vector<int> dpS(N + 2, 0);\n dpS[1] = 1;\n for (int i = 0; i < N; i++){\n int tv1 = i, fv1 = -1;\n while (tv1 - fv1 > 1){\n int mid1 = (tv1 + fv1) / 2;\n if (S[i + 1] - S[mid1] + (i - mid1) <= W){\n tv1 = mid1;\n } else {\n fv1 = mid1;\n }\n }\n int tv2 = tv1 - 1, fv2 = i;\n while (fv2 - tv2 > 1){\n int mid2 = (tv2 + fv2) / 2;\n int r = W - (S[i + 1] - S[mid2]);\n if (r <= mid * (i - mid2)){\n tv2 = mid2;\n } else {\n fv2 = mid2;\n }\n }\n if (dpS[tv2 + 1] - dpS[tv1] > 0){\n dp[i + 1] = true;\n }\n dpS[i + 2] = dpS[i + 1];\n if (dp[i + 1]){\n dpS[i + 2]++;\n }\n }\n bool ok = false;\n for (int i = 0; i <= N; i++){\n if (dp[i] && S[N] - S[i] + (N - i - 1) <= W){\n ok = true;\n }\n }\n if (ok){\n tv = mid;\n } else {\n fv = mid;\n }\n }\n cout << tv << endl;\n }\n}","accuracy":1,"time_ms":6250,"memory_kb":3456,"score_of_the_acc":-0.8042,"final_rank":14},{"submission_id":"aoj_1333_5310475","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=80005,INF=1<<30;\nll dp[MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n ll W,N;cin>>W>>N;\n if(W==0) break;\n vector<ll> A(N+1),rui(N+2);\n for(int i=0;i<N;i++){\n cin>>A[i+1];\n rui[i+1]=rui[i]+A[i+1];\n }\n rui[N+1]=1LL<<60;\n \n ll left=0,right=W;\n while(right-left>1){\n ll mid=(left+right)/2;\n memset(dp,0,sizeof(dp));\n dp[0]=1;\n dp[1]=-1;\n \n for(int i=0;i<=N;i++){\n if(i) dp[i]+=dp[i-1];\n if(dp[i]==0) continue;\n if(i==N) break;\n \n if(rui[N]-rui[i]+N-i-1<=W){\n dp[N]=1;\n break;\n }\n int l=i+2,r=N+1;\n while(r-l>1){\n int m=(l+r)/2;\n if(rui[m]-rui[i]+m-i-1<=W) l=m;\n else r=m;\n }\n \n int l2=i+1,r2=N+1;\n while(r2-l2>1){\n int m2=(l2+r2)/2;\n if(rui[m2]-rui[i]+mid*(m2-i-1)>=W) r2=m2;\n else l2=m2;\n }\n \n if(r2<=l){\n dp[r2]++;\n dp[l+1]--;\n }\n }\n \n if(dp[N]) right=mid;\n else left=mid;\n }\n cout<<right<<endl;\n }\n}","accuracy":1,"time_ms":3890,"memory_kb":4408,"score_of_the_acc":-0.8316,"final_rank":16},{"submission_id":"aoj_1333_5268618","code_snippet":"#include <iostream>\n#include <numeric>\n#include <vector>\n\nusing namespace std;\nusing lint = long long;\n\nbool solve() {\n lint w;\n int n;\n cin >> w >> n;\n if (w == 0) return false;\n\n vector<lint> xs(n);\n for (auto& x : xs) cin >> x;\n xs.insert(xs.begin(), 0);\n partial_sum(xs.begin(), xs.end(), xs.begin());\n\n lint ok = w, ng = 0;\n while (ok - ng > 1) {\n lint mid = (ok + ng) / 2;\n vector<int> nxt(n + 1, n);\n\n for (int l = n - 1; l >= 0; --l) {\n nxt[l] = nxt[l + 1];\n\n if ((xs[n] - xs[l]) + (n - l - 1) <= w) {\n nxt[l] = l;\n continue;\n }\n\n int rng = l, rok = n + 1;\n while (rok - rng > 1) {\n int r = (rok + rng) / 2;\n\n if ((xs[r] - xs[l]) + (r - l - 1) * mid >= w) {\n rok = r;\n } else {\n rng = r;\n }\n }\n\n int r = nxt[rok];\n if ((xs[r] - xs[l]) + (r - l - 1) <= w) nxt[l] = l;\n }\n\n if (nxt[0] == 0) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n\n cout << ok << \"\\n\";\n return true;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while (solve()) {}\n\n return 0;\n}","accuracy":1,"time_ms":2660,"memory_kb":4188,"score_of_the_acc":-0.5787,"final_rank":8},{"submission_id":"aoj_1333_4954914","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, n) for (int i=0; i<(n); ++i)\n#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)\n#define FOR(i, a, n) for (int i=(a); i<(n); ++i)\n#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)\n\n#define SZ(x) ((int)(x).size())\n#define ALL(x) (x).begin(),(x).end()\n\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n#define DEBUG(x) cerr<<#x<<\" = \"<<(x)<<\" (L\"<<__LINE__<<\")\"<<endl;\n\ntemplate<class T>\nostream &operator<<(ostream &os, const vector <T> &v) {\n os << \"[\";\n REP(i, SZ(v)) {\n if (i) os << \", \";\n os << v[i];\n }\n return os << \"]\";\n}\n\ntemplate<class T, class U>\nostream &operator<<(ostream &os, const pair <T, U> &p) {\n return os << \"(\" << p.first << \" \" << p.second << \")\";\n}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {\n if (b < a) {\n a = b;\n return true;\n }\n return false;\n}\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\n\nconst ll MOD = 1e9 + 7;\nconst int INF = INT_MAX / 2;\nconst ll LINF = LLONG_MAX / 2;\nconst ld eps = 1e-9;\n\n\ntemplate<int m>\nstruct mint {\n int x;\n\n mint(int x = 0) : x(((x % m) + m) % m) {}\n\n mint operator-() { return x ? m - x : 0; }\n\n mint &operator+=(mint r) {\n if ((x += r.x) >= m) x -= m;\n return *this;\n }\n\n mint &operator-=(mint r) {\n if ((x -= r.x) < 0) x += m;\n return *this;\n }\n\n mint &operator*=(mint r) {\n x = ((ll) x * r.x) % m;\n return *this;\n }\n\n mint inv() {\n int a = x, b = m, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return u;\n }\n\n mint &operator/=(mint r) { return *this *= r.inv(); }\n\n friend mint operator+(mint l, mint r) { return l += r; }\n\n friend mint operator-(mint l, mint r) { return l -= r; }\n\n friend mint operator*(mint l, mint r) { return l *= r; }\n\n friend mint operator/(mint l, mint r) { return l /= r; }\n\n mint pow(ll n) {\n mint ret = 1, tmp = *this;\n while (n) {\n if (n & 1) ret *= tmp;\n tmp *= tmp, n >>= 1;\n }\n return ret;\n }\n\n friend bool operator==(mint l, mint r) { return l.x == r.x; }\n\n friend bool operator!=(mint l, mint r) { return l.x != r.x; }\n\n friend ostream &operator<<(ostream &os, mint a) {\n return os << a.x;\n }\n\n friend istream &operator>>(istream &is, mint &a) {\n int x;\n is >> x;\n a = x;\n return is;\n }\n};\n\n\ntemplate<typename T>\nstruct Combination {\n int _n = 1;\n vector<T> _fact{1}, _rfact{1};\n\n void extend(int n) {\n if (n <= _n) return;\n _fact.resize(n);\n _rfact.resize(n);\n for (int i = _n; i < n; ++i) _fact[i] = _fact[i - 1] * i;\n _rfact[n - 1] = 1 / _fact[n - 1];\n for (int i = n - 1; i > _n; --i) _rfact[i - 1] = _rfact[i] * i;\n _n = n;\n }\n\n T fact(int k) {\n extend(k + 1);\n return _fact.at(k);\n }\n\n T rfact(int k) {\n extend(k + 1);\n return _rfact.at(k);\n }\n\n T P(int n, int r) {\n if (r < 0 or n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n\n T C(int n, int r) {\n if (r < 0 or n < r) return 0;\n return fact(n) * rfact(r) * rfact(n - r);\n }\n\n T H(int n, int r) {\n return (n == 0 and r == 0) ? 1 : C(n + r - 1, r);\n }\n};\n\n\n\nbool solve() {\n int w, n; cin >> w >> n;\n if (w == 0 and n == 0) return false;\n vi x(n); REP(i, n) cin >> x[i];\n\n vi xs(n+1);\n REP(i, n) xs[i+1] = xs[i] + x[i];\n\n vi dp1(n);\n {\n int r = 0, sum = 0;\n REP(l, n) {\n while (r < n and sum + x[r] + (r - l) <= w) sum += x[r++];\n dp1[l] = r;\n sum -= x[l];\n }\n }\n //DUMP(dp1);\n\n auto check = [&](int s) {\n // 隙間最大s で可能か?\n vi dp2(n, n);\n {\n int r = 0, sum = 0;\n REP(l, n) {\n while (r < n and sum + x[r] + (r - l) * s < w) sum += x[r++];\n if (r < n) dp2[l] = r;\n sum -= x[l];\n }\n }\n //DUMP(dp2);\n\n //{\n // vi dp(n + 1);\n // dp[0] = 1;\n // REP(i, n) {\n // if (dp[i] == 0) continue;\n // for (int j = dp2[i]; j < dp1[i]; ++j) {\n // dp[j + 1] = 1;\n // }\n // }\n // DUMP(dp);\n //}\n\n //{\n vi dp(n+1);\n vi dps(n+2);\n dps[0] = 1, dps[1] = -1;\n dp[0] = 1;\n REP(i, n) {\n if (dp[i] == 0) {\n dp[i+1] = dp[i] + dps[i+1];\n continue;\n }\n //for (int j = dp2[i]; j < dp1[i]; ++j) {\n // dp[j+1] = 1;\n //}\n if (dp2[i] < dp1[i]) {\n ++dps[dp2[i] + 1];\n --dps[dp1[i] + 1];\n }\n dp[i+1] = dp[i] + dps[i+1];\n }\n //DUMP(dp);\n //DUMP(dps);\n //}\n\n for (int i = n; i >= 0; --i) {\n if (dp[i] > 0) {\n int sum = xs[n] - xs[i];\n int cnt = n - i;\n return sum + cnt - 1 <= w;\n }\n }\n return false;\n };\n //while (true) {\n // int y; cin >> y;\n // check(y);\n //}\n\n int ok = w, ng = 0;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n (check(mid) ? ok : ng) = mid;\n }\n cout << ok << endl;\n\n return true;\n}\n\nint main() {\n //ifstream in(\"in.txt\");\n //cin.rdbuf(in.rdbuf());\n while (solve()) {}\n return 0;\n}","accuracy":1,"time_ms":930,"memory_kb":4144,"score_of_the_acc":-0.322,"final_rank":6},{"submission_id":"aoj_1333_4822769","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,int> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n\tfor(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n\tfor(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n\tif(vec_n==-1)vec_n=vec_s.size();\n\tfor(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n\tif(vec_n==-1)vec_n=vec_s.size();\n\tfor(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nint n,m;\nvector<LL> va,vs1,vs2;\nint t[550000];\n\nbool check(int space){\n\tint i,j,k;\n\tLL a,b,c;\n\tint x,y;\n\tvs2.assign(n+1,0);\n\tfor(i=0;i<n;i++){\n\t\tvs2[i+1]=vs2[i]+va[i]+space;\n\t}\n\tmemset(t,0,sizeof(t));\n\ta=1,t[1]=-1;\n\tfor(i=0;i<n;i++){\n\t\ta+=t[i];\n\t\tif(a==0)continue;\n\t\tint z[3]={i,n+1};\n\t\twhile(z[1]-z[0]>1){\n\t\t\tz[2]=(z[0]+z[1])/2;\n\t\t\tb=vs1[z[2]]-vs1[i];\n\t\t\tif(b>m+1)z[1]=z[2];\n\t\t\telse z[0]=z[2];\n\t\t}\n\t\tx=z[1];\n\t\tz[0]=i,z[1]=n+1;\n\t\twhile(z[1]-z[0]>1){\n\t\t\tz[2]=(z[0]+z[1])/2;\n\t\t\tb=vs2[z[2]]-vs2[i];\n\t\t\tif(b>=m+space)z[1]=z[2];\n\t\t\telse z[0]=z[2];\n\t\t}\n\t\ty=z[1];\n\t\tif(x>n)return true;\n\t\tif(y<x)t[y]++,t[x]--;\n\t}\n\treturn false;\n}\n\nint main(){\n\tint i,j,k;\n\tint a,b,c;\n\twhile(cin>>m>>n){\n\t\tif(m==0 && n==0)break;\n\t\tva.clear();\n\t\tvs1.assign(n+1,0);\n\t\tfor(i=0;i<n;i++){\n\t\t\tcin>>a;\n\t\t\tva.push_back(a);\n\t\t\tvs1[i+1]=vs1[i]+va[i]+1;\n\t\t}\n\t\tint z[3]={0,m};\n\t\twhile(z[1]-z[0]>1){\n\t\t\tz[2]=(z[0]+z[1])/2;\n\t\t\tif(check(z[2]))z[1]=z[2];\n\t\t\telse z[0]=z[2];\n\t\t}\n\t\tcout<<z[1]<<endl;\n\t}\n}","accuracy":1,"time_ms":5040,"memory_kb":6136,"score_of_the_acc":-1.6361,"final_rank":19},{"submission_id":"aoj_1333_4333912","code_snippet":"#include <bits/stdc++.h>\n#define int long long\nusing namespace std;\n\nconst int INF = 80010;\n\nint w,n,a[50010],s[50010],dp[50010];\n\nbool check(int x){\n\tdp[1] = 1;\n\tint l = 0,r = 0;\n\tfor(int i = 1;i <= n;i++){\n\t\twhile(i > l && s[i] - s[l] + (i - l - 1) > w) l++;\n\t\twhile(i > r && s[i] - s[r] + (i - r - 1) * x >= w) r++;\n\t\tdp[i + 1] = dp[i] + !!(dp[r] - dp[l]);\n\t}\n\tl = n;\n\twhile(l >= 0 && s[n] - s[l] + n - l - 1 < w) l--;\n\treturn dp[n + 1] - dp[l + 1];\n}\n\nvoid solve(){\n\tfor(int i = 0;i < n;i++){\n\t\tscanf(\"%lld\",&a[i]);\n\t\ts[i + 1] = s[i] + a[i];\n\t}\n\tint ng = 0,ok = INF;\n\twhile(ok - ng > 1){\n\t\tint mid = (ok + ng) / 2;\n\t\tif(check(mid)) ok = mid;\n\t\telse ng = mid;\n\t}\n\tprintf(\"%lld\\n\",ok);\n}\n\nsigned main(){\n\twhile(cin >> w >> n,n) solve();\n}","accuracy":1,"time_ms":730,"memory_kb":4356,"score_of_the_acc":-0.3733,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_1333_10851267\",\n \"code_snippet\": \"//#include<CSpreadSheet.h>\\n\\n#include<iostream>\\n#include<cmath>\\n#include<cstdio>\\n#include<sstream>\\n#include<cstdlib>\\n#include<string>\\n#include<string.h>\\n#include<cstring>\\n#include<algorithm>\\n#include<vector>\\n#include<map>\\n#include<set>\\n#include<stack>\\n#include<list>\\n#include<queue>\\n#include<ctime>\\n#include<bitset>\\n#include<cmath>\\n#define eps 1e-6\\n#define INF 0x3f3f3f3f\\n#define PI acos(-1.0)\\n#define ll __int64\\n#define LL long long\\n#define lson l,m,(rt<<1)\\n#define rson m+1,r,(rt<<1)|1\\n#define M 1000000007\\n//#pragma comment(linker, \\\"/STACK:1024000000,1024000000\\\")\\nusing namespace std;\\n\\n#define Maxn 51000\\n\\nbool dp[Maxn];\\nint n,w;\\nLL sum[Maxn];\\n\\nbool iscan(int m)\\n{\\n if(sum[n]+n-1<=w)\\n return true;\\n\\n memset(dp,0,sizeof(dp));\\n dp[0]=1;\\n int la=0;\\n\\n for(int i=0;i<=n-2;i++)\\n {\\n if(!dp[i])\\n continue;\\n for(int j=max(i+1,la+1);j<=n;j++)\\n {\\n if(sum[j]-sum[i]+j-i-1>w)\\n break;\\n if(sum[j]-sum[i]+(j-i-1)*m<w)\\n continue;\\n dp[j]=true;\\n la=j;\\n if(sum[n]-sum[j]+n-j-1<=w)\\n return true;\\n }\\n }\\n return false;\\n}\\nint main()\\n{\\n //freopen(\\\"in.txt\\\",\\\"r\\\",stdin);\\n //freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n while(scanf(\\\"%d%d\\\",&w,&n)&&w+n)\\n {\\n sum[0]=0;\\n for(int i=1;i<=n;i++)\\n {\\n LL temp;\\n scanf(\\\"%lld\\\",&temp);\\n sum[i]=sum[i-1]+temp;\\n }\\n int l=1,r=w,m,ans;\\n\\n while(l<=r)\\n {\\n m=(l+r)>>1;\\n if(iscan(m))\\n {\\n ans=m;\\n r=m-1;\\n }\\n else\\n l=m+1;\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.206,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1333_9796048\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\ntemplate<typename T>struct BIT{\\n int n; T all=0; vector<T> val;\\n BIT(int _n=0):n(_n),val(_n+10){}\\n void clear(){val.assign(n+10,0); all=T();}\\n void add(int i,T x){\\n for(i++;i<=n;i+=(i&-i))val[i]=val[i]+x;\\n all+=x;\\n }\\n T sum(int i){\\n T res=0;\\n for(;i;i-=(i&-i))res+=val[i];\\n return res;\\n }\\n T sum(int L,int R){return sum(R)-sum(L);} // [L,R)\\n\\n int lower_bound(T x){\\n int ret=0,len=1;\\n while(2*len<=n)len<<=1;\\n for(;len>=1;len>>=1){\\n if(ret+len<=n and val[ret+len]<x){\\n ret+=len;\\n x-=val[ret];\\n }\\n }\\n return ret;\\n }\\n};\\n\\n/**\\n * @brief Binary Indexed Tree\\n */\\n\\nint main() {\\nwhile(1) {\\n ll M, N;\\n cin >> M >> N;\\n if (N == 0) return 0;\\n vector<ll> X(N);\\n rep(i,0,N) cin >> X[i];\\n vector<ll> XS(N+1,0);\\n rep(i,0,N) XS[i+1] = XS[i] + X[i];\\n auto Calc = [&](int L, int R, ll Len) -> ll {\\n return XS[R] - XS[L] + Len*(R-L-1);\\n };\\n auto Judge = [&](ll Len) -> bool {\\n BIT<ll> Seg(N);\\n Seg.add(0,1);\\n rep(i,1,N) {\\n int NG = -1, OK = i;\\n while(OK - NG > 1) {\\n int MID = (OK + NG) / 2;\\n if (Calc(MID,i,1LL) <= M) OK = MID;\\n else NG = MID;\\n }\\n int Left = OK;\\n OK = -1, NG = i;\\n while(NG - OK > 1) {\\n int MID = (OK + NG) / 2;\\n if (Calc(MID,i,Len) >= M) OK = MID;\\n else NG = MID;\\n }\\n int Right = OK;\\n if (Seg.sum(Left, Right+1) >= 1) Seg.add(i,1);\\n }\\n {\\n int NG = -1, OK = N;\\n while(OK - NG > 1) {\\n int MID = (OK + NG) / 2;\\n if (Calc(MID,N,1LL) <= M) OK = MID;\\n else NG = MID;\\n }\\n if (Seg.sum(OK,N) >= 1) return true;\\n else return false;\\n }\\n };\\n {\\n int OK = M, NG = 0;\\n while(OK - NG > 1) {\\n int MID = (OK + NG) / 2;\\n if (Judge(MID)) OK = MID;\\n else NG = MID;\\n }\\n cout << OK << endl;\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6710,\n \"memory_kb\": 4268,\n \"score_of_the_acc\": -1.171,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1333_8527795\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n while (1) {\\n int w, n;\\n cin >> w >> n;\\n if (!w)\\n break;\\n vector<int> x(n);\\n rep(i, n) cin >> x[i];\\n vector<ll> sum(n + 1, 0);\\n rep(i, n) sum[i + 1] = sum[i] + x[i];\\n auto check1 = [&](int l, int r) {\\n return sum[r] - sum[l] + r - l - 1 <= w;\\n };\\n auto check2 = [&](int l, int r, ll k) {\\n return sum[r] - sum[l] + k * (r - l - 1) < w;\\n };\\n int ok = w, ng = 0;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n vector<int> dp(n + 2, 0);\\n dp[0] = 1, dp[1] = -1;\\n int idx1 = 0, idx2 = 0;\\n bool f = false;\\n rep(i, n) {\\n if (i)\\n dp[i] += dp[i - 1];\\n while (idx1 < n + 1 && check1(i, idx1)) idx1++;\\n while (idx2 < n + 1 && check2(i, idx2, mid)) idx2++;\\n if (dp[i]) {\\n if (idx1 == n + 1)\\n f = true;\\n else\\n dp[idx2]++, dp[idx1]--;\\n }\\n }\\n (f ? ok : ng) = mid;\\n }\\n cout << ok << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.2089,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1333_8516434\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nbool is_end = false;\\n\\ntemplate< typename Monoid >\\nstruct SegmentTree {\\n\\tusing F = function< Monoid(Monoid, Monoid) >;\\n\\n\\tint sz;\\n\\tvector< Monoid > seg;\\n\\n\\tconst F f;\\n\\tconst Monoid M1;\\n\\n\\tSegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {\\n\\t\\tsz = 1;\\n\\t\\twhile(sz < n) sz <<= 1;\\n\\t\\tseg.assign(2 * sz, M1);\\n\\t}\\n\\n\\tvoid set(int k, const Monoid &x) {\\n\\t\\tseg[k + sz] = x;\\n\\t}\\n\\n\\tvoid build() {\\n\\t\\tfor(int k = sz - 1; k > 0; k--) {\\n\\t\\t\\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid update(int k, const Monoid &x) {\\n\\t\\tk += sz;\\n\\t\\tseg[k] = x;\\n\\t\\twhile(k >>= 1) {\\n\\t\\t\\tseg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tMonoid query(int a, int b) {\\n\\t\\tMonoid L = M1, R = M1;\\n\\t\\tfor(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n\\t\\t\\tif(a & 1) L = f(L, seg[a++]);\\n\\t\\t\\tif(b & 1) R = f(seg[--b], R);\\n\\t\\t}\\n\\t\\treturn f(L, R);\\n\\t}\\n\\n\\tMonoid operator[](const int &k) const {\\n\\t\\treturn seg[k + sz];\\n\\t}\\n\\t\\n};\\n\\nll op(ll a, ll b) {return max(a, b);}\\nll e = 0;\\n\\nbool isOK(ll mid, ll W, vector<ll> &A)\\n{\\n\\tll N = A.size();\\n\\t\\n\\tvector<ll> lower(N+1, 0), upper(N+1, 0);\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tlower[i+1] = lower[i] + A[i] + 1;\\n\\t\\tupper[i+1] = upper[i] + A[i] + mid;\\n\\t}\\n\\t\\n\\tll lst = 0;\\n\\tSegmentTree<ll> seg(N+1, op, e);\\n\\tseg.update(0, 1);\\n\\t\\n\\t// cerr << mid << endl;\\n\\tfor (ll i = 1; i <= N; ++i)\\n\\t{\\n\\t\\tauto itrl = lower_bound(lower.begin(), lower.end(), lower[i] - (W + 1));\\n\\t\\tll mn = itrl - lower.begin();\\n\\t\\tauto itru = upper_bound(upper.begin(), upper.end(), upper[i] - (W + mid));\\n\\t\\tll mx = itru - upper.begin() - 1;\\n\\t\\t\\n\\t\\tmx = min(mx, i-2);\\n\\t\\tif (mx < 0) continue;\\n\\t\\t\\n\\t\\tll res = seg.query(mn, mx+1);\\n\\t\\tseg.update(i, res);\\n\\t\\tif (res > 0) {lst = i;}\\n\\t\\t// cerr << i << \\\": \\\" << mx << \\\" \\\" << mn << \\\" \\\" << res << endl;\\n\\t}\\n\\t\\n\\treturn lower[N] - lower[lst] <= W + 1;\\n}\\n\\n\\nvoid calc()\\n{\\n\\tll W, N; cin >> W >> N;\\n\\t\\n\\tif (W == 0 && N == 0)\\n\\t{\\n\\t\\tis_end = true;\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tvector<ll> A(N);\\n\\tfor (int i = 0; i < N; ++i) {cin >> A[i];}\\n\\t\\n\\tll ng = 0, ok = W;\\n\\twhile (abs(ok - ng) > 1)\\n\\t{\\n\\t\\tll mid = (ok + ng) / 2;\\n\\t\\tif (isOK(mid, W, A)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t\\n\\tcout << ok << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\twhile (!is_end)\\n\\t{\\n\\t\\tcalc();\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7660,\n \"memory_kb\": 5208,\n \"score_of_the_acc\": -1.6537,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1333_7177685\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int w,n;\\n while(cin >> w >> n,n){\\n vector<int> x(n);\\n vector<ll> sum(n+1);\\n for(int i=0;i<n;i++){\\n cin >> x[i];\\n sum[i+1] = sum[i]+x[i];\\n }\\n auto slv = [&](ll mid)->bool{\\n vector<int> dp(n+2);\\n dp[0] = 1; dp[1] = -1;\\n for(int i=0;i<n;i++){\\n dp[i+1] += dp[i];\\n if(!dp[i]) continue;\\n int l = i, r = n;\\n while(r-l>1){\\n int m = (l+r)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(ll)(m-i)*mid >= w){\\n r = m;\\n }\\n else{\\n l = m;\\n }\\n }\\n if(r == n) return true;\\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\\n int nl = r, nr = n;\\n while(nr-nl>1){\\n int m = (nl+nr)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(m-i) <= w){\\n nl = m;\\n }\\n else{\\n nr = m;\\n }\\n }\\n // [r,nl]\\n dp[r+1]++;\\n dp[nl+2]--;\\n if(nl+1 == n) return true; // 枝刈り\\n }\\n return dp[n];\\n };\\n int l = 0, r = w;\\n while(r-l>1){\\n int mid = (l+r)/2;\\n if(slv(mid)){\\n r = mid;\\n }\\n else{\\n l = mid;\\n }\\n }\\n cout << r << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4160,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.6706,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1333_7177673\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int w,n;\\n while(cin >> w >> n,n){\\n vector<int> x(n);\\n vector<ll> sum(n+1);\\n for(int i=0;i<n;i++){\\n cin >> x[i];\\n sum[i+1] = sum[i]+x[i];\\n }\\n auto slv = [&](ll mid)->bool{\\n vector<int> dp(n+2);\\n dp[0] = 1; dp[1] = -1;\\n for(int i=0;i<n;i++){\\n dp[i+1] += dp[i];\\n if(!dp[i]) continue;\\n { // 枝刈り\\n ll s = sum[n]-sum[i];\\n if(s+(ll)(n-1-i)*mid < w) return true;\\n }\\n int l = i, r = n;\\n while(r-l>1){\\n int m = (l+r)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(ll)(m-i)*mid >= w){\\n r = m;\\n }\\n else{\\n l = m;\\n }\\n }\\n // if(r == n) return true;\\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\\n int nl = r, nr = n;\\n while(nr-nl>1){\\n int m = (nl+nr)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(m-i) <= w){\\n nl = m;\\n }\\n else{\\n nr = m;\\n }\\n }\\n // [r,nl]\\n dp[r+1]++;\\n dp[min(n+1,nl+2)]--;\\n }\\n return dp[n];\\n };\\n int l = 0, r = w;\\n while(r-l>1){\\n int mid = (l+r)/2;\\n if(slv(mid)){\\n r = mid;\\n }\\n else{\\n l = mid;\\n }\\n }\\n cout << r << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4220,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.7103,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1333_7177662\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <cstdio>\\n#include <ctime>\\n#include <assert.h>\\n#include <chrono>\\n#include <random>\\n#include <numeric>\\n#include <set>\\n#include <deque>\\n#include <stack>\\n#include <sstream>\\n#include <utility>\\n#include <cstring>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <tuple>\\n#include <array>\\n#include <bitset>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int w,n;\\n while(cin >> w >> n,n){\\n vector<int> x(n);\\n vector<ll> sum(n+1);\\n for(int i=0;i<n;i++){\\n cin >> x[i];\\n sum[i+1] = sum[i]+x[i];\\n }\\n auto slv = [&](ll mid)->bool{\\n vector<int> dp(n+2);\\n dp[0] = 1; dp[1] = -1;\\n for(int i=0;i<n;i++){\\n dp[i+1] += dp[i];\\n if(!dp[i]) continue;\\n int l = i, r = n;\\n while(r-l>1){\\n int m = (l+r)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(ll)(m-i)*mid >= w){\\n r = m;\\n }\\n else{\\n l = m;\\n }\\n }\\n if(r == n) return true;\\n if(sum[r+1]-sum[i]+(r-i) > w) continue;\\n int nl = r, nr = n;\\n while(nr-nl>1){\\n int m = (nl+nr)/2;\\n ll s = sum[m+1]-sum[i];\\n if(s+(m-i) <= w){\\n nl = m;\\n }\\n else{\\n nr = m;\\n }\\n }\\n // [r,nl]\\n dp[r+1]++;\\n dp[min(n+1,nl+2)]--;\\n }\\n return dp[n];\\n };\\n int l = 0, r = w;\\n while(r-l>1){\\n int mid = (l+r)/2;\\n if(slv(mid)){\\n r = mid;\\n }\\n else{\\n l = mid;\\n }\\n }\\n cout << r << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4170,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.672,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1333_6676969\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\ntemplate<class T> void scan(T& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ cout << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nvoid solve() {\\n int w, n;\\n while(cin >> w >> n) {\\n if(w == 0 && n == 0) break;\\n VEC(int, x, n);\\n vc<int> sum(n + 1, 0);\\n rep(i, n) {\\n sum[i + 1] = sum[i] + x[i];\\n }\\n auto check = [&](int len) -> bool {\\n debug(len);\\n vc<int> dp(n + 2, 0);\\n dp[0] = 1;\\n dp[1] = -1;\\n rep(i, n) {\\n if(i - 1 >= 0) dp[i] += dp[i - 1];\\n if(dp[i] == 0) continue;\\n debug(i, dp[i]);\\n // debug(i, sum[n] - sum[i] + (n - i - 1));\\n if(sum[n] - sum[i] + (n - i - 1) <= w) return true;\\n int ok = i + 2, ng = n;\\n auto ck1 = [&](int id) -> bool {\\n // debug(i, id, sum[id] - sum[i] + id - i - 1);\\n return sum[id] - sum[i] + (id - i - 1) <= w;\\n };\\n while(ng - ok > 1) {\\n int mid = (ok + ng) / 2;\\n if(ck1(mid)) ok = mid;\\n else ng = mid;\\n }\\n debug(i, ok);\\n int mx = ok;\\n ng = i + 1;\\n auto ck2 = [&](int id) -> bool {\\n if(sum[id] - sum[i] > w) return false;\\n // (w - (sum[id] - sum[i])) / (id - i - 1) <= len\\n return len * (id - i - 1) >= w - (sum[id] - sum[i]);\\n };\\n if(!ck2(mx)) continue;\\n while(ok - ng > 1) {\\n int mid = (ok + ng) / 2;\\n if(ck2(mid)) ok = mid;\\n else ng = mid;\\n }\\n debug(i, ok, mx);\\n dp[ok] ++;\\n dp[mx + 1] --;\\n }\\n return false;\\n };\\n int ok = w, ng = 0;\\n while(ok - ng > 1) {\\n int mid = (ok + ng) / 2;\\n if(check(mid)) ok = mid;\\n else ng = mid;\\n }\\n out(ok);\\n }\\n}\\n\\nsigned main() {\\n int testcase = 1;\\n // in(testcase);\\n while(testcase--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3030,\n \"memory_kb\": 4296,\n \"score_of_the_acc\": -0.6704,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1333_6663561\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\\n#define all(x) begin(x), end(x)\\ntemplate <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int W, N;\\n cin >> W >> N;\\n if (W == 0) break;\\n vector<ll> x(N);\\n for (auto& y : x) cin >> y;\\n x.push_back(1e9);\\n int lb = 0, ub = W;\\n while (ub - lb > 1) {\\n int m = (lb + ub) / 2;\\n vector<int> reachable(N+2);\\n ll small = x[0] + m, big = x[0] + 1;\\n int j = 0, k = 0;\\n reachable[0] = 1;\\n reachable[1] = -1;\\n bool ok = true;\\n\\n rep(i,0,N) {\\n while (j < N && small < W+m) {\\n small += x[++j] + m;\\n }\\n while (k < N && big <= W+1) {\\n big += x[++k] + 1;\\n }\\n if (reachable[i] && min(j+1, N) < k+1) {\\n ++reachable[min(j+1, N)];\\n --reachable[k+1];\\n }\\n small -= x[i] + m;\\n big -= x[i] + 1;\\n reachable[i+1] += reachable[i];\\n }\\n if (reachable[N]) {\\n ub = m;\\n } else {\\n lb = m;\\n }\\n }\\n cout << ub << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 4164,\n \"score_of_the_acc\": -0.2753,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1333_6366925\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.03.01 15:08:03 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region fenwick_tree\\n\\ntemplate <class T = long long>\\nstruct binary_indexed_tree {\\n\\tstd::vector<T> data;\\n\\tint n;\\n\\tint pw2 = 1;\\n\\tbinary_indexed_tree(const int &sz) : data(sz + 1, 0), n(sz) {\\n\\t\\twhile(pw2 << 1 <= n) pw2 <<= 1;\\n\\t}\\n\\tvoid add(const int &place, const T &val, const int &index = 0) {\\n\\t\\tfor(int x = place + 1 - index; x <= n; x += x & -x) data[x] += val;\\n\\t}\\n\\n\\t// [0, a)\\n\\tconst T sum0(const int &a, const int &index = 0) const {\\n\\t\\tT ret = 0;\\n\\t\\tfor(int x = a - index; x > 0; x -= x & -x) ret += data[x];\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// [0, b)\\n\\tconst T sum(const int &a, const int &b, const int &index = 0) const { return sum0(b, index) - sum0(a, index); }\\n\\n\\t// point get\\n\\tconst T get(const int &idx) const { return sum(idx, idx + 1, 0); }\\n\\tconst T operator[](const int &idx) const { return get(idx); }\\n\\n\\tvoid update(const int &place, const T &val, const int &index = 0) {\\n\\t\\tadd(place, val + sum0(place, index) - sum0(place + 1, index), index);\\n\\t}\\n\\n\\t/*\\n\\t\\tconstraints: for all $i, data[i] >= 0\\n\\t\\treturns $i which satisfies:\\n\\t\\t\\tstart <= i,\\n\\t\\t\\tsum[start, i-1) < val <= \\\\sum_[start, i)\\n\\t\\tsum[start, n+1) := infinity, sum[start, start-1] := -infinity\\n\\t*/\\n\\tconst int lower_bound(T val, const int &start = 0) const {\\n\\t\\tif(val <= 0) return start;\\n\\t\\tval += sum0(start);\\n\\t\\tint x = 0;\\n\\t\\tfor(int k = pw2; k > 0; k >>= 1) {\\n\\t\\t\\tif(x + k <= n && data[x + k] < val) {\\n\\t\\t\\t\\tval -= data[x + k];\\n\\t\\t\\t\\tx += k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn x + 1;\\n\\t}\\n\\n\\t/*\\n\\t\\tconstraints: for all $i, data[i] >= 0\\n\\t\\treturns $i which satisfies:\\n\\t\\t\\tstart <= i,\\n\\t\\t\\tsum[start, i-1) <= val < \\\\sum_[start, i) .\\n\\t\\tsum[start, n+1) := infinity, sum[start, start-1] := -infinity\\n\\t*/\\n\\tconst int upper_bound(T val, const int &start = 0) const {\\n\\t\\tif(val < 0) return start;\\n\\t\\tval += sum0(start);\\n\\t\\tint x = 0;\\n\\t\\tfor(int k = pw2; k > 0; k >>= 1) {\\n\\t\\t\\tif(x + k <= n && data[x + k] <= val) {\\n\\t\\t\\t\\tval -= data[x + k];\\n\\t\\t\\t\\tx += k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn x + 1;\\n\\t}\\n\\n\\tvoid print() const {\\n#ifdef LOCAL\\n\\t\\tstd::cerr << \\\"{ \\\";\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tstd::cerr << get(i) << (i == n - 1 ? \\\" }\\\\n\\\" : \\\", \\\");\\n\\t\\t}\\n#endif\\n\\t}\\n};\\n\\n#pragma endregion\\n\\nint solve(int w) {\\n\\tint n;\\n\\tcin >> n;\\n\\tVEC(int, lens, n);\\n\\t// binary_indexed_tree<ll> len_sum(n);\\n\\t// rep(i, n) len_sum.add(i, ll(lens[i]));\\n\\n\\tauto bs = [](int ok, int ng, auto is_ok) -> int {\\n\\t\\twhile(abs(ok - ng) > 1) {\\n\\t\\t\\tint mid = (ok + ng) / 2;\\n\\t\\t\\t(is_ok(mid) ? ok : ng) = mid;\\n\\t\\t}\\n\\t\\treturn ok;\\n\\t};\\n\\n\\tauto judge = [&](int maxspacelength) -> bool {\\n\\t\\t// vector<int> dp(n);\\n\\t\\t// dp.front() = 1;\\n\\t\\t// auto len_minimum = [&](int lef, int rig) -> ll {\\n\\t\\t// \\tassert(lef-\\\\\\\\ \\\\\\\\< rig);\\n\\t\\t// \\treturn len_sum.s\\\\um(lef, rig, 0) + ll(rig - lef - 1);\\n\\t\\t// };\\n\\t\\t// auto len_maximum = [&](int lef, int rig) {\\n\\t\\t// \\tassert(lef < rig);\\n\\t\\t// \\treturn len_sum.sum(lef, rig) + ll(rig - lef - 1) * maxspacelength;\\n\\t\\t// };\\n\\n\\t\\tbinary_indexed_tree<int> dp(n);\\n\\t\\tdp.add(0, 1);\\n\\t\\tint nxt = 1;\\n\\t\\t// auto traceable = [&](int from) {\\n\\t\\t// \\tll maxlen = len_maximum(from, nxt);\\n\\t\\t// \\treturn maxlen >= ll(w);\\n\\t\\t// };\\n\\t\\t// auto packable = [&](int from) {\\n\\t\\t// \\tll minilen = len_minimum(from, nxt);\\n\\t\\t// \\treturn minilen <= ll(w);\\n\\t\\t// };\\n\\n\\t\\tint left = 0;\\n\\t\\tint right = 0;\\n\\t\\t// left = right = lens.front();\\n\\t\\tll minlensum = -1;\\n\\t\\tll maxlensum = -maxspacelength;\\n\\t\\tint sum = 0;\\n\\t\\tfor(; nxt <= n; nxt++) {\\n\\t\\t\\tdebug(left, right, nxt, maxspacelength);\\n\\t\\t\\tminlensum += 1 + lens[nxt - 1];\\n\\t\\t\\tmaxlensum += maxspacelength + lens[nxt - 1];\\n\\t\\t\\tdebug(minlensum, maxlensum);\\n\\t\\t\\twhile(minlensum > w) {\\n\\t\\t\\t\\tdebug(left);\\n\\t\\t\\t\\tminlensum -= lens[left] + 1;\\n\\t\\t\\t\\t// sum -= dp[left++];\\n\\t\\t\\t\\tleft++;\\n\\t\\t\\t}\\n\\t\\t\\tif(nxt == n) return dp.sum(left, n);\\n\\t\\t\\t// maxlensum += maxspacelength + lens[nxt];\\n\\t\\t\\twhile(maxlensum >= w && right + 1 < nxt) {\\n\\t\\t\\t\\tdebug(right);\\n\\t\\t\\t\\tmaxlensum -= maxspacelength + lens[right];\\n\\t\\t\\t\\t// sum += dp[right++];\\n\\t\\t\\t\\tright++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tdebug(left, right);\\n\\n\\t\\t\\t// if(nxt == n - 1) break;\\n\\t\\t\\t// int left = bs(nxt - 1, -1, packable);\\n\\t\\t\\t// int right = bs(-1, nxt, traceable);\\n\\t\\t\\t// if(right == nxt - 1) right--;\\n\\t\\t\\tif(right < left) continue;\\n\\t\\t\\t// int righttemp = right;\\n\\t\\t\\t// if(right == nxt ) righttemp--;\\n\\t\\t\\tsum = dp.sum(left, right);\\n\\t\\t\\tif(sum > 0) dp.add(nxt, 1);\\n\\t\\t}\\n\\t\\t// left = bs(n, -1, packable);\\n\\t\\treturn bool(dp.sum(left, n));\\n\\t};\\n\\n\\treturn bs(w + 10, 0, judge);\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint w;\\n\\twhile(cin >> w && w) {\\n\\t\\tcout << solve(w) << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1600,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.2195,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1333_6085440\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll=long long int;\\nconst int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;\\ntemplate<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\n\\n\\n\\nint main(){\\n int W,n;\\n while(cin>>W>>n){\\n if(n==0)break;\\n vector<int> a(n);\\n rep(i,0,n)cin>>a[i];\\n vector<int> rui(n+1);\\n rep(i,0,n)rui[i+1]=rui[i]+a[i];\\n\\n auto ok1=[&](int L,int R)->bool{\\n return rui[R+1]-rui[L]+R-L<=W;\\n };\\n auto ok2=[&](int L,int R,int x)->bool{\\n return rui[R+1]-rui[L]+(R-L)*x>=W;\\n };\\n auto check=[&](int x)->bool{\\n if(ok1(0,n-1))return true;\\n vector<int> dp(n+1);\\n dp[0]=1;\\n int sum=0,ok=0,ng=0;\\n rep(i,0,n){\\n while(ng<=i and !ok1(ng,i)){\\n if(dp[ng])sum--;\\n ng++;\\n }\\n while(ok<=i and ok2(ok,i,x)){\\n if(dp[ok])sum++;\\n ok++;\\n }\\n if(sum){\\n dp[i+1]=1;\\n if(ok1(i+1,n-1))return true;\\n }\\n }\\n return false;\\n };\\n\\n int L=0,R=W;\\n while(R-L>1){\\n int mid=(L+R)>>1;\\n if(check(mid))R=mid;\\n else L=mid;\\n }\\n cout<<R<<'\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 830,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.129,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1333_6066013\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\ntemplate <class T>\\nstruct BIT {\\n int N;\\n vector<T> bit;\\n BIT(int N) : N(N) { bit = vector<T>(N + 1, T(0)); }\\n void add(int i, T x) {\\n i++;\\n while (i <= N) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n return;\\n }\\n T sum(int i) {\\n i++;\\n T res = T(0);\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) { // [l,r]\\n assert(l <= r);\\n if (l == 0)\\n return sum(r);\\n else\\n return sum(r) - sum(l - 1);\\n }\\n};\\n\\nbool solve() {\\n ll W;\\n int N;\\n cin >> W >> N;\\n if (W == 0 && N == 0) return false;\\n vector<ll> x(N);\\n cin >> x;\\n\\n vector<ll> y(N + 1);\\n for (int i = 0; i < N; i++) y[i + 1] = y[i] + x[i];\\n\\n auto range = [&](ll a, ll b, int id, ll K) {\\n int L, R;\\n {\\n int l = -1, r = id;\\n while (r - l > 1) {\\n int mid = (l + r) / 2;\\n if (y[mid] + mid >= a)\\n r = mid;\\n else\\n l = mid;\\n }\\n L = r;\\n }\\n {\\n if (y[0] > b) return make_pair(1, 0);\\n int l = 0, r = id;\\n while (r - l > 1) {\\n int mid = (l + r) / 2;\\n if (y[mid] + K * mid <= b)\\n l = mid;\\n else\\n r = mid;\\n }\\n R = l;\\n }\\n return make_pair(L, R);\\n };\\n\\n auto check = [&](ll K) {\\n BIT<int> bit(N + 1);\\n bit.add(0, 1);\\n for (int i = 1; i <= N; i++) {\\n ll a = i - 1 + y[i] - W;\\n ll b = K * (i - 1) + y[i] - W;\\n auto [l, r] = range(a, b, i, K);\\n if (l > r) continue;\\n if (bit.sum(l, r) > 0) bit.add(i, 1);\\n }\\n for (int i = 0; i <= N; i++) {\\n if (bit.sum(i, i) == 0) continue;\\n if (y[N] - y[i] + (N - i - 1) * K <= W) return true;\\n }\\n return false;\\n };\\n\\n ll l = 0, r = W;\\n while (r - l > 1) {\\n ll mid = (l + r) / 2ll;\\n if (check(mid))\\n r = mid;\\n else\\n l = mid;\\n }\\n cout << r << endl;\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n while (solve()) {}\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6070,\n \"memory_kb\": 4192,\n \"score_of_the_acc\": -1.0538,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1333_5896208\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n ll W, N;\\n while (cin >> W >> N, W) {\\n W++;\\n vector<ll> X(N);\\n for (auto&& x : X) {\\n cin >> x;\\n x++;\\n }\\n vector<ll> acc(N + 1);\\n for (int i = 0; i < N; i++) {\\n acc[i + 1] = acc[i] + X[i];\\n }\\n\\n vector<ll> accwithspace(N + 1);\\n vector<int> imos(N + 1);\\n auto check = [&](ll maxspace) {\\n accwithspace[0] = 0;\\n for (int i = 0; i < N; i++) {\\n accwithspace[i + 1] = accwithspace[i] + X[i] + maxspace;\\n }\\n imos[0] = 0;\\n for (int i = 0; i < N; i++) {\\n bool canbefront = false;\\n if (i == 0)\\n canbefront = true;\\n else if (i == 1)\\n canbefront = false;\\n else {\\n int l, r;\\n l = lower_bound(cbegin(acc), cend(acc), acc[i] - W) - acc.begin();\\n r = lower_bound(cbegin(accwithspace), cend(accwithspace), accwithspace[i] - maxspace - W + 1) - accwithspace.begin();\\n canbefront = imos[r] - imos[l];\\n }\\n imos[i + 1] = imos[i] + canbefront;\\n if (canbefront && ((acc.back() - acc[i]) <= W))\\n return true;\\n }\\n return false;\\n };\\n\\n int ok = W;\\n int ng = -1;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n if (check(mid)) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n\\n cout << ok + 1 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3490,\n \"memory_kb\": 4328,\n \"score_of_the_acc\": -0.7462,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1333_5896195\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n ll W, N;\\n while (cin >> W >> N, W) {\\n W++;\\n vector<ll> X(N);\\n for (auto&& x : X) {\\n cin >> x;\\n x++;\\n }\\n vector<ll> acc(N + 1);\\n for (int i = 0; i < N; i++) {\\n acc[i + 1] = acc[i] + X[i];\\n }\\n\\n auto check = [&](ll maxspace) {\\n vector<ll> accwithspace(N + 1);\\n for (int i = 0; i < N; i++) {\\n accwithspace[i + 1] = accwithspace[i] + X[i] + maxspace;\\n }\\n vector<int> imos(N + 1);\\n for (int i = 0; i < N; i++) {\\n bool canbefront = false;\\n if (i == 0)\\n canbefront = true;\\n else if (i == 1)\\n canbefront = false;\\n else {\\n int l, r;\\n l = lower_bound(cbegin(acc), cend(acc), acc[i] - W) - acc.begin();\\n r = lower_bound(cbegin(accwithspace), cend(accwithspace), accwithspace[i] - maxspace - W + 1) - accwithspace.begin();\\n canbefront = imos[r] - imos[l];\\n }\\n imos[i + 1] = imos[i] + canbefront;\\n if (canbefront && ((acc.back() - acc[i]) <= W))\\n return true;\\n }\\n return false;\\n };\\n\\n int ok = W;\\n int ng = -1;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n if (check(mid)) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n\\n cout << ok + 1 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3490,\n \"memory_kb\": 4540,\n \"score_of_the_acc\": -0.8253,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1333_5358559\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n while (true){\\n int W, N;\\n cin >> W >> N;\\n if (W == 0 && N == 0){\\n break;\\n }\\n vector<int> x(N);\\n for (int i = 0; i < N; i++){\\n cin >> x[i];\\n }\\n vector<int> S(N + 1);\\n S[0] = 0;\\n for (int i = 0; i < N; i++){\\n S[i + 1] = S[i] + x[i];\\n }\\n int tv = W - 2, fv = 0;\\n while (tv - fv > 1){\\n \\tint mid = (tv + fv) / 2;\\n vector<bool> dp(N + 1, false);\\n dp[0] = true;\\n vector<int> dpS(N + 2, 0);\\n dpS[1] = 1;\\n for (int i = 0; i < N; i++){\\n int tv1 = i, fv1 = -1;\\n while (tv1 - fv1 > 1){\\n int mid1 = (tv1 + fv1) / 2;\\n if (S[i + 1] - S[mid1] + (i - mid1) <= W){\\n tv1 = mid1;\\n } else {\\n fv1 = mid1;\\n }\\n }\\n int tv2 = tv1 - 1, fv2 = i;\\n while (fv2 - tv2 > 1){\\n int mid2 = (tv2 + fv2) / 2;\\n int r = W - (S[i + 1] - S[mid2]);\\n if (r <= mid * (i - mid2)){\\n tv2 = mid2;\\n } else {\\n fv2 = mid2;\\n }\\n }\\n if (dpS[tv2 + 1] - dpS[tv1] > 0){\\n dp[i + 1] = true;\\n }\\n dpS[i + 2] = dpS[i + 1];\\n if (dp[i + 1]){\\n dpS[i + 2]++;\\n }\\n }\\n bool ok = false;\\n for (int i = 0; i <= N; i++){\\n if (dp[i] && S[N] - S[i] + (N - i - 1) <= W){\\n ok = true;\\n }\\n }\\n if (ok){\\n tv = mid;\\n } else {\\n fv = mid;\\n }\\n }\\n cout << tv << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6250,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.8042,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1333_5310475\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=80005,INF=1<<30;\\nll dp[MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n ll W,N;cin>>W>>N;\\n if(W==0) break;\\n vector<ll> A(N+1),rui(N+2);\\n for(int i=0;i<N;i++){\\n cin>>A[i+1];\\n rui[i+1]=rui[i]+A[i+1];\\n }\\n rui[N+1]=1LL<<60;\\n \\n ll left=0,right=W;\\n while(right-left>1){\\n ll mid=(left+right)/2;\\n memset(dp,0,sizeof(dp));\\n dp[0]=1;\\n dp[1]=-1;\\n \\n for(int i=0;i<=N;i++){\\n if(i) dp[i]+=dp[i-1];\\n if(dp[i]==0) continue;\\n if(i==N) break;\\n \\n if(rui[N]-rui[i]+N-i-1<=W){\\n dp[N]=1;\\n break;\\n }\\n int l=i+2,r=N+1;\\n while(r-l>1){\\n int m=(l+r)/2;\\n if(rui[m]-rui[i]+m-i-1<=W) l=m;\\n else r=m;\\n }\\n \\n int l2=i+1,r2=N+1;\\n while(r2-l2>1){\\n int m2=(l2+r2)/2;\\n if(rui[m2]-rui[i]+mid*(m2-i-1)>=W) r2=m2;\\n else l2=m2;\\n }\\n \\n if(r2<=l){\\n dp[r2]++;\\n dp[l+1]--;\\n }\\n }\\n \\n if(dp[N]) right=mid;\\n else left=mid;\\n }\\n cout<<right<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3890,\n \"memory_kb\": 4408,\n \"score_of_the_acc\": -0.8316,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1333_5268618\",\n \"code_snippet\": \"#include <iostream>\\n#include <numeric>\\n#include <vector>\\n\\nusing namespace std;\\nusing lint = long long;\\n\\nbool solve() {\\n lint w;\\n int n;\\n cin >> w >> n;\\n if (w == 0) return false;\\n\\n vector<lint> xs(n);\\n for (auto& x : xs) cin >> x;\\n xs.insert(xs.begin(), 0);\\n partial_sum(xs.begin(), xs.end(), xs.begin());\\n\\n lint ok = w, ng = 0;\\n while (ok - ng > 1) {\\n lint mid = (ok + ng) / 2;\\n vector<int> nxt(n + 1, n);\\n\\n for (int l = n - 1; l >= 0; --l) {\\n nxt[l] = nxt[l + 1];\\n\\n if ((xs[n] - xs[l]) + (n - l - 1) <= w) {\\n nxt[l] = l;\\n continue;\\n }\\n\\n int rng = l, rok = n + 1;\\n while (rok - rng > 1) {\\n int r = (rok + rng) / 2;\\n\\n if ((xs[r] - xs[l]) + (r - l - 1) * mid >= w) {\\n rok = r;\\n } else {\\n rng = r;\\n }\\n }\\n\\n int r = nxt[rok];\\n if ((xs[r] - xs[l]) + (r - l - 1) <= w) nxt[l] = l;\\n }\\n\\n if (nxt[0] == 0) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n\\n cout << ok << \\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n while (solve()) {}\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2660,\n \"memory_kb\": 4188,\n \"score_of_the_acc\": -0.5787,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1333_4954914\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define REP(i, n) for (int i=0; i<(n); ++i)\\n#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)\\n#define FOR(i, a, n) for (int i=(a); i<(n); ++i)\\n#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)\\n\\n#define SZ(x) ((int)(x).size())\\n#define ALL(x) (x).begin(),(x).end()\\n\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n#define DEBUG(x) cerr<<#x<<\\\" = \\\"<<(x)<<\\\" (L\\\"<<__LINE__<<\\\")\\\"<<endl;\\n\\ntemplate<class T>\\nostream &operator<<(ostream &os, const vector <T> &v) {\\n os << \\\"[\\\";\\n REP(i, SZ(v)) {\\n if (i) os << \\\", \\\";\\n os << v[i];\\n }\\n return os << \\\"]\\\";\\n}\\n\\ntemplate<class T, class U>\\nostream &operator<<(ostream &os, const pair <T, U> &p) {\\n return os << \\\"(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";\\n}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {\\n if (b < a) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vi = vector<int>;\\nusing vll = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvll = vector<vll>;\\n\\nconst ll MOD = 1e9 + 7;\\nconst int INF = INT_MAX / 2;\\nconst ll LINF = LLONG_MAX / 2;\\nconst ld eps = 1e-9;\\n\\n\\ntemplate<int m>\\nstruct mint {\\n int x;\\n\\n mint(int x = 0) : x(((x % m) + m) % m) {}\\n\\n mint operator-() { return x ? m - x : 0; }\\n\\n mint &operator+=(mint r) {\\n if ((x += r.x) >= m) x -= m;\\n return *this;\\n }\\n\\n mint &operator-=(mint r) {\\n if ((x -= r.x) < 0) x += m;\\n return *this;\\n }\\n\\n mint &operator*=(mint r) {\\n x = ((ll) x * r.x) % m;\\n return *this;\\n }\\n\\n mint inv() {\\n int a = x, b = m, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return u;\\n }\\n\\n mint &operator/=(mint r) { return *this *= r.inv(); }\\n\\n friend mint operator+(mint l, mint r) { return l += r; }\\n\\n friend mint operator-(mint l, mint r) { return l -= r; }\\n\\n friend mint operator*(mint l, mint r) { return l *= r; }\\n\\n friend mint operator/(mint l, mint r) { return l /= r; }\\n\\n mint pow(ll n) {\\n mint ret = 1, tmp = *this;\\n while (n) {\\n if (n & 1) ret *= tmp;\\n tmp *= tmp, n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend bool operator==(mint l, mint r) { return l.x == r.x; }\\n\\n friend bool operator!=(mint l, mint r) { return l.x != r.x; }\\n\\n friend ostream &operator<<(ostream &os, mint a) {\\n return os << a.x;\\n }\\n\\n friend istream &operator>>(istream &is, mint &a) {\\n int x;\\n is >> x;\\n a = x;\\n return is;\\n }\\n};\\n\\n\\ntemplate<typename T>\\nstruct Combination {\\n int _n = 1;\\n vector<T> _fact{1}, _rfact{1};\\n\\n void extend(int n) {\\n if (n <= _n) return;\\n _fact.resize(n);\\n _rfact.resize(n);\\n for (int i = _n; i < n; ++i) _fact[i] = _fact[i - 1] * i;\\n _rfact[n - 1] = 1 / _fact[n - 1];\\n for (int i = n - 1; i > _n; --i) _rfact[i - 1] = _rfact[i] * i;\\n _n = n;\\n }\\n\\n T fact(int k) {\\n extend(k + 1);\\n return _fact.at(k);\\n }\\n\\n T rfact(int k) {\\n extend(k + 1);\\n return _rfact.at(k);\\n }\\n\\n T P(int n, int r) {\\n if (r < 0 or n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n\\n T C(int n, int r) {\\n if (r < 0 or n < r) return 0;\\n return fact(n) * rfact(r) * rfact(n - r);\\n }\\n\\n T H(int n, int r) {\\n return (n == 0 and r == 0) ? 1 : C(n + r - 1, r);\\n }\\n};\\n\\n\\n\\nbool solve() {\\n int w, n; cin >> w >> n;\\n if (w == 0 and n == 0) return false;\\n vi x(n); REP(i, n) cin >> x[i];\\n\\n vi xs(n+1);\\n REP(i, n) xs[i+1] = xs[i] + x[i];\\n\\n vi dp1(n);\\n {\\n int r = 0, sum = 0;\\n REP(l, n) {\\n while (r < n and sum + x[r] + (r - l) <= w) sum += x[r++];\\n dp1[l] = r;\\n sum -= x[l];\\n }\\n }\\n //DUMP(dp1);\\n\\n auto check = [&](int s) {\\n // 隙間最大s で可能か?\\n vi dp2(n, n);\\n {\\n int r = 0, sum = 0;\\n REP(l, n) {\\n while (r < n and sum + x[r] + (r - l) * s < w) sum += x[r++];\\n if (r < n) dp2[l] = r;\\n sum -= x[l];\\n }\\n }\\n //DUMP(dp2);\\n\\n //{\\n // vi dp(n + 1);\\n // dp[0] = 1;\\n // REP(i, n) {\\n // if (dp[i] == 0) continue;\\n // for (int j = dp2[i]; j < dp1[i]; ++j) {\\n // dp[j + 1] = 1;\\n // }\\n // }\\n // DUMP(dp);\\n //}\\n\\n //{\\n vi dp(n+1);\\n vi dps(n+2);\\n dps[0] = 1, dps[1] = -1;\\n dp[0] = 1;\\n REP(i, n) {\\n if (dp[i] == 0) {\\n dp[i+1] = dp[i] + dps[i+1];\\n continue;\\n }\\n //for (int j = dp2[i]; j < dp1[i]; ++j) {\\n // dp[j+1] = 1;\\n //}\\n if (dp2[i] < dp1[i]) {\\n ++dps[dp2[i] + 1];\\n --dps[dp1[i] + 1];\\n }\\n dp[i+1] = dp[i] + dps[i+1];\\n }\\n //DUMP(dp);\\n //DUMP(dps);\\n //}\\n\\n for (int i = n; i >= 0; --i) {\\n if (dp[i] > 0) {\\n int sum = xs[n] - xs[i];\\n int cnt = n - i;\\n return sum + cnt - 1 <= w;\\n }\\n }\\n return false;\\n };\\n //while (true) {\\n // int y; cin >> y;\\n // check(y);\\n //}\\n\\n int ok = w, ng = 0;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n (check(mid) ? ok : ng) = mid;\\n }\\n cout << ok << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n //ifstream in(\\\"in.txt\\\");\\n //cin.rdbuf(in.rdbuf());\\n while (solve()) {}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 930,\n \"memory_kb\": 4144,\n \"score_of_the_acc\": -0.322,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1333_4822769\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,int> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n\\tfor(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n\\tfor(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n\\tif(vec_n==-1)vec_n=vec_s.size();\\n\\tfor(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n\\tif(vec_n==-1)vec_n=vec_s.size();\\n\\tfor(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nint n,m;\\nvector<LL> va,vs1,vs2;\\nint t[550000];\\n\\nbool check(int space){\\n\\tint i,j,k;\\n\\tLL a,b,c;\\n\\tint x,y;\\n\\tvs2.assign(n+1,0);\\n\\tfor(i=0;i<n;i++){\\n\\t\\tvs2[i+1]=vs2[i]+va[i]+space;\\n\\t}\\n\\tmemset(t,0,sizeof(t));\\n\\ta=1,t[1]=-1;\\n\\tfor(i=0;i<n;i++){\\n\\t\\ta+=t[i];\\n\\t\\tif(a==0)continue;\\n\\t\\tint z[3]={i,n+1};\\n\\t\\twhile(z[1]-z[0]>1){\\n\\t\\t\\tz[2]=(z[0]+z[1])/2;\\n\\t\\t\\tb=vs1[z[2]]-vs1[i];\\n\\t\\t\\tif(b>m+1)z[1]=z[2];\\n\\t\\t\\telse z[0]=z[2];\\n\\t\\t}\\n\\t\\tx=z[1];\\n\\t\\tz[0]=i,z[1]=n+1;\\n\\t\\twhile(z[1]-z[0]>1){\\n\\t\\t\\tz[2]=(z[0]+z[1])/2;\\n\\t\\t\\tb=vs2[z[2]]-vs2[i];\\n\\t\\t\\tif(b>=m+space)z[1]=z[2];\\n\\t\\t\\telse z[0]=z[2];\\n\\t\\t}\\n\\t\\ty=z[1];\\n\\t\\tif(x>n)return true;\\n\\t\\tif(y<x)t[y]++,t[x]--;\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(){\\n\\tint i,j,k;\\n\\tint a,b,c;\\n\\twhile(cin>>m>>n){\\n\\t\\tif(m==0 && n==0)break;\\n\\t\\tva.clear();\\n\\t\\tvs1.assign(n+1,0);\\n\\t\\tfor(i=0;i<n;i++){\\n\\t\\t\\tcin>>a;\\n\\t\\t\\tva.push_back(a);\\n\\t\\t\\tvs1[i+1]=vs1[i]+va[i]+1;\\n\\t\\t}\\n\\t\\tint z[3]={0,m};\\n\\t\\twhile(z[1]-z[0]>1){\\n\\t\\t\\tz[2]=(z[0]+z[1])/2;\\n\\t\\t\\tif(check(z[2]))z[1]=z[2];\\n\\t\\t\\telse z[0]=z[2];\\n\\t\\t}\\n\\t\\tcout<<z[1]<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5040,\n \"memory_kb\": 6136,\n \"score_of_the_acc\": -1.6361,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1333_4333912\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\nusing namespace std;\\n\\nconst int INF = 80010;\\n\\nint w,n,a[50010],s[50010],dp[50010];\\n\\nbool check(int x){\\n\\tdp[1] = 1;\\n\\tint l = 0,r = 0;\\n\\tfor(int i = 1;i <= n;i++){\\n\\t\\twhile(i > l && s[i] - s[l] + (i - l - 1) > w) l++;\\n\\t\\twhile(i > r && s[i] - s[r] + (i - r - 1) * x >= w) r++;\\n\\t\\tdp[i + 1] = dp[i] + !!(dp[r] - dp[l]);\\n\\t}\\n\\tl = n;\\n\\twhile(l >= 0 && s[n] - s[l] + n - l - 1 < w) l--;\\n\\treturn dp[n + 1] - dp[l + 1];\\n}\\n\\nvoid solve(){\\n\\tfor(int i = 0;i < n;i++){\\n\\t\\tscanf(\\\"%lld\\\",&a[i]);\\n\\t\\ts[i + 1] = s[i] + a[i];\\n\\t}\\n\\tint ng = 0,ok = INF;\\n\\twhile(ok - ng > 1){\\n\\t\\tint mid = (ok + ng) / 2;\\n\\t\\tif(check(mid)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\",ok);\\n}\\n\\nsigned main(){\\n\\twhile(cin >> w >> n,n) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 4356,\n \"score_of_the_acc\": -0.3733,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":783,"cells":{"group_id":{"kind":"string","value":"aoj_1330_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nNever Wait for Weights\nIn a laboratory, an assistant, Nathan Wada, is measuring weight differences between sample pieces pair by pair. He is using a balance because it can more precisely measure the weight difference between two samples than a spring scale when the samples have nearly the same weight.\nHe is occasionally asked the weight differences between pairs of samples. He can or cannot answer based on measurement results already obtained.\nSince he is accumulating a massive amount of measurement data, it is now not easy for him to promptly tell the weight differences. Nathan asks you to develop a program that records measurement results and automatically tells the weight differences.\nInput\nThe input consists of multiple datasets. The first line of a dataset contains two integers\nN\nand\nM\n.\nN\ndenotes the number of sample pieces (2 ≤\nN\n≤ 100,000). Each sample is assigned a unique number from 1 to\nN\nas an identifier. The rest of the dataset consists of\nM\nlines (1 ≤\nM\n≤ 100,000), each of which corresponds to either a measurement result or an inquiry. They are given in chronological order.\nA measurement result has the format,\n!\na b w\nwhich represents the sample piece numbered\nb\nis heavier than one numbered\na\nby\nw\nmicrograms (\na\n≠\nb\n). That is,\nw\n=\nw\nb\n−\nw\na\n, where\nw\na\nand\nw\nb\nare the weights of\na\nand\nb\n, respectively. Here,\nw\nis a non-negative integer not exceeding 1,000,000.\nYou may assume that all measurements are exact and consistent.\nAn inquiry has the format,\n?\na b\nwhich asks the weight difference between the sample pieces numbered\na\nand\nb\n(\na\n≠\nb\n).\nThe last dataset is followed by a line consisting of two zeros separated by a space.\nOutput\nFor each inquiry, ?\na\nb\n, print the weight difference in micrograms between the sample pieces numbered\na\nand\nb\n,\nw\nb\n−\nw\na\n, followed by a newline if the weight difference can be computed based on the measurement results prior to the inquiry. The difference can be zero, or negative as well as positive. You can assume that its absolute value is at most 1,000,000. If the difference cannot be computed based on the measurement results prior to the inquiry, print\nUNKNOWN\nfollowed by a newline.\nSample Input\n2 2\n! 1 2 1\n? 1 2\n2 2\n! 1 2 1\n? 2 1\n4 7\n! 1 2 100\n? 2 3\n! 2 3 100\n? 2 3\n? 1 3\n! 4 3 150\n? 4 1\n0 0\nOutput for the Sample Input\n1\n-1\nUNKNOWN\n100\n200\n-50"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1330_11066164","code_snippet":"#include <iostream>\n#include <vector>\n#include <utility>\nusing namespace std;\n\nclass unionfind{\npublic:\n unionfind(int n): n_(n) {\n parent_.resize(n);\n size_.resize(n);\n diff_.resize(n);\n for(int i=0; i<n; i++){\n parent_[i] = i;\n size_[i] = 1;\n diff_[i] = 0;\n }\n }\n // iとjをくっつける その際iから見たjとの差を与える\n void unite(int i, int j, int d){\n int p = root(i);\n int q = root(j);\n if(p==q) return;\n if(size_[p]>size_[q]){\n parent_[q] = p;\n size_[p] += size_[q];\n diff_[q] = diff_[i] + d - diff_[j];\n }else{\n parent_[p] = q;\n size_[q] += size_[p];\n diff_[p] = diff_[j] - d - diff_[i];\n }\n }\n pair<bool,int> diff(int i, int j){\n if(root(i) != root(j)) return make_pair(false, 0);\n return make_pair(true, diff_[j] - diff_[i]);\n }\nprivate:\n int n_;\n vector<int> parent_;\n vector<int> size_;\n vector<int> diff_; // 親から見たの符号付きの差\n\n int root(int i){\n if(parent_[i] == i) return i;\n int r = root(parent_[i]);\n diff_[i] = diff_[parent_[i]] + diff_[i];\n parent_[i] = r;\n return r;\n }\n};\n\nint main(){\n int n,m;\n while(true){\n cin >> n >> m;\n if((n==0) & (m == 0)){\n break;\n }\n unionfind uf(n+1);\n int x,y,d;\n string s;\n pair<bool,int> ret;\n for(int i=0; i<m; i++){\n cin >> s;\n if(s==\"!\"){\n cin >> x >> y >> d;\n uf.unite(x,y,d);\n }else{\n cin >> x >> y;\n ret = uf.diff(x,y);\n if(!ret.first){\n cout << \"UNKNOWN\" << endl;\n }else{\n cout << ret.second << endl;\n } \n }\n }\n }\n}","accuracy":1,"time_ms":970,"memory_kb":4308,"score_of_the_acc":-0.8582,"final_rank":16},{"submission_id":"aoj_1330_10853876","code_snippet":"#include<stdio.h>\n#include<string.h>\n#include<iostream>\n#include<queue>\n#include<algorithm>\n#define maxn 100010\n#define ll long long\nusing namespace std;\nconst int MAXSize = 100010;\nint uset[MAXSize];\nint Rank[MAXSize];\nll w[MAXSize];\n\nvoid makeSet(int Size)\n{\n for(int i = 1; i <= Size; i++)\n {\n uset[i] = i;\n w[i] = 0;\n Rank[i] = 0;\n }\n}\nint Find(int x)\n{\n if (x != uset[x]) return uset[x] = Find(uset[x]);\n return uset[x];\n}\nvoid unionSet(int x, int y,int v)\n{\n int p = x;\n ll vx = 0;\n while(uset[p] != p){\n vx += w[p];\n p = uset[p];\n }\n int py = y;\n ll vy = 0;\n while(uset[py] != py){\n vy += w[py];\n py = uset[py];\n }\n if(p == py)return;\n\n if(Rank[p] < Rank[py]){\n uset[p] = py;\n w[p] = vy - v - vx;\n }else{\n uset[py] = p;\n w[py] = v + vx - vy;\n if (Rank[p] == Rank[py]) Rank[p]++;\n }\n}\n\nvoid Get(int x,int y)\n{\n int p = x;\n ll vx = 0;\n while(uset[p] != p){\n vx += w[p];\n p = uset[p];\n }\n int py = y;\n ll vy = 0;\n while(uset[py] != py){\n vy += w[py];\n py = uset[py];\n }\n if(p == py){\n printf(\"%lld\\n\",vy - vx);\n }else{\n printf(\"UNKNOWN\\n\");\n }\n}\nint main()\n{\n int n,m,a,b,c;\n char NOR;\n while(scanf(\"%d%d\",&n,&m)&&n!=0)\n {\n makeSet(n);\n for(int i=0; i<m; i++)\n {\n getchar();\n scanf(\"%c\",&NOR);\n if(NOR=='!')\n {\n scanf(\"%d%d%d\",&a,&b,&c);\n unionSet(a,b,c);\n }\n else\n {\n scanf(\"%d%d\",&a,&b);\n Get(a,b);\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":5100,"score_of_the_acc":-0.2123,"final_rank":3},{"submission_id":"aoj_1330_10240618","code_snippet":"#line 1 \"1330.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/1330\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/DisjointSetUnion/PotentializedDisjointSetUnion.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/DisjointSetUnion/PotentializedDisjointSetUnion.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <numeric>\n#include <vector>\n\nnamespace zawa {\n\ntemplate <class Group>\nclass PotentializedDisjointSetUnion {\npublic:\n using Value = typename Group::Element;\nprivate:\n usize n_{}, comps_{};\n std::vector<u32> parent_{};\n std::vector<u32> size_{};\n std::vector<Value> potential_{};\n\n u32 leader(u32 v) {\n if (parent_[v] == v) {\n return v;\n }\n else {\n u32 res{leader(parent_[v])};\n potential_[v] = Group::operation(potential_[parent_[v]], potential_[v]);\n return parent_[v] = res;\n }\n }\n Value potential(u32 v) {\n leader(v);\n return potential_[v];\n }\n\npublic:\n\n PotentializedDisjointSetUnion() = default;\n\n PotentializedDisjointSetUnion(u32 n) \n : n_{n}, comps_{n}, parent_(n), size_(n, u32{1}), potential_(n, Group::identity()) {\n std::iota(parent_.begin(), parent_.end(), u32{});\n }\n\n constexpr u32 size() const noexcept {\n return n_;\n }\n\n u32 size(u32 v) {\n leader(v);\n return size_[v];\n }\n\n inline u32 components() const noexcept {\n return comps_;\n }\n\n bool isDefined(u32 u, u32 v) {\n return leader(u) == leader(v);\n }\n\n Value distance(u32 u, u32 v) {\n assert(u < size());\n assert(v < size());\n return Group::operation(Group::inverse(potential(u)), potential(v));\n }\n\n bool merge(u32 u, u32 v, Value value) {\n if (isDefined(u, v)) {\n return distance(u, v) == value;\n }\n comps_--;\n value = Group::operation(potential(u), value);\n value = Group::operation(Group::inverse(potential(v)), value);\n u = leader(u);\n v = leader(v);\n if (size_[u] > size_[v]) {\n value = Group::inverse(value);\n std::swap(u, v);\n }\n size_[u] += size_[v];\n parent_[v] = u;\n potential_[v] = value;\n return true;\n }\n};\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Group/AdditiveGroup.hpp\"\n\nnamespace zawa {\n\ntemplate <class T>\nclass AdditiveGroup {\npublic:\n using Element = T;\n static constexpr T identity() noexcept {\n return T{};\n }\n static constexpr T operation(const T& l, const T& r) noexcept {\n return l + r;\n }\n static constexpr T inverse(const T& v) noexcept {\n return -v;\n }\n};\n\n} // namespace zawa\n#line 6 \"1330.test.cpp\"\n\nusing namespace zawa;\n\n#line 11 \"1330.test.cpp\"\nint N, Q;\nbool solve() {\n std::cin >> N >> Q;\n if (N == 0 and Q == 0) return false;\n PotentializedDisjointSetUnion<AdditiveGroup<int>> dsu(N);\n while (Q--) {\n char t;\n int a, b;\n std::cin >> t >> a >> b;\n a--; b--;\n if (t == '!') {\n int w;\n std::cin >> w;\n dsu.merge(a, b, w);\n }\n else if (t == '?') {\n if (dsu.isDefined(a, b)) std::cout << dsu.distance(a, b) << '\\n';\n else std::cout << \"UNKNOWN\\n\";\n }\n else assert(false);\n }\n return true;\n}\nint main() {\n SetFastIO(); \n while (solve()) ;\n}","accuracy":1,"time_ms":200,"memory_kb":6304,"score_of_the_acc":-0.3644,"final_rank":4},{"submission_id":"aoj_1330_10037453","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nstruct node {\n\tint v;\n\tll dif;\n\tvector<int> chd;\n};\nstruct UnionFind {\n\tvector<node> ps;\n\tUnionFind(int n) : ps(n, {-1, 0, {}}) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tps[i].chd.push_back(i);\n\t\t}\n\t}\n\tint root(int x) {\n\t\tif (ps[x].v < 0)\n\t\t\treturn x;\n\t\telse\n\t\t\treturn ps[x].v = root(ps[x].v);\n\t}\n\tbool same(int x, int y) { return root(x) == root(y); }\n\tvoid unite(int x, int y, int w) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n\t\tif (rx == ry) return;\n\t\tll d = ps[x].dif - (w + ps[y].dif);\n\t\tif (-ps[rx].v < -ps[ry].v) {\n\t\t\tswap(rx, ry);\n\t\t\td *= -1;\n\t\t}\n\t\tfor (auto &ty : ps[ry].chd) {\n\t\t\tps[rx].chd.push_back(ty);\n\t\t\tps[ty].dif += d;\n\t\t}\n\t\tps[ry].chd.clear();\n\t\tps[rx].v += ps[ry].v;\n\t\tps[ry].v = rx;\n\t\treturn;\n\t}\n};\nint main() {\n\twhile (1) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0) break;\n\t\tUnionFind uf(n);\n\t\twhile (m--) {\n\t\t\tstring t;\n\t\t\tcin >> t;\n\t\t\tif (t == \"!\") {\n\t\t\t\tint a, b, w;\n\t\t\t\tcin >> a >> b >> w;\n\t\t\t\ta--;\n\t\t\t\tb--;\n\t\t\t\tuf.unite(a, b, w);\n\t\t\t} else {\n\t\t\t\tint a, b;\n\t\t\t\tcin >> a >> b;\n\t\t\t\ta--;\n\t\t\t\tb--;\n\t\t\t\tif (uf.same(a, b)) {\n\t\t\t\t\tll da = uf.ps[a].dif;\n\t\t\t\t\tll db = uf.ps[b].dif;\n\t\t\t\t\tcout << da - db << \"\\n\";\n\t\t\t\t} else {\n\t\t\t\t\tcout << \"UNKNOWN\\n\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":990,"memory_kb":11028,"score_of_the_acc":-1.7822,"final_rank":20},{"submission_id":"aoj_1330_10002433","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// 重み付き Union-Find\ntemplate<class Abel> struct UnionFind {\n const Abel UNITY_SUM = 0; // to be set\n vector<int> par;\n vector<bool> is_nan;\n vector<Abel> diff_weight;\n\n UnionFind() { }\n UnionFind(int n) : \n par(n, -1), diff_weight(n, UNITY_SUM) {}\n \n int root(int x) {\n if (par[x] < 0) return x;\n else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n \n Abel calc_weight(int x) {\n root(x);\n return diff_weight[x];\n }\n \n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n \n bool merge(int x, int y, Abel w = 0) {\n w += calc_weight(x); w -= calc_weight(y);\n x = root(x); y = root(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y), w = -w; // merge technique\n par[x] += par[y];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n \n Abel diff(int x, int y) {\n return calc_weight(y) - calc_weight(x);\n }\n \n int size(int x) {\n return -par[root(x)];\n }\n};\n\nint main() {\n // 入力 (\"0 0\" が来るまで連続で入力を受け取る)\n int N, M;\n while (cin >> N >> M, N) {\n // 重み付き Union-Find を初期化\n UnionFind<int> uf(N);\n\n for (int i = 0; i < M; ++i) {\n char c;\n cin >> c;\n if (c == '!') {\n int a, b, w;\n cin >> a >> b >> w;\n --a, --b;\n\n // w[b] - w[a] = w となるように併合\n uf.merge(a, b, w);\n } else {\n int a, b;\n cin >> a >> b;\n --a, --b;\n\n if (!uf.issame(a, b)) {\n // a, b が併合されていない場合は w[b] - w[a] の値は未定\n cout << \"UNKNOWN\" << endl;\n } else {\n cout << uf.diff(a, b) << endl;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":900,"memory_kb":3596,"score_of_the_acc":-0.6931,"final_rank":10},{"submission_id":"aoj_1330_9957453","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9 + 10;\nconst ll INFL = 4e18;\n\nstruct DSU {\n vector<int> par, sz;\n vector<ll> df;\n\n DSU(int n) {\n par.resize(n);\n iota(par.begin(), par.end(), 0);\n sz.assign(n, 1);\n df.assign(n, 0);\n }\n\n int find(int x) {\n if (par[x] == x) return x;\n int root = find(par[x]);\n df[x] += df[par[x]];\n return par[x] = root;\n }\n\n ll weight(int x) {\n find(x);\n return df[x];\n }\n\n void merge(int x, int y, ll w) {\n w += weight(x);\n w -= weight(y);\n x = find(x), y = find(y);\n if (x == y) return;\n if (sz[x] < sz[y]) swap(x, y), w = -w;\n par[y] = x;\n sz[x] += sz[y];\n df[y] = w;\n }\n\n ll diff(int x, int y) { return df[y] - df[x]; }\n\n bool same(int x, int y) { return find(x) == find(y); }\n};\n\nint main() {\n while (true) {\n int N, M;\n cin >> N >> M;\n\n if (N == 0 && M == 0) break;\n\n DSU dsu(N);\n while (M--) {\n char c;\n cin >> c;\n\n if (c == '!') {\n int a, b;\n ll w;\n cin >> a >> b >> w;\n a--;\n b--;\n dsu.merge(a, b, w);\n } else {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n\n if (!dsu.same(a, b)) {\n cout << \"UNKNOWN\\n\";\n } else {\n cout << dsu.diff(a, b) << '\\n';\n }\n }\n }\n }\n}","accuracy":1,"time_ms":900,"memory_kb":4708,"score_of_the_acc":-0.8427,"final_rank":15},{"submission_id":"aoj_1330_9947415","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nstruct Unionfind{\n\n\tUnionfind(int n){\n\t\tpar.assign(n, -1);\n\t\tpot.assign(n, 0);\n\t}\n\n\tbool merge(int x, int y, ll w){\n\t\tw += get_pot(x);\n\t\tw -= get_pot(y);\n\t\tx = root(x), y = root(y);\n\t\tif(x == y){\n\t\t\tif(diff(x, y) == w){\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\t--c;\n\t\tif(par[x] > par[y]){\n\t\t\tswap(x, y);\n\t\t\tw = -w;\n\t\t}\n\t\tpar[x] += par[y];\n\t\tpar[y] = x;\n\t\tpot[y] = w;\n\t\treturn true;\n\t}\n\n\tbool same(int x, int y){\n\t\treturn root(x) == root(y);\n\t}\n\n\tint root(int x){\n\t\tif(par[x] < 0){\n\t\t\treturn x;\n\t\t}else {\n\t\t\tint r = root(par[x]);\n\t\t\tpot[x] = pot[x] + pot[par[x]];\n\t\t\treturn par[x] = r;\n\t\t}\n\t}\n\n\tll get_pot(int x){\n\t\troot(x);\n\t\treturn pot[x];\n\t}\n\n\tll diff(int x, int y){\n\t\treturn get_pot(x) - get_pot(y);\n\t}\n\n\tint n, c;\n\tvector<int> par;\n\tvector<ll> pot;\n};\n\nint main(){\n\tint n, q;\n\twhile(1){\n\t\tcin >> n >> q;\n\t\tif(n == 0 && q == 0) break;\n\t\tUnionfind uf(n);\n\t\twhile(q--){\n\t\t\tchar c;\n\t\t\tcin >> c;\n\t\t\tif(c == '!'){\n\t\t\t\tint x, y;\n\t\t\t\tll w;\n\t\t\t\tcin >> x >> y >> w;\n\t\t\t\t--x, --y;\n\t\t\t\tuf.merge(x, y, w);\n\t\t\t}else{\n\t\t\t\tint x, y;\n\t\t\t\tcin >> x >> y;\n\t\t\t\t--x, --y;\n\t\t\t\tif(uf.same(x, y)){\n\t\t\t\t\tcout << uf.diff(y, x) << endl;\n\t\t\t\t}else{\n\t\t\t\t\tcout << \"UNKNOWN\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":620,"memory_kb":4700,"score_of_the_acc":-0.5644,"final_rank":7},{"submission_id":"aoj_1330_9876051","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <cassert>\n#include <numeric>\n#include <vector>\nstruct DSU {\n int n;\n std::vector<int> par, size, po;\n DSU(int n_) : n{n_}, par(n_), size(n_, 1), po(n_, 0) {\n std::iota(par.begin(), par.end(), 0);\n }\n int leader(int v) {\n // for (auto p : par) std::cout << p << ' ';\n // std::cout << std::endl;\n // std::cout << v << \" leader\" << std::endl;\n assert(0 <= v and v < n);\n if (par[v] == v) return v;\n else {\n int res{leader(par[v])};\n po[v] = po[par[v]] + po[v];\n return par[v] = res;\n }\n }\n int potential(int v) {\n leader(v);\n return po[v];\n }\n bool same(int u, int v) {\n // std::cout << \"same \" << u << ' ' << v << std::endl;\n return leader(u) == leader(v);\n }\n int distance(int u, int v) {\n assert(0 <= u and u < n);\n assert(0 <= v and v < n);\n // std::cout << u << ' ' << v << ' ' << \"distance\" << std::endl;\n return -po.at(u) + po.at(v);\n }\n bool merge(int u, int v, int val) {\n assert(0 <= u and u < n);\n assert(0 <= v and v < n);\n if (same(u, v)) return distance(u, v) == val;\n val = po.at(u) + val;\n val = -po.at(v) + val; \n u = leader(u);\n v = leader(v);\n if (size[u] > size[v]) {\n val = -val;\n std::swap(u, v);\n }\n size[u] += size[v];\n par[v] = u;\n po[v] = val;\n // std::cout << u << ' ' << v << ' ' << val << \"!\" << std::endl;\n return true;\n }\n};\nint N, M;\nvoid solve() {\n // std::cout << N << ' ' << M << \" TEST START\" << std::endl;\n DSU dsu(N);\n while (M--) {\n char c;\n std::cin >> c;\n if (c == '!') {\n int a, b, w;\n std::cin >> a >> b >> w;\n a--; b--;\n assert(dsu.merge(a, b, w));\n // std::cout << \"merge end\" << std::endl;\n }\n else if (c == '?') {\n int a, b;\n std::cin >> a >> b;\n a--; b--;\n // std::cout << \"try to calc \" << a << ' ' << b << std::endl;\n if (dsu.same(a, b)) std::cout << dsu.distance(a, b) << std::endl;\n else std::cout << \"UNKNOWN\" << std::endl;;\n }\n else {\n assert(false);\n }\n }\n // std::cout << \"TEST END\" << std::endl;\n}\nint main() {\n while (true) {\n std::cin >> N >> M;\n if (N == 0 and M == 0) break;\n solve();\n }\n}","accuracy":1,"time_ms":910,"memory_kb":6256,"score_of_the_acc":-1.0609,"final_rank":18},{"submission_id":"aoj_1330_9544359","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), parent_or_size(n, -1), weight(n,0) {}\n\n int merge(int a, int b, ll w) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n w += calc_weight(a), w -= calc_weight(b);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y), w = -w;\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n weight[y] = w;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n int l = leader(parent_or_size[a]);\n weight[a] += weight[parent_or_size[a]];\n return parent_or_size[a] = l;\n }\n\n ll calc_weight(int a) {\n leader(a);\n return weight[a];\n }\n\n ll diff(int a, int b) {\n return calc_weight(b) - calc_weight(a);\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n vector<ll> weight;\n};\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n dsu UF(N);\n rep(i,0,M) {\n char C;\n cin >> C;\n if (C == '!') {\n int A, B;\n ll W;\n cin >> A >> B >> W;\n A--, B--;\n UF.merge(A,B,W);\n }\n else {\n int A, B;\n cin >> A >> B;\n A--, B--;\n if (!UF.same(A,B)) {\n cout << \"UNKNOWN\" << endl;\n }\n else {\n cout << UF.diff(A,B) << endl;\n }\n }\n }\n}\n}","accuracy":1,"time_ms":900,"memory_kb":4576,"score_of_the_acc":-0.8249,"final_rank":13},{"submission_id":"aoj_1330_9103893","code_snippet":"#if 1\n#include<cmath>\n#include<limits>\n#include<iostream>\n#include<algorithm>\n#include<functional>\n#include<string>\n#include<map>\n#include<set>\n#include<ctime>\n#include<queue>\n#include<vector>\n#include<tuple>\n// #include<format>\n#ifdef _INTEGRAL_MAX_BITS\n// #include\"C:\\Users\\Spare\\source\\repos\\Competitive_programming\\Competitive_programming\\debugging.h\"\n#endif\n#ifndef DEBUGGING\n#define MY_MAIN int main()\n#define REDIRCT_IO ;\n#define RESTORE_IO ;\n#endif\n#define sc static\n#define ct const\n#define ft first\n#define sd second\nusing namespace std;\n// using namespace atcoder;\n// using namespace Eigen;\nusing ld = long double;\nusing ll = long long;\nusing cchar = const char;\nusing cint = const int;\nusing cll = const ll;\nusing uchar = unsigned char;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing cuchar = const uchar;\nusing cuint = const uint;\nusing cull = const ull;\ntemplate<class TYPE> static const TYPE INF = numeric_limits<TYPE>::max();\n#define rep(i, n) for(int i = (0), fend = n; i < fend; ++i)\nstatic const string ascii_lowercase = \"abcdefghijklmnopqrstuvwxyz\";\nstatic const string ascii_uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\ntemplate<class Abel> struct UnionFind {\n\tvector<int> par;\n\tvector<int> rank;\n\tvector<Abel> diff_weight;\n\n\tUnionFind(int n = 1, Abel SUM_UNITY = 0) {\n\t\tinit(n, SUM_UNITY);\n\t}\n\n\tvoid init(int n = 1, Abel SUM_UNITY = 0) {\n\t\tpar.resize(n); rank.resize(n); diff_weight.resize(n);\n\t\tfor (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n\t}\n\n\tint root(int x) {\n\t\tif (par[x] == x) {\n\t\t\treturn x;\n\t\t}\n\t\telse {\n\t\t\tint r = root(par[x]);\n\t\t\tdiff_weight[x] += diff_weight[par[x]];\n\t\t\treturn par[x] = r;\n\t\t}\n\t}\n\n\tAbel weight(int x) {\n\t\troot(x);\n\t\treturn diff_weight[x];\n\t}\n\n\tbool issame(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\tbool merge(int x, int y, Abel w) {\n\t\tw += weight(x); w -= weight(y);\n\t\tx = root(x); y = root(y);\n\t\tif (x == y) return false;\n\t\tif (rank[x] < rank[y]) swap(x, y), w = -w;\n\t\tif (rank[x] == rank[y]) ++rank[x];\n\t\tpar[y] = x;\n\t\tdiff_weight[y] = w;\n\t\treturn true;\n\t}\n\n\tAbel diff(int x, int y) {\n\t\treturn weight(y) - weight(x);\n\t}\n};\nint N, M;\nint main() {\n REDIRCT_IO;\n\twhile (true) {\n\t\tcin >> N >> M;\n\t\tif (N == 0)break;\n\t\tUnionFind<ll> uf(N);\n\t\tchar c; int a, b; ll w;\n\t\trep(t, M) {\n\t\t\tcin >> c;\n\t\t\tif (c == '!') {\n\t\t\t\tcin >> a >> b >> w; --a; --b;\n\t\t\t\tuf.merge(a, b, w);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcin >> a >> b; --a; --b;\n\t\t\t\tif (uf.issame(a, b)) {\n\t\t\t\t\tcout << uf.diff(a, b) << '\\n';\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << \"UNKNOWN\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << flush;\n\t}\n RESTORE_IO;\n return 0;\n}\n\n#endif","accuracy":1,"time_ms":900,"memory_kb":4704,"score_of_the_acc":-0.8422,"final_rank":14},{"submission_id":"aoj_1330_8992723","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 1 \"cp-library/src/algebra/sum.hpp\"\ntemplate < class T > class sum_monoid {\n public:\n using set = T;\n static constexpr T op(const T &l, const T &r) { return l + r; }\n static constexpr T id() { return T(0); }\n static constexpr T inv(const T &x) { return -x; }\n static constexpr T pow(const T &x, const ll n) { return x * n; }\n static constexpr bool comm = true;\n};\n#line 4 \"A.cpp\"\n\ntemplate < class Group > class potentialized_union_find {\n public:\n using T = typename Group::set;\n\n private:\n using size_t = std::size_t;\n class node_type {\n friend potentialized_union_find;\n T value;\n size_t parent;\n size_t size;\n\n node_type(const T value, const size_t parent, const size_t size)\n : value(value), parent(parent), size(size) {}\n };\n\n std::vector<node_type> tree;\n size_t size() const { return tree.size(); }\n void compress(const size_t x) {\n const std::size_t p = tree[x].parent;\n if(p == x) return;\n compress(p);\n tree[x].value = Group::op(tree[p].value, tree[x].value);\n tree[x].parent = tree[p].parent;\n }\n\n public:\n potentialized_union_find() = default;\n explicit potentialized_union_find(const size_t n)\n : tree(n, node_type(Group::id(), 0, 1)) {\n for(size_t i = 0; i < n; i++) tree[i].parent = i;\n }\n\n size_t find(const size_t x) {\n assert(x < size());\n compress(x);\n return tree[x].parent;\n }\n T potential(const size_t x) {\n assert(x < size());\n compress(x);\n return tree[x].value;\n }\n bool same(const size_t x, const size_t y) {\n assert(x < size());\n compress(x);\n return find(x) == find(y);\n }\n T distance(const size_t x, const size_t y) {\n assert(x < size());\n assert(y < size());\n return Group::op(Group::inv(potential(x)), potential(y));\n }\n size_t size(const size_t x) {\n assert(x < size());\n return tree[find(x)].size;\n }\n void unite(size_t x, size_t y, T d) {\n if(same(x, y)) return;\n if(size(x) < size(y)) {\n d = Group::inv(d);\n std::swap(x, y);\n }\n d = Group::op(Group::op(potential(x), d), Group::inv(potential(y)));\n x = find(x), y = find(y);\n tree[x].size += tree[y].size;\n tree[y].parent = x;\n tree[y].value = d;\n }\n};\n\nvoid solve(int N, int M) {\n potentialized_union_find<sum_monoid<int>> uf(N);\n for(int M_ : rep(M)) {\n char type = in();\n if(type == '!') {\n int a = in(), b = in(), w = in(); a--, b--;\n uf.unite(a, b, w);\n } else {\n int a = in(), b = in(); a--, b--;\n if(uf.same(a, b)) {\n print(uf.distance(a, b));\n } else {\n print(\"UNKNOWN\");\n }\n printer::flush();\n }\n }\n}\n\nint main() {\n while(true) {\n int N = in(), M = in();\n if(make_pair(N, M) == make_pair(0, 0)) return 0;\n solve(N, M);\n }\n}","accuracy":1,"time_ms":560,"memory_kb":5816,"score_of_the_acc":-0.6551,"final_rank":8},{"submission_id":"aoj_1330_8723604","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#pragma GCC target \"no-avx\"\n\n#if USE_MP\n#include <boost/multiprecision/cpp_int.hpp>\n#endif\n#include <cassert>\n#include <cstdio>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <array>\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <algorithm>\n#include <cmath>\n#include <tuple>\n#include <bitset>\n#include <string.h>\n#include <numeric>\n#include <random>\n#if defined _DEBUG\n//#include \"TestCase.h\"\n//#include \"Util.h\"\n#endif\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef tuple<ll, ll, ll> tlll;\ntypedef tuple<int, int, int> tiii;\n\nusing ai2 = array<int, 2>;\nusing ai3 = array<int, 3>;\nusing ai4 = array<int, 4>;\nusing al2 = array<ll, 2>;\nusing al3 = array<ll, 3>;\nusing al4 = array<ll, 4>;\nusing ad2 = array<ld, 2>;\nusing ad3 = array<ld, 3>;\nusing ad4 = array<ld, 4>;\n#define REP(i, n) for (int i = 0; i < (n); i++)\ninline void Yes(bool upper = false) { cout << (upper ? \"YES\" : \"Yes\") << \"\\n\"; }\ninline void No(bool upper = false) { cout << (upper ? \"NO\" : \"No\") << \"\\n\"; }\n\ninline ll DivCeil(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -(-nume / deno);\n\telse return (nume + deno - 1) / deno;\n}\ninline ll DivFloor(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno - 1) / deno);\n\telse return nume / deno;\n}\ninline ll DivRound(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno / 2) / deno);\n\telse return (nume + deno / 2) / deno;\n}\n\ntemplate <typename T, int S>\nauto MakeVecImpl(queue<int>& size, const T& ini)\n{\n\tif constexpr (S == 1)\n\t{\n\t\treturn vector<T>(size.front(), ini);\n\t}\n\telse\n\t{\n\t\tint fsize = size.front();\n\t\tsize.pop();\n\t\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\n\t}\n}\n\ntemplate <typename T, int S>\nauto MakeVec(const array<int, S>& size, const T ini = T())\n{\n\tqueue<int> qsize;\n\tfor (const auto v : size) qsize.push(v);\n\treturn MakeVecImpl<T, S>(qsize, ini);\n}\nint d4[][2] =\n{\n\t{0,-1},\n\t{0,1},\n\t{-1,0},\n\t{1,0},\n};\nint d8[][2] =\n{\n\t{-1,-1},\n\t{0,-1},\n\t{1,-1},\n\n\t{-1,0},\n\t{1,0},\n\n\t{-1,1},\n\t{0,1},\n\t{1,1},\n};\nvector<array<int, 2>> Neighbor2(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor4(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor6(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tconst int ofs = (y & 1); // 1 - (y & 1); //\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y - 1, x - 1 + ofs });\n\tret.push_back({ y - 1, x + ofs });\n\n\tret.push_back({ y + 1, x - 1 + ofs });\n\tret.push_back({ y + 1, x + ofs });\n\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor8(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y - 1, x - 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y - 1, x + 1 });\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y + 1, x - 1 });\n\tret.push_back({ y + 1, x });\n\tret.push_back({ y + 1, x + 1 });\n\treturn ret;\n}\n\nvector<int> DecompDigit(ull val)\n{\n\tif (val == 0)\n\t\treturn { 0 };\n\n\tvector<int> ret;\n\twhile (val)\n\t{\n\t\tret.emplace_back(val % 10);\n\t\tval /= 10;\n\t}\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\n\n#define PI 3.14159265358979l\nlong double R2D = 180 / PI;\nlong double D2R = PI / 180;\n\nstatic const ll Mod = 1'000'000'007;\nstatic const ll Mod9 = 998244353;// 1000000007;\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\nstatic const int INF32 = 2'000'000'000;\n\nrandom_device rd;\nmt19937 mt(0);//(rd());\n#if USE_MP\nusing mpint = boost::multiprecision::cpp_int;\n#endif\n\nstruct UnionFind\n{\npublic:\n\tenum RESULT\n\t{\n\t\tINCONSISTENT = 0,\n\t\tCONSISTENT = 1,\n\t\tADDED = 2,\n\t};\n\n\tUnionFind(int size) :\n\t\tparent(size),\n\t\tnxt(size),\n\t\tnodes(size, 1),\n\t\tpotential(size, 0),\n\t\tgroups(size)\n\t{\n\t\tstd::iota(parent.begin(), parent.end(), 0);\n\t\tstd::iota(nxt.begin(), nxt.end(), 0);\n\t}\n\n\t/// <summary>\n\t/// u -> v にduvの辺を張る\n\t/// 結果はenum RESULTで返すが、失敗(矛盾した辺)を0に割り当てているので\n\t/// if (!uf.Unite(u,v,duv)) {\n\t/// // 失敗時の処理\n\t/// }\n\t/// みたいな使い方ができる\n\t/// </summary>\n\tRESULT Unite(int u, int v, int duv = 0)\n\t{\n\t\t// uの根に対するvの根のポテンシャルを求める\n\t\t// 元々pv-puだった(u,v)の関係をduvにしないといけない\n\t\tint pu = Potential(u);\n\t\tint pv = Potential(v);\n\t\tint druv = duv - (pv - pu);\n\n\t\tint ru = Find(u);\n\t\tint rv = Find(v);\n\t\tif (ru == rv) {\n\t\t\tif (druv == 0)\n\t\t\t\treturn CONSISTENT;\n\t\t\telse\n\t\t\t\treturn INCONSISTENT;\n\t\t}\n\t\tstd::swap(nxt[u], nxt[v]);\t// 列挙用リスト更新\n\n\t\tif (nodes[ru] < nodes[rv])\t// マージテク\n\t\t{\n\t\t\tstd::swap(ru, rv);\n\t\t\tdruv = -druv;\n\t\t}\n\t\tgroups--;\n\t\tnodes[ru] += nodes[rv];\n\t\tpotential[rv] = druv;\n\t\tparent[rv] = ru;\n\t\treturn ADDED;\n\t}\n\n\tint Find(int v)\n\t{\n\t\tif (parent[v] == v)\n\t\t\treturn v;\n\t\telse\n\t\t{\n\t\t\tint rv = Find(parent[v]);\n\t\t\tnodes[v] = nodes[rv];\n\t\t\tpotential[v] += potential[parent[v]];\n\t\t\treturn parent[v] = rv;\n\t\t}\n\t}\n\n\tinline bool IsUnited(int u, int v)\n\t{\n\t\treturn Find(u) == Find(v);\n\t}\n\n\tinline int CountNodes(int v)\n\t{\n\t\tFind(v);\n\t\treturn nodes[v];\n\t}\n\n\tinline int CountGroups() const\n\t{\n\t\treturn groups;\n\t}\n\n\tstd::vector<int> GetGroupMember(int v) const\n\t{\n\t\tstd::vector<int> ret;\n\t\tint w = v;\n\t\tdo {\n\t\t\tret.emplace_back(w);\n\t\t\tw = nxt[w];\n\t\t} while (w != v);\n\t\treturn ret;\n\t}\n\n\tlong long Potential(int v)\n\t{\n\t\tFind(v);\n\t\treturn potential[v];\n\t}\n\n\t// uから見たvのポテンシャル\n\tlong long Diff(int u, int v)\n\t{\n\t\treturn Potential(v) - Potential(u);\n\t}\n\nprivate:\n\tstd::vector<int> parent;\t// 親ノード\n\tstd::vector<int> nodes;\t\t// 同じグループに属するノードの数\n\tstd::vector<int> nxt;\t\t// 同じグループに属する次のノード(ループしている)\n\tstd::vector<long long> potential;\t// ポテンシャル\n\tint groups;\n};\n\nconst double EPS = 1e-10;\n\nstruct Solver\n{\n\tint Run()\n\t{\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0)\n\t\t\treturn 1;\n\n\t\tUnionFind uf(N);\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tchar c;\n\t\t\tcin >> c;\n\t\t\tif (c == '!') {\n\t\t\t\tint u, v, w;\n\t\t\t\tcin >> u >> v >> w;\n\t\t\t\tu--, v--;\n\t\t\t\tuf.Unite(u, v, w);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tint u, v;\n\t\t\t\tcin >> u >> v;\n\t\t\t\tu--, v--;\n\n\t\t\t\tif (uf.IsUnited(u, v)) {\n\t\t\t\t\tcout << uf.Diff(u, v) << \"\\n\";\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << \"UNKNOWN\\n\";\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t}\n\n\n\t\treturn 0;\n\t}\n};\n\nint main()\n{\n\tstd::cin.tie(nullptr); //★インタラクティブ注意★\n\tstd::ios_base::sync_with_stdio(false);\n\tint T = 1;\n\t//cin >> T;\n\twhile (1)//T--)\n\t{\n\t\tSolver S;\n\t\tif (S.Run())\n\t\t\treturn 0;\n\t}\n\n\treturn 0;\n}\n\n/// 値渡しになっていないか?\n/// 入力を全部読んでいるか? 途中でreturnしない\n/// 32bitで収まるか? 10^5数えるとき\n/// modは正しいか?\n/// multisetでcountしていないか?","accuracy":1,"time_ms":200,"memory_kb":5092,"score_of_the_acc":-0.2013,"final_rank":2},{"submission_id":"aoj_1330_8572359","code_snippet":"// #define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n\n/* alias*/\nusing ull = unsigned long long;\nusing ll = long long;\nusing vi = vector<int>;\nusing vll = vector<long long>;\nusing vs = vector<string>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\nusing vvs = vector<vs>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\n\n/* define short */\n#define pb push_back\n#define mp make_pair\n#define reps(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define rreps(i, s, n) for (int i = n-1; i >= (s); i--)\n#define rep(i, n) reps(i, 0, n)\n#define rep1(i, n) reps(i, 1, n+1)\n#define rrep(i, n) rreps(i, 0, n)\n#define rrep1(i, n) rreps(i, 1, n+1)\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n\n\n/* func */\ntemplate<class T> inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<class T> inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\n\ntemplate<class T> struct WeightedUnionFind {\n vector<int> par, rank;\n vector<T> diff_weight;\n\n WeightedUnionFind(int n = 1) {\n init(n);\n }\n\n void init(int n = 1) {\n par.resize(n); rank.resize(n); diff_weight.resize(n);\n for (int i = 0; i < n; ++i) {\n par[i] = i;\n rank[i] = 0;\n diff_weight[i] = 0;\n }\n }\n\n int root(int x) {\n if (par[x] == x) return x;\n else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n T weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n T diff(int x, int y) {\n return weight(y) - weight(x);\n }\n\n bool same(int x, int y) {\n return root(x) == root(y);\n }\n\n bool unite(int x, int y, T w) {\n w += weight(x); w -= weight(y);\n x = root(x); y = root(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w; // ry を rx の子にする\n if (rank[x] == rank[y]) ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n};\n\nint main() { \n int n,m;\n while (true) {\n cin>>n>>m;\n if (n == 0) break;\n WeightedUnionFind<int> uf(n);\n rep(_,m) {\n char s;int a,b,w;\n cin>>s;\n if (s == '!') {\n cin>>a>>b>>w; --a;--b;\n uf.unite(a,b,w);\n }\n if (s == '?') {\n cin>>a>>b; --a;--b;\n if (uf.same(a,b)) cout << uf.diff(a,b) << endl;\n else cout << \"UNKNOWN\" << endl;\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":910,"memory_kb":4316,"score_of_the_acc":-0.7998,"final_rank":12},{"submission_id":"aoj_1330_8526304","code_snippet":"// #define _GLIBCXX_DEBUG 1\n#include <bits/stdc++.h>\n// #include <atcoder/all>\nusing namespace std;\n#define ll long long\n#define ull unsigned long long\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n#define rep_0(i, n) for (int i = 0; i < n; i++)\n#define rep_1(i, s, n) for (int i = s; i < n + s; i++)\n#define rep_2(i, s, t, n) for (int i = s; i <= n; i += t)\n#define rep_overload(e1, e2, e3, e4, f, ...) f\n#define rep(...) rep_overload(__VA_ARGS__, rep_2, rep_1, rep_0)(__VA_ARGS__)\n#define repr(i, n) for (int i = n - 1; i >= 0; i--)\n#define repr1(i, n) for (int i = n; i > 0; i--)\n\nauto chmax = [](auto& a, auto b) {bool ret=a<b; if(ret)a=b; return ret; };\nauto chmin = [](auto& a, auto b) {bool ret=a>b; if(ret)a=b; return ret; };\ntemplate <typename T>\nusing pq_inv = priority_queue<T, vector<T>, greater<T>>;\nvector<int> dd4 = {1, 0, -1, 0, 1}; // rep(i,4) nh=h+dd4[i]; nw=w+dd4[i+1];\nvector<int> dd8 = {1, 0, -1, 0, 1, 1, -1, -1, 1}; // rep(i,8) nh=h+dd8[i]; nw=w+dd8[i+1];\n// using mint = atcoder::modint1000000007;\n// using mint = atcoder::modint998244353;\n\ntemplate <typename T>\nstruct WeightedUnionFind {\n vector<int> par, rank;\n vector<T> diff_weight;\n WeightedUnionFind(int n) {\n init(n);\n }\n void init(int n) {\n par.assign(n, -1);\n rank.assign(n, 0);\n diff_weight.assign(n, 0);\n }\n int root(int x) {\n if (par[x] == -1) return x;\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n T weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n bool is_same(int x, int y) {\n return root(x) == root(y);\n }\n bool merge(int x, int y, T w) {\n w += weight(x) - weight(y);\n x = root(x);\n y = root(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w;\n if (rank[x] == rank[y]) rank[x]++;\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n\n T diff(int x, int y) {\n return weight(y) - weight(x);\n }\n};\n\nvoid solve(int N, int M) {\n WeightedUnionFind<ll> wuf(N + 1);\n rep(i, M) {\n char t;\n cin >> t;\n if (t == '!') {\n int x, y, d;\n cin >> x >> y >> d;\n wuf.merge(x, y, d);\n } else {\n int x, y;\n cin >> x >> y;\n if(wuf.is_same(x,y))cout << wuf.diff(x, y) << endl;\n else cout << \"UNKNOWN\" << endl;\n }\n }\n}\n\nint main() {\n std::cin.tie(nullptr);\n // int T;\n // // cin >> T;\n // T = 1;\n // for (int i = 0; i < T; i++) {\n // // solve(i);\n // solve();\n // }\n\n while (true) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0)\n break;\n else\n (solve(N, M));\n }\n return 0;\n}","accuracy":1,"time_ms":860,"memory_kb":4460,"score_of_the_acc":-0.7697,"final_rank":11},{"submission_id":"aoj_1330_8505550","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nTT struct weighted_uf {\n vector<int> data;\n vector<T> ws;\n const int n;\n weighted_uf(int n) : data(n, -1), ws(n, 0), n(n) {}\n\n int root(int x) {\n if (data[x] < 0) return x;\n int par = root(data[x]);\n ws[x] += ws[data[x]];\n return data[x] = par;\n }\n\n T weight(int x) {\n root(x);\n return ws[x];\n }\n\n bool unite(int x, int y, T w) {\n w += weight(x), w -= weight(y);\n x = root(x), y = root(y);\n if (x == y) return false;\n data[x] += data[y], data[y] = x;\n ws[y] = w;\n return true;\n }\n\n T diff(int x, int y) { return weight(y) - weight(x); }\n\n bool same(int x, int y) { return root(x) == root(y); }\n};\n\nint main() {\n while (1) {\n int n, q;\n cin >> n >> q;\n if (!n)\n break;\n weighted_uf<ll> uf(n);\n while (q--) {\n char type;\n ll x, y;\n cin >> type >> x >> y;\n x--, y--;\n if (type == '!') {\n ll w;\n cin >> w;\n uf.unite(x, y, w);\n }\n else {\n if (uf.same(x, y))\n cout << uf.diff(x, y) << '\\n';\n else\n cout << \"UNKNOWN\\n\";\n }\n }\n }\n}","accuracy":1,"time_ms":200,"memory_kb":6716,"score_of_the_acc":-0.4198,"final_rank":6},{"submission_id":"aoj_1330_8487917","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace std;\n\ntemplate <class Abel>\nstruct UnionFind {\n vector<int> par;\n vector<int> rank;\n vector<Abel> diff_weight;\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n void init(int n = 1, Abel SUM_UNITY = 0) {\n par.resize(n);\n rank.resize(n);\n diff_weight.resize(n);\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n int root(int x) {\n if (par[x] == x) {\n return x;\n } else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n Abel weight(int x) {\n root(x);\n return diff_weight[x];\n }\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n bool merge(int x, int y, Abel w) {\n w += weight(x);\n w -= weight(y);\n x = root(x);\n y = root(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w;\n if (rank[x] == rank[y]) ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n Abel diff(int x, int y) {\n return weight(y) - weight(x);\n }\n};\n\nvoid solve(int N, int M) {\n UnionFind<ll> uf(N);\n while (M--) {\n char c;\n cin >> c;\n if (c == '!') {\n int l, r;\n ll w;\n cin >> l >> r >> w;\n l--, r--;\n uf.merge(l, r, w);\n } else if (c == '?') {\n int l, r;\n cin >> l >> r;\n l--, r--;\n\n if (uf.issame(l, r)) cout << uf.diff(l, r) << \"\\n\";\n else cout << \"UNKNOWN\\n\";\n }\n }\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int N, M;\n while (cin >> N >> M, N) solve(N, M);\n\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":4552,"score_of_the_acc":-0.1286,"final_rank":1},{"submission_id":"aoj_1330_8483434","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <iostream>\n#include <vector>\nusing ll = long long;\nusing ld = long double;\nusing Graph = vector<vector<int>>;\nusing vi = vector<int>;\nusing vl = vector<long>;\nusing vll = vector<long long>;\nusing vb = vector<bool>;\nusing vvi = vector<vi>;\nusing vvl = vector<vl>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vc = vector<char>;\nusing vvc = vector<vc>;\nusing lll = __int128_t;\nusing vs = vector<string>;\nusing pii = pair<long long, long long>;\nconst long double EPS = 1e-10;\nconst double INF = 1e18;\n\nconst long double PI = acos(-1.0L);\n#define mp make_pair\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++)\n#define rep(i, n) for (ll i = (0); i < (ll)(n); i++)\n#define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++)\n#define repd(i, n) for (ll i = n - 1; i >= 0; i--)\n#define rrepd(i, n) for (ll i = n; i >= 1; i--)\n#define ALL(n) n.begin(), n.end()\n#define rALL(n) n.rbegin(), n.rend()\n#define fore(i, a) for (auto &i : a)\n#define IN(a, x, b) (a <= x && x < b)\n#define IN(a, x, b) (a <= x && x < b)\n#define INIT \\\n std::ios::sync_with_stdio(false); \\\n std::cin.tie(0);\ntemplate <class T>\ninline T CHMAX(T &a, const T b) {\n return a = (a < b) ? b : a;\n}\ntemplate <class T>\ninline T CHMIN(T &a, const T b) {\n return a = (a > b) ? b : a;\n}\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <deque> // deque\n#include <iostream> // cout, endl, cin\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <string> // string, to_string, stoi\n#include <tuple> // tuple, make_tuple\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <utility> // pair, make_pair\n#include <vector> // vector\nusing namespace std;\n\n#include <type_traits>\n\n#define LOOP(n) REPI($_, (n))\n\n#define REPI(i, n) \\\n for (int i = 0, i##_length = static_cast<int>(n); i < i##_length; ++i)\n#define REPF(i, l, r) \\\n for (std::common_type_t<decltype(l), decltype(r)> i = (l), i##_last = (r); \\\n i < i##_last; ++i)\n#define REPIS(i, l, r, s) \\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\n i = (l), \\\n i##_last = (r); \\\n i < i##_last; i += (s))\n\n#define REPR(i, n) for (auto i = (n); --i >= 0;)\n#define REPB(i, l, r) \\\n for (std::common_type_t<decltype(l), decltype(r)> i = (r), i##_last = (l); \\\n --i >= i##_last;)\n#define REPRS(i, l, r, s) \\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\n i = (l) + ((r) - (l)-1) / (s) * (s), \\\n i##_last = (l); \\\n i >= i##_last; (i -= (s)))\n\n#define REP(...) $OVERLOAD4(__VA_ARGS__, REPIS, REPF, REPI, LOOP)(__VA_ARGS__)\n#define REPD(...) $OVERLOAD4(__VA_ARGS__, REPRS, REPB, REPR)(__VA_ARGS__)\n\n#define FORO(i, n) \\\n for (int i = 0, i##_last = static_cast<int>(n); i <= i##_last; ++i)\n#define FORI(i, l, r) \\\n for (std::common_type_t<decltype(l), decltype(r)> i = (l), i##_last = (r); \\\n i <= i##_last; ++i)\n#define FORIS(i, l, r, s) \\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\n i = (l), \\\n i##_last = (r); \\\n i <= i##_last; i += (s))\n\n#define FORRO(i, n) for (auto i = (n); i >= 0; --i)\n#define FORR(i, l, r) \\\n for (std::common_type_t<decltype(l), decltype(r)> i = (r), i##_last = (l); \\\n i >= i##_last; --i)\n#define FORRS(i, l, r, s) \\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\n i = (l) + ((r) - (l)) / (s) * (s), \\\n i##_last = (l); \\\n i >= i##_last; i -= (s))\n\n#define FOR(...) $OVERLOAD4(__VA_ARGS__, FORIS, FORI, FORO)(__VA_ARGS__)\n#define FORD(...) $OVERLOAD4(__VA_ARGS__, FORRS, FORR, FORRO)(__VA_ARGS__)\n\n#define ITR1(e0, v) for (const auto &e0 : (v))\n#define ITRP1(e0, v) for (auto e0 : (v))\n#define ITRR1(e0, v) for (auto &e0 : (v))\n\n#define ITR2(e0, e1, v) for (const auto [e0, e1] : (v))\n#define ITRP2(e0, e1, v) for (auto [e0, e1] : (v))\n#define ITRR2(e0, e1, v) for (auto &[e0, e1] : (v))\n\n#define ITR3(e0, e1, e2, v) for (const auto [e0, e1, e2] : (v))\n#define ITRP3(e0, e1, e2, v) for (auto [e0, e1, e2] : (v))\n#define ITRR3(e0, e1, e2, v) for (auto &[e0, e1, e2] : (v))\n\n#define ITR4(e0, e1, e2, e3, v) for (const auto [e0, e1, e2, e3] : (v))\n#define ITRP4(e0, e1, e2, e3, v) for (auto [e0, e1, e2, e3] : (v))\n#define ITRR4(e0, e1, e2, e3, v) for (auto &[e0, e1, e2, e3] : (v))\n\n#define ITR(...) $OVERLOAD5(__VA_ARGS__, ITR4, ITR3, ITR2, ITR1)(__VA_ARGS__)\n#define ITRP(...) \\\n $OVERLOAD5(__VA_ARGS__, ITRP4, ITRP3, ITRP2, ITRP1)(__VA_ARGS__)\n#define ITRR(...) \\\n $OVERLOAD5(__VA_ARGS__, ITRR4, ITRR3, ITRR2, ITRR1)(__VA_ARGS__)\nstd::ostream &operator<<(std::ostream &dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\ntemplate <class Type>\nclass WeightedUnionFind {\n public:\n WeightedUnionFind() = default;\n\n /// @brief 重み付き Union-Find 木を構築します。\n /// @param n 要素数\n explicit WeightedUnionFind(size_t n)\n : m_parentsOrSize(n, -1), m_diffWeights(n) {}\n\n /// @brief 頂点 i の root のインデックスを返します。\n /// @param i 調べる頂点のインデックス\n /// @return 頂点 i の root のインデックス\n int find(int i) {\n if (m_parentsOrSize[i] < 0) {\n return i;\n }\n\n const int root = find(m_parentsOrSize[i]);\n\n m_diffWeights[i] += m_diffWeights[m_parentsOrSize[i]];\n\n // 経路圧縮\n return (m_parentsOrSize[i] = root);\n }\n\n /// @brief a のグループと b のグループを統合します。\n /// @param a 一方のインデックス\n /// @param b 他方のインデックス\n /// @param w (b の重み) - (a の重み)\n /// a を含むグループと b を含むグループを併合し、b の重みは a と比べて w\n /// 大きくなるようにする\n void merge(int a, int b, Type w) {\n w += weight(a);\n w -= weight(b);\n\n a = find(a);\n b = find(b);\n\n if (a != b) {\n // union by size (小さいほうが子になる）\n if (-m_parentsOrSize[a] < -m_parentsOrSize[b]) {\n std::swap(a, b);\n w = -w;\n }\n\n m_parentsOrSize[a] += m_parentsOrSize[b];\n m_parentsOrSize[b] = a;\n m_diffWeights[b] = w;\n }\n }\n\n /// @brief (b の重み) - (a の重み) を返します。\n /// @param a 一方のインデックス\n /// @param b 他方のインデックス\n /// @remark a と b が同じグループに属さない場合の結果は不定です。\n /// @return (b の重み) - (a の重み)\n ///(b の重み) - (a の重み) を返す。a と b\n /// が同じグループに属さない場合の結果は不定\n Type diff(int a, int b) { return (weight(b) - weight(a)); }\n\n /// @brief a と b が同じグループに属すかを返します。\n /// @param a 一方のインデックス\n /// @param b 他方のインデックス\n /// @return a と b が同じグループに属す場合 true, それ以外の場合は false\n /// a と b が同じグループに属すかを返す\n bool connected(int a, int b) { return (find(a) == find(b)); }\n\n /// @brief i が属するグループの要素数を返します。\n /// @param i インデックス\n /// @return i が属するグループの要素数\n int size(int i) { return -m_parentsOrSize[find(i)]; }\n\n private:\n // m_parentsOrSize[i] は i の 親,\n // ただし root の場合は (-1 * そのグループに属する要素数)\n std::vector<int> m_parentsOrSize;\n\n // 重み\n std::vector<Type> m_diffWeights;\n\n Type weight(int i) {\n find(i); // 経路圧縮\n return m_diffWeights[i];\n }\n};\n\n__int128 parse(string &s) {\n __int128 ret = 0;\n for (int i = 0; i < s.length(); i++)\n if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n\nll GCD(ll m, ll n) {\n // ベースケース\n if (n == 0) return m;\n\n // 再帰呼び出し\n return GCD(n, m % n);\n}\n\nll minlong = 0;\n\nlong long Power(long long a, long long b, long long m) {\n long long p = a, Answer = 1;\n for (int i = 0; i < 63; i++) {\n ll wari = (1LL << i);\n if ((b / wari) % 2 == 1) {\n Answer %= m;\n Answer = (Answer * p) % m; // 「a の 2^i 乗」が掛けられるとき\n }\n p %= m;\n p = (p * p) % m;\n }\n return Answer;\n}\n\n// a ÷ b を m で割った余りを返す関数\nlong long Division(long long a, long long b, long long m) {\n return (a * Power(b, m - 2, m)) % m;\n}\n\n// nCr mod 998244353 を返す関数\nlong long nCk(ll n, ll r) {\n const long long M = 998244353;\n\n // 手順 1: 分子 a を求める\n long long a = 1;\n for (int i = 1; i <= n; i++) a = (a * i) % M;\n\n // 手順 2: 分母 b を求める\n long long b = 1;\n for (int i = 1; i <= r; i++) b = (b * i) % M;\n for (int i = 1; i <= n - r; i++) b = (b * i) % M;\n\n // 手順 3: 答えを求める\n return Division(a, b, M);\n}\nusing Interval = pair<ll, ll>;\n// 終点時間でsortをかけるのに必要(区間スケジューリング問題など)\nbool cmp(const Interval &a, const Interval &b) { return a.second < b.second; }\nvll dycstra(vector<vector<pair<ll, ll>>> G, ll N, ll K) {\n vb kaku(N, false);\n vll cur(N, INF);\n cur[K] = 0;\n priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;\n Q.push(make_pair(cur[K], K));\n while (!Q.empty()) {\n ll pos = Q.top().second;\n Q.pop();\n if (kaku[pos]) continue;\n kaku[pos] = true;\n for (ll i = 0; i < G[pos].size(); i++) {\n ll nex = G[pos][i].first;\n ll cost = G[pos][i].second;\n if (cur[nex] > cur[pos] + cost) {\n cur[nex] = cur[pos] + cost;\n Q.push(make_pair(cur[nex], nex));\n }\n }\n }\n return cur;\n}\ntemplate <typename T>\nvoid Print(vector<T> &A) {\n rep(i, A.size()) { cout << A[i] << ' '; }\n cout << endl;\n}\ntemplate <typename xy>\nclass BIT {\n public:\n BIT() = default;\n\n // 長さ size の数列で初期化\n explicit BIT(size_t size) : m_bit(size + 1) {}\n\n // 数列で初期化\n explicit BIT(const std::vector<xy> &v) : BIT(v.size()) {\n for (int i = 0; i < v.size(); ++i) {\n add((i + 1), v[i]);\n }\n }\n\n // 閉区間 [1, r] の合計を返す (1-based indexing)\n xy sum(int r) const {\n xy ret = 0;\n\n for (; 0 < r; r -= (r & -r)) {\n ret += m_bit[r];\n }\n\n return ret;\n }\n\n // 閉区間 [l, r] の合計を返す (1-based indexing)\n xy sum(int l, int r) const { return (sum(r) - sum(l - 1)); }\n\n // 数列の i 番目の要素を加算 (1-based indexing)\n void add(int i, xy value) {\n for (; i < m_bit.size(); i += (i & -i)) {\n m_bit[i] += value;\n }\n }\n\n private:\n std::vector<xy> m_bit;\n};\n\n// Binary Indexed Tree (1.2 区間加算対応)\n// 1-based indexing\ntemplate <typename x>\nclass BIT_RAQ {\n public:\n BIT_RAQ() = default;\n\n explicit BIT_RAQ(size_t size) : m_bit0(size), m_bit1(size) {}\n\n explicit BIT_RAQ(const std::vector<x> &v) : m_bit0(v), m_bit1(v.size()) {}\n\n // 閉区間 [1, r] の合計を返す (1-based indexing)\n x sum(int r) const { return (m_bit0.sum(r) + m_bit1.sum(r) * r); }\n\n // 閉区間 [l, r] の合計を返す (1-based indexing)\n x sum(int l, int r) const { return (sum(r) - sum(l - 1)); }\n\n // 数列の i 番目の要素を加算 (1-based indexing)\n void add(int i, x value) { m_bit0.add(i, value); }\n\n // 閉区間 [l, r] の要素を加算 (1-based indexing)\n void add(int l, int r, x value) {\n x a = (-value * (l - 1)), b = (value * r);\n m_bit0.add(l, a);\n m_bit0.add((r + 1), b);\n m_bit1.add(l, value);\n m_bit1.add((r + 1), -value);\n }\n\n private:\n BIT<x> m_bit0;\n\n BIT<x> m_bit1;\n};\nvll BFS(vvll &G, ll &x) {\n vll cut(G.size(), INF);\n queue<ll> Q;\n Q.push(x);\n cut[x] = 0;\n while (!Q.empty()) {\n ll a = Q.front();\n Q.pop();\n rep(i, G[a].size()) {\n if (cut[G[a][i]] > cut[a] + 1) {\n cut[G[a][i]] = cut[a] + 1;\n Q.push(G[a][i]);\n }\n }\n }\n return cut;\n}\n\nvoid Yes(bool b) {\n if (b)\n cout << \"Yes\" << endl;\n else\n cout << \"No\" << endl;\n}\nvector<long long> yaku(long long n) {\n vector<long long> ret;\n for (long long i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n ret.push_back(i);\n if (i * i != n) ret.push_back(n / i);\n }\n }\n sort(ret.begin(), ret.end()); // 昇順に並べる\n return ret;\n}\n\npriority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;\n\ndouble randouble() { return 1.0 * rand() / RAND_MAX; }\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {} // nの値の設定を行う。\n\n void add(int l, int r) { /* [l, r) */\n lr.push_back({l, r});\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL &add_left, const AR &add_right, const EL &erase_left,\n const ER &erase_right, const O &out) {\n int q = (int)lr.size(); // lr.size()はクエリの数に等しい。\n int bs = n / min<int>(n, sqrt(q)); // 事実上bs>0となるように設定、\n // cout << bs << endl;\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock; //\n return (ablock & 1) ? lr[a].second > lr[b].second\n : lr[a].second < lr[b].second;\n // 偶奇で昇順・降順を分けることによって計算量が定数倍高速化する。\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n // cout << idx << endl;\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A &add, const E &erase, const O &out) {\n build(add, add, erase, erase, out);\n }\n};\n\nstruct TRI {\n ll a;\n ll b;\n ll c;\n};\nbool operator>(const TRI &r, const TRI &l) {\n return (r.a > l.a | (r.a == l.a & r.b > l.b) |\n (r.a == l.a & r.b == l.b & r.c > l.c));\n}\nbool operator<(const TRI &r, const TRI &l) {\n return (r.a < l.a | (r.a == l.a & r.b < l.b) |\n (r.a == l.a & r.b == l.b & r.c < l.c));\n}\nstruct TR {\n ll a;\n ll b;\n ll c;\n ll d;\n};\nbool operator>(const TR &r, const TR &l) {\n return (r.a > l.a | (r.a == l.a & r.b > l.b) |\n (r.a == l.a & r.b == l.b & r.c > l.c));\n}\nbool operator<(const TR &r, const TR &l) {\n return (r.a < l.a | (r.a == l.a & r.b < l.b) |\n (r.a == l.a & r.b == l.b & r.c < l.c));\n}\n// Sはdataを表している。\nusing S = ll;\n// Fはlazy(遅延伝搬用)を表している\nusing F = ll;\n// 区間取得をどのようにするかを定義する。RMQだったらmin(a,b)とかになる。\nS op(S a, S b) { return a + b; };\n// op(e,a)=op(a,e)=aとなるような単位元を定義する。RMQの場合はINFが安牌\nS e() { return 0; }\n// 親のlazyが子のdataに対してどの様に作用させるかを定義する。区間加算をする場合はただ足せば良い\nS mapping(F f, S x) { return x + f; }\n/*親のlazyが子のlazyに対してどの様に作用させるかを定義する。区間加算をする場合はただ足せば良い\nただ可変では無い場合fが後の操作である事を留意しておくと良い*/\nF composition(F f, F g) { return f + g; }\n// mapping(a,id)=aとなる様なidを設定すれば良い今回の区間加算の場合は0が適する。区間乗算の場合は1が適する\nF id() { return 0; }\nll half = 499122177;\n// 条件を満たす場合オイラーツアーを考えれば出来る。\n// 重要なのは求める次数を満たす辺を構築すること\n// G:グラフ,P:オイラーツアーで探索した際に通った辺の番号の配列,in,out:最初と最後に通った時刻\n// U[辺の番号]={親,現在いる位置}正の値だったら終点、それ以外親を出力することで頂点で表した経路の復元が可能\n// num=辺の番号を記録,cou=時刻を記録\n\n// 返り値: a と b の最大公約数\n// ax + by = gcd(a, b) を満たす (x, y) が格納される\nlong long extGCD(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nvll toposo(vvll &G) {\n // 帰りがけでやりたい場合はstack、幅優先でやりたい場合はqueueで行う\n stack<ll> Q;\n ll n = G.size();\n vll A(n, 0);\n rep(i, n) {\n rep(j, G[i].size()) { A[G[i][j]]++; }\n }\n vb han(n, false);\n rep(i, n) {\n if (A[i] == 0) {\n Q.push(i);\n han[i] = true;\n }\n }\n vll B;\n while (!Q.empty()) {\n ll a = Q.top();\n Q.pop();\n B.push_back(a);\n rep(i, G[a].size()) {\n if (!han[G[a][i]]) {\n A[G[a][i]]--;\n if (A[G[a][i]] == 0) {\n Q.push(G[a][i]);\n han[G[a][i]] = true;\n }\n }\n }\n }\n if (B.size() != n) {\n vll C(n, -2);\n return C;\n }\n return B;\n}\n#include <bits/stdc++.h>\n// ax+bのようなグラフの最小値をクエリ一個あたりO(1)で算出することが出来る。\n// 条件は２つ存在する。\n// 1.追加される順に傾きは単調減少でなければならない(傾きに関してソートする必要性が生じる)\n// 2.追加される順にxは単調増加でなければならない(クエリ先読み等のひと手間が必要になる可能性がある)\n// ２つの条件が満たせない場合はこのサンプルを使うことが出来ない(クエリが２種類存在し、直線の追加とxを指定して最小値を求める動作を平行して行う場合等)\n\nstruct ConvexHullTrick {\n std::deque<std::pair<long long, long long>> dq; // （傾き、切片）\n\n void add(long long a, long long b) {\n std::pair<long long, long long> p0 = std::make_pair(a, b);\n while (dq.size() >= 2) {\n int sz = dq.size();\n std::pair<long long, long long> p1 = dq[sz - 1];\n std::pair<long long, long long> p2 = dq[sz - 2];\n if ((p0.second - p1.second) * (p0.first - p2.first) <\n (p0.second - p2.second) * (p0.first - p1.first))\n break; // 交点のx座標を比較\n dq.pop_back();\n }\n dq.push_back(p0);\n }\n\n long long query(long long x) {\n while (dq.size() >= 2) {\n long long v1 = dq[0].first * x + dq[0].second;\n long long v2 = dq[1].first * x + dq[1].second;\n if (v1 <= v2) break;\n dq.pop_front();\n }\n return dq[0].first * x + dq[0].second;\n }\n};\n// if(a <= b + EPS) // a <= b\n// if(a < b - EPS) // a < b\n// if(abs(a - b) < EPS) // a == b\n// 頂点 s から頂点 t までの最大フローの総流量を返す\nvector<vector<pair<ll, ll>>> G;\nll K;\nvb han;\nll ans;\nll N;\nvll X;\nvector<vector<pair<ll, ll>>> G1;\nvoid dfs(ll cou, ll poi) {\n if (cou == ((1LL << N) - 1)) {\n ans = min(ans, poi);\n }\n for (auto u : G1[cou]) {\n dfs(cou + (1LL << u.first), (poi + u.second) % K);\n }\n return;\n}\nint main() {\n cout << fixed << setprecision(20);\n ll M;\n ll a = 0, b = 0;\n ll c = 0;\n ll p = 1;\n string S, T;\n ll H, W;\n ll t;\n char O;\n while (1) {\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vll A(M), B(M), C(M);\n vb han(N, false);\n WeightedUnionFind<ll> U(N);\n rep(i, M) {\n cin >> O;\n if (O == '!') {\n cin >> A[i] >> B[i] >> C[i], --A[i], --B[i];\n if (!U.connected(A[i], B[i])) {\n U.merge(A[i], B[i], C[i]);\n }\n } else {\n cin >> A[i] >> B[i], --A[i], --B[i];\n if (U.connected(A[i], B[i])) {\n cout << U.diff(A[i], B[i]) << endl;\n\n } else {\n cout << \"UNKNOWN\" << endl;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":920,"memory_kb":6768,"score_of_the_acc":-1.1397,"final_rank":19},{"submission_id":"aoj_1330_8439094","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/modint>\n#define rng(a) a.begin(),a.end()\n#define rrng(a) a.rbegin(),a.rend()\n#define INF 2000000000000000000\n#define ull unsigned long long\n#define ll long long\n#define ld long double\n#define pll pair<ll, ll>\nusing namespace std;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (true) {\n \n ll N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) {\n break;\n }\n vector<vector<ll>> child(N);\n vector<ll> par(N);\n for (ll i = 0; i < N; ++i) {\n par.at(i) = i;\n }\n vector<ll> X(N, 0);\n for (ll q = 0; q < M; ++q) {\n char c;\n ll a, b, w;\n cin >> c >> a >> b;\n a -= 1, b -= 1;\n bool same = (par.at(a) == par.at(b));\n if (c == '?') {\n if (same) {\n cout << X.at(b) - X.at(a) << \"\\n\";\n }\n else {\n cout << \"UNKNOWN\" << \"\\n\";\n }\n }\n else {\n cin >> w;\n if (same) {\n continue;\n }\n ll a_size = child.at(par.at(a)).size();\n ll b_size = child.at(par.at(b)).size();\n if (a_size < b_size) {\n swap(a, b);\n swap(a_size, b_size);\n w = -w;\n }\n ll dx = X.at(a) + w - X.at(b);\n ll par_b = par.at(b);\n for (ll i = 0; i < child.at(par_b).size(); ++i) {\n ll cb = child.at(par_b).at(i);\n child.at(par.at(a)).push_back(cb);\n par.at(cb) = par.at(a);\n X.at(cb) += dx;\n }\n child.at(par.at(a)).push_back(par_b);\n par.at(par_b) = par.at(a);\n X.at(par_b) += dx;\n }\n }\n }\n}","accuracy":1,"time_ms":210,"memory_kb":8604,"score_of_the_acc":-0.6837,"final_rank":9},{"submission_id":"aoj_1330_7916403","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nusing ull = unsigned long long;\ntypedef pair<ll,ll> pll;\ntypedef vector<ll> vll;\ntypedef vector<pll> vpll;\ntemplate<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using pqmax = priority_queue<T>;\nconst ll inf=LLONG_MAX/3;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se secondf\n#define all(x) x.begin(),x.end()\n#define si(x) ll(x.size())\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define per(i,n) for(ll i=n-1;i>=0;i--)\n#define rng(i,l,r) for(ll i=l;i<r;i++)\n#define gnr(i,l,r) for(ll i=r-1;i>=l;i--)\n#define fore(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define VLL(name,size) vector<ll>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>> name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>> name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>> name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define SUM(...) accumulate(all(__VA_ARGS__),0LL)\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\nvoid outb(bool x){cout<<(x?\"Yes\":\"No\")<<\"\\n\";}\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))\nll gcd(ll a,ll b){return (b?gcd(b,a%b):a);}\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); per(i,ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\nvll prime_table(ll n){vec(ll,isp,n+1,1);vll res;rng(i,2,n+1)if(isp[i]){res.pb(i);for(ll j=i*i;j<=n;j+=i)isp[j]=0;}return res;}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <class T> vector<T> &operator++(vector<T> &v) {\n\t\tfore(e, v) e++;\n\t\treturn v;\n}\ntemplate <class T> vector<T> operator++(vector<T> &v, int) {\n\t\tauto res = v;\n\t\tfore(e, v) e++;\n\t\treturn res;\n}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {\n\t\tfore(e, v) e--;\n\t\treturn v;\n}\ntemplate <class T> vector<T> operator--(vector<T> &v, int) {\n\t\tauto res = v;\n\t\tfore(e, v) e--;\n\t\treturn res;\n}\ntemplate <class T> vector<T> &operator+=(vector<T> &l, const vector<T> &r) {\n\t\tfore(e, r) l.eb(e);\n\t\treturn l;\n}\n\ntemplate<class... Ts> void in(Ts&... t);\n[[maybe_unused]] void print(){}\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\n'; }\nnamespace IO{\n#define VOID(a) decltype(void(a))\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\ntemplate<int I> struct P : P<I-1>{};\ntemplate<> struct P<0>{};\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\n#undef VOID\n}\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\n#undef unpack\n\nstruct WeightedUnionFind{\n\tvll par,wdiff;\n\tWeightedUnionFind(ll n=-1){\n\t\tinit(n);\n\t}\n\tvoid init(ll n){\n\t\tpar.resize(n);\n\t\twdiff.resize(n);\n\t\trep(i,n){\n\t\t\tpar[i]=i;\n\t\t\twdiff[i]=0;\n\t\t}\n\t}\n\tll root(ll x){\n\t\tif(par[x]==x){\n\t\t\treturn x;\n\t\t}\n\t\tll r=root(par[x]);\n\t\twdiff[x]+=wdiff[par[x]];\n\t\tpar[x]=r;\n\t\treturn r;\n\t}\n\tbool same(ll x,ll y){\n\t\treturn root(x)==root(y);\n\t}\n\tvoid merge(ll x,ll y,ll w){\n\t\t//w[x]==w[y]+w\n\t\tll rx=root(x); //w[x]=w[rx]+wdiff[x]\n\t\tll ry=root(y); //w[y]=w[ry]+wdiff[y]\n\t\twdiff[rx]=w-wdiff[x]+wdiff[y]; //w[rx]=w[ry]-wfidd[x]+wdiff[y]+w\n\t\tpar[rx]=ry;\n\t}\n\tll weight(ll x){\n\t\troot(x);\n\t\treturn wdiff[x];\n\t}\n\tll diff(ll x,ll y){\n\t\treturn weight(x)-weight(y);\n\t}\n};\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\twhile(1){\n\t\tLL(n,m);\n\t\tif(n==0)break;\n\t\tWeightedUnionFind uf(n);\n\t\trep(_,m){\n\t\t\tCHR(t);\n\t\t\tif(t=='!'){\n\t\t\t\tLL(a,b,w);\n\t\t\t\ta--,b--;\n\t\t\t\tuf.merge(b,a,w);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tLL(a,b);\n\t\t\t\ta--,b--;\n\t\t\t\tif(!uf.same(a,b)){\n\t\t\t\t\tout(\"UNKNOWN\");\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tout(uf.diff(b,a));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","accuracy":1,"time_ms":200,"memory_kb":6692,"score_of_the_acc":-0.4166,"final_rank":5},{"submission_id":"aoj_1330_7555856","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n \nusing namespace std;\n \ntemplate<class Abel> struct UnionFind {\n vector<int> par;\n vector<int> rank;\n vector<Abel> diff_weight;\n\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n\n void init(int n = 1, Abel SUM_UNITY = 0) {\n par.resize(n); rank.resize(n); diff_weight.resize(n);\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n\n int root(int x) {\n if (par[x] == x) {\n return x;\n }\n else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n Abel weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n bool same(int x, int y) {\n return root(x) == root(y);\n }\n\n bool merge(int x, int y, Abel w) {\n w += weight(x); w -= weight(y);\n x = root(x); y = root(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w;\n if (rank[x] == rank[y]) ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n\n Abel diff(int x, int y) {\n return weight(y) - weight(x);\n }\n};\n \nint main(){\n while(true){\n int N,M;\n cin >> N >> M;\n if(N==0 && M==0) break;\n \n UnionFind<int> tree(N);\n \n rep(i,M){\n int L,R,D;\n char Q;\n cin >> Q;\n if(Q == '!'){\n //mergeする\n cin >> L >> R >> D;\n L--; R--;\n tree.merge(L,R,D);\n }\n else{\n //LとRが同じグループなら距離が分かる\n cin >> L >> R;\n L--; R--;\n if(tree.same(L,R)){\n cout << tree.diff(L,R) << endl;\n }\n else{\n cout << \"UNKNOWN\" << endl;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":1210,"memory_kb":3940,"score_of_the_acc":-1.0463,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_1330_11066164\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <utility>\\nusing namespace std;\\n\\nclass unionfind{\\npublic:\\n unionfind(int n): n_(n) {\\n parent_.resize(n);\\n size_.resize(n);\\n diff_.resize(n);\\n for(int i=0; i<n; i++){\\n parent_[i] = i;\\n size_[i] = 1;\\n diff_[i] = 0;\\n }\\n }\\n // iとjをくっつける その際iから見たjとの差を与える\\n void unite(int i, int j, int d){\\n int p = root(i);\\n int q = root(j);\\n if(p==q) return;\\n if(size_[p]>size_[q]){\\n parent_[q] = p;\\n size_[p] += size_[q];\\n diff_[q] = diff_[i] + d - diff_[j];\\n }else{\\n parent_[p] = q;\\n size_[q] += size_[p];\\n diff_[p] = diff_[j] - d - diff_[i];\\n }\\n }\\n pair<bool,int> diff(int i, int j){\\n if(root(i) != root(j)) return make_pair(false, 0);\\n return make_pair(true, diff_[j] - diff_[i]);\\n }\\nprivate:\\n int n_;\\n vector<int> parent_;\\n vector<int> size_;\\n vector<int> diff_; // 親から見たの符号付きの差\\n\\n int root(int i){\\n if(parent_[i] == i) return i;\\n int r = root(parent_[i]);\\n diff_[i] = diff_[parent_[i]] + diff_[i];\\n parent_[i] = r;\\n return r;\\n }\\n};\\n\\nint main(){\\n int n,m;\\n while(true){\\n cin >> n >> m;\\n if((n==0) & (m == 0)){\\n break;\\n }\\n unionfind uf(n+1);\\n int x,y,d;\\n string s;\\n pair<bool,int> ret;\\n for(int i=0; i<m; i++){\\n cin >> s;\\n if(s==\\\"!\\\"){\\n cin >> x >> y >> d;\\n uf.unite(x,y,d);\\n }else{\\n cin >> x >> y;\\n ret = uf.diff(x,y);\\n if(!ret.first){\\n cout << \\\"UNKNOWN\\\" << endl;\\n }else{\\n cout << ret.second << endl;\\n } \\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 4308,\n \"score_of_the_acc\": -0.8582,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1330_10853876\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\n#include<iostream>\\n#include<queue>\\n#include<algorithm>\\n#define maxn 100010\\n#define ll long long\\nusing namespace std;\\nconst int MAXSize = 100010;\\nint uset[MAXSize];\\nint Rank[MAXSize];\\nll w[MAXSize];\\n\\nvoid makeSet(int Size)\\n{\\n for(int i = 1; i <= Size; i++)\\n {\\n uset[i] = i;\\n w[i] = 0;\\n Rank[i] = 0;\\n }\\n}\\nint Find(int x)\\n{\\n if (x != uset[x]) return uset[x] = Find(uset[x]);\\n return uset[x];\\n}\\nvoid unionSet(int x, int y,int v)\\n{\\n int p = x;\\n ll vx = 0;\\n while(uset[p] != p){\\n vx += w[p];\\n p = uset[p];\\n }\\n int py = y;\\n ll vy = 0;\\n while(uset[py] != py){\\n vy += w[py];\\n py = uset[py];\\n }\\n if(p == py)return;\\n\\n if(Rank[p] < Rank[py]){\\n uset[p] = py;\\n w[p] = vy - v - vx;\\n }else{\\n uset[py] = p;\\n w[py] = v + vx - vy;\\n if (Rank[p] == Rank[py]) Rank[p]++;\\n }\\n}\\n\\nvoid Get(int x,int y)\\n{\\n int p = x;\\n ll vx = 0;\\n while(uset[p] != p){\\n vx += w[p];\\n p = uset[p];\\n }\\n int py = y;\\n ll vy = 0;\\n while(uset[py] != py){\\n vy += w[py];\\n py = uset[py];\\n }\\n if(p == py){\\n printf(\\\"%lld\\\\n\\\",vy - vx);\\n }else{\\n printf(\\\"UNKNOWN\\\\n\\\");\\n }\\n}\\nint main()\\n{\\n int n,m,a,b,c;\\n char NOR;\\n while(scanf(\\\"%d%d\\\",&n,&m)&&n!=0)\\n {\\n makeSet(n);\\n for(int i=0; i<m; i++)\\n {\\n getchar();\\n scanf(\\\"%c\\\",&NOR);\\n if(NOR=='!')\\n {\\n scanf(\\\"%d%d%d\\\",&a,&b,&c);\\n unionSet(a,b,c);\\n }\\n else\\n {\\n scanf(\\\"%d%d\\\",&a,&b);\\n Get(a,b);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 5100,\n \"score_of_the_acc\": -0.2123,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1330_10240618\",\n \"code_snippet\": \"#line 1 \\\"1330.test.cpp\\\"\\n#define PROBLEM \\\"https://onlinejudge.u-aizu.ac.jp/problems/1330\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\\\"\\n\\n#include <cstdint>\\n#include <cstddef>\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\\\"\\n\\n#include <iostream>\\n#include <iomanip>\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/DataStructure/DisjointSetUnion/PotentializedDisjointSetUnion.hpp\\\"\\n\\n#line 4 \\\"/home/zawatin/compro/cp-documentation/Src/DataStructure/DisjointSetUnion/PotentializedDisjointSetUnion.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <numeric>\\n#include <vector>\\n\\nnamespace zawa {\\n\\ntemplate <class Group>\\nclass PotentializedDisjointSetUnion {\\npublic:\\n using Value = typename Group::Element;\\nprivate:\\n usize n_{}, comps_{};\\n std::vector<u32> parent_{};\\n std::vector<u32> size_{};\\n std::vector<Value> potential_{};\\n\\n u32 leader(u32 v) {\\n if (parent_[v] == v) {\\n return v;\\n }\\n else {\\n u32 res{leader(parent_[v])};\\n potential_[v] = Group::operation(potential_[parent_[v]], potential_[v]);\\n return parent_[v] = res;\\n }\\n }\\n Value potential(u32 v) {\\n leader(v);\\n return potential_[v];\\n }\\n\\npublic:\\n\\n PotentializedDisjointSetUnion() = default;\\n\\n PotentializedDisjointSetUnion(u32 n) \\n : n_{n}, comps_{n}, parent_(n), size_(n, u32{1}), potential_(n, Group::identity()) {\\n std::iota(parent_.begin(), parent_.end(), u32{});\\n }\\n\\n constexpr u32 size() const noexcept {\\n return n_;\\n }\\n\\n u32 size(u32 v) {\\n leader(v);\\n return size_[v];\\n }\\n\\n inline u32 components() const noexcept {\\n return comps_;\\n }\\n\\n bool isDefined(u32 u, u32 v) {\\n return leader(u) == leader(v);\\n }\\n\\n Value distance(u32 u, u32 v) {\\n assert(u < size());\\n assert(v < size());\\n return Group::operation(Group::inverse(potential(u)), potential(v));\\n }\\n\\n bool merge(u32 u, u32 v, Value value) {\\n if (isDefined(u, v)) {\\n return distance(u, v) == value;\\n }\\n comps_--;\\n value = Group::operation(potential(u), value);\\n value = Group::operation(Group::inverse(potential(v)), value);\\n u = leader(u);\\n v = leader(v);\\n if (size_[u] > size_[v]) {\\n value = Group::inverse(value);\\n std::swap(u, v);\\n }\\n size_[u] += size_[v];\\n parent_[v] = u;\\n potential_[v] = value;\\n return true;\\n }\\n};\\n\\n} // namespace zawa\\n#line 2 \\\"/home/zawatin/compro/cp-documentation/Src/Algebra/Group/AdditiveGroup.hpp\\\"\\n\\nnamespace zawa {\\n\\ntemplate <class T>\\nclass AdditiveGroup {\\npublic:\\n using Element = T;\\n static constexpr T identity() noexcept {\\n return T{};\\n }\\n static constexpr T operation(const T& l, const T& r) noexcept {\\n return l + r;\\n }\\n static constexpr T inverse(const T& v) noexcept {\\n return -v;\\n }\\n};\\n\\n} // namespace zawa\\n#line 6 \\\"1330.test.cpp\\\"\\n\\nusing namespace zawa;\\n\\n#line 11 \\\"1330.test.cpp\\\"\\nint N, Q;\\nbool solve() {\\n std::cin >> N >> Q;\\n if (N == 0 and Q == 0) return false;\\n PotentializedDisjointSetUnion<AdditiveGroup<int>> dsu(N);\\n while (Q--) {\\n char t;\\n int a, b;\\n std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == '!') {\\n int w;\\n std::cin >> w;\\n dsu.merge(a, b, w);\\n }\\n else if (t == '?') {\\n if (dsu.isDefined(a, b)) std::cout << dsu.distance(a, b) << '\\\\n';\\n else std::cout << \\\"UNKNOWN\\\\n\\\";\\n }\\n else assert(false);\\n }\\n return true;\\n}\\nint main() {\\n SetFastIO(); \\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6304,\n \"score_of_the_acc\": -0.3644,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1330_10037453\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nstruct node {\\n\\tint v;\\n\\tll dif;\\n\\tvector<int> chd;\\n};\\nstruct UnionFind {\\n\\tvector<node> ps;\\n\\tUnionFind(int n) : ps(n, {-1, 0, {}}) {\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tps[i].chd.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tint root(int x) {\\n\\t\\tif (ps[x].v < 0)\\n\\t\\t\\treturn x;\\n\\t\\telse\\n\\t\\t\\treturn ps[x].v = root(ps[x].v);\\n\\t}\\n\\tbool same(int x, int y) { return root(x) == root(y); }\\n\\tvoid unite(int x, int y, int w) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n\\t\\tif (rx == ry) return;\\n\\t\\tll d = ps[x].dif - (w + ps[y].dif);\\n\\t\\tif (-ps[rx].v < -ps[ry].v) {\\n\\t\\t\\tswap(rx, ry);\\n\\t\\t\\td *= -1;\\n\\t\\t}\\n\\t\\tfor (auto &ty : ps[ry].chd) {\\n\\t\\t\\tps[rx].chd.push_back(ty);\\n\\t\\t\\tps[ty].dif += d;\\n\\t\\t}\\n\\t\\tps[ry].chd.clear();\\n\\t\\tps[rx].v += ps[ry].v;\\n\\t\\tps[ry].v = rx;\\n\\t\\treturn;\\n\\t}\\n};\\nint main() {\\n\\twhile (1) {\\n\\t\\tint n, m;\\n\\t\\tcin >> n >> m;\\n\\t\\tif (n == 0 && m == 0) break;\\n\\t\\tUnionFind uf(n);\\n\\t\\twhile (m--) {\\n\\t\\t\\tstring t;\\n\\t\\t\\tcin >> t;\\n\\t\\t\\tif (t == \\\"!\\\") {\\n\\t\\t\\t\\tint a, b, w;\\n\\t\\t\\t\\tcin >> a >> b >> w;\\n\\t\\t\\t\\ta--;\\n\\t\\t\\t\\tb--;\\n\\t\\t\\t\\tuf.unite(a, b, w);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint a, b;\\n\\t\\t\\t\\tcin >> a >> b;\\n\\t\\t\\t\\ta--;\\n\\t\\t\\t\\tb--;\\n\\t\\t\\t\\tif (uf.same(a, b)) {\\n\\t\\t\\t\\t\\tll da = uf.ps[a].dif;\\n\\t\\t\\t\\t\\tll db = uf.ps[b].dif;\\n\\t\\t\\t\\t\\tcout << da - db << \\\"\\\\n\\\";\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tcout << \\\"UNKNOWN\\\\n\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 990,\n \"memory_kb\": 11028,\n \"score_of_the_acc\": -1.7822,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1330_10002433\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 重み付き Union-Find\\ntemplate<class Abel> struct UnionFind {\\n const Abel UNITY_SUM = 0; // to be set\\n vector<int> par;\\n vector<bool> is_nan;\\n vector<Abel> diff_weight;\\n\\n UnionFind() { }\\n UnionFind(int n) : \\n par(n, -1), diff_weight(n, UNITY_SUM) {}\\n \\n int root(int x) {\\n if (par[x] < 0) return x;\\n else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n \\n Abel calc_weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n \\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n \\n bool merge(int x, int y, Abel w = 0) {\\n w += calc_weight(x); w -= calc_weight(y);\\n x = root(x); y = root(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y), w = -w; // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n \\n Abel diff(int x, int y) {\\n return calc_weight(y) - calc_weight(x);\\n }\\n \\n int size(int x) {\\n return -par[root(x)];\\n }\\n};\\n\\nint main() {\\n // 入力 (\\\"0 0\\\" が来るまで連続で入力を受け取る)\\n int N, M;\\n while (cin >> N >> M, N) {\\n // 重み付き Union-Find を初期化\\n UnionFind<int> uf(N);\\n\\n for (int i = 0; i < M; ++i) {\\n char c;\\n cin >> c;\\n if (c == '!') {\\n int a, b, w;\\n cin >> a >> b >> w;\\n --a, --b;\\n\\n // w[b] - w[a] = w となるように併合\\n uf.merge(a, b, w);\\n } else {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n\\n if (!uf.issame(a, b)) {\\n // a, b が併合されていない場合は w[b] - w[a] の値は未定\\n cout << \\\"UNKNOWN\\\" << endl;\\n } else {\\n cout << uf.diff(a, b) << endl;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.6931,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1330_9957453\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = 1e9 + 10;\\nconst ll INFL = 4e18;\\n\\nstruct DSU {\\n vector<int> par, sz;\\n vector<ll> df;\\n\\n DSU(int n) {\\n par.resize(n);\\n iota(par.begin(), par.end(), 0);\\n sz.assign(n, 1);\\n df.assign(n, 0);\\n }\\n\\n int find(int x) {\\n if (par[x] == x) return x;\\n int root = find(par[x]);\\n df[x] += df[par[x]];\\n return par[x] = root;\\n }\\n\\n ll weight(int x) {\\n find(x);\\n return df[x];\\n }\\n\\n void merge(int x, int y, ll w) {\\n w += weight(x);\\n w -= weight(y);\\n x = find(x), y = find(y);\\n if (x == y) return;\\n if (sz[x] < sz[y]) swap(x, y), w = -w;\\n par[y] = x;\\n sz[x] += sz[y];\\n df[y] = w;\\n }\\n\\n ll diff(int x, int y) { return df[y] - df[x]; }\\n\\n bool same(int x, int y) { return find(x) == find(y); }\\n};\\n\\nint main() {\\n while (true) {\\n int N, M;\\n cin >> N >> M;\\n\\n if (N == 0 && M == 0) break;\\n\\n DSU dsu(N);\\n while (M--) {\\n char c;\\n cin >> c;\\n\\n if (c == '!') {\\n int a, b;\\n ll w;\\n cin >> a >> b >> w;\\n a--;\\n b--;\\n dsu.merge(a, b, w);\\n } else {\\n int a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n\\n if (!dsu.same(a, b)) {\\n cout << \\\"UNKNOWN\\\\n\\\";\\n } else {\\n cout << dsu.diff(a, b) << '\\\\n';\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 4708,\n \"score_of_the_acc\": -0.8427,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1330_9947415\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nstruct Unionfind{\\n\\n\\tUnionfind(int n){\\n\\t\\tpar.assign(n, -1);\\n\\t\\tpot.assign(n, 0);\\n\\t}\\n\\n\\tbool merge(int x, int y, ll w){\\n\\t\\tw += get_pot(x);\\n\\t\\tw -= get_pot(y);\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif(x == y){\\n\\t\\t\\tif(diff(x, y) == w){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t--c;\\n\\t\\tif(par[x] > par[y]){\\n\\t\\t\\tswap(x, y);\\n\\t\\t\\tw = -w;\\n\\t\\t}\\n\\t\\tpar[x] += par[y];\\n\\t\\tpar[y] = x;\\n\\t\\tpot[y] = w;\\n\\t\\treturn true;\\n\\t}\\n\\n\\tbool same(int x, int y){\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\tint root(int x){\\n\\t\\tif(par[x] < 0){\\n\\t\\t\\treturn x;\\n\\t\\t}else {\\n\\t\\t\\tint r = root(par[x]);\\n\\t\\t\\tpot[x] = pot[x] + pot[par[x]];\\n\\t\\t\\treturn par[x] = r;\\n\\t\\t}\\n\\t}\\n\\n\\tll get_pot(int x){\\n\\t\\troot(x);\\n\\t\\treturn pot[x];\\n\\t}\\n\\n\\tll diff(int x, int y){\\n\\t\\treturn get_pot(x) - get_pot(y);\\n\\t}\\n\\n\\tint n, c;\\n\\tvector<int> par;\\n\\tvector<ll> pot;\\n};\\n\\nint main(){\\n\\tint n, q;\\n\\twhile(1){\\n\\t\\tcin >> n >> q;\\n\\t\\tif(n == 0 && q == 0) break;\\n\\t\\tUnionfind uf(n);\\n\\t\\twhile(q--){\\n\\t\\t\\tchar c;\\n\\t\\t\\tcin >> c;\\n\\t\\t\\tif(c == '!'){\\n\\t\\t\\t\\tint x, y;\\n\\t\\t\\t\\tll w;\\n\\t\\t\\t\\tcin >> x >> y >> w;\\n\\t\\t\\t\\t--x, --y;\\n\\t\\t\\t\\tuf.merge(x, y, w);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tint x, y;\\n\\t\\t\\t\\tcin >> x >> y;\\n\\t\\t\\t\\t--x, --y;\\n\\t\\t\\t\\tif(uf.same(x, y)){\\n\\t\\t\\t\\t\\tcout << uf.diff(y, x) << endl;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tcout << \\\"UNKNOWN\\\" << endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 620,\n \"memory_kb\": 4700,\n \"score_of_the_acc\": -0.5644,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1330_9876051\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <cassert>\\n#include <numeric>\\n#include <vector>\\nstruct DSU {\\n int n;\\n std::vector<int> par, size, po;\\n DSU(int n_) : n{n_}, par(n_), size(n_, 1), po(n_, 0) {\\n std::iota(par.begin(), par.end(), 0);\\n }\\n int leader(int v) {\\n // for (auto p : par) std::cout << p << ' ';\\n // std::cout << std::endl;\\n // std::cout << v << \\\" leader\\\" << std::endl;\\n assert(0 <= v and v < n);\\n if (par[v] == v) return v;\\n else {\\n int res{leader(par[v])};\\n po[v] = po[par[v]] + po[v];\\n return par[v] = res;\\n }\\n }\\n int potential(int v) {\\n leader(v);\\n return po[v];\\n }\\n bool same(int u, int v) {\\n // std::cout << \\\"same \\\" << u << ' ' << v << std::endl;\\n return leader(u) == leader(v);\\n }\\n int distance(int u, int v) {\\n assert(0 <= u and u < n);\\n assert(0 <= v and v < n);\\n // std::cout << u << ' ' << v << ' ' << \\\"distance\\\" << std::endl;\\n return -po.at(u) + po.at(v);\\n }\\n bool merge(int u, int v, int val) {\\n assert(0 <= u and u < n);\\n assert(0 <= v and v < n);\\n if (same(u, v)) return distance(u, v) == val;\\n val = po.at(u) + val;\\n val = -po.at(v) + val; \\n u = leader(u);\\n v = leader(v);\\n if (size[u] > size[v]) {\\n val = -val;\\n std::swap(u, v);\\n }\\n size[u] += size[v];\\n par[v] = u;\\n po[v] = val;\\n // std::cout << u << ' ' << v << ' ' << val << \\\"!\\\" << std::endl;\\n return true;\\n }\\n};\\nint N, M;\\nvoid solve() {\\n // std::cout << N << ' ' << M << \\\" TEST START\\\" << std::endl;\\n DSU dsu(N);\\n while (M--) {\\n char c;\\n std::cin >> c;\\n if (c == '!') {\\n int a, b, w;\\n std::cin >> a >> b >> w;\\n a--; b--;\\n assert(dsu.merge(a, b, w));\\n // std::cout << \\\"merge end\\\" << std::endl;\\n }\\n else if (c == '?') {\\n int a, b;\\n std::cin >> a >> b;\\n a--; b--;\\n // std::cout << \\\"try to calc \\\" << a << ' ' << b << std::endl;\\n if (dsu.same(a, b)) std::cout << dsu.distance(a, b) << std::endl;\\n else std::cout << \\\"UNKNOWN\\\" << std::endl;;\\n }\\n else {\\n assert(false);\\n }\\n }\\n // std::cout << \\\"TEST END\\\" << std::endl;\\n}\\nint main() {\\n while (true) {\\n std::cin >> N >> M;\\n if (N == 0 and M == 0) break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 6256,\n \"score_of_the_acc\": -1.0609,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1330_9544359\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n dsu(int n) : _n(n), parent_or_size(n, -1), weight(n,0) {}\\n\\n int merge(int a, int b, ll w) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n w += calc_weight(a), w -= calc_weight(b);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y), w = -w;\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n weight[y] = w;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n int l = leader(parent_or_size[a]);\\n weight[a] += weight[parent_or_size[a]];\\n return parent_or_size[a] = l;\\n }\\n\\n ll calc_weight(int a) {\\n leader(a);\\n return weight[a];\\n }\\n\\n ll diff(int a, int b) {\\n return calc_weight(b) - calc_weight(a);\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n vector<ll> weight;\\n};\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n dsu UF(N);\\n rep(i,0,M) {\\n char C;\\n cin >> C;\\n if (C == '!') {\\n int A, B;\\n ll W;\\n cin >> A >> B >> W;\\n A--, B--;\\n UF.merge(A,B,W);\\n }\\n else {\\n int A, B;\\n cin >> A >> B;\\n A--, B--;\\n if (!UF.same(A,B)) {\\n cout << \\\"UNKNOWN\\\" << endl;\\n }\\n else {\\n cout << UF.diff(A,B) << endl;\\n }\\n }\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 4576,\n \"score_of_the_acc\": -0.8249,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1330_9103893\",\n \"code_snippet\": \"#if 1\\n#include<cmath>\\n#include<limits>\\n#include<iostream>\\n#include<algorithm>\\n#include<functional>\\n#include<string>\\n#include<map>\\n#include<set>\\n#include<ctime>\\n#include<queue>\\n#include<vector>\\n#include<tuple>\\n// #include<format>\\n#ifdef _INTEGRAL_MAX_BITS\\n// #include\\\"C:\\\\Users\\\\Spare\\\\source\\\\repos\\\\Competitive_programming\\\\Competitive_programming\\\\debugging.h\\\"\\n#endif\\n#ifndef DEBUGGING\\n#define MY_MAIN int main()\\n#define REDIRCT_IO ;\\n#define RESTORE_IO ;\\n#endif\\n#define sc static\\n#define ct const\\n#define ft first\\n#define sd second\\nusing namespace std;\\n// using namespace atcoder;\\n// using namespace Eigen;\\nusing ld = long double;\\nusing ll = long long;\\nusing cchar = const char;\\nusing cint = const int;\\nusing cll = const ll;\\nusing uchar = unsigned char;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing cuchar = const uchar;\\nusing cuint = const uint;\\nusing cull = const ull;\\ntemplate<class TYPE> static const TYPE INF = numeric_limits<TYPE>::max();\\n#define rep(i, n) for(int i = (0), fend = n; i < fend; ++i)\\nstatic const string ascii_lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nstatic const string ascii_uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\ntemplate<class Abel> struct UnionFind {\\n\\tvector<int> par;\\n\\tvector<int> rank;\\n\\tvector<Abel> diff_weight;\\n\\n\\tUnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n\\t\\tinit(n, SUM_UNITY);\\n\\t}\\n\\n\\tvoid init(int n = 1, Abel SUM_UNITY = 0) {\\n\\t\\tpar.resize(n); rank.resize(n); diff_weight.resize(n);\\n\\t\\tfor (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n\\t}\\n\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) {\\n\\t\\t\\treturn x;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint r = root(par[x]);\\n\\t\\t\\tdiff_weight[x] += diff_weight[par[x]];\\n\\t\\t\\treturn par[x] = r;\\n\\t\\t}\\n\\t}\\n\\n\\tAbel weight(int x) {\\n\\t\\troot(x);\\n\\t\\treturn diff_weight[x];\\n\\t}\\n\\n\\tbool issame(int x, int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\tbool merge(int x, int y, Abel w) {\\n\\t\\tw += weight(x); w -= weight(y);\\n\\t\\tx = root(x); y = root(y);\\n\\t\\tif (x == y) return false;\\n\\t\\tif (rank[x] < rank[y]) swap(x, y), w = -w;\\n\\t\\tif (rank[x] == rank[y]) ++rank[x];\\n\\t\\tpar[y] = x;\\n\\t\\tdiff_weight[y] = w;\\n\\t\\treturn true;\\n\\t}\\n\\n\\tAbel diff(int x, int y) {\\n\\t\\treturn weight(y) - weight(x);\\n\\t}\\n};\\nint N, M;\\nint main() {\\n REDIRCT_IO;\\n\\twhile (true) {\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0)break;\\n\\t\\tUnionFind<ll> uf(N);\\n\\t\\tchar c; int a, b; ll w;\\n\\t\\trep(t, M) {\\n\\t\\t\\tcin >> c;\\n\\t\\t\\tif (c == '!') {\\n\\t\\t\\t\\tcin >> a >> b >> w; --a; --b;\\n\\t\\t\\t\\tuf.merge(a, b, w);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcin >> a >> b; --a; --b;\\n\\t\\t\\t\\tif (uf.issame(a, b)) {\\n\\t\\t\\t\\t\\tcout << uf.diff(a, b) << '\\\\n';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcout << \\\"UNKNOWN\\\" << endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << flush;\\n\\t}\\n RESTORE_IO;\\n return 0;\\n}\\n\\n#endif\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 4704,\n \"score_of_the_acc\": -0.8422,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1330_8992723\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 1 \\\"cp-library/src/algebra/sum.hpp\\\"\\ntemplate < class T > class sum_monoid {\\n public:\\n using set = T;\\n static constexpr T op(const T &l, const T &r) { return l + r; }\\n static constexpr T id() { return T(0); }\\n static constexpr T inv(const T &x) { return -x; }\\n static constexpr T pow(const T &x, const ll n) { return x * n; }\\n static constexpr bool comm = true;\\n};\\n#line 4 \\\"A.cpp\\\"\\n\\ntemplate < class Group > class potentialized_union_find {\\n public:\\n using T = typename Group::set;\\n\\n private:\\n using size_t = std::size_t;\\n class node_type {\\n friend potentialized_union_find;\\n T value;\\n size_t parent;\\n size_t size;\\n\\n node_type(const T value, const size_t parent, const size_t size)\\n : value(value), parent(parent), size(size) {}\\n };\\n\\n std::vector<node_type> tree;\\n size_t size() const { return tree.size(); }\\n void compress(const size_t x) {\\n const std::size_t p = tree[x].parent;\\n if(p == x) return;\\n compress(p);\\n tree[x].value = Group::op(tree[p].value, tree[x].value);\\n tree[x].parent = tree[p].parent;\\n }\\n\\n public:\\n potentialized_union_find() = default;\\n explicit potentialized_union_find(const size_t n)\\n : tree(n, node_type(Group::id(), 0, 1)) {\\n for(size_t i = 0; i < n; i++) tree[i].parent = i;\\n }\\n\\n size_t find(const size_t x) {\\n assert(x < size());\\n compress(x);\\n return tree[x].parent;\\n }\\n T potential(const size_t x) {\\n assert(x < size());\\n compress(x);\\n return tree[x].value;\\n }\\n bool same(const size_t x, const size_t y) {\\n assert(x < size());\\n compress(x);\\n return find(x) == find(y);\\n }\\n T distance(const size_t x, const size_t y) {\\n assert(x < size());\\n assert(y < size());\\n return Group::op(Group::inv(potential(x)), potential(y));\\n }\\n size_t size(const size_t x) {\\n assert(x < size());\\n return tree[find(x)].size;\\n }\\n void unite(size_t x, size_t y, T d) {\\n if(same(x, y)) return;\\n if(size(x) < size(y)) {\\n d = Group::inv(d);\\n std::swap(x, y);\\n }\\n d = Group::op(Group::op(potential(x), d), Group::inv(potential(y)));\\n x = find(x), y = find(y);\\n tree[x].size += tree[y].size;\\n tree[y].parent = x;\\n tree[y].value = d;\\n }\\n};\\n\\nvoid solve(int N, int M) {\\n potentialized_union_find<sum_monoid<int>> uf(N);\\n for(int M_ : rep(M)) {\\n char type = in();\\n if(type == '!') {\\n int a = in(), b = in(), w = in(); a--, b--;\\n uf.unite(a, b, w);\\n } else {\\n int a = in(), b = in(); a--, b--;\\n if(uf.same(a, b)) {\\n print(uf.distance(a, b));\\n } else {\\n print(\\\"UNKNOWN\\\");\\n }\\n printer::flush();\\n }\\n }\\n}\\n\\nint main() {\\n while(true) {\\n int N = in(), M = in();\\n if(make_pair(N, M) == make_pair(0, 0)) return 0;\\n solve(N, M);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 5816,\n \"score_of_the_acc\": -0.6551,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1330_8723604\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#pragma GCC target \\\"no-avx\\\"\\n\\n#if USE_MP\\n#include <boost/multiprecision/cpp_int.hpp>\\n#endif\\n#include <cassert>\\n#include <cstdio>\\n#include <iostream>\\n#include <iomanip>\\n#include <string>\\n#include <array>\\n#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <algorithm>\\n#include <cmath>\\n#include <tuple>\\n#include <bitset>\\n#include <string.h>\\n#include <numeric>\\n#include <random>\\n#if defined _DEBUG\\n//#include \\\"TestCase.h\\\"\\n//#include \\\"Util.h\\\"\\n#endif\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef tuple<ll, ll, ll> tlll;\\ntypedef tuple<int, int, int> tiii;\\n\\nusing ai2 = array<int, 2>;\\nusing ai3 = array<int, 3>;\\nusing ai4 = array<int, 4>;\\nusing al2 = array<ll, 2>;\\nusing al3 = array<ll, 3>;\\nusing al4 = array<ll, 4>;\\nusing ad2 = array<ld, 2>;\\nusing ad3 = array<ld, 3>;\\nusing ad4 = array<ld, 4>;\\n#define REP(i, n) for (int i = 0; i < (n); i++)\\ninline void Yes(bool upper = false) { cout << (upper ? \\\"YES\\\" : \\\"Yes\\\") << \\\"\\\\n\\\"; }\\ninline void No(bool upper = false) { cout << (upper ? \\\"NO\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\n\\ninline ll DivCeil(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -(-nume / deno);\\n\\telse return (nume + deno - 1) / deno;\\n}\\ninline ll DivFloor(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno - 1) / deno);\\n\\telse return nume / deno;\\n}\\ninline ll DivRound(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno / 2) / deno);\\n\\telse return (nume + deno / 2) / deno;\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVecImpl(queue<int>& size, const T& ini)\\n{\\n\\tif constexpr (S == 1)\\n\\t{\\n\\t\\treturn vector<T>(size.front(), ini);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tint fsize = size.front();\\n\\t\\tsize.pop();\\n\\t\\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\\n\\t}\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVec(const array<int, S>& size, const T ini = T())\\n{\\n\\tqueue<int> qsize;\\n\\tfor (const auto v : size) qsize.push(v);\\n\\treturn MakeVecImpl<T, S>(qsize, ini);\\n}\\nint d4[][2] =\\n{\\n\\t{0,-1},\\n\\t{0,1},\\n\\t{-1,0},\\n\\t{1,0},\\n};\\nint d8[][2] =\\n{\\n\\t{-1,-1},\\n\\t{0,-1},\\n\\t{1,-1},\\n\\n\\t{-1,0},\\n\\t{1,0},\\n\\n\\t{-1,1},\\n\\t{0,1},\\n\\t{1,1},\\n};\\nvector<array<int, 2>> Neighbor2(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor4(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor6(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tconst int ofs = (y & 1); // 1 - (y & 1); //\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y - 1, x - 1 + ofs });\\n\\tret.push_back({ y - 1, x + ofs });\\n\\n\\tret.push_back({ y + 1, x - 1 + ofs });\\n\\tret.push_back({ y + 1, x + ofs });\\n\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor8(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y - 1, x - 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y - 1, x + 1 });\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y + 1, x - 1 });\\n\\tret.push_back({ y + 1, x });\\n\\tret.push_back({ y + 1, x + 1 });\\n\\treturn ret;\\n}\\n\\nvector<int> DecompDigit(ull val)\\n{\\n\\tif (val == 0)\\n\\t\\treturn { 0 };\\n\\n\\tvector<int> ret;\\n\\twhile (val)\\n\\t{\\n\\t\\tret.emplace_back(val % 10);\\n\\t\\tval /= 10;\\n\\t}\\n\\treverse(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\n\\n#define PI 3.14159265358979l\\nlong double R2D = 180 / PI;\\nlong double D2R = PI / 180;\\n\\nstatic const ll Mod = 1'000'000'007;\\nstatic const ll Mod9 = 998244353;// 1000000007;\\nstatic const ll INF64 = 4'500000'000000'000000;// 10000000000000000;\\nstatic const int INF32 = 2'000'000'000;\\n\\nrandom_device rd;\\nmt19937 mt(0);//(rd());\\n#if USE_MP\\nusing mpint = boost::multiprecision::cpp_int;\\n#endif\\n\\nstruct UnionFind\\n{\\npublic:\\n\\tenum RESULT\\n\\t{\\n\\t\\tINCONSISTENT = 0,\\n\\t\\tCONSISTENT = 1,\\n\\t\\tADDED = 2,\\n\\t};\\n\\n\\tUnionFind(int size) :\\n\\t\\tparent(size),\\n\\t\\tnxt(size),\\n\\t\\tnodes(size, 1),\\n\\t\\tpotential(size, 0),\\n\\t\\tgroups(size)\\n\\t{\\n\\t\\tstd::iota(parent.begin(), parent.end(), 0);\\n\\t\\tstd::iota(nxt.begin(), nxt.end(), 0);\\n\\t}\\n\\n\\t/// <summary>\\n\\t/// u -> v にduvの辺を張る\\n\\t/// 結果はenum RESULTで返すが、失敗(矛盾した辺)を0に割り当てているので\\n\\t/// if (!uf.Unite(u,v,duv)) {\\n\\t/// // 失敗時の処理\\n\\t/// }\\n\\t/// みたいな使い方ができる\\n\\t/// </summary>\\n\\tRESULT Unite(int u, int v, int duv = 0)\\n\\t{\\n\\t\\t// uの根に対するvの根のポテンシャルを求める\\n\\t\\t// 元々pv-puだった(u,v)の関係をduvにしないといけない\\n\\t\\tint pu = Potential(u);\\n\\t\\tint pv = Potential(v);\\n\\t\\tint druv = duv - (pv - pu);\\n\\n\\t\\tint ru = Find(u);\\n\\t\\tint rv = Find(v);\\n\\t\\tif (ru == rv) {\\n\\t\\t\\tif (druv == 0)\\n\\t\\t\\t\\treturn CONSISTENT;\\n\\t\\t\\telse\\n\\t\\t\\t\\treturn INCONSISTENT;\\n\\t\\t}\\n\\t\\tstd::swap(nxt[u], nxt[v]);\\t// 列挙用リスト更新\\n\\n\\t\\tif (nodes[ru] < nodes[rv])\\t// マージテク\\n\\t\\t{\\n\\t\\t\\tstd::swap(ru, rv);\\n\\t\\t\\tdruv = -druv;\\n\\t\\t}\\n\\t\\tgroups--;\\n\\t\\tnodes[ru] += nodes[rv];\\n\\t\\tpotential[rv] = druv;\\n\\t\\tparent[rv] = ru;\\n\\t\\treturn ADDED;\\n\\t}\\n\\n\\tint Find(int v)\\n\\t{\\n\\t\\tif (parent[v] == v)\\n\\t\\t\\treturn v;\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tint rv = Find(parent[v]);\\n\\t\\t\\tnodes[v] = nodes[rv];\\n\\t\\t\\tpotential[v] += potential[parent[v]];\\n\\t\\t\\treturn parent[v] = rv;\\n\\t\\t}\\n\\t}\\n\\n\\tinline bool IsUnited(int u, int v)\\n\\t{\\n\\t\\treturn Find(u) == Find(v);\\n\\t}\\n\\n\\tinline int CountNodes(int v)\\n\\t{\\n\\t\\tFind(v);\\n\\t\\treturn nodes[v];\\n\\t}\\n\\n\\tinline int CountGroups() const\\n\\t{\\n\\t\\treturn groups;\\n\\t}\\n\\n\\tstd::vector<int> GetGroupMember(int v) const\\n\\t{\\n\\t\\tstd::vector<int> ret;\\n\\t\\tint w = v;\\n\\t\\tdo {\\n\\t\\t\\tret.emplace_back(w);\\n\\t\\t\\tw = nxt[w];\\n\\t\\t} while (w != v);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tlong long Potential(int v)\\n\\t{\\n\\t\\tFind(v);\\n\\t\\treturn potential[v];\\n\\t}\\n\\n\\t// uから見たvのポテンシャル\\n\\tlong long Diff(int u, int v)\\n\\t{\\n\\t\\treturn Potential(v) - Potential(u);\\n\\t}\\n\\nprivate:\\n\\tstd::vector<int> parent;\\t// 親ノード\\n\\tstd::vector<int> nodes;\\t\\t// 同じグループに属するノードの数\\n\\tstd::vector<int> nxt;\\t\\t// 同じグループに属する次のノード(ループしている)\\n\\tstd::vector<long long> potential;\\t// ポテンシャル\\n\\tint groups;\\n};\\n\\nconst double EPS = 1e-10;\\n\\nstruct Solver\\n{\\n\\tint Run()\\n\\t{\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0)\\n\\t\\t\\treturn 1;\\n\\n\\t\\tUnionFind uf(N);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tchar c;\\n\\t\\t\\tcin >> c;\\n\\t\\t\\tif (c == '!') {\\n\\t\\t\\t\\tint u, v, w;\\n\\t\\t\\t\\tcin >> u >> v >> w;\\n\\t\\t\\t\\tu--, v--;\\n\\t\\t\\t\\tuf.Unite(u, v, w);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tint u, v;\\n\\t\\t\\t\\tcin >> u >> v;\\n\\t\\t\\t\\tu--, v--;\\n\\n\\t\\t\\t\\tif (uf.IsUnited(u, v)) {\\n\\t\\t\\t\\t\\tcout << uf.Diff(u, v) << \\\"\\\\n\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcout << \\\"UNKNOWN\\\\n\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\n\\t\\t}\\n\\n\\n\\t\\treturn 0;\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tstd::cin.tie(nullptr); //★インタラクティブ注意★\\n\\tstd::ios_base::sync_with_stdio(false);\\n\\tint T = 1;\\n\\t//cin >> T;\\n\\twhile (1)//T--)\\n\\t{\\n\\t\\tSolver S;\\n\\t\\tif (S.Run())\\n\\t\\t\\treturn 0;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/// 値渡しになっていないか?\\n/// 入力を全部読んでいるか? 途中でreturnしない\\n/// 32bitで収まるか? 10^5数えるとき\\n/// modは正しいか?\\n/// multisetでcountしていないか?\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5092,\n \"score_of_the_acc\": -0.2013,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1330_8572359\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n/* alias*/\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vll = vector<long long>;\\nusing vs = vector<string>;\\nusing vvi = vector<vi>;\\nusing vvll = vector<vll>;\\nusing vvs = vector<vs>;\\nusing pii = pair<int, int>;\\nusing vpii = vector<pii>;\\n\\n/* define short */\\n#define pb push_back\\n#define mp make_pair\\n#define reps(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define rreps(i, s, n) for (int i = n-1; i >= (s); i--)\\n#define rep(i, n) reps(i, 0, n)\\n#define rep1(i, n) reps(i, 1, n+1)\\n#define rrep(i, n) rreps(i, 0, n)\\n#define rrep1(i, n) rreps(i, 1, n+1)\\n#define all(a) (a).begin(), (a).end()\\n#define rall(a) (a).rbegin(), (a).rend()\\n\\n\\n/* func */\\ntemplate<class T> inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\\ntemplate<class T> inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\\n\\ntemplate<class T> struct WeightedUnionFind {\\n vector<int> par, rank;\\n vector<T> diff_weight;\\n\\n WeightedUnionFind(int n = 1) {\\n init(n);\\n }\\n\\n void init(int n = 1) {\\n par.resize(n); rank.resize(n); diff_weight.resize(n);\\n for (int i = 0; i < n; ++i) {\\n par[i] = i;\\n rank[i] = 0;\\n diff_weight[i] = 0;\\n }\\n }\\n\\n int root(int x) {\\n if (par[x] == x) return x;\\n else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n T weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n T diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n\\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n bool unite(int x, int y, T w) {\\n w += weight(x); w -= weight(y);\\n x = root(x); y = root(y);\\n if (x == y) return false;\\n if (rank[x] < rank[y]) swap(x, y), w = -w; // ry を rx の子にする\\n if (rank[x] == rank[y]) ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n};\\n\\nint main() { \\n int n,m;\\n while (true) {\\n cin>>n>>m;\\n if (n == 0) break;\\n WeightedUnionFind<int> uf(n);\\n rep(_,m) {\\n char s;int a,b,w;\\n cin>>s;\\n if (s == '!') {\\n cin>>a>>b>>w; --a;--b;\\n uf.unite(a,b,w);\\n }\\n if (s == '?') {\\n cin>>a>>b; --a;--b;\\n if (uf.same(a,b)) cout << uf.diff(a,b) << endl;\\n else cout << \\\"UNKNOWN\\\" << endl;\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 4316,\n \"score_of_the_acc\": -0.7998,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1330_8526304\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG 1\\n#include <bits/stdc++.h>\\n// #include <atcoder/all>\\nusing namespace std;\\n#define ll long long\\n#define ull unsigned long long\\n\\n#define rep1(i, n) for (int i = 1; i <= n; i++)\\n#define rep_0(i, n) for (int i = 0; i < n; i++)\\n#define rep_1(i, s, n) for (int i = s; i < n + s; i++)\\n#define rep_2(i, s, t, n) for (int i = s; i <= n; i += t)\\n#define rep_overload(e1, e2, e3, e4, f, ...) f\\n#define rep(...) rep_overload(__VA_ARGS__, rep_2, rep_1, rep_0)(__VA_ARGS__)\\n#define repr(i, n) for (int i = n - 1; i >= 0; i--)\\n#define repr1(i, n) for (int i = n; i > 0; i--)\\n\\nauto chmax = [](auto& a, auto b) {bool ret=a<b; if(ret)a=b; return ret; };\\nauto chmin = [](auto& a, auto b) {bool ret=a>b; if(ret)a=b; return ret; };\\ntemplate <typename T>\\nusing pq_inv = priority_queue<T, vector<T>, greater<T>>;\\nvector<int> dd4 = {1, 0, -1, 0, 1}; // rep(i,4) nh=h+dd4[i]; nw=w+dd4[i+1];\\nvector<int> dd8 = {1, 0, -1, 0, 1, 1, -1, -1, 1}; // rep(i,8) nh=h+dd8[i]; nw=w+dd8[i+1];\\n// using mint = atcoder::modint1000000007;\\n// using mint = atcoder::modint998244353;\\n\\ntemplate <typename T>\\nstruct WeightedUnionFind {\\n vector<int> par, rank;\\n vector<T> diff_weight;\\n WeightedUnionFind(int n) {\\n init(n);\\n }\\n void init(int n) {\\n par.assign(n, -1);\\n rank.assign(n, 0);\\n diff_weight.assign(n, 0);\\n }\\n int root(int x) {\\n if (par[x] == -1) return x;\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n T weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n bool is_same(int x, int y) {\\n return root(x) == root(y);\\n }\\n bool merge(int x, int y, T w) {\\n w += weight(x) - weight(y);\\n x = root(x);\\n y = root(y);\\n if (x == y) return false;\\n if (rank[x] < rank[y]) swap(x, y), w = -w;\\n if (rank[x] == rank[y]) rank[x]++;\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n T diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n};\\n\\nvoid solve(int N, int M) {\\n WeightedUnionFind<ll> wuf(N + 1);\\n rep(i, M) {\\n char t;\\n cin >> t;\\n if (t == '!') {\\n int x, y, d;\\n cin >> x >> y >> d;\\n wuf.merge(x, y, d);\\n } else {\\n int x, y;\\n cin >> x >> y;\\n if(wuf.is_same(x,y))cout << wuf.diff(x, y) << endl;\\n else cout << \\\"UNKNOWN\\\" << endl;\\n }\\n }\\n}\\n\\nint main() {\\n std::cin.tie(nullptr);\\n // int T;\\n // // cin >> T;\\n // T = 1;\\n // for (int i = 0; i < T; i++) {\\n // // solve(i);\\n // solve();\\n // }\\n\\n while (true) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0)\\n break;\\n else\\n (solve(N, M));\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 4460,\n \"score_of_the_acc\": -0.7697,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1330_8505550\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nTT struct weighted_uf {\\n vector<int> data;\\n vector<T> ws;\\n const int n;\\n weighted_uf(int n) : data(n, -1), ws(n, 0), n(n) {}\\n\\n int root(int x) {\\n if (data[x] < 0) return x;\\n int par = root(data[x]);\\n ws[x] += ws[data[x]];\\n return data[x] = par;\\n }\\n\\n T weight(int x) {\\n root(x);\\n return ws[x];\\n }\\n\\n bool unite(int x, int y, T w) {\\n w += weight(x), w -= weight(y);\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n data[x] += data[y], data[y] = x;\\n ws[y] = w;\\n return true;\\n }\\n\\n T diff(int x, int y) { return weight(y) - weight(x); }\\n\\n bool same(int x, int y) { return root(x) == root(y); }\\n};\\n\\nint main() {\\n while (1) {\\n int n, q;\\n cin >> n >> q;\\n if (!n)\\n break;\\n weighted_uf<ll> uf(n);\\n while (q--) {\\n char type;\\n ll x, y;\\n cin >> type >> x >> y;\\n x--, y--;\\n if (type == '!') {\\n ll w;\\n cin >> w;\\n uf.unite(x, y, w);\\n }\\n else {\\n if (uf.same(x, y))\\n cout << uf.diff(x, y) << '\\\\n';\\n else\\n cout << \\\"UNKNOWN\\\\n\\\";\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6716,\n \"score_of_the_acc\": -0.4198,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1330_8487917\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < n; ++i)\\ntypedef long long ll;\\nusing namespace std;\\n\\ntemplate <class Abel>\\nstruct UnionFind {\\n vector<int> par;\\n vector<int> rank;\\n vector<Abel> diff_weight;\\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n init(n, SUM_UNITY);\\n }\\n void init(int n = 1, Abel SUM_UNITY = 0) {\\n par.resize(n);\\n rank.resize(n);\\n diff_weight.resize(n);\\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n }\\n int root(int x) {\\n if (par[x] == x) {\\n return x;\\n } else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n Abel weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n bool merge(int x, int y, Abel w) {\\n w += weight(x);\\n w -= weight(y);\\n x = root(x);\\n y = root(y);\\n if (x == y) return false;\\n if (rank[x] < rank[y]) swap(x, y), w = -w;\\n if (rank[x] == rank[y]) ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n Abel diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n};\\n\\nvoid solve(int N, int M) {\\n UnionFind<ll> uf(N);\\n while (M--) {\\n char c;\\n cin >> c;\\n if (c == '!') {\\n int l, r;\\n ll w;\\n cin >> l >> r >> w;\\n l--, r--;\\n uf.merge(l, r, w);\\n } else if (c == '?') {\\n int l, r;\\n cin >> l >> r;\\n l--, r--;\\n\\n if (uf.issame(l, r)) cout << uf.diff(l, r) << \\\"\\\\n\\\";\\n else cout << \\\"UNKNOWN\\\\n\\\";\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n\\n int N, M;\\n while (cin >> N >> M, N) solve(N, M);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 4552,\n \"score_of_the_acc\": -0.1286,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1330_8483434\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <iostream>\\n#include <vector>\\nusing ll = long long;\\nusing ld = long double;\\nusing Graph = vector<vector<int>>;\\nusing vi = vector<int>;\\nusing vl = vector<long>;\\nusing vll = vector<long long>;\\nusing vb = vector<bool>;\\nusing vvi = vector<vi>;\\nusing vvl = vector<vl>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\nusing vc = vector<char>;\\nusing vvc = vector<vc>;\\nusing lll = __int128_t;\\nusing vs = vector<string>;\\nusing pii = pair<long long, long long>;\\nconst long double EPS = 1e-10;\\nconst double INF = 1e18;\\n\\nconst long double PI = acos(-1.0L);\\n#define mp make_pair\\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); i++)\\n#define rep(i, n) for (ll i = (0); i < (ll)(n); i++)\\n#define rrep(i, n) for (ll i = (1); i < (ll)(n + 1); i++)\\n#define repd(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define rrepd(i, n) for (ll i = n; i >= 1; i--)\\n#define ALL(n) n.begin(), n.end()\\n#define rALL(n) n.rbegin(), n.rend()\\n#define fore(i, a) for (auto &i : a)\\n#define IN(a, x, b) (a <= x && x < b)\\n#define IN(a, x, b) (a <= x && x < b)\\n#define INIT \\\\\\n std::ios::sync_with_stdio(false); \\\\\\n std::cin.tie(0);\\ntemplate <class T>\\ninline T CHMAX(T &a, const T b) {\\n return a = (a < b) ? b : a;\\n}\\ntemplate <class T>\\ninline T CHMIN(T &a, const T b) {\\n return a = (a > b) ? b : a;\\n}\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <deque> // deque\\n#include <iostream> // cout, endl, cin\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <string> // string, to_string, stoi\\n#include <tuple> // tuple, make_tuple\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <utility> // pair, make_pair\\n#include <vector> // vector\\nusing namespace std;\\n\\n#include <type_traits>\\n\\n#define LOOP(n) REPI($_, (n))\\n\\n#define REPI(i, n) \\\\\\n for (int i = 0, i##_length = static_cast<int>(n); i < i##_length; ++i)\\n#define REPF(i, l, r) \\\\\\n for (std::common_type_t<decltype(l), decltype(r)> i = (l), i##_last = (r); \\\\\\n i < i##_last; ++i)\\n#define REPIS(i, l, r, s) \\\\\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\\\\n i = (l), \\\\\\n i##_last = (r); \\\\\\n i < i##_last; i += (s))\\n\\n#define REPR(i, n) for (auto i = (n); --i >= 0;)\\n#define REPB(i, l, r) \\\\\\n for (std::common_type_t<decltype(l), decltype(r)> i = (r), i##_last = (l); \\\\\\n --i >= i##_last;)\\n#define REPRS(i, l, r, s) \\\\\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\\\\n i = (l) + ((r) - (l)-1) / (s) * (s), \\\\\\n i##_last = (l); \\\\\\n i >= i##_last; (i -= (s)))\\n\\n#define REP(...) $OVERLOAD4(__VA_ARGS__, REPIS, REPF, REPI, LOOP)(__VA_ARGS__)\\n#define REPD(...) $OVERLOAD4(__VA_ARGS__, REPRS, REPB, REPR)(__VA_ARGS__)\\n\\n#define FORO(i, n) \\\\\\n for (int i = 0, i##_last = static_cast<int>(n); i <= i##_last; ++i)\\n#define FORI(i, l, r) \\\\\\n for (std::common_type_t<decltype(l), decltype(r)> i = (l), i##_last = (r); \\\\\\n i <= i##_last; ++i)\\n#define FORIS(i, l, r, s) \\\\\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\\\\n i = (l), \\\\\\n i##_last = (r); \\\\\\n i <= i##_last; i += (s))\\n\\n#define FORRO(i, n) for (auto i = (n); i >= 0; --i)\\n#define FORR(i, l, r) \\\\\\n for (std::common_type_t<decltype(l), decltype(r)> i = (r), i##_last = (l); \\\\\\n i >= i##_last; --i)\\n#define FORRS(i, l, r, s) \\\\\\n for (std::common_type_t<decltype(l), decltype(r), decltype(s)> \\\\\\n i = (l) + ((r) - (l)) / (s) * (s), \\\\\\n i##_last = (l); \\\\\\n i >= i##_last; i -= (s))\\n\\n#define FOR(...) $OVERLOAD4(__VA_ARGS__, FORIS, FORI, FORO)(__VA_ARGS__)\\n#define FORD(...) $OVERLOAD4(__VA_ARGS__, FORRS, FORR, FORRO)(__VA_ARGS__)\\n\\n#define ITR1(e0, v) for (const auto &e0 : (v))\\n#define ITRP1(e0, v) for (auto e0 : (v))\\n#define ITRR1(e0, v) for (auto &e0 : (v))\\n\\n#define ITR2(e0, e1, v) for (const auto [e0, e1] : (v))\\n#define ITRP2(e0, e1, v) for (auto [e0, e1] : (v))\\n#define ITRR2(e0, e1, v) for (auto &[e0, e1] : (v))\\n\\n#define ITR3(e0, e1, e2, v) for (const auto [e0, e1, e2] : (v))\\n#define ITRP3(e0, e1, e2, v) for (auto [e0, e1, e2] : (v))\\n#define ITRR3(e0, e1, e2, v) for (auto &[e0, e1, e2] : (v))\\n\\n#define ITR4(e0, e1, e2, e3, v) for (const auto [e0, e1, e2, e3] : (v))\\n#define ITRP4(e0, e1, e2, e3, v) for (auto [e0, e1, e2, e3] : (v))\\n#define ITRR4(e0, e1, e2, e3, v) for (auto &[e0, e1, e2, e3] : (v))\\n\\n#define ITR(...) $OVERLOAD5(__VA_ARGS__, ITR4, ITR3, ITR2, ITR1)(__VA_ARGS__)\\n#define ITRP(...) \\\\\\n $OVERLOAD5(__VA_ARGS__, ITRP4, ITRP3, ITRP2, ITRP1)(__VA_ARGS__)\\n#define ITRR(...) \\\\\\n $OVERLOAD5(__VA_ARGS__, ITRR4, ITRR3, ITRR2, ITRR1)(__VA_ARGS__)\\nstd::ostream &operator<<(std::ostream &dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char *d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\ntemplate <class Type>\\nclass WeightedUnionFind {\\n public:\\n WeightedUnionFind() = default;\\n\\n /// @brief 重み付き Union-Find 木を構築します。\\n /// @param n 要素数\\n explicit WeightedUnionFind(size_t n)\\n : m_parentsOrSize(n, -1), m_diffWeights(n) {}\\n\\n /// @brief 頂点 i の root のインデックスを返します。\\n /// @param i 調べる頂点のインデックス\\n /// @return 頂点 i の root のインデックス\\n int find(int i) {\\n if (m_parentsOrSize[i] < 0) {\\n return i;\\n }\\n\\n const int root = find(m_parentsOrSize[i]);\\n\\n m_diffWeights[i] += m_diffWeights[m_parentsOrSize[i]];\\n\\n // 経路圧縮\\n return (m_parentsOrSize[i] = root);\\n }\\n\\n /// @brief a のグループと b のグループを統合します。\\n /// @param a 一方のインデックス\\n /// @param b 他方のインデックス\\n /// @param w (b の重み) - (a の重み)\\n /// a を含むグループと b を含むグループを併合し、b の重みは a と比べて w\\n /// 大きくなるようにする\\n void merge(int a, int b, Type w) {\\n w += weight(a);\\n w -= weight(b);\\n\\n a = find(a);\\n b = find(b);\\n\\n if (a != b) {\\n // union by size (小さいほうが子になる）\\n if (-m_parentsOrSize[a] < -m_parentsOrSize[b]) {\\n std::swap(a, b);\\n w = -w;\\n }\\n\\n m_parentsOrSize[a] += m_parentsOrSize[b];\\n m_parentsOrSize[b] = a;\\n m_diffWeights[b] = w;\\n }\\n }\\n\\n /// @brief (b の重み) - (a の重み) を返します。\\n /// @param a 一方のインデックス\\n /// @param b 他方のインデックス\\n /// @remark a と b が同じグループに属さない場合の結果は不定です。\\n /// @return (b の重み) - (a の重み)\\n ///(b の重み) - (a の重み) を返す。a と b\\n /// が同じグループに属さない場合の結果は不定\\n Type diff(int a, int b) { return (weight(b) - weight(a)); }\\n\\n /// @brief a と b が同じグループに属すかを返します。\\n /// @param a 一方のインデックス\\n /// @param b 他方のインデックス\\n /// @return a と b が同じグループに属す場合 true, それ以外の場合は false\\n /// a と b が同じグループに属すかを返す\\n bool connected(int a, int b) { return (find(a) == find(b)); }\\n\\n /// @brief i が属するグループの要素数を返します。\\n /// @param i インデックス\\n /// @return i が属するグループの要素数\\n int size(int i) { return -m_parentsOrSize[find(i)]; }\\n\\n private:\\n // m_parentsOrSize[i] は i の 親,\\n // ただし root の場合は (-1 * そのグループに属する要素数)\\n std::vector<int> m_parentsOrSize;\\n\\n // 重み\\n std::vector<Type> m_diffWeights;\\n\\n Type weight(int i) {\\n find(i); // 経路圧縮\\n return m_diffWeights[i];\\n }\\n};\\n\\n__int128 parse(string &s) {\\n __int128 ret = 0;\\n for (int i = 0; i < s.length(); i++)\\n if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n\\nll GCD(ll m, ll n) {\\n // ベースケース\\n if (n == 0) return m;\\n\\n // 再帰呼び出し\\n return GCD(n, m % n);\\n}\\n\\nll minlong = 0;\\n\\nlong long Power(long long a, long long b, long long m) {\\n long long p = a, Answer = 1;\\n for (int i = 0; i < 63; i++) {\\n ll wari = (1LL << i);\\n if ((b / wari) % 2 == 1) {\\n Answer %= m;\\n Answer = (Answer * p) % m; // 「a の 2^i 乗」が掛けられるとき\\n }\\n p %= m;\\n p = (p * p) % m;\\n }\\n return Answer;\\n}\\n\\n// a ÷ b を m で割った余りを返す関数\\nlong long Division(long long a, long long b, long long m) {\\n return (a * Power(b, m - 2, m)) % m;\\n}\\n\\n// nCr mod 998244353 を返す関数\\nlong long nCk(ll n, ll r) {\\n const long long M = 998244353;\\n\\n // 手順 1: 分子 a を求める\\n long long a = 1;\\n for (int i = 1; i <= n; i++) a = (a * i) % M;\\n\\n // 手順 2: 分母 b を求める\\n long long b = 1;\\n for (int i = 1; i <= r; i++) b = (b * i) % M;\\n for (int i = 1; i <= n - r; i++) b = (b * i) % M;\\n\\n // 手順 3: 答えを求める\\n return Division(a, b, M);\\n}\\nusing Interval = pair<ll, ll>;\\n// 終点時間でsortをかけるのに必要(区間スケジューリング問題など)\\nbool cmp(const Interval &a, const Interval &b) { return a.second < b.second; }\\nvll dycstra(vector<vector<pair<ll, ll>>> G, ll N, ll K) {\\n vb kaku(N, false);\\n vll cur(N, INF);\\n cur[K] = 0;\\n priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;\\n Q.push(make_pair(cur[K], K));\\n while (!Q.empty()) {\\n ll pos = Q.top().second;\\n Q.pop();\\n if (kaku[pos]) continue;\\n kaku[pos] = true;\\n for (ll i = 0; i < G[pos].size(); i++) {\\n ll nex = G[pos][i].first;\\n ll cost = G[pos][i].second;\\n if (cur[nex] > cur[pos] + cost) {\\n cur[nex] = cur[pos] + cost;\\n Q.push(make_pair(cur[nex], nex));\\n }\\n }\\n }\\n return cur;\\n}\\ntemplate <typename T>\\nvoid Print(vector<T> &A) {\\n rep(i, A.size()) { cout << A[i] << ' '; }\\n cout << endl;\\n}\\ntemplate <typename xy>\\nclass BIT {\\n public:\\n BIT() = default;\\n\\n // 長さ size の数列で初期化\\n explicit BIT(size_t size) : m_bit(size + 1) {}\\n\\n // 数列で初期化\\n explicit BIT(const std::vector<xy> &v) : BIT(v.size()) {\\n for (int i = 0; i < v.size(); ++i) {\\n add((i + 1), v[i]);\\n }\\n }\\n\\n // 閉区間 [1, r] の合計を返す (1-based indexing)\\n xy sum(int r) const {\\n xy ret = 0;\\n\\n for (; 0 < r; r -= (r & -r)) {\\n ret += m_bit[r];\\n }\\n\\n return ret;\\n }\\n\\n // 閉区間 [l, r] の合計を返す (1-based indexing)\\n xy sum(int l, int r) const { return (sum(r) - sum(l - 1)); }\\n\\n // 数列の i 番目の要素を加算 (1-based indexing)\\n void add(int i, xy value) {\\n for (; i < m_bit.size(); i += (i & -i)) {\\n m_bit[i] += value;\\n }\\n }\\n\\n private:\\n std::vector<xy> m_bit;\\n};\\n\\n// Binary Indexed Tree (1.2 区間加算対応)\\n// 1-based indexing\\ntemplate <typename x>\\nclass BIT_RAQ {\\n public:\\n BIT_RAQ() = default;\\n\\n explicit BIT_RAQ(size_t size) : m_bit0(size), m_bit1(size) {}\\n\\n explicit BIT_RAQ(const std::vector<x> &v) : m_bit0(v), m_bit1(v.size()) {}\\n\\n // 閉区間 [1, r] の合計を返す (1-based indexing)\\n x sum(int r) const { return (m_bit0.sum(r) + m_bit1.sum(r) * r); }\\n\\n // 閉区間 [l, r] の合計を返す (1-based indexing)\\n x sum(int l, int r) const { return (sum(r) - sum(l - 1)); }\\n\\n // 数列の i 番目の要素を加算 (1-based indexing)\\n void add(int i, x value) { m_bit0.add(i, value); }\\n\\n // 閉区間 [l, r] の要素を加算 (1-based indexing)\\n void add(int l, int r, x value) {\\n x a = (-value * (l - 1)), b = (value * r);\\n m_bit0.add(l, a);\\n m_bit0.add((r + 1), b);\\n m_bit1.add(l, value);\\n m_bit1.add((r + 1), -value);\\n }\\n\\n private:\\n BIT<x> m_bit0;\\n\\n BIT<x> m_bit1;\\n};\\nvll BFS(vvll &G, ll &x) {\\n vll cut(G.size(), INF);\\n queue<ll> Q;\\n Q.push(x);\\n cut[x] = 0;\\n while (!Q.empty()) {\\n ll a = Q.front();\\n Q.pop();\\n rep(i, G[a].size()) {\\n if (cut[G[a][i]] > cut[a] + 1) {\\n cut[G[a][i]] = cut[a] + 1;\\n Q.push(G[a][i]);\\n }\\n }\\n }\\n return cut;\\n}\\n\\nvoid Yes(bool b) {\\n if (b)\\n cout << \\\"Yes\\\" << endl;\\n else\\n cout << \\\"No\\\" << endl;\\n}\\nvector<long long> yaku(long long n) {\\n vector<long long> ret;\\n for (long long i = 1; i * i <= n; i++) {\\n if (n % i == 0) {\\n ret.push_back(i);\\n if (i * i != n) ret.push_back(n / i);\\n }\\n }\\n sort(ret.begin(), ret.end()); // 昇順に並べる\\n return ret;\\n}\\n\\npriority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;\\n\\ndouble randouble() { return 1.0 * rand() / RAND_MAX; }\\nstruct Mo {\\n int n;\\n vector<pair<int, int>> lr;\\n\\n explicit Mo(int n) : n(n) {} // nの値の設定を行う。\\n\\n void add(int l, int r) { /* [l, r) */\\n lr.push_back({l, r});\\n }\\n\\n template <typename AL, typename AR, typename EL, typename ER, typename O>\\n void build(const AL &add_left, const AR &add_right, const EL &erase_left,\\n const ER &erase_right, const O &out) {\\n int q = (int)lr.size(); // lr.size()はクエリの数に等しい。\\n int bs = n / min<int>(n, sqrt(q)); // 事実上bs>0となるように設定、\\n // cout << bs << endl;\\n vector<int> ord(q);\\n iota(begin(ord), end(ord), 0);\\n sort(begin(ord), end(ord), [&](int a, int b) {\\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\\n if (ablock != bblock) return ablock < bblock; //\\n return (ablock & 1) ? lr[a].second > lr[b].second\\n : lr[a].second < lr[b].second;\\n // 偶奇で昇順・降順を分けることによって計算量が定数倍高速化する。\\n });\\n int l = 0, r = 0;\\n for (auto idx : ord) {\\n // cout << idx << endl;\\n while (l > lr[idx].first) add_left(--l);\\n while (r < lr[idx].second) add_right(r++);\\n while (l < lr[idx].first) erase_left(l++);\\n while (r > lr[idx].second) erase_right(--r);\\n out(idx);\\n }\\n }\\n\\n template <typename A, typename E, typename O>\\n void build(const A &add, const E &erase, const O &out) {\\n build(add, add, erase, erase, out);\\n }\\n};\\n\\nstruct TRI {\\n ll a;\\n ll b;\\n ll c;\\n};\\nbool operator>(const TRI &r, const TRI &l) {\\n return (r.a > l.a | (r.a == l.a & r.b > l.b) |\\n (r.a == l.a & r.b == l.b & r.c > l.c));\\n}\\nbool operator<(const TRI &r, const TRI &l) {\\n return (r.a < l.a | (r.a == l.a & r.b < l.b) |\\n (r.a == l.a & r.b == l.b & r.c < l.c));\\n}\\nstruct TR {\\n ll a;\\n ll b;\\n ll c;\\n ll d;\\n};\\nbool operator>(const TR &r, const TR &l) {\\n return (r.a > l.a | (r.a == l.a & r.b > l.b) |\\n (r.a == l.a & r.b == l.b & r.c > l.c));\\n}\\nbool operator<(const TR &r, const TR &l) {\\n return (r.a < l.a | (r.a == l.a & r.b < l.b) |\\n (r.a == l.a & r.b == l.b & r.c < l.c));\\n}\\n// Sはdataを表している。\\nusing S = ll;\\n// Fはlazy(遅延伝搬用)を表している\\nusing F = ll;\\n// 区間取得をどのようにするかを定義する。RMQだったらmin(a,b)とかになる。\\nS op(S a, S b) { return a + b; };\\n// op(e,a)=op(a,e)=aとなるような単位元を定義する。RMQの場合はINFが安牌\\nS e() { return 0; }\\n// 親のlazyが子のdataに対してどの様に作用させるかを定義する。区間加算をする場合はただ足せば良い\\nS mapping(F f, S x) { return x + f; }\\n/*親のlazyが子のlazyに対してどの様に作用させるかを定義する。区間加算をする場合はただ足せば良い\\nただ可変では無い場合fが後の操作である事を留意しておくと良い*/\\nF composition(F f, F g) { return f + g; }\\n// mapping(a,id)=aとなる様なidを設定すれば良い今回の区間加算の場合は0が適する。区間乗算の場合は1が適する\\nF id() { return 0; }\\nll half = 499122177;\\n// 条件を満たす場合オイラーツアーを考えれば出来る。\\n// 重要なのは求める次数を満たす辺を構築すること\\n// G:グラフ,P:オイラーツアーで探索した際に通った辺の番号の配列,in,out:最初と最後に通った時刻\\n// U[辺の番号]={親,現在いる位置}正の値だったら終点、それ以外親を出力することで頂点で表した経路の復元が可能\\n// num=辺の番号を記録,cou=時刻を記録\\n\\n// 返り値: a と b の最大公約数\\n// ax + by = gcd(a, b) を満たす (x, y) が格納される\\nlong long extGCD(long long a, long long b, long long &x, long long &y) {\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n long long d = extGCD(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\nvll toposo(vvll &G) {\\n // 帰りがけでやりたい場合はstack、幅優先でやりたい場合はqueueで行う\\n stack<ll> Q;\\n ll n = G.size();\\n vll A(n, 0);\\n rep(i, n) {\\n rep(j, G[i].size()) { A[G[i][j]]++; }\\n }\\n vb han(n, false);\\n rep(i, n) {\\n if (A[i] == 0) {\\n Q.push(i);\\n han[i] = true;\\n }\\n }\\n vll B;\\n while (!Q.empty()) {\\n ll a = Q.top();\\n Q.pop();\\n B.push_back(a);\\n rep(i, G[a].size()) {\\n if (!han[G[a][i]]) {\\n A[G[a][i]]--;\\n if (A[G[a][i]] == 0) {\\n Q.push(G[a][i]);\\n han[G[a][i]] = true;\\n }\\n }\\n }\\n }\\n if (B.size() != n) {\\n vll C(n, -2);\\n return C;\\n }\\n return B;\\n}\\n#include <bits/stdc++.h>\\n// ax+bのようなグラフの最小値をクエリ一個あたりO(1)で算出することが出来る。\\n// 条件は２つ存在する。\\n// 1.追加される順に傾きは単調減少でなければならない(傾きに関してソートする必要性が生じる)\\n// 2.追加される順にxは単調増加でなければならない(クエリ先読み等のひと手間が必要になる可能性がある)\\n// ２つの条件が満たせない場合はこのサンプルを使うことが出来ない(クエリが２種類存在し、直線の追加とxを指定して最小値を求める動作を平行して行う場合等)\\n\\nstruct ConvexHullTrick {\\n std::deque<std::pair<long long, long long>> dq; // （傾き、切片）\\n\\n void add(long long a, long long b) {\\n std::pair<long long, long long> p0 = std::make_pair(a, b);\\n while (dq.size() >= 2) {\\n int sz = dq.size();\\n std::pair<long long, long long> p1 = dq[sz - 1];\\n std::pair<long long, long long> p2 = dq[sz - 2];\\n if ((p0.second - p1.second) * (p0.first - p2.first) <\\n (p0.second - p2.second) * (p0.first - p1.first))\\n break; // 交点のx座標を比較\\n dq.pop_back();\\n }\\n dq.push_back(p0);\\n }\\n\\n long long query(long long x) {\\n while (dq.size() >= 2) {\\n long long v1 = dq[0].first * x + dq[0].second;\\n long long v2 = dq[1].first * x + dq[1].second;\\n if (v1 <= v2) break;\\n dq.pop_front();\\n }\\n return dq[0].first * x + dq[0].second;\\n }\\n};\\n// if(a <= b + EPS) // a <= b\\n// if(a < b - EPS) // a < b\\n// if(abs(a - b) < EPS) // a == b\\n// 頂点 s から頂点 t までの最大フローの総流量を返す\\nvector<vector<pair<ll, ll>>> G;\\nll K;\\nvb han;\\nll ans;\\nll N;\\nvll X;\\nvector<vector<pair<ll, ll>>> G1;\\nvoid dfs(ll cou, ll poi) {\\n if (cou == ((1LL << N) - 1)) {\\n ans = min(ans, poi);\\n }\\n for (auto u : G1[cou]) {\\n dfs(cou + (1LL << u.first), (poi + u.second) % K);\\n }\\n return;\\n}\\nint main() {\\n cout << fixed << setprecision(20);\\n ll M;\\n ll a = 0, b = 0;\\n ll c = 0;\\n ll p = 1;\\n string S, T;\\n ll H, W;\\n ll t;\\n char O;\\n while (1) {\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vll A(M), B(M), C(M);\\n vb han(N, false);\\n WeightedUnionFind<ll> U(N);\\n rep(i, M) {\\n cin >> O;\\n if (O == '!') {\\n cin >> A[i] >> B[i] >> C[i], --A[i], --B[i];\\n if (!U.connected(A[i], B[i])) {\\n U.merge(A[i], B[i], C[i]);\\n }\\n } else {\\n cin >> A[i] >> B[i], --A[i], --B[i];\\n if (U.connected(A[i], B[i])) {\\n cout << U.diff(A[i], B[i]) << endl;\\n\\n } else {\\n cout << \\\"UNKNOWN\\\" << endl;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 6768,\n \"score_of_the_acc\": -1.1397,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1330_8439094\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/modint>\\n#define rng(a) a.begin(),a.end()\\n#define rrng(a) a.rbegin(),a.rend()\\n#define INF 2000000000000000000\\n#define ull unsigned long long\\n#define ll long long\\n#define ld long double\\n#define pll pair<ll, ll>\\nusing namespace std;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (true) {\\n \\n ll N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) {\\n break;\\n }\\n vector<vector<ll>> child(N);\\n vector<ll> par(N);\\n for (ll i = 0; i < N; ++i) {\\n par.at(i) = i;\\n }\\n vector<ll> X(N, 0);\\n for (ll q = 0; q < M; ++q) {\\n char c;\\n ll a, b, w;\\n cin >> c >> a >> b;\\n a -= 1, b -= 1;\\n bool same = (par.at(a) == par.at(b));\\n if (c == '?') {\\n if (same) {\\n cout << X.at(b) - X.at(a) << \\\"\\\\n\\\";\\n }\\n else {\\n cout << \\\"UNKNOWN\\\" << \\\"\\\\n\\\";\\n }\\n }\\n else {\\n cin >> w;\\n if (same) {\\n continue;\\n }\\n ll a_size = child.at(par.at(a)).size();\\n ll b_size = child.at(par.at(b)).size();\\n if (a_size < b_size) {\\n swap(a, b);\\n swap(a_size, b_size);\\n w = -w;\\n }\\n ll dx = X.at(a) + w - X.at(b);\\n ll par_b = par.at(b);\\n for (ll i = 0; i < child.at(par_b).size(); ++i) {\\n ll cb = child.at(par_b).at(i);\\n child.at(par.at(a)).push_back(cb);\\n par.at(cb) = par.at(a);\\n X.at(cb) += dx;\\n }\\n child.at(par.at(a)).push_back(par_b);\\n par.at(par_b) = par.at(a);\\n X.at(par_b) += dx;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 8604,\n \"score_of_the_acc\": -0.6837,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1330_7916403\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nusing ull = unsigned long long;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<ll> vll;\\ntypedef vector<pll> vpll;\\ntemplate<class T> using pqmin = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using pqmax = priority_queue<T>;\\nconst ll inf=LLONG_MAX/3;\\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\\n#define mp make_pair\\n#define pb push_back\\n#define eb emplace_back\\n#define fi first\\n#define se secondf\\n#define all(x) x.begin(),x.end()\\n#define si(x) ll(x.size())\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define per(i,n) for(ll i=n-1;i>=0;i--)\\n#define rng(i,l,r) for(ll i=l;i<r;i++)\\n#define gnr(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define fore(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\ntemplate<class T> bool chmin(T& a, const T& b){ if(a <= b) return 0; a = b; return 1; }\\ntemplate<class T> bool chmax(T& a, const T& b){ if(a >= b) return 0; a = b; return 1; }\\ntemplate<class T, class U> bool chmin(T& a, const U& b){ return chmin(a, (T)b); }\\ntemplate<class T, class U> bool chmax(T& a, const U& b){ return chmax(a, (T)b); }\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define VLL(name,size) vector<ll>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>> name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>> name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>> name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\n#define SUM(...) accumulate(all(__VA_ARGS__),0LL)\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\ntemplate<class T, class F = less<>> void sor(T& a, F b = F{}){ sort(all(a), b); }\\ntemplate<class T> void uniq(T& a){ sor(a); a.erase(unique(all(a)), end(a)); }\\nvoid outb(bool x){cout<<(x?\\\"Yes\\\":\\\"No\\\")<<\\\"\\\\n\\\";}\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))\\nll gcd(ll a,ll b){return (b?gcd(b,a%b):a);}\\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); per(i,ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\nvll prime_table(ll n){vec(ll,isp,n+1,1);vll res;rng(i,2,n+1)if(isp[i]){res.pb(i);for(ll j=i*i;j<=n;j+=i)isp[j]=0;}return res;}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {\\n\\t\\tfore(e, v) e++;\\n\\t\\treturn v;\\n}\\ntemplate <class T> vector<T> operator++(vector<T> &v, int) {\\n\\t\\tauto res = v;\\n\\t\\tfore(e, v) e++;\\n\\t\\treturn res;\\n}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {\\n\\t\\tfore(e, v) e--;\\n\\t\\treturn v;\\n}\\ntemplate <class T> vector<T> operator--(vector<T> &v, int) {\\n\\t\\tauto res = v;\\n\\t\\tfore(e, v) e--;\\n\\t\\treturn res;\\n}\\ntemplate <class T> vector<T> &operator+=(vector<T> &l, const vector<T> &r) {\\n\\t\\tfore(e, r) l.eb(e);\\n\\t\\treturn l;\\n}\\n\\ntemplate<class... Ts> void in(Ts&... t);\\n[[maybe_unused]] void print(){}\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts);\\ntemplate<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\\\\n'; }\\nnamespace IO{\\n#define VOID(a) decltype(void(a))\\nstruct S{ S(){ cin.tie(nullptr)->sync_with_stdio(0); fixed(cout).precision(12); } }S;\\ntemplate<int I> struct P : P<I-1>{};\\ntemplate<> struct P<0>{};\\ntemplate<class T> void i(T& t){ i(t, P<3>{}); }\\nvoid i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }\\ntemplate<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }\\ntemplate<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }\\ntemplate<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){ in(get<idx>(t)...); }\\ntemplate<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ ituple(t, make_index_sequence<tuple_size<T>::value>{}); }\\ntemplate<class T> void o(const T& t){ o(t, P<4>{}); }\\ntemplate<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }\\ntemplate<class T, size_t N> void o(const T (&t)[N], P<3>){ o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); } }\\ntemplate<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }\\ntemplate<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }\\ntemplate<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){ print(get<idx>(t)...); }\\ntemplate<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){ otuple(t, make_index_sequence<tuple_size<T>::value>{}); }\\n#undef VOID\\n}\\n#define unpack(a) (void)initializer_list<int>{(a, 0)...}\\ntemplate<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }\\ntemplate<class T, class... Ts> void print(const T& t, const Ts&... ts){ IO::o(t); unpack(IO::o((cout << ' ', ts))); }\\n#undef unpack\\n\\nstruct WeightedUnionFind{\\n\\tvll par,wdiff;\\n\\tWeightedUnionFind(ll n=-1){\\n\\t\\tinit(n);\\n\\t}\\n\\tvoid init(ll n){\\n\\t\\tpar.resize(n);\\n\\t\\twdiff.resize(n);\\n\\t\\trep(i,n){\\n\\t\\t\\tpar[i]=i;\\n\\t\\t\\twdiff[i]=0;\\n\\t\\t}\\n\\t}\\n\\tll root(ll x){\\n\\t\\tif(par[x]==x){\\n\\t\\t\\treturn x;\\n\\t\\t}\\n\\t\\tll r=root(par[x]);\\n\\t\\twdiff[x]+=wdiff[par[x]];\\n\\t\\tpar[x]=r;\\n\\t\\treturn r;\\n\\t}\\n\\tbool same(ll x,ll y){\\n\\t\\treturn root(x)==root(y);\\n\\t}\\n\\tvoid merge(ll x,ll y,ll w){\\n\\t\\t//w[x]==w[y]+w\\n\\t\\tll rx=root(x); //w[x]=w[rx]+wdiff[x]\\n\\t\\tll ry=root(y); //w[y]=w[ry]+wdiff[y]\\n\\t\\twdiff[rx]=w-wdiff[x]+wdiff[y]; //w[rx]=w[ry]-wfidd[x]+wdiff[y]+w\\n\\t\\tpar[rx]=ry;\\n\\t}\\n\\tll weight(ll x){\\n\\t\\troot(x);\\n\\t\\treturn wdiff[x];\\n\\t}\\n\\tll diff(ll x,ll y){\\n\\t\\treturn weight(x)-weight(y);\\n\\t}\\n};\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\twhile(1){\\n\\t\\tLL(n,m);\\n\\t\\tif(n==0)break;\\n\\t\\tWeightedUnionFind uf(n);\\n\\t\\trep(_,m){\\n\\t\\t\\tCHR(t);\\n\\t\\t\\tif(t=='!'){\\n\\t\\t\\t\\tLL(a,b,w);\\n\\t\\t\\t\\ta--,b--;\\n\\t\\t\\t\\tuf.merge(b,a,w);\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tLL(a,b);\\n\\t\\t\\t\\ta--,b--;\\n\\t\\t\\t\\tif(!uf.same(a,b)){\\n\\t\\t\\t\\t\\tout(\\\"UNKNOWN\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tout(uf.diff(b,a));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6692,\n \"score_of_the_acc\": -0.4166,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1330_7555856\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n \\nusing namespace std;\\n \\ntemplate<class Abel> struct UnionFind {\\n vector<int> par;\\n vector<int> rank;\\n vector<Abel> diff_weight;\\n\\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n init(n, SUM_UNITY);\\n }\\n\\n void init(int n = 1, Abel SUM_UNITY = 0) {\\n par.resize(n); rank.resize(n); diff_weight.resize(n);\\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n }\\n\\n int root(int x) {\\n if (par[x] == x) {\\n return x;\\n }\\n else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n Abel weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n bool same(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n bool merge(int x, int y, Abel w) {\\n w += weight(x); w -= weight(y);\\n x = root(x); y = root(y);\\n if (x == y) return false;\\n if (rank[x] < rank[y]) swap(x, y), w = -w;\\n if (rank[x] == rank[y]) ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n Abel diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n};\\n \\nint main(){\\n while(true){\\n int N,M;\\n cin >> N >> M;\\n if(N==0 && M==0) break;\\n \\n UnionFind<int> tree(N);\\n \\n rep(i,M){\\n int L,R,D;\\n char Q;\\n cin >> Q;\\n if(Q == '!'){\\n //mergeする\\n cin >> L >> R >> D;\\n L--; R--;\\n tree.merge(L,R,D);\\n }\\n else{\\n //LとRが同じグループなら距離が分かる\\n cin >> L >> R;\\n L--; R--;\\n if(tree.same(L,R)){\\n cout << tree.diff(L,R) << endl;\\n }\\n else{\\n cout << \\\"UNKNOWN\\\" << endl;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 3940,\n \"score_of_the_acc\": -1.0463,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":784,"cells":{"group_id":{"kind":"string","value":"aoj_1334_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nCubic Colonies\nIn AD 3456, the earth is too small for hundreds of billions of people to live in peace. Interstellar Colonization Project with Cubes (ICPC) is a project that tries to move people on the earth to space colonies to ameliorate the problem. ICPC obtained funding from governments and manufactured space colonies very quickly and at low cost using prefabricated cubic blocks.\nThe largest colony looks like a Rubik's cube. It consists of 3 × 3 × 3 cubic blocks (Figure J.1A). Smaller colonies miss some of the blocks in the largest colony.\nWhen we manufacture a colony with multiple cubic blocks, we begin with a single block. Then we iteratively glue a next block to existing blocks in a way that faces of them match exactly. Every pair of touched faces is glued.\nFigure J.1: Example of the largest colony and a smaller colony\nHowever, just before the first launch, we found a design flaw with the colonies. We need to add a cable to connect two points on the surface of each colony, but we cannot change the inside of the prefabricated blocks in a short time. Therefore we decided to attach a cable on the surface of each colony. If a part of the cable is not on the surface, it would be sheared off during the launch, so we have to put the whole cable on the surface. We would like to minimize the lengths of the cables due to budget constraints. The dashed line in Figure J.1B is such an example.\nWrite a program that, given the shape of a colony and a pair of points on its surface, calculates the length of the shortest possible cable for that colony.\nInput\nThe input contains a series of datasets. Each dataset describes a single colony and the pair of the points for the colony in the following format.\nx\n1\ny\n1\nz\n1\nx\n2\ny\n2\nz\n2\nb\n0,0,0\nb\n1,0,0\nb\n2,0,0\nb\n0,1,0\nb\n1,1,0\nb\n2,1,0\nb\n0,2,0\nb\n1,2,0\nb\n2,2,0\nb\n0,0,1\nb\n1,0,1\nb\n2,0,1\nb\n0,1,1\nb\n1,1,1\nb\n2,1,1\nb\n0,2,1\nb\n1,2,1\nb\n2,2,1\nb\n0,0,2\nb\n1,0,2\nb\n2,0,2\nb\n0,1,2\nb\n1,1,2\nb\n2,1,2\nb\n0,2,2\nb\n1,2,2\nb\n2,2,2\n(\nx\n1\n,\ny\n1\n,\nz\n1\n) and (\nx\n2\n,\ny\n2\n,\nz\n2\n) are the two distinct points on the surface of the colony, where\nx\n1\n,\nx\n2\n,\ny\n1\n,\ny\n2\n,\nz\n1\n,\nz\n2\nare integers that satisfy 0 ≤\nx\n1\n,\nx\n2\n,\ny\n1\n,\ny\n2\n,\nz\n1\n,\nz\n2\n≤ 3.\nb\ni,j,k\nis '\n#\n' when there is a cubic block whose two diagonal vertices are (\ni\n,\nj\n,\nk\n) and (\ni\n+ 1,\nj\n+ 1,\nk\n+ 1), and\nb\ni,j,k\nis '\n.\n' if there is no block. Figure J.1A corresponds to the first dataset in the sample input, whereas Figure J.1B corresponds to the second. A cable can pass through a zero-width gap between two blocks if they are touching only on their vertices or edges. In Figure J.2A, which is the third dataset in the sample input, the shortest cable goes from the point A (0, 0, 2) to the point B (2, 2, 2), passing through (1, 1, 2), which is shared by six blocks. Similarly, in Figure J.2B (the fourth dataset in the sample input), the shortest cable goes through the gap between two blocks not glued directly. When two blocks share only a single vertex, you can put a cable through the vertex\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1334_4876386","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 10005\n\nenum DIR{\n\tUP,\n\tEast,\n\tNorth,\n\tWest,\n\tSouth,\n\tDown,\n};\n\n\nstruct LOC{\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\t/*void debug(){\n\n\t\tprintf(\"X:%d Y:%d Z:%d\\n\",X,Y,Z);\n\t}*/\n\tint X,Y,Z;\n};\n\n\nstruct Point3D{\n\tPoint3D(double arg_x,double arg_y,double arg_z){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tz = arg_z;\n\t\tX = Y = Z = 0;\n\t}\n\n\tPoint3D(){\n\t\tx = y = z = 0.0;\n\t\tX = Y = Z = 0;\n\t}\n\n\tPoint3D operator + (Point3D p){ return Point3D(x+p.x,y+p.y,z+p.z); }\n\tPoint3D operator - (Point3D p){ return Point3D(x-p.x,y-p.y,z-p.z);}\n\tPoint3D operator * (double a){ return Point3D(a*x,a*y,a*z); }\n\tPoint3D operator / (double a){ return Point3D(x/a,y/a,z/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y + z*z; }\n\n\tbool operator<(const Point3D &p) const{\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else if(fabs(y-p.y) > EPS){\n\n\t\t\treturn y < p.y;\n\t\t}else{\n\n\t\t\treturn z < p.z;\n\t\t}\n\t}\n\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\n\tvoid copy(){\n\t\tx = X;\n\t\ty = Y;\n\t\tz = Z;\n\t}\n\n\tbool operator == (const Point3D &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS && fabs(z-p.z) < EPS;\n\t}\n\t/*void debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf,%.3lf)\\n\",x,y,z);\n\t}*/\n\tint X,Y,Z;\n\tdouble x,y,z;\n};\n\ntypedef Point3D Vector3D;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point3D a,Point3D b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint3D p[2];\n};\n\nstruct Data{\n\tData(){\n\n\t\tX = Y = Z = 0;\n\t\tx = y = z = 0;\n\t}\n\tData(double arg_x,double arg_y,double arg_z){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tz = arg_z;\n\t\tX = Y = Z = 0;\n\t}\n\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\tvoid copy(){\n\t\tx = X;\n\t\ty = Y;\n\t\tz = Z;\n\t}\n\tvoid debug(){\n\n\t\tprintf(\"%d %d %d\\n\",X,Y,Z);\n\t}\n\tint X,Y,Z;\n\tdouble x,y,z;\n};\n\nstruct Seg{\n\tvoid set(int arg_A,int arg_B){\n\t\tA = arg_A;\n\t\tB = arg_B;\n\t}\n\tint A,B;\n};\n\nstruct Edge{\n\tEdge(int arg_to,double arg_dist){\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t}\n\tint to;\n\tdouble dist;\n};\n\nstruct Info{\n\tInfo(){\n\t\tindex = 0;\n\t}\n\tInfo(Point3D arg_p,int arg_index){\n\t\tp = arg_p;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Info &arg)const{\n\n\t\treturn p < arg.p;\n\t}\n\tbool operator==(const struct Info &arg) const{\n\n\t\treturn p == arg.p;\n\t}\n\tPoint3D p;\n\tint index;\n};\n\nstruct State{\n\tState(int arg_node_id,double arg_sum_dist){\n\t\tnode_id = arg_node_id;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct State &arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\n\t}\n\tint node_id;\n\tdouble sum_dist;\n};\n\nint num_loc,num_data,num_POINT,num_seg;\nint S,T;\nint ADJ[27][6];\nint loc_X[6] = {0,1,0,-1,0,0},loc_Y[6] = {-1,0,0,0,0,1},loc_Z[6] = {0,0,1,0,-1,0};\nint D_X[8] = {0,1,0,1,0,1,0,1},D_Y[8] = {0,0,0,0,1,1,1,1},D_Z[8] = {0,0,1,1,0,0,1,1};\nint have_L[6][4] ={{0,1,2,3},{1,5,9,10},{2,6,10,11},{3,7,8,11},{0,4,8,9},{4,5,6,7}};\nint L_array[12][2] = {{0,1},{1,3},{2,3},{0,2},{4,5},{5,7},{6,7},{4,6},{0,4},{1,5},{3,7},{2,6}};\nint D[27][8];\nint SEG[27][12];\nint POS[9][3] = {{0,1,2},{9,10,11},{18,19,20},{3,4,5},{12,13,14},{21,22,23},{6,7,8},{15,16,17},{24,25,26}};\nint four_line[27][6][4];\ndouble min_dist[SIZE];\nbool EXIST[27],check[144];\nchar input_str[9][4];\nPoint3D start,goal;\nData first_D[27][8];\nData data[64];\nSeg first_seg[27][12];\nSeg seg[144];\nLOC loc[27]; //相対位置計算用\nvector<Edge> G[SIZE];\nPoint3D POINT[SIZE];\nvector<Info> info;\nvector<int> LINE[144];\n\n\n\ndouble calc_dist(Point3D A,Point3D B){\n\n\tdouble a = A.x-B.x;\n\tdouble b = A.y-B.y;\n\tdouble c = A.z-B.z;\n\n\treturn sqrt(a*a+b*b+c*c);\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tG[i].clear();\n\t}\n\tfor(int i = 0; i < num_seg; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\tfor(int row = 0; row < 9; row++){\n\t\tscanf(\"%s\",input_str[row]);\n\t}\n\n\t//キューブの存在チェック\n\tfor(int row = 0; row < 9; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tif(input_str[row][col] == '#'){\n\n\t\t\t\tEXIST[POS[row][col]] = true;\n\n\t\t\t}else{\n\n\t\t\t\tEXIST[POS[row][col]] = false;\n\t\t\t}\n\t\t}\n\t}\n\n\tS = -1;\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tif(start.X == POINT[i].X && start.Y == POINT[i].Y && start.Z == POINT[i].Z){\n\n\t\t\tS = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tT = -1;\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tif(goal.X == POINT[i].X && goal.Y == POINT[i].Y && goal.Z == POINT[i].Z){\n\n\t\t\tT = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\n\t//面の有効チェック&エッジ張り\n\tfor(int i = 0; i <= 26; i++){\n\t\tif(!EXIST[i])continue;\n\t\tfor(int k = 0; k < 6; k++){\n\t\t\tif(ADJ[i][k] == -1 || !EXIST[ADJ[i][k]]){\n\t\t\t\tfor(int a = 0; a < 4; a++){\n\t\t\t\t\tint from = four_line[i][k][a]; //辺のindex\n\n\t\t\t\t\t//辺自身のエッジ張り\n\t\t\t\t\tif(!check[from]){\n\t\t\t\t\t\tcheck[from] = true;\n\t\t\t\t\t\tfor(int b = 1; b < LINE[from].size(); b++){\n\n\t\t\t\t\t\t\tdouble tmp_dist = calc_dist(POINT[LINE[from][b-1]],POINT[LINE[from][b]]);\n\n\t\t\t\t\t\t\tG[LINE[from][b-1]].push_back(Edge(LINE[from][b],tmp_dist));\n\t\t\t\t\t\t\tG[LINE[from][b]].push_back(Edge(LINE[from][b-1],tmp_dist));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t//他の辺とのエッジ張り\n\t\t\t\t\tfor(int b = a+1; b < 4; b++){\n\t\t\t\t\t\tint to = four_line[i][k][b];\n\t\t\t\t\t\tfor(int c = 0; c < LINE[from].size(); c++){\n\t\t\t\t\t\t\tfor(int d = 0; d < LINE[to].size(); d++){\n\n\t\t\t\t\t\t\t\tint A = LINE[from][c];\n\t\t\t\t\t\t\t\tint B = LINE[to][d];\n\t\t\t\t\t\t\t\tif(A == B)continue;\n\n\t\t\t\t\t\t\t\tdouble tmp_dist = calc_dist(POINT[A],POINT[B]);\n\n\t\t\t\t\t\t\t\tG[A].push_back(Edge(B,tmp_dist));\n\t\t\t\t\t\t\t\tG[B].push_back(Edge(A,tmp_dist));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tmin_dist[i] = BIG_NUM;\n\t}\n\n\tpriority_queue<State> Q;\n\tmin_dist[S] = 0;\n\n\tQ.push(State(S,0));\n\n\tint next_node;\n\tdouble next_dist;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\n\n\t\t\tQ.pop();\n\t\t}else if(Q.top().node_id == T){\n\n\t\t\tprintf(\"%.10lf\\n\",Q.top().sum_dist);\n\t\t\treturn;\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\n\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\tnext_dist = Q.top().sum_dist+G[Q.top().node_id][i].dist;\n\n\t\t\t\tif(min_dist[next_node] > next_dist+EPS){\n\t\t\t\t\tmin_dist[next_node] = next_dist;\n\t\t\t\t\tQ.push(State(next_node,next_dist));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n}\n\nbool rangeCheck(int value){\n\n\treturn value >= 0 && value <= 2;\n}\n\nvoid calc_ADJ(){\n\n\tnum_loc = 0;\n\n\tfor(int Y = 0; Y <= 2; Y++){\n\t\tfor(int Z = 0; Z <= 2; Z++){\n\t\t\tfor(int X = 0; X <= 2; X++){\n\n\t\t\t\tloc[num_loc].set(X,Y,Z);\n\t\t\t\tnum_loc++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k < 6; k++){\n\n\t\t\tint adj_X = loc[i].X+loc_X[k];\n\t\t\tint adj_Y = loc[i].Y+loc_Y[k];\n\t\t\tint adj_Z = loc[i].Z+loc_Z[k];\n\n\t\t\tif(adj_X >= 0 && adj_X <= 2 && adj_Y >= 0 &&\n\t\t\t\t\tadj_Y <= 2 && adj_Z >= 0 && adj_Z <= 2){\n\n\t\t\t\tfor(int a = 0; a <= 26; a++){\n\t\t\t\t\tif(adj_X == loc[a].X && adj_Y == loc[a].Y && adj_Z == loc[a].Z){\n\t\t\t\t\t\tADJ[i][k] = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tADJ[i][k] = -1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid calc_PL(){\n\n\t//まずは線分の両端の8点列挙\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k <= 7; k++){\n\t\t\tint X = loc[i].X+D_X[k];\n\t\t\tint Y = loc[i].Y+D_Y[k];\n\t\t\tint Z = loc[i].Z+D_Z[k];\n\n\t\t\tfirst_D[i][k].set(X,Y,Z);\n\t\t}\n\t}\n\n\t//indexに変換する\n\tnum_data = 0;\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k <= 7; k++){\n\n\t\t\tint X = first_D[i][k].X;\n\t\t\tint Y = first_D[i][k].Y;\n\t\t\tint Z = first_D[i][k].Z;\n\n\t\t\tbool FLG = false;\n\t\t\tfor(int a = 0; a < num_data; a++){\n\t\t\t\tif(X == data[a].X && Y == data[a].Y && Z == data[a].Z){\n\t\t\t\t\tD[i][k] = a;\n\t\t\t\t\tFLG = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!FLG){\n\t\t\t\tD[i][k] = num_data;\n\t\t\t\tdata[num_data].set(X,Y,Z);\n\t\t\t\tnum_data++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_data; i++){\n\n\t\tdata[i].copy();\n\t}\n\n\tnum_POINT = 0;\n\tfor(int i = 0; i < num_data; i++){\n\t\tPOINT[i].X = data[i].X;\n\t\tPOINT[i].Y = data[i].Y;\n\t\tPOINT[i].Z = data[i].Z;\n\t\tPOINT[i].copy();\n\t\tnum_POINT++;\n\t}\n\n\t//6面の4辺を列挙する\n\tnum_seg = 0;\n\tint tmp_index;\n\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k < 6; k++){ //面\n\t\t\tfor(int p = 0; p < 4; p++){\n\t\t\t\tint from = D[i][L_array[have_L[k][p]][0]];\n\t\t\t\tint to = D[i][L_array[have_L[k][p]][1]];\n\n\t\t\t\tif(from > to){\n\n\t\t\t\t\tswap(from,to);\n\t\t\t\t}\n\t\t\t\ttmp_index = -1;\n\t\t\t\tfor(int a = 0; a < num_seg; a++){\n\t\t\t\t\tif(seg[a].A == from && seg[a].B == to){\n\n\t\t\t\t\t\ttmp_index = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(tmp_index == -1){\n\n\t\t\t\t\ttmp_index = num_seg;\n\t\t\t\t\tseg[num_seg].A = from;\n\t\t\t\t\tseg[num_seg].B = to;\n\t\t\t\t\tnum_seg++;\n\t\t\t\t}\n\t\t\t\tfour_line[i][k][p] = tmp_index;\n\t\t\t}\n\t\t}\n\t}\n\n\t//辺上の点を計算\n\tfor(int i = 0; i < num_seg; i++){\n\t\tinfo.clear();\n\t\tinfo.push_back(Info(POINT[seg[i].A],seg[i].A));\n\t\tinfo.push_back(Info(POINT[seg[i].B],seg[i].B));\n\t\tsort(info.begin(),info.end());\n\t\tPoint3D p_L = info[0].p,p_R = info[1].p;\n\t\tfor(int ALL = 2; ALL <= 9; ALL++){\n\t\t\tfor(int left = 1; left <= ALL-1; left++){\n\t\t\t\tint right = ALL-left;\n\t\t\t\tPoint3D tmp_p = (p_R*(double)(left)+p_L*(double)(right))/(double)ALL;\n\n\t\t\t\tint tmp_id = -1;\n\t\t\t\tfor(int a = 0; a < num_POINT; a++){\n\n\t\t\t\t\tif(POINT[a] == tmp_p){\n\n\t\t\t\t\t\ttmp_id = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(tmp_id == -1){\n\t\t\t\t\ttmp_id = num_POINT;\n\t\t\t\t\tPOINT[num_POINT] = tmp_p;\n\t\t\t\t\tPOINT[num_POINT].X = -1;\n\t\t\t\t\tnum_POINT++;\n\t\t\t\t}\n\t\t\t\tinfo.push_back(Info(tmp_p,tmp_id));\n\t\t\t}\n\t\t}\n\t\tsort(info.begin(),info.end());\n\t\tinfo.erase(unique(info.begin(),info.end()),info.end());\n\n\t\tfor(int a = 0; a < info.size(); a++){\n\n\t\t\tLINE[i].push_back(info[a].index);\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tcalc_ADJ();\n\tcalc_PL();\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d %d %d %d\",&start.X,&start.Y,&start.Z,&goal.X,&goal.Y,&goal.Z);\n\t\tif(start.X == 0 && start.Y == 0 && start.Z == 0 && goal.X == 0 && goal.Y == 0 && goal.Z == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":2130,"memory_kb":25656,"score_of_the_acc":-1,"final_rank":2},{"submission_id":"aoj_1334_4876379","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 10005\n\nenum DIR{\n\tUP,\n\tEast,\n\tNorth,\n\tWest,\n\tSouth,\n\tDown,\n};\n\n\nstruct LOC{\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\tvoid debug(){\n\n\t\tprintf(\"X:%d Y:%d Z:%d\\n\",X,Y,Z);\n\t}\n\tint X,Y,Z;\n};\n\n\nstruct Point3D{\n\tPoint3D(double arg_x,double arg_y,double arg_z){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tz = arg_z;\n\t\tX = Y = Z = 0;\n\t}\n\n\tPoint3D(){\n\t\tx = y = z = 0.0;\n\t\tX = Y = Z = 0;\n\t}\n\n\tPoint3D operator + (Point3D p){ return Point3D(x+p.x,y+p.y,z+p.z); }\n\tPoint3D operator - (Point3D p){ return Point3D(x-p.x,y-p.y,z-p.z);}\n\tPoint3D operator * (double a){ return Point3D(a*x,a*y,a*z); }\n\tPoint3D operator / (double a){ return Point3D(x/a,y/a,z/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y + z*z; }\n\n\tbool operator<(const Point3D &p) const{\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else if(fabs(y-p.y) > EPS){\n\n\t\t\treturn y < p.y;\n\t\t}else{\n\n\t\t\treturn z < p.z;\n\t\t}\n\t}\n\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\n\tvoid copy(){\n\t\tx = X;\n\t\ty = Y;\n\t\tz = Z;\n\t}\n\n\tbool operator == (const Point3D &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS && fabs(z-p.z) < EPS;\n\t}\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf,%.3lf)\\n\",x,y,z);\n\t}\n\tint X,Y,Z;\n\tdouble x,y,z;\n};\n\ntypedef Point3D Vector3D;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point3D a,Point3D b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint3D p[2];\n};\n\nstruct Data{\n\tData(){\n\n\t\tX = Y = Z = 0;\n\t\tx = y = z = 0;\n\t}\n\tData(double arg_x,double arg_y,double arg_z){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tz = arg_z;\n\t\tX = Y = Z = 0;\n\t}\n\n\tvoid set(int arg_X,int arg_Y,int arg_Z){\n\t\tX = arg_X;\n\t\tY = arg_Y;\n\t\tZ = arg_Z;\n\t}\n\tvoid copy(){\n\t\tx = X;\n\t\ty = Y;\n\t\tz = Z;\n\t}\n\tvoid debug(){\n\n\t\tprintf(\"%d %d %d\\n\",X,Y,Z);\n\t}\n\tint X,Y,Z;\n\tdouble x,y,z;\n};\n\nstruct Seg{\n\tvoid set(int arg_A,int arg_B){\n\t\tA = arg_A;\n\t\tB = arg_B;\n\t}\n\tint A,B;\n};\n\nstruct Edge{\n\tEdge(int arg_to,double arg_dist){\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t}\n\tint to;\n\tdouble dist;\n};\n\nstruct Info{\n\tInfo(){\n\t\tindex = 0;\n\t}\n\tInfo(Point3D arg_p,int arg_index){\n\t\tp = arg_p;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Info &arg)const{\n\n\t\treturn p < arg.p;\n\t}\n\tbool operator==(const struct Info &arg) const{\n\n\t\treturn p == arg.p;\n\t}\n\tPoint3D p;\n\tint index;\n};\n\nstruct State{\n\tState(int arg_node_id,double arg_sum_dist){\n\t\tnode_id = arg_node_id;\n\t\tsum_dist = arg_sum_dist;\n\t}\n\tbool operator<(const struct State &arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\n\t}\n\tint node_id;\n\tdouble sum_dist;\n};\n\nint num_loc,num_data,num_POINT,num_seg;\nint S,T;\nint ADJ[27][6];\nint loc_X[6] = {0,1,0,-1,0,0},loc_Y[6] = {-1,0,0,0,0,1},loc_Z[6] = {0,0,1,0,-1,0};\nint D_X[8] = {0,1,0,1,0,1,0,1},D_Y[8] = {0,0,0,0,1,1,1,1},D_Z[8] = {0,0,1,1,0,0,1,1};\nint have_L[6][4] ={{0,1,2,3},{1,5,9,10},{2,6,10,11},{3,7,8,11},{0,4,8,9},{4,5,6,7}};\nint L_array[12][2] = {{0,1},{1,3},{2,3},{0,2},{4,5},{5,7},{6,7},{4,6},{0,4},{1,5},{3,7},{2,6}};\nint D[27][8];\nint SEG[27][12];\nint REV[3][3][3];\nint POS[9][3] = {{0,1,2},{9,10,11},{18,19,20},{3,4,5},{12,13,14},{21,22,23},{6,7,8},{15,16,17},{24,25,26}};\nint four_line[27][6][4];\ndouble min_dist[SIZE];\nbool EXIST[27],check[144];\nchar input_str[9][4];\nPoint3D start,goal;\nData first_D[27][8];\nData data[64];\nSeg first_seg[27][12];\nSeg seg[144];\nLOC loc[27]; //相対位置計算用\nvector<Edge> G[SIZE];\nPoint3D POINT[SIZE];\nvector<Info> info;\nvector<int> LINE[144];\n\n\n\n\n\n\nint gcd(int x,int y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\ndouble calc_dist(Point3D A,Point3D B){\n\n\tdouble a = A.x-B.x;\n\tdouble b = A.y-B.y;\n\tdouble c = A.z-B.z;\n\n\treturn sqrt(a*a+b*b+c*c);\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tG[i].clear();\n\t}\n\tfor(int i = 0; i < num_seg; i++){\n\n\t\tcheck[i] = false;\n\t}\n\n\n\n\tfor(int row = 0; row < 9; row++){\n\t\tscanf(\"%s\",input_str[row]);\n\t}\n\n\t//キューブの存在チェック\n\tfor(int row = 0; row < 9; row++){\n\t\tfor(int col = 0; col < 3; col++){\n\t\t\tif(input_str[row][col] == '#'){\n\n\t\t\t\tEXIST[POS[row][col]] = true;\n\n\t\t\t}else{\n\n\t\t\t\tEXIST[POS[row][col]] = false;\n\t\t\t}\n\t\t}\n\t}\n\n\tS = -1;\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tif(start.X == POINT[i].X && start.Y == POINT[i].Y && start.Z == POINT[i].Z){\n\n\t\t\tS = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tT = -1;\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tif(goal.X == POINT[i].X && goal.Y == POINT[i].Y && goal.Z == POINT[i].Z){\n\n\t\t\tT = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\n\t//面の有効チェック&エッジ張り\n\tfor(int i = 0; i <= 26; i++){\n\t\tif(!EXIST[i])continue;\n\t\tfor(int k = 0; k < 6; k++){\n\t\t\tif(ADJ[i][k] == -1 || !EXIST[ADJ[i][k]]){\n\t\t\t\tfor(int a = 0; a < 4; a++){\n\t\t\t\t\tint from = four_line[i][k][a]; //辺のindex\n\n\t\t\t\t\t//辺自身のエッジ張り\n\t\t\t\t\tif(!check[from]){\n\t\t\t\t\t\tcheck[from] = true;\n\t\t\t\t\t\tfor(int b = 1; b < LINE[from].size(); b++){\n\n\t\t\t\t\t\t\tdouble tmp_dist = calc_dist(POINT[LINE[from][b-1]],POINT[LINE[from][b]]);\n\n\t\t\t\t\t\t\tG[LINE[from][b-1]].push_back(Edge(LINE[from][b],tmp_dist));\n\t\t\t\t\t\t\tG[LINE[from][b]].push_back(Edge(LINE[from][b-1],tmp_dist));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t//他の辺とのエッジ張り\n\t\t\t\t\tfor(int b = a+1; b < 4; b++){\n\t\t\t\t\t\tint to = four_line[i][k][b];\n\t\t\t\t\t\tfor(int c = 0; c < LINE[from].size(); c++){\n\t\t\t\t\t\t\tfor(int d = 0; d < LINE[to].size(); d++){\n\n\t\t\t\t\t\t\t\tint A = LINE[from][c];\n\t\t\t\t\t\t\t\tint B = LINE[to][d];\n\t\t\t\t\t\t\t\tif(A == B)continue;\n\n\t\t\t\t\t\t\t\tdouble tmp_dist = calc_dist(POINT[A],POINT[B]);\n\n\t\t\t\t\t\t\t\tG[A].push_back(Edge(B,tmp_dist));\n\t\t\t\t\t\t\t\tG[B].push_back(Edge(A,tmp_dist));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n/*\n\tprintf(\"S:%d T:%d\\n\",S,T);\n\treturn;*/\n\n\tfor(int i = 0; i < num_POINT; i++){\n\n\t\tmin_dist[i] = BIG_NUM;\n\t}\n\n\tpriority_queue<State> Q;\n\tmin_dist[S] = 0;\n\n\tQ.push(State(S,0));\n\n\tint next_node;\n\tdouble next_dist;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\n\n\t\t\tQ.pop();\n\t\t}else if(Q.top().node_id == T){\n\n\t\t\tprintf(\"%.10lf\\n\",Q.top().sum_dist);\n\t\t\treturn;\n\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\n\n\t\t\t\tnext_node = G[Q.top().node_id][i].to;\n\t\t\t\tnext_dist = Q.top().sum_dist+G[Q.top().node_id][i].dist;\n\n\t\t\t\tif(min_dist[next_node] > next_dist+EPS){\n\t\t\t\t\tmin_dist[next_node] = next_dist;\n\t\t\t\t\tQ.push(State(next_node,next_dist));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\tprintf(\"-1\\n\");\n}\n\nbool rangeCheck(int value){\n\n\treturn value >= 0 && value <= 2;\n}\n\n//tmp_pを含むcubeのインデックスを取得\nint get_index(Point3D tmp_p){\n\n\tint X = (int)(floor(tmp_p.x));\n\tint Y = (int)(floor(tmp_p.y));\n\tint Z = (int)(floor(tmp_p.z));\n\n\t//printf(\"tmp_p.z:%.3lf Z:%d\\n\",tmp_p.z,Z);\n\n\tif(rangeCheck(X)&&rangeCheck(Y)&&rangeCheck(Z)){\n\n\t\treturn REV[X][Y][Z];\n\n\t}else{\n\n\t\treturn -1;\n\t}\n}\n\n\n\nvoid calc_ADJ(){\n\n\tnum_loc = 0;\n\n\tfor(int Y = 0; Y <= 2; Y++){\n\t\tfor(int Z = 0; Z <= 2; Z++){\n\t\t\tfor(int X = 0; X <= 2; X++){\n\n\t\t\t\tloc[num_loc].set(X,Y,Z);\n\t\t\t\tREV[X][Y][Z] = num_loc; //★★左上手前の点の逆引き表★★\n\t\t\t\tnum_loc++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k < 6; k++){\n\n\t\t\tint adj_X = loc[i].X+loc_X[k];\n\t\t\tint adj_Y = loc[i].Y+loc_Y[k];\n\t\t\tint adj_Z = loc[i].Z+loc_Z[k];\n\n\t\t\tif(adj_X >= 0 && adj_X <= 2 && adj_Y >= 0 &&\n\t\t\t\t\tadj_Y <= 2 && adj_Z >= 0 && adj_Z <= 2){\n\n\t\t\t\tfor(int a = 0; a <= 26; a++){\n\t\t\t\t\tif(adj_X == loc[a].X && adj_Y == loc[a].Y && adj_Z == loc[a].Z){\n\t\t\t\t\t\tADJ[i][k] = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}else{\n\n\t\t\t\tADJ[i][k] = -1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid calc_PL(){\n\n\t//まずは線分の両端の8点列挙\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k <= 7; k++){\n\t\t\tint X = loc[i].X+D_X[k];\n\t\t\tint Y = loc[i].Y+D_Y[k];\n\t\t\tint Z = loc[i].Z+D_Z[k];\n\n\t\t\tfirst_D[i][k].set(X,Y,Z);\n\t\t}\n\t}\n\n\t//indexに変換する\n\tnum_data = 0;\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k <= 7; k++){\n\n\t\t\tint X = first_D[i][k].X;\n\t\t\tint Y = first_D[i][k].Y;\n\t\t\tint Z = first_D[i][k].Z;\n\n\t\t\tbool FLG = false;\n\t\t\tfor(int a = 0; a < num_data; a++){\n\t\t\t\tif(X == data[a].X && Y == data[a].Y && Z == data[a].Z){\n\t\t\t\t\tD[i][k] = a;\n\t\t\t\t\tFLG = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!FLG){\n\t\t\t\tD[i][k] = num_data;\n\t\t\t\tdata[num_data].set(X,Y,Z);\n\t\t\t\tnum_data++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_data; i++){\n\n\t\tdata[i].copy();\n\t}\n\n\tnum_POINT = 0;\n\tfor(int i = 0; i < num_data; i++){\n\t\tPOINT[i].X = data[i].X;\n\t\tPOINT[i].Y = data[i].Y;\n\t\tPOINT[i].Z = data[i].Z;\n\t\tPOINT[i].copy();\n\t\tnum_POINT++;\n\t}\n\n\t//6面の4辺を列挙する\n\tnum_seg = 0;\n\tint tmp_index;\n\n\tfor(int i = 0; i <= 26; i++){\n\t\tfor(int k = 0; k < 6; k++){ //面\n\t\t\tfor(int p = 0; p < 4; p++){\n\t\t\t\tint from = D[i][L_array[have_L[k][p]][0]];\n\t\t\t\tint to = D[i][L_array[have_L[k][p]][1]];\n\n\t\t\t\tif(from > to){\n\n\t\t\t\t\tswap(from,to);\n\t\t\t\t}\n\t\t\t\ttmp_index = -1;\n\t\t\t\tfor(int a = 0; a < num_seg; a++){\n\t\t\t\t\tif(seg[a].A == from && seg[a].B == to){\n\n\t\t\t\t\t\ttmp_index = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(tmp_index == -1){\n\n\t\t\t\t\ttmp_index = num_seg;\n\t\t\t\t\tseg[num_seg].A = from;\n\t\t\t\t\tseg[num_seg].B = to;\n\t\t\t\t\tnum_seg++;\n\t\t\t\t}\n\t\t\t\tfour_line[i][k][p] = tmp_index;\n\t\t\t}\n\t\t}\n\t}\n\n\t//辺上の点を計算\n\tfor(int i = 0; i < num_seg; i++){\n\t\tinfo.clear();\n\t\tinfo.push_back(Info(POINT[seg[i].A],seg[i].A));\n\t\tinfo.push_back(Info(POINT[seg[i].B],seg[i].B));\n\t\tsort(info.begin(),info.end());\n\t\tPoint3D p_L = info[0].p,p_R = info[1].p;\n\t\tfor(int ALL = 2; ALL <= 9; ALL++){\n\t\t\tfor(int left = 1; left <= ALL-1; left++){\n\t\t\t\tint right = ALL-left;\n\t\t\t\tPoint3D tmp_p = (p_R*(double)(left)+p_L*(double)(right))/(double)ALL;\n\n\t\t\t\tint tmp_id = -1;\n\t\t\t\tfor(int a = 0; a < num_POINT; a++){\n\n\t\t\t\t\tif(POINT[a] == tmp_p){\n\n\t\t\t\t\t\ttmp_id = a;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(tmp_id == -1){\n\t\t\t\t\ttmp_id = num_POINT;\n\t\t\t\t\tPOINT[num_POINT] = tmp_p;\n\t\t\t\t\tPOINT[num_POINT].X = -1;\n\t\t\t\t\tnum_POINT++;\n\t\t\t\t}\n\t\t\t\tinfo.push_back(Info(tmp_p,tmp_id));\n\t\t\t}\n\t\t}\n\t\tsort(info.begin(),info.end());\n\t\tinfo.erase(unique(info.begin(),info.end()),info.end());\n\n\t\tfor(int a = 0; a < info.size(); a++){\n\n\t\t\tLINE[i].push_back(info[a].index);\n\t\t}\n\t}\n}\n\n\nint main(){\n\n\tcalc_ADJ();\n\tcalc_PL();\n\n\twhile(true){\n\n\t\tscanf(\"%d %d %d %d %d %d\",&start.X,&start.Y,&start.Z,&goal.X,&goal.Y,&goal.Z);\n\t\tif(start.X == 0 && start.Y == 0 && start.Z == 0 && goal.X == 0 && goal.Y == 0 && goal.Z == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":2160,"memory_kb":25572,"score_of_the_acc":-1.0032,"final_rank":3},{"submission_id":"aoj_1334_1630190","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<math.h>\nusing namespace std;\nchar in[3][3][4];\nint DIV=7;\nint gcd(int a,int b){\n\twhile(a){\n\t\tb%=a;int c=a;a=b;b=c;\n\t}return b;\n}\nconst double EPS = 1e-10;\nconst double INF = 1e+10;\nconst double PI = acos(-1);\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\ninline double ABS(double a){return max(a,-a);}\nstruct Pt {\n\tdouble x, y,z;\n\tPt() {}\n\tPt(double x, double y,double z) : x(x), y(y),z(z) {}\n\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y,z+a.z); }\n\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y,z-a.z); }\n//\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\n\tPt operator-() const { return Pt(-x, -y,-z); }\n\tPt operator*(const double &k) const { return Pt(x * k, y * k,z*k); }\n\tPt operator/(const double &k) const { return Pt(x / k, y / k,z/k); }\n\tdouble ABS() const { return sqrt(x * x + y * y+z*z); }\n\tdouble abs2() const { return x * x + y * y+z*z; }\n//\tdouble arg() const { return atan2(y, x); }\n\tdouble dot(const Pt &a) const { return x * a.x + y * a.y+z*a.z; }\n//\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\n};\ndouble ijk[110000];\nint v[110000];\nint can[4][4][4];\nint canx[4][4][4];\nint cany[4][4][4];\nint canz[4][4][4];\nint canxy[4][4][4];\nint canyz[4][4][4];\nint canzx[4][4][4];\nint rev[110000];\nchar ss[4];\nint main(){\n\tint a,b,c,d,e,f;\n\twhile(scanf(\"%d%d%d%d%d%d\",&a,&b,&c,&d,&e,&f),a+b+c+d+e+f){\n\t\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++){\n\t\t\tscanf(\"%s\",ss);\n\t\t\tfor(int k=0;k<3;k++)in[k][j][i]=ss[k];\n\t\t}\n\t\tvector<Pt> hb;\n\t\tfor(int i=0;i<4;i++)for(int j=0;j<4;j++)for(int k=0;k<4;k++){\n\t\t\tcan[i][j][k]=canx[i][j][k]=cany[i][j][k]=canz[i][j][k]=0;\n\t\t\tcanxy[i][j][k]=canyz[i][j][k]=canzx[i][j][k]=0;\n\t\t}\n\t\tfor(int i=0;i<4;i++)for(int j=0;j<4;j++)for(int k=0;k<4;k++){\n\t\t\tif(i==0||i==3||j==0||j==3||k==0||k==3)can[i][j][k]=2;\n\t\t\tif(j==0||j==3||k==0||k==3)canx[i][j][k]=2;\n\t\t\tif(i==0||i==3||k==0||k==3)cany[i][j][k]=2;\n\t\t\tif(i==0||i==3||j==0||j==3)canz[i][j][k]=2;\n\t\t\tif(k==0||k==3)canxy[i][j][k]=2;\n\t\t\tif(i==0||i==3)canyz[i][j][k]=2;\n\t\t\tif(j==0||j==3)canzx[i][j][k]=2;\n\t\t}\n\t\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)for(int k=0;k<3;k++){\n\t\t\tint key=0;\n\t\t\tif(in[i][j][k]=='#'){\n\t\t\t\tkey=1;\n\t\t\t}else{\n\t\t\t\tkey=2;\n\t\t\t}\n\t\t\tfor(int l=0;l<8;l++){\n\t\t\t\tcan[i+l/4][j+l%4/2][k+l%2]|=key;\n\t\t\t}\n\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\tcanx[i][j+l/2][k+l%2]|=key;\n\t\t\t\tcany[i+l/2][j][k+l%2]|=key;\n\t\t\t\tcanz[i+l/2][j+l%2][k]|=key;\n\t\t\t}\n\t\t\tfor(int l=0;l<2;l++){\n\t\t\t\tcanxy[i][j][k+l%2]|=key;\n\t\t\t\tcanyz[i+l%2][j][k]|=key;\n\t\t\t\tcanzx[i][j+l%2][k]|=key;\n\t\t\t}\n\t\t}\n\t\t/*for(int i=0;i<4;i++){\n\t\t\tfor(int j=0;j<4;j++){\n\t\t\t\tfor(int k=0;k<4;k++)printf(\"%d \",can[k][j][i]);\n\t\t\t\tprintf(\"\\n\");\n\t\t\t}\n\t\t\tprintf(\"\\n\");\n\t\t}*/\n\t\tfor(int i=0;i<=3;i++){\n\t\t\tfor(int j=0;j<=3;j++){\n\t\t\t\tfor(int k=0;k<=3;k++){\n\t\t\t\t\tif(can[i][j][k]==3)hb.push_back(Pt((double)i,(double)j,(double)k));\n\t\t\t\t}\n\t\t\t\tfor(int k=0;k<3;k++){\n\t\t\t\t\tfor(int l=2;l<=DIV;l++){\n\t\t\t\t\t\tfor(int m=1;m<l;m++){\n\t\t\t\t\t\t\tif(gcd(m,l)!=1)continue;\n\t\t\t\t\t\t\tif(canz[i][j][k]==3)hb.push_back(Pt((double)i,(double)j,k+(double)m/l));\n\t\t\t\t\t\t\tif(cany[i][k][j]==3)hb.push_back(Pt((double)i,k+(double)m/l,(double)j));\n\t\t\t\t\t\t\tif(canx[k][i][j]==3)hb.push_back(Pt(k+(double)m/l,(double)i,(double)j));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint sz=hb.size();\n\t\tfor(int i=0;i<sz;i++){\n\t\t\tv[i]=0;\n\t\t\tijk[i]=99999999;\n\t\t}\n\t\tPt start=Pt(a,b,c);\n\t\tPt goal=Pt(d,e,f);\n\t\tfor(int i=0;i<sz;i++){\n\t\t\tif((hb[i]-start).ABS()<EPS){\n\t\t\t\tijk[i]=0;\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<sz;i++){\n\t\t\tint at=0;\n\t\t\tdouble dist=999999999;\n\t\t\tfor(int j=0;j<sz;j++){\n\t\t\t\tif(!v[j]&&dist>ijk[j]){\n\t\t\t\t\tdist=ijk[j];at=j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tv[at]=1;\n\t\t//\tprintf(\"%f %f %f: %f\\n\",hb[at].x,hb[at].y,hb[at].z,ijk[at]);\n\t\t\tif((hb[at]-goal).ABS()<EPS){\n\t\t\t\tprintf(\"%.12f\\n\",dist);\n\t\t\t\tint cur=at;\n\t\t\t\t//while((hb[cur]-start).ABS()>EPS){\n\t\t\t\t//\tcur=rev[cur];\n\t\t\t\t//\tprintf(\"%f %f %f: %f\\n\",hb[cur].x,hb[cur].y,hb[cur].z,ijk[cur]);\n\t\t\t\t//}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int j=0;j<sz;j++){\n\t\t\t\tif(v[j])continue;\n\t\t\t\tbool X=false;\n\t\t\t\tbool Y=false;\n\t\t\t\tbool Z=false;\n\t\t\t\tint xx=(int)(min(hb[j].x,hb[at].x)+EPS);\n\t\t\t\tint yy=(int)(min(hb[j].y,hb[at].y)+EPS);\n\t\t\t\tint zz=(int)(min(hb[j].z,hb[at].z)+EPS);\n\t\t\t\tif(ABS(hb[j].x-hb[at].x)<EPS&&ABS(hb[j].x-xx)<EPS)X=true;\n\t\t\t\tif(ABS(hb[j].y-hb[at].y)<EPS&&ABS(hb[j].y-yy)<EPS)Y=true;\n\t\t\t\tif(ABS(hb[j].z-hb[at].z)<EPS&&ABS(hb[j].z-zz)<EPS)Z=true;\n\t\t\t\tif(!X&&!Y&&!Z)continue;\n\t\t\t\tif(!X&&(int)(min(hb[j].x+1,hb[at].x+1)+EPS)!=(int)(max(hb[at].x+1,hb[j].x+1)-EPS))continue;\n\t\t\t\tif(!Y&&(int)(min(hb[j].y+1,hb[at].y+1)+EPS)!=(int)(max(hb[at].y+1,hb[j].y+1)-EPS))continue;\n\t\t\t\tif(!Z&&(int)(min(hb[j].z+1,hb[at].z+1)+EPS)!=(int)(max(hb[at].z+1,hb[j].z+1)-EPS))continue;\n\t\t\t\tbool can=false;\n\t\t\t\tbool Xs=false;\n\t\t\t\tbool Ys=false;\n\t\t\t\tbool Zs=false;\n\t\t\t\tif(ABS(hb[j].x-(int)(hb[j].x+EPS))<EPS)Xs=true;\n\t\t\t\tif(ABS(hb[j].y-(int)(hb[j].y+EPS))<EPS)Ys=true;\n\t\t\t\tif(ABS(hb[j].z-(int)(hb[j].z+EPS))<EPS)Zs=true;\n\t\t\t\tif(X&&canyz[xx][yy][zz]==3)can=true;\n\t\t\t\tif(Y&&canzx[xx][yy][zz]==3)can=true;\n\t\t\t\tif(Z&&canxy[xx][yy][zz]==3)can=true;\n\t\t\t\tif(X&&Y&&Xs&&Ys&&canz[xx][yy][zz]==3)can=true;\n\t\t\t\tif(Z&&Y&&Zs&&Ys&&canx[xx][yy][zz]==3)can=true;\n\t\t\t\tif(X&&Z&&Xs&&Zs&&cany[xx][yy][zz]==3)can=true;\n\t\t\t\tif(can){\n\t\t\t\t\tdouble tmp=(hb[j]-hb[at]).ABS();\n\t\t\t\t\tif(ijk[j]>tmp+ijk[at]){\n\t\t\t\t\t\tijk[j]=tmp+ijk[at];\n\t\t\t\t\t\trev[j]=at;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","accuracy":1,"time_ms":5610,"memory_kb":1252,"score_of_the_acc":-0.7716,"final_rank":1},{"submission_id":"aoj_1334_1522128","code_snippet":"#include <stdio.h>\n#include <math.h>\n#include <vector>\n#include <queue>\n#include <utility>\n#include <algorithm>\nusing namespace std;\n\nstruct point{\n int x, y, z;\n point(int x_, int y_, int z_) : x(x_), y(y_), z(z_) {}\n bool operator< (const point& rhs) const {\n return false;\n }\n};\n\nconst int dv = 18;\nconst int sd = 420;\n\nint b[5][5][5];\nint dvs[dv + 1] = {0, 60, 70, 84, 105, 120, 140, 168, 180, 210, 240, 252, 280, 300, 315, 336, 350, 360};\nint rot[dv * 4 + 1][2];\n\nint xtov[dv * 3 + 1];\n\nvector<point> ed[dv * 3 + 1][dv * 3 + 1][dv * 3 + 1];\npriority_queue< pair<double, point> > pq;\nbool vis[dv * 3 + 1][dv * 3 + 1][dv * 3 + 1];\n\ndouble dist(int xa, int ya, int za, int xb, int yb, int zb){\n int dx = xa - xb, dy = ya - yb, dz = za - zb;\n double d = sqrt(dx * dx + dy * dy + dz * dz);\n return d;\n}\n\nint main(){\n int i, j, k;\n for(i = 0; i <= dv * 3 + 1; i++){\n if(i < dv) xtov[i] = dvs[i];\n else xtov[i] = xtov[i - dv] + sd;\n }\n for(i = 0; i < dv; i++){\n rot[i][0] = i;\n rot[i][1] = 0;\n rot[dv + i][0] = dv;\n rot[dv + i][1] = i;\n rot[2 * dv + i][0] = dv - i;\n rot[2 * dv + i][1] = dv;\n rot[3 * dv + i][0] = 0;\n rot[3 * dv + i][1] = dv - i;\n }\n\n for(;;){\n int x1, y1, z1;\n int x2, y2, z2;\n scanf(\"%d%d%d\", &x1, &y1, &z1);\n scanf(\"%d%d%d\", &x2, &y2, &z2);\n if(x1 == 0 && y1 == 0 && z1 == 0\n && x2 == 0 && y2 == 0 && z2 == 0) break;\n\n for(i = 0; i <= 3 * dv; i++){\n for(j = 0; j <= 3 * dv; j++){\n for(k = 0; k <= 3 * dv; k++){\n ed[i][j][k].clear();\n vis[i][j][k] = false;\n }\n }\n }\n while(!pq.empty()) pq.pop();\n\n char tmp[5];\n for(i = 0; i < 3; i++){\n for(j = 0; j < 3; j++){\n scanf(\"%s\", tmp);\n for(k = 0; k < 3; k++){\n b[k][j][i] = (tmp[k] == '#');\n }\n }\n }\n\n for(i = 0; i <= 3; i++){\n for(j = 0; j <= 3; j++){\n for(k = 0; k <= 3; k++){\n // (i, j, k) (i + 1, j, k) (i, j + 1, k) (i + 1, j + 1, k)\n // square (i, j, k - 1), (i, j, k)\n if(i < 3 && j < 3 && (k == 0 ? 0 : b[i][j][k - 1]) + b[i][j][k] == 1){\n for(int l0 = 0; l0 < 4 * dv; l0++){\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\n // (i * dv + rot[l][0], j * dv + rot[l][1], k * dv)\n int nx0 = i * dv + rot[l0][0], ny0 = j * dv + rot[l0][1], nz0 = k * dv;\n int nx1 = i * dv + rot[l1][0], ny1 = j * dv + rot[l1][1], nz1 = k * dv;\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\n }\n }\n }\n // (i, j, k) (i + 1, j, k) (i, j, k + 1) (i + 1, j, k + 1)\n // square (i, j - 1, k), (i, j, k)\n if(i < 3 && k < 3 && (j == 0 ? 0 : b[i][j - 1][k]) + b[i][j][k] == 1){\n for(int l0 = 0; l0 < 4 * dv; l0++){\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\n // (i * dv + rot[l][0], j * dv, k * dv + rot[l][1])\n int nx0 = i * dv + rot[l0][0], ny0 = j * dv, nz0 = k * dv + rot[l0][1];\n int nx1 = i * dv + rot[l1][0], ny1 = j * dv, nz1 = k * dv + rot[l1][1];\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\n }\n }\n }\n // (i, j, k) (i, j + 1, k) (i, j, k + 1) (i, j + 1, k + 1)\n // square (i - 1, j, k), (i, j, k)\n if(j < 3 && k < 3 && (i == 0 ? 0 : b[i - 1][j][k]) + b[i][j][k] == 1){\n for(int l0 = 0; l0 < 4 * dv; l0++){\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\n // (i * dv, j * dv + rot[l][0], k * dv + rot[l][1])\n int nx0 = i * dv, ny0 = j * dv + rot[l0][0], nz0 = k * dv + rot[l0][1];\n int nx1 = i * dv, ny1 = j * dv + rot[l1][0], nz1 = k * dv + rot[l1][1];\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\n }\n }\n }\n }\n }\n }\n\n pq.push(make_pair(0.0, point(x1 * dv, y1 * dv, z1 * dv)));\n double ans = 0.0;\n\n while(!pq.empty()){\n double nd = pq.top().first;\n int nx = pq.top().second.x, ny = pq.top().second.y, nz = pq.top().second.z;\n pq.pop();\n\n if(vis[nx][ny][nz]) continue;\n vis[nx][ny][nz] = true;\n\n if(nx == x2 * dv && ny == y2 * dv && nz == z2 * dv){\n ans = nd;\n break;\n }\n\n for(point pp : ed[nx][ny][nz]){\n if(!vis[pp.x][pp.y][pp.z]){\n pq.push(make_pair(nd - dist(xtov[nx], xtov[ny], xtov[nz], xtov[pp.x], xtov[pp.y], xtov[pp.z]), pp));\n }\n }\n }\n printf(\"%.20lf\\n\", -ans / sd);\n }\n return 0;\n}","accuracy":1,"time_ms":4280,"memory_kb":16128,"score_of_the_acc":-1.0863,"final_rank":4},{"submission_id":"aoj_1334_1245989","code_snippet":"#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<queue>\n#include<cassert>\n#include<utility>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef double Real;\ntypedef pair<int,int> P;\n\nconst Real eps=1e-7;\nconst Real inf=1e9;\n\ntemplate<class T> bool eq(T a,T b){\n\treturn abs(a-b)<eps;\n}\ntemplate<class T> int sgn(T a){\n\tif(eq(a,0.0)) return 0;\n\tif(a>0) return 1;\n\treturn -1;\n}\n\n//vector<Real> vals;\nReal vals[140];\nint vals_id=0;\n//vector<int> valid_vnum;\nint valid_vnum[7000];\nint valid_vnum_id=0;\n\nint rev_valid_vnum[140*140*140];\n\nint encode(Real x,Real y,Real z){\n//\tint xid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),x-eps));\n//\tint yid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),y-eps));\n//\tint zid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),z-eps));\n\tint xid=lower_bound(vals,vals+vals_id,x-eps)-vals;\n\tint yid=lower_bound(vals,vals+vals_id,y-eps)-vals;\n\tint zid=lower_bound(vals,vals+vals_id,z-eps)-vals;\n//\tint v=xid + vals.size()*yid + vals.size()*vals.size()*zid;\n\tint v=xid + vals_id*yid + vals_id*vals_id*zid;\n//\tint res = distance(valid_vnum.begin(),lower_bound(valid_vnum.begin(),valid_vnum.end(),v));\n//\tint res = lower_bound(valid_vnum,valid_vnum+valid_vnum_id,v)-valid_vnum;\n\tint res = rev_valid_vnum[v];\n\treturn res;\n}\n\nconst int V = 10000;// 140*140*140;\n\nint head[V],to[500500],nxt[500500],m;\nReal cost[500500];\nvoid init_edge(){\n\tfor(int i=0;i<V;i++) head[i]=-1;\n\tm=0;\n}\nvoid add_edge(int u,int v,Real c){\n\tnxt[m]=head[u];to[m]=v;cost[m]=c;head[u]=m;m++;\n\tnxt[m]=head[v];to[m]=u;cost[m]=c;head[v]=m;m++;\n\tif(m>500000) assert(0);\n}\n\n//vector<Real> as,bs,cs,ds;\nReal as[2200],bs[2200],cs[2200],ds[2200];\nint aid=0;\ntypedef pair<Real,Real> PR;\nint gcd(int x,int y){\n\tif(x<y) return gcd(y,x);\n\tif(y==0) return x;\n\treturn gcd(y,x%y);\n}\n\nPR tmp[30];\n\nvoid genEdges(){\n\tfor(int i=1;i<=12;i++) for(int j=1;j<=12;j++){\n\t\tif(gcd(i,j)!=1) continue;\n\t//\tvector<PR> tmp;\n\t\tint tmp_id=0;\n\t\tfor(int k=1;k<i;k++){\n\t\t\tReal y=(Real)k*j/i;\n\t\t//\ttmp.push_back(PR(k,y));\n\t\t\ttmp[tmp_id++]=PR(k,y);\n\t\t}\n\t\tfor(int k=1;k<j;k++){\n\t\t\tReal x=(Real)i*k/j;\n\t\t//\ttmp.push_back(PR(x,k));\n\t\t\ttmp[tmp_id++]=PR(x,k);\n\t\t}\n\t\t//tmp.push_back(PR(0,0));\n\t\t//tmp.push_back(PR(i,j));\n\t\ttmp[tmp_id++]=PR(0,0);\n\t\ttmp[tmp_id++]=PR(i,j);\n//\t\tsort(tmp.begin(),tmp.end());\n\t\tsort(tmp,tmp+tmp_id);\n/*\t\tif(i == 3 && j == 4){\n\t\t\tfor(int k = 0; k < tmp.size(); k++){\n\t\t\t\tprintf(\"%f %f\\n\",tmp[k].first,tmp[k].second);\n\t\t\t}\n//\t\t\texit(0);\n\t\t}*/\n\t//\tfor(int k=0;k+1<tmp.size();k++){\n\t\tfor(int k=0;k+1<tmp_id;k++){\n\t\t\tReal a_=tmp[k].first;\n\t\t\tReal a=a_-(int)(a_+eps);\n\t\t\tReal b_=tmp[k].second;\n\t\t\tReal b=b_-(int)(b_+eps);\n\t\t\tReal c_=tmp[k+1].first;\n\t\t\tReal c=c_-(int)(c_-eps);\n\t\t\tReal d_=tmp[k+1].second;\n\t\t\tReal d=d_-(int)(d_-eps);\n\t\t/*\tas.push_back(a);\n\t\t\tbs.push_back(b);\n\t\t\tcs.push_back(c);\n\t\t\tds.push_back(d);\n\t\t\tas.push_back(1-a);\n\t\t\tbs.push_back(b);\n\t\t\tcs.push_back(1-c);\n\t\t\tds.push_back(d);*/\n\t\t\tas[aid]=a;\n\t\t\tbs[aid]=b;\n\t\t\tcs[aid]=c;\n\t\t\tds[aid]=d;\n\t\t\taid++;\n\t\t\tas[aid]=1-a;\n\t\t\tbs[aid]=b;\n\t\t\tcs[aid]=1-c;\n\t\t\tds[aid]=d;\n\t\t\taid++;\n//\t\t\tif(i == 3 && j == 4){\n//\t\t\t\tprintf(\"%f %f %f %f\\n\", a,b,c,d);\n//\t\t\t}\n\t\t}\n\t}\n/*\tfor(int i=0;i<as.size();i++){\n\t\tprintf(\"%.2f %.2f %.2f %.2f\\n\",as[i],bs[i],cs[i],ds[i]);\n\t}\n\texit(0);*/\n}\nReal getDis(Real a,Real b,Real c,Real p,Real q,Real r){\n\tReal d1=a-p,d2=b-q,d3=c-r;\n\treturn sqrt(d1*d1+d2*d2+d3*d3);\n}\n\nbool exi[5][5][5];\nvoid genGraph(){\n//\tint cntOut=0;\n/*\tfor(int i=0;i<140*140*140;i++){\n\t\tG[i].clear();\n\t}*/\n\tinit_edge();\n\tfor(int x=1;x<=4;x++){\n\t\tfor(int y=1;y<=3;y++) for(int z=1;z<=3;z++){\n\t\t\tint cnt=0;\n\t\t\tif(exi[x-1][y][z]) cnt++;\n\t\t\tif(exi[x][y][z]) cnt++;\n\t\t\tif(cnt!=1) continue;\n\t\t//\tfor(int i=0;i<as.size();i++){\n\t\t\tfor(int i=0;i<aid;i++){\n\t\t\t\tReal x1=x,y1_=y+as[i],z1=z+bs[i];\n\t\t\t\tReal x2=x,y2_=y+cs[i],z2=z+ds[i];\n\t\t\t\tint u=encode(x1,y1_,z1);\n\t\t\t\tint v=encode(x2,y2_,z2);\n\t\t\t\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\n\t\t\t\tadd_edge(u,v,d);\n\t\t//\t\tG[u].push_back(edge(v,d));\n\t\t//\t\tG[v].push_back(edge(u,d));\n\t\t//\t\tif(++cntOut<=20){\n\t\t\t\t\t//printf(\"%d %d\\n\",u,v);\n//\t\t\t\t\tprintf(\"%.2f %.2f %.2f %.2f %.2f %.2f\\n\",\n//\t\t\t\t\tx1,y1_,z1,x2,y2_,z2);\n\t\t//\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int y=1;y<=4;y++){\n\t\tfor(int x=1;x<=3;x++) for(int z=1;z<=3;z++){\n\t\t\tint cnt=0;\n\t\t\tif(exi[x][y-1][z]) cnt++;\n\t\t\tif(exi[x][y][z]) cnt++;\n\t\t\tif(cnt!=1) continue;\n\t\t//\tfor(int i=0;i<as.size();i++){\n\t\t\tfor(int i=0;i<aid;i++){\n\t\t\t\tReal x1=x+as[i],y1_=y,z1=z+bs[i];\n\t\t\t\tReal x2=x+cs[i],y2_=y,z2=z+ds[i];\n\t\t\t\tint u=encode(x1,y1_,z1);\n\t\t\t\tint v=encode(x2,y2_,z2);\n\t\t\t\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\n\t\t\t\tadd_edge(u,v,d);\n\t\t\t//\tG[u].push_back(edge(v,d));\n\t\t\t//\tG[v].push_back(edge(u,d));\n\t\t\t}\n\t\t}\n\t}\n\tfor(int z=1;z<=4;z++){\n\t\tfor(int x=1;x<=3;x++) for(int y=1;y<=3;y++){\n\t\t\tint cnt=0;\n\t\t\tif(exi[x][y][z]) cnt++;\n\t\t\tif(exi[x][y][z-1]) cnt++;\n\t\t\tif(cnt!=1) continue;\n\t\t//\tfor(int i=0;i<as.size();i++){\n\t\t\tfor(int i=0;i<aid;i++){\n\t\t\t\tReal x1=x+as[i],y1_=y+bs[i],z1=z;\n\t\t\t\tReal x2=x+cs[i],y2_=y+ds[i],z2=z;\n\t\t\t\tint u=encode(x1,y1_,z1);\n\t\t\t\tint v=encode(x2,y2_,z2);\n\t\t\t\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\n\t\t\t\tadd_edge(u,v,d);\n\t\t\t//\tG[u].push_back(edge(v,d));\n\t\t\t//\tG[v].push_back(edge(u,d));\n\t\t\t}\n\t\t}\n\t}\n\t//TODO: add edges coincide with cubes' edges\n\tfor(int y=1;y<=4;y++) for(int z=1;z<=4;z++){\n\t\tfor(int x=1;x<=3;x++){\n\t\t\tint cnt=0;\n\t\t\tfor(int y_=y-1;y_<=y;y_++) for(int z_=z-1;z_<=z;z_++){\n\t\t\t\tif(exi[x][y_][z_]) cnt++;\n\t\t\t}\n\t\t\tif(cnt==0||cnt==4) continue;\n\t\t\tint u=encode(x,y,z);\n\t\t\tint v=encode(x+1,y,z);\n\t\t\tadd_edge(u,v,1);\n\t\t//\tG[u].push_back(edge(v,1));\n\t\t//\tG[v].push_back(edge(u,1));\n\t\t}\n\t}\n\tfor(int z=1;z<=4;z++) for(int x=1;x<=4;x++){\n\t\tfor(int y=1;y<=3;y++){\n\t\t\tint cnt=0;\n\t\t\tfor(int z_=z-1;z_<=z;z_++) for(int x_=x-1;x_<=x;x_++){\n\t\t\t\tif(exi[x_][y][z_]) cnt++;\n\t\t\t}\n\t\t\tif(cnt==0||cnt==4) continue;\n\t\t\tint u=encode(x,y,z);\n\t\t\tint v=encode(x,y+1,z);\n\t\t\tadd_edge(u,v,1);\n\t\t//\tG[u].push_back(edge(v,1));\n\t\t//\tG[v].push_back(edge(u,1));\n\t\t}\n\t}\n\tfor(int x=1;x<=4;x++) for(int y=1;y<=4;y++){\n\t\tfor(int z=1;z<=3;z++){\n\t\t\tint cnt=0;\n\t\t\tfor(int x_=x-1;x_<=x;x_++) for(int y_=y-1;y_<=y;y_++){\n\t\t\t\tif(exi[x_][y_][z]) cnt++;\n\t\t\t}\n\t\t\tif(cnt==0||cnt==4) continue;\n\t\t\tint u=encode(x,y,z);\n\t\t\tint v=encode(x,y,z+1);\n\t\t\tadd_edge(u,v,1);\n\t\t//\tG[u].push_back(edge(v,1));\n\t\t//\tG[v].push_back(edge(u,1));\n\t\t}\n\t}\n}\n\nbool checkInt(int id){\n\tReal x=vals[id];\n\tint x_=(int)(x+eps);\n\treturn eq(x,(Real)x_);\n}\nvoid init(){\n\tfor(int i=2;i<=12;i++){\n\t\tfor(int j=1;j<i;j++){\n\t\t\tif(gcd(i,j)!=1) continue;\n\t\t\tReal x=(Real)j/i;\n\t\t\tfor(int k=1;k<=3;k++){\n\t\t//\t\tvals.push_back(x+k);\n\t\t\t\tvals[vals_id++]=x+k;\n\t\t\t}\n\t\t}\n\t}\n//\tfor(int k=1;k<=4;k++) vals.push_back(k);\n\tfor(int k=1;k<=4;k++) vals[vals_id++]=k;\n//\tsort(vals.begin(),vals.end());\n\tsort(vals,vals+vals_id);\n\tgenEdges();\n//\tfor(int i=0;i<vals.size();i++) for(int j=0;j<vals.size();j++) for(int k=0;k<vals.size();k++){\n\tfor(int i=0;i<vals_id;i++) for(int j=0;j<vals_id;j++) for(int k=0;k<vals_id;k++){\n\t\tint cnt=0;\n\t\tif(checkInt(i)) cnt++;\n\t\tif(checkInt(j)) cnt++;\n\t\tif(checkInt(k)) cnt++;\n\t\tif(cnt<2) continue;\n//\t\tvalid_vnum.push_back(i+vals.size()*j+vals.size()*vals.size()*k);\n//\t\tvalid_vnum.push_back(i+vals_id*j+vals_id*vals_id*k);\n\t\tvalid_vnum[valid_vnum_id++]=i+vals_id*j+vals_id*vals_id*k;\n\t}\n\tfor(int i=0;i<valid_vnum_id;i++){\n\t\trev_valid_vnum[valid_vnum[i]]=i;\n\t}\n//\tprintf(\"%d\\n\",valid_vnum.size());\n//\tsort(valid_vnum.begin(),valid_vnum.end());\n//\tsort(valid_vnum,valid_vnum+valid_vnum_id);\n}\n\nReal dis[V];\n\ntypedef pair<Real,int> State;\npriority_queue<State,vector<State>,greater<State> > que;\n\nReal solve(int x1,int y1,int z1,int x2,int y2,int z2){\n//\tprintf(\"%d %d %d %d %d %d\\n\",x1,y1,z1,x2,y2,z2);\n\tint u=encode(x1,y1,z1);\n\tint v=encode(x2,y2,z2);\n\tgenGraph();\n//\tprintf(\"u=%d,v=%d\\n\",u,v);\n//\tint V=140*140*140;\n\tfor(int i=0;i<V;i++){\n\t\tdis[i]=inf;\n\t}\n\tdis[u]=0;\n\tque.push(State(0,u));\n\twhile(!que.empty()){\n\t\tState state = que.top();\n\t\tque.pop();\n\t\tReal cd = state.first;\n\t\tint cv = state.second;\n//\t\tprintf(\"cv=%d\\n\",cv);\n\t\tif(sgn(dis[cv]-cd)>0) continue;\n//\t\tfor(int i=0;i<G[cv].size();i++){\n\t\tfor(int e=head[cv];e!=-1;e=nxt[e]){\n\t\t//\tint nv = G[cv][i].to;\n\t\t\tint nv=to[e];\n\t\t//\tReal nd = cd + G[cv][i].cost;\n\t\t\tReal nd=cd+cost[e];\n\t\t\tif(sgn(dis[nv]-nd)<=0) continue;\n\t\t\tdis[nv]=nd;\n\t\t\tque.push(State(nd,nv));\n\t\t}\n\t}\n\treturn dis[v];\n}\n\nint x1,y1_,z1,x2,y2_,z2;\n\nvoid input(){\n\tscanf(\"%d%d%d%d%d%d\",&x1,&y1_,&z1,&x2,&y2_,&z2);\n\tif(x1==0&&y1_==0&&z1==0&&x2==0&&y2_==0&&z2==0) exit(0);\n\tx1++;y1_++;z1++;x2++;y2_++;z2++;\n\tfor(int i=1;i<=3;i++) for(int j=1;j<=3;j++) for(int k=1;k<=3;k++){\n\t\texi[i][j][k]=false;\n\t}\n\tfor(int z=1;z<=3;z++) for(int y=1;y<=3;y++){\n\t\tchar ch[10];\n\t\tscanf(\"%s\",ch+1);\n\t\tfor(int x=1;x<=3;x++){\n\t\t\texi[x][y][z]=ch[x]=='#';\n\t\t}\n\t}\n}\n\nint main(){\n\tinit();\n//\tprintf(\"%d %d\\n\",vals.size(),as.size());\n//\tint t = 0;\n//\tprintf(\"as.size()=%d\\n\",as.size());\n//\tprintf(\"valid_vnum.size()=%d\\n\",valid_vnum.size());\n//\tprintf(\"vals.size()=%d\\n\",vals.size());\n\twhile(true){\n//\t\tfprintf(stderr,\"%d\\n\",t++);\n\t\tinput();\n\t\tReal ans=solve(x1,y1_,z1,x2,y2_,z2);\n\t\tprintf(\"%f\\n\",ans);\n//\t\tint s = encode(1,1,1);\n//\t\tint t = encode(4,4,4);\n//\t\tint mid = encode(1.5,1,2);\n//\t\tprintf(\"[%d] = %f\\n\",s,dis[s]);\n//\t\tprintf(\"[%d] = %f\\n\",t,dis[t]);\n//\t\tprintf(\"[%d] = %f\\n\",mid,dis[mid]);\n/*\t\tint cnt = 0;\n\t\tfor(int i = 0; i < 140*140*140;i++){\n\t\t\tif(dis[i] < 1e9){\n\t\t\t\tif(++cnt<=10){\n\t\t\t\t\tdecodeAndPrint(i);\n\t\t\t\t\tprintf(\"%d->%f\\n\",i,dis[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\texit(0);*/\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6640,"memory_kb":19988,"score_of_the_acc":-1.7677,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_1334_4876386\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 10005\\n\\nenum DIR{\\n\\tUP,\\n\\tEast,\\n\\tNorth,\\n\\tWest,\\n\\tSouth,\\n\\tDown,\\n};\\n\\n\\nstruct LOC{\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\t/*void debug(){\\n\\n\\t\\tprintf(\\\"X:%d Y:%d Z:%d\\\\n\\\",X,Y,Z);\\n\\t}*/\\n\\tint X,Y,Z;\\n};\\n\\n\\nstruct Point3D{\\n\\tPoint3D(double arg_x,double arg_y,double arg_z){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t\\tz = arg_z;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tPoint3D(){\\n\\t\\tx = y = z = 0.0;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tPoint3D operator + (Point3D p){ return Point3D(x+p.x,y+p.y,z+p.z); }\\n\\tPoint3D operator - (Point3D p){ return Point3D(x-p.x,y-p.y,z-p.z);}\\n\\tPoint3D operator * (double a){ return Point3D(a*x,a*y,a*z); }\\n\\tPoint3D operator / (double a){ return Point3D(x/a,y/a,z/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y + z*z; }\\n\\n\\tbool operator<(const Point3D &p) const{\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else if(fabs(y-p.y) > EPS){\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn z < p.z;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\n\\tvoid copy(){\\n\\t\\tx = X;\\n\\t\\ty = Y;\\n\\t\\tz = Z;\\n\\t}\\n\\n\\tbool operator == (const Point3D &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS && fabs(z-p.z) < EPS;\\n\\t}\\n\\t/*void debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf,%.3lf)\\\\n\\\",x,y,z);\\n\\t}*/\\n\\tint X,Y,Z;\\n\\tdouble x,y,z;\\n};\\n\\ntypedef Point3D Vector3D;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point3D a,Point3D b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint3D p[2];\\n};\\n\\nstruct Data{\\n\\tData(){\\n\\n\\t\\tX = Y = Z = 0;\\n\\t\\tx = y = z = 0;\\n\\t}\\n\\tData(double arg_x,double arg_y,double arg_z){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t\\tz = arg_z;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\tvoid copy(){\\n\\t\\tx = X;\\n\\t\\ty = Y;\\n\\t\\tz = Z;\\n\\t}\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"%d %d %d\\\\n\\\",X,Y,Z);\\n\\t}\\n\\tint X,Y,Z;\\n\\tdouble x,y,z;\\n};\\n\\nstruct Seg{\\n\\tvoid set(int arg_A,int arg_B){\\n\\t\\tA = arg_A;\\n\\t\\tB = arg_B;\\n\\t}\\n\\tint A,B;\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,double arg_dist){\\n\\t\\tto = arg_to;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tint to;\\n\\tdouble dist;\\n};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\tindex = 0;\\n\\t}\\n\\tInfo(Point3D arg_p,int arg_index){\\n\\t\\tp = arg_p;\\n\\t\\tindex = arg_index;\\n\\t}\\n\\tbool operator<(const struct Info &arg)const{\\n\\n\\t\\treturn p < arg.p;\\n\\t}\\n\\tbool operator==(const struct Info &arg) const{\\n\\n\\t\\treturn p == arg.p;\\n\\t}\\n\\tPoint3D p;\\n\\tint index;\\n};\\n\\nstruct State{\\n\\tState(int arg_node_id,double arg_sum_dist){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\\n\\t}\\n\\tint node_id;\\n\\tdouble sum_dist;\\n};\\n\\nint num_loc,num_data,num_POINT,num_seg;\\nint S,T;\\nint ADJ[27][6];\\nint loc_X[6] = {0,1,0,-1,0,0},loc_Y[6] = {-1,0,0,0,0,1},loc_Z[6] = {0,0,1,0,-1,0};\\nint D_X[8] = {0,1,0,1,0,1,0,1},D_Y[8] = {0,0,0,0,1,1,1,1},D_Z[8] = {0,0,1,1,0,0,1,1};\\nint have_L[6][4] ={{0,1,2,3},{1,5,9,10},{2,6,10,11},{3,7,8,11},{0,4,8,9},{4,5,6,7}};\\nint L_array[12][2] = {{0,1},{1,3},{2,3},{0,2},{4,5},{5,7},{6,7},{4,6},{0,4},{1,5},{3,7},{2,6}};\\nint D[27][8];\\nint SEG[27][12];\\nint POS[9][3] = {{0,1,2},{9,10,11},{18,19,20},{3,4,5},{12,13,14},{21,22,23},{6,7,8},{15,16,17},{24,25,26}};\\nint four_line[27][6][4];\\ndouble min_dist[SIZE];\\nbool EXIST[27],check[144];\\nchar input_str[9][4];\\nPoint3D start,goal;\\nData first_D[27][8];\\nData data[64];\\nSeg first_seg[27][12];\\nSeg seg[144];\\nLOC loc[27]; //相対位置計算用\\nvector<Edge> G[SIZE];\\nPoint3D POINT[SIZE];\\nvector<Info> info;\\nvector<int> LINE[144];\\n\\n\\n\\ndouble calc_dist(Point3D A,Point3D B){\\n\\n\\tdouble a = A.x-B.x;\\n\\tdouble b = A.y-B.y;\\n\\tdouble c = A.z-B.z;\\n\\n\\treturn sqrt(a*a+b*b+c*c);\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tG[i].clear();\\n\\t}\\n\\tfor(int i = 0; i < num_seg; i++){\\n\\n\\t\\tcheck[i] = false;\\n\\t}\\n\\n\\tfor(int row = 0; row < 9; row++){\\n\\t\\tscanf(\\\"%s\\\",input_str[row]);\\n\\t}\\n\\n\\t//キューブの存在チェック\\n\\tfor(int row = 0; row < 9; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tif(input_str[row][col] == '#'){\\n\\n\\t\\t\\t\\tEXIST[POS[row][col]] = true;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tEXIST[POS[row][col]] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tS = -1;\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tif(start.X == POINT[i].X && start.Y == POINT[i].Y && start.Z == POINT[i].Z){\\n\\n\\t\\t\\tS = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tT = -1;\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tif(goal.X == POINT[i].X && goal.Y == POINT[i].Y && goal.Z == POINT[i].Z){\\n\\n\\t\\t\\tT = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//面の有効チェック&エッジ張り\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tif(!EXIST[i])continue;\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\t\\t\\tif(ADJ[i][k] == -1 || !EXIST[ADJ[i][k]]){\\n\\t\\t\\t\\tfor(int a = 0; a < 4; a++){\\n\\t\\t\\t\\t\\tint from = four_line[i][k][a]; //辺のindex\\n\\n\\t\\t\\t\\t\\t//辺自身のエッジ張り\\n\\t\\t\\t\\t\\tif(!check[from]){\\n\\t\\t\\t\\t\\t\\tcheck[from] = true;\\n\\t\\t\\t\\t\\t\\tfor(int b = 1; b < LINE[from].size(); b++){\\n\\n\\t\\t\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(POINT[LINE[from][b-1]],POINT[LINE[from][b]]);\\n\\n\\t\\t\\t\\t\\t\\t\\tG[LINE[from][b-1]].push_back(Edge(LINE[from][b],tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\tG[LINE[from][b]].push_back(Edge(LINE[from][b-1],tmp_dist));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//他の辺とのエッジ張り\\n\\t\\t\\t\\t\\tfor(int b = a+1; b < 4; b++){\\n\\t\\t\\t\\t\\t\\tint to = four_line[i][k][b];\\n\\t\\t\\t\\t\\t\\tfor(int c = 0; c < LINE[from].size(); c++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int d = 0; d < LINE[to].size(); d++){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tint A = LINE[from][c];\\n\\t\\t\\t\\t\\t\\t\\t\\tint B = LINE[to][d];\\n\\t\\t\\t\\t\\t\\t\\t\\tif(A == B)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(POINT[A],POINT[B]);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tG[A].push_back(Edge(B,tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\t\\tG[B].push_back(Edge(A,tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tmin_dist[i] = BIG_NUM;\\n\\t}\\n\\n\\tpriority_queue<State> Q;\\n\\tmin_dist[S] = 0;\\n\\n\\tQ.push(State(S,0));\\n\\n\\tint next_node;\\n\\tdouble next_dist;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}else if(Q.top().node_id == T){\\n\\n\\t\\t\\tprintf(\\\"%.10lf\\\\n\\\",Q.top().sum_dist);\\n\\t\\t\\treturn;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_dist = Q.top().sum_dist+G[Q.top().node_id][i].dist;\\n\\n\\t\\t\\t\\tif(min_dist[next_node] > next_dist+EPS){\\n\\t\\t\\t\\t\\tmin_dist[next_node] = next_dist;\\n\\t\\t\\t\\t\\tQ.push(State(next_node,next_dist));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n}\\n\\nbool rangeCheck(int value){\\n\\n\\treturn value >= 0 && value <= 2;\\n}\\n\\nvoid calc_ADJ(){\\n\\n\\tnum_loc = 0;\\n\\n\\tfor(int Y = 0; Y <= 2; Y++){\\n\\t\\tfor(int Z = 0; Z <= 2; Z++){\\n\\t\\t\\tfor(int X = 0; X <= 2; X++){\\n\\n\\t\\t\\t\\tloc[num_loc].set(X,Y,Z);\\n\\t\\t\\t\\tnum_loc++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\n\\t\\t\\tint adj_X = loc[i].X+loc_X[k];\\n\\t\\t\\tint adj_Y = loc[i].Y+loc_Y[k];\\n\\t\\t\\tint adj_Z = loc[i].Z+loc_Z[k];\\n\\n\\t\\t\\tif(adj_X >= 0 && adj_X <= 2 && adj_Y >= 0 &&\\n\\t\\t\\t\\t\\tadj_Y <= 2 && adj_Z >= 0 && adj_Z <= 2){\\n\\n\\t\\t\\t\\tfor(int a = 0; a <= 26; a++){\\n\\t\\t\\t\\t\\tif(adj_X == loc[a].X && adj_Y == loc[a].Y && adj_Z == loc[a].Z){\\n\\t\\t\\t\\t\\t\\tADJ[i][k] = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tADJ[i][k] = -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc_PL(){\\n\\n\\t//まずは線分の両端の8点列挙\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k <= 7; k++){\\n\\t\\t\\tint X = loc[i].X+D_X[k];\\n\\t\\t\\tint Y = loc[i].Y+D_Y[k];\\n\\t\\t\\tint Z = loc[i].Z+D_Z[k];\\n\\n\\t\\t\\tfirst_D[i][k].set(X,Y,Z);\\n\\t\\t}\\n\\t}\\n\\n\\t//indexに変換する\\n\\tnum_data = 0;\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k <= 7; k++){\\n\\n\\t\\t\\tint X = first_D[i][k].X;\\n\\t\\t\\tint Y = first_D[i][k].Y;\\n\\t\\t\\tint Z = first_D[i][k].Z;\\n\\n\\t\\t\\tbool FLG = false;\\n\\t\\t\\tfor(int a = 0; a < num_data; a++){\\n\\t\\t\\t\\tif(X == data[a].X && Y == data[a].Y && Z == data[a].Z){\\n\\t\\t\\t\\t\\tD[i][k] = a;\\n\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!FLG){\\n\\t\\t\\t\\tD[i][k] = num_data;\\n\\t\\t\\t\\tdata[num_data].set(X,Y,Z);\\n\\t\\t\\t\\tnum_data++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_data; i++){\\n\\n\\t\\tdata[i].copy();\\n\\t}\\n\\n\\tnum_POINT = 0;\\n\\tfor(int i = 0; i < num_data; i++){\\n\\t\\tPOINT[i].X = data[i].X;\\n\\t\\tPOINT[i].Y = data[i].Y;\\n\\t\\tPOINT[i].Z = data[i].Z;\\n\\t\\tPOINT[i].copy();\\n\\t\\tnum_POINT++;\\n\\t}\\n\\n\\t//6面の4辺を列挙する\\n\\tnum_seg = 0;\\n\\tint tmp_index;\\n\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k < 6; k++){ //面\\n\\t\\t\\tfor(int p = 0; p < 4; p++){\\n\\t\\t\\t\\tint from = D[i][L_array[have_L[k][p]][0]];\\n\\t\\t\\t\\tint to = D[i][L_array[have_L[k][p]][1]];\\n\\n\\t\\t\\t\\tif(from > to){\\n\\n\\t\\t\\t\\t\\tswap(from,to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttmp_index = -1;\\n\\t\\t\\t\\tfor(int a = 0; a < num_seg; a++){\\n\\t\\t\\t\\t\\tif(seg[a].A == from && seg[a].B == to){\\n\\n\\t\\t\\t\\t\\t\\ttmp_index = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\t\\ttmp_index = num_seg;\\n\\t\\t\\t\\t\\tseg[num_seg].A = from;\\n\\t\\t\\t\\t\\tseg[num_seg].B = to;\\n\\t\\t\\t\\t\\tnum_seg++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfour_line[i][k][p] = tmp_index;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//辺上の点を計算\\n\\tfor(int i = 0; i < num_seg; i++){\\n\\t\\tinfo.clear();\\n\\t\\tinfo.push_back(Info(POINT[seg[i].A],seg[i].A));\\n\\t\\tinfo.push_back(Info(POINT[seg[i].B],seg[i].B));\\n\\t\\tsort(info.begin(),info.end());\\n\\t\\tPoint3D p_L = info[0].p,p_R = info[1].p;\\n\\t\\tfor(int ALL = 2; ALL <= 9; ALL++){\\n\\t\\t\\tfor(int left = 1; left <= ALL-1; left++){\\n\\t\\t\\t\\tint right = ALL-left;\\n\\t\\t\\t\\tPoint3D tmp_p = (p_R*(double)(left)+p_L*(double)(right))/(double)ALL;\\n\\n\\t\\t\\t\\tint tmp_id = -1;\\n\\t\\t\\t\\tfor(int a = 0; a < num_POINT; a++){\\n\\n\\t\\t\\t\\t\\tif(POINT[a] == tmp_p){\\n\\n\\t\\t\\t\\t\\t\\ttmp_id = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(tmp_id == -1){\\n\\t\\t\\t\\t\\ttmp_id = num_POINT;\\n\\t\\t\\t\\t\\tPOINT[num_POINT] = tmp_p;\\n\\t\\t\\t\\t\\tPOINT[num_POINT].X = -1;\\n\\t\\t\\t\\t\\tnum_POINT++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tinfo.push_back(Info(tmp_p,tmp_id));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(info.begin(),info.end());\\n\\t\\tinfo.erase(unique(info.begin(),info.end()),info.end());\\n\\n\\t\\tfor(int a = 0; a < info.size(); a++){\\n\\n\\t\\t\\tLINE[i].push_back(info[a].index);\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tcalc_ADJ();\\n\\tcalc_PL();\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d %d %d %d %d\\\",&start.X,&start.Y,&start.Z,&goal.X,&goal.Y,&goal.Z);\\n\\t\\tif(start.X == 0 && start.Y == 0 && start.Z == 0 && goal.X == 0 && goal.Y == 0 && goal.Z == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2130,\n \"memory_kb\": 25656,\n \"score_of_the_acc\": -1,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1334_4876379\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 10005\\n\\nenum DIR{\\n\\tUP,\\n\\tEast,\\n\\tNorth,\\n\\tWest,\\n\\tSouth,\\n\\tDown,\\n};\\n\\n\\nstruct LOC{\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"X:%d Y:%d Z:%d\\\\n\\\",X,Y,Z);\\n\\t}\\n\\tint X,Y,Z;\\n};\\n\\n\\nstruct Point3D{\\n\\tPoint3D(double arg_x,double arg_y,double arg_z){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t\\tz = arg_z;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tPoint3D(){\\n\\t\\tx = y = z = 0.0;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tPoint3D operator + (Point3D p){ return Point3D(x+p.x,y+p.y,z+p.z); }\\n\\tPoint3D operator - (Point3D p){ return Point3D(x-p.x,y-p.y,z-p.z);}\\n\\tPoint3D operator * (double a){ return Point3D(a*x,a*y,a*z); }\\n\\tPoint3D operator / (double a){ return Point3D(x/a,y/a,z/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y + z*z; }\\n\\n\\tbool operator<(const Point3D &p) const{\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else if(fabs(y-p.y) > EPS){\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn z < p.z;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\n\\tvoid copy(){\\n\\t\\tx = X;\\n\\t\\ty = Y;\\n\\t\\tz = Z;\\n\\t}\\n\\n\\tbool operator == (const Point3D &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS && fabs(z-p.z) < EPS;\\n\\t}\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf,%.3lf)\\\\n\\\",x,y,z);\\n\\t}\\n\\tint X,Y,Z;\\n\\tdouble x,y,z;\\n};\\n\\ntypedef Point3D Vector3D;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point3D a,Point3D b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint3D p[2];\\n};\\n\\nstruct Data{\\n\\tData(){\\n\\n\\t\\tX = Y = Z = 0;\\n\\t\\tx = y = z = 0;\\n\\t}\\n\\tData(double arg_x,double arg_y,double arg_z){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t\\tz = arg_z;\\n\\t\\tX = Y = Z = 0;\\n\\t}\\n\\n\\tvoid set(int arg_X,int arg_Y,int arg_Z){\\n\\t\\tX = arg_X;\\n\\t\\tY = arg_Y;\\n\\t\\tZ = arg_Z;\\n\\t}\\n\\tvoid copy(){\\n\\t\\tx = X;\\n\\t\\ty = Y;\\n\\t\\tz = Z;\\n\\t}\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"%d %d %d\\\\n\\\",X,Y,Z);\\n\\t}\\n\\tint X,Y,Z;\\n\\tdouble x,y,z;\\n};\\n\\nstruct Seg{\\n\\tvoid set(int arg_A,int arg_B){\\n\\t\\tA = arg_A;\\n\\t\\tB = arg_B;\\n\\t}\\n\\tint A,B;\\n};\\n\\nstruct Edge{\\n\\tEdge(int arg_to,double arg_dist){\\n\\t\\tto = arg_to;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tint to;\\n\\tdouble dist;\\n};\\n\\nstruct Info{\\n\\tInfo(){\\n\\t\\tindex = 0;\\n\\t}\\n\\tInfo(Point3D arg_p,int arg_index){\\n\\t\\tp = arg_p;\\n\\t\\tindex = arg_index;\\n\\t}\\n\\tbool operator<(const struct Info &arg)const{\\n\\n\\t\\treturn p < arg.p;\\n\\t}\\n\\tbool operator==(const struct Info &arg) const{\\n\\n\\t\\treturn p == arg.p;\\n\\t}\\n\\tPoint3D p;\\n\\tint index;\\n};\\n\\nstruct State{\\n\\tState(int arg_node_id,double arg_sum_dist){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_dist = arg_sum_dist;\\n\\t}\\n\\tbool operator<(const struct State &arg) const{\\n\\n\\t\\treturn sum_dist > arg.sum_dist; //総距離の昇順(PQ)\\n\\t}\\n\\tint node_id;\\n\\tdouble sum_dist;\\n};\\n\\nint num_loc,num_data,num_POINT,num_seg;\\nint S,T;\\nint ADJ[27][6];\\nint loc_X[6] = {0,1,0,-1,0,0},loc_Y[6] = {-1,0,0,0,0,1},loc_Z[6] = {0,0,1,0,-1,0};\\nint D_X[8] = {0,1,0,1,0,1,0,1},D_Y[8] = {0,0,0,0,1,1,1,1},D_Z[8] = {0,0,1,1,0,0,1,1};\\nint have_L[6][4] ={{0,1,2,3},{1,5,9,10},{2,6,10,11},{3,7,8,11},{0,4,8,9},{4,5,6,7}};\\nint L_array[12][2] = {{0,1},{1,3},{2,3},{0,2},{4,5},{5,7},{6,7},{4,6},{0,4},{1,5},{3,7},{2,6}};\\nint D[27][8];\\nint SEG[27][12];\\nint REV[3][3][3];\\nint POS[9][3] = {{0,1,2},{9,10,11},{18,19,20},{3,4,5},{12,13,14},{21,22,23},{6,7,8},{15,16,17},{24,25,26}};\\nint four_line[27][6][4];\\ndouble min_dist[SIZE];\\nbool EXIST[27],check[144];\\nchar input_str[9][4];\\nPoint3D start,goal;\\nData first_D[27][8];\\nData data[64];\\nSeg first_seg[27][12];\\nSeg seg[144];\\nLOC loc[27]; //相対位置計算用\\nvector<Edge> G[SIZE];\\nPoint3D POINT[SIZE];\\nvector<Info> info;\\nvector<int> LINE[144];\\n\\n\\n\\n\\n\\n\\nint gcd(int x,int y){\\n\\n\\tx = abs(x);\\n\\ty = abs(y);\\n\\n\\tif(x < y){\\n\\t\\tswap(x,y);\\n\\t}\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn gcd(y,x%y);\\n\\t}\\n}\\n\\ndouble calc_dist(Point3D A,Point3D B){\\n\\n\\tdouble a = A.x-B.x;\\n\\tdouble b = A.y-B.y;\\n\\tdouble c = A.z-B.z;\\n\\n\\treturn sqrt(a*a+b*b+c*c);\\n}\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tG[i].clear();\\n\\t}\\n\\tfor(int i = 0; i < num_seg; i++){\\n\\n\\t\\tcheck[i] = false;\\n\\t}\\n\\n\\n\\n\\tfor(int row = 0; row < 9; row++){\\n\\t\\tscanf(\\\"%s\\\",input_str[row]);\\n\\t}\\n\\n\\t//キューブの存在チェック\\n\\tfor(int row = 0; row < 9; row++){\\n\\t\\tfor(int col = 0; col < 3; col++){\\n\\t\\t\\tif(input_str[row][col] == '#'){\\n\\n\\t\\t\\t\\tEXIST[POS[row][col]] = true;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tEXIST[POS[row][col]] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tS = -1;\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tif(start.X == POINT[i].X && start.Y == POINT[i].Y && start.Z == POINT[i].Z){\\n\\n\\t\\t\\tS = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tT = -1;\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tif(goal.X == POINT[i].X && goal.Y == POINT[i].Y && goal.Z == POINT[i].Z){\\n\\n\\t\\t\\tT = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//面の有効チェック&エッジ張り\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tif(!EXIST[i])continue;\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\t\\t\\tif(ADJ[i][k] == -1 || !EXIST[ADJ[i][k]]){\\n\\t\\t\\t\\tfor(int a = 0; a < 4; a++){\\n\\t\\t\\t\\t\\tint from = four_line[i][k][a]; //辺のindex\\n\\n\\t\\t\\t\\t\\t//辺自身のエッジ張り\\n\\t\\t\\t\\t\\tif(!check[from]){\\n\\t\\t\\t\\t\\t\\tcheck[from] = true;\\n\\t\\t\\t\\t\\t\\tfor(int b = 1; b < LINE[from].size(); b++){\\n\\n\\t\\t\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(POINT[LINE[from][b-1]],POINT[LINE[from][b]]);\\n\\n\\t\\t\\t\\t\\t\\t\\tG[LINE[from][b-1]].push_back(Edge(LINE[from][b],tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\tG[LINE[from][b]].push_back(Edge(LINE[from][b-1],tmp_dist));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//他の辺とのエッジ張り\\n\\t\\t\\t\\t\\tfor(int b = a+1; b < 4; b++){\\n\\t\\t\\t\\t\\t\\tint to = four_line[i][k][b];\\n\\t\\t\\t\\t\\t\\tfor(int c = 0; c < LINE[from].size(); c++){\\n\\t\\t\\t\\t\\t\\t\\tfor(int d = 0; d < LINE[to].size(); d++){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tint A = LINE[from][c];\\n\\t\\t\\t\\t\\t\\t\\t\\tint B = LINE[to][d];\\n\\t\\t\\t\\t\\t\\t\\t\\tif(A == B)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble tmp_dist = calc_dist(POINT[A],POINT[B]);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tG[A].push_back(Edge(B,tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\t\\tG[B].push_back(Edge(A,tmp_dist));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n/*\\n\\tprintf(\\\"S:%d T:%d\\\\n\\\",S,T);\\n\\treturn;*/\\n\\n\\tfor(int i = 0; i < num_POINT; i++){\\n\\n\\t\\tmin_dist[i] = BIG_NUM;\\n\\t}\\n\\n\\tpriority_queue<State> Q;\\n\\tmin_dist[S] = 0;\\n\\n\\tQ.push(State(S,0));\\n\\n\\tint next_node;\\n\\tdouble next_dist;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.top().sum_dist > min_dist[Q.top().node_id]+EPS){\\n\\n\\t\\t\\tQ.pop();\\n\\t\\t}else if(Q.top().node_id == T){\\n\\n\\t\\t\\tprintf(\\\"%.10lf\\\\n\\\",Q.top().sum_dist);\\n\\t\\t\\treturn;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int i = 0; i < G[Q.top().node_id].size(); i++){\\n\\n\\t\\t\\t\\tnext_node = G[Q.top().node_id][i].to;\\n\\t\\t\\t\\tnext_dist = Q.top().sum_dist+G[Q.top().node_id][i].dist;\\n\\n\\t\\t\\t\\tif(min_dist[next_node] > next_dist+EPS){\\n\\t\\t\\t\\t\\tmin_dist[next_node] = next_dist;\\n\\t\\t\\t\\t\\tQ.push(State(next_node,next_dist));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"-1\\\\n\\\");\\n}\\n\\nbool rangeCheck(int value){\\n\\n\\treturn value >= 0 && value <= 2;\\n}\\n\\n//tmp_pを含むcubeのインデックスを取得\\nint get_index(Point3D tmp_p){\\n\\n\\tint X = (int)(floor(tmp_p.x));\\n\\tint Y = (int)(floor(tmp_p.y));\\n\\tint Z = (int)(floor(tmp_p.z));\\n\\n\\t//printf(\\\"tmp_p.z:%.3lf Z:%d\\\\n\\\",tmp_p.z,Z);\\n\\n\\tif(rangeCheck(X)&&rangeCheck(Y)&&rangeCheck(Z)){\\n\\n\\t\\treturn REV[X][Y][Z];\\n\\n\\t}else{\\n\\n\\t\\treturn -1;\\n\\t}\\n}\\n\\n\\n\\nvoid calc_ADJ(){\\n\\n\\tnum_loc = 0;\\n\\n\\tfor(int Y = 0; Y <= 2; Y++){\\n\\t\\tfor(int Z = 0; Z <= 2; Z++){\\n\\t\\t\\tfor(int X = 0; X <= 2; X++){\\n\\n\\t\\t\\t\\tloc[num_loc].set(X,Y,Z);\\n\\t\\t\\t\\tREV[X][Y][Z] = num_loc; //★★左上手前の点の逆引き表★★\\n\\t\\t\\t\\tnum_loc++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k < 6; k++){\\n\\n\\t\\t\\tint adj_X = loc[i].X+loc_X[k];\\n\\t\\t\\tint adj_Y = loc[i].Y+loc_Y[k];\\n\\t\\t\\tint adj_Z = loc[i].Z+loc_Z[k];\\n\\n\\t\\t\\tif(adj_X >= 0 && adj_X <= 2 && adj_Y >= 0 &&\\n\\t\\t\\t\\t\\tadj_Y <= 2 && adj_Z >= 0 && adj_Z <= 2){\\n\\n\\t\\t\\t\\tfor(int a = 0; a <= 26; a++){\\n\\t\\t\\t\\t\\tif(adj_X == loc[a].X && adj_Y == loc[a].Y && adj_Z == loc[a].Z){\\n\\t\\t\\t\\t\\t\\tADJ[i][k] = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tADJ[i][k] = -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc_PL(){\\n\\n\\t//まずは線分の両端の8点列挙\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k <= 7; k++){\\n\\t\\t\\tint X = loc[i].X+D_X[k];\\n\\t\\t\\tint Y = loc[i].Y+D_Y[k];\\n\\t\\t\\tint Z = loc[i].Z+D_Z[k];\\n\\n\\t\\t\\tfirst_D[i][k].set(X,Y,Z);\\n\\t\\t}\\n\\t}\\n\\n\\t//indexに変換する\\n\\tnum_data = 0;\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k <= 7; k++){\\n\\n\\t\\t\\tint X = first_D[i][k].X;\\n\\t\\t\\tint Y = first_D[i][k].Y;\\n\\t\\t\\tint Z = first_D[i][k].Z;\\n\\n\\t\\t\\tbool FLG = false;\\n\\t\\t\\tfor(int a = 0; a < num_data; a++){\\n\\t\\t\\t\\tif(X == data[a].X && Y == data[a].Y && Z == data[a].Z){\\n\\t\\t\\t\\t\\tD[i][k] = a;\\n\\t\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!FLG){\\n\\t\\t\\t\\tD[i][k] = num_data;\\n\\t\\t\\t\\tdata[num_data].set(X,Y,Z);\\n\\t\\t\\t\\tnum_data++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_data; i++){\\n\\n\\t\\tdata[i].copy();\\n\\t}\\n\\n\\tnum_POINT = 0;\\n\\tfor(int i = 0; i < num_data; i++){\\n\\t\\tPOINT[i].X = data[i].X;\\n\\t\\tPOINT[i].Y = data[i].Y;\\n\\t\\tPOINT[i].Z = data[i].Z;\\n\\t\\tPOINT[i].copy();\\n\\t\\tnum_POINT++;\\n\\t}\\n\\n\\t//6面の4辺を列挙する\\n\\tnum_seg = 0;\\n\\tint tmp_index;\\n\\n\\tfor(int i = 0; i <= 26; i++){\\n\\t\\tfor(int k = 0; k < 6; k++){ //面\\n\\t\\t\\tfor(int p = 0; p < 4; p++){\\n\\t\\t\\t\\tint from = D[i][L_array[have_L[k][p]][0]];\\n\\t\\t\\t\\tint to = D[i][L_array[have_L[k][p]][1]];\\n\\n\\t\\t\\t\\tif(from > to){\\n\\n\\t\\t\\t\\t\\tswap(from,to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttmp_index = -1;\\n\\t\\t\\t\\tfor(int a = 0; a < num_seg; a++){\\n\\t\\t\\t\\t\\tif(seg[a].A == from && seg[a].B == to){\\n\\n\\t\\t\\t\\t\\t\\ttmp_index = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(tmp_index == -1){\\n\\n\\t\\t\\t\\t\\ttmp_index = num_seg;\\n\\t\\t\\t\\t\\tseg[num_seg].A = from;\\n\\t\\t\\t\\t\\tseg[num_seg].B = to;\\n\\t\\t\\t\\t\\tnum_seg++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfour_line[i][k][p] = tmp_index;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//辺上の点を計算\\n\\tfor(int i = 0; i < num_seg; i++){\\n\\t\\tinfo.clear();\\n\\t\\tinfo.push_back(Info(POINT[seg[i].A],seg[i].A));\\n\\t\\tinfo.push_back(Info(POINT[seg[i].B],seg[i].B));\\n\\t\\tsort(info.begin(),info.end());\\n\\t\\tPoint3D p_L = info[0].p,p_R = info[1].p;\\n\\t\\tfor(int ALL = 2; ALL <= 9; ALL++){\\n\\t\\t\\tfor(int left = 1; left <= ALL-1; left++){\\n\\t\\t\\t\\tint right = ALL-left;\\n\\t\\t\\t\\tPoint3D tmp_p = (p_R*(double)(left)+p_L*(double)(right))/(double)ALL;\\n\\n\\t\\t\\t\\tint tmp_id = -1;\\n\\t\\t\\t\\tfor(int a = 0; a < num_POINT; a++){\\n\\n\\t\\t\\t\\t\\tif(POINT[a] == tmp_p){\\n\\n\\t\\t\\t\\t\\t\\ttmp_id = a;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(tmp_id == -1){\\n\\t\\t\\t\\t\\ttmp_id = num_POINT;\\n\\t\\t\\t\\t\\tPOINT[num_POINT] = tmp_p;\\n\\t\\t\\t\\t\\tPOINT[num_POINT].X = -1;\\n\\t\\t\\t\\t\\tnum_POINT++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tinfo.push_back(Info(tmp_p,tmp_id));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(info.begin(),info.end());\\n\\t\\tinfo.erase(unique(info.begin(),info.end()),info.end());\\n\\n\\t\\tfor(int a = 0; a < info.size(); a++){\\n\\n\\t\\t\\tLINE[i].push_back(info[a].index);\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tcalc_ADJ();\\n\\tcalc_PL();\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d %d %d %d %d\\\",&start.X,&start.Y,&start.Z,&goal.X,&goal.Y,&goal.Z);\\n\\t\\tif(start.X == 0 && start.Y == 0 && start.Z == 0 && goal.X == 0 && goal.Y == 0 && goal.Z == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2160,\n \"memory_kb\": 25572,\n \"score_of_the_acc\": -1.0032,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1334_1630190\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<math.h>\\nusing namespace std;\\nchar in[3][3][4];\\nint DIV=7;\\nint gcd(int a,int b){\\n\\twhile(a){\\n\\t\\tb%=a;int c=a;a=b;b=c;\\n\\t}return b;\\n}\\nconst double EPS = 1e-10;\\nconst double INF = 1e+10;\\nconst double PI = acos(-1);\\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\\ninline double ABS(double a){return max(a,-a);}\\nstruct Pt {\\n\\tdouble x, y,z;\\n\\tPt() {}\\n\\tPt(double x, double y,double z) : x(x), y(y),z(z) {}\\n\\tPt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y,z+a.z); }\\n\\tPt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y,z-a.z); }\\n//\\tPt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }\\n\\tPt operator-() const { return Pt(-x, -y,-z); }\\n\\tPt operator*(const double &k) const { return Pt(x * k, y * k,z*k); }\\n\\tPt operator/(const double &k) const { return Pt(x / k, y / k,z/k); }\\n\\tdouble ABS() const { return sqrt(x * x + y * y+z*z); }\\n\\tdouble abs2() const { return x * x + y * y+z*z; }\\n//\\tdouble arg() const { return atan2(y, x); }\\n\\tdouble dot(const Pt &a) const { return x * a.x + y * a.y+z*a.z; }\\n//\\tdouble det(const Pt &a) const { return x * a.y - y * a.x; }\\n};\\ndouble ijk[110000];\\nint v[110000];\\nint can[4][4][4];\\nint canx[4][4][4];\\nint cany[4][4][4];\\nint canz[4][4][4];\\nint canxy[4][4][4];\\nint canyz[4][4][4];\\nint canzx[4][4][4];\\nint rev[110000];\\nchar ss[4];\\nint main(){\\n\\tint a,b,c,d,e,f;\\n\\twhile(scanf(\\\"%d%d%d%d%d%d\\\",&a,&b,&c,&d,&e,&f),a+b+c+d+e+f){\\n\\t\\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++){\\n\\t\\t\\tscanf(\\\"%s\\\",ss);\\n\\t\\t\\tfor(int k=0;k<3;k++)in[k][j][i]=ss[k];\\n\\t\\t}\\n\\t\\tvector<Pt> hb;\\n\\t\\tfor(int i=0;i<4;i++)for(int j=0;j<4;j++)for(int k=0;k<4;k++){\\n\\t\\t\\tcan[i][j][k]=canx[i][j][k]=cany[i][j][k]=canz[i][j][k]=0;\\n\\t\\t\\tcanxy[i][j][k]=canyz[i][j][k]=canzx[i][j][k]=0;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<4;i++)for(int j=0;j<4;j++)for(int k=0;k<4;k++){\\n\\t\\t\\tif(i==0||i==3||j==0||j==3||k==0||k==3)can[i][j][k]=2;\\n\\t\\t\\tif(j==0||j==3||k==0||k==3)canx[i][j][k]=2;\\n\\t\\t\\tif(i==0||i==3||k==0||k==3)cany[i][j][k]=2;\\n\\t\\t\\tif(i==0||i==3||j==0||j==3)canz[i][j][k]=2;\\n\\t\\t\\tif(k==0||k==3)canxy[i][j][k]=2;\\n\\t\\t\\tif(i==0||i==3)canyz[i][j][k]=2;\\n\\t\\t\\tif(j==0||j==3)canzx[i][j][k]=2;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<3;i++)for(int j=0;j<3;j++)for(int k=0;k<3;k++){\\n\\t\\t\\tint key=0;\\n\\t\\t\\tif(in[i][j][k]=='#'){\\n\\t\\t\\t\\tkey=1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tkey=2;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int l=0;l<8;l++){\\n\\t\\t\\t\\tcan[i+l/4][j+l%4/2][k+l%2]|=key;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int l=0;l<4;l++){\\n\\t\\t\\t\\tcanx[i][j+l/2][k+l%2]|=key;\\n\\t\\t\\t\\tcany[i+l/2][j][k+l%2]|=key;\\n\\t\\t\\t\\tcanz[i+l/2][j+l%2][k]|=key;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int l=0;l<2;l++){\\n\\t\\t\\t\\tcanxy[i][j][k+l%2]|=key;\\n\\t\\t\\t\\tcanyz[i+l%2][j][k]|=key;\\n\\t\\t\\t\\tcanzx[i][j+l%2][k]|=key;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t/*for(int i=0;i<4;i++){\\n\\t\\t\\tfor(int j=0;j<4;j++){\\n\\t\\t\\t\\tfor(int k=0;k<4;k++)printf(\\\"%d \\\",can[k][j][i]);\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}*/\\n\\t\\tfor(int i=0;i<=3;i++){\\n\\t\\t\\tfor(int j=0;j<=3;j++){\\n\\t\\t\\t\\tfor(int k=0;k<=3;k++){\\n\\t\\t\\t\\t\\tif(can[i][j][k]==3)hb.push_back(Pt((double)i,(double)j,(double)k));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int k=0;k<3;k++){\\n\\t\\t\\t\\t\\tfor(int l=2;l<=DIV;l++){\\n\\t\\t\\t\\t\\t\\tfor(int m=1;m<l;m++){\\n\\t\\t\\t\\t\\t\\t\\tif(gcd(m,l)!=1)continue;\\n\\t\\t\\t\\t\\t\\t\\tif(canz[i][j][k]==3)hb.push_back(Pt((double)i,(double)j,k+(double)m/l));\\n\\t\\t\\t\\t\\t\\t\\tif(cany[i][k][j]==3)hb.push_back(Pt((double)i,k+(double)m/l,(double)j));\\n\\t\\t\\t\\t\\t\\t\\tif(canx[k][i][j]==3)hb.push_back(Pt(k+(double)m/l,(double)i,(double)j));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint sz=hb.size();\\n\\t\\tfor(int i=0;i<sz;i++){\\n\\t\\t\\tv[i]=0;\\n\\t\\t\\tijk[i]=99999999;\\n\\t\\t}\\n\\t\\tPt start=Pt(a,b,c);\\n\\t\\tPt goal=Pt(d,e,f);\\n\\t\\tfor(int i=0;i<sz;i++){\\n\\t\\t\\tif((hb[i]-start).ABS()<EPS){\\n\\t\\t\\t\\tijk[i]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<sz;i++){\\n\\t\\t\\tint at=0;\\n\\t\\t\\tdouble dist=999999999;\\n\\t\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\t\\tif(!v[j]&&dist>ijk[j]){\\n\\t\\t\\t\\t\\tdist=ijk[j];at=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tv[at]=1;\\n\\t\\t//\\tprintf(\\\"%f %f %f: %f\\\\n\\\",hb[at].x,hb[at].y,hb[at].z,ijk[at]);\\n\\t\\t\\tif((hb[at]-goal).ABS()<EPS){\\n\\t\\t\\t\\tprintf(\\\"%.12f\\\\n\\\",dist);\\n\\t\\t\\t\\tint cur=at;\\n\\t\\t\\t\\t//while((hb[cur]-start).ABS()>EPS){\\n\\t\\t\\t\\t//\\tcur=rev[cur];\\n\\t\\t\\t\\t//\\tprintf(\\\"%f %f %f: %f\\\\n\\\",hb[cur].x,hb[cur].y,hb[cur].z,ijk[cur]);\\n\\t\\t\\t\\t//}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\t\\tif(v[j])continue;\\n\\t\\t\\t\\tbool X=false;\\n\\t\\t\\t\\tbool Y=false;\\n\\t\\t\\t\\tbool Z=false;\\n\\t\\t\\t\\tint xx=(int)(min(hb[j].x,hb[at].x)+EPS);\\n\\t\\t\\t\\tint yy=(int)(min(hb[j].y,hb[at].y)+EPS);\\n\\t\\t\\t\\tint zz=(int)(min(hb[j].z,hb[at].z)+EPS);\\n\\t\\t\\t\\tif(ABS(hb[j].x-hb[at].x)<EPS&&ABS(hb[j].x-xx)<EPS)X=true;\\n\\t\\t\\t\\tif(ABS(hb[j].y-hb[at].y)<EPS&&ABS(hb[j].y-yy)<EPS)Y=true;\\n\\t\\t\\t\\tif(ABS(hb[j].z-hb[at].z)<EPS&&ABS(hb[j].z-zz)<EPS)Z=true;\\n\\t\\t\\t\\tif(!X&&!Y&&!Z)continue;\\n\\t\\t\\t\\tif(!X&&(int)(min(hb[j].x+1,hb[at].x+1)+EPS)!=(int)(max(hb[at].x+1,hb[j].x+1)-EPS))continue;\\n\\t\\t\\t\\tif(!Y&&(int)(min(hb[j].y+1,hb[at].y+1)+EPS)!=(int)(max(hb[at].y+1,hb[j].y+1)-EPS))continue;\\n\\t\\t\\t\\tif(!Z&&(int)(min(hb[j].z+1,hb[at].z+1)+EPS)!=(int)(max(hb[at].z+1,hb[j].z+1)-EPS))continue;\\n\\t\\t\\t\\tbool can=false;\\n\\t\\t\\t\\tbool Xs=false;\\n\\t\\t\\t\\tbool Ys=false;\\n\\t\\t\\t\\tbool Zs=false;\\n\\t\\t\\t\\tif(ABS(hb[j].x-(int)(hb[j].x+EPS))<EPS)Xs=true;\\n\\t\\t\\t\\tif(ABS(hb[j].y-(int)(hb[j].y+EPS))<EPS)Ys=true;\\n\\t\\t\\t\\tif(ABS(hb[j].z-(int)(hb[j].z+EPS))<EPS)Zs=true;\\n\\t\\t\\t\\tif(X&&canyz[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(Y&&canzx[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(Z&&canxy[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(X&&Y&&Xs&&Ys&&canz[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(Z&&Y&&Zs&&Ys&&canx[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(X&&Z&&Xs&&Zs&&cany[xx][yy][zz]==3)can=true;\\n\\t\\t\\t\\tif(can){\\n\\t\\t\\t\\t\\tdouble tmp=(hb[j]-hb[at]).ABS();\\n\\t\\t\\t\\t\\tif(ijk[j]>tmp+ijk[at]){\\n\\t\\t\\t\\t\\t\\tijk[j]=tmp+ijk[at];\\n\\t\\t\\t\\t\\t\\trev[j]=at;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5610,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.7716,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1334_1522128\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <math.h>\\n#include <vector>\\n#include <queue>\\n#include <utility>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct point{\\n int x, y, z;\\n point(int x_, int y_, int z_) : x(x_), y(y_), z(z_) {}\\n bool operator< (const point& rhs) const {\\n return false;\\n }\\n};\\n\\nconst int dv = 18;\\nconst int sd = 420;\\n\\nint b[5][5][5];\\nint dvs[dv + 1] = {0, 60, 70, 84, 105, 120, 140, 168, 180, 210, 240, 252, 280, 300, 315, 336, 350, 360};\\nint rot[dv * 4 + 1][2];\\n\\nint xtov[dv * 3 + 1];\\n\\nvector<point> ed[dv * 3 + 1][dv * 3 + 1][dv * 3 + 1];\\npriority_queue< pair<double, point> > pq;\\nbool vis[dv * 3 + 1][dv * 3 + 1][dv * 3 + 1];\\n\\ndouble dist(int xa, int ya, int za, int xb, int yb, int zb){\\n int dx = xa - xb, dy = ya - yb, dz = za - zb;\\n double d = sqrt(dx * dx + dy * dy + dz * dz);\\n return d;\\n}\\n\\nint main(){\\n int i, j, k;\\n for(i = 0; i <= dv * 3 + 1; i++){\\n if(i < dv) xtov[i] = dvs[i];\\n else xtov[i] = xtov[i - dv] + sd;\\n }\\n for(i = 0; i < dv; i++){\\n rot[i][0] = i;\\n rot[i][1] = 0;\\n rot[dv + i][0] = dv;\\n rot[dv + i][1] = i;\\n rot[2 * dv + i][0] = dv - i;\\n rot[2 * dv + i][1] = dv;\\n rot[3 * dv + i][0] = 0;\\n rot[3 * dv + i][1] = dv - i;\\n }\\n\\n for(;;){\\n int x1, y1, z1;\\n int x2, y2, z2;\\n scanf(\\\"%d%d%d\\\", &x1, &y1, &z1);\\n scanf(\\\"%d%d%d\\\", &x2, &y2, &z2);\\n if(x1 == 0 && y1 == 0 && z1 == 0\\n && x2 == 0 && y2 == 0 && z2 == 0) break;\\n\\n for(i = 0; i <= 3 * dv; i++){\\n for(j = 0; j <= 3 * dv; j++){\\n for(k = 0; k <= 3 * dv; k++){\\n ed[i][j][k].clear();\\n vis[i][j][k] = false;\\n }\\n }\\n }\\n while(!pq.empty()) pq.pop();\\n\\n char tmp[5];\\n for(i = 0; i < 3; i++){\\n for(j = 0; j < 3; j++){\\n scanf(\\\"%s\\\", tmp);\\n for(k = 0; k < 3; k++){\\n b[k][j][i] = (tmp[k] == '#');\\n }\\n }\\n }\\n\\n for(i = 0; i <= 3; i++){\\n for(j = 0; j <= 3; j++){\\n for(k = 0; k <= 3; k++){\\n // (i, j, k) (i + 1, j, k) (i, j + 1, k) (i + 1, j + 1, k)\\n // square (i, j, k - 1), (i, j, k)\\n if(i < 3 && j < 3 && (k == 0 ? 0 : b[i][j][k - 1]) + b[i][j][k] == 1){\\n for(int l0 = 0; l0 < 4 * dv; l0++){\\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\\n // (i * dv + rot[l][0], j * dv + rot[l][1], k * dv)\\n int nx0 = i * dv + rot[l0][0], ny0 = j * dv + rot[l0][1], nz0 = k * dv;\\n int nx1 = i * dv + rot[l1][0], ny1 = j * dv + rot[l1][1], nz1 = k * dv;\\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\\n }\\n }\\n }\\n // (i, j, k) (i + 1, j, k) (i, j, k + 1) (i + 1, j, k + 1)\\n // square (i, j - 1, k), (i, j, k)\\n if(i < 3 && k < 3 && (j == 0 ? 0 : b[i][j - 1][k]) + b[i][j][k] == 1){\\n for(int l0 = 0; l0 < 4 * dv; l0++){\\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\\n // (i * dv + rot[l][0], j * dv, k * dv + rot[l][1])\\n int nx0 = i * dv + rot[l0][0], ny0 = j * dv, nz0 = k * dv + rot[l0][1];\\n int nx1 = i * dv + rot[l1][0], ny1 = j * dv, nz1 = k * dv + rot[l1][1];\\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\\n }\\n }\\n }\\n // (i, j, k) (i, j + 1, k) (i, j, k + 1) (i, j + 1, k + 1)\\n // square (i - 1, j, k), (i, j, k)\\n if(j < 3 && k < 3 && (i == 0 ? 0 : b[i - 1][j][k]) + b[i][j][k] == 1){\\n for(int l0 = 0; l0 < 4 * dv; l0++){\\n for(int l1 = l0 + 1; l1 < 4 * dv; l1++){\\n // (i * dv, j * dv + rot[l][0], k * dv + rot[l][1])\\n int nx0 = i * dv, ny0 = j * dv + rot[l0][0], nz0 = k * dv + rot[l0][1];\\n int nx1 = i * dv, ny1 = j * dv + rot[l1][0], nz1 = k * dv + rot[l1][1];\\n ed[nx0][ny0][nz0].push_back(point(nx1, ny1, nz1));\\n ed[nx1][ny1][nz1].push_back(point(nx0, ny0, nz0));\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n pq.push(make_pair(0.0, point(x1 * dv, y1 * dv, z1 * dv)));\\n double ans = 0.0;\\n\\n while(!pq.empty()){\\n double nd = pq.top().first;\\n int nx = pq.top().second.x, ny = pq.top().second.y, nz = pq.top().second.z;\\n pq.pop();\\n\\n if(vis[nx][ny][nz]) continue;\\n vis[nx][ny][nz] = true;\\n\\n if(nx == x2 * dv && ny == y2 * dv && nz == z2 * dv){\\n ans = nd;\\n break;\\n }\\n\\n for(point pp : ed[nx][ny][nz]){\\n if(!vis[pp.x][pp.y][pp.z]){\\n pq.push(make_pair(nd - dist(xtov[nx], xtov[ny], xtov[nz], xtov[pp.x], xtov[pp.y], xtov[pp.z]), pp));\\n }\\n }\\n }\\n printf(\\\"%.20lf\\\\n\\\", -ans / sd);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4280,\n \"memory_kb\": 16128,\n \"score_of_the_acc\": -1.0863,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1334_1245989\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<queue>\\n#include<cassert>\\n#include<utility>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\ntypedef double Real;\\ntypedef pair<int,int> P;\\n\\nconst Real eps=1e-7;\\nconst Real inf=1e9;\\n\\ntemplate<class T> bool eq(T a,T b){\\n\\treturn abs(a-b)<eps;\\n}\\ntemplate<class T> int sgn(T a){\\n\\tif(eq(a,0.0)) return 0;\\n\\tif(a>0) return 1;\\n\\treturn -1;\\n}\\n\\n//vector<Real> vals;\\nReal vals[140];\\nint vals_id=0;\\n//vector<int> valid_vnum;\\nint valid_vnum[7000];\\nint valid_vnum_id=0;\\n\\nint rev_valid_vnum[140*140*140];\\n\\nint encode(Real x,Real y,Real z){\\n//\\tint xid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),x-eps));\\n//\\tint yid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),y-eps));\\n//\\tint zid = distance(vals.begin(),lower_bound(vals.begin(),vals.end(),z-eps));\\n\\tint xid=lower_bound(vals,vals+vals_id,x-eps)-vals;\\n\\tint yid=lower_bound(vals,vals+vals_id,y-eps)-vals;\\n\\tint zid=lower_bound(vals,vals+vals_id,z-eps)-vals;\\n//\\tint v=xid + vals.size()*yid + vals.size()*vals.size()*zid;\\n\\tint v=xid + vals_id*yid + vals_id*vals_id*zid;\\n//\\tint res = distance(valid_vnum.begin(),lower_bound(valid_vnum.begin(),valid_vnum.end(),v));\\n//\\tint res = lower_bound(valid_vnum,valid_vnum+valid_vnum_id,v)-valid_vnum;\\n\\tint res = rev_valid_vnum[v];\\n\\treturn res;\\n}\\n\\nconst int V = 10000;// 140*140*140;\\n\\nint head[V],to[500500],nxt[500500],m;\\nReal cost[500500];\\nvoid init_edge(){\\n\\tfor(int i=0;i<V;i++) head[i]=-1;\\n\\tm=0;\\n}\\nvoid add_edge(int u,int v,Real c){\\n\\tnxt[m]=head[u];to[m]=v;cost[m]=c;head[u]=m;m++;\\n\\tnxt[m]=head[v];to[m]=u;cost[m]=c;head[v]=m;m++;\\n\\tif(m>500000) assert(0);\\n}\\n\\n//vector<Real> as,bs,cs,ds;\\nReal as[2200],bs[2200],cs[2200],ds[2200];\\nint aid=0;\\ntypedef pair<Real,Real> PR;\\nint gcd(int x,int y){\\n\\tif(x<y) return gcd(y,x);\\n\\tif(y==0) return x;\\n\\treturn gcd(y,x%y);\\n}\\n\\nPR tmp[30];\\n\\nvoid genEdges(){\\n\\tfor(int i=1;i<=12;i++) for(int j=1;j<=12;j++){\\n\\t\\tif(gcd(i,j)!=1) continue;\\n\\t//\\tvector<PR> tmp;\\n\\t\\tint tmp_id=0;\\n\\t\\tfor(int k=1;k<i;k++){\\n\\t\\t\\tReal y=(Real)k*j/i;\\n\\t\\t//\\ttmp.push_back(PR(k,y));\\n\\t\\t\\ttmp[tmp_id++]=PR(k,y);\\n\\t\\t}\\n\\t\\tfor(int k=1;k<j;k++){\\n\\t\\t\\tReal x=(Real)i*k/j;\\n\\t\\t//\\ttmp.push_back(PR(x,k));\\n\\t\\t\\ttmp[tmp_id++]=PR(x,k);\\n\\t\\t}\\n\\t\\t//tmp.push_back(PR(0,0));\\n\\t\\t//tmp.push_back(PR(i,j));\\n\\t\\ttmp[tmp_id++]=PR(0,0);\\n\\t\\ttmp[tmp_id++]=PR(i,j);\\n//\\t\\tsort(tmp.begin(),tmp.end());\\n\\t\\tsort(tmp,tmp+tmp_id);\\n/*\\t\\tif(i == 3 && j == 4){\\n\\t\\t\\tfor(int k = 0; k < tmp.size(); k++){\\n\\t\\t\\t\\tprintf(\\\"%f %f\\\\n\\\",tmp[k].first,tmp[k].second);\\n\\t\\t\\t}\\n//\\t\\t\\texit(0);\\n\\t\\t}*/\\n\\t//\\tfor(int k=0;k+1<tmp.size();k++){\\n\\t\\tfor(int k=0;k+1<tmp_id;k++){\\n\\t\\t\\tReal a_=tmp[k].first;\\n\\t\\t\\tReal a=a_-(int)(a_+eps);\\n\\t\\t\\tReal b_=tmp[k].second;\\n\\t\\t\\tReal b=b_-(int)(b_+eps);\\n\\t\\t\\tReal c_=tmp[k+1].first;\\n\\t\\t\\tReal c=c_-(int)(c_-eps);\\n\\t\\t\\tReal d_=tmp[k+1].second;\\n\\t\\t\\tReal d=d_-(int)(d_-eps);\\n\\t\\t/*\\tas.push_back(a);\\n\\t\\t\\tbs.push_back(b);\\n\\t\\t\\tcs.push_back(c);\\n\\t\\t\\tds.push_back(d);\\n\\t\\t\\tas.push_back(1-a);\\n\\t\\t\\tbs.push_back(b);\\n\\t\\t\\tcs.push_back(1-c);\\n\\t\\t\\tds.push_back(d);*/\\n\\t\\t\\tas[aid]=a;\\n\\t\\t\\tbs[aid]=b;\\n\\t\\t\\tcs[aid]=c;\\n\\t\\t\\tds[aid]=d;\\n\\t\\t\\taid++;\\n\\t\\t\\tas[aid]=1-a;\\n\\t\\t\\tbs[aid]=b;\\n\\t\\t\\tcs[aid]=1-c;\\n\\t\\t\\tds[aid]=d;\\n\\t\\t\\taid++;\\n//\\t\\t\\tif(i == 3 && j == 4){\\n//\\t\\t\\t\\tprintf(\\\"%f %f %f %f\\\\n\\\", a,b,c,d);\\n//\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n/*\\tfor(int i=0;i<as.size();i++){\\n\\t\\tprintf(\\\"%.2f %.2f %.2f %.2f\\\\n\\\",as[i],bs[i],cs[i],ds[i]);\\n\\t}\\n\\texit(0);*/\\n}\\nReal getDis(Real a,Real b,Real c,Real p,Real q,Real r){\\n\\tReal d1=a-p,d2=b-q,d3=c-r;\\n\\treturn sqrt(d1*d1+d2*d2+d3*d3);\\n}\\n\\nbool exi[5][5][5];\\nvoid genGraph(){\\n//\\tint cntOut=0;\\n/*\\tfor(int i=0;i<140*140*140;i++){\\n\\t\\tG[i].clear();\\n\\t}*/\\n\\tinit_edge();\\n\\tfor(int x=1;x<=4;x++){\\n\\t\\tfor(int y=1;y<=3;y++) for(int z=1;z<=3;z++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tif(exi[x-1][y][z]) cnt++;\\n\\t\\t\\tif(exi[x][y][z]) cnt++;\\n\\t\\t\\tif(cnt!=1) continue;\\n\\t\\t//\\tfor(int i=0;i<as.size();i++){\\n\\t\\t\\tfor(int i=0;i<aid;i++){\\n\\t\\t\\t\\tReal x1=x,y1_=y+as[i],z1=z+bs[i];\\n\\t\\t\\t\\tReal x2=x,y2_=y+cs[i],z2=z+ds[i];\\n\\t\\t\\t\\tint u=encode(x1,y1_,z1);\\n\\t\\t\\t\\tint v=encode(x2,y2_,z2);\\n\\t\\t\\t\\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\\n\\t\\t\\t\\tadd_edge(u,v,d);\\n\\t\\t//\\t\\tG[u].push_back(edge(v,d));\\n\\t\\t//\\t\\tG[v].push_back(edge(u,d));\\n\\t\\t//\\t\\tif(++cntOut<=20){\\n\\t\\t\\t\\t\\t//printf(\\\"%d %d\\\\n\\\",u,v);\\n//\\t\\t\\t\\t\\tprintf(\\\"%.2f %.2f %.2f %.2f %.2f %.2f\\\\n\\\",\\n//\\t\\t\\t\\t\\tx1,y1_,z1,x2,y2_,z2);\\n\\t\\t//\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int y=1;y<=4;y++){\\n\\t\\tfor(int x=1;x<=3;x++) for(int z=1;z<=3;z++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tif(exi[x][y-1][z]) cnt++;\\n\\t\\t\\tif(exi[x][y][z]) cnt++;\\n\\t\\t\\tif(cnt!=1) continue;\\n\\t\\t//\\tfor(int i=0;i<as.size();i++){\\n\\t\\t\\tfor(int i=0;i<aid;i++){\\n\\t\\t\\t\\tReal x1=x+as[i],y1_=y,z1=z+bs[i];\\n\\t\\t\\t\\tReal x2=x+cs[i],y2_=y,z2=z+ds[i];\\n\\t\\t\\t\\tint u=encode(x1,y1_,z1);\\n\\t\\t\\t\\tint v=encode(x2,y2_,z2);\\n\\t\\t\\t\\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\\n\\t\\t\\t\\tadd_edge(u,v,d);\\n\\t\\t\\t//\\tG[u].push_back(edge(v,d));\\n\\t\\t\\t//\\tG[v].push_back(edge(u,d));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int z=1;z<=4;z++){\\n\\t\\tfor(int x=1;x<=3;x++) for(int y=1;y<=3;y++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tif(exi[x][y][z]) cnt++;\\n\\t\\t\\tif(exi[x][y][z-1]) cnt++;\\n\\t\\t\\tif(cnt!=1) continue;\\n\\t\\t//\\tfor(int i=0;i<as.size();i++){\\n\\t\\t\\tfor(int i=0;i<aid;i++){\\n\\t\\t\\t\\tReal x1=x+as[i],y1_=y+bs[i],z1=z;\\n\\t\\t\\t\\tReal x2=x+cs[i],y2_=y+ds[i],z2=z;\\n\\t\\t\\t\\tint u=encode(x1,y1_,z1);\\n\\t\\t\\t\\tint v=encode(x2,y2_,z2);\\n\\t\\t\\t\\tReal d=getDis(x1,y1_,z1,x2,y2_,z2);\\n\\t\\t\\t\\tadd_edge(u,v,d);\\n\\t\\t\\t//\\tG[u].push_back(edge(v,d));\\n\\t\\t\\t//\\tG[v].push_back(edge(u,d));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//TODO: add edges coincide with cubes' edges\\n\\tfor(int y=1;y<=4;y++) for(int z=1;z<=4;z++){\\n\\t\\tfor(int x=1;x<=3;x++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tfor(int y_=y-1;y_<=y;y_++) for(int z_=z-1;z_<=z;z_++){\\n\\t\\t\\t\\tif(exi[x][y_][z_]) cnt++;\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt==0||cnt==4) continue;\\n\\t\\t\\tint u=encode(x,y,z);\\n\\t\\t\\tint v=encode(x+1,y,z);\\n\\t\\t\\tadd_edge(u,v,1);\\n\\t\\t//\\tG[u].push_back(edge(v,1));\\n\\t\\t//\\tG[v].push_back(edge(u,1));\\n\\t\\t}\\n\\t}\\n\\tfor(int z=1;z<=4;z++) for(int x=1;x<=4;x++){\\n\\t\\tfor(int y=1;y<=3;y++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tfor(int z_=z-1;z_<=z;z_++) for(int x_=x-1;x_<=x;x_++){\\n\\t\\t\\t\\tif(exi[x_][y][z_]) cnt++;\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt==0||cnt==4) continue;\\n\\t\\t\\tint u=encode(x,y,z);\\n\\t\\t\\tint v=encode(x,y+1,z);\\n\\t\\t\\tadd_edge(u,v,1);\\n\\t\\t//\\tG[u].push_back(edge(v,1));\\n\\t\\t//\\tG[v].push_back(edge(u,1));\\n\\t\\t}\\n\\t}\\n\\tfor(int x=1;x<=4;x++) for(int y=1;y<=4;y++){\\n\\t\\tfor(int z=1;z<=3;z++){\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tfor(int x_=x-1;x_<=x;x_++) for(int y_=y-1;y_<=y;y_++){\\n\\t\\t\\t\\tif(exi[x_][y_][z]) cnt++;\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt==0||cnt==4) continue;\\n\\t\\t\\tint u=encode(x,y,z);\\n\\t\\t\\tint v=encode(x,y,z+1);\\n\\t\\t\\tadd_edge(u,v,1);\\n\\t\\t//\\tG[u].push_back(edge(v,1));\\n\\t\\t//\\tG[v].push_back(edge(u,1));\\n\\t\\t}\\n\\t}\\n}\\n\\nbool checkInt(int id){\\n\\tReal x=vals[id];\\n\\tint x_=(int)(x+eps);\\n\\treturn eq(x,(Real)x_);\\n}\\nvoid init(){\\n\\tfor(int i=2;i<=12;i++){\\n\\t\\tfor(int j=1;j<i;j++){\\n\\t\\t\\tif(gcd(i,j)!=1) continue;\\n\\t\\t\\tReal x=(Real)j/i;\\n\\t\\t\\tfor(int k=1;k<=3;k++){\\n\\t\\t//\\t\\tvals.push_back(x+k);\\n\\t\\t\\t\\tvals[vals_id++]=x+k;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n//\\tfor(int k=1;k<=4;k++) vals.push_back(k);\\n\\tfor(int k=1;k<=4;k++) vals[vals_id++]=k;\\n//\\tsort(vals.begin(),vals.end());\\n\\tsort(vals,vals+vals_id);\\n\\tgenEdges();\\n//\\tfor(int i=0;i<vals.size();i++) for(int j=0;j<vals.size();j++) for(int k=0;k<vals.size();k++){\\n\\tfor(int i=0;i<vals_id;i++) for(int j=0;j<vals_id;j++) for(int k=0;k<vals_id;k++){\\n\\t\\tint cnt=0;\\n\\t\\tif(checkInt(i)) cnt++;\\n\\t\\tif(checkInt(j)) cnt++;\\n\\t\\tif(checkInt(k)) cnt++;\\n\\t\\tif(cnt<2) continue;\\n//\\t\\tvalid_vnum.push_back(i+vals.size()*j+vals.size()*vals.size()*k);\\n//\\t\\tvalid_vnum.push_back(i+vals_id*j+vals_id*vals_id*k);\\n\\t\\tvalid_vnum[valid_vnum_id++]=i+vals_id*j+vals_id*vals_id*k;\\n\\t}\\n\\tfor(int i=0;i<valid_vnum_id;i++){\\n\\t\\trev_valid_vnum[valid_vnum[i]]=i;\\n\\t}\\n//\\tprintf(\\\"%d\\\\n\\\",valid_vnum.size());\\n//\\tsort(valid_vnum.begin(),valid_vnum.end());\\n//\\tsort(valid_vnum,valid_vnum+valid_vnum_id);\\n}\\n\\nReal dis[V];\\n\\ntypedef pair<Real,int> State;\\npriority_queue<State,vector<State>,greater<State> > que;\\n\\nReal solve(int x1,int y1,int z1,int x2,int y2,int z2){\\n//\\tprintf(\\\"%d %d %d %d %d %d\\\\n\\\",x1,y1,z1,x2,y2,z2);\\n\\tint u=encode(x1,y1,z1);\\n\\tint v=encode(x2,y2,z2);\\n\\tgenGraph();\\n//\\tprintf(\\\"u=%d,v=%d\\\\n\\\",u,v);\\n//\\tint V=140*140*140;\\n\\tfor(int i=0;i<V;i++){\\n\\t\\tdis[i]=inf;\\n\\t}\\n\\tdis[u]=0;\\n\\tque.push(State(0,u));\\n\\twhile(!que.empty()){\\n\\t\\tState state = que.top();\\n\\t\\tque.pop();\\n\\t\\tReal cd = state.first;\\n\\t\\tint cv = state.second;\\n//\\t\\tprintf(\\\"cv=%d\\\\n\\\",cv);\\n\\t\\tif(sgn(dis[cv]-cd)>0) continue;\\n//\\t\\tfor(int i=0;i<G[cv].size();i++){\\n\\t\\tfor(int e=head[cv];e!=-1;e=nxt[e]){\\n\\t\\t//\\tint nv = G[cv][i].to;\\n\\t\\t\\tint nv=to[e];\\n\\t\\t//\\tReal nd = cd + G[cv][i].cost;\\n\\t\\t\\tReal nd=cd+cost[e];\\n\\t\\t\\tif(sgn(dis[nv]-nd)<=0) continue;\\n\\t\\t\\tdis[nv]=nd;\\n\\t\\t\\tque.push(State(nd,nv));\\n\\t\\t}\\n\\t}\\n\\treturn dis[v];\\n}\\n\\nint x1,y1_,z1,x2,y2_,z2;\\n\\nvoid input(){\\n\\tscanf(\\\"%d%d%d%d%d%d\\\",&x1,&y1_,&z1,&x2,&y2_,&z2);\\n\\tif(x1==0&&y1_==0&&z1==0&&x2==0&&y2_==0&&z2==0) exit(0);\\n\\tx1++;y1_++;z1++;x2++;y2_++;z2++;\\n\\tfor(int i=1;i<=3;i++) for(int j=1;j<=3;j++) for(int k=1;k<=3;k++){\\n\\t\\texi[i][j][k]=false;\\n\\t}\\n\\tfor(int z=1;z<=3;z++) for(int y=1;y<=3;y++){\\n\\t\\tchar ch[10];\\n\\t\\tscanf(\\\"%s\\\",ch+1);\\n\\t\\tfor(int x=1;x<=3;x++){\\n\\t\\t\\texi[x][y][z]=ch[x]=='#';\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\tinit();\\n//\\tprintf(\\\"%d %d\\\\n\\\",vals.size(),as.size());\\n//\\tint t = 0;\\n//\\tprintf(\\\"as.size()=%d\\\\n\\\",as.size());\\n//\\tprintf(\\\"valid_vnum.size()=%d\\\\n\\\",valid_vnum.size());\\n//\\tprintf(\\\"vals.size()=%d\\\\n\\\",vals.size());\\n\\twhile(true){\\n//\\t\\tfprintf(stderr,\\\"%d\\\\n\\\",t++);\\n\\t\\tinput();\\n\\t\\tReal ans=solve(x1,y1_,z1,x2,y2_,z2);\\n\\t\\tprintf(\\\"%f\\\\n\\\",ans);\\n//\\t\\tint s = encode(1,1,1);\\n//\\t\\tint t = encode(4,4,4);\\n//\\t\\tint mid = encode(1.5,1,2);\\n//\\t\\tprintf(\\\"[%d] = %f\\\\n\\\",s,dis[s]);\\n//\\t\\tprintf(\\\"[%d] = %f\\\\n\\\",t,dis[t]);\\n//\\t\\tprintf(\\\"[%d] = %f\\\\n\\\",mid,dis[mid]);\\n/*\\t\\tint cnt = 0;\\n\\t\\tfor(int i = 0; i < 140*140*140;i++){\\n\\t\\t\\tif(dis[i] < 1e9){\\n\\t\\t\\t\\tif(++cnt<=10){\\n\\t\\t\\t\\t\\tdecodeAndPrint(i);\\n\\t\\t\\t\\t\\tprintf(\\\"%d->%f\\\\n\\\",i,dis[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\texit(0);*/\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6640,\n \"memory_kb\": 19988,\n \"score_of_the_acc\": -1.7677,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":785,"cells":{"group_id":{"kind":"string","value":"aoj_1335_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nEqual Sum Sets\nLet us consider sets of positive integers less than or equal to\nn\n. Note that all elements of a set are different. Also note that the order of elements doesn't matter, that is, both {3, 5, 9} and {5, 9, 3} mean the same set.\nSpecifying the number of set elements and their sum to be\nk\nand\ns\n, respectively, sets satisfying the conditions are limited. When\nn\n= 9,\nk\n= 3 and\ns\n= 23, {6, 8, 9} is the only such set. There may be more than one such set, in general, however. When\nn\n= 9,\nk\n= 3 and\ns\n= 22, both {5, 8, 9} and {6, 7, 9} are possible.\nYou have to write a program that calculates the number of the sets that satisfy the given conditions.\nInput\nThe input consists of multiple datasets. The number of datasets does not exceed 100.\nEach of the datasets has three integers\nn\n,\nk\nand\ns\nin one line, separated by a space. You may assume 1 ≤\nn\n≤ 20, 1 ≤\nk\n≤ 10 and 1 ≤\ns\n≤ 155.\nThe end of the input is indicated by a line containing three zeros.\nOutput\nThe output for each dataset should be a line containing a single integer that gives the number of the sets that satisfy the conditions. No other characters should appear in the output.\nYou can assume that the number of sets does not exceed 2\n31\n- 1.\nSample Input\n9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0\nOutput for the Sample Input\n1\n2\n0\n20\n1542\n5448\n1\n0\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1335_11030135","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\n\nll mod = 998244353;\n\nifstream in;\nofstream out;\n\nusing ld = long double;\nconst ld eps = 1e-9;\nlong double calc_inter(array<ld, 3> a, array<ld, 3> b, array<ld, 3> p, ld r) {\n ld x = b[0] - a[0], y = b[1] - a[1], z = b[2] - a[2];\n ld t = -(x * (a[0] - p[0]) + y * (a[1] - p[1]) + z * (a[2] - p[2])) /\n (x * x + y * y + z * z);\n\n if(t < 0 || t > 1) return false;\n x = p[0] - (a[0] + t * x);\n y = p[1] - (a[1] + t * y);\n z = p[2] - (a[2] + t * z);\n return x * x + y * y + z * z <= r * r + eps;\n};\n\nint main(int argc, char** argv) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n if(argc > 2) {\n in.open(argv[1]);\n cin.rdbuf(in.rdbuf());\n out.open(argv[2]);\n cout.rdbuf(out.rdbuf());\n }\n\n while(1) {\n ll n, k, s;\n cin >> n >> k >> s;\n if(n == 0) break;\n ll ans = 0;\n for(uint32_t i = 0; i < (1 << n); i++) {\n if(popcount(i) != k) continue;\n\n ll sum = 0;\n for(int j = 0; j < n; j++) {\n sum += ((i >> j) & 1) * (j + 1);\n }\n ans += sum == s;\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0862,"final_rank":8},{"submission_id":"aoj_1335_8528341","code_snippet":"#include <bits/stdc++.h>\n\nint solve() {\n int n, k, s;\n std::cin >> n >> k >> s;\n if (n == 0) return 1;\n\n int ans = 0;\n for (int state = 0; state < (1 << n); state++) {\n int count = 0;\n int sum = 0;\n for (int i = 0; i < n; i++) {\n if (state & (1 << i)) {\n count++;\n sum += i + 1;\n }\n }\n if (count == k && sum == s) ans++;\n }\n std::cout << ans << std::endl;\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":520,"memory_kb":3120,"score_of_the_acc":-0.3521,"final_rank":12},{"submission_id":"aoj_1335_8349539","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\nusing namespace std;\n#define ALL(v) v.begin(),v.end()\n\nint main(void) {\n\twhile (true) {\n\t\tint N,K,S;\n\t\tcin >> N >> K >> S;\n\t\tif (N == 0 && K == 0 && S == 0) break;\n\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < (1 << N); ++i) {\n\t\t\tvector<int> v;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tif (i & 1 << j) {\n\t\t\t\t\tv.push_back(j + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (v.size() != K) continue;\n\t\t\tint sum = accumulate(ALL(v), 0);\n\t\t\tif (sum == S) ++ans;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":1530,"memory_kb":3336,"score_of_the_acc":-1.0613,"final_rank":20},{"submission_id":"aoj_1335_7807924","code_snippet":"#include <bits/stdc++.h>\n\nvoid solve(int n, int k, int s) {\n int count = 0;\n\n int set = (1 << k) - 1;\n while (set < (1 << n)) {\n int sum = 0;\n for (int i = 0; i < n; i++) {\n if (not (set & (1 << i))) continue;\n sum += i + 1;\n }\n\n if (sum == s) count++;\n\n int x = set & -set;\n int y = set + x;\n set = ((set & ~y) / x >> 1) | y;\n }\n\n std::cout << count << std::endl;\n}\n\nint main() {\n int n, k, s;\n \n while (std::cin >> n >> k >> s, n) {\n solve(n, k, s);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3132,"score_of_the_acc":-0.0191,"final_rank":2},{"submission_id":"aoj_1335_7807796","code_snippet":"#include <bits/stdc++.h>\n\nvoid solve(int n, int k, int s) {\n std::vector< int > ps(n, 1);\n for (int i = 0; i < n - k; i++) ps[i] = 0;\n\n int count = 0;\n do {\n int sum = 0;\n for (int i = 0; i < n; i++) {\n if (not ps[i]) continue;\n sum += i + 1;\n }\n\n if (sum == s) count++;\n } while (std::next_permutation(ps.begin(), ps.end()));\n\n std::cout << count << std::endl;\n}\n\nint main() {\n int n, k, s;\n \n while (std::cin >> n >> k >> s, n) {\n solve(n, k, s);\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3328,"score_of_the_acc":-0.0728,"final_rank":6},{"submission_id":"aoj_1335_7251396","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(true){\n int n, k, s; cin >> n >> k >> s;\n if(n == 0) break;\n int ans = 0;\n for(int bit = 0; bit < (1 << n); bit++){\n int cnt = 0, sum = 0;\n for(int i = 0; i < n; i++){\n if((bit >> i) & 1){\n cnt++;\n sum += i+1;\n }\n }\n if(cnt == k && sum == s) ans++;\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":680,"memory_kb":3432,"score_of_the_acc":-0.522,"final_rank":18},{"submission_id":"aoj_1335_7218976","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n, int k, int s) {\n int ans = 0;\n\n for (int bits = 0; bits < (1 << n); bits++) {\n int cnt = 0;\n int sum = 0;\n\n for (int i = 0; i < n; i++) {\n if(bits & (1 << i)) {\n cnt++;\n sum += (i + 1);\n }\n }\n\n if(cnt == k && sum == s) ans++;\n }\n\n cout << ans << endl;\n}\n\nint main() {\n while(true) {\n int n, k, s;\n cin >> n >> k >> s;\n if(n == 0)break;\n solve(n,k,s);\n }\n}","accuracy":1,"time_ms":580,"memory_kb":3336,"score_of_the_acc":-0.4363,"final_rank":16},{"submission_id":"aoj_1335_6392033","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; ++i)\ntypedef long long ll;\nusing namespace std;\n\nint ans;\nvoid dfs(int N, int K, int S, vector<int> p) {\n if (p.size() == N + 1) {\n if (accumulate(p.begin(), p.end(), 0) == S)\n ans++;\n\n return;\n }\n\n p.emplace_back(p.back());\n while (p.back() < K) {\n p.back()++;\n dfs(N, K, S, p);\n }\n}\n\nvoid solve(int N, int K, int S) {\n ans = 0;\n dfs(K, N, S, vector<int>(1, 0));\n cout << ans << endl;\n}\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n int N, K, S;\n while (cin >> N >> K >> S, N && K && S)\n solve(N, K, S);\n\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3260,"score_of_the_acc":-0.1048,"final_rank":11},{"submission_id":"aoj_1335_6212968","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define ALL(x) x.begin(), x.end()\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int MAX = 20;\n int N2 = 1 << MAX;\n vector<vector<int>> g(160);\n rep(b, N2) {\n int s = 0;\n rep(i, MAX) {\n if (b >> i & 1) s += i + 1;\n }\n if (s >= 160) continue;\n g[s].push_back(b);\n }\n int N, K, S;\n while (cin >> N >> K >> S, N) {\n int ans = 0;\n int b2 = 0;\n rep(i, MAX - N) b2 += (1 << (N + i));\n for (auto &b : g[S]) {\n if (b & b2) continue;\n if (__builtin_popcount(b) != K) continue;\n ans++;\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7868,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_1335_6016318","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\nll an = 0;\nll N, K, S;\nvoid dfs(ll k, ll m, ll s) {\n\t//if (N * k < s)return;\n\t//if (m * k > s)return;\n\tif (k == 0 && s == 0) {\n\t\tan++;\n\t\treturn;\n\t}\n\tfor (ll i = m + 1; i <= min(N, s); i++) {\n\t\tdfs(k - 1, i, s - i);\n\t}\n\n}\n\n\nint main() {\n\twhile (1) {\n\t\tcin >> N >> K >> S;\n\t\tif (N == 0)return 0;\n\t\tan = 0;\n\t\tdfs(K, 0, S);\n\t\tcout << an << endl;\n\t}\n\n\n}","accuracy":1,"time_ms":10,"memory_kb":3044,"score_of_the_acc":-0.0008,"final_rank":1},{"submission_id":"aoj_1335_5987916","code_snippet":"#include <functional>\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n std::cin.tie(0);\n std::ios_base::sync_with_stdio(false);\n\n while (true) {\n int n, k, s;\n cin >> n >> k >> s;\n\n if (n == 0 && k == 0 && s == 0) {\n break;\n }\n\n int ans = 0;\n\n function<void(int, int, int)> dfs = [&](int idx, int v, int sum) {\n if (v == n && sum < s) {\n return;\n }\n if (sum > s) {\n return;\n }\n\n if (idx == k - 1) {\n ans += sum == s;\n return;\n }\n\n for (int next_v = v + 1; next_v <= n; next_v++) {\n dfs(idx + 1, next_v, sum + next_v);\n }\n };\n\n for (int x = 1; x <= n; x++) {\n dfs(0, x, x);\n }\n\n cout << ans << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0862,"final_rank":8},{"submission_id":"aoj_1335_5916959","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n while(1){\n int n, k, s;\n cin >> n >> k >> s;\n if(n == 0 && k == 0 && s == 0) break;\n int res = 0;\n for(int bits = 0; bits < 1<<(n); bits++){\n if( __builtin_popcount(bits) == k){\n int sum = 0;\n for(int i = 0; i < n; i++){\n if(bits & 1 << i){\n sum += (i+1);\n }\n }\n if(sum == s) res++;\n }\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3316,"score_of_the_acc":-0.0769,"final_rank":7},{"submission_id":"aoj_1335_5813063","code_snippet":"#include<bits/stdc++.h>\n#define fi first\n#define se second\n#define ll long long\n#define mp make_pair\n#define pb push_back\n#define ls x<<1\n#define rs x<<1|1\n#define lson x<<1,l,mid\n#define rson x<<1|1,mid+1,r\n#define pii pair<int,int>\n#define all(x) x.begin(),x.end()\n#define cl(x,y) memset(x,y,sizeof(x))\n#define nxtp(a,n) next_permutation(a+1,a+n+1)\n#define mem(x,y,n) memset(x,y,sizeof(int)*(n+5))\nconst int N=1e6+10;\nconst int mod=1e9+7;\nconst int inf=0x3f3f3f3f;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst double INF=1e18;\nusing namespace std;\n\nint ans,n,k,s,a[N];\nvoid dfs(int x,int p)\n{\n\tint i;\n\tif(p==k)\n\t{\n\t\tint sum=0;\n\t\tfor(i=1;i<=k;i++)\n\t\t\tsum+=a[i];\n\t\tans+=(sum==s);\n\t\treturn ;\n\t}\n\tfor(i=x+1;i<=n;i++)\n\t{\n\t\ta[p+1]=i;\n\t\tdfs(i,p+1);\n\t}\n}\nint main()\n{\n#ifdef ChuTian\n\tclock_t stTime = clock();\n freopen(\"in.in\",\"r\",stdin);\n freopen(\"out.out\",\"w\",stdout);\n#endif\n\tios::sync_with_stdio(false);\n\tcin.tie(0);cout.tie(0);\n\n\twhile(cin>>n>>k>>s && n+k+s)\n\t{\n\t\tans=0;\n\t\tdfs(0,0);\n\t\tcout<<ans<<endl;\n\t}\n#ifdef ChuTian\n\tcerr << \"Time Used:\" << clock() - stTime << \"ms\" <<endl;\n#endif\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3460,"score_of_the_acc":-0.087,"final_rank":10},{"submission_id":"aoj_1335_5638318","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) v.begin(),v.end()\n\nint main(){\n int n,k,s;\n while(cin>>n>>k>>s,n){\n vector<int> v(n);\n REP(i,n)v[i]=i<k;\n sort(ALL(v));\n int ans=0;\n do{\n int sum=0;\n REP(i,n)if(v[i])sum+=i+1;\n ans+=sum==s;\n }while(next_permutation(ALL(v)));\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3112,"score_of_the_acc":-0.0346,"final_rank":3},{"submission_id":"aoj_1335_5607581","code_snippet":"#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n \n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n \n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n \n// name macro\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T = int>\nusing VVV = std::vector<std::vector<std::vector<T>>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\nusing Tp = tuple<ll,ll,ll>;\n \n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n \n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"No\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n \n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n \ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n \n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v /= x;\n}\n \n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\ntemplate<typename T>\nT ADD(T a, T b){\n\tT res;\n\treturn __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\ntemplate<typename T>\nT MUL(T a, T b){\n\tT res;\n\treturn __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\n}\n\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n \n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\n\n#pragma endregion\n\nusing R = long double;\nconstexpr R EPS=1E-11;\n\n// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.\nint sgn(const R& r){ return (r > EPS) - (r < -EPS); }\n// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.\nint sgn(const R& a, const R &b){ return sgn(a-b); }\n// a > 0 は sgn(a) > 0\n// a < b は sgn(a, b) < 0\n// a >= b は sgn(a, b) >= 0\n// のように書く.\n// return s * 10^n\n\n//https://atcoder.jp/contests/abc191/submissions/20028529\nlong long x10(const string& s, size_t n) {\n if (s.front() == '-') return -x10(s.substr(1), n);\n auto pos = s.find('.');\n if (pos == string::npos) return stoll(s + string(n, '0'));\n return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));\n}\n \nlong long ceildiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return (a + b - 1) / b;\n else return a / b;\n}\n \nlong long floordiv(long long a, long long b) {\n if (b < 0) a = -a, b = -b;\n if (a >= 0) return a / b;\n else return (a - b + 1) / b;\n}\n \nlong long floorsqrt(long long x) {\n assert(x >= 0);\n long long ok = 0;\n long long ng = 1;\n while (ng * ng <= x) ng <<= 1;\n while (ng - ok > 1) {\n long long mid = (ng + ok) >> 1;\n if (mid * mid <= x) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n\ninline int topbit(unsigned long long x){\n\treturn x?63-__builtin_clzll(x):-1;\n}\n\ninline int popcount(unsigned long long x){\n\treturn __builtin_popcountll(x);\n}\n\ninline int parity(unsigned long long x){//popcount%2\n\treturn __builtin_parity(x);\n}\n\nconst int inf = 1e9;\nconst ll INF = 1e18;\n\nvoid main_() {\n ll n,k,s;\n cin >> n >> k >> s;\n VVV<ll> dp(11,VV<ll>(160,V<ll>(160)));\n \n while(n!=0){\n REP(i,11)REP(j,160)REP(K,160) dp[i][j][K] = 0;\n dp[0][0][0] = 1;\n REP(i,k){\n REP(j,160)REP(a,s+1){\n for(ll b = j+1;b <= n;b++){\n if(a + b > s)break;\n dp[i+1][b][a + b] += dp[i][j][a];\n }\n }\n }\n ll ans = 0;\n \n REP(i,160){\n ans += dp[k][i][s];\n }\n cout << ans << endl;\n cin >> n >> k >> s;\n }\n}\n \nint main() {\n\tint t = 1;\n\t//cin >> t;\n\twhile(t--) main_();\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5544,"score_of_the_acc":-0.5186,"final_rank":17},{"submission_id":"aoj_1335_5289469","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)\n#define itn int\n#define miele(v) min_element(v.begin(), v.end())\n#define maele(v) max_element(v.begin(), v.end())\n#define SUM(v) accumulate(v.begin(), v.end(), 0LL)\n#define lb(a, key) lower_bound(a.begin(),a.end(),key)\n#define ub(a, key) upper_bound(a.begin(),a.end(),key)\n#define COUNT(a, key) count(a.begin(), a.end(), key) \n#define BITCOUNT(x) __builtin_popcount(x)\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define F first\n#define S second\nusing P = pair <int,int>;\nusing WeightedGraph = vector<vector <P>>;\nusing UnWeightedGraph = vector<vector<int>>;\nusing Real = long double;\nusing Point = complex<Real>; //Point and Vector2d is the same!\nusing Vector2d = complex<Real>;\nconst long long INF = 1LL << 60;\nconst int MOD = 1000000007;\nconst double EPS = 1e-15;\nconst double PI=3.14159265358979323846;\ntemplate <typename T> \nint getIndexOfLowerBound(vector <T> &v, T x){\n return lower_bound(v.begin(),v.end(),x)-v.begin();\n}\ntemplate <typename T> \nint getIndexOfUpperBound(vector <T> &v, T x){\n return upper_bound(v.begin(),v.end(),x)-v.begin();\n}\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\n#define DUMPOUT cerr\n#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)\nistream &operator>>(istream &is, Point &p) {\n Real a, b; is >> a >> b; p = Point(a, b); return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T,U> &p_var) {\n is >> p_var.first >> p_var.second;\n return is;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (T &x : vec) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, pair<T, U> &pair_var) {\n DUMPOUT<<'{';\n os << pair_var.first;\n DUMPOUT<<',';\n os << \" \"<< pair_var.second;\n DUMPOUT<<'}';\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<T> &vec) {\n DUMPOUT<<'[';\n for (int i = 0; i < vec.size(); i++) \n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n DUMPOUT<<']';\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<vector<T>> &df) {\n for (auto& vec : df) os<<vec;\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, map<T, U> &map_var) {\n DUMPOUT << \"{\";\n repi(itr, map_var) {\n os << *itr;\n itr++;\n if (itr != map_var.end()) DUMPOUT << \", \";\n itr--;\n }\n DUMPOUT << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, set<T> &set_var) {\n DUMPOUT << \"{\";\n repi(itr, set_var) {\n os << *itr;\n itr++;\n if (itr != set_var.end()) DUMPOUT << \", \";\n itr--;\n }\n DUMPOUT << \"}\";\n return os;\n}\nvoid print() {cout << endl;}\ntemplate <class Head, class... Tail>\nvoid print(Head&& head, Tail&&... tail) {\n cout << head;\n if (sizeof...(tail) != 0) cout << \" \";\n print(forward<Tail>(tail)...);\n}\nvoid dump_func() {DUMPOUT << '#'<<endl;}\ntemplate <typename Head, typename... Tail>\nvoid dump_func(Head &&head, Tail &&... tail) {\n DUMPOUT << head;\n if (sizeof...(Tail) > 0) DUMPOUT << \", \";\n dump_func(std::move(tail)...);\n}\n#ifdef DEBUG_\n#define DEB\n#define dump(...) \\\n DUMPOUT << \" \" << string(#__VA_ARGS__) << \": \" \\\n << \"[\" << to_string(__LINE__) << \":\" << __FUNCTION__ << \"]\" \\\n << endl \\\n << \" \", \\\n dump_func(__VA_ARGS__)\n#else\n#define DEB if (false)\n#define dump(...)\n#endif\n\nsigned main(void) { cin.tie(0); ios::sync_with_stdio(false);\n int t = 0;\n while(1) {\n int n, k, s; cin>>n>>k>>s;\n if(n == 0) exit(0);\n \n int ans = 0;\n int bit;\n for(bit=0;bit<(1<<n);bit++){\n int cnt = 0;\n int sum = 0;\n for(int i=0;i<n;i++){\n if(bit&(1<<i)){\n cnt++;\n sum += i+1;\n }\n }\n if(cnt == k && sum == s) {\n ans++;\n }\n }\n \n print(ans);\n }\n}","accuracy":1,"time_ms":560,"memory_kb":3344,"score_of_the_acc":-0.4248,"final_rank":15},{"submission_id":"aoj_1335_5283700","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(1){\n ll n,k,s; cin >> n >> k >> s;\n if(n == 0) break;\n int ans = 0;\n rep(i,1<<n){\n if(__builtin_popcount(i) != k) continue;\n ll cur = 0;\n rep(j,n) if(i & (1 << j)) cur += j + 1;\n if(cur == s) ans++;\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3056,"score_of_the_acc":-0.0428,"final_rank":4},{"submission_id":"aoj_1335_4965186","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n,k,s;\n while(cin>>n>>k>>s,n){\n int ans=0;\n for(int i=0;i<(1<<n);++i){\n int m=0,c=0;\n for(int j=0;j<n;++j){\n if(i&(1<<j)){\n m+=j+1;\n c++;\n }\n }\n if(c==k && m==s)ans++;\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":560,"memory_kb":3116,"score_of_the_acc":-0.3776,"final_rank":14},{"submission_id":"aoj_1335_4929431","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % MOD;\n x = x * x % MOD;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n template<class t>\n void output(t a){\n if(was_output)cout << \" \";\n cout << a;\n was_output = true;\n }\n void outendl(){\n was_output = false;\n cout << endl;\n }\n ll in(){\n ll res;\n scanf(\"%lld\", &res);\n return res;\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n void out(t x){\n cout << x;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n}\n\nusing namespace templates;\n\nint func(int n,int k,int s){\n method(func,int,int place,int sum,int used){\n if(used > k)return 0;\n if(sum > s)return 0;\n if(place == n+1){\n return sum == s and k == used;\n }\n int res = 0;\n res += func(place+1,sum+place,used+1);\n res += func(place+1,sum,used);\n return res;\n };\n return func(1,0,0);\n}\n\nint main(){\n while(true){\n int n = in();\n int k = in();\n int s = in();\n if(n==0)break;\n cout << func(n,k,s) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3240,"score_of_the_acc":-0.048,"final_rank":5},{"submission_id":"aoj_1335_4927509","code_snippet":"#include<bits/stdc++.h>\n\nusing ll = long long;\n#define var auto\n\nusing namespace std;\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){ if (a > b) a = b; }\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){ if (a < b) a = b; }\n\nint main(){\n int n, k, s;\n cin >> n >> k >> s;\n if (n == 0) return 0;\n int res = 0;\n for (int i = 0; i < (1 << n); i++){\n int sum = 0;\n int count = 0;\n for (int j = 0; j < n; j++){\n if (!(i >> j & 1)) continue;\n sum += (j + 1);\n count++;\n }\n if (sum == s && count == k) res++;\n }\n cout << res << endl;\n main();\n}","accuracy":1,"time_ms":570,"memory_kb":3040,"score_of_the_acc":-0.3684,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_1335_11030135\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<ll, 2>;\\nusing a3 = array<ll, 3>;\\n\\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\\nbool chmax(auto& a, const auto& b) { return a < b ? a = b, 1 : 0; }\\n\\nll mod = 998244353;\\n\\nifstream in;\\nofstream out;\\n\\nusing ld = long double;\\nconst ld eps = 1e-9;\\nlong double calc_inter(array<ld, 3> a, array<ld, 3> b, array<ld, 3> p, ld r) {\\n ld x = b[0] - a[0], y = b[1] - a[1], z = b[2] - a[2];\\n ld t = -(x * (a[0] - p[0]) + y * (a[1] - p[1]) + z * (a[2] - p[2])) /\\n (x * x + y * y + z * z);\\n\\n if(t < 0 || t > 1) return false;\\n x = p[0] - (a[0] + t * x);\\n y = p[1] - (a[1] + t * y);\\n z = p[2] - (a[2] + t * z);\\n return x * x + y * y + z * z <= r * r + eps;\\n};\\n\\nint main(int argc, char** argv) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n if(argc > 2) {\\n in.open(argv[1]);\\n cin.rdbuf(in.rdbuf());\\n out.open(argv[2]);\\n cout.rdbuf(out.rdbuf());\\n }\\n\\n while(1) {\\n ll n, k, s;\\n cin >> n >> k >> s;\\n if(n == 0) break;\\n ll ans = 0;\\n for(uint32_t i = 0; i < (1 << n); i++) {\\n if(popcount(i) != k) continue;\\n\\n ll sum = 0;\\n for(int j = 0; j < n; j++) {\\n sum += ((i >> j) & 1) * (j + 1);\\n }\\n ans += sum == s;\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0862,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1335_8528341\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint solve() {\\n int n, k, s;\\n std::cin >> n >> k >> s;\\n if (n == 0) return 1;\\n\\n int ans = 0;\\n for (int state = 0; state < (1 << n); state++) {\\n int count = 0;\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n if (state & (1 << i)) {\\n count++;\\n sum += i + 1;\\n }\\n }\\n if (count == k && sum == s) ans++;\\n }\\n std::cout << ans << std::endl;\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.3521,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1335_8349539\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <numeric>\\nusing namespace std;\\n#define ALL(v) v.begin(),v.end()\\n\\nint main(void) {\\n\\twhile (true) {\\n\\t\\tint N,K,S;\\n\\t\\tcin >> N >> K >> S;\\n\\t\\tif (N == 0 && K == 0 && S == 0) break;\\n\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 0; i < (1 << N); ++i) {\\n\\t\\t\\tvector<int> v;\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\tif (i & 1 << j) {\\n\\t\\t\\t\\t\\tv.push_back(j + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (v.size() != K) continue;\\n\\t\\t\\tint sum = accumulate(ALL(v), 0);\\n\\t\\t\\tif (sum == S) ++ans;\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1530,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -1.0613,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1335_7807924\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nvoid solve(int n, int k, int s) {\\n int count = 0;\\n\\n int set = (1 << k) - 1;\\n while (set < (1 << n)) {\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n if (not (set & (1 << i))) continue;\\n sum += i + 1;\\n }\\n\\n if (sum == s) count++;\\n\\n int x = set & -set;\\n int y = set + x;\\n set = ((set & ~y) / x >> 1) | y;\\n }\\n\\n std::cout << count << std::endl;\\n}\\n\\nint main() {\\n int n, k, s;\\n \\n while (std::cin >> n >> k >> s, n) {\\n solve(n, k, s);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.0191,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1335_7807796\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nvoid solve(int n, int k, int s) {\\n std::vector< int > ps(n, 1);\\n for (int i = 0; i < n - k; i++) ps[i] = 0;\\n\\n int count = 0;\\n do {\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n if (not ps[i]) continue;\\n sum += i + 1;\\n }\\n\\n if (sum == s) count++;\\n } while (std::next_permutation(ps.begin(), ps.end()));\\n\\n std::cout << count << std::endl;\\n}\\n\\nint main() {\\n int n, k, s;\\n \\n while (std::cin >> n >> k >> s, n) {\\n solve(n, k, s);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.0728,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1335_7251396\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main(){\\n while(true){\\n int n, k, s; cin >> n >> k >> s;\\n if(n == 0) break;\\n int ans = 0;\\n for(int bit = 0; bit < (1 << n); bit++){\\n int cnt = 0, sum = 0;\\n for(int i = 0; i < n; i++){\\n if((bit >> i) & 1){\\n cnt++;\\n sum += i+1;\\n }\\n }\\n if(cnt == k && sum == s) ans++;\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.522,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1335_7218976\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int n, int k, int s) {\\n int ans = 0;\\n\\n for (int bits = 0; bits < (1 << n); bits++) {\\n int cnt = 0;\\n int sum = 0;\\n\\n for (int i = 0; i < n; i++) {\\n if(bits & (1 << i)) {\\n cnt++;\\n sum += (i + 1);\\n }\\n }\\n\\n if(cnt == k && sum == s) ans++;\\n }\\n\\n cout << ans << endl;\\n}\\n\\nint main() {\\n while(true) {\\n int n, k, s;\\n cin >> n >> k >> s;\\n if(n == 0)break;\\n solve(n,k,s);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.4363,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1335_6392033\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < n; ++i)\\ntypedef long long ll;\\nusing namespace std;\\n\\nint ans;\\nvoid dfs(int N, int K, int S, vector<int> p) {\\n if (p.size() == N + 1) {\\n if (accumulate(p.begin(), p.end(), 0) == S)\\n ans++;\\n\\n return;\\n }\\n\\n p.emplace_back(p.back());\\n while (p.back() < K) {\\n p.back()++;\\n dfs(N, K, S, p);\\n }\\n}\\n\\nvoid solve(int N, int K, int S) {\\n ans = 0;\\n dfs(K, N, S, vector<int>(1, 0));\\n cout << ans << endl;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int N, K, S;\\n while (cin >> N >> K >> S, N && K && S)\\n solve(N, K, S);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.1048,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1335_6212968\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(x) x.begin(), x.end()\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int MAX = 20;\\n int N2 = 1 << MAX;\\n vector<vector<int>> g(160);\\n rep(b, N2) {\\n int s = 0;\\n rep(i, MAX) {\\n if (b >> i & 1) s += i + 1;\\n }\\n if (s >= 160) continue;\\n g[s].push_back(b);\\n }\\n int N, K, S;\\n while (cin >> N >> K >> S, N) {\\n int ans = 0;\\n int b2 = 0;\\n rep(i, MAX - N) b2 += (1 << (N + i));\\n for (auto &b : g[S]) {\\n if (b & b2) continue;\\n if (__builtin_popcount(b) != K) continue;\\n ans++;\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7868,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1335_6016318\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\nll an = 0;\\nll N, K, S;\\nvoid dfs(ll k, ll m, ll s) {\\n\\t//if (N * k < s)return;\\n\\t//if (m * k > s)return;\\n\\tif (k == 0 && s == 0) {\\n\\t\\tan++;\\n\\t\\treturn;\\n\\t}\\n\\tfor (ll i = m + 1; i <= min(N, s); i++) {\\n\\t\\tdfs(k - 1, i, s - i);\\n\\t}\\n\\n}\\n\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tcin >> N >> K >> S;\\n\\t\\tif (N == 0)return 0;\\n\\t\\tan = 0;\\n\\t\\tdfs(K, 0, S);\\n\\t\\tcout << an << endl;\\n\\t}\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -0.0008,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1335_5987916\",\n \"code_snippet\": \"#include <functional>\\n#include <iostream>\\n\\nusing namespace std;\\n\\nint main() {\\n std::cin.tie(0);\\n std::ios_base::sync_with_stdio(false);\\n\\n while (true) {\\n int n, k, s;\\n cin >> n >> k >> s;\\n\\n if (n == 0 && k == 0 && s == 0) {\\n break;\\n }\\n\\n int ans = 0;\\n\\n function<void(int, int, int)> dfs = [&](int idx, int v, int sum) {\\n if (v == n && sum < s) {\\n return;\\n }\\n if (sum > s) {\\n return;\\n }\\n\\n if (idx == k - 1) {\\n ans += sum == s;\\n return;\\n }\\n\\n for (int next_v = v + 1; next_v <= n; next_v++) {\\n dfs(idx + 1, next_v, sum + next_v);\\n }\\n };\\n\\n for (int x = 1; x <= n; x++) {\\n dfs(0, x, x);\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0862,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1335_5916959\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n while(1){\\n int n, k, s;\\n cin >> n >> k >> s;\\n if(n == 0 && k == 0 && s == 0) break;\\n int res = 0;\\n for(int bits = 0; bits < 1<<(n); bits++){\\n if( __builtin_popcount(bits) == k){\\n int sum = 0;\\n for(int i = 0; i < n; i++){\\n if(bits & 1 << i){\\n sum += (i+1);\\n }\\n }\\n if(sum == s) res++;\\n }\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.0769,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1335_5813063\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define fi first\\n#define se second\\n#define ll long long\\n#define mp make_pair\\n#define pb push_back\\n#define ls x<<1\\n#define rs x<<1|1\\n#define lson x<<1,l,mid\\n#define rson x<<1|1,mid+1,r\\n#define pii pair<int,int>\\n#define all(x) x.begin(),x.end()\\n#define cl(x,y) memset(x,y,sizeof(x))\\n#define nxtp(a,n) next_permutation(a+1,a+n+1)\\n#define mem(x,y,n) memset(x,y,sizeof(int)*(n+5))\\nconst int N=1e6+10;\\nconst int mod=1e9+7;\\nconst int inf=0x3f3f3f3f;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst double INF=1e18;\\nusing namespace std;\\n\\nint ans,n,k,s,a[N];\\nvoid dfs(int x,int p)\\n{\\n\\tint i;\\n\\tif(p==k)\\n\\t{\\n\\t\\tint sum=0;\\n\\t\\tfor(i=1;i<=k;i++)\\n\\t\\t\\tsum+=a[i];\\n\\t\\tans+=(sum==s);\\n\\t\\treturn ;\\n\\t}\\n\\tfor(i=x+1;i<=n;i++)\\n\\t{\\n\\t\\ta[p+1]=i;\\n\\t\\tdfs(i,p+1);\\n\\t}\\n}\\nint main()\\n{\\n#ifdef ChuTian\\n\\tclock_t stTime = clock();\\n freopen(\\\"in.in\\\",\\\"r\\\",stdin);\\n freopen(\\\"out.out\\\",\\\"w\\\",stdout);\\n#endif\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);cout.tie(0);\\n\\n\\twhile(cin>>n>>k>>s && n+k+s)\\n\\t{\\n\\t\\tans=0;\\n\\t\\tdfs(0,0);\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n#ifdef ChuTian\\n\\tcerr << \\\"Time Used:\\\" << clock() - stTime << \\\"ms\\\" <<endl;\\n#endif\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.087,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1335_5638318\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define ALL(v) v.begin(),v.end()\\n\\nint main(){\\n int n,k,s;\\n while(cin>>n>>k>>s,n){\\n vector<int> v(n);\\n REP(i,n)v[i]=i<k;\\n sort(ALL(v));\\n int ans=0;\\n do{\\n int sum=0;\\n REP(i,n)if(v[i])sum+=i+1;\\n ans+=sum==s;\\n }while(next_permutation(ALL(v)));\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.0346,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1335_5607581\",\n \"code_snippet\": \"#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#endif\\n \\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n \\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n \\n// name macro\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T = int>\\nusing VVV = std::vector<std::vector<std::vector<T>>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\nusing Tp = tuple<ll,ll,ll>;\\n \\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n \\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"No\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n \\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n \\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n \\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v /= x;\\n}\\n \\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\ntemplate<typename T>\\nT ADD(T a, T b){\\n\\tT res;\\n\\treturn __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\\n}\\n\\ntemplate<typename T>\\nT MUL(T a, T b){\\n\\tT res;\\n\\treturn __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;\\n}\\n\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n \\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\n\\n#pragma endregion\\n\\nusing R = long double;\\nconstexpr R EPS=1E-11;\\n\\n// r の(誤差付きの)符号に従って, -1, 0, 1 を返す.\\nint sgn(const R& r){ return (r > EPS) - (r < -EPS); }\\n// a, b の(誤差付きの)大小比較の結果に従って, -1, 0, 1 を返す.\\nint sgn(const R& a, const R &b){ return sgn(a-b); }\\n// a > 0 は sgn(a) > 0\\n// a < b は sgn(a, b) < 0\\n// a >= b は sgn(a, b) >= 0\\n// のように書く.\\n// return s * 10^n\\n\\n//https://atcoder.jp/contests/abc191/submissions/20028529\\nlong long x10(const string& s, size_t n) {\\n if (s.front() == '-') return -x10(s.substr(1), n);\\n auto pos = s.find('.');\\n if (pos == string::npos) return stoll(s + string(n, '0'));\\n return stoll(s.substr(0, pos) + s.substr(pos + 1) + string(n + pos + 1 - s.size(), '0'));\\n}\\n \\nlong long ceildiv(long long a, long long b) {\\n if (b < 0) a = -a, b = -b;\\n if (a >= 0) return (a + b - 1) / b;\\n else return a / b;\\n}\\n \\nlong long floordiv(long long a, long long b) {\\n if (b < 0) a = -a, b = -b;\\n if (a >= 0) return a / b;\\n else return (a - b + 1) / b;\\n}\\n \\nlong long floorsqrt(long long x) {\\n assert(x >= 0);\\n long long ok = 0;\\n long long ng = 1;\\n while (ng * ng <= x) ng <<= 1;\\n while (ng - ok > 1) {\\n long long mid = (ng + ok) >> 1;\\n if (mid * mid <= x) ok = mid;\\n else ng = mid;\\n }\\n return ok;\\n}\\n\\ninline int topbit(unsigned long long x){\\n\\treturn x?63-__builtin_clzll(x):-1;\\n}\\n\\ninline int popcount(unsigned long long x){\\n\\treturn __builtin_popcountll(x);\\n}\\n\\ninline int parity(unsigned long long x){//popcount%2\\n\\treturn __builtin_parity(x);\\n}\\n\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n\\nvoid main_() {\\n ll n,k,s;\\n cin >> n >> k >> s;\\n VVV<ll> dp(11,VV<ll>(160,V<ll>(160)));\\n \\n while(n!=0){\\n REP(i,11)REP(j,160)REP(K,160) dp[i][j][K] = 0;\\n dp[0][0][0] = 1;\\n REP(i,k){\\n REP(j,160)REP(a,s+1){\\n for(ll b = j+1;b <= n;b++){\\n if(a + b > s)break;\\n dp[i+1][b][a + b] += dp[i][j][a];\\n }\\n }\\n }\\n ll ans = 0;\\n \\n REP(i,160){\\n ans += dp[k][i][s];\\n }\\n cout << ans << endl;\\n cin >> n >> k >> s;\\n }\\n}\\n \\nint main() {\\n\\tint t = 1;\\n\\t//cin >> t;\\n\\twhile(t--) main_();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5544,\n \"score_of_the_acc\": -0.5186,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1335_5289469\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)\\n#define itn int\\n#define miele(v) min_element(v.begin(), v.end())\\n#define maele(v) max_element(v.begin(), v.end())\\n#define SUM(v) accumulate(v.begin(), v.end(), 0LL)\\n#define lb(a, key) lower_bound(a.begin(),a.end(),key)\\n#define ub(a, key) upper_bound(a.begin(),a.end(),key)\\n#define COUNT(a, key) count(a.begin(), a.end(), key) \\n#define BITCOUNT(x) __builtin_popcount(x)\\n#define pb push_back\\n#define all(x) (x).begin(),(x).end()\\n#define F first\\n#define S second\\nusing P = pair <int,int>;\\nusing WeightedGraph = vector<vector <P>>;\\nusing UnWeightedGraph = vector<vector<int>>;\\nusing Real = long double;\\nusing Point = complex<Real>; //Point and Vector2d is the same!\\nusing Vector2d = complex<Real>;\\nconst long long INF = 1LL << 60;\\nconst int MOD = 1000000007;\\nconst double EPS = 1e-15;\\nconst double PI=3.14159265358979323846;\\ntemplate <typename T> \\nint getIndexOfLowerBound(vector <T> &v, T x){\\n return lower_bound(v.begin(),v.end(),x)-v.begin();\\n}\\ntemplate <typename T> \\nint getIndexOfUpperBound(vector <T> &v, T x){\\n return upper_bound(v.begin(),v.end(),x)-v.begin();\\n}\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\n#define DUMPOUT cerr\\n#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b; is >> a >> b; p = Point(a, b); return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T,U> &p_var) {\\n is >> p_var.first >> p_var.second;\\n return is;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (T &x : vec) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, pair<T, U> &pair_var) {\\n DUMPOUT<<'{';\\n os << pair_var.first;\\n DUMPOUT<<',';\\n os << \\\" \\\"<< pair_var.second;\\n DUMPOUT<<'}';\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, vector<T> &vec) {\\n DUMPOUT<<'[';\\n for (int i = 0; i < vec.size(); i++) \\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n DUMPOUT<<']';\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, vector<vector<T>> &df) {\\n for (auto& vec : df) os<<vec;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, map<T, U> &map_var) {\\n DUMPOUT << \\\"{\\\";\\n repi(itr, map_var) {\\n os << *itr;\\n itr++;\\n if (itr != map_var.end()) DUMPOUT << \\\", \\\";\\n itr--;\\n }\\n DUMPOUT << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T>\\nostream &operator<<(ostream &os, set<T> &set_var) {\\n DUMPOUT << \\\"{\\\";\\n repi(itr, set_var) {\\n os << *itr;\\n itr++;\\n if (itr != set_var.end()) DUMPOUT << \\\", \\\";\\n itr--;\\n }\\n DUMPOUT << \\\"}\\\";\\n return os;\\n}\\nvoid print() {cout << endl;}\\ntemplate <class Head, class... Tail>\\nvoid print(Head&& head, Tail&&... tail) {\\n cout << head;\\n if (sizeof...(tail) != 0) cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\nvoid dump_func() {DUMPOUT << '#'<<endl;}\\ntemplate <typename Head, typename... Tail>\\nvoid dump_func(Head &&head, Tail &&... tail) {\\n DUMPOUT << head;\\n if (sizeof...(Tail) > 0) DUMPOUT << \\\", \\\";\\n dump_func(std::move(tail)...);\\n}\\n#ifdef DEBUG_\\n#define DEB\\n#define dump(...) \\\\\\n DUMPOUT << \\\" \\\" << string(#__VA_ARGS__) << \\\": \\\" \\\\\\n << \\\"[\\\" << to_string(__LINE__) << \\\":\\\" << __FUNCTION__ << \\\"]\\\" \\\\\\n << endl \\\\\\n << \\\" \\\", \\\\\\n dump_func(__VA_ARGS__)\\n#else\\n#define DEB if (false)\\n#define dump(...)\\n#endif\\n\\nsigned main(void) { cin.tie(0); ios::sync_with_stdio(false);\\n int t = 0;\\n while(1) {\\n int n, k, s; cin>>n>>k>>s;\\n if(n == 0) exit(0);\\n \\n int ans = 0;\\n int bit;\\n for(bit=0;bit<(1<<n);bit++){\\n int cnt = 0;\\n int sum = 0;\\n for(int i=0;i<n;i++){\\n if(bit&(1<<i)){\\n cnt++;\\n sum += i+1;\\n }\\n }\\n if(cnt == k && sum == s) {\\n ans++;\\n }\\n }\\n \\n print(ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.4248,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1335_5283700\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n while(1){\\n ll n,k,s; cin >> n >> k >> s;\\n if(n == 0) break;\\n int ans = 0;\\n rep(i,1<<n){\\n if(__builtin_popcount(i) != k) continue;\\n ll cur = 0;\\n rep(j,n) if(i & (1 << j)) cur += j + 1;\\n if(cur == s) ans++;\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.0428,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1335_4965186\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main()\\n{\\n int n,k,s;\\n while(cin>>n>>k>>s,n){\\n int ans=0;\\n for(int i=0;i<(1<<n);++i){\\n int m=0,c=0;\\n for(int j=0;j<n;++j){\\n if(i&(1<<j)){\\n m+=j+1;\\n c++;\\n }\\n }\\n if(c==k && m==s)ans++;\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.3776,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1335_4929431\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % MOD;\\n x = x * x % MOD;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n template<class t>\\n void output(t a){\\n if(was_output)cout << \\\" \\\";\\n cout << a;\\n was_output = true;\\n }\\n void outendl(){\\n was_output = false;\\n cout << endl;\\n }\\n ll in(){\\n ll res;\\n scanf(\\\"%lld\\\", &res);\\n return res;\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n void out(t x){\\n cout << x;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n}\\n\\nusing namespace templates;\\n\\nint func(int n,int k,int s){\\n method(func,int,int place,int sum,int used){\\n if(used > k)return 0;\\n if(sum > s)return 0;\\n if(place == n+1){\\n return sum == s and k == used;\\n }\\n int res = 0;\\n res += func(place+1,sum+place,used+1);\\n res += func(place+1,sum,used);\\n return res;\\n };\\n return func(1,0,0);\\n}\\n\\nint main(){\\n while(true){\\n int n = in();\\n int k = in();\\n int s = in();\\n if(n==0)break;\\n cout << func(n,k,s) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.048,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1335_4927509\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing ll = long long;\\n#define var auto\\n\\nusing namespace std;\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){ if (a > b) a = b; }\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){ if (a < b) a = b; }\\n\\nint main(){\\n int n, k, s;\\n cin >> n >> k >> s;\\n if (n == 0) return 0;\\n int res = 0;\\n for (int i = 0; i < (1 << n); i++){\\n int sum = 0;\\n int count = 0;\\n for (int j = 0; j < n; j++){\\n if (!(i >> j & 1)) continue;\\n sum += (j + 1);\\n count++;\\n }\\n if (sum == s && count == k) res++;\\n }\\n cout << res << endl;\\n main();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 3040,\n \"score_of_the_acc\": -0.3684,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":786,"cells":{"group_id":{"kind":"string","value":"aoj_1329_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nSliding Block Puzzle\nIn sliding block puzzles, we repeatedly slide pieces (blocks) to open spaces within a frame to establish a goal placement of pieces.\nA puzzle creator has designed a new puzzle by combining the ideas of sliding block puzzles and mazes. The puzzle is played in a rectangular frame segmented into unit squares. Some squares are pre-occupied by obstacles. There are a number of pieces placed in the frame, one 2 × 2 king piece and some number of 1 × 1 pawn pieces. Exactly two 1 × 1 squares are left open. If a pawn piece is adjacent to an open square, we can slide the piece there. If a whole edge of the king piece is adjacent to two open squares, we can slide the king piece. We cannot move the obstacles. Starting from a given initial placement, the objective of the puzzle is to move the king piece to the upper-left corner of the frame.\nThe following figure illustrates the initial placement of the fourth dataset of the sample input.\nFigure E.1: The fourth dataset of the sample input.\nYour task is to write a program that computes the minimum number of moves to solve the puzzle from a given placement of pieces. Here, one move means sliding either king or pawn piece to an adjacent position.\nInput\nThe input is a sequence of datasets. The first line of a dataset consists of two integers\nH\nand\nW\nseparated by a space, where\nH\nand\nW\nare the height and the width of the frame. The following\nH\nlines, each consisting of\nW\ncharacters, denote the initial placement of pieces. In those\nH\nlines, '\nX\n', '\no\n', '\n*\n', and '\n.\n' denote a part of the king piece, a pawn piece, an obstacle, and an open square, respectively. There are no other characters in those\nH\nlines. You may assume that 3 ≤\nH\n≤ 50 and 3 ≤\nW\n≤ 50.\nA line containing two zeros separated by a space indicates the end of the input.\nOutput\nFor each dataset, output a line containing the minimum number of moves required to move the king piece to the upper-left corner. If there is no way to do so, output\n-1\n.\nSample Input\n3 3\noo.\noXX\n.XX\n3 3\nXXo\nXX.\no.o\n3 5\n.o*XX\noooXX\noooo.\n7 12\noooooooooooo\nooooo*****oo\noooooo****oo\no**ooo***ooo\no***ooooo..o\no**ooooooXXo\nooooo****XXo\n5 30\noooooooooooooooooooooooooooooo\noooooooooooooooooooooooooooooo\no***************************oo\nXX.ooooooooooooooooooooooooooo\nXX.ooooooooooooooooooooooooooo\n0 0\nOutput for the Sample Input\n11\n0\n-1\n382\n6807"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1329_10853885","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<queue>\n#include<iostream>\nusing namespace std;\nconst int inf=0x3f3f3f3f;\nconst int maxn=60;\nint n,m;\nchar mp[maxn][maxn];\nconst int cx[]={-1,-1,0,1,2,2,0,1};\nconst int cy[]={0,1,2,2,0,1,-1,-1};\nstruct ty\n{\n int x,y,d,c;\n ty(int x=0,int y=0,int d=0,int c=0):x(x),y(y),d(d),c(c){}\n inline bool in_range()\n {\n return x>=0&&x<n&&y>=0&&y<m;\n }\n ty p1()\n {\n return ty(x+cx[d<<1],y+cy[d<<1],0,0);\n }\n ty p2()\n {\n return ty(x+cx[(d<<1)^1],y+cy[(d<<1)^1],0,0);\n }\n void putit()\n {\n printf(\"state:%d %d %d %d\\n\",x,y,d,c);\n }\n}st,p1,p2;\nconst int dx[]={0,0,-1,1};\nconst int dy[]={1,-1,0,0};\nint p2p(ty st,ty en,ty king)\n{\n if (!st.in_range()) return inf;\n if (!en.in_range()) return inf;\n queue<ty> qq;\n bool vis[maxn][maxn];\n memset(vis,0,sizeof(vis));\n qq.push(st);\n st.c=0;\n vis[st.x][st.y]=1;\n while (!qq.empty())\n {\n ty now=qq.front();\n qq.pop();\n if (now.x==en.x&&now.y==en.y) return now.c;\n for (int i=0;i<4;i++)\n {\n ty exp(now.x+dx[i],now.y+dy[i],0,now.c+1);\n if (exp.in_range()&&mp[exp.x][exp.y]!='*'&&(exp.x<king.x||exp.x>king.x+1||exp.y<king.y||exp.y>king.y+1)&&!vis[exp.x][exp.y])\n {\n vis[exp.x][exp.y]=1;\n qq.push(exp);\n }\n }\n }\n return inf;\n}\nqueue<ty> q;\nint cost[maxn][maxn][4];\nvoid BFS()\n{\n memset(cost,-1,sizeof(cost));\n if (st.x==0&&st.y==0)\n {\n cost[0][0][0]=0;\n return;\n }\n for (int i=0;i<4;i++)\n {\n st.d=i;\n int c1=p2p(p1,st.p1(),st);\n int c2=p2p(p2,st.p2(),st);\n int c3=p2p(p2,st.p1(),st);\n int c4=p2p(p1,st.p2(),st);\n st.c=min(c1+c2,c3+c4);\n if (st.c<inf)\n {\n q.push(st);\n cost[st.x][st.y][st.d]=st.c;\n }\n }\n while (!q.empty())\n {\n ty now=q.front();\n q.pop();\n if (now.c!=cost[now.x][now.y][now.d]) continue;\n for (int i=0;i<4;i++)\n {\n ty exp=now;\n exp.d=i;\n int c1=p2p(now.p1(),exp.p1(),now);\n int c2=p2p(now.p2(),exp.p2(),now);\n int c3=p2p(now.p1(),exp.p2(),now);\n int c4=p2p(now.p2(),exp.p1(),now);\n exp.c=now.c+min(c1+c2,c3+c4);\n int &c=cost[exp.x][exp.y][exp.d];\n if (exp.c<inf&&(c==-1||exp.c<c))\n {\n c=exp.c;\n q.push(exp);\n }\n }\n ty exp;\n switch (now.d)\n {\n case 0:exp=ty(now.x-1,now.y,2,now.c+1);break;\n case 1:exp=ty(now.x,now.y+1,3,now.c+1);break;\n case 2:exp=ty(now.x+1,now.y,0,now.c+1);break;\n case 3:exp=ty(now.x,now.y-1,1,now.c+1);break;\n }\n if (exp.in_range())\n {\n int &c=cost[exp.x][exp.y][exp.d];\n if (c==-1||exp.c<c)\n {\n c=exp.c;\n q.push(exp);\n }\n }\n }\n}\nint main()\n{\n while (~scanf(\"%d%d\",&n,&m)&&(n||m))\n {\n for (int i=0;i<n;i++) scanf(\"%s\",mp[i]);\n st.x=p1.x=-1;\n for (int i=0;i<n;i++)\n for (int j=0;j<m;j++)\n if (mp[i][j]=='X'&&st.x==-1)\n {\n st.x=i;\n st.y=j;\n st.c=0;\n }\n else if (mp[i][j]=='.')\n {\n if (p1.x==-1) p1.x=i,p1.y=j;\n else p2.x=i,p2.y=j;\n }\n BFS();\n int ans=-1;\n for (int i=0;i<4;i++)\n if (ans==-1||(cost[0][0][i]!=-1&&cost[0][0][i]<ans))\n ans=cost[0][0][i];\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":750,"memory_kb":3620,"score_of_the_acc":-0.7911,"final_rank":8},{"submission_id":"aoj_1329_9791572","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\nint nx[4][2] = {{2,2},{0,1},{-1,-1},{0,1}}, ny[4][2] = {{0,1},{2,2},{0,1},{-1,-1}};\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0) return 0;\n int SX = inf, SY = inf;\n vector<pair<int,int>> Open;\n vector<vector<bool>> B(N,vector<bool>(M));\n rep(i,0,N) {\n rep(j,0,M) {\n char C;\n cin >> C;\n if (C == '*') B[i][j] = false;\n else B[i][j] = true;\n if (C == 'X') chmin(SX,i), chmin(SY,j);\n if (C == '.') Open.push_back({i,j});\n }\n }\n if (SX == 0 && SY == 0) {\n cout << 0 << endl;\n continue;\n }\n auto canput = [&](int i, int j) -> bool {\n if (i < 0 || i+1 >= N || j < 0 || j+1 >= M) return false;\n return B[i][j] && B[i][j+1] && B[i+1][j] && B[i+1][j+1];\n };\n auto canmove = [&](int i, int j, int k) -> bool {\n rep(l,0,2) {\n int ni = i + nx[k][l], nj = j + ny[k][l];\n if (ni < 0 || N <= ni || nj < 0 || M <= nj) return false;\n if (!B[ni][nj]) false;\n }\n return true;\n };\n auto MakeDist = [&](int i, int j) -> vector<vector<int>> {\n vector<vector<int>> DP(N,vector<int>(M,inf));\n if (!B[i][j]) return DP;\n DP[i][j] = 0;\n queue<pair<int,int>> Q;\n Q.push({i,j});\n while(!Q.empty()) {\n auto [CurX, CurY] = Q.front();\n Q.pop();\n rep(k,0,4) {\n int NX = CurX + dx[k], NY = CurY + dy[k];\n if (NX < 0 || N <= NX || NY < 0 || M <= NY) continue;\n if (!B[NX][NY]) continue;\n if (chmin(DP[NX][NY],DP[CurX][CurY]+1)) {\n Q.push({NX,NY});\n }\n }\n }\n return DP;\n };\n vector Dist(N-1, vector(M-1, vector(4, vector<int>(4,inf))));\n vector ANS(N-1, vector(M-1, vector(4, inf)));\n rep(i,0,N-1) {\n rep(j,0,M-1) {\n if (!canput(i,j)) continue;\n rep(k,0,2) {\n rep(l,0,2) {\n B[i+k][j+l] = false;\n }\n }\n rep(k,0,4) {\n if (!canmove(i,j,k)) continue;\n pair<int,int> P0 = {i+nx[k][0],j+ny[k][0]}, P1 = {i+nx[k][1],j+ny[k][1]};\n auto DP0 = MakeDist(P0.first,P0.second), DP1 = MakeDist(P1.first,P1.second);\n if (i == SX && j == SY) {\n chmin(ANS[i][j][k], DP0[Open[0].first][Open[0].second] + DP1[Open[1].first][Open[1].second]);\n chmin(ANS[i][j][k], DP0[Open[1].first][Open[1].second] + DP1[Open[0].first][Open[0].second]);\n }\n rep(l,0,4) {\n if (!canmove(i,j,l)) continue;\n if (k == l) {\n Dist[i][j][k][l] = 0;\n continue;\n }\n pair<int,int> Q0 = {i+nx[l][0],j+ny[l][0]}, Q1 = {i+nx[l][1],j+ny[l][1]};\n chmin(Dist[i][j][k][l],DP0[Q0.first][Q0.second]+DP1[Q1.first][Q1.second]);\n chmin(Dist[i][j][k][l],DP0[Q1.first][Q1.second]+DP1[Q0.first][Q0.second]);\n }\n }\n rep(k,0,2) {\n rep(l,0,2) {\n B[i+k][j+l] = true;\n }\n }\n }\n }\n priority_queue<pair<int,tuple<int,int,int>>,vector<pair<int,tuple<int,int,int>>>,greater<pair<int,tuple<int,int,int>>>> PQ;\n rep(i,0,4) {\n if (ANS[SX][SY][i] < inf) {\n PQ.push({ANS[SX][SY][i],{SX,SY,i}});\n }\n }\n while(!PQ.empty()) {\n auto [D,TUPLE] = PQ.top();\n PQ.pop();\n auto [X,Y,Dir] = TUPLE;\n if (D > ANS[X][Y][Dir]) continue;\n if (chmin(ANS[X+dx[Dir]][Y+dy[Dir]][Dir^2], D+1)) {\n PQ.push({D+1,{X+dx[Dir],Y+dy[Dir],Dir^2}});\n }\n rep(i,0,4) {\n if (chmin(ANS[X][Y][i],D+Dist[X][Y][Dir][i])) {\n PQ.push({ANS[X][Y][i],{X,Y,i}});\n }\n }\n }\n int ANS2 = inf;\n rep(i,0,4) chmin(ANS2, ANS[0][0][i]);\n if (ANS2 == inf) cout << -1 << endl;\n else cout << ANS2 << endl;\n}\n}","accuracy":1,"time_ms":740,"memory_kb":3736,"score_of_the_acc":-1,"final_rank":13},{"submission_id":"aoj_1329_8862217","code_snippet":"#include <iostream>\n#include <queue>\n#include <vector>\n#include <algorithm>\n#include <string>\n\nusing namespace std;\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nconst int MAX_FIELD_SIZE = 60;\nconst int MAX_DIRECTIONS = 4;\nconst int INFINITE_DISTANCE = 999999;\n\nstruct aa {\n int x;\n int y;\n int turn;\n};\n\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = INFINITE_DISTANCE;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), INFINITE_DISTANCE));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < MAX_DIRECTIONS; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\n\nint main() {\n int memo2[MAX_FIELD_SIZE][MAX_FIELD_SIZE][MAX_DIRECTIONS];\n while (1) {\n for (int i = 0; i < MAX_FIELD_SIZE; ++i) {\n for (int j = 0; j < MAX_FIELD_SIZE; ++j) {\n for (int k = 0; k < MAX_DIRECTIONS; ++k) {\n memo2[i][j][k] = INFINITE_DISTANCE;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < MAX_DIRECTIONS; ++way) {\n int amin = INFINITE_DISTANCE;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % MAX_DIRECTIONS];\n gy += dy[(way + 1) % MAX_DIRECTIONS];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < MAX_DIRECTIONS; ++tway) {\n if (fway == tway)\n continue;\n int amin = INFINITE_DISTANCE;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % MAX_DIRECTIONS];\n gy += dy[(tway + 1) % MAX_DIRECTIONS];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % MAX_DIRECTIONS];\n fy += dy[(fway + 1) % MAX_DIRECTIONS];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % MAX_DIRECTIONS;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1090,"memory_kb":3512,"score_of_the_acc":-0.8452,"final_rank":9},{"submission_id":"aoj_1329_8820069","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <string>\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nstruct aa {\n int x;\n int y;\n int turn;\n};\n\nint getdis(const std::vector<std::vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n std::queue<aa> que;\n std::vector<std::vector<int>> memo(field.size(), std::vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\n\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint memo2[60][60][4];\n\nint main() {\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n\n // Init variables here\n int H, W;\n std::cin >> H >> W;\n\n if (!H)\n break;\n\n std::vector<std::vector<int>> field(H + 2, std::vector<int>(W + 2, true));\n std::priority_queue<bb, std::vector<bb>, Compare> que;\n\n // Reduction scope of variables\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n\n for (int i = 0; i < H; ++i) {\n std::string st;\n std::cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = std::min(kx, j + 1);\n ky = std::min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n\n if (kx == 1 && ky == 1) {\n std::cout << 0 << '\\n';\n continue;\n }\n\n for (int way = 0; way < 4; ++way) {\n // Init variables here\n int amin = 999999;\n bool ok = true;\n\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n\n if (field[gy][gx])\n ok = false;\n\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n\n atime += getdis(field, fx, fy, gx, gy);\n\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n\n amin = std::min(amin, atime);\n }\n\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n\n // Init variables here\n int ans = -1;\n\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n\n // Init variables here\n int amin = 999999;\n bool ok = true;\n\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n\n if (field[gy][gx])\n ok = false;\n\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n\n atime += getdis(field, fx, fy, gx, gy);\n\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n\n amin = std::min(amin, atime);\n }\n\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n\n std::cout << ans << '\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":1090,"memory_kb":3316,"score_of_the_acc":-0.4796,"final_rank":5},{"submission_id":"aoj_1329_8808049","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <string>\nusing namespace std;\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nstruct aa {\n int x;\n int y;\n int turn;\n};\n\nint getdis(vector<vector<bool>> field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\n\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint memo2[60][60][4];\n\nint main() {\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<bool>> field(H + 2, vector<bool>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2070,"memory_kb":3204,"score_of_the_acc":-1.0075,"final_rank":14},{"submission_id":"aoj_1329_8215731","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[52][52][4];\nint main() {\n while (1) {\n for (int i = 0; i < 52; ++i) {\n for (int j = 0; j < 52; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1070,"memory_kb":3256,"score_of_the_acc":-0.3526,"final_rank":4},{"submission_id":"aoj_1329_8215727","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[60][60][4];\nint main() {\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1060,"memory_kb":3200,"score_of_the_acc":-0.2406,"final_rank":1},{"submission_id":"aoj_1329_8116085","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nstruct aa {\n int x, y, turn;\n};\n\nint getdis(const vector<vector<int>> &field, const int fx, const int fy, const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push({fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push({nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\n\nstruct bb {\n int kx, ky, opway, turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint memo2[60][60][4];\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n\n while (true) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H) break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << '\\n';\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx]) ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok) continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push({kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway) continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx]) ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok) continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push({fkx, fky, tway, fturn + amin});\n }\n }\n }\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push({nkx, nky, nway, fturn + 1});\n }\n }\n cout << ans << '\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":1060,"memory_kb":3416,"score_of_the_acc":-0.6436,"final_rank":6},{"submission_id":"aoj_1329_8116084","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[60][60][4];\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1070,"memory_kb":3224,"score_of_the_acc":-0.2929,"final_rank":3},{"submission_id":"aoj_1329_8116081","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n memo[fy][fx] = 0;\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[60][60][4];\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1080,"memory_kb":3536,"score_of_the_acc":-0.8825,"final_rank":10},{"submission_id":"aoj_1329_8116078","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nstruct aa {\n int x, y, turn;\n};\n\nint getdis(const vector<vector<int>> &field, const int fx, const int fy, const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n\n return ans;\n}\n\nstruct bb {\n int kx, ky, opway, turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint memo2[60][60][4];\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n\n while (true) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n\n int H, W;\n cin >> H >> W;\n if (!H) break;\n\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx]) ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok) continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n\n int ans = -1;\n\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway) continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx]) ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok) continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":1070,"memory_kb":3448,"score_of_the_acc":-0.7108,"final_rank":7},{"submission_id":"aoj_1329_8116074","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\n\nstruct aa {\n int x;\n int y;\n int turn;\n};\n\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\n\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\n\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\n\nint memo2[60][60][4];\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n while (true) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H) break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1070,"memory_kb":3216,"score_of_the_acc":-0.278,"final_rank":2},{"submission_id":"aoj_1329_8113070","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[60][60][4];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1090,"memory_kb":3540,"score_of_the_acc":-0.8975,"final_rank":11},{"submission_id":"aoj_1329_8113068","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nconst int dx[4] = {-1, 0, 1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[4] = {-1, 0, 2, 1};\nconst int dy2[4] = {0, 2, 1, -1};\nstruct aa {\n int x;\n int y;\n int turn;\n};\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\n const int gx, const int gy) {\n int ans = 999999;\n queue<aa> que;\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\n que.push(aa{fx, fy, 0});\n while (!que.empty()) {\n aa atop(que.front());\n que.pop();\n if (atop.x == gx && atop.y == gy) {\n ans = atop.turn;\n break;\n }\n for (int i = 0; i < 4; ++i) {\n const int nextx = atop.x + dx[i];\n const int nexty = atop.y + dy[i];\n if (!field[nexty][nextx]) {\n if (atop.turn + 1 < memo[nexty][nextx]) {\n memo[nexty][nextx] = atop.turn + 1;\n que.push(aa{nextx, nexty, atop.turn + 1});\n }\n }\n }\n }\n return ans;\n}\nstruct bb {\n int kx;\n int ky;\n int opway;\n int turn;\n};\nclass Compare {\npublic:\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\n};\nint memo2[60][60][4];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (1) {\n for (int i = 0; i < 60; ++i) {\n for (int j = 0; j < 60; ++j) {\n for (int k = 0; k < 4; ++k) {\n memo2[i][j][k] = 999999;\n }\n }\n }\n int H, W;\n cin >> H >> W;\n if (!H)\n break;\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\n priority_queue<bb, vector<bb>, Compare> que;\n {\n int kx = 99, ky = 99;\n int ox[2];\n int oy[2];\n int num = 0;\n for (int i = 0; i < H; ++i) {\n string st;\n cin >> st;\n for (int j = 0; j < W; ++j) {\n if (st[j] == 'X') {\n kx = min(kx, j + 1);\n ky = min(ky, i + 1);\n field[i + 1][j + 1] = false;\n } else if (st[j] == 'o') {\n field[i + 1][j + 1] = false;\n } else if (st[j] == '.') {\n field[i + 1][j + 1] = false;\n ox[num] = j + 1;\n oy[num] = i + 1;\n num++;\n }\n }\n }\n if (kx == 1 && ky == 1) {\n cout << 0 << endl;\n continue;\n }\n for (int way = 0; way < 4; ++way) {\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n const int fx = ox[op ^ lu];\n const int fy = oy[op ^ lu];\n int gx = kx + dx2[way];\n int gy = ky + dy2[way];\n if (lu == 1) {\n gx += dx[(way + 1) % 4];\n gy += dy[(way + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[ky + ay][kx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n memo2[kx][ky][way] = amin;\n que.push(bb{kx, ky, way, amin});\n }\n }\n }\n int ans = -1;\n while (!que.empty()) {\n bb atop(que.top());\n que.pop();\n const int fkx = atop.kx;\n const int fky = atop.ky;\n const int fway = atop.opway;\n const int fturn = atop.turn;\n if (fkx == 1 && fky == 1) {\n ans = fturn;\n break;\n }\n for (int tway = 0; tway < 4; ++tway) {\n if (fway == tway)\n continue;\n int amin = 999999;\n bool ok = true;\n for (int op = 0; op < 2; ++op) {\n int atime = 0;\n for (int lu = 0; lu < 2; ++lu) {\n int fx = fkx + dx2[fway];\n int fy = fky + dy2[fway];\n int gx = fkx + dx2[tway];\n int gy = fky + dy2[tway];\n if (lu == 1) {\n gx += dx[(tway + 1) % 4];\n gy += dy[(tway + 1) % 4];\n }\n if (op ^ lu) {\n fx += dx[(fway + 1) % 4];\n fy += dy[(fway + 1) % 4];\n }\n if (field[gy][gx])\n ok = false;\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = true;\n }\n }\n atime += getdis(field, fx, fy, gx, gy);\n for (int ax = 0; ax < 2; ++ax) {\n for (int ay = 0; ay < 2; ++ay) {\n field[fky + ay][fkx + ax] = false;\n }\n }\n }\n amin = min(amin, atime);\n }\n if (!ok)\n continue;\n else {\n if (memo2[fkx][fky][tway] > fturn + amin) {\n memo2[fkx][fky][tway] = fturn + amin;\n que.push(bb{fkx, fky, tway, fturn + amin});\n }\n }\n }\n {\n const int nkx = fkx + dx[fway];\n const int nky = fky + dy[fway];\n const int nway = (fway + 2) % 4;\n if (memo2[nkx][nky][nway] > fturn + 1) {\n memo2[nkx][nky][nway] = fturn + 1;\n que.push(bb{nkx, nky, nway, fturn + 1});\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1100,"memory_kb":3536,"score_of_the_acc":-0.8975,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_1329_10853885\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<queue>\\n#include<iostream>\\nusing namespace std;\\nconst int inf=0x3f3f3f3f;\\nconst int maxn=60;\\nint n,m;\\nchar mp[maxn][maxn];\\nconst int cx[]={-1,-1,0,1,2,2,0,1};\\nconst int cy[]={0,1,2,2,0,1,-1,-1};\\nstruct ty\\n{\\n int x,y,d,c;\\n ty(int x=0,int y=0,int d=0,int c=0):x(x),y(y),d(d),c(c){}\\n inline bool in_range()\\n {\\n return x>=0&&x<n&&y>=0&&y<m;\\n }\\n ty p1()\\n {\\n return ty(x+cx[d<<1],y+cy[d<<1],0,0);\\n }\\n ty p2()\\n {\\n return ty(x+cx[(d<<1)^1],y+cy[(d<<1)^1],0,0);\\n }\\n void putit()\\n {\\n printf(\\\"state:%d %d %d %d\\\\n\\\",x,y,d,c);\\n }\\n}st,p1,p2;\\nconst int dx[]={0,0,-1,1};\\nconst int dy[]={1,-1,0,0};\\nint p2p(ty st,ty en,ty king)\\n{\\n if (!st.in_range()) return inf;\\n if (!en.in_range()) return inf;\\n queue<ty> qq;\\n bool vis[maxn][maxn];\\n memset(vis,0,sizeof(vis));\\n qq.push(st);\\n st.c=0;\\n vis[st.x][st.y]=1;\\n while (!qq.empty())\\n {\\n ty now=qq.front();\\n qq.pop();\\n if (now.x==en.x&&now.y==en.y) return now.c;\\n for (int i=0;i<4;i++)\\n {\\n ty exp(now.x+dx[i],now.y+dy[i],0,now.c+1);\\n if (exp.in_range()&&mp[exp.x][exp.y]!='*'&&(exp.x<king.x||exp.x>king.x+1||exp.y<king.y||exp.y>king.y+1)&&!vis[exp.x][exp.y])\\n {\\n vis[exp.x][exp.y]=1;\\n qq.push(exp);\\n }\\n }\\n }\\n return inf;\\n}\\nqueue<ty> q;\\nint cost[maxn][maxn][4];\\nvoid BFS()\\n{\\n memset(cost,-1,sizeof(cost));\\n if (st.x==0&&st.y==0)\\n {\\n cost[0][0][0]=0;\\n return;\\n }\\n for (int i=0;i<4;i++)\\n {\\n st.d=i;\\n int c1=p2p(p1,st.p1(),st);\\n int c2=p2p(p2,st.p2(),st);\\n int c3=p2p(p2,st.p1(),st);\\n int c4=p2p(p1,st.p2(),st);\\n st.c=min(c1+c2,c3+c4);\\n if (st.c<inf)\\n {\\n q.push(st);\\n cost[st.x][st.y][st.d]=st.c;\\n }\\n }\\n while (!q.empty())\\n {\\n ty now=q.front();\\n q.pop();\\n if (now.c!=cost[now.x][now.y][now.d]) continue;\\n for (int i=0;i<4;i++)\\n {\\n ty exp=now;\\n exp.d=i;\\n int c1=p2p(now.p1(),exp.p1(),now);\\n int c2=p2p(now.p2(),exp.p2(),now);\\n int c3=p2p(now.p1(),exp.p2(),now);\\n int c4=p2p(now.p2(),exp.p1(),now);\\n exp.c=now.c+min(c1+c2,c3+c4);\\n int &c=cost[exp.x][exp.y][exp.d];\\n if (exp.c<inf&&(c==-1||exp.c<c))\\n {\\n c=exp.c;\\n q.push(exp);\\n }\\n }\\n ty exp;\\n switch (now.d)\\n {\\n case 0:exp=ty(now.x-1,now.y,2,now.c+1);break;\\n case 1:exp=ty(now.x,now.y+1,3,now.c+1);break;\\n case 2:exp=ty(now.x+1,now.y,0,now.c+1);break;\\n case 3:exp=ty(now.x,now.y-1,1,now.c+1);break;\\n }\\n if (exp.in_range())\\n {\\n int &c=cost[exp.x][exp.y][exp.d];\\n if (c==-1||exp.c<c)\\n {\\n c=exp.c;\\n q.push(exp);\\n }\\n }\\n }\\n}\\nint main()\\n{\\n while (~scanf(\\\"%d%d\\\",&n,&m)&&(n||m))\\n {\\n for (int i=0;i<n;i++) scanf(\\\"%s\\\",mp[i]);\\n st.x=p1.x=-1;\\n for (int i=0;i<n;i++)\\n for (int j=0;j<m;j++)\\n if (mp[i][j]=='X'&&st.x==-1)\\n {\\n st.x=i;\\n st.y=j;\\n st.c=0;\\n }\\n else if (mp[i][j]=='.')\\n {\\n if (p1.x==-1) p1.x=i,p1.y=j;\\n else p2.x=i,p2.y=j;\\n }\\n BFS();\\n int ans=-1;\\n for (int i=0;i<4;i++)\\n if (ans==-1||(cost[0][0][i]!=-1&&cost[0][0][i]<ans))\\n ans=cost[0][0][i];\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.7911,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1329_9791572\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\\nint nx[4][2] = {{2,2},{0,1},{-1,-1},{0,1}}, ny[4][2] = {{0,1},{2,2},{0,1},{-1,-1}};\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0) return 0;\\n int SX = inf, SY = inf;\\n vector<pair<int,int>> Open;\\n vector<vector<bool>> B(N,vector<bool>(M));\\n rep(i,0,N) {\\n rep(j,0,M) {\\n char C;\\n cin >> C;\\n if (C == '*') B[i][j] = false;\\n else B[i][j] = true;\\n if (C == 'X') chmin(SX,i), chmin(SY,j);\\n if (C == '.') Open.push_back({i,j});\\n }\\n }\\n if (SX == 0 && SY == 0) {\\n cout << 0 << endl;\\n continue;\\n }\\n auto canput = [&](int i, int j) -> bool {\\n if (i < 0 || i+1 >= N || j < 0 || j+1 >= M) return false;\\n return B[i][j] && B[i][j+1] && B[i+1][j] && B[i+1][j+1];\\n };\\n auto canmove = [&](int i, int j, int k) -> bool {\\n rep(l,0,2) {\\n int ni = i + nx[k][l], nj = j + ny[k][l];\\n if (ni < 0 || N <= ni || nj < 0 || M <= nj) return false;\\n if (!B[ni][nj]) false;\\n }\\n return true;\\n };\\n auto MakeDist = [&](int i, int j) -> vector<vector<int>> {\\n vector<vector<int>> DP(N,vector<int>(M,inf));\\n if (!B[i][j]) return DP;\\n DP[i][j] = 0;\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n while(!Q.empty()) {\\n auto [CurX, CurY] = Q.front();\\n Q.pop();\\n rep(k,0,4) {\\n int NX = CurX + dx[k], NY = CurY + dy[k];\\n if (NX < 0 || N <= NX || NY < 0 || M <= NY) continue;\\n if (!B[NX][NY]) continue;\\n if (chmin(DP[NX][NY],DP[CurX][CurY]+1)) {\\n Q.push({NX,NY});\\n }\\n }\\n }\\n return DP;\\n };\\n vector Dist(N-1, vector(M-1, vector(4, vector<int>(4,inf))));\\n vector ANS(N-1, vector(M-1, vector(4, inf)));\\n rep(i,0,N-1) {\\n rep(j,0,M-1) {\\n if (!canput(i,j)) continue;\\n rep(k,0,2) {\\n rep(l,0,2) {\\n B[i+k][j+l] = false;\\n }\\n }\\n rep(k,0,4) {\\n if (!canmove(i,j,k)) continue;\\n pair<int,int> P0 = {i+nx[k][0],j+ny[k][0]}, P1 = {i+nx[k][1],j+ny[k][1]};\\n auto DP0 = MakeDist(P0.first,P0.second), DP1 = MakeDist(P1.first,P1.second);\\n if (i == SX && j == SY) {\\n chmin(ANS[i][j][k], DP0[Open[0].first][Open[0].second] + DP1[Open[1].first][Open[1].second]);\\n chmin(ANS[i][j][k], DP0[Open[1].first][Open[1].second] + DP1[Open[0].first][Open[0].second]);\\n }\\n rep(l,0,4) {\\n if (!canmove(i,j,l)) continue;\\n if (k == l) {\\n Dist[i][j][k][l] = 0;\\n continue;\\n }\\n pair<int,int> Q0 = {i+nx[l][0],j+ny[l][0]}, Q1 = {i+nx[l][1],j+ny[l][1]};\\n chmin(Dist[i][j][k][l],DP0[Q0.first][Q0.second]+DP1[Q1.first][Q1.second]);\\n chmin(Dist[i][j][k][l],DP0[Q1.first][Q1.second]+DP1[Q0.first][Q0.second]);\\n }\\n }\\n rep(k,0,2) {\\n rep(l,0,2) {\\n B[i+k][j+l] = true;\\n }\\n }\\n }\\n }\\n priority_queue<pair<int,tuple<int,int,int>>,vector<pair<int,tuple<int,int,int>>>,greater<pair<int,tuple<int,int,int>>>> PQ;\\n rep(i,0,4) {\\n if (ANS[SX][SY][i] < inf) {\\n PQ.push({ANS[SX][SY][i],{SX,SY,i}});\\n }\\n }\\n while(!PQ.empty()) {\\n auto [D,TUPLE] = PQ.top();\\n PQ.pop();\\n auto [X,Y,Dir] = TUPLE;\\n if (D > ANS[X][Y][Dir]) continue;\\n if (chmin(ANS[X+dx[Dir]][Y+dy[Dir]][Dir^2], D+1)) {\\n PQ.push({D+1,{X+dx[Dir],Y+dy[Dir],Dir^2}});\\n }\\n rep(i,0,4) {\\n if (chmin(ANS[X][Y][i],D+Dist[X][Y][Dir][i])) {\\n PQ.push({ANS[X][Y][i],{X,Y,i}});\\n }\\n }\\n }\\n int ANS2 = inf;\\n rep(i,0,4) chmin(ANS2, ANS[0][0][i]);\\n if (ANS2 == inf) cout << -1 << endl;\\n else cout << ANS2 << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 3736,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1329_8862217\",\n \"code_snippet\": \"#include <iostream>\\n#include <queue>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n\\nusing namespace std;\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nconst int MAX_FIELD_SIZE = 60;\\nconst int MAX_DIRECTIONS = 4;\\nconst int INFINITE_DISTANCE = 999999;\\n\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\n\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = INFINITE_DISTANCE;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), INFINITE_DISTANCE));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < MAX_DIRECTIONS; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n int memo2[MAX_FIELD_SIZE][MAX_FIELD_SIZE][MAX_DIRECTIONS];\\n while (1) {\\n for (int i = 0; i < MAX_FIELD_SIZE; ++i) {\\n for (int j = 0; j < MAX_FIELD_SIZE; ++j) {\\n for (int k = 0; k < MAX_DIRECTIONS; ++k) {\\n memo2[i][j][k] = INFINITE_DISTANCE;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < MAX_DIRECTIONS; ++way) {\\n int amin = INFINITE_DISTANCE;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % MAX_DIRECTIONS];\\n gy += dy[(way + 1) % MAX_DIRECTIONS];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < MAX_DIRECTIONS; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = INFINITE_DISTANCE;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % MAX_DIRECTIONS];\\n gy += dy[(tway + 1) % MAX_DIRECTIONS];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % MAX_DIRECTIONS];\\n fy += dy[(fway + 1) % MAX_DIRECTIONS];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % MAX_DIRECTIONS;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.8452,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1329_8820069\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\n\\nint getdis(const std::vector<std::vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n std::queue<aa> que;\\n std::vector<std::vector<int>> memo(field.size(), std::vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint memo2[60][60][4];\\n\\nint main() {\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n\\n // Init variables here\\n int H, W;\\n std::cin >> H >> W;\\n\\n if (!H)\\n break;\\n\\n std::vector<std::vector<int>> field(H + 2, std::vector<int>(W + 2, true));\\n std::priority_queue<bb, std::vector<bb>, Compare> que;\\n\\n // Reduction scope of variables\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n\\n for (int i = 0; i < H; ++i) {\\n std::string st;\\n std::cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = std::min(kx, j + 1);\\n ky = std::min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n\\n if (kx == 1 && ky == 1) {\\n std::cout << 0 << '\\\\n';\\n continue;\\n }\\n\\n for (int way = 0; way < 4; ++way) {\\n // Init variables here\\n int amin = 999999;\\n bool ok = true;\\n\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n\\n if (field[gy][gx])\\n ok = false;\\n\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n\\n atime += getdis(field, fx, fy, gx, gy);\\n\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n\\n amin = std::min(amin, atime);\\n }\\n\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n\\n // Init variables here\\n int ans = -1;\\n\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n\\n // Init variables here\\n int amin = 999999;\\n bool ok = true;\\n\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n\\n if (field[gy][gx])\\n ok = false;\\n\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n\\n atime += getdis(field, fx, fy, gx, gy);\\n\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n\\n amin = std::min(amin, atime);\\n }\\n\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n\\n std::cout << ans << '\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.4796,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1329_8808049\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <string>\\nusing namespace std;\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\n\\nint getdis(vector<vector<bool>> field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint memo2[60][60][4];\\n\\nint main() {\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<bool>> field(H + 2, vector<bool>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2070,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -1.0075,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1329_8215731\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[52][52][4];\\nint main() {\\n while (1) {\\n for (int i = 0; i < 52; ++i) {\\n for (int j = 0; j < 52; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.3526,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1329_8215727\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[60][60][4];\\nint main() {\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1060,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.2406,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1329_8116085\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nstruct aa {\\n int x, y, turn;\\n};\\n\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy, const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push({fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push({nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nstruct bb {\\n int kx, ky, opway, turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint memo2[60][60][4];\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n\\n while (true) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H) break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << '\\\\n';\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx]) ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok) continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push({kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway) continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx]) ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok) continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push({fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push({nkx, nky, nway, fturn + 1});\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1060,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.6436,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1329_8116084\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[60][60][4];\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout.tie(NULL);\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.2929,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1329_8116081\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n memo[fy][fx] = 0;\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[60][60][4];\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1080,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.8825,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1329_8116078\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nstruct aa {\\n int x, y, turn;\\n};\\n\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy, const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n\\n return ans;\\n}\\n\\nstruct bb {\\n int kx, ky, opway, turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint memo2[60][60][4];\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout.tie(NULL);\\n\\n while (true) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n\\n int H, W;\\n cin >> H >> W;\\n if (!H) break;\\n\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx]) ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok) continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n\\n int ans = -1;\\n\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway) continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx]) ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok) continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.7108,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1329_8116074\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\n\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\n\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\n\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\n\\nint memo2[60][60][4];\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout.tie(NULL);\\n while (true) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H) break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.278,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1329_8113070\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[60][60][4];\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(0);\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1090,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.8975,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1329_8113068\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nconst int dx[4] = {-1, 0, 1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nconst int dx2[4] = {-1, 0, 2, 1};\\nconst int dy2[4] = {0, 2, 1, -1};\\nstruct aa {\\n int x;\\n int y;\\n int turn;\\n};\\nint getdis(const vector<vector<int>> &field, const int fx, const int fy,\\n const int gx, const int gy) {\\n int ans = 999999;\\n queue<aa> que;\\n vector<vector<int>> memo(field.size(), vector<int>(field[0].size(), 999999));\\n que.push(aa{fx, fy, 0});\\n while (!que.empty()) {\\n aa atop(que.front());\\n que.pop();\\n if (atop.x == gx && atop.y == gy) {\\n ans = atop.turn;\\n break;\\n }\\n for (int i = 0; i < 4; ++i) {\\n const int nextx = atop.x + dx[i];\\n const int nexty = atop.y + dy[i];\\n if (!field[nexty][nextx]) {\\n if (atop.turn + 1 < memo[nexty][nextx]) {\\n memo[nexty][nextx] = atop.turn + 1;\\n que.push(aa{nextx, nexty, atop.turn + 1});\\n }\\n }\\n }\\n }\\n return ans;\\n}\\nstruct bb {\\n int kx;\\n int ky;\\n int opway;\\n int turn;\\n};\\nclass Compare {\\npublic:\\n bool operator()(const bb &l, const bb &r) { return l.turn > r.turn; }\\n};\\nint memo2[60][60][4];\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n while (1) {\\n for (int i = 0; i < 60; ++i) {\\n for (int j = 0; j < 60; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n memo2[i][j][k] = 999999;\\n }\\n }\\n }\\n int H, W;\\n cin >> H >> W;\\n if (!H)\\n break;\\n vector<vector<int>> field(H + 2, vector<int>(W + 2, true));\\n priority_queue<bb, vector<bb>, Compare> que;\\n {\\n int kx = 99, ky = 99;\\n int ox[2];\\n int oy[2];\\n int num = 0;\\n for (int i = 0; i < H; ++i) {\\n string st;\\n cin >> st;\\n for (int j = 0; j < W; ++j) {\\n if (st[j] == 'X') {\\n kx = min(kx, j + 1);\\n ky = min(ky, i + 1);\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == 'o') {\\n field[i + 1][j + 1] = false;\\n } else if (st[j] == '.') {\\n field[i + 1][j + 1] = false;\\n ox[num] = j + 1;\\n oy[num] = i + 1;\\n num++;\\n }\\n }\\n }\\n if (kx == 1 && ky == 1) {\\n cout << 0 << endl;\\n continue;\\n }\\n for (int way = 0; way < 4; ++way) {\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n const int fx = ox[op ^ lu];\\n const int fy = oy[op ^ lu];\\n int gx = kx + dx2[way];\\n int gy = ky + dy2[way];\\n if (lu == 1) {\\n gx += dx[(way + 1) % 4];\\n gy += dy[(way + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[ky + ay][kx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n memo2[kx][ky][way] = amin;\\n que.push(bb{kx, ky, way, amin});\\n }\\n }\\n }\\n int ans = -1;\\n while (!que.empty()) {\\n bb atop(que.top());\\n que.pop();\\n const int fkx = atop.kx;\\n const int fky = atop.ky;\\n const int fway = atop.opway;\\n const int fturn = atop.turn;\\n if (fkx == 1 && fky == 1) {\\n ans = fturn;\\n break;\\n }\\n for (int tway = 0; tway < 4; ++tway) {\\n if (fway == tway)\\n continue;\\n int amin = 999999;\\n bool ok = true;\\n for (int op = 0; op < 2; ++op) {\\n int atime = 0;\\n for (int lu = 0; lu < 2; ++lu) {\\n int fx = fkx + dx2[fway];\\n int fy = fky + dy2[fway];\\n int gx = fkx + dx2[tway];\\n int gy = fky + dy2[tway];\\n if (lu == 1) {\\n gx += dx[(tway + 1) % 4];\\n gy += dy[(tway + 1) % 4];\\n }\\n if (op ^ lu) {\\n fx += dx[(fway + 1) % 4];\\n fy += dy[(fway + 1) % 4];\\n }\\n if (field[gy][gx])\\n ok = false;\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = true;\\n }\\n }\\n atime += getdis(field, fx, fy, gx, gy);\\n for (int ax = 0; ax < 2; ++ax) {\\n for (int ay = 0; ay < 2; ++ay) {\\n field[fky + ay][fkx + ax] = false;\\n }\\n }\\n }\\n amin = min(amin, atime);\\n }\\n if (!ok)\\n continue;\\n else {\\n if (memo2[fkx][fky][tway] > fturn + amin) {\\n memo2[fkx][fky][tway] = fturn + amin;\\n que.push(bb{fkx, fky, tway, fturn + amin});\\n }\\n }\\n }\\n {\\n const int nkx = fkx + dx[fway];\\n const int nky = fky + dy[fway];\\n const int nway = (fway + 2) % 4;\\n if (memo2[nkx][nky][nway] > fturn + 1) {\\n memo2[nkx][nky][nway] = fturn + 1;\\n que.push(bb{nkx, nky, nway, fturn + 1});\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1100,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.8975,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":787,"cells":{"group_id":{"kind":"string","value":"aoj_1338_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nClock Hands\nWe have an analog clock whose three hands (the second hand, the\nminute\nhand and the\nhour\nhand) rotate quite smoothly. You can measure two angles between the second hand and two other hands.\nWrite a program to find the time at which \"No two hands overlap each other\" and \"Two angles between the second hand and two other hands are equal\" for the first time on or after a given time.\nFigure D.1. Angles between the second hand and two other hands\nClocks are not limited to 12-hour clocks. The hour hand of an\nH\n-hour clock goes around once in\nH\nhours. The minute hand still goes around once every hour, and the second hand goes around once every minute. At 0:0:0 (midnight), all the hands are at the upright position.\nInput\nThe input consists of multiple datasets. Each of the dataset has four integers\nH\n,\nh\n,\nm\nand\ns\nin one line, separated by a space.\nH\nmeans that the clock is an\nH\n-hour clock.\nh\n,\nm\nand\ns\nmean hour, minute and second of the specified time, respectively.\nYou may assume 2 ≤\nH\n≤ 100, 0 ≤\nh\n<\nH\n, 0 ≤\nm\n< 60, and 0 ≤\ns\n< 60.\nThe end of the input is indicated by a line containing four zeros.\nFigure D.2. Examples of H-hour clock (6-hour clock and 15-hour clock)\nOutput\nOutput the time T at which \"No two hands overlap each other\" and \"Two angles between the second hand and two other hands are equal\" for the first time on and after the specified time.\nFor\nT\nbeing\nh\no\n:\nm\no\n:\ns\no\n(\ns\no\nseconds past\nm\no\nminutes past\nh\no\no'clock), output four non-negative integers\nh\no\n,\nm\no\n,\nn\n, and\nd\nin one line, separated by a space, where\nn\n/\nd\nis the irreducible fraction representing\ns\no\n. For integer\ns\no\nincluding 0, let\nd\nbe 1.\nThe time should be expressed in the remainder of\nH\nhours. In other words, one second after\n(\nH\n− 1):59:59 is 0:0:0, not\nH\n:0:0.\nSample Input\n12 0 0 0\n12 11 59 59\n12 1 56 0\n12 1 56 3\n12 1 56 34\n12 3 9 43\n12 3 10 14\n12 7 17 58\n12 7 18 28\n12 7 23 0\n12 7 23 31\n2 0 38 29\n2 0 39 0\n2 0 39 30\n2 1 6 20\n2 1 20 1\n2 1 20 31\n3 2 15 0\n3 2 59 30\n4 0 28 48\n5 1 5 40\n5 1 6 10\n5 1 7 41\n11 0 55 0\n0 0 0 0\nOutput for the Sample Input\n0 0 43200 1427\n0 0 43200 1427\n1 56 4080 1427\n1 56 47280 1427\n1 57 4860 1427\n3 10 18600 1427\n3 10 61800 1427\n7 18 39240 1427\n7 18 82440 1427\n7 23 43140 1427\n7 24 720 1427\n0 38 4680 79\n0 39 2340 79\n0 40 0 1\n1 6 3960 79\n1 20 2400 79\n1 21 60 79\n2 15 0 1\n0 0 2700 89\n0 28 48 1\n1 6 320 33\n1 6 40 1\n1 8 120 11\n0 55 0 1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1338_9808827","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\nusing i64 = long long;\nusing f64 = long double;\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\n\n#define int i64\ntuple<int, int, int, int> solve(int H, int h, int m, int s) {\n const int D = 119 * H - 1;\n const int M = H * 60 * 60 * D;\n int d = 0;\n while(true) {\n bool ok = [&] {\n int rs = H * 60 * (s * D + d);\n int rm = H * ((m * 60 + s) * D + d);\n int rh = ((h * 60 + m) * 60 + s) * D + d;\n if(rm == rh) return false;\n return (rm - rs + M) % M == (rs - rh + M) % M;\n }();\n if(ok) {\n int u = s * D + d;\n int l = D;\n const int g = gcd(u, l);\n return {h, m, u / g, l / g};\n }\n\n d++;\n if(d == D ) s++, d=0;\n if(s == 60) m++, s=0;\n if(m == 60) h++, m=0;\n if(h == H ) h=0;\n }\n assert(0);\n}\n#undef int\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n \n while(true) {\n int H, h, m, s; cin >> H >> h >> m >> s; if(H == 0) return 0;\n auto [ho, mo, n, d] = solve(H, h, m, s);\n cout << ho << \" \" << mo << \" \" << n << \" \" << d << \"\\n\";\n }\n}","accuracy":1,"time_ms":140,"memory_kb":3216,"score_of_the_acc":-0.1707,"final_rank":9},{"submission_id":"aoj_1338_9808826","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\nusing i64 = long long;\nusing f64 = long double;\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\n\n#define int i64\ntuple<int, int, int, int> solve(int H, int h, int m, int s) {\n const int D = 119 * H - 1;\n const int M = H * 60 * 60 * D;\n int d = 0;\n while(true) {\n bool ok = [&] {\n int rs = H * 60 * (s * D + d);\n int rm = H * ((m * 60 + s) * D + d);\n int rh = ((h * 60 + m) * 60 + s) * D + d;\n if(rm == rh) return false;\n int dm = rm - rs; if(dm < 0) dm += M;\n int dh = rs - rh; if(dh < 0) dh += M;\n return dm == dh;\n }();\n if(ok) {\n int u = s * D + d;\n int l = D;\n const int g = gcd(u, l);\n return {h, m, u / g, l / g};\n }\n\n d++;\n if(d == D ) s++, d=0;\n if(s == 60) m++, s=0;\n if(m == 60) h++, m=0;\n if(h == H ) h=0;\n }\n assert(0);\n}\n#undef int\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n \n while(true) {\n int H, h, m, s; cin >> H >> h >> m >> s; if(H == 0) return 0;\n auto [ho, mo, n, d] = solve(H, h, m, s);\n cout << ho << \" \" << mo << \" \" << n << \" \" << d << \"\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3252,"score_of_the_acc":-0.181,"final_rank":11},{"submission_id":"aoj_1338_8505526","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n while (1) {\n int H, h, m, s;\n cin >> H >> h >> m >> s;\n if (!H)\n break;\n ll v = (H * 238 - 2);\n ll div = v * H * 3600;\n ll c = 0;\n while (1) {\n ll ns = (h * 3600 + m * 60 + s) * v + c;\n ll d1 = ns * (H * 60 - 1), d2 = ns * H * 59;\n d1 %= div, d2 %= div;\n chmin(d1, div - d1);\n chmin(d2, div - d2);\n if (d1 != 0 && ns * H % div != ns % div && d1 == d2) {\n ll g = gcd(ns % (v * 60), v); \n cout << ns / (v * 3600) % H << ' ' << ns / (v * 60) % 60 << ' ' << ns % (v * 60) / g << ' ' << v / g << endl;\n break;\n }\n c++;\n }\n }\n}","accuracy":1,"time_ms":480,"memory_kb":3256,"score_of_the_acc":-0.2469,"final_rank":12},{"submission_id":"aoj_1338_6367691","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\ntypedef string::const_iterator State;\n#define eps 1e-8L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\ntypedef long double ld;\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\n#define ALL(x) (x).begin(), (x).end()\n\n#define int long long\n\nint H, h, m, s, d;\n\nbool check()\n{\n ll x = 60 * H * s, y = (60 * m * d + s) * H, z = 3600 * h * d + 60 * m * d + s;\n if (y == z)\n return false;\n ll dify = y - x, difz = x - z;\n if (dify < 0)\n dify += 3600 * H * d;\n if (difz < 0)\n difz += 3600 * H * d;\n return dify == difz;\n}\n\nvoid solve()\n{\n cin >> H >> h >> m >> s;\n if(H == 0)\n exit(0);\n d = 119 * H - 1;\n s *= d;\n while (true)\n {\n if (check())\n {\n cout << h << \" \" << m << \" \" << s / gcd(s, d) << \" \" << d / gcd(s, d) << endl;\n return;\n }\n s++;\n if (s / d == 60)\n s = 0, m++;\n if (m == 60)\n m = 0, h++;\n if (h == H)\n h = 0;\n }\n}\n#undef int\n\n// generated by oj-template v4.7.2\n// (https://github.com/online-judge-tools/template-generator)\nint main()\n{\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 10000;\n // cin >> t; // comment out if solving multi testcase\n for (int testCase = 1; testCase <= t; ++testCase)\n {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3376,"score_of_the_acc":-0.2826,"final_rank":13},{"submission_id":"aoj_1338_5918445","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Clock {\n int h, m, n, d;\n Clock(int h_, int m_, int n_, int d_) : h(h_), m(m_), n(n_), d(d_) {\n int g = gcd(n, d);\n n /= g;\n d /= g;\n }\n bool operator<(const Clock& rhs) const {\n if (h != rhs.h) return h < rhs.h;\n if (m != rhs.m) return m < rhs.m;\n return n * rhs.d < rhs.n * d;\n }\n};\n\nbool check(int H, int h, int m, int n, int d) {\n int pos_h = (h * 60 * 60 + m * 60) * 2 * d + 2 * n;\n int pos_m = m * 60 * (2 * H) * d + (2 * H) * n;\n return pos_h != pos_m;\n}\n\nvoid solve(int H, int h, int m, int s) {\n int speed = 120 * H - (H + 1);\n vector<Clock> collision;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < 60; j++) {\n int tmp = ((H + 1) * (i * 60 * 60 + j * 60)) % (7200 * H);\n vector<int> v = {tmp, (tmp + 3600 * H) % (7200 * H)};\n if (v[0] > v[1]) swap(v[0], v[1]);\n for (int _ = 0; _ < 2; _++) {\n int pos_mid = v[_];\n if (pos_mid >= 60 * speed) continue;\n if (!check(H, i, j, pos_mid, speed)) continue;\n collision.emplace_back(i, j, pos_mid, speed);\n }\n }\n }\n auto itr = lower_bound(collision.begin(), collision.end(), Clock(h, m, s, 1));\n if (itr == collision.end()) itr = collision.begin();\n auto ans = *itr;\n cout << ans.h << ' ' << ans.m << ' ' << ans.n << ' ' << ans.d << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int H, h, m, s;\n while (cin >> H >> h >> m >> s, H) solve(H, h, m, s);\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3520,"score_of_the_acc":-0.3867,"final_rank":15},{"submission_id":"aoj_1338_5918442","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n }\n return os;\n}\n\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n#pragma endregion\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nstruct Clock {\n int h, m, n, d;\n Clock(int h_, int m_, int n_, int d_) : h(h_), m(m_), n(n_), d(d_) {\n int g = gcd(n, d);\n n /= g;\n d /= g;\n }\n bool operator<(const Clock& rhs) const {\n if (h != rhs.h) return h < rhs.h;\n if (m != rhs.m) return m < rhs.m;\n return n * rhs.d < rhs.n * d;\n }\n};\n\nbool check(int H, int h, int m, int n, int d) {\n int pos_h = (h * 60 * 60 + m * 60) * 2 * d + 2 * n;\n int pos_m = m * 60 * (2 * H) * d + (2 * H) * n;\n return pos_h != pos_m;\n}\n\nvoid solve(int H, int h, int m, int s) {\n int speed = 120 * H - (H + 1);\n vector<Clock> collision;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < 60; j++) {\n int tmp = ((H + 1) * (i * 60 * 60 + j * 60)) % (7200 * H);\n vector<int> v = {tmp, (tmp + 3600 * H) % (7200 * H)};\n if (v[0] > v[1]) swap(v[0], v[1]);\n for (int _ = 0; _ < 2; _++) {\n int pos_mid = v[_];\n if (pos_mid >= 60 * speed) continue;\n if (!check(H, i, j, pos_mid, speed)) continue;\n collision.emplace_back(i, j, pos_mid, speed);\n }\n }\n }\n auto itr = lower_bound(collision.begin(), collision.end(), Clock(h, m, s, 1));\n if (itr == collision.end()) itr = collision.begin();\n auto ans = *itr;\n cout << ans.h << ' ' << ans.m << ' ' << ans.n << ' ' << ans.d << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int H, h, m, s;\n while (cin >> H >> h >> m >> s, H) solve(H, h, m, s);\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3628,"score_of_the_acc":-0.4654,"final_rank":16},{"submission_id":"aoj_1338_5286204","code_snippet":"#include <bits/stdc++.h>\n#include <iostream>\n#include <limits>\n#include <numeric>\n#include <type_traits>\n#include <bitset>\n#include <map>\n#include <cassert>\n\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)\n#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)\n\npair<ll,ll> vmin(pair<ll,ll> x,pair<ll,ll> y){\n\n if (x.second < 0){\n x.first *= -1;\n x.second *= -1;\n }\n\n if (y.second < 0){\n y.first *= -1;\n y.second *= -1;\n }\n if (y.first < 0) {\n return x;\n }\n\n assert ( (x.first * y.second) / y.second == x.first);\n assert ( (y.first * x.second) / x.second == y.first);\n\n if (x.first * y.second > y.first * x.second){\n return y;\n }else{\n return x;\n }\n\n}\n\nll modplus(ll a, ll b) {\n a %= b;\n return (a + b) % b;\n}\n\nint main(){\n\n while (true){\n\n ll H,h,m,s;\n scanf (\"%lld%lld%lld%lld\",&H,&h,&m,&s);\n\n\n\n if ( H == 0 && h == 0 && m == 0 && s == 0 ){\n break;\n }\n\n pair<ll,ll> ans = {INT_MAX-1000,1};\n\n { // H-1\n ll mod = 3600 * H;\n ll hang = ( (3600*h + 60*m + s) * 1) % mod;\n ll mang = ( (60*m+s) * H ) % mod;\n ll sang = ( s * (60*H) ) % mod;\n ll hch = 1;\n ll mch = H;\n ll sch = 60*H;\n ll pl = H-1;\n mod *= pl;\n hang *= pl;\n mang *= pl;\n sang *= pl;\n\n rep(i,0,120*pl){\n\n if (modplus(sang-mang, mod) == modplus(sang-hang, mod) || modplus(sang-mang+sang-hang, mod) == 0){\n\n\n if ( sang % mod != mang % mod && mang % mod != hang % mod && sang % mod != hang % mod ){\n pair<ll,ll> nans = {i,pl};\n ans = vmin(ans,nans);\n }\n\n }\n sang += sch ; sang %= mod;\n mang += mch ; mang %= mod;\n hang += hch ; hang %= mod;\n }\n }\n\n\n\n { // 119H-1\n ll mod = 3600 * H;\n ll hang = ( (3600*h + 60*m + s) * 1) % mod;\n ll mang = ( (60*m+s) * H ) % mod;\n ll sang = ( s * (60*H) ) % mod;\n ll hch = 1;\n ll mch = H;\n ll sch = 60*H;\n ll pl = 119*H-1;\n mod *= pl;\n hang *= pl;\n mang *= pl;\n sang *= pl;\n\n rep(i,0,120*pl){\n\n// if (i == 43200) {\n// cout << mod << endl;\n// cout << i << \" \" << pl << \" \" << sang << \" \" << mang << \" \" << hang << endl;\n// cout << sang - mang << \" \" << sang - hang << endl;\n// }\n if ( modplus(sang-mang, mod) == modplus(sang-hang, mod) || modplus(sang-mang+sang-hang, mod) == 0){\n\n if ( (sang % mod != mang % mod && mang % mod != hang % mod && sang % mod != hang % mod) ){\n pair<ll,ll> nans = {i,pl};\n ans = vmin(ans,nans);\n }\n\n\n }\n sang += sch ; sang %= mod;\n mang += mch ; mang %= mod;\n hang += hch ; hang %= mod;\n }\n }\n\n ll su = s*ans.second + ans.first;\n ll sd = ans.second;\n\n //cerr << ans.first << \" \" << ans.second << endl;\n\n ll plusm = (su/sd)/60;\n su -= plusm * 60 * sd;\n\n m += plusm;\n\n\n while (m >= 60){\n m -= 60;\n h += 1;\n }\n h %= H;\n\n ll g = __gcd(su,sd);\n su /= g;\n sd /= g;\n\n assert (INT_MAX-1000 >= ans.first);\n printf (\"%lld %lld %lld %lld\\n\",h,m,su,sd);\n\n }\n\n\n}","accuracy":1,"time_ms":7330,"memory_kb":3496,"score_of_the_acc":-1.362,"final_rank":20},{"submission_id":"aoj_1338_5270985","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\n\nbool solve() {\n ll H, h0, m0, s0;\n cin >> H >> h0 >> m0 >> s0;\n if ((H | h0 | m0 | s0) == 0) return false;\n\n ll X = 119 * H - 1;\n ll T = (60ll * 60 * h0 + 60 * m0 + s0) * X;\n ll round = X * 60ll * 60 * H;\n\n auto check = [&](ll t) {\n ll x = t % round;\n ll y = (t * H) % round;\n ll z = (t * 60 * H) % round;\n if (x == y) return false;\n if ((x + y) % round == (z * 2 % round)) return true;\n return false;\n };\n\n while (!check(T)) { T++; }\n\n dmp(T);\n\n ll h = (T / (X * 60 * 60)) % H;\n ll m = (T / (X * 60)) % 60;\n ll n = T % (X * 60);\n ll d = X;\n\n ll g = gcd(n, d);\n n /= g;\n d /= g;\n\n cout << h << ' ' << m << ' ' << n << ' ' << d << endl;\n\n return true;\n}\n\nint main() {\n fastio();\n while (solve()) {}\n // int t;\n // cin >> t;\n // while (t--) solve();\n\n // int t; cin >> t;\n // for(int i=1;i<=t;i++){\n // cout << \"Case #\" << i << \": \";\n // solve();\n // }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":3376,"score_of_the_acc":-0.3086,"final_rank":14},{"submission_id":"aoj_1338_5012062","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing PII = pair<ll, ll>;\n\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(x) x.begin(), x.end()\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nconst ll INF = 1LL << 60;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\n// BEGIN CUT\n// 分数ライブラリ\n// 常に約分されているとする\n// 負のときは常にaを負にする\nstruct fraction {\n ll a, b;\n fraction(ll x = 0, ll y = 1) : a(x), b(y) {\n ll g = __gcd(a, b);\n a /= g, b /= g;\n if (b < 0)\n a *= -1, b *= -1;\n }\n // comparator\n bool operator<(fraction r) const { return a * r.b < b * r.a; }\n bool operator>(fraction r) const { return a * r.b > b * r.a; }\n bool operator<=(fraction r) const { return a * r.b <= b * r.a; }\n bool operator>=(fraction r) const { return a * r.b >= b * r.a; }\n bool operator==(fraction r) const { return a * r.b == b * r.a; }\n bool operator!=(fraction r) const { return a * r.b != b * r.a; }\n // Basic Operations\n fraction operator+(fraction r) const { return fraction(*this) += r; }\n fraction operator-(fraction r) const { return fraction(*this) -= r; }\n fraction operator*(fraction r) const { return fraction(*this) *= r; }\n fraction operator/(fraction r) const { return fraction(*this) /= r; }\n fraction &operator+=(fraction r) {\n ll g = __gcd(abs(a * r.b + b * r.a), b * r.b);\n ll na = (a * r.b + b * r.a) / g, nb = (b * r.b) / g;\n a = na, b = nb;\n return *this;\n }\n fraction &operator-=(fraction r) {\n ll g = __gcd(abs(a * r.b - b * r.a), b * r.b);\n ll na = (a * r.b - b * r.a) / g, nb = (b * r.b) / g;\n a = na, b = nb;\n return *this;\n }\n fraction &operator*=(fraction r) {\n ll g = __gcd(a * r.a, b * r.b);\n a = a * r.a / g, b = b * r.b / g;\n return *this;\n }\n fraction &operator/=(fraction r) {\n ll g = __gcd(a * r.b, b * r.a);\n a = a * r.b / g, b = b * r.a / g;\n if (b < 0)\n a *= -1, b *= -1;\n return *this;\n }\n friend fraction abs(fraction a) {\n a.a = abs(a.a);\n return a;\n }\n // output\n friend ostream &operator<<(ostream &os, fraction a) {\n return os << a.a << \"/\" << a.b;\n }\n};\n// END CUT\n\nusing P = pair<fraction, bool>;\n\nint main() {\n while (1) {\n int H, h, m, s;\n cin >> H >> h >> m >> s;\n if (H == 0)\n break;\n int day = H * 3600;\n fraction vh = fraction(1, 10 * H);\n fraction vm = fraction(1, 10);\n fraction vs = fraction(6);\n vector<P> vec;\n //秒針と分針\n auto diff = fraction(m * 60 + s, 10) - fraction(s * 6);\n if (diff <= 0)\n diff += 360;\n auto t = diff / (vs - vm);\n while (t <= day) {\n vec.emplace_back(t, 0);\n t += fraction(360) / (vs - vm);\n }\n diff += 180;\n if (diff > 360)\n diff -= 360;\n t = diff / (vs - vm);\n while (t <= day) {\n vec.emplace_back(t, 0);\n t += fraction(360) / (vs - vm);\n }\n //秒針と時針\n diff = fraction(h * 3600 + m * 60 + s, 10 * H) - fraction(s * 6);\n if (diff <= 0)\n diff += 360;\n t = diff / (vs - vh);\n while (t <= day) {\n vec.emplace_back(t, 1);\n t += fraction(360) / (vs - vh);\n }\n diff += 180;\n if (diff > 360)\n diff -= 360;\n t = diff / (vs - vh);\n while (t <= day) {\n vec.emplace_back(t, 1);\n t += fraction(360) / (vs - vh);\n }\n sort(ALL(vec));\n auto diff_m = fraction(m * 60 + s, 10) - fraction(s * 6);\n vm = vs - vm;\n if (diff_m < 0)\n diff_m += 360;\n if (diff_m > 180) {\n diff_m = fraction(360) - diff_m;\n } else {\n vm *= -1;\n }\n auto diff_h = fraction(h * 3600 + m * 60 + s, 10 * H) - fraction(s * 6);\n vh = vs - vh;\n if (diff_h < 0)\n diff_h += 360;\n if (diff_h > 180) {\n diff_h = fraction(360) - diff_h;\n } else {\n vh *= -1;\n }\n fraction prev = 0;\n fraction ans;\n for (P p : vec) {\n auto T = p.first - prev;\n if ((vm < 0 && vh > 0) || (vm > 0 && vh < 0)) {\n auto x = (diff_m - diff_h) / (vh - vm);\n if (diff_m + vm * x != 0 && x >= 0 && x <= T) {\n ans = prev + x;\n break;\n }\n }\n diff_m += vm * T;\n diff_h += vh * T;\n if (p.second)\n vh *= -1;\n else\n vm *= -1;\n prev = p.first;\n }\n ans += 3600 * h + 60 * m + s;\n if (ans >= day)\n ans -= day;\n ll sec = ans.a / ans.b;\n ans -= sec;\n ans += sec % 60;\n cout << sec / 3600 << \" \" << (sec % 3600) / 60 << \" \" << ans.a << \" \"\n << ans.b << endl;\n }\n}","accuracy":1,"time_ms":410,"memory_kb":4356,"score_of_the_acc":-1.0534,"final_rank":18},{"submission_id":"aoj_1338_4918624","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\nconstexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\n//constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nlong long int dif(long long int a, long long int b, long long int mx) {\n\treturn min(abs(a - b), mx - abs(a - b));\n}\n\nlong long int gcd(long long int a, long long int b) {\n\twhile (b) {\n\t\ta %= b;\n\t\tswap(a, b);\n\t}\n\treturn a;\n}\n\nvoid Output(long long int p) {\n\tcout << p / (119 * H - 1)/3600 << \" \";\n\tp %= (119 * H - 1) * 3600;\n\tcout << p / (119 * H - 1) / 60 << \" \";\n\tp %= (119 * H - 1) * 60;\n\tlong long int g = gcd(p, 119 * H - 1);\n\tcout << p / g << \" \" << (119 * H - 1) / g << endl;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tint h, m, s;\n\twhile (cin >> H >> h >> m >> s, H) {\n\t\tint by = 119 * H - 1;\n\t\tlong long int st = h * 3600 + m * 60 + s;\n\t\tlong long int mod = by * H * 60 * 60;\n\t\tst *= by;\n\t\tlong long int hp = st;\n\t\tlong long int mp = hp * H;\n\t\tlong long int sp = mp * 60;\n\t\tmp %= mod;\n\t\tsp %= mod;\n\t\tdo {\n\t\t//\tcout << st << \" \" << hp << \" \" << mp << \" \" << sp << endl;\n\t\t\tif (dif(hp, sp, mod) == dif(mp, sp, mod) && dif(hp, mp, mod)) {\n\t\t\t\tOutput(st);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tst++;\n\t\t\tst %= mod;\n\t\t\thp++;\n\t\t\thp %= mod;\n\t\t\tmp += H;\n\t\t\tmp %= mod;\n\t\t\tsp += 60 * H;\n\t\t\tsp %= mod;\n\t\t} while (1);\n\t}\n}","accuracy":1,"time_ms":210,"memory_kb":3096,"score_of_the_acc":-0.0913,"final_rank":3},{"submission_id":"aoj_1338_4894664","code_snippet":"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1338\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T>\nstruct fraction{\n T num,dom;\n fraction(T n,T d):num(n),dom(d){\n assert(dom!=0);\n if(dom<0) num*=-1,dom*=-1;\n T tmp=__gcd(abs(num),abs(dom));\n num/=tmp;\n dom/=tmp;\n }\n fraction operator+(const fraction a) const{\n return fraction(num*a.dom+a.num*dom,dom*a.dom);\n }\n fraction operator-(const fraction a) const{\n return fraction(num*a.dom-a.num*dom,dom*a.dom);\n }\n fraction operator*(const fraction a) const{\n return fraction(num*a.num,dom*a.dom);\n }\n fraction operator/(const fraction a){\n return fraction(num*a.dom,dom*a.num);\n }\n fraction operator*(T k) const{return fraction(num*k,dom);}\n fraction operator/(T k) const{return fraction(num,dom*k);}\n#define define_cmp(op) \\\n bool operator op (const fraction a)const{return num*a.dom op a.num*dom;}\n define_cmp(==)\n define_cmp(!=)\n define_cmp(<)\n define_cmp(>)\n define_cmp(<=)\n define_cmp(>=)\n#undef define_cmp\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nusing ll = long long;\nusing frac = fraction<ll>;\n\nint H,h,m,s;\nvoid print(frac f){\n int t=f.num/(f.dom*60);\n cout<<(t%(60*H))/60<<\" \";\n cout<<(t%60)<<\" \";\n cout<<(f.num)%(f.dom*60)<<\" \"<<f.dom<<endl;\n}\n\nfrac norm2(frac a){\n if(a.num==0) return frac(0,1);\n while(a.num<0) a.num+=a.dom;\n while(a.num>=a.dom) a.num-=a.dom;\n ll tmp=__gcd(a.num,a.dom);\n return frac(a.num/tmp,a.dom/tmp);\n}\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(cin>>H>>h>>m>>s,H){\n const frac base(h*3600+m*60+s,1);\n const frac vh(1,3600*H),vm(1,3600),vs(1,60);\n frac t(max(h*3600+m*60+s-100,0),1);\n while(1){\n frac x=norm2(t*vh);\n frac y=norm2(t*vm);\n frac z=norm2(t*vs);\n if(y<x) y=y+frac(1,1);\n if(z<x) z=z+frac(1,1);\n frac ans(10000000,1);\n {\n frac t1=frac(1,1)-(z-x);\n frac t2=z-y;\n frac tmp=t+(t1-t2)/(vs*2-(vh+vm));\n if(base<=tmp){\n frac a=norm2(tmp*vh);\n frac b=norm2(tmp*vm);\n frac c=norm2(tmp*vs);\n if(b<a) b=b+frac(1,1);\n if(c<a) c=c+frac(1,1);\n if(b<c){\n t1=frac(1,1)-(c-a);\n t2=c-b;\n if(a!=b&&b!=c&&c!=a&&t1==t2)\n ans=min(ans,tmp);\n }\n }\n }\n {\n frac t1=z-x;\n frac t2=y-z;\n frac tmp=t+(t2-t1)/(vs*2-(vh+vm));\n if(base<=tmp){\n frac a=norm2(tmp*vh);\n frac b=norm2(tmp*vm);\n frac c=norm2(tmp*vs);\n if(b<a) b=b+frac(1,1);\n if(c<a) c=c+frac(1,1);\n if(b>c){\n t1=c-a;\n t2=b-c;\n if(a!=b&&b!=c&&c!=a&&t1==t2)\n ans=min(ans,tmp);\n }\n }\n }\n if(ans!=frac(10000000,1)){\n print(ans);\n break;\n }\n t=t+frac(1,1);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3224,"score_of_the_acc":-0.1616,"final_rank":8},{"submission_id":"aoj_1338_4803791","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=100005,INF=1<<30;\n\nll gcd(ll a,ll b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n ll H,h,m,s;cin>>H>>h>>m>>s;\n \n if(H==0) break;\n \n ll d=119*H-1,l=3600*H*d;\n ll nowh=(3600*h+60*m+s)*d,nowm=(60*m*H+s*H)*d,nows=(60*s*H)*d;\n for(int t=0;;t++){\n if(t){\n nowh+=1;\n nowm+=H;\n nows+=60*H;\n \n if(nowh>=l) nowh-=l;\n if(nowm>=l) nowm-=l;\n if(nows>=l) nows-=l;\n }\n \n ll d1=abs(nowh-nows);\n if(d1>l/2) d1=l-d1;\n \n ll d2=abs(nowm-nows);\n if(d2>l/2) d2=l-d2;\n \n if(nowh==nowm) continue;\n if(nowm==nows) continue;\n if(nows==nowh) continue;\n \n if(d1==d2){\n ll x=t/d;\n s+=x;\n m+=s/60;\n s%=60;\n \n h+=m/60;\n m%=60;\n \n h%=H;\n \n t%=d;\n \n ll g=gcd(t,d);\n t/=g;\n d/=g;\n \n cout<<h<<\" \"<<m<<\" \"<<s*d+t<<\" \"<<d<<endl;\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3140,"score_of_the_acc":-0.0993,"final_rank":4},{"submission_id":"aoj_1338_3991881","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\nint H, ha, ma, sa;\n\nint gcd(int a, int b) {\n if(a == 0) return b;\n if(b == 0) return a;\n if(a < b) swap(a, b);\n if(a % b == 0) return b;\n return gcd(b, a % b);\n}\n\nstruct Clock {\n int h, m, n, d;\n Clock(int _h, int _m, int _n, int _d) {\n h = _h;\n m = _m;\n n = _n;\n d = _d;\n int g = gcd(n, d);\n n /= g;\n d /= g;\n }\n};\n\nbool operator <(Clock a, Clock b) {\n if(a.h != b.h) return a.h < b.h;\n if(a.m != b.m) return a.m < b.m;\n return a.n * b.d < b.n * a.d;\n}\n\nbool operator <=(Clock a, Clock b) {\n if(a.h != b.h) return a.h < b.h;\n if(a.m != b.m) return a.m < b.m;\n return a.n * b.d <= b.n * a.d;\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n while(true) {\n cin >> H >> ha >> ma >> sa;\n if(H == 0 && ha == 0 && ma == 0 && sa == 0) break;\n Clock a(ha, ma, sa, 1);\n Clock ans(-1, -1, 0, 1);\n for(int h = 0; h < H; h++) {\n for(int m = 0; m < 60; m++) {\n for(int delta = -1; delta <= 1; delta++) {\n int Left = delta * 3600 * H + 60 * 60 * h + 60 * m * (H + 1);\n if(Left < 0) continue;\n if(Left >= 60 * (H * 120 - H - 1)) continue;\n Clock now(h, m, Left, H * 120 - H - 1);\n if(60 * now.m * now.d == 59 * now.n) continue;\n if(ans.h == -1) {\n ans = now;\n } else if(ans < a && a <= now) {\n ans = now;\n } else if(a <= now && now < ans) {\n ans = now;\n } else if(now <= ans && ans < a) {\n ans = now;\n }\n }\n }\n }\n cout << ans.h << \" \" << ans.m << \" \" << ans.n << \" \" << ans.d << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3200,"score_of_the_acc":-0.1534,"final_rank":7},{"submission_id":"aoj_1338_3711051","code_snippet":"#include<iostream>\nusing namespace std;\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\nint H,h,m,s;\nbool check(long H,long h,long m,long s)\n{\n\tfor(int r=-360;r<=360;r++)\n\t{\n\t\tlong A=r*360*10*H+60*m*(H+1)+3600*h;\n\t\tlong B=119*H-1;\n\t\tlong d=gcd(A,B);\n\t\tA/=d;\n\t\tB/=d;\n\t\tif(!(A>=60*B||s*B>A)&&!(h==0&&m==0&&A==0))\n\t\t{\n\t\t\tcout<<h<<\" \"<<m<<\" \"<<A<<\" \"<<B<<endl;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>H>>h>>m>>s,H)\n\t{\n\t\twhile(!check(H,h,m,s))\n\t\t{\n\t\t\ts++;\n\t\t\tif(s==60)m++,s=0;\n\t\t\tif(m==60)h++,m=0;\n\t\t\tif(h==H)h=0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":3008,"score_of_the_acc":-0.0014,"final_rank":1},{"submission_id":"aoj_1338_3710901","code_snippet":"#include<iostream>\nusing namespace std;\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\nint H,h,m,s;\nbool check(long H,long h,long m,long s)\n{\n\tfor(int r=-360;r<=360;r++)\n\t{\n\t\tlong A=r*360*10*H+60*m*(H+1)+3600*h;\n\t\tlong B=119*H-1;\n\t\tlong d=gcd(A,B);\n\t\tA/=d;\n\t\tB/=d;\n\t\tif(!(A>=60*B||s*B>A)&&!(h==0&&m==0&&A==0))\n\t\t{\n\t\t\tcout<<h<<\" \"<<m<<\" \"<<A<<\" \"<<B<<endl;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\nmain()\n{\n\twhile(cin>>H>>h>>m>>s,H)\n\t{\n\t\twhile(!check(H,h,m,s))\n\t\t{\n\t\t\ts++;\n\t\t\tif(s==60)m++,s=0;\n\t\t\tif(m==60)h++,m=0;\n\t\t\tif(h==H)h=0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":3072,"score_of_the_acc":-0.0488,"final_rank":2},{"submission_id":"aoj_1338_2947799","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\n#define all(x) (x).begin(),(x).end()\n#define dbg(x) cout<<#x\"=\"<<x<<endl\n#define mmax(x,y) (x>y?x:y)\n#define mmin(x,y) (x<y?x:y)\n#define maxch(x,y) x=mmax(x,y)\n#define minch(x,y) x=mmin(x,y)\n#define uni(x) x.erase(unique(all(x)),x.end())\n#define exist(x,y) (find(all(x),y)!=x.end())\n#define bcnt __builtin_popcount\n\n#define INF 1e16\n\nll t;\nll H,h0,m0,s0;\n\nint main(){\n while(1){\n cin>>H>>h0>>m0>>s0;\n if(H==0)break;\n ll d=119*H-1;\n ll n=s0*d;\n ll h=h0,m=m0;\n ll mod=360*10*H*d;\n while(1){\n ll ang_h=(3600*h*d+60*m*d+n)%mod;\n ll ang_m=(60*H*m*d+H*n)%mod;\n ll ang_s=(60*H*n)%mod;\n ang_h=(ang_h-ang_s+mod)%mod;\n ang_m=(ang_m-ang_s+mod)%mod;\n if(ang_m!=ang_h&&min(ang_m,ang_h)==mod-max(ang_m,ang_h))break;\n n++;\n if(n==60*d)n=0,m++;\n if(m==60)m=0,h++;\n if(h==H)h=0;\n }\n ll g=__gcd(n,d);\n cout<<h<<\" \"<<m<<\" \"<<n/g<<\" \"<<d/g<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":3080,"score_of_the_acc":-0.1027,"final_rank":5},{"submission_id":"aoj_1338_2901754","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nusing pl = pair<ll,ll>;\n\nstruct TIME{\n ll h,m;\n pl s;\n};\n\nvoid PRINT_T(TIME t){\n printf(\"%lld %lld %lld %lld\\n\", t.h, t.m, t.s.fi, t.s.se);\n}\n\nconst ll INF = 60*60*100*10;\n\nbool big(pl a, pl b){\n return a.fi*b.se < b.fi*a.se;\n}\n\npl norm(pl a){\n ll G = __gcd(a.fi, a.se);\n a.fi /= G;\n a.se /= G;\n return a;\n}\n\nint H,x,y,z;\n\n// a から b\npl sub(TIME a, TIME b){\n pl p = a.s;\n p.fi += p.se*60*(60*a.h+a.m);\n\n pl q = b.s;\n q.fi += q.se*60*(60*b.h+b.m);\n\n while(big(q,p)) q.fi += H*3600*q.se;\n p = norm(p);\n q = norm(q);\n\n ll X = q.fi*p.se - p.fi*q.se;\n ll Y = q.se*p.se;\n pl res(X,Y);\n res = norm(res);\n\n // printf(\" DIFF:\\n\");\n // PRINT_T(a);\n // PRINT_T(b);\n // dbg(res);\n return res;\n}\n\nint main(){\n while(cin >>H >>x >>y >>z,H){\n ll T = 60*H;\n\n TIME base = {x,y,{z,1}};\n\n pl diff(INF,1);\n TIME ans;\n\n auto upd = [&](ll p, ll q, int i, int j){\n ll t = 60*i+j;\n if(p>=0 && p/q<60){\n pl s = norm({p,q});\n // printf(\" CAND %d %d %lld/%lld :\", i,j,s.fi,s.se);\n\n pl th(60*t*s.se+s.fi, 60*T*s.se);\n pl tm(60*j*s.se+s.fi, 3600*s.se);\n pl ts(s.fi, s.se*60);\n th = norm(th);\n tm = norm(tm);\n ts = norm(ts);\n\n if( th!=tm && th!=ts && tm!=ts ){\n TIME tmp = {i,j,s};\n pl td = sub(base, tmp);\n if(big(td,diff)){\n diff = td;\n ans = tmp;\n }\n // printf(\"OK\");\n }\n // printf(\"\\n\");\n }\n };\n\n rep(i,H)rep(j,60){\n ll t = 60*i+j;\n\n // 1つめ\n ll p = 3600*t - 60*T*j;\n ll q = T - 60;\n upd(p,q,i,j);\n\n // 2つめ\n p = 3600*t + 60*T*j;\n q = 119*T - 60;\n upd(p,q,i,j);\n\n // 3つめ\n p = 3600*(T+t) + 60*T*j;\n q = 119*T - 60;\n upd(p,q,i,j);\n\n // 4つめ\n p = 3600*(t-T) + 60*T*j;\n q = 119*T - 60;\n upd(p,q,i,j);\n }\n\n PRINT_T(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":680,"memory_kb":3092,"score_of_the_acc":-0.1526,"final_rank":6},{"submission_id":"aoj_1338_2747801","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\nll calc(ll x,ll y){\n\n\tif(x < y)swap(x,y);\n\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn calc(y,x%y);\n\t}\n}\n\n\nint main(){\n\n\tint H,h,m,s;\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&H,&h,&m,&s);\n\t\tif(H == 0 && h == 0 && m == 0 && s == 0)break;\n\n\t\tll bunbo = 119*H-1;\n\t\tll bunshi = s*bunbo;\n\t\tll h0 = h;\n\t\tll m0 = m;\n\t\tll deg_h,deg_m,deg_s,diff_1,diff_2;\n\t\tll base;\n\n\t\twhile(true){\n\n\t\t\tbase = 3600*H*bunbo;\n\n\t\t\tdeg_h = (3600*h0*bunbo+60*m0*bunbo+bunshi)%base;\n\t\t\tdeg_m = (60*H*m0*bunbo+bunshi*H)%base;\n\t\t\tdeg_s = (60*H*bunshi)%base;\n\n\t\t\tif(deg_h != deg_m){\n\t\t\t\tdiff_1 = (deg_s-deg_h+base)%base;\n\t\t\t\tdiff_2 = (deg_m-deg_s+base)%base;\n\t\t\t\tif(diff_1 == diff_2)break;\n\t\t\t}\n\n\t\t\tbunshi++;\n\t\t\tif(bunshi/60 == bunbo) {\n\t\t\t\tbunshi = 0;\n\t\t\t\tm0++;\n\t\t\t}\n\t\t\tif(m0 == 60) {\n\t\t\t\tm0 = 0;\n\t\t\t\th0++;\n\t\t\t}\n\t\t\tif(h0 == H) {\n\t\t\t\th0 = 0;\n\t\t\t}\n\t\t}\n\t\tll common = calc(bunshi,bunbo);\n\t\tbunshi /= common;\n\t\tbunbo /= common;\n\n\t\tprintf(\"%lld %lld %lld %lld\\n\",h0,m0,bunshi,bunbo);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":380,"memory_kb":3176,"score_of_the_acc":-0.1739,"final_rank":10},{"submission_id":"aoj_1338_2608620","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint H, h, m, s;\n\n//! x / y\nclass Frac{\npublic:\n using LL = long long;\n LL x, y;\n\n Frac(LL x = 0, LL y = 1) : x(x), y(y) { red(); }\n\n LL gcd(LL x, LL y){\n\tif(y == 0) return x;\n\treturn gcd(y, x%y);\n }\n \n void red(){\n\tif(x == 0){\n\t y = 1;\n\t return;\n\t}\n\tif(y < 0){\n\t x *= -1;\n\t y *= -1;\n\t}\n\t\n\tLL g = gcd(abs(x), y);\n\tx /= g;\n\ty /= g;\n }\n\n Frac& operator += (const Frac& p){ x = x * p.y + y * p.x; y *= p.y; red(); return *this;}\n Frac operator + (const Frac& p) const{ Frac q = *this;return q += p;}\n Frac operator - () const { Frac q = *this; q.x *= -1; return q; }\n Frac& operator -= (const Frac& p){ Frac q = -p; *this += q; return *this;}\n Frac operator - (const Frac& p) const{ Frac q = *this; return q -= p;}\n Frac& operator *= (const Frac& a){ x *= a.x; y *= a.y; red(); return *this;}\n Frac operator * (Frac a) const{ Frac q = *this; return q *= a;}\n Frac& operator /= (const Frac& a){ x *= a.y; y *= a.x; red(); return *this;}\n Frac operator / (Frac a) const{ Frac q = *this; return q /= a;}\n\n bool operator < (const Frac &p) const{\n\treturn x * p.y < y * p.x;\n }\n bool operator <= (const Frac &p) const{\n\treturn *this < p || *this == p;\n }\n bool operator > (const Frac &p) const{\n\treturn p < *this;\n }\n bool operator >= (const Frac &p) const{\n\treturn *this > p || *this == p;\n }\n bool operator == (const Frac &p) const {\n\treturn x == p.x && y == p.y;\n }\n double getR() const { return x * 1. / y; }\n friend ostream& operator <<(ostream& os, const Frac& p);\n};\nFrac abs(const Frac& q){ return Frac(abs(q.x), q.y); }\nostream& operator <<(ostream& os, const Frac& p){\n return os << p.x << \"/\" << p.y;\n}\n\nvoid norm(Frac& t){\n if(t.x < 0) t += 3600*H;\n while(t >= 60 * 60 * H)\n\tt -= 60 * 60 * H;\n}\n\nvoid normR(Frac& t){\n if(t.x < 0) t += 360;\n while(t >= 360)\n\tt -= 360;\n}\n\nFrac dist(Frac& now, Frac& dst){\n if(now <= dst) return dst - now;\n return dst + 3600*H - now;\n}\n\nvoid print(Frac& ans){\n LL ah = ans.x / ans.y / 60 / 60;\n LL am = ans.x / ans.y / 60 % 60;\n Frac as = ans - ah*3600 - am*60;\n cout << ah << \" \" << am << \" \" << as.x << \" \" << as.y << endl;\n}\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n while(cin>>H>>h>>m>>s,H){\n\tFrac now(h*3600+m*60+s);\n\t\n\tFrac ans(1e9, 1), ans_dt(1e9, 1);\n\tREP(th,H) REP(tm,60){\n\t for(int s1=-1;s1<=1;s1+=2){\n\t\tfor(int s2=-1;s2<=1;s2+=2){\n\t\t Frac c1(3600*th + 60*tm, 10*H);\n\t\t Frac a1 = Frac(1, 10*H) - 6;\n\t\t Frac c2(6*tm);\n\t\t Frac a2 = Frac(1, 10) - 6;\n\n\t\t for(int ang=0;ang<=360;ang+=360){\n\t\t\tFrac ss = (c2 * s2 - c1 * s1 + ang) / (a1 * s1 - a2 * s2);\n\n\t\t\tFrac rh = c1 + ss / (10*H);\n\t\t\tnormR(rh);\n\t\t\tFrac rm = c2 + ss / 10;\n\t\t\tnormR(rm);\n\t\t\tFrac rs = ss * 6;\n\t\t\tnormR(rs);\n\t\t\tif(rh == rm || rh == rs || rm == rs) continue;\n\t\t\tFrac nxt = ss + 3600*th + 60*tm;\n\t\t\tnorm(nxt);\n\t\t\tFrac dd = dist(now, nxt);\n\t\t\tif(dd < ans_dt){\n\t\t\t ans_dt = dd;\n\t\t\t ans = nxt;\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tprint(ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":7030,"memory_kb":3124,"score_of_the_acc":-1.045,"final_rank":17},{"submission_id":"aoj_1338_2608617","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<string>;\n\n#define ALL(a) begin((a)),end((a))\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define EB emplace_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SORT(c) sort(ALL((c)))\n#define RSORT(c) sort(RALL((c)))\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\n\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\n\n#define FF first\n#define SS second\ntemplate<class S, class T>\nistream& operator>>(istream& is, pair<S,T>& p){\n return is >> p.FF >> p.SS;\n}\ntemplate<class S, class T>\nostream& operator<<(ostream& os, const pair<S,T>& p){\n return os << p.FF << \" \" << p.SS;\n}\ntemplate<class T>\nvoid maxi(T& x, T y){\n if(x < y) x = y;\n}\ntemplate<class T>\nvoid mini(T& x, T y){\n if(x > y) x = y;\n}\n\n\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint H, h, m, s;\n\n//! x / y\nclass Frac{\npublic:\n using LL = long long;\n LL x, y;\n\n Frac(LL x = 0, LL y = 1) : x(x), y(y) { red(); }\n\n LL gcd(LL x, LL y){\n\tif(y == 0) return x;\n\treturn gcd(y, x%y);\n }\n \n void red(){\n\tif(x == 0){\n\t y = 1;\n\t return;\n\t}\n\tif(y < 0){\n\t x *= -1;\n\t y *= -1;\n\t}\n\t\n\tLL g = gcd(abs(x), y);\n\tx /= g;\n\ty /= g;\n }\n\n Frac& operator += (const Frac& p){ x = x * p.y + y * p.x; y *= p.y; red(); return *this;}\n Frac operator + (const Frac& p) const{ Frac q = *this;return q += p;}\n Frac operator - () const { Frac q = *this; q.x *= -1; return q; }\n Frac& operator -= (const Frac& p){ Frac q = -p; *this += q; return *this;}\n Frac operator - (const Frac& p) const{ Frac q = *this; return q -= p;}\n Frac& operator *= (const Frac& a){ x *= a.x; y *= a.y; red(); return *this;}\n Frac operator * (Frac a) const{ Frac q = *this; return q *= a;}\n Frac& operator /= (const Frac& a){ x *= a.y; y *= a.x; red(); return *this;}\n Frac operator / (Frac a) const{ Frac q = *this; return q /= a;}\n\n bool operator < (const Frac &p) const{\n\treturn x * p.y < y * p.x;\n }\n bool operator <= (const Frac &p) const{\n\treturn *this < p || *this == p;\n }\n bool operator > (const Frac &p) const{\n\treturn p < *this;\n }\n bool operator >= (const Frac &p) const{\n\treturn *this > p || *this == p;\n }\n bool operator == (const Frac &p) const {\n\treturn x == p.x && y == p.y;\n }\n double getR() const { return x * 1. / y; }\n friend ostream& operator <<(ostream& os, const Frac& p);\n};\nFrac abs(const Frac& q){ return Frac(abs(q.x), q.y); }\nostream& operator <<(ostream& os, const Frac& p){\n return os << p.x << \"/\" << p.y;\n}\n\nvoid norm(Frac& t){\n if(t.x < 0) t += 3600*H;\n while(t >= 60 * 60 * H)\n\tt -= 60 * 60 * H;\n}\n\nvoid normR(Frac& t){\n if(t.x < 0) t += 360;\n while(t >= 360)\n\tt -= 360;\n}\n\nFrac dist(Frac& now, Frac& dst){\n if(now <= dst) return dst - now;\n return dst + 3600*H - now;\n}\n\nvoid print(Frac& ans){\n LL ah = ans.x / ans.y / 60 / 60;\n LL am = ans.x / ans.y / 60 % 60;\n Frac as = ans - ah*3600 - am*60;\n cout << ah << \" \" << am << \" \" << as.x << \" \" << as.y << endl;\n}\n\nint main(){\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n\n while(cin>>H>>h>>m>>s,H){\n\tFrac now(h*3600+m*60+s);\n\t\n\tFrac ans(1e9, 1), ans_dt(1e9, 1);\n\tREP(th,H) REP(tm,60){\n\t for(int s1=-1;s1<=1;s1+=2){\n\t\tfor(int s2=-1;s2<=1;s2+=2){\n\t\t Frac c1(3600*th + 60*tm, 10*H);\n\t\t Frac a1 = Frac(1, 10*H) - 6;\n\t\t Frac c2(6*tm);\n\t\t Frac a2 = Frac(1, 10) - 6;\n\n\t\t for(int ang=0;ang<=360;ang+=360){\n\t\t\tFrac ss = (c2 * s2 - c1 * s1 + ang) / (a1 * s1 - a2 * s2);\n\n\t\t\tFrac rh = c1 + ss / (10*H);\n\t\t\tnormR(rh);\n\t\t\tFrac rm = c2 + ss / 10;\n\t\t\tnormR(rm);\n\t\t\tFrac rs = ss * 6;\n\t\t\tnormR(rs);\n\t\t\tif(rh == rm || rh == rs || rm == rs) continue;\n\t\t\tFrac nxt = ss + 3600*th + 60*tm;\n\t\t\tnorm(nxt);\n\t\t\tFrac dd = dist(now, nxt);\n\t\t\tif(dd < ans_dt){\n\t\t\t ans_dt = dd;\n\t\t\t ans = nxt;\n\t\t\t}\n\t\t }\n\t\t}\n\t }\n\t}\n\tLL ah = ans.x / ans.y / 60 / 60;\n\tLL am = ans.x / ans.y / 60 % 60;\n\tFrac as = ans - ah*3600 - am*60;\n\tcout << ah << \" \" << am << \" \" << as.x << \" \" << as.y << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":7010,"memory_kb":3160,"score_of_the_acc":-1.069,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_1338_9808827\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\nusing i64 = long long;\\nusing f64 = long double;\\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\\n\\n#define int i64\\ntuple<int, int, int, int> solve(int H, int h, int m, int s) {\\n const int D = 119 * H - 1;\\n const int M = H * 60 * 60 * D;\\n int d = 0;\\n while(true) {\\n bool ok = [&] {\\n int rs = H * 60 * (s * D + d);\\n int rm = H * ((m * 60 + s) * D + d);\\n int rh = ((h * 60 + m) * 60 + s) * D + d;\\n if(rm == rh) return false;\\n return (rm - rs + M) % M == (rs - rh + M) % M;\\n }();\\n if(ok) {\\n int u = s * D + d;\\n int l = D;\\n const int g = gcd(u, l);\\n return {h, m, u / g, l / g};\\n }\\n\\n d++;\\n if(d == D ) s++, d=0;\\n if(s == 60) m++, s=0;\\n if(m == 60) h++, m=0;\\n if(h == H ) h=0;\\n }\\n assert(0);\\n}\\n#undef int\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n \\n while(true) {\\n int H, h, m, s; cin >> H >> h >> m >> s; if(H == 0) return 0;\\n auto [ho, mo, n, d] = solve(H, h, m, s);\\n cout << ho << \\\" \\\" << mo << \\\" \\\" << n << \\\" \\\" << d << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.1707,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1338_9808826\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\nusing i64 = long long;\\nusing f64 = long double;\\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\\n\\n#define int i64\\ntuple<int, int, int, int> solve(int H, int h, int m, int s) {\\n const int D = 119 * H - 1;\\n const int M = H * 60 * 60 * D;\\n int d = 0;\\n while(true) {\\n bool ok = [&] {\\n int rs = H * 60 * (s * D + d);\\n int rm = H * ((m * 60 + s) * D + d);\\n int rh = ((h * 60 + m) * 60 + s) * D + d;\\n if(rm == rh) return false;\\n int dm = rm - rs; if(dm < 0) dm += M;\\n int dh = rs - rh; if(dh < 0) dh += M;\\n return dm == dh;\\n }();\\n if(ok) {\\n int u = s * D + d;\\n int l = D;\\n const int g = gcd(u, l);\\n return {h, m, u / g, l / g};\\n }\\n\\n d++;\\n if(d == D ) s++, d=0;\\n if(s == 60) m++, s=0;\\n if(m == 60) h++, m=0;\\n if(h == H ) h=0;\\n }\\n assert(0);\\n}\\n#undef int\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n \\n while(true) {\\n int H, h, m, s; cin >> H >> h >> m >> s; if(H == 0) return 0;\\n auto [ho, mo, n, d] = solve(H, h, m, s);\\n cout << ho << \\\" \\\" << mo << \\\" \\\" << n << \\\" \\\" << d << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3252,\n \"score_of_the_acc\": -0.181,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1338_8505526\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n while (1) {\\n int H, h, m, s;\\n cin >> H >> h >> m >> s;\\n if (!H)\\n break;\\n ll v = (H * 238 - 2);\\n ll div = v * H * 3600;\\n ll c = 0;\\n while (1) {\\n ll ns = (h * 3600 + m * 60 + s) * v + c;\\n ll d1 = ns * (H * 60 - 1), d2 = ns * H * 59;\\n d1 %= div, d2 %= div;\\n chmin(d1, div - d1);\\n chmin(d2, div - d2);\\n if (d1 != 0 && ns * H % div != ns % div && d1 == d2) {\\n ll g = gcd(ns % (v * 60), v); \\n cout << ns / (v * 3600) % H << ' ' << ns / (v * 60) % 60 << ' ' << ns % (v * 60) / g << ' ' << v / g << endl;\\n break;\\n }\\n c++;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.2469,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1338_6367691\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\n#define eps 1e-8L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\ntypedef long double ld;\\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\\n#define ALL(x) (x).begin(), (x).end()\\n\\n#define int long long\\n\\nint H, h, m, s, d;\\n\\nbool check()\\n{\\n ll x = 60 * H * s, y = (60 * m * d + s) * H, z = 3600 * h * d + 60 * m * d + s;\\n if (y == z)\\n return false;\\n ll dify = y - x, difz = x - z;\\n if (dify < 0)\\n dify += 3600 * H * d;\\n if (difz < 0)\\n difz += 3600 * H * d;\\n return dify == difz;\\n}\\n\\nvoid solve()\\n{\\n cin >> H >> h >> m >> s;\\n if(H == 0)\\n exit(0);\\n d = 119 * H - 1;\\n s *= d;\\n while (true)\\n {\\n if (check())\\n {\\n cout << h << \\\" \\\" << m << \\\" \\\" << s / gcd(s, d) << \\\" \\\" << d / gcd(s, d) << endl;\\n return;\\n }\\n s++;\\n if (s / d == 60)\\n s = 0, m++;\\n if (m == 60)\\n m = 0, h++;\\n if (h == H)\\n h = 0;\\n }\\n}\\n#undef int\\n\\n// generated by oj-template v4.7.2\\n// (https://github.com/online-judge-tools/template-generator)\\nint main()\\n{\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 10000;\\n // cin >> t; // comment out if solving multi testcase\\n for (int testCase = 1; testCase <= t; ++testCase)\\n {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.2826,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1338_5918445\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Clock {\\n int h, m, n, d;\\n Clock(int h_, int m_, int n_, int d_) : h(h_), m(m_), n(n_), d(d_) {\\n int g = gcd(n, d);\\n n /= g;\\n d /= g;\\n }\\n bool operator<(const Clock& rhs) const {\\n if (h != rhs.h) return h < rhs.h;\\n if (m != rhs.m) return m < rhs.m;\\n return n * rhs.d < rhs.n * d;\\n }\\n};\\n\\nbool check(int H, int h, int m, int n, int d) {\\n int pos_h = (h * 60 * 60 + m * 60) * 2 * d + 2 * n;\\n int pos_m = m * 60 * (2 * H) * d + (2 * H) * n;\\n return pos_h != pos_m;\\n}\\n\\nvoid solve(int H, int h, int m, int s) {\\n int speed = 120 * H - (H + 1);\\n vector<Clock> collision;\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < 60; j++) {\\n int tmp = ((H + 1) * (i * 60 * 60 + j * 60)) % (7200 * H);\\n vector<int> v = {tmp, (tmp + 3600 * H) % (7200 * H)};\\n if (v[0] > v[1]) swap(v[0], v[1]);\\n for (int _ = 0; _ < 2; _++) {\\n int pos_mid = v[_];\\n if (pos_mid >= 60 * speed) continue;\\n if (!check(H, i, j, pos_mid, speed)) continue;\\n collision.emplace_back(i, j, pos_mid, speed);\\n }\\n }\\n }\\n auto itr = lower_bound(collision.begin(), collision.end(), Clock(h, m, s, 1));\\n if (itr == collision.end()) itr = collision.begin();\\n auto ans = *itr;\\n cout << ans.h << ' ' << ans.m << ' ' << ans.n << ' ' << ans.d << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int H, h, m, s;\\n while (cin >> H >> h >> m >> s, H) solve(H, h, m, s);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.3867,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1338_5918442\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n#pragma endregion\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nstruct Clock {\\n int h, m, n, d;\\n Clock(int h_, int m_, int n_, int d_) : h(h_), m(m_), n(n_), d(d_) {\\n int g = gcd(n, d);\\n n /= g;\\n d /= g;\\n }\\n bool operator<(const Clock& rhs) const {\\n if (h != rhs.h) return h < rhs.h;\\n if (m != rhs.m) return m < rhs.m;\\n return n * rhs.d < rhs.n * d;\\n }\\n};\\n\\nbool check(int H, int h, int m, int n, int d) {\\n int pos_h = (h * 60 * 60 + m * 60) * 2 * d + 2 * n;\\n int pos_m = m * 60 * (2 * H) * d + (2 * H) * n;\\n return pos_h != pos_m;\\n}\\n\\nvoid solve(int H, int h, int m, int s) {\\n int speed = 120 * H - (H + 1);\\n vector<Clock> collision;\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < 60; j++) {\\n int tmp = ((H + 1) * (i * 60 * 60 + j * 60)) % (7200 * H);\\n vector<int> v = {tmp, (tmp + 3600 * H) % (7200 * H)};\\n if (v[0] > v[1]) swap(v[0], v[1]);\\n for (int _ = 0; _ < 2; _++) {\\n int pos_mid = v[_];\\n if (pos_mid >= 60 * speed) continue;\\n if (!check(H, i, j, pos_mid, speed)) continue;\\n collision.emplace_back(i, j, pos_mid, speed);\\n }\\n }\\n }\\n auto itr = lower_bound(collision.begin(), collision.end(), Clock(h, m, s, 1));\\n if (itr == collision.end()) itr = collision.begin();\\n auto ans = *itr;\\n cout << ans.h << ' ' << ans.m << ' ' << ans.n << ' ' << ans.d << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int H, h, m, s;\\n while (cin >> H >> h >> m >> s, H) solve(H, h, m, s);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.4654,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1338_5286204\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <iostream>\\n#include <limits>\\n#include <numeric>\\n#include <type_traits>\\n#include <bitset>\\n#include <map>\\n#include <cassert>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)\\n#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)\\n\\npair<ll,ll> vmin(pair<ll,ll> x,pair<ll,ll> y){\\n\\n if (x.second < 0){\\n x.first *= -1;\\n x.second *= -1;\\n }\\n\\n if (y.second < 0){\\n y.first *= -1;\\n y.second *= -1;\\n }\\n if (y.first < 0) {\\n return x;\\n }\\n\\n assert ( (x.first * y.second) / y.second == x.first);\\n assert ( (y.first * x.second) / x.second == y.first);\\n\\n if (x.first * y.second > y.first * x.second){\\n return y;\\n }else{\\n return x;\\n }\\n\\n}\\n\\nll modplus(ll a, ll b) {\\n a %= b;\\n return (a + b) % b;\\n}\\n\\nint main(){\\n\\n while (true){\\n\\n ll H,h,m,s;\\n scanf (\\\"%lld%lld%lld%lld\\\",&H,&h,&m,&s);\\n\\n\\n\\n if ( H == 0 && h == 0 && m == 0 && s == 0 ){\\n break;\\n }\\n\\n pair<ll,ll> ans = {INT_MAX-1000,1};\\n\\n { // H-1\\n ll mod = 3600 * H;\\n ll hang = ( (3600*h + 60*m + s) * 1) % mod;\\n ll mang = ( (60*m+s) * H ) % mod;\\n ll sang = ( s * (60*H) ) % mod;\\n ll hch = 1;\\n ll mch = H;\\n ll sch = 60*H;\\n ll pl = H-1;\\n mod *= pl;\\n hang *= pl;\\n mang *= pl;\\n sang *= pl;\\n\\n rep(i,0,120*pl){\\n\\n if (modplus(sang-mang, mod) == modplus(sang-hang, mod) || modplus(sang-mang+sang-hang, mod) == 0){\\n\\n\\n if ( sang % mod != mang % mod && mang % mod != hang % mod && sang % mod != hang % mod ){\\n pair<ll,ll> nans = {i,pl};\\n ans = vmin(ans,nans);\\n }\\n\\n }\\n sang += sch ; sang %= mod;\\n mang += mch ; mang %= mod;\\n hang += hch ; hang %= mod;\\n }\\n }\\n\\n\\n\\n { // 119H-1\\n ll mod = 3600 * H;\\n ll hang = ( (3600*h + 60*m + s) * 1) % mod;\\n ll mang = ( (60*m+s) * H ) % mod;\\n ll sang = ( s * (60*H) ) % mod;\\n ll hch = 1;\\n ll mch = H;\\n ll sch = 60*H;\\n ll pl = 119*H-1;\\n mod *= pl;\\n hang *= pl;\\n mang *= pl;\\n sang *= pl;\\n\\n rep(i,0,120*pl){\\n\\n// if (i == 43200) {\\n// cout << mod << endl;\\n// cout << i << \\\" \\\" << pl << \\\" \\\" << sang << \\\" \\\" << mang << \\\" \\\" << hang << endl;\\n// cout << sang - mang << \\\" \\\" << sang - hang << endl;\\n// }\\n if ( modplus(sang-mang, mod) == modplus(sang-hang, mod) || modplus(sang-mang+sang-hang, mod) == 0){\\n\\n if ( (sang % mod != mang % mod && mang % mod != hang % mod && sang % mod != hang % mod) ){\\n pair<ll,ll> nans = {i,pl};\\n ans = vmin(ans,nans);\\n }\\n\\n\\n }\\n sang += sch ; sang %= mod;\\n mang += mch ; mang %= mod;\\n hang += hch ; hang %= mod;\\n }\\n }\\n\\n ll su = s*ans.second + ans.first;\\n ll sd = ans.second;\\n\\n //cerr << ans.first << \\\" \\\" << ans.second << endl;\\n\\n ll plusm = (su/sd)/60;\\n su -= plusm * 60 * sd;\\n\\n m += plusm;\\n\\n\\n while (m >= 60){\\n m -= 60;\\n h += 1;\\n }\\n h %= H;\\n\\n ll g = __gcd(su,sd);\\n su /= g;\\n sd /= g;\\n\\n assert (INT_MAX-1000 >= ans.first);\\n printf (\\\"%lld %lld %lld %lld\\\\n\\\",h,m,su,sd);\\n\\n }\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7330,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -1.362,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1338_5270985\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\n\\nbool solve() {\\n ll H, h0, m0, s0;\\n cin >> H >> h0 >> m0 >> s0;\\n if ((H | h0 | m0 | s0) == 0) return false;\\n\\n ll X = 119 * H - 1;\\n ll T = (60ll * 60 * h0 + 60 * m0 + s0) * X;\\n ll round = X * 60ll * 60 * H;\\n\\n auto check = [&](ll t) {\\n ll x = t % round;\\n ll y = (t * H) % round;\\n ll z = (t * 60 * H) % round;\\n if (x == y) return false;\\n if ((x + y) % round == (z * 2 % round)) return true;\\n return false;\\n };\\n\\n while (!check(T)) { T++; }\\n\\n dmp(T);\\n\\n ll h = (T / (X * 60 * 60)) % H;\\n ll m = (T / (X * 60)) % 60;\\n ll n = T % (X * 60);\\n ll d = X;\\n\\n ll g = gcd(n, d);\\n n /= g;\\n d /= g;\\n\\n cout << h << ' ' << m << ' ' << n << ' ' << d << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n fastio();\\n while (solve()) {}\\n // int t;\\n // cin >> t;\\n // while (t--) solve();\\n\\n // int t; cin >> t;\\n // for(int i=1;i<=t;i++){\\n // cout << \\\"Case #\\\" << i << \\\": \\\";\\n // solve();\\n // }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.3086,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1338_5012062\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing PII = pair<ll, ll>;\\n\\n#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(x) x.begin(), x.end()\\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\\n\\nconst ll INF = 1LL << 60;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\n// BEGIN CUT\\n// 分数ライブラリ\\n// 常に約分されているとする\\n// 負のときは常にaを負にする\\nstruct fraction {\\n ll a, b;\\n fraction(ll x = 0, ll y = 1) : a(x), b(y) {\\n ll g = __gcd(a, b);\\n a /= g, b /= g;\\n if (b < 0)\\n a *= -1, b *= -1;\\n }\\n // comparator\\n bool operator<(fraction r) const { return a * r.b < b * r.a; }\\n bool operator>(fraction r) const { return a * r.b > b * r.a; }\\n bool operator<=(fraction r) const { return a * r.b <= b * r.a; }\\n bool operator>=(fraction r) const { return a * r.b >= b * r.a; }\\n bool operator==(fraction r) const { return a * r.b == b * r.a; }\\n bool operator!=(fraction r) const { return a * r.b != b * r.a; }\\n // Basic Operations\\n fraction operator+(fraction r) const { return fraction(*this) += r; }\\n fraction operator-(fraction r) const { return fraction(*this) -= r; }\\n fraction operator*(fraction r) const { return fraction(*this) *= r; }\\n fraction operator/(fraction r) const { return fraction(*this) /= r; }\\n fraction &operator+=(fraction r) {\\n ll g = __gcd(abs(a * r.b + b * r.a), b * r.b);\\n ll na = (a * r.b + b * r.a) / g, nb = (b * r.b) / g;\\n a = na, b = nb;\\n return *this;\\n }\\n fraction &operator-=(fraction r) {\\n ll g = __gcd(abs(a * r.b - b * r.a), b * r.b);\\n ll na = (a * r.b - b * r.a) / g, nb = (b * r.b) / g;\\n a = na, b = nb;\\n return *this;\\n }\\n fraction &operator*=(fraction r) {\\n ll g = __gcd(a * r.a, b * r.b);\\n a = a * r.a / g, b = b * r.b / g;\\n return *this;\\n }\\n fraction &operator/=(fraction r) {\\n ll g = __gcd(a * r.b, b * r.a);\\n a = a * r.b / g, b = b * r.a / g;\\n if (b < 0)\\n a *= -1, b *= -1;\\n return *this;\\n }\\n friend fraction abs(fraction a) {\\n a.a = abs(a.a);\\n return a;\\n }\\n // output\\n friend ostream &operator<<(ostream &os, fraction a) {\\n return os << a.a << \\\"/\\\" << a.b;\\n }\\n};\\n// END CUT\\n\\nusing P = pair<fraction, bool>;\\n\\nint main() {\\n while (1) {\\n int H, h, m, s;\\n cin >> H >> h >> m >> s;\\n if (H == 0)\\n break;\\n int day = H * 3600;\\n fraction vh = fraction(1, 10 * H);\\n fraction vm = fraction(1, 10);\\n fraction vs = fraction(6);\\n vector<P> vec;\\n //秒針と分針\\n auto diff = fraction(m * 60 + s, 10) - fraction(s * 6);\\n if (diff <= 0)\\n diff += 360;\\n auto t = diff / (vs - vm);\\n while (t <= day) {\\n vec.emplace_back(t, 0);\\n t += fraction(360) / (vs - vm);\\n }\\n diff += 180;\\n if (diff > 360)\\n diff -= 360;\\n t = diff / (vs - vm);\\n while (t <= day) {\\n vec.emplace_back(t, 0);\\n t += fraction(360) / (vs - vm);\\n }\\n //秒針と時針\\n diff = fraction(h * 3600 + m * 60 + s, 10 * H) - fraction(s * 6);\\n if (diff <= 0)\\n diff += 360;\\n t = diff / (vs - vh);\\n while (t <= day) {\\n vec.emplace_back(t, 1);\\n t += fraction(360) / (vs - vh);\\n }\\n diff += 180;\\n if (diff > 360)\\n diff -= 360;\\n t = diff / (vs - vh);\\n while (t <= day) {\\n vec.emplace_back(t, 1);\\n t += fraction(360) / (vs - vh);\\n }\\n sort(ALL(vec));\\n auto diff_m = fraction(m * 60 + s, 10) - fraction(s * 6);\\n vm = vs - vm;\\n if (diff_m < 0)\\n diff_m += 360;\\n if (diff_m > 180) {\\n diff_m = fraction(360) - diff_m;\\n } else {\\n vm *= -1;\\n }\\n auto diff_h = fraction(h * 3600 + m * 60 + s, 10 * H) - fraction(s * 6);\\n vh = vs - vh;\\n if (diff_h < 0)\\n diff_h += 360;\\n if (diff_h > 180) {\\n diff_h = fraction(360) - diff_h;\\n } else {\\n vh *= -1;\\n }\\n fraction prev = 0;\\n fraction ans;\\n for (P p : vec) {\\n auto T = p.first - prev;\\n if ((vm < 0 && vh > 0) || (vm > 0 && vh < 0)) {\\n auto x = (diff_m - diff_h) / (vh - vm);\\n if (diff_m + vm * x != 0 && x >= 0 && x <= T) {\\n ans = prev + x;\\n break;\\n }\\n }\\n diff_m += vm * T;\\n diff_h += vh * T;\\n if (p.second)\\n vh *= -1;\\n else\\n vm *= -1;\\n prev = p.first;\\n }\\n ans += 3600 * h + 60 * m + s;\\n if (ans >= day)\\n ans -= day;\\n ll sec = ans.a / ans.b;\\n ans -= sec;\\n ans += sec % 60;\\n cout << sec / 3600 << \\\" \\\" << (sec % 3600) / 60 << \\\" \\\" << ans.a << \\\" \\\"\\n << ans.b << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 4356,\n \"score_of_the_acc\": -1.0534,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1338_4918624\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\nconstexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\n//constexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nlong long int dif(long long int a, long long int b, long long int mx) {\\n\\treturn min(abs(a - b), mx - abs(a - b));\\n}\\n\\nlong long int gcd(long long int a, long long int b) {\\n\\twhile (b) {\\n\\t\\ta %= b;\\n\\t\\tswap(a, b);\\n\\t}\\n\\treturn a;\\n}\\n\\nvoid Output(long long int p) {\\n\\tcout << p / (119 * H - 1)/3600 << \\\" \\\";\\n\\tp %= (119 * H - 1) * 3600;\\n\\tcout << p / (119 * H - 1) / 60 << \\\" \\\";\\n\\tp %= (119 * H - 1) * 60;\\n\\tlong long int g = gcd(p, 119 * H - 1);\\n\\tcout << p / g << \\\" \\\" << (119 * H - 1) / g << endl;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tint h, m, s;\\n\\twhile (cin >> H >> h >> m >> s, H) {\\n\\t\\tint by = 119 * H - 1;\\n\\t\\tlong long int st = h * 3600 + m * 60 + s;\\n\\t\\tlong long int mod = by * H * 60 * 60;\\n\\t\\tst *= by;\\n\\t\\tlong long int hp = st;\\n\\t\\tlong long int mp = hp * H;\\n\\t\\tlong long int sp = mp * 60;\\n\\t\\tmp %= mod;\\n\\t\\tsp %= mod;\\n\\t\\tdo {\\n\\t\\t//\\tcout << st << \\\" \\\" << hp << \\\" \\\" << mp << \\\" \\\" << sp << endl;\\n\\t\\t\\tif (dif(hp, sp, mod) == dif(mp, sp, mod) && dif(hp, mp, mod)) {\\n\\t\\t\\t\\tOutput(st);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tst++;\\n\\t\\t\\tst %= mod;\\n\\t\\t\\thp++;\\n\\t\\t\\thp %= mod;\\n\\t\\t\\tmp += H;\\n\\t\\t\\tmp %= mod;\\n\\t\\t\\tsp += 60 * H;\\n\\t\\t\\tsp %= mod;\\n\\t\\t} while (1);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.0913,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1338_4894664\",\n \"code_snippet\": \"// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1338\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T>\\nstruct fraction{\\n T num,dom;\\n fraction(T n,T d):num(n),dom(d){\\n assert(dom!=0);\\n if(dom<0) num*=-1,dom*=-1;\\n T tmp=__gcd(abs(num),abs(dom));\\n num/=tmp;\\n dom/=tmp;\\n }\\n fraction operator+(const fraction a) const{\\n return fraction(num*a.dom+a.num*dom,dom*a.dom);\\n }\\n fraction operator-(const fraction a) const{\\n return fraction(num*a.dom-a.num*dom,dom*a.dom);\\n }\\n fraction operator*(const fraction a) const{\\n return fraction(num*a.num,dom*a.dom);\\n }\\n fraction operator/(const fraction a){\\n return fraction(num*a.dom,dom*a.num);\\n }\\n fraction operator*(T k) const{return fraction(num*k,dom);}\\n fraction operator/(T k) const{return fraction(num,dom*k);}\\n#define define_cmp(op) \\\\\\n bool operator op (const fraction a)const{return num*a.dom op a.num*dom;}\\n define_cmp(==)\\n define_cmp(!=)\\n define_cmp(<)\\n define_cmp(>)\\n define_cmp(<=)\\n define_cmp(>=)\\n#undef define_cmp\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nusing ll = long long;\\nusing frac = fraction<ll>;\\n\\nint H,h,m,s;\\nvoid print(frac f){\\n int t=f.num/(f.dom*60);\\n cout<<(t%(60*H))/60<<\\\" \\\";\\n cout<<(t%60)<<\\\" \\\";\\n cout<<(f.num)%(f.dom*60)<<\\\" \\\"<<f.dom<<endl;\\n}\\n\\nfrac norm2(frac a){\\n if(a.num==0) return frac(0,1);\\n while(a.num<0) a.num+=a.dom;\\n while(a.num>=a.dom) a.num-=a.dom;\\n ll tmp=__gcd(a.num,a.dom);\\n return frac(a.num/tmp,a.dom/tmp);\\n}\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n while(cin>>H>>h>>m>>s,H){\\n const frac base(h*3600+m*60+s,1);\\n const frac vh(1,3600*H),vm(1,3600),vs(1,60);\\n frac t(max(h*3600+m*60+s-100,0),1);\\n while(1){\\n frac x=norm2(t*vh);\\n frac y=norm2(t*vm);\\n frac z=norm2(t*vs);\\n if(y<x) y=y+frac(1,1);\\n if(z<x) z=z+frac(1,1);\\n frac ans(10000000,1);\\n {\\n frac t1=frac(1,1)-(z-x);\\n frac t2=z-y;\\n frac tmp=t+(t1-t2)/(vs*2-(vh+vm));\\n if(base<=tmp){\\n frac a=norm2(tmp*vh);\\n frac b=norm2(tmp*vm);\\n frac c=norm2(tmp*vs);\\n if(b<a) b=b+frac(1,1);\\n if(c<a) c=c+frac(1,1);\\n if(b<c){\\n t1=frac(1,1)-(c-a);\\n t2=c-b;\\n if(a!=b&&b!=c&&c!=a&&t1==t2)\\n ans=min(ans,tmp);\\n }\\n }\\n }\\n {\\n frac t1=z-x;\\n frac t2=y-z;\\n frac tmp=t+(t2-t1)/(vs*2-(vh+vm));\\n if(base<=tmp){\\n frac a=norm2(tmp*vh);\\n frac b=norm2(tmp*vm);\\n frac c=norm2(tmp*vs);\\n if(b<a) b=b+frac(1,1);\\n if(c<a) c=c+frac(1,1);\\n if(b>c){\\n t1=c-a;\\n t2=b-c;\\n if(a!=b&&b!=c&&c!=a&&t1==t2)\\n ans=min(ans,tmp);\\n }\\n }\\n }\\n if(ans!=frac(10000000,1)){\\n print(ans);\\n break;\\n }\\n t=t+frac(1,1);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.1616,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1338_4803791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=100005,INF=1<<30;\\n\\nll gcd(ll a,ll b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n ll H,h,m,s;cin>>H>>h>>m>>s;\\n \\n if(H==0) break;\\n \\n ll d=119*H-1,l=3600*H*d;\\n ll nowh=(3600*h+60*m+s)*d,nowm=(60*m*H+s*H)*d,nows=(60*s*H)*d;\\n for(int t=0;;t++){\\n if(t){\\n nowh+=1;\\n nowm+=H;\\n nows+=60*H;\\n \\n if(nowh>=l) nowh-=l;\\n if(nowm>=l) nowm-=l;\\n if(nows>=l) nows-=l;\\n }\\n \\n ll d1=abs(nowh-nows);\\n if(d1>l/2) d1=l-d1;\\n \\n ll d2=abs(nowm-nows);\\n if(d2>l/2) d2=l-d2;\\n \\n if(nowh==nowm) continue;\\n if(nowm==nows) continue;\\n if(nows==nowh) continue;\\n \\n if(d1==d2){\\n ll x=t/d;\\n s+=x;\\n m+=s/60;\\n s%=60;\\n \\n h+=m/60;\\n m%=60;\\n \\n h%=H;\\n \\n t%=d;\\n \\n ll g=gcd(t,d);\\n t/=g;\\n d/=g;\\n \\n cout<<h<<\\\" \\\"<<m<<\\\" \\\"<<s*d+t<<\\\" \\\"<<d<<endl;\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.0993,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1338_3991881\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\nint H, ha, ma, sa;\\n\\nint gcd(int a, int b) {\\n if(a == 0) return b;\\n if(b == 0) return a;\\n if(a < b) swap(a, b);\\n if(a % b == 0) return b;\\n return gcd(b, a % b);\\n}\\n\\nstruct Clock {\\n int h, m, n, d;\\n Clock(int _h, int _m, int _n, int _d) {\\n h = _h;\\n m = _m;\\n n = _n;\\n d = _d;\\n int g = gcd(n, d);\\n n /= g;\\n d /= g;\\n }\\n};\\n\\nbool operator <(Clock a, Clock b) {\\n if(a.h != b.h) return a.h < b.h;\\n if(a.m != b.m) return a.m < b.m;\\n return a.n * b.d < b.n * a.d;\\n}\\n\\nbool operator <=(Clock a, Clock b) {\\n if(a.h != b.h) return a.h < b.h;\\n if(a.m != b.m) return a.m < b.m;\\n return a.n * b.d <= b.n * a.d;\\n}\\n\\nsigned main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n while(true) {\\n cin >> H >> ha >> ma >> sa;\\n if(H == 0 && ha == 0 && ma == 0 && sa == 0) break;\\n Clock a(ha, ma, sa, 1);\\n Clock ans(-1, -1, 0, 1);\\n for(int h = 0; h < H; h++) {\\n for(int m = 0; m < 60; m++) {\\n for(int delta = -1; delta <= 1; delta++) {\\n int Left = delta * 3600 * H + 60 * 60 * h + 60 * m * (H + 1);\\n if(Left < 0) continue;\\n if(Left >= 60 * (H * 120 - H - 1)) continue;\\n Clock now(h, m, Left, H * 120 - H - 1);\\n if(60 * now.m * now.d == 59 * now.n) continue;\\n if(ans.h == -1) {\\n ans = now;\\n } else if(ans < a && a <= now) {\\n ans = now;\\n } else if(a <= now && now < ans) {\\n ans = now;\\n } else if(now <= ans && ans < a) {\\n ans = now;\\n }\\n }\\n }\\n }\\n cout << ans.h << \\\" \\\" << ans.m << \\\" \\\" << ans.n << \\\" \\\" << ans.d << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.1534,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1338_3711051\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\\nint H,h,m,s;\\nbool check(long H,long h,long m,long s)\\n{\\n\\tfor(int r=-360;r<=360;r++)\\n\\t{\\n\\t\\tlong A=r*360*10*H+60*m*(H+1)+3600*h;\\n\\t\\tlong B=119*H-1;\\n\\t\\tlong d=gcd(A,B);\\n\\t\\tA/=d;\\n\\t\\tB/=d;\\n\\t\\tif(!(A>=60*B||s*B>A)&&!(h==0&&m==0&&A==0))\\n\\t\\t{\\n\\t\\t\\tcout<<h<<\\\" \\\"<<m<<\\\" \\\"<<A<<\\\" \\\"<<B<<endl;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nmain()\\n{\\n\\twhile(cin>>H>>h>>m>>s,H)\\n\\t{\\n\\t\\twhile(!check(H,h,m,s))\\n\\t\\t{\\n\\t\\t\\ts++;\\n\\t\\t\\tif(s==60)m++,s=0;\\n\\t\\t\\tif(m==60)h++,m=0;\\n\\t\\t\\tif(h==H)h=0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3008,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1338_3710901\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\nlong gcd(long a,long b){return b?gcd(b,a%b):a;}\\nint H,h,m,s;\\nbool check(long H,long h,long m,long s)\\n{\\n\\tfor(int r=-360;r<=360;r++)\\n\\t{\\n\\t\\tlong A=r*360*10*H+60*m*(H+1)+3600*h;\\n\\t\\tlong B=119*H-1;\\n\\t\\tlong d=gcd(A,B);\\n\\t\\tA/=d;\\n\\t\\tB/=d;\\n\\t\\tif(!(A>=60*B||s*B>A)&&!(h==0&&m==0&&A==0))\\n\\t\\t{\\n\\t\\t\\tcout<<h<<\\\" \\\"<<m<<\\\" \\\"<<A<<\\\" \\\"<<B<<endl;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nmain()\\n{\\n\\twhile(cin>>H>>h>>m>>s,H)\\n\\t{\\n\\t\\twhile(!check(H,h,m,s))\\n\\t\\t{\\n\\t\\t\\ts++;\\n\\t\\t\\tif(s==60)m++,s=0;\\n\\t\\t\\tif(m==60)h++,m=0;\\n\\t\\t\\tif(h==H)h=0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.0488,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1338_2947799\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\n#define fi first\\n#define se second\\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\\n#define rep(i,n) repl(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\n#define dbg(x) cout<<#x\\\"=\\\"<<x<<endl\\n#define mmax(x,y) (x>y?x:y)\\n#define mmin(x,y) (x<y?x:y)\\n#define maxch(x,y) x=mmax(x,y)\\n#define minch(x,y) x=mmin(x,y)\\n#define uni(x) x.erase(unique(all(x)),x.end())\\n#define exist(x,y) (find(all(x),y)!=x.end())\\n#define bcnt __builtin_popcount\\n\\n#define INF 1e16\\n\\nll t;\\nll H,h0,m0,s0;\\n\\nint main(){\\n while(1){\\n cin>>H>>h0>>m0>>s0;\\n if(H==0)break;\\n ll d=119*H-1;\\n ll n=s0*d;\\n ll h=h0,m=m0;\\n ll mod=360*10*H*d;\\n while(1){\\n ll ang_h=(3600*h*d+60*m*d+n)%mod;\\n ll ang_m=(60*H*m*d+H*n)%mod;\\n ll ang_s=(60*H*n)%mod;\\n ang_h=(ang_h-ang_s+mod)%mod;\\n ang_m=(ang_m-ang_s+mod)%mod;\\n if(ang_m!=ang_h&&min(ang_m,ang_h)==mod-max(ang_m,ang_h))break;\\n n++;\\n if(n==60*d)n=0,m++;\\n if(m==60)m=0,h++;\\n if(h==H)h=0;\\n }\\n ll g=__gcd(n,d);\\n cout<<h<<\\\" \\\"<<m<<\\\" \\\"<<n/g<<\\\" \\\"<<d/g<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.1027,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1338_2901754\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nusing pl = pair<ll,ll>;\\n\\nstruct TIME{\\n ll h,m;\\n pl s;\\n};\\n\\nvoid PRINT_T(TIME t){\\n printf(\\\"%lld %lld %lld %lld\\\\n\\\", t.h, t.m, t.s.fi, t.s.se);\\n}\\n\\nconst ll INF = 60*60*100*10;\\n\\nbool big(pl a, pl b){\\n return a.fi*b.se < b.fi*a.se;\\n}\\n\\npl norm(pl a){\\n ll G = __gcd(a.fi, a.se);\\n a.fi /= G;\\n a.se /= G;\\n return a;\\n}\\n\\nint H,x,y,z;\\n\\n// a から b\\npl sub(TIME a, TIME b){\\n pl p = a.s;\\n p.fi += p.se*60*(60*a.h+a.m);\\n\\n pl q = b.s;\\n q.fi += q.se*60*(60*b.h+b.m);\\n\\n while(big(q,p)) q.fi += H*3600*q.se;\\n p = norm(p);\\n q = norm(q);\\n\\n ll X = q.fi*p.se - p.fi*q.se;\\n ll Y = q.se*p.se;\\n pl res(X,Y);\\n res = norm(res);\\n\\n // printf(\\\" DIFF:\\\\n\\\");\\n // PRINT_T(a);\\n // PRINT_T(b);\\n // dbg(res);\\n return res;\\n}\\n\\nint main(){\\n while(cin >>H >>x >>y >>z,H){\\n ll T = 60*H;\\n\\n TIME base = {x,y,{z,1}};\\n\\n pl diff(INF,1);\\n TIME ans;\\n\\n auto upd = [&](ll p, ll q, int i, int j){\\n ll t = 60*i+j;\\n if(p>=0 && p/q<60){\\n pl s = norm({p,q});\\n // printf(\\\" CAND %d %d %lld/%lld :\\\", i,j,s.fi,s.se);\\n\\n pl th(60*t*s.se+s.fi, 60*T*s.se);\\n pl tm(60*j*s.se+s.fi, 3600*s.se);\\n pl ts(s.fi, s.se*60);\\n th = norm(th);\\n tm = norm(tm);\\n ts = norm(ts);\\n\\n if( th!=tm && th!=ts && tm!=ts ){\\n TIME tmp = {i,j,s};\\n pl td = sub(base, tmp);\\n if(big(td,diff)){\\n diff = td;\\n ans = tmp;\\n }\\n // printf(\\\"OK\\\");\\n }\\n // printf(\\\"\\\\n\\\");\\n }\\n };\\n\\n rep(i,H)rep(j,60){\\n ll t = 60*i+j;\\n\\n // 1つめ\\n ll p = 3600*t - 60*T*j;\\n ll q = T - 60;\\n upd(p,q,i,j);\\n\\n // 2つめ\\n p = 3600*t + 60*T*j;\\n q = 119*T - 60;\\n upd(p,q,i,j);\\n\\n // 3つめ\\n p = 3600*(T+t) + 60*T*j;\\n q = 119*T - 60;\\n upd(p,q,i,j);\\n\\n // 4つめ\\n p = 3600*(t-T) + 60*T*j;\\n q = 119*T - 60;\\n upd(p,q,i,j);\\n }\\n\\n PRINT_T(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.1526,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1338_2747801\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\nll calc(ll x,ll y){\\n\\n\\tif(x < y)swap(x,y);\\n\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn calc(y,x%y);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tint H,h,m,s;\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&H,&h,&m,&s);\\n\\t\\tif(H == 0 && h == 0 && m == 0 && s == 0)break;\\n\\n\\t\\tll bunbo = 119*H-1;\\n\\t\\tll bunshi = s*bunbo;\\n\\t\\tll h0 = h;\\n\\t\\tll m0 = m;\\n\\t\\tll deg_h,deg_m,deg_s,diff_1,diff_2;\\n\\t\\tll base;\\n\\n\\t\\twhile(true){\\n\\n\\t\\t\\tbase = 3600*H*bunbo;\\n\\n\\t\\t\\tdeg_h = (3600*h0*bunbo+60*m0*bunbo+bunshi)%base;\\n\\t\\t\\tdeg_m = (60*H*m0*bunbo+bunshi*H)%base;\\n\\t\\t\\tdeg_s = (60*H*bunshi)%base;\\n\\n\\t\\t\\tif(deg_h != deg_m){\\n\\t\\t\\t\\tdiff_1 = (deg_s-deg_h+base)%base;\\n\\t\\t\\t\\tdiff_2 = (deg_m-deg_s+base)%base;\\n\\t\\t\\t\\tif(diff_1 == diff_2)break;\\n\\t\\t\\t}\\n\\n\\t\\t\\tbunshi++;\\n\\t\\t\\tif(bunshi/60 == bunbo) {\\n\\t\\t\\t\\tbunshi = 0;\\n\\t\\t\\t\\tm0++;\\n\\t\\t\\t}\\n\\t\\t\\tif(m0 == 60) {\\n\\t\\t\\t\\tm0 = 0;\\n\\t\\t\\t\\th0++;\\n\\t\\t\\t}\\n\\t\\t\\tif(h0 == H) {\\n\\t\\t\\t\\th0 = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tll common = calc(bunshi,bunbo);\\n\\t\\tbunshi /= common;\\n\\t\\tbunbo /= common;\\n\\n\\t\\tprintf(\\\"%lld %lld %lld %lld\\\\n\\\",h0,m0,bunshi,bunbo);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.1739,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1338_2608620\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\n\\nint H, h, m, s;\\n\\n//! x / y\\nclass Frac{\\npublic:\\n using LL = long long;\\n LL x, y;\\n\\n Frac(LL x = 0, LL y = 1) : x(x), y(y) { red(); }\\n\\n LL gcd(LL x, LL y){\\n\\tif(y == 0) return x;\\n\\treturn gcd(y, x%y);\\n }\\n \\n void red(){\\n\\tif(x == 0){\\n\\t y = 1;\\n\\t return;\\n\\t}\\n\\tif(y < 0){\\n\\t x *= -1;\\n\\t y *= -1;\\n\\t}\\n\\t\\n\\tLL g = gcd(abs(x), y);\\n\\tx /= g;\\n\\ty /= g;\\n }\\n\\n Frac& operator += (const Frac& p){ x = x * p.y + y * p.x; y *= p.y; red(); return *this;}\\n Frac operator + (const Frac& p) const{ Frac q = *this;return q += p;}\\n Frac operator - () const { Frac q = *this; q.x *= -1; return q; }\\n Frac& operator -= (const Frac& p){ Frac q = -p; *this += q; return *this;}\\n Frac operator - (const Frac& p) const{ Frac q = *this; return q -= p;}\\n Frac& operator *= (const Frac& a){ x *= a.x; y *= a.y; red(); return *this;}\\n Frac operator * (Frac a) const{ Frac q = *this; return q *= a;}\\n Frac& operator /= (const Frac& a){ x *= a.y; y *= a.x; red(); return *this;}\\n Frac operator / (Frac a) const{ Frac q = *this; return q /= a;}\\n\\n bool operator < (const Frac &p) const{\\n\\treturn x * p.y < y * p.x;\\n }\\n bool operator <= (const Frac &p) const{\\n\\treturn *this < p || *this == p;\\n }\\n bool operator > (const Frac &p) const{\\n\\treturn p < *this;\\n }\\n bool operator >= (const Frac &p) const{\\n\\treturn *this > p || *this == p;\\n }\\n bool operator == (const Frac &p) const {\\n\\treturn x == p.x && y == p.y;\\n }\\n double getR() const { return x * 1. / y; }\\n friend ostream& operator <<(ostream& os, const Frac& p);\\n};\\nFrac abs(const Frac& q){ return Frac(abs(q.x), q.y); }\\nostream& operator <<(ostream& os, const Frac& p){\\n return os << p.x << \\\"/\\\" << p.y;\\n}\\n\\nvoid norm(Frac& t){\\n if(t.x < 0) t += 3600*H;\\n while(t >= 60 * 60 * H)\\n\\tt -= 60 * 60 * H;\\n}\\n\\nvoid normR(Frac& t){\\n if(t.x < 0) t += 360;\\n while(t >= 360)\\n\\tt -= 360;\\n}\\n\\nFrac dist(Frac& now, Frac& dst){\\n if(now <= dst) return dst - now;\\n return dst + 3600*H - now;\\n}\\n\\nvoid print(Frac& ans){\\n LL ah = ans.x / ans.y / 60 / 60;\\n LL am = ans.x / ans.y / 60 % 60;\\n Frac as = ans - ah*3600 - am*60;\\n cout << ah << \\\" \\\" << am << \\\" \\\" << as.x << \\\" \\\" << as.y << endl;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n while(cin>>H>>h>>m>>s,H){\\n\\tFrac now(h*3600+m*60+s);\\n\\t\\n\\tFrac ans(1e9, 1), ans_dt(1e9, 1);\\n\\tREP(th,H) REP(tm,60){\\n\\t for(int s1=-1;s1<=1;s1+=2){\\n\\t\\tfor(int s2=-1;s2<=1;s2+=2){\\n\\t\\t Frac c1(3600*th + 60*tm, 10*H);\\n\\t\\t Frac a1 = Frac(1, 10*H) - 6;\\n\\t\\t Frac c2(6*tm);\\n\\t\\t Frac a2 = Frac(1, 10) - 6;\\n\\n\\t\\t for(int ang=0;ang<=360;ang+=360){\\n\\t\\t\\tFrac ss = (c2 * s2 - c1 * s1 + ang) / (a1 * s1 - a2 * s2);\\n\\n\\t\\t\\tFrac rh = c1 + ss / (10*H);\\n\\t\\t\\tnormR(rh);\\n\\t\\t\\tFrac rm = c2 + ss / 10;\\n\\t\\t\\tnormR(rm);\\n\\t\\t\\tFrac rs = ss * 6;\\n\\t\\t\\tnormR(rs);\\n\\t\\t\\tif(rh == rm || rh == rs || rm == rs) continue;\\n\\t\\t\\tFrac nxt = ss + 3600*th + 60*tm;\\n\\t\\t\\tnorm(nxt);\\n\\t\\t\\tFrac dd = dist(now, nxt);\\n\\t\\t\\tif(dd < ans_dt){\\n\\t\\t\\t ans_dt = dd;\\n\\t\\t\\t ans = nxt;\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tprint(ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7030,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -1.045,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1338_2608617\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, const pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\n\\nint H, h, m, s;\\n\\n//! x / y\\nclass Frac{\\npublic:\\n using LL = long long;\\n LL x, y;\\n\\n Frac(LL x = 0, LL y = 1) : x(x), y(y) { red(); }\\n\\n LL gcd(LL x, LL y){\\n\\tif(y == 0) return x;\\n\\treturn gcd(y, x%y);\\n }\\n \\n void red(){\\n\\tif(x == 0){\\n\\t y = 1;\\n\\t return;\\n\\t}\\n\\tif(y < 0){\\n\\t x *= -1;\\n\\t y *= -1;\\n\\t}\\n\\t\\n\\tLL g = gcd(abs(x), y);\\n\\tx /= g;\\n\\ty /= g;\\n }\\n\\n Frac& operator += (const Frac& p){ x = x * p.y + y * p.x; y *= p.y; red(); return *this;}\\n Frac operator + (const Frac& p) const{ Frac q = *this;return q += p;}\\n Frac operator - () const { Frac q = *this; q.x *= -1; return q; }\\n Frac& operator -= (const Frac& p){ Frac q = -p; *this += q; return *this;}\\n Frac operator - (const Frac& p) const{ Frac q = *this; return q -= p;}\\n Frac& operator *= (const Frac& a){ x *= a.x; y *= a.y; red(); return *this;}\\n Frac operator * (Frac a) const{ Frac q = *this; return q *= a;}\\n Frac& operator /= (const Frac& a){ x *= a.y; y *= a.x; red(); return *this;}\\n Frac operator / (Frac a) const{ Frac q = *this; return q /= a;}\\n\\n bool operator < (const Frac &p) const{\\n\\treturn x * p.y < y * p.x;\\n }\\n bool operator <= (const Frac &p) const{\\n\\treturn *this < p || *this == p;\\n }\\n bool operator > (const Frac &p) const{\\n\\treturn p < *this;\\n }\\n bool operator >= (const Frac &p) const{\\n\\treturn *this > p || *this == p;\\n }\\n bool operator == (const Frac &p) const {\\n\\treturn x == p.x && y == p.y;\\n }\\n double getR() const { return x * 1. / y; }\\n friend ostream& operator <<(ostream& os, const Frac& p);\\n};\\nFrac abs(const Frac& q){ return Frac(abs(q.x), q.y); }\\nostream& operator <<(ostream& os, const Frac& p){\\n return os << p.x << \\\"/\\\" << p.y;\\n}\\n\\nvoid norm(Frac& t){\\n if(t.x < 0) t += 3600*H;\\n while(t >= 60 * 60 * H)\\n\\tt -= 60 * 60 * H;\\n}\\n\\nvoid normR(Frac& t){\\n if(t.x < 0) t += 360;\\n while(t >= 360)\\n\\tt -= 360;\\n}\\n\\nFrac dist(Frac& now, Frac& dst){\\n if(now <= dst) return dst - now;\\n return dst + 3600*H - now;\\n}\\n\\nvoid print(Frac& ans){\\n LL ah = ans.x / ans.y / 60 / 60;\\n LL am = ans.x / ans.y / 60 % 60;\\n Frac as = ans - ah*3600 - am*60;\\n cout << ah << \\\" \\\" << am << \\\" \\\" << as.x << \\\" \\\" << as.y << endl;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n while(cin>>H>>h>>m>>s,H){\\n\\tFrac now(h*3600+m*60+s);\\n\\t\\n\\tFrac ans(1e9, 1), ans_dt(1e9, 1);\\n\\tREP(th,H) REP(tm,60){\\n\\t for(int s1=-1;s1<=1;s1+=2){\\n\\t\\tfor(int s2=-1;s2<=1;s2+=2){\\n\\t\\t Frac c1(3600*th + 60*tm, 10*H);\\n\\t\\t Frac a1 = Frac(1, 10*H) - 6;\\n\\t\\t Frac c2(6*tm);\\n\\t\\t Frac a2 = Frac(1, 10) - 6;\\n\\n\\t\\t for(int ang=0;ang<=360;ang+=360){\\n\\t\\t\\tFrac ss = (c2 * s2 - c1 * s1 + ang) / (a1 * s1 - a2 * s2);\\n\\n\\t\\t\\tFrac rh = c1 + ss / (10*H);\\n\\t\\t\\tnormR(rh);\\n\\t\\t\\tFrac rm = c2 + ss / 10;\\n\\t\\t\\tnormR(rm);\\n\\t\\t\\tFrac rs = ss * 6;\\n\\t\\t\\tnormR(rs);\\n\\t\\t\\tif(rh == rm || rh == rs || rm == rs) continue;\\n\\t\\t\\tFrac nxt = ss + 3600*th + 60*tm;\\n\\t\\t\\tnorm(nxt);\\n\\t\\t\\tFrac dd = dist(now, nxt);\\n\\t\\t\\tif(dd < ans_dt){\\n\\t\\t\\t ans_dt = dd;\\n\\t\\t\\t ans = nxt;\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tLL ah = ans.x / ans.y / 60 / 60;\\n\\tLL am = ans.x / ans.y / 60 % 60;\\n\\tFrac as = ans - ah*3600 - am*60;\\n\\tcout << ah << \\\" \\\" << am << \\\" \\\" << as.x << \\\" \\\" << as.y << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7010,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -1.069,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":788,"cells":{"group_id":{"kind":"string","value":"aoj_1337_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nCount the Regions\nThere are a number of rectangles on the\nx-y\nplane. The four sides of the rectangles are parallel to either the\nx\n-axis or the\ny\n-axis, and all of the rectangles reside within a range specified later. There are no other constraints on the coordinates of the rectangles.\nThe plane is partitioned into regions surrounded by the sides of one or more rectangles. In an example shown in Figure C.1, three rectangles overlap one another, and the plane is partitioned into eight regions.\nRectangles may overlap in more complex ways. For example, two rectangles may have overlapped sides, they may share their corner points, and/or they may be nested. Figure C.2 illustrates such cases.\nYour job is to write a program that counts the number of the regions on the plane partitioned\nby the rectangles.\nInput\nThe input consists of multiple datasets. Each dataset is formatted as follows.\nn\nl\n1\nt\n1\nr\n1\nb\n1\nl\n2\nt\n2\nr\n2\nb\n2\n:\nl\nn\nt\nn\nr\nn\nb\nn\nA dataset starts with\nn\n(1 ≤\nn\n≤ 50), the number of rectangles on the plane. Each of the\nfollowing\nn\nlines describes a rectangle. The\ni\n-th line contains four integers,\nl\ni\n,\nt\ni\n,\nr\ni\n, and\nb\ni\n, which are the coordinates of the\ni\n-th rectangle; (\nl\ni\n,\nt\ni\n) gives the\nx-y\ncoordinates of the top left corner, and (\nr\ni\n,\nb\ni\n) gives that of the bottom right corner of the rectangle (0 ≤\nl\ni\n<\nr\ni\n≤ 10\n6\n, 0 ≤\nb\ni\n<\nt\ni\n≤ 10\n6\n, for 1 ≤\ni\n≤\nn\n). The four integers are separated by a space.\nThe input is terminated by a single zero.\nOutput\nFor each dataset, output a line containing the number of regions on the plane partitioned by the sides of the rectangles.\nFigure C.1. Three rectangles partition the plane into eight regions. This corresponds to the first dataset of the sample input. The\nx\n- and\ny\n-axes are shown for illustration purposes only, and therefore they do not partition the plane.\nFigure C.2. Rectangles overlapping in more complex ways. This corresponds to the\nsecond dataset.\nSample Input\n3\n4 28 27 11\n15 20 42 5\n11 24 33 14\n5\n4 28 27 11\n12 11 34 2\n7 26 14 16\n14 16 19 12\n17 28 27 21\n2\n300000 1000000 600000 0\n0 600000 1000000 300000\n0\nOutput for the Sample Input\n8\n6\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1337_10852755","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <map>\n#include <algorithm>\nusing namespace std;\nconst int maxn = 555;\nint l[maxn],r[maxn],t[maxn],b[maxn];\nint X[maxn],Y[maxn],g[maxn][maxn];\nmap<int,int>mpx;\nmap<int,int>mpy;\nint N,M;\nint dx[]={0,0,1,-1};\nint dy[]={1,-1,0,0};\nvoid dfs(int i,int j){\n g[i][j]=1;\n for(int k=0;k<4;k++){\n int x=i+dx[k],y=j+dy[k];\n if(x<0 || x>N || y<0 || y>M) continue;\n if(!g[x][y]){\n dfs(x,y);\n }\n }\n}\n\nint main()\n{\n// freopen(\"data.in\",\"r\",stdin);\n int n;\n while(scanf(\"%d\",&n)!=EOF && n){\n for(int i=0;i<n;i++){\n scanf(\"%d%d%d%d\",&l[i],&t[i],&r[i],&b[i]);\n X[i]=l[i];\n X[i+n]=r[i];\n Y[i]=t[i];\n Y[i+n]=b[i];\n }\n mpx.clear();\n mpx.clear();\n sort(X,X+n*2);\n sort(Y,Y+n*2);\n int t1=unique(X,X+n*2)-X;\n int t2=unique(Y,Y+n*2)-Y;\n for(int i=0;i<t1;i++)\n mpx[X[i]]=(i+1)*2;\n for(int i=0;i<t2;i++)\n mpy[Y[i]]=(i+1)*2;\n t1=(t1+1)*2+2;\n t2=(t2+1)*2+2;\n memset(g,0,sizeof g);\n for(int i=0;i<n;i++){\n int lb=mpx[l[i]],rb=mpx[r[i]],tb=mpy[t[i]],bb=mpy[b[i]];\n// printf(\"%d %d %d %d\\n\",lb,rb,tb,bb);\n for(int j=lb;j<=rb;j++)\n g[tb][j]=g[bb][j]=1;\n for(int j=bb;j<=tb;j++)\n g[j][lb]=g[j][rb]=1;\n }\n int ans=0;\n N=t2,M=t1;\n for(int i=0;i<=N;i++){\n for(int j=0;j<=M;j++){\n if(!g[i][j]){\n dfs(i,j);\n ans++;\n }\n }\n }\n printf(\"%d\\n\",ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":6460,"score_of_the_acc":-0.0426,"final_rank":16},{"submission_id":"aoj_1337_9684361","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct UnionFind{\n vector<int> par; int n;\n UnionFind(){}\n UnionFind(int _n):par(_n,-1),n(_n){}\n int root(int x){return par[x]<0?x:par[x]=root(par[x]);}\n bool same(int x,int y){return root(x)==root(y);}\n int size(int x){return -par[root(x)];}\n bool unite(int x,int y){\n x=root(x),y=root(y); if(x==y)return false;\n if(size(x)>size(y))swap(x,y);\n par[y]+=par[x]; par[x]=y; n--; return true;\n }\n};\n\n/**\n * @brief Union Find\n */\n\nint main() {\nwhile(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n vector<int> A(N), B(N), C(N), D(N);\n vector<int> X = {-inf,inf}, Y = {-inf,inf};\n rep(i,0,N) {\n cin >> A[i] >> B[i] >> C[i] >> D[i];\n swap(B[i], D[i]);\n A[i] *= 2;\n B[i] *= 2;\n C[i] *= 2;\n D[i] *= 2;\n X.push_back(A[i]-1),X.push_back(A[i]),X.push_back(A[i]+1);\n Y.push_back(B[i]-1),Y.push_back(B[i]),Y.push_back(B[i]+1);\n X.push_back(C[i]-1),X.push_back(C[i]),X.push_back(C[i]+1);\n Y.push_back(D[i]-1),Y.push_back(D[i]),Y.push_back(D[i]+1);\n }\n UNIQUE(X), UNIQUE(Y);\n rep(i,0,N) {\n A[i] = LB(X,A[i]);\n B[i] = LB(Y,B[i]);\n C[i] = LB(X,C[i]);\n D[i] = LB(Y,D[i]);\n }\n int H = X.size(), W = Y.size();\n vector<vector<bool>> G(H,vector<bool>(W,true));\n rep(i,0,N) {\n rep(j,A[i],C[i]+1) G[j][B[i]] = G[j][D[i]] = false;\n rep(j,B[i],D[i]+1) G[A[i]][j] = G[C[i]][j] = false;\n }\n int ANS = 0;\n vector<vector<int>> used(H,vector<int>(W,false));\n int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\n rep(i,0,H) {\n rep(j,0,W) {\n if (used[i][j]) continue;\n if (!G[i][j]) continue;\n ANS++;\n queue<pair<int,int>> Q;\n Q.push({i,j});\n used[i][j] = true;\n while(!Q.empty()) {\n auto [x,y] = Q.front();\n Q.pop();\n rep(k,0,4) {\n int nx = x + dx[k], ny = y + dy[k];\n if (0 <= nx && nx < H && 0 <= ny && ny < W) {\n if (!used[nx][ny] && G[nx][ny]) {\n used[nx][ny] = true;\n Q.push({nx,ny});\n }\n }\n }\n }\n }\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":110,"memory_kb":3488,"score_of_the_acc":-0.0205,"final_rank":11},{"submission_id":"aoj_1337_9506016","code_snippet":"#include \"bits/stdc++.h\"\n// @JASPER'S BOILERPLATE\nusing namespace std;\nusing ll = long long;\n\n#ifdef JASPER\n#include \"debug.h\"\n#else\n#define debug(...) 166\n#endif\n\n#define int long long\n\nconst int N = 55 * 2;\n\nint x[N], y[N], X[N], Y[N];\n\nint dx[] = {0, 0, -1, 1};\nint dy[] = {-1, 1, 0, 0};\n\nll a[N][N];\n\nvoid solve(int i, int j, int val) {\n if (a[i][j] != val) return;\n a[i][j] = -1;\n for (int k = 0; k < 4; ++k) {\n int ni = i + dx[k];\n int nj = j + dy[k];\n if (0 <= ni && ni < N && 0 <= nj && nj < N) {\n solve(ni, nj, val);\n }\n }\n}\n\n\nsigned main() {\n cin.tie(0) -> sync_with_stdio(0);\n \n #ifdef JASPER\n freopen(\"in1\", \"r\", stdin);\n #endif\n\n int n;\n while (cin >> n) {\n if (n == 0) break;\n \n memset(a, 0, sizeof a);\n vector <int> valX, valY;\n for (int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i] >> X[i] >> Y[i];\n valX.push_back(x[i]);\n valY.push_back(y[i]);\n\n valX.push_back(X[i]);\n valY.push_back(Y[i]);\n }\n\n sort(valX.begin(), valX.end());\n valX.resize(unique(valX.begin(), valX.end()) - valX.begin());\n\n sort(valY.begin(), valY.end());\n valY.resize(unique(valY.begin(), valY.end()) - valY.begin());\n\n for (int i = 0; i < n; ++i) {\n x[i] = (int) (lower_bound(valX.begin(), valX.end(), x[i]) - valX.begin() + 1);\n X[i] = (int) (lower_bound(valX.begin(), valX.end(), X[i]) - valX.begin() + 1);\n \n y[i] = (int) (lower_bound(valY.begin(), valY.end(), y[i]) - valY.begin() + 1);\n Y[i] = (int) (lower_bound(valY.begin(), valY.end(), Y[i]) - valY.begin() + 1);\n\n debug(x[i], y[i], X[i], Y[i]);\n\n for (int _x = x[i]; _x < X[i]; ++_x)\n for (int _y = Y[i]; _y < y[i]; ++_y) \n a[_x][_y] |= (1LL << i);\n }\n\n \n int ans = 0;\n for (int _x = 0; _x < N; ++_x) {\n for (int _y = 0; _y < N; ++_y) { \n if (a[_x][_y] >= 0) {\n solve(_x, _y, a[_x][_y]);\n ++ans;\n }\n\n }\n }\n\n cout << ans << \"\\n\";\n\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4008,"score_of_the_acc":-0.0119,"final_rank":7},{"submission_id":"aoj_1337_9277459","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i, a, b) for(ll i = a; i < b; i++)\n#define all(x) (x).begin(), (x).end()\n\nconst vector<int> dx = {0, 1, 0, -1};\nconst vector<int> dy = {1, 0, -1, 0};\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) return 0;\n vector<int> xs, ys;\n vector<int> l(n), t(n), r(n), b(n);\n rep(i,0,n){\n cin>>l[i]>>t[i]>>r[i]>>b[i];\n xs.push_back(l[i]);\n xs.push_back(r[i]);\n ys.push_back(t[i]);\n ys.push_back(b[i]);\n }\n xs.push_back(-1);\n ys.push_back(-1);\n sort(all(xs));\n xs.erase(unique(all(xs)), xs.end());\n sort(all(ys));\n ys.erase(unique(all(ys)), ys.end());\n\n const int M = 150;\n\n vector<vector<ll>> val(M, vector<ll>(M));\n rep(i,0,n){\n l[i]=lower_bound(all(xs), l[i])-xs.begin();\n r[i]=lower_bound(all(xs), r[i])-xs.begin();\n t[i]=lower_bound(all(ys), t[i])-ys.begin();\n b[i]=lower_bound(all(ys), b[i])-ys.begin();\n rep(x,l[i],r[i])rep(y,b[i],t[i]){\n val[x][y] |= 1LL<<i;\n }\n }\n\n int cnt = 0;\n vector<vector<bool>> visited(M, vector<bool>(M, false));\n rep(x,0,M)rep(y,0,M){\n if (visited[x][y]) continue;\n ++cnt;\n stack<pair<int,int>> st;\n st.push({x,y});\n visited[x][y] = true;\n while (!st.empty()) {\n auto [xx, yy] = st.top();\n st.pop();\n rep(k,0,4){\n int nx = xx+dx[k], ny = yy+dy[k];\n if (0 <= nx && nx < M && 0 <= ny && ny < M && !visited[nx][ny] && val[nx][ny] == val[x][y]) {\n visited[nx][ny] = true;\n st.push({nx, ny});\n }\n }\n }\n }\n cout << cnt << \"\\n\";\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3640,"score_of_the_acc":-0.0125,"final_rank":10},{"submission_id":"aoj_1337_8992586","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\n} // namespace macro\n\nusing namespace macro;\n#line 1 \"cp-library/src/data_structure/union_find.hpp\"\nclass union_find {\n public:\n union_find(int n) : data(n, -1) {}\n int unite(int x, int y) {\n x = root(x), y = root(y);\n if(x != y) {\n if(size(x) < size(y)) swap(x, y);\n data[x] += data[y];\n return data[y] = x;\n }\n return -1;\n }\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n int size(int x) { return -data[root(x)]; }\n bool same(int x, int y) { return root(x) == root(y); }\n\n private:\n vector<int> data;\n};\n#line 4 \"A.cpp\"\n\nint solve(int n) {\n vector<int> x1(n), y1(n), x2(n), y2(n);\n for(int i : rep(n)) {\n x1[i] = in(), y2[i] = in(), x2[i] = in(), y1[i] = in();\n x1[i] *= 2; x2[i] *= 2; y1[i] *= 2; y2[i] *= 2;\n }\n vector<int> vx, vy;\n for(int i : rep(n)) {\n vx.push_back(x1[i] - 1);\n vx.push_back(x1[i]);\n vx.push_back(x1[i] + 1);\n vx.push_back(x2[i] - 1);\n vx.push_back(x2[i]);\n vx.push_back(x2[i] + 1);\n\n vy.push_back(y1[i] - 1);\n vy.push_back(y1[i]);\n vy.push_back(y1[i] + 1);\n vy.push_back(y2[i] - 1);\n vy.push_back(y2[i]);\n vy.push_back(y2[i] + 1);\n }\n unique(vx);\n unique(vy);\n for(int i : rep(n)) {\n x1[i] = lower_bound(vx, x1[i]);\n x2[i] = lower_bound(vx, x2[i]);\n y1[i] = lower_bound(vy, y1[i]);\n y2[i] = lower_bound(vy, y2[i]);\n }\n\n const int x_lim = vx.size();\n const int y_lim = vy.size();\n vector g(x_lim, vector(y_lim, 0));\n for(int i : rep(n)) {\n for(int x = x1[i]; x <= x2[i]; x++) g[x][y1[i]] = g[x][y2[i]] = 1;\n for(int y = y1[i]; y <= y2[i]; y++) g[x1[i]][y] = g[x2[i]][y] = 1;\n }\n\n union_find uf(x_lim * y_lim);\n auto h = [&](int x, int y) { return x * y_lim + y; };\n for(int x : rep(x_lim)) for(int y : rep(y_lim)) if(g[x][y] == 0) {\n if(x + 1 < x_lim and g[x + 1][y] == 0) uf.unite(h(x, y), h(x + 1, y));\n if(y + 1 < y_lim and g[x][y + 1] == 0) uf.unite(h(x, y), h(x, y + 1));\n }\n\n set<int> st;\n for(int x : rep(x_lim)) for(int y : rep(y_lim)) if(g[x][y] == 0) st.insert(uf.root(h(x, y)));\n return st.size();\n}\n\nint main() {\n while(true) {\n int n = in();\n if(n == 0) return 0;\n print(solve(n));\n }\n}","accuracy":1,"time_ms":150,"memory_kb":4316,"score_of_the_acc":-0.0369,"final_rank":15},{"submission_id":"aoj_1337_8497886","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll=long long;\n\nstruct UnionFind{\n vector<ll>data;\n UnionFind(ll n):data(n,-1){}\n bool unite(ll a,ll b){\n a=root(a),b=root(b);\n if(a==b)return false;\n if(-data[a]< -data[b])swap(a,b);\n data[a]+=data[b];\n data[b]=a;\n return true;\n }\n bool find(ll a,ll b){return root(a)==root(b);}\n ll root(ll a){\n return data[a]<0?a:data[a]=root(data[a]);\n }\n ll size(ll a){\n return -data[root(a)];\n }\n};\n\nbool solve(){\n int n;cin>>n;\n if(n==0)return false;\n vector<int>l(n),t(n),r(n),b(n);\n map<int,int>X;\n map<int,int>Y;\n const int INF=1e8;\n X[-INF]=1;\n X[INF]=1;\n Y[-INF]=1;\n Y[INF]=1;\n auto Set=[&](int v,map<int,int>&mp){\n mp[v-1]=1;\n mp[v]=1;\n mp[v+1]=1;\n };\n for (int i = 0; i < n; ++i) {\n cin>>l[i]>>t[i]>>r[i]>>b[i];\n Set(l[i],X);\n Set(r[i],X);\n Set(t[i],Y);\n Set(b[i],Y);\n }\n int h=0;\n for(auto &[i,val]:X){\n val=h++;\n }\n int w=0;\n for(auto &[j,val]:Y){\n val=w++;\n }\n vector z(h,vector<ll>(w));\n for (int i = 0; i < n; ++i) {\n auto li=X[l[i]],rj=Y[t[i]];\n auto ri=X[r[i]],lj=Y[b[i]];\n z[li][lj]^=(1LL<<i);\n z[li][rj]^=(1LL<<i);\n z[ri][lj]^=(1LL<<i);\n z[ri][rj]^=(1LL<<i);\n }\n for (int i = 0; i < h; ++i) {\n for (int j = 1; j < w; ++j) {\n z[i][j]^=z[i][j-1];\n }\n }\n for (int i =1; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n z[i][j]^=z[i-1][j];\n }\n }\n UnionFind uni(h*w);\n vector<int>dx={0,-1,0,1};\n vector<int>dy={1,0,-1,0};\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int k = 0; k < 4; ++k) {\n auto i2=i+dx[k],j2=j+dy[k];\n if(i2<0 or i2>=h or j2<0 or j2>=w)continue;\n if(z[i][j]==z[i2][j2]){\n uni.unite(i*w+j,i2*w+j2);\n }\n }\n }\n }\n int ans=0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(uni.root(i*w+j)==i*w+j){\n ans++;\n }\n }\n }\n cout<<ans<<\"\\n\";\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":4616,"score_of_the_acc":-0.0453,"final_rank":17},{"submission_id":"aoj_1337_8475056","code_snippet":"// #define _GLIBCXX_DEBUG\n#pragma GCC optimize(\"O2,no-stack-protector,unroll-loops,fast-math\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < int(n); i++)\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\n#define each(e, v) for (auto& e : v)\n#define MM << \" \" <<\n#define pb push_back\n#define eb emplace_back\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\n int n = v.size();\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (v.empty()) cout << '\\n';\n}\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\ntemplate <typename T> bool chmax(T& x, const T& y) {\n return (x < y) ? (x = y, true) : false;\n}\ntemplate <typename T> bool chmin(T& x, const T& y) {\n return (x > y) ? (x = y, true) : false;\n}\ntemplate <class T>\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T> using maxheap = std::priority_queue<T>;\ntemplate <typename T> int lb(const vector<T>& v, T x) {\n return lower_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> int ub(const vector<T>& v, T x) {\n return upper_bound(begin(v), end(v), x) - begin(v);\n}\ntemplate <typename T> void rearrange(vector<T>& v) {\n sort(begin(v), end(v));\n v.erase(unique(begin(v), end(v)), end(v));\n}\n\n// __int128_t gcd(__int128_t a, __int128_t b) {\n// if (a == 0)\n// return b;\n// if (b == 0)\n// return a;\n// __int128_t cnt = a % b;\n// while (cnt != 0) {\n// a = b;\n// b = cnt;\n// cnt = a % b;\n// }\n// return b;\n// }\n\nstruct Union_Find_Tree {\n vector<int> data;\n const int n;\n int cnt;\n \n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\n \n int root(int x) {\n if (data[x] < 0) return x;\n return data[x] = root(data[x]);\n }\n \n int operator[](int i) { return root(i); }\n \n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false;\n if (data[x] > data[y]) swap(x, y);\n data[x] += data[y], data[y] = x;\n cnt--;\n return true;\n }\n \n int size(int x) { return -data[root(x)]; }\n \n int count() { return cnt; };\n \n bool same(int x, int y) { return root(x) == root(y); }\n \n void clear() {\n cnt = n;\n fill(begin(data), end(data), -1);\n }\n};\n\ntemplate <int mod> struct Mod_Int {\n int x;\n\n Mod_Int() : x(0) {}\n\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n static int get_mod() { return mod; }\n\n Mod_Int& operator+=(const Mod_Int& p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator-=(const Mod_Int& p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n Mod_Int& operator*=(const Mod_Int& p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n\n Mod_Int& operator/=(const Mod_Int& p) {\n *this *= p.inverse();\n return *this;\n }\n\n Mod_Int& operator++() { return *this += Mod_Int(1); }\n\n Mod_Int operator++(int) {\n Mod_Int tmp = *this;\n ++*this;\n return tmp;\n }\n\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\n\n Mod_Int operator--(int) {\n Mod_Int tmp = *this;\n --*this;\n return tmp;\n }\n\n Mod_Int operator-() const { return Mod_Int(-x); }\n\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\n\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\n\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\n\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\n\n bool operator==(const Mod_Int& p) const { return x == p.x; }\n\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\n\n Mod_Int inverse() const {\n assert(*this != Mod_Int(0));\n return pow(mod - 2);\n }\n\n Mod_Int pow(long long k) const {\n Mod_Int now = *this, ret = 1;\n for (; k > 0; k >>= 1, now *= now) {\n if (k & 1) ret *= now;\n }\n return ret;\n }\n\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\n return os << p.x;\n }\n\n friend istream& operator>>(istream& is, Mod_Int& p) {\n long long a;\n is >> a;\n p = Mod_Int<mod>(a);\n return is;\n }\n};\n\nll mpow2(ll x, ll n, ll mod) {\n ll ans = 1;\n x %= mod;\n while (n != 0) {\n if (n & 1) ans = ans * x % mod;\n x = x * x % mod;\n n = n >> 1;\n }\n ans %= mod;\n return ans;\n}\n\ntemplate <typename T> T modinv(T a, const T& m) {\n T b = m, u = 1, v = 0;\n while (b > 0) {\n T t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return u >= 0 ? u % m : (m - (-u) % m) % m;\n}\n\nll divide_int(ll a, ll b) {\n if (b < 0) a = -a, b = -b;\n return (a >= 0 ? a / b : (a - b + 1) / b);\n}\n\n// const int MOD = 1000000007;\nconst int MOD = 998244353;\nusing mint = Mod_Int<MOD>;\n\n// ----- library -------\n// ----- library -------\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (1) {\n int n;\n cin >> n;\n if (!n)\n break;\n vector<int> l(n), r(n), u(n), d(n);\n rep(i, n) cin >> l[i] >> d[i] >> r[i] >> u[i];\n vector<int> xs, ys;\n rep(i, n) xs.eb(l[i]), xs.eb(r[i]), ys.eb(u[i]), ys.eb(d[i]);\n xs.eb(-1e9), xs.eb(1e9), ys.eb(-1e9), ys.eb(1e9);\n rearrange(xs), rearrange(ys);\n rep(i, n) l[i] = lb(xs, l[i]), r[i] = lb(xs, r[i]), u[i] = lb(ys, u[i]), d[i] = lb(ys, d[i]);\n int h = sz(ys) - 1, w = sz(xs) - 1;\n vector<vector<int>> rf(h, vector<int>(w, 1)), cf(h, vector<int>(w, 1));\n rep(i, n) {\n rep2(t, l[i], r[i]) rf[u[i] - 1][t] = 0, rf[d[i] - 1][t] = 0;\n rep2(t, u[i], d[i]) cf[t][l[i] - 1] = 0, cf[t][r[i] - 1] = 0;\n }\n Union_Find_Tree uf(h * w);\n rep(i, h - 1) rep(j, w) if (rf[i][j]) uf.unite(i * w + j, (i + 1) * w + j);\n rep(i, h) rep(j, w - 1) if (cf[i][j]) uf.unite(i * w + j, i * w + j + 1);\n cout << uf.count() << '\\n';\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3536,"score_of_the_acc":-0.0047,"final_rank":2},{"submission_id":"aoj_1337_6987456","code_snippet":"#include <bits/stdc++.h>\n#include <complex>\n#include <random>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n#define tN(t) (t==1?XN:YN)\n#define tS(t) (t==1?XS:YS)\n#define tA(t) (t==1?XA:YA)\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\n\nvector<ll> fact, factinv, inv;\nll mod = 1e9 + 7;\nvoid prenCkModp(ll n) {\n fact.resize(n + 5);\n factinv.resize(n + 5);\n inv.resize(n + 5);\n fact.at(0) = fact.at(1) = 1;\n factinv.at(0) = factinv.at(1) = 1;\n inv.at(1) = 1;\n for (ll i = 2; i < n + 5; i++) {\n fact.at(i) = (fact.at(i - 1) * i) % mod;\n inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;\n factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;\n }\n\n}\nll nCk(ll n, ll k) {\n if (n < k) return 0;\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\n}\nll modPow(ll a, ll n, ll p) {\n ll res = 1;\n ll k = a;\n while (n > 0) {\n if (n % 2 == 1) {\n res *= k;\n if (res > p)res %= p;\n }\n k = k * k;\n if (k > p)k %= p;\n n /= 2;\n }\n return res;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n \n while(1){\n ll N;\n cin>>N;\n if(N==0)return 0;\n map<ll,ll> MX,MY;\n vector<pair<pair<ll,ll>,pair<ll,ll>>> P(N);\n rep(i,N){\n ll A,B,C,D;\n cin>>A>>B>>C>>D;\n swap(B,D);\n MX[A]=MX[C]=1;\n MY[B]=MY[D]=1;\n P[i]={{A,B},{C,D}};\n }\n ll k=0,p=0;\n for(auto x:MX){\n MX[x.first]=2*k+1;\n k++;\n }\n for(auto x:MY){\n MY[x.first]=2*p+1;\n p++;\n }\n vvll A(250,vll(250,0));\n rep(i,N){\n P[i].first.first=MX[P[i].first.first];\n P[i].first.second=MY[P[i].first.second];\n P[i].second.first=MX[P[i].second.first];\n P[i].second.second=MY[P[i].second.second];\n \n for(ll j=P[i].first.first;j<=P[i].second.first;j++){\n A[j][P[i].second.second]=1;\n A[j][P[i].first.second]=1;\n }\n for(ll j=P[i].first.second;j<=P[i].second.second;j++){\n A[P[i].second.first][j]=1;\n A[P[i].first.first][j]=1;\n }\n }\n //cout<<1<<endl;\n ll an=0;\n vll dx={1,0,-1,0};\n vll dy={0,1,0,-1};\n rep(i,250)rep(j,250){\n if(A[i][j]==1)continue;\n an++;\n queue<pair<ll,ll>> Q;\n Q.push({i,j});\n while(!Q.empty()){\n auto p=Q.front();\n Q.pop();\n if(A[p.first][p.second]==1)continue;\n A[p.first][p.second]=1;\n rep(d,4){\n ll nx=p.first+dx[d];\n ll ny=p.second+dy[d];\n if(nx<0||ny<0||nx>=250||ny>=250)continue;\n if(A[nx][ny]==1)continue;\n Q.push({nx,ny});\n }\n }\n }\n cout<<an<<endl;\n }\n}","accuracy":1,"time_ms":100,"memory_kb":3824,"score_of_the_acc":-0.0229,"final_rank":13},{"submission_id":"aoj_1337_6719103","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nstruct UF {\n V<int> par;\n UF(int n) : par(n, -1) {}\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\n bool merge(int x, int y) {\n x = leader(x), y = leader(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n int size(int x) { return -par[leader(x)]; }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N != 0) {\n V<int> l(N), t(N), r(N), b(N);\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\n rep(i, N) {\n zx.push_back(l[i]);\n zx.push_back(r[i]);\n zy.push_back(b[i]);\n zy.push_back(t[i]);\n }\n sort(zx.begin(), zx.end());\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\n sort(zy.begin(), zy.end());\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\n rep(i, N) {\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\n }\n int H = zx.size(), W = zy.size();\n V<V<ll>> imos(H + 1, V<ll>(W + 1, 0));\n rep(i, N) {\n imos[l[i]][b[i]] += 1LL << i;\n imos[l[i]][t[i]] -= 1LL << i;\n imos[r[i]][b[i]] -= 1LL << i;\n imos[r[i]][t[i]] += 1LL << i;\n }\n rep(x, H + 1) rep(y, W) imos[x][y + 1] += imos[x][y];\n rep(x, H) rep(y, W + 1) imos[x + 1][y] += imos[x][y];\n int M = (H + 1) * (W + 1);\n UF uf(M);\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n rep(x, H + 1) {\n rep(y, W + 1) {\n rep(k, 4) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\n if (imos[x][y] == imos[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\n }\n }\n }\n int ans = 0;\n rep(x, H + 1) {\n rep(y, W + 1) {\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\n ans++;\n }\n }\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3444,"score_of_the_acc":-0.0053,"final_rank":3},{"submission_id":"aoj_1337_6719075","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nstruct UF {\n V<int> par;\n UF(int n) : par(n, -1) {}\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\n bool merge(int x, int y) {\n x = leader(x), y = leader(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N != 0) {\n V<int> l(N), t(N), r(N), b(N);\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\n rep(i, N) {\n zx.push_back(l[i]);\n zx.push_back(r[i]);\n zy.push_back(b[i]);\n zy.push_back(t[i]);\n }\n sort(zx.begin(), zx.end());\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\n sort(zy.begin(), zy.end());\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\n rep(i, N) {\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\n }\n int H = zx.size(), W = zy.size();\n V<V<ll>> cum(H + 1, V<ll>(W + 1, 0));\n rep(i, N) {\n cum[l[i]][b[i]] += 1LL << i;\n cum[l[i]][t[i]] -= 1LL << i;\n cum[r[i]][b[i]] -= 1LL << i;\n cum[r[i]][t[i]] += 1LL << i;\n }\n rep(x, H) rep(y, W) cum[x + 1][y + 1] += cum[x + 1][y] + cum[x][y + 1] - cum[x][y];\n int M = (H + 1) * (W + 1);\n UF uf(M);\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n rep(x, H + 1) {\n rep(y, W + 1) {\n rep(k, 4) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\n if (cum[x][y] == cum[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\n }\n }\n }\n int ans = 0;\n rep(x, H + 1) {\n rep(y, W + 1) {\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\n ans++;\n }\n }\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3448,"score_of_the_acc":-0.0053,"final_rank":4},{"submission_id":"aoj_1337_6719074","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nstruct UF {\n V<int> par;\n UF(int n) : par(n, -1) {}\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\n bool merge(int x, int y) {\n x = leader(x), y = leader(y);\n if (x == y) return false;\n if (par[x] > par[y]) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n int size(int x) { return -par[leader(x)]; }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N;\n while (cin >> N, N != 0) {\n V<int> l(N), t(N), r(N), b(N);\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\n rep(i, N) {\n zx.push_back(l[i]);\n zx.push_back(r[i]);\n zy.push_back(b[i]);\n zy.push_back(t[i]);\n }\n sort(zx.begin(), zx.end());\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\n sort(zy.begin(), zy.end());\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\n rep(i, N) {\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\n }\n int H = zx.size(), W = zy.size();\n V<V<ll>> cum(H + 1, V<ll>(W + 1, 0));\n rep(i, N) {\n cum[l[i]][b[i]] += 1LL << i;\n cum[l[i]][t[i]] -= 1LL << i;\n cum[r[i]][b[i]] -= 1LL << i;\n cum[r[i]][t[i]] += 1LL << i;\n }\n rep(x, H) rep(y, W) cum[x + 1][y + 1] += cum[x + 1][y] + cum[x][y + 1] - cum[x][y];\n int M = (H + 1) * (W + 1);\n UF uf(M);\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n rep(x, H + 1) {\n rep(y, W + 1) {\n rep(k, 4) {\n int nx = x + dx[k], ny = y + dy[k];\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\n if (cum[x][y] == cum[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\n }\n }\n }\n int ans = 0;\n rep(x, H + 1) {\n rep(y, W + 1) {\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\n ans++;\n }\n }\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3520,"score_of_the_acc":-0.0062,"final_rank":5},{"submission_id":"aoj_1337_6458457","code_snippet":"#line 1 \"f.cpp\"\n/**\n *\tauthor: nok0\n *\tcreated: 2022.04.06 14:06:15\n**/\n#line 1 \"/Users/nok0/Documents/Programming/nok0/atcoder/dsu.hpp\"\n\n\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\n\n#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &...tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector<std::pair<char, int>> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector<std::pair<char, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate <class T>\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\n\tint n = v.size();\n\tstd::vector<std::pair<T, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector<int> iota(int n) {\n\tstd::vector<int> p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate <class T>\nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate <class U>\n\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector<T> cum;\n};\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) / 2;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 7 \"f.cpp\"\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nvoid main_() {\n\twhile(true) {\n\t\tINT(n);\n\t\tif(!n) break;\n\t\tusing T = tuple<int, int, int, int>;\n\t\tV<T> vec;\n\t\tV<> xp{-inf, inf}, yp{-inf, inf};\n\t\tREP(i, n) {\n\t\t\tINT(sx, gy, gx, sy);\n\t\t\txp.pb(sx);\n\t\t\txp.pb(gx);\n\t\t\typ.pb(sy);\n\t\t\typ.pb(gy);\n\t\t\tvec.pb(T(sx, sy, gx, gy));\n\t\t}\n\t\tauto rx = press(xp);\n\t\tauto ry = press(yp);\n\t\tint h = SZ(rx) - 1, w = SZ(ry) - 1;\n\t\tvector board(h, vector(w, 0));\n\t\tREP(k, n) {\n\t\t\tauto [sx, sy, gx, gy] = vec[k];\n\t\t\tsx = lb(rx, sx);\n\t\t\tgx = lb(rx, gx);\n\t\t\tsy = lb(ry, sy);\n\t\t\tgy = lb(ry, gy);\n\t\t\t//(sx, sy) - (gx,sy)\n\t\t\tREP(i, sx, gx) {\n\t\t\t\tboard[i][sy - 1] |= 1 << 1;\n\t\t\t\tboard[i][sy] |= 1 << 3;\n\t\t\t\tboard[i][gy - 1] |= 1 << 1;\n\t\t\t\tboard[i][gy] |= 1 << 3;\n\t\t\t}\n\t\t\tREP(i, sy, gy) {\n\t\t\t\tboard[sx - 1][i] |= 1 << 0;\n\t\t\t\tboard[sx][i] |= 1 << 2;\n\t\t\t\tboard[gx - 1][i] |= 1 << 0;\n\t\t\t\tboard[gx][i] |= 1 << 2;\n\t\t\t}\n\t\t}\n\t\tatcoder::dsu uf(h * w);\n\t\tREP(i, h) {\n\t\t\tREP(j, w) {\n\t\t\t\tint u = i * w + j;\n\t\t\t\tREP(k, 4) {\n\t\t\t\t\tif(!(board[i][j] >> k & 1)) {\n\t\t\t\t\t\tint nx = i + dx[k];\n\t\t\t\t\t\tint ny = j + dy[k];\n\t\t\t\t\t\tif(nx < 0 or nx >= h or ny < 0 or ny >= w) continue;\n\t\t\t\t\t\tint v = nx * w + ny;\n\t\t\t\t\t\tuf.merge(u, v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprint(SZ(uf.groups()));\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":3872,"score_of_the_acc":-0.012,"final_rank":8},{"submission_id":"aoj_1337_6020675","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define ll long long\n#define pp pair<ll,ll>\n#define ld long double\n#define all(a) (a).begin(),(a).end()\n#define mk make_pair\n#define difine define\nconstexpr int inf=1000001000;\nconstexpr ll INF=2e18;\nconstexpr ll MOD=1000000007;\nconstexpr ll mod=998244353;\nint dx[4]={1,-1,-1,1},dy[4]={1,-1,1,-1};\n\nvector<int> a(4);\nstring s;\n \n// #include <atcoder/all>\n// typedef atcoder::modint1000000007 mint;\n// typedef atcoder::modint998244353 mint;\n\nint main() {\n while(true){\n int n;\n cin >> n;\n if (n==0) break;\n set<int> sx,sy;\n vector<int> l(n),t(n),r(n),b(n);\n rep(i,n){\n cin >> l[i] >> t[i] >> r[i] >> b[i];\n sx.insert(l[i]);\n sx.insert(r[i]);\n sy.insert(t[i]);\n sy.insert(b[i]);\n }\n map<int,int> mx,my;\n int x=1,y=1;\n for (auto it=sx.begin();it!=sx.end();it++){\n int f=*it;\n mx[f]=x;\n x++;\n }\n for (auto it=sy.begin();it!=sy.end();it++){\n int f=*it;\n my[f]=y;\n y++;\n }\n x+=2;\n y+=2;\n rep(i,n){\n l[i]=mx[l[i]];\n r[i]=mx[r[i]];\n t[i]=my[t[i]];\n b[i]=my[b[i]];\n }\n vector<vector<int>> d(x,vector<int>(y,0));\n int ans=0;\n rep(i,x){\n rep(j,y){\n if (d[i][j]==1) continue;\n // cout << i << \" \" << j << endl;\n ans++;\n d[i][j]=1;\n queue<pair<int,int>> q;\n q.push({i,j});\n while(!q.empty()){\n auto [f,g]=q.front();\n q.pop();\n if (f+1!=x){\n bool ok=true;\n if (d[f+1][g]==1) ok=false;\n rep(k,n){\n if (g>=b[k] && g<t[k] && (f+1==l[k] || f+1==r[k])) ok=false;\n }\n if (ok){\n q.push({f+1,g});\n d[f+1][g]=1;\n }\n }\n if (f-1!=-1){\n bool ok=true;\n if (d[f-1][g]==1) ok=false;\n rep(k,n){\n if (g>=b[k] && g<t[k] && (f==l[k] || f==r[k])) ok=false;\n }\n if (ok){\n q.push({f-1,g});\n d[f-1][g]=1;\n }\n }\n if (g+1!=y){\n bool ok=true;\n if (d[f][g+1]==1) ok=false;\n rep(k,n){\n if (f>=l[k] && f<r[k] && (g+1==b[k] || g+1==t[k])) ok=false;\n }\n if (ok){\n q.push({f,g+1});\n d[f][g+1]=1;\n }\n }\n if (g-1!=-1){\n bool ok=true;\n if (d[f][g-1]==1) ok=false;\n rep(k,n){\n if (f>=l[k] && f<r[k] && (g==b[k] || g==t[k])) ok=false;\n }\n if (ok){\n q.push({f,g-1});\n d[f][g-1]=1;\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":290,"memory_kb":3136,"score_of_the_acc":-0.0458,"final_rank":18},{"submission_id":"aoj_1337_6020497","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing P = pair<int,int>;\n\nint main() {\n \n ios::sync_with_stdio(false);\n cin.tie(0);\n \n vector<int> di = {1,0,-1,0};\n vector<int> dj = {0,1,0,-1};\n int n;\n cin >> n;\n while (n != 0) {\n vector<int> l(n),t(n),r(n),b(n);\n for (int i=0;i<n;i++) {\n cin >> l[i] >> t[i] >> r[i] >> b[i];\n }\n vector<int> xs;\n vector<int> ys;\n for (int i=0;i<n;i++) {\n xs.emplace_back(l[i]);\n xs.emplace_back(r[i]);\n ys.emplace_back(t[i]);\n ys.emplace_back(b[i]);\n }\n xs.emplace_back(-100);\n xs.emplace_back(1e7);\n ys.emplace_back(-100);\n ys.emplace_back(1e7);\n sort(xs.begin(),xs.end());\n sort(ys.begin(),ys.end());\n auto itx = unique(xs.begin(),xs.end());\n auto ity = unique(ys.begin(),ys.end());\n xs.erase(itx,xs.end());\n ys.erase(ity,ys.end());\n int nx = xs.size();\n int ny = ys.size();\n vector<vector<long long>> maps(nx-1,vector<long long>(ny-1,0));\n for (int i=0;i<n;i++) {\n for (int j=0;j<nx-1;j++) {\n for (int k=0;k<ny-1;k++) {\n if (xs[j] >= l[i] && r[i] >= xs[j+1] && ys[k] >= b[i] && t[i] >= ys[k+1]) {\n maps[j][k] += 1LL<<i;\n }\n }\n }\n }\n vector<vector<bool>> used(nx-1,vector<bool>(ny-1,false));\n int ans = 0;\n for (int i=0;i<nx-1;i++) {\n for (int j=0;j<ny-1;j++) {\n if (used[i][j]) continue;\n ans++;\n queue<P> q;\n q.push(P(i,j));\n used[i][j] = true;\n while (!q.empty()) {\n P np = q.front();\n q.pop();\n int ni = np.first;\n int nj = np.second;\n //cout << maps[ni][nj] << endl;\n for (int k=0;k<4;k++) {\n int toi = ni+di[k];\n int toj = nj+dj[k];\n if (toi < 0 || toi >= nx-1 || toj < 0 || toj >= ny-1) {\n continue;\n }\n if (maps[toi][toj] != maps[ni][nj]) continue;\n if (used[toi][toj]) continue;\n used[toi][toj] = true;\n q.push(P(toi,toj));\n }\n }\n }\n }\n cout << ans << endl;\n cin >> n;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3496,"score_of_the_acc":-0.0124,"final_rank":9},{"submission_id":"aoj_1337_6001211","code_snippet":"#define rep(i, n) for(int i=0; i<(n); ++i)\n#define rrep(i, n) for(int i=(n-1); i>=0; --i)\n#define rep2(i, s, n) for(int i=s; i<(n); ++i)\n#define ALL(v) (v).begin(), (v).end()\n#define memr(dp, val) memset(dp, val, sizeof(dp))\n#define fi first\n#define se second\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\ntypedef long long ll;\nconst int INTINF = INT_MAX >> 1;\nstatic const ll LLINF = (LLONG_MAX >> 1);\n\nint dx[4] = {0, 0, -1, 1};\nint dy[4] = {1, -1, 0, 0};\n\nint mx, my;\n\nint n;\nint l[51], t[51], r[51], b[51];\n\nset<int> s[501][501];\nbool used[501][501];\n\nbool input(){\n\n cin >> n;\n if(!n) return false;\n set<int> xs, ys;\n xs.insert(0);\n xs.insert(1000000);\n ys.insert(0);\n ys.insert(1000000);\n map<int, int> xcomp, ycomp;\n rep(i, n) {\n cin >> l[i] >> t[i] >> r[i] >> b[i];\n xs.insert(l[i]);\n xs.insert(r[i]);\n ys.insert(t[i]);\n ys.insert(b[i]);\n }\n\n int cnt = 1;\n int bef = -1;\n for(int x : xs) {\n xcomp[x] = cnt;\n cnt++;\n bef = x;\n }\n bef = -1;\n cnt = 1;\n for(int y : ys) {\n ycomp[y] = cnt;\n cnt++;\n bef = y;\n }\n\n rep(i, n){\n l[i] = xcomp[l[i]];\n r[i] = xcomp[r[i]];\n t[i] = ycomp[t[i]];\n b[i] = ycomp[b[i]];\n }\n mx = xcomp[1000000] + 2;\n my = ycomp[1000000] + 2;\n\n\treturn true;\n}\n\nint main(){\n std::cout << std::fixed << std::setprecision(15);\n\n while(input()){\n rep(i, my){\n rep(j, mx){\n s[i][j].clear();\n }\n }\n\n rep(i, n){\n rep(j, r[i] - l[i]){\n rep(k, t[i] - b[i]){\n s[b[i] + k][l[i] + j].insert(i);\n }\n }\n }\n\n memr(used, 0);\n int ans = 0;\n rep(i, my){\n rep(j, mx){\n if(!used[i][j]){\n ans++;\n queue<pair<int, int> > q;\n q.push({j, i});\n used[i][j] = true;\n while(q.size()){\n auto f = q.front(); q.pop();\n rep(k, 4){\n int nx = f.fi + dx[k];\n int ny = f.se + dy[k];\n if(nx < 0 || nx >= mx) continue;\n if(ny < 0 || ny >= my) continue;\n if(used[ny][nx]) continue;\n if(s[ny][nx] != s[f.se][f.fi]) continue;\n\n used[ny][nx] = true;\n q.push({nx, ny});\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":22960,"score_of_the_acc":-0.3079,"final_rank":19},{"submission_id":"aoj_1337_5964938","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nvector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\n\n// 座標圧縮\nmap<ll, int> compress(const vector<ll> &x) {\n map<ll, int> comp;\n for (int i = 0; i < x.size(); i++) comp[x.at(i)] = 1;\n int i = 0;\n for (auto it = comp.begin(); it != comp.end(); it++, i++) it->second = i;\n return comp;\n}\n\nvoid bfs(vector<vector<bool>> &dp, int si, int sj) {\n dp[si][sj] = true;\n queue<pair<int, int>> q;\n q.push(make_pair(si, sj));\n while (!q.empty()) {\n pair<int, int> p = q.front();\n q.pop();\n for (int i = 0; i < 4; i++) {\n int ni = p.first + dx[i], nj = p.second + dy[i];\n if (0 <= ni && ni < dp.size() && 0 <= nj && nj < dp[0].size() && !dp[ni][nj]) {\n dp[ni][nj] = true;\n q.push(make_pair(ni, nj));\n }\n }\n }\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while (true) {\n int n;\n cin >> n;\n if (n == 0) return 0;\n\n vector<ll> l(n), t(n), r(n), b(n), x, y;\n for (int i = 0; i < n; i++) {\n cin >> l[i] >> t[i] >> r[i] >> b[i];\n x.emplace_back(l[i]);\n x.emplace_back(r[i]);\n y.emplace_back(t[i]);\n y.emplace_back(b[i]);\n }\n x.emplace_back(-10);\n x.emplace_back(10000000);\n y.emplace_back(-10);\n y.emplace_back(10000000);\n\n map<ll, int> mpx = compress(x), mpy = compress(y);\n\n vector<vector<bool>> dp((int) mpx.size() * 3, vector<bool>((int) mpy.size() * 3, false));\n for (int i = 0; i < n; i++) {\n for (int ii = mpx[l[i]] * 3 + 1; ii <= mpx[r[i]] * 3 + 1; ii++) {\n dp[ii][mpy[b[i]] * 3 + 1] = true;\n dp[ii][mpy[t[i]] * 3 + 1] = true;\n }\n for (int jj = mpy[b[i]] * 3 + 1; jj <= mpy[t[i]] * 3 + 1; jj++) {\n dp[mpx[l[i]] * 3 + 1][jj] = true;\n dp[mpx[r[i]] * 3 + 1][jj] = true;\n }\n }\n\n int ans = 0;\n for (int i = 0; i < dp.size(); i++) {\n for (int j = 0; j < dp[0].size(); j++) {\n if (!dp[i][j]) {\n bfs(dp, i, j);\n ans++;\n }\n }\n }\n\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":140,"memory_kb":3428,"score_of_the_acc":-0.0247,"final_rank":14},{"submission_id":"aoj_1337_5963211","code_snippet":"// #include \"atcoder/all\"\n#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <iomanip> // setprecision\n#include <complex> // complex\n#include <math.h>\n#include <functional>\n#include <cassert>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing P = pair<ll,ll>;\nconstexpr ll INF = 1e15;\nconstexpr ll LLMAX = 9223372036854775807;\nconstexpr int inf = 1e9;\n// constexpr ll mod = 1000000007;\nconstexpr ll mod = 998244353;\n// 右下左上\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define eol \"\\n\"\n// ---------------------------------------------------------------------------\n\ntemplate<typename T>\nstruct Compress {\n\tvector<T> v;\n\tCompress() {}\n\tCompress(vector<T> _v) {\n\t\tbuild(_v);\n\t}\n \n\tvoid build(vector<T> _v) {\n\t\tv = _v;\n\t\tsort(v.begin(), v.end());\n\t\tv.erase(unique(v.begin(), v.end()), v.end());\n\t}\n\tint get(T x) {\n\t\treturn lower_bound(v.begin(), v.end(), x) - v.begin();\n\t}\n \n\tT& operator[](int i) { return v[i]; }\n \n \n\tint size() {\n\t\treturn (int)v.size();\n\t}\n};\n\n\nstruct UnionFind {\n vector<int> par, w;\n\n UnionFind(int n) : par(n, -1), w(n, 0) { }\n void init(int n) { par.assign(n, -1); w.assign(n, 0); }\n\n int root(int x) {\n if (par[x] < 0) return x;\n else return par[x] = root(par[x]);\n }\n\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n bool merge(int x, int y) {\n x = root(x); y = root(y);\n if (x == y) {\n ++w[x];\n return false;\n }\n if (par[x] > par[y]) swap(x, y); // merge technique\n par[x] += par[y];\n par[y] = x;\n w[x] += w[y];\n ++w[x];\n return true;\n }\n\n int size(int x) {\n return -par[root(x)];\n }\n\n int wei(int x) {\n return w[root(x)];\n }\n};\n\n\nbool solve(){\n int N;\n cin >> N;\n if(N == 0) return false;\n vector<int> X,Y;\n vector<int> lx(N),ly(N),rx(N),ry(N);\n for(int i=0; i<N; i++){\n cin >> lx[i] >> ry[i] >> rx[i] >> ly[i];\n X.emplace_back(lx[i]);\n X.emplace_back(rx[i]);\n Y.emplace_back(ly[i]);\n Y.emplace_back(ry[i]);\n }\n X.emplace_back(-1);\n X.emplace_back(inf);\n Y.emplace_back(-1);\n Y.emplace_back(inf);\n Compress<int> CX(X),CY(Y);\n vector<vector<ll>> G(CX.size()+1,vector<ll>(CY.size()+1));\n for(int i=0; i<N; i++){\n for(int x=CX.get(lx[i]); x<CX.get(rx[i]); x++){\n for(int y=CY.get(ly[i]); y<CY.get(ry[i]); y++){\n G[x][y] += (1LL<<i);\n }\n }\n }\n // for(int i=0; i<CX.size(); i++){\n // for(int j=0; j<CY.size(); j++){\n // cout << G[i][j] << \" \\n\"[j+1==CY.size()];\n // }\n // }\n int ans = 0;\n vector<vector<int>> used(CX.size(),vector<int>(CY.size(),0));\n for(int i=0; i<CX.size(); i++){\n for(int j=0; j<CY.size(); j++){\n if(used[i][j] != 0) continue;\n ans++;\n queue<P> que;\n que.emplace(i,j);\n used[i][j] = ans;\n while(que.size()){\n int y = que.front().first;\n int x = que.front().second;\n que.pop();\n for(int k=0; k<4; k++){\n int ny = y + dy[k];\n int nx = x + dx[k];\n if(ny<0 || ny>=CX.size() || nx<0 || nx>=CY.size()) continue;\n if(G[y][x] != G[ny][nx]) continue;\n if(used[ny][nx] != 0) continue;\n used[ny][nx] = ans;\n que.emplace(ny,nx);\n }\n }\n }\n }\n cout << ans << endl;\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3428,"score_of_the_acc":-0.01,"final_rank":6},{"submission_id":"aoj_1337_5956478","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing T = tuple<int,int,int,int>;\nconst int MAX = 500;\n\nmap<int64_t,int64_t> mx;\nmap<int64_t,int64_t> my;\n\nset<int> sum[MAX][MAX];\nvoid init(){\n for(int i=0; i<MAX; i++){\n for(int j=0; j<MAX; j++){\n sum[i][j].clear();\n }\n }\n}\n\n//一次元座標圧縮\nmap<int64_t, int64_t> compression(vector<int64_t> V){\n map<int64_t, int64_t> ret;\n int64_t cnt = 0;\n sort(V.begin(),V.end());\n for(int i=0; i<V.size(); i++){\n if(!ret.count(V[i])){\n ret[V[i]] = cnt;\n cnt++;\n }\n }\n return ret;\n}\n\n//UnionFind\nint n = 500*500;\nvector<int> par(n);\nvector<int> Size(n);\n\nvoid init_union(int n){\n for(int i=0; i<n; i++){\n par.at(i) = i;\n Size.at(i) = 1;\n }\n}\n\nint root(int x){\n if(par.at(x) == x){\n return x;\n }\n else{\n return par.at(x) = root(par.at(x));\n }\n}\n\nbool same(int x, int y){\n return root(x) == root(y);\n}\n\nvoid unite(int x, int y){\n x = root(x);\n y = root(y);\n if(x == y){\n return;\n }\n if (Size.at(x) < Size.at(y)){\n swap(x, y);\n }\n Size.at(x) += Size.at(y);\n par.at(y) = x;\n}\n\nint Size_x(int x){\n return Size.at(root(x));\n}\n\nvoid solve(int N){\n init();\n vector<T> vec(N);\n vector<int64_t> X = {-1000000000, 1000000000};\n vector<int64_t> Y = {-1000000000, 1000000000};\n for(int i=0; i<N; i++){\n int x1, y1, x2, y2;\n cin >> x1 >> y2 >> x2 >> y1;\n x2--; y2--;\n vec[i] = {x1,y1,x2,y2};\n for(int j=-1; j<=1; j++){\n X.push_back(x1+j);\n X.push_back(x2+j);\n Y.push_back(y1+j);\n Y.push_back(y2+j);\n }\n }\n mx = compression(X);\n my = compression(Y);\n for(int i=0; i<N; i++){\n auto[x1,y1,x2,y2] = vec[i];\n for(auto itr = mx.begin(); itr != mx.end(); itr++){\n int x = itr->first;\n for(auto itr2 = my.begin(); itr2 != my.end(); itr2++){\n int y = itr2->first;\n if(x1 <= x && x <= x2 && y1 <= y && y <= y2){\n sum[itr->second][itr2->second].insert(i);\n }\n }\n }\n }\n init_union(n);\n vector<int> dx = {0,1,0,-1};\n vector<int> dy = {1,0,-1,0};\n for(int i=0; i<MAX; i++){\n for(int j=0; j<MAX; j++){\n for(int k=0; k<4; k++){\n if(0 <= i+dx[k] && i+dx[k] < MAX-1 && 0 <= j+dy[k] && j+dy[k] < MAX-1){\n if(sum[i][j] == sum[i+dx[k]][j+dy[k]]){\n unite(i*MAX+j, (i+dx[k])*MAX + j+dy[k]);\n }\n }\n }\n }\n }\n int ans = 0;\n for(int i=0; i<X.size(); i++){\n for(int j=0; j<Y.size(); j++){\n if(root(i*MAX+j) == i*MAX+j){\n ans++;\n }\n }\n }\n cout << ans << endl;\n \n /*for(int i=0; i<X.size(); i++){\n for(int j=0; j<Y.size(); j++){\n cout << num[i][j] << \" \";\n }\n cout << endl;\n }*/\n}\n\nint main(){\n while(true){\n int N;\n cin >> N;\n if(N == 0){\n break;\n }\n solve(N);\n //break;\n }\n}","accuracy":1,"time_ms":6120,"memory_kb":87764,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1337_5927964","code_snippet":"#line 1 \"main.cpp\"\n#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\n#line 1 \"/home/siro53/kyo-pro/compro_library/data_structure/compress.hpp\"\ntemplate <typename T> struct Compress {\n vector<T> v;\n Compress() {}\n Compress(vector<T> vv) : v(vv) {\n sort(ALL(v));\n v.erase(unique(ALL(v)), end(v));\n }\n void build(vector<T> vv) {\n v = vv;\n sort(ALL(v));\n v.erase(unique(ALL(v)), end(v));\n }\n int get(T x) { return (int)(lower_bound(ALL(v), x) - v.begin()); }\n T &operator[](int i) { return v[i]; }\n size_t size() { return v.size(); }\n};\n#line 1 \"/home/siro53/kyo-pro/compro_library/graph/dsu.hpp\"\nstruct UnionFind {\n vector<int> par;\n\n UnionFind(int n) : par(n, -1) {}\n void init(int n) { par.assign(n, -1); }\n\n int root(int x) {\n if(par[x] < 0)\n return x;\n else\n return par[x] = root(par[x]);\n }\n\n bool issame(int x, int y) { return root(x) == root(y); }\n\n bool merge(int x, int y) {\n x = root(x);\n y = root(y);\n if(x == y)\n return false;\n if(par[x] > par[y])\n swap(x, y); // merge technique\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\n int size(int x) { return -par[root(x)]; }\n};\n#line 74 \"main.cpp\"\n\nusing R = array<int, 4>;\n\nbool solve() {\n int N;\n cin >> N;\n if(N == 0) return false;\n vector<R> recs(N);\n Compress<int> comp_x, comp_y;\n {\n vector<int> vx = {-1, 1000001}, vy = {-1, 1000001};\n REP(i, N) {\n int x1, y1, x2, y2;\n cin >> x1 >> y2 >> x2 >> y1;\n vx.push_back(x1);\n vy.push_back(y1);\n vx.push_back(x2);\n vy.push_back(y2);\n recs[i] = {x1, y1, x2, y2};\n }\n comp_x.build(vx); comp_y.build(vy);\n REP(i, N) {\n recs[i][0] = comp_x.get(recs[i][0]) * 2;\n recs[i][1] = comp_y.get(recs[i][1]) * 2;\n recs[i][2] = comp_x.get(recs[i][2]) * 2;\n recs[i][3] = comp_y.get(recs[i][3]) * 2;\n }\n }\n int Lx = comp_x.size() * 2;\n int Ly = comp_y.size() * 2;\n vector G(Lx, vector<int>(Ly, 0));\n REP(i, N) {\n auto [x1, y1, x2, y2] = recs[i];\n FOR(y, y1, y2+1) G[x1][y] = G[x2][y] = 1;\n FOR(x, x1, x2+1) G[x][y1] = G[x][y2] = 1;\n }\n UnionFind uf(Lx*Ly);\n\n REP(i, Lx) REP(j, Ly) {\n if(G[i][j]) continue;\n REP(dir, 4) {\n int ni = i + dx[dir], nj = j + dy[dir];\n if(ni < 0 or ni >= Lx or nj < 0 or nj >= Ly) continue;\n if(G[ni][nj]) continue;\n uf.merge(i*Ly + j, ni*Ly + nj);\n }\n }\n set<int> se;\n REP(i, Lx) REP(j, Ly) {\n if(G[i][j]) continue;\n se.insert(uf.root(i*Ly + j));\n }\n cout << se.size() << endl;\n\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":100,"memory_kb":3780,"score_of_the_acc":-0.0223,"final_rank":12},{"submission_id":"aoj_1337_5926769","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing ull = unsigned long long int;\nusing P = pair<int, int>;\nusing P3 = pair<P,int>;\nusing PP = pair<P, P>;\nconstexpr int INF32 = 1 << 30;\nconstexpr ll INF64 = 1LL << 60;\nconstexpr ll MOD = 1000000007;\n// constexpr ll MOD = 998244353;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr int di8[] = {0, 1, 1, 1, 0, -1, -1, -1};\nconstexpr int dj8[] = {1, 1, 0, -1, -1, -1, 0, 1};\nconstexpr double EPS = 1e-9;\nconst double PI = acos(-1);\n\n#define ALL(v) (v).begin(),(v).end()\n#define REP(i,n) for(int i=0,i_len=n; i<i_len; ++i)\n\ntemplate<typename T1,typename T2> bool chmax(T1 &a, T2 b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<typename T1,typename T2> bool chmin(T1 &a, T2 b) { if (b<a) { a=b; return 1; } return 0; }\n\nstruct UnionFindTree {\n vector<int> par;\n vector<int> rank;\n vector<int> siz;\n int N;\n\n void init(int n) {\n par.resize(n);\n rank.resize(n);\n siz.resize(n);\n for (int i = 0; i < n; i++) {\n par[i] = i;\n rank[i] = 0;\n siz[i] = 1;\n N = n;\n }\n }\n int find(int x) {\n if (par[x] == x) {\n return x;\n } else {\n return par[x] = find(par[x]);\n }\n }\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y) return;\n if (rank[x] < rank[y]) swap(x, y);\n if (rank[x] == rank[y]) rank[x]++;\n par[y] = x;\n siz[x] += siz[y];\n N--;\n }\n bool is_same(int x, int y) {\n return find(x) == find(y);\n }\n int size(int x) {\n x = find(x);\n return siz[x];\n }\n};\n\nmap<int,int> compress(vector<int> x){\n auto v = x;\n sort(ALL(v));\n v.erase(unique(ALL(v)),v.end());\n map<int,int> ord;\n for(int i=0;i<v.size();i++) ord[v[i]] = i;\n return ord;\n}\n\nint solve(){\n int n;\n cin >> n;\n if(n == 0) return 1;\n vector<int> xs, ys, l(n), t(n), r(n), b(n);\n REP(i,n){\n cin >> l[i] >> t[i] >> r[i] >> b[i];\n xs.push_back(l[i]);\n xs.push_back(r[i]);\n ys.push_back(t[i]);\n ys.push_back(b[i]);\n }\n auto xord = compress(xs);\n auto yord = compress(ys);\n int m = max(xord.size(), yord.size()) + 1;\n REP(i,n){\n l[i] = xord[l[i]]+1;\n r[i] = xord[r[i]]+1;\n t[i] = yord[t[i]]+1;\n b[i] = yord[b[i]]+1;\n }\n vector<vector<ll> > a(m+1, vector<ll>(m+1));\n REP(i,n){\n a[l[i]][b[i]] |= 1LL<<i;\n a[l[i]][t[i]] |= 1LL<<i;\n a[r[i]][b[i]] |= 1LL<<i;\n a[r[i]][t[i]] |= 1LL<<i;\n }\n REP(i,m+1) REP(j,m) a[i][j+1] ^= a[i][j];\n REP(i,m) REP(j,m+1) a[i+1][j] ^= a[i][j];\n UnionFindTree uf;\n uf.init((m+1)*(m+1));\n REP(i,m+1) REP(j,m+1){\n if(i<m && a[i][j]==a[i+1][j]) uf.unite(i*(m+1)+j, (i+1)*(m+1)+j);\n if(j<m && a[i][j]==a[i][j+1]) uf.unite(i*(m+1)+j, i*(m+1)+j+1);\n }\n cout << uf.N << endl;\n return 0;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n // solve();\n // int T; cin >> T; REP(t,T) solve();\n while(!solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3328,"score_of_the_acc":-0.0023,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1337_10852755\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <map>\\n#include <algorithm>\\nusing namespace std;\\nconst int maxn = 555;\\nint l[maxn],r[maxn],t[maxn],b[maxn];\\nint X[maxn],Y[maxn],g[maxn][maxn];\\nmap<int,int>mpx;\\nmap<int,int>mpy;\\nint N,M;\\nint dx[]={0,0,1,-1};\\nint dy[]={1,-1,0,0};\\nvoid dfs(int i,int j){\\n g[i][j]=1;\\n for(int k=0;k<4;k++){\\n int x=i+dx[k],y=j+dy[k];\\n if(x<0 || x>N || y<0 || y>M) continue;\\n if(!g[x][y]){\\n dfs(x,y);\\n }\\n }\\n}\\n\\nint main()\\n{\\n// freopen(\\\"data.in\\\",\\\"r\\\",stdin);\\n int n;\\n while(scanf(\\\"%d\\\",&n)!=EOF && n){\\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d%d%d\\\",&l[i],&t[i],&r[i],&b[i]);\\n X[i]=l[i];\\n X[i+n]=r[i];\\n Y[i]=t[i];\\n Y[i+n]=b[i];\\n }\\n mpx.clear();\\n mpx.clear();\\n sort(X,X+n*2);\\n sort(Y,Y+n*2);\\n int t1=unique(X,X+n*2)-X;\\n int t2=unique(Y,Y+n*2)-Y;\\n for(int i=0;i<t1;i++)\\n mpx[X[i]]=(i+1)*2;\\n for(int i=0;i<t2;i++)\\n mpy[Y[i]]=(i+1)*2;\\n t1=(t1+1)*2+2;\\n t2=(t2+1)*2+2;\\n memset(g,0,sizeof g);\\n for(int i=0;i<n;i++){\\n int lb=mpx[l[i]],rb=mpx[r[i]],tb=mpy[t[i]],bb=mpy[b[i]];\\n// printf(\\\"%d %d %d %d\\\\n\\\",lb,rb,tb,bb);\\n for(int j=lb;j<=rb;j++)\\n g[tb][j]=g[bb][j]=1;\\n for(int j=bb;j<=tb;j++)\\n g[j][lb]=g[j][rb]=1;\\n }\\n int ans=0;\\n N=t2,M=t1;\\n for(int i=0;i<=N;i++){\\n for(int j=0;j<=M;j++){\\n if(!g[i][j]){\\n dfs(i,j);\\n ans++;\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6460,\n \"score_of_the_acc\": -0.0426,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1337_9684361\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct UnionFind{\\n vector<int> par; int n;\\n UnionFind(){}\\n UnionFind(int _n):par(_n,-1),n(_n){}\\n int root(int x){return par[x]<0?x:par[x]=root(par[x]);}\\n bool same(int x,int y){return root(x)==root(y);}\\n int size(int x){return -par[root(x)];}\\n bool unite(int x,int y){\\n x=root(x),y=root(y); if(x==y)return false;\\n if(size(x)>size(y))swap(x,y);\\n par[y]+=par[x]; par[x]=y; n--; return true;\\n }\\n};\\n\\n/**\\n * @brief Union Find\\n */\\n\\nint main() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n vector<int> A(N), B(N), C(N), D(N);\\n vector<int> X = {-inf,inf}, Y = {-inf,inf};\\n rep(i,0,N) {\\n cin >> A[i] >> B[i] >> C[i] >> D[i];\\n swap(B[i], D[i]);\\n A[i] *= 2;\\n B[i] *= 2;\\n C[i] *= 2;\\n D[i] *= 2;\\n X.push_back(A[i]-1),X.push_back(A[i]),X.push_back(A[i]+1);\\n Y.push_back(B[i]-1),Y.push_back(B[i]),Y.push_back(B[i]+1);\\n X.push_back(C[i]-1),X.push_back(C[i]),X.push_back(C[i]+1);\\n Y.push_back(D[i]-1),Y.push_back(D[i]),Y.push_back(D[i]+1);\\n }\\n UNIQUE(X), UNIQUE(Y);\\n rep(i,0,N) {\\n A[i] = LB(X,A[i]);\\n B[i] = LB(Y,B[i]);\\n C[i] = LB(X,C[i]);\\n D[i] = LB(Y,D[i]);\\n }\\n int H = X.size(), W = Y.size();\\n vector<vector<bool>> G(H,vector<bool>(W,true));\\n rep(i,0,N) {\\n rep(j,A[i],C[i]+1) G[j][B[i]] = G[j][D[i]] = false;\\n rep(j,B[i],D[i]+1) G[A[i]][j] = G[C[i]][j] = false;\\n }\\n int ANS = 0;\\n vector<vector<int>> used(H,vector<int>(W,false));\\n int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\\n rep(i,0,H) {\\n rep(j,0,W) {\\n if (used[i][j]) continue;\\n if (!G[i][j]) continue;\\n ANS++;\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n used[i][j] = true;\\n while(!Q.empty()) {\\n auto [x,y] = Q.front();\\n Q.pop();\\n rep(k,0,4) {\\n int nx = x + dx[k], ny = y + dy[k];\\n if (0 <= nx && nx < H && 0 <= ny && ny < W) {\\n if (!used[nx][ny] && G[nx][ny]) {\\n used[nx][ny] = true;\\n Q.push({nx,ny});\\n }\\n }\\n }\\n }\\n }\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.0205,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1337_9506016\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n// @JASPER'S BOILERPLATE\\nusing namespace std;\\nusing ll = long long;\\n\\n#ifdef JASPER\\n#include \\\"debug.h\\\"\\n#else\\n#define debug(...) 166\\n#endif\\n\\n#define int long long\\n\\nconst int N = 55 * 2;\\n\\nint x[N], y[N], X[N], Y[N];\\n\\nint dx[] = {0, 0, -1, 1};\\nint dy[] = {-1, 1, 0, 0};\\n\\nll a[N][N];\\n\\nvoid solve(int i, int j, int val) {\\n if (a[i][j] != val) return;\\n a[i][j] = -1;\\n for (int k = 0; k < 4; ++k) {\\n int ni = i + dx[k];\\n int nj = j + dy[k];\\n if (0 <= ni && ni < N && 0 <= nj && nj < N) {\\n solve(ni, nj, val);\\n }\\n }\\n}\\n\\n\\nsigned main() {\\n cin.tie(0) -> sync_with_stdio(0);\\n \\n #ifdef JASPER\\n freopen(\\\"in1\\\", \\\"r\\\", stdin);\\n #endif\\n\\n int n;\\n while (cin >> n) {\\n if (n == 0) break;\\n \\n memset(a, 0, sizeof a);\\n vector <int> valX, valY;\\n for (int i = 0; i < n; ++i) {\\n cin >> x[i] >> y[i] >> X[i] >> Y[i];\\n valX.push_back(x[i]);\\n valY.push_back(y[i]);\\n\\n valX.push_back(X[i]);\\n valY.push_back(Y[i]);\\n }\\n\\n sort(valX.begin(), valX.end());\\n valX.resize(unique(valX.begin(), valX.end()) - valX.begin());\\n\\n sort(valY.begin(), valY.end());\\n valY.resize(unique(valY.begin(), valY.end()) - valY.begin());\\n\\n for (int i = 0; i < n; ++i) {\\n x[i] = (int) (lower_bound(valX.begin(), valX.end(), x[i]) - valX.begin() + 1);\\n X[i] = (int) (lower_bound(valX.begin(), valX.end(), X[i]) - valX.begin() + 1);\\n \\n y[i] = (int) (lower_bound(valY.begin(), valY.end(), y[i]) - valY.begin() + 1);\\n Y[i] = (int) (lower_bound(valY.begin(), valY.end(), Y[i]) - valY.begin() + 1);\\n\\n debug(x[i], y[i], X[i], Y[i]);\\n\\n for (int _x = x[i]; _x < X[i]; ++_x)\\n for (int _y = Y[i]; _y < y[i]; ++_y) \\n a[_x][_y] |= (1LL << i);\\n }\\n\\n \\n int ans = 0;\\n for (int _x = 0; _x < N; ++_x) {\\n for (int _y = 0; _y < N; ++_y) { \\n if (a[_x][_y] >= 0) {\\n solve(_x, _y, a[_x][_y]);\\n ++ans;\\n }\\n\\n }\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.0119,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1337_9277459\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i, a, b) for(ll i = a; i < b; i++)\\n#define all(x) (x).begin(), (x).end()\\n\\nconst vector<int> dx = {0, 1, 0, -1};\\nconst vector<int> dy = {1, 0, -1, 0};\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) return 0;\\n vector<int> xs, ys;\\n vector<int> l(n), t(n), r(n), b(n);\\n rep(i,0,n){\\n cin>>l[i]>>t[i]>>r[i]>>b[i];\\n xs.push_back(l[i]);\\n xs.push_back(r[i]);\\n ys.push_back(t[i]);\\n ys.push_back(b[i]);\\n }\\n xs.push_back(-1);\\n ys.push_back(-1);\\n sort(all(xs));\\n xs.erase(unique(all(xs)), xs.end());\\n sort(all(ys));\\n ys.erase(unique(all(ys)), ys.end());\\n\\n const int M = 150;\\n\\n vector<vector<ll>> val(M, vector<ll>(M));\\n rep(i,0,n){\\n l[i]=lower_bound(all(xs), l[i])-xs.begin();\\n r[i]=lower_bound(all(xs), r[i])-xs.begin();\\n t[i]=lower_bound(all(ys), t[i])-ys.begin();\\n b[i]=lower_bound(all(ys), b[i])-ys.begin();\\n rep(x,l[i],r[i])rep(y,b[i],t[i]){\\n val[x][y] |= 1LL<<i;\\n }\\n }\\n\\n int cnt = 0;\\n vector<vector<bool>> visited(M, vector<bool>(M, false));\\n rep(x,0,M)rep(y,0,M){\\n if (visited[x][y]) continue;\\n ++cnt;\\n stack<pair<int,int>> st;\\n st.push({x,y});\\n visited[x][y] = true;\\n while (!st.empty()) {\\n auto [xx, yy] = st.top();\\n st.pop();\\n rep(k,0,4){\\n int nx = xx+dx[k], ny = yy+dy[k];\\n if (0 <= nx && nx < M && 0 <= ny && ny < M && !visited[nx][ny] && val[nx][ny] == val[x][y]) {\\n visited[nx][ny] = true;\\n st.push({nx, ny});\\n }\\n }\\n }\\n }\\n cout << cnt << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.0125,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1337_8992586\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 1 \\\"cp-library/src/data_structure/union_find.hpp\\\"\\nclass union_find {\\n public:\\n union_find(int n) : data(n, -1) {}\\n int unite(int x, int y) {\\n x = root(x), y = root(y);\\n if(x != y) {\\n if(size(x) < size(y)) swap(x, y);\\n data[x] += data[y];\\n return data[y] = x;\\n }\\n return -1;\\n }\\n int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\\n int size(int x) { return -data[root(x)]; }\\n bool same(int x, int y) { return root(x) == root(y); }\\n\\n private:\\n vector<int> data;\\n};\\n#line 4 \\\"A.cpp\\\"\\n\\nint solve(int n) {\\n vector<int> x1(n), y1(n), x2(n), y2(n);\\n for(int i : rep(n)) {\\n x1[i] = in(), y2[i] = in(), x2[i] = in(), y1[i] = in();\\n x1[i] *= 2; x2[i] *= 2; y1[i] *= 2; y2[i] *= 2;\\n }\\n vector<int> vx, vy;\\n for(int i : rep(n)) {\\n vx.push_back(x1[i] - 1);\\n vx.push_back(x1[i]);\\n vx.push_back(x1[i] + 1);\\n vx.push_back(x2[i] - 1);\\n vx.push_back(x2[i]);\\n vx.push_back(x2[i] + 1);\\n\\n vy.push_back(y1[i] - 1);\\n vy.push_back(y1[i]);\\n vy.push_back(y1[i] + 1);\\n vy.push_back(y2[i] - 1);\\n vy.push_back(y2[i]);\\n vy.push_back(y2[i] + 1);\\n }\\n unique(vx);\\n unique(vy);\\n for(int i : rep(n)) {\\n x1[i] = lower_bound(vx, x1[i]);\\n x2[i] = lower_bound(vx, x2[i]);\\n y1[i] = lower_bound(vy, y1[i]);\\n y2[i] = lower_bound(vy, y2[i]);\\n }\\n\\n const int x_lim = vx.size();\\n const int y_lim = vy.size();\\n vector g(x_lim, vector(y_lim, 0));\\n for(int i : rep(n)) {\\n for(int x = x1[i]; x <= x2[i]; x++) g[x][y1[i]] = g[x][y2[i]] = 1;\\n for(int y = y1[i]; y <= y2[i]; y++) g[x1[i]][y] = g[x2[i]][y] = 1;\\n }\\n\\n union_find uf(x_lim * y_lim);\\n auto h = [&](int x, int y) { return x * y_lim + y; };\\n for(int x : rep(x_lim)) for(int y : rep(y_lim)) if(g[x][y] == 0) {\\n if(x + 1 < x_lim and g[x + 1][y] == 0) uf.unite(h(x, y), h(x + 1, y));\\n if(y + 1 < y_lim and g[x][y + 1] == 0) uf.unite(h(x, y), h(x, y + 1));\\n }\\n\\n set<int> st;\\n for(int x : rep(x_lim)) for(int y : rep(y_lim)) if(g[x][y] == 0) st.insert(uf.root(h(x, y)));\\n return st.size();\\n}\\n\\nint main() {\\n while(true) {\\n int n = in();\\n if(n == 0) return 0;\\n print(solve(n));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 4316,\n \"score_of_the_acc\": -0.0369,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1337_8497886\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nusing ll=long long;\\n\\nstruct UnionFind{\\n vector<ll>data;\\n UnionFind(ll n):data(n,-1){}\\n bool unite(ll a,ll b){\\n a=root(a),b=root(b);\\n if(a==b)return false;\\n if(-data[a]< -data[b])swap(a,b);\\n data[a]+=data[b];\\n data[b]=a;\\n return true;\\n }\\n bool find(ll a,ll b){return root(a)==root(b);}\\n ll root(ll a){\\n return data[a]<0?a:data[a]=root(data[a]);\\n }\\n ll size(ll a){\\n return -data[root(a)];\\n }\\n};\\n\\nbool solve(){\\n int n;cin>>n;\\n if(n==0)return false;\\n vector<int>l(n),t(n),r(n),b(n);\\n map<int,int>X;\\n map<int,int>Y;\\n const int INF=1e8;\\n X[-INF]=1;\\n X[INF]=1;\\n Y[-INF]=1;\\n Y[INF]=1;\\n auto Set=[&](int v,map<int,int>&mp){\\n mp[v-1]=1;\\n mp[v]=1;\\n mp[v+1]=1;\\n };\\n for (int i = 0; i < n; ++i) {\\n cin>>l[i]>>t[i]>>r[i]>>b[i];\\n Set(l[i],X);\\n Set(r[i],X);\\n Set(t[i],Y);\\n Set(b[i],Y);\\n }\\n int h=0;\\n for(auto &[i,val]:X){\\n val=h++;\\n }\\n int w=0;\\n for(auto &[j,val]:Y){\\n val=w++;\\n }\\n vector z(h,vector<ll>(w));\\n for (int i = 0; i < n; ++i) {\\n auto li=X[l[i]],rj=Y[t[i]];\\n auto ri=X[r[i]],lj=Y[b[i]];\\n z[li][lj]^=(1LL<<i);\\n z[li][rj]^=(1LL<<i);\\n z[ri][lj]^=(1LL<<i);\\n z[ri][rj]^=(1LL<<i);\\n }\\n for (int i = 0; i < h; ++i) {\\n for (int j = 1; j < w; ++j) {\\n z[i][j]^=z[i][j-1];\\n }\\n }\\n for (int i =1; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n z[i][j]^=z[i-1][j];\\n }\\n }\\n UnionFind uni(h*w);\\n vector<int>dx={0,-1,0,1};\\n vector<int>dy={1,0,-1,0};\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n for (int k = 0; k < 4; ++k) {\\n auto i2=i+dx[k],j2=j+dy[k];\\n if(i2<0 or i2>=h or j2<0 or j2>=w)continue;\\n if(z[i][j]==z[i2][j2]){\\n uni.unite(i*w+j,i2*w+j2);\\n }\\n }\\n }\\n }\\n int ans=0;\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n if(uni.root(i*w+j)==i*w+j){\\n ans++;\\n }\\n }\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 4616,\n \"score_of_the_acc\": -0.0453,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1337_8475056\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG\\n#pragma GCC optimize(\\\"O2,no-stack-protector,unroll-loops,fast-math\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < int(n); i++)\\n#define per(i, n) for (int i = (n)-1; 0 <= i; i--)\\n#define rep2(i, l, r) for (int i = (l); i < int(r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--)\\n#define each(e, v) for (auto& e : v)\\n#define MM << \\\" \\\" <<\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\ntemplate <typename T> void print(const vector<T>& v, T x = 0) {\\n int n = v.size();\\n for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (v.empty()) cout << '\\\\n';\\n}\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\ntemplate <typename T> bool chmax(T& x, const T& y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\ntemplate <typename T> bool chmin(T& x, const T& y) {\\n return (x > y) ? (x = y, true) : false;\\n}\\ntemplate <class T>\\nusing minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T> using maxheap = std::priority_queue<T>;\\ntemplate <typename T> int lb(const vector<T>& v, T x) {\\n return lower_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> int ub(const vector<T>& v, T x) {\\n return upper_bound(begin(v), end(v), x) - begin(v);\\n}\\ntemplate <typename T> void rearrange(vector<T>& v) {\\n sort(begin(v), end(v));\\n v.erase(unique(begin(v), end(v)), end(v));\\n}\\n\\n// __int128_t gcd(__int128_t a, __int128_t b) {\\n// if (a == 0)\\n// return b;\\n// if (b == 0)\\n// return a;\\n// __int128_t cnt = a % b;\\n// while (cnt != 0) {\\n// a = b;\\n// b = cnt;\\n// cnt = a % b;\\n// }\\n// return b;\\n// }\\n\\nstruct Union_Find_Tree {\\n vector<int> data;\\n const int n;\\n int cnt;\\n \\n Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}\\n \\n int root(int x) {\\n if (data[x] < 0) return x;\\n return data[x] = root(data[x]);\\n }\\n \\n int operator[](int i) { return root(i); }\\n \\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false;\\n if (data[x] > data[y]) swap(x, y);\\n data[x] += data[y], data[y] = x;\\n cnt--;\\n return true;\\n }\\n \\n int size(int x) { return -data[root(x)]; }\\n \\n int count() { return cnt; };\\n \\n bool same(int x, int y) { return root(x) == root(y); }\\n \\n void clear() {\\n cnt = n;\\n fill(begin(data), end(data), -1);\\n }\\n};\\n\\ntemplate <int mod> struct Mod_Int {\\n int x;\\n\\n Mod_Int() : x(0) {}\\n\\n Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n static int get_mod() { return mod; }\\n\\n Mod_Int& operator+=(const Mod_Int& p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator-=(const Mod_Int& p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n Mod_Int& operator*=(const Mod_Int& p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n Mod_Int& operator/=(const Mod_Int& p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n Mod_Int& operator++() { return *this += Mod_Int(1); }\\n\\n Mod_Int operator++(int) {\\n Mod_Int tmp = *this;\\n ++*this;\\n return tmp;\\n }\\n\\n Mod_Int& operator--() { return *this -= Mod_Int(1); }\\n\\n Mod_Int operator--(int) {\\n Mod_Int tmp = *this;\\n --*this;\\n return tmp;\\n }\\n\\n Mod_Int operator-() const { return Mod_Int(-x); }\\n\\n Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; }\\n\\n Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; }\\n\\n Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; }\\n\\n Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; }\\n\\n bool operator==(const Mod_Int& p) const { return x == p.x; }\\n\\n bool operator!=(const Mod_Int& p) const { return x != p.x; }\\n\\n Mod_Int inverse() const {\\n assert(*this != Mod_Int(0));\\n return pow(mod - 2);\\n }\\n\\n Mod_Int pow(long long k) const {\\n Mod_Int now = *this, ret = 1;\\n for (; k > 0; k >>= 1, now *= now) {\\n if (k & 1) ret *= now;\\n }\\n return ret;\\n }\\n\\n friend ostream& operator<<(ostream& os, const Mod_Int& p) {\\n return os << p.x;\\n }\\n\\n friend istream& operator>>(istream& is, Mod_Int& p) {\\n long long a;\\n is >> a;\\n p = Mod_Int<mod>(a);\\n return is;\\n }\\n};\\n\\nll mpow2(ll x, ll n, ll mod) {\\n ll ans = 1;\\n x %= mod;\\n while (n != 0) {\\n if (n & 1) ans = ans * x % mod;\\n x = x * x % mod;\\n n = n >> 1;\\n }\\n ans %= mod;\\n return ans;\\n}\\n\\ntemplate <typename T> T modinv(T a, const T& m) {\\n T b = m, u = 1, v = 0;\\n while (b > 0) {\\n T t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return u >= 0 ? u % m : (m - (-u) % m) % m;\\n}\\n\\nll divide_int(ll a, ll b) {\\n if (b < 0) a = -a, b = -b;\\n return (a >= 0 ? a / b : (a - b + 1) / b);\\n}\\n\\n// const int MOD = 1000000007;\\nconst int MOD = 998244353;\\nusing mint = Mod_Int<MOD>;\\n\\n// ----- library -------\\n// ----- library -------\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (1) {\\n int n;\\n cin >> n;\\n if (!n)\\n break;\\n vector<int> l(n), r(n), u(n), d(n);\\n rep(i, n) cin >> l[i] >> d[i] >> r[i] >> u[i];\\n vector<int> xs, ys;\\n rep(i, n) xs.eb(l[i]), xs.eb(r[i]), ys.eb(u[i]), ys.eb(d[i]);\\n xs.eb(-1e9), xs.eb(1e9), ys.eb(-1e9), ys.eb(1e9);\\n rearrange(xs), rearrange(ys);\\n rep(i, n) l[i] = lb(xs, l[i]), r[i] = lb(xs, r[i]), u[i] = lb(ys, u[i]), d[i] = lb(ys, d[i]);\\n int h = sz(ys) - 1, w = sz(xs) - 1;\\n vector<vector<int>> rf(h, vector<int>(w, 1)), cf(h, vector<int>(w, 1));\\n rep(i, n) {\\n rep2(t, l[i], r[i]) rf[u[i] - 1][t] = 0, rf[d[i] - 1][t] = 0;\\n rep2(t, u[i], d[i]) cf[t][l[i] - 1] = 0, cf[t][r[i] - 1] = 0;\\n }\\n Union_Find_Tree uf(h * w);\\n rep(i, h - 1) rep(j, w) if (rf[i][j]) uf.unite(i * w + j, (i + 1) * w + j);\\n rep(i, h) rep(j, w - 1) if (cf[i][j]) uf.unite(i * w + j, i * w + j + 1);\\n cout << uf.count() << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.0047,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1337_6987456\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <complex>\\n#include <random>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vvvvvll = vector<vvvvll>;\\nusing vvvvvvll = vector<vvvvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vvvvb = vector<vvvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\nusing vvvvd = vector<vvvd>;\\nusing vvvvvd = vector<vvvvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n#define tN(t) (t==1?XN:YN)\\n#define tS(t) (t==1?XS:YS)\\n#define tA(t) (t==1?XA:YA)\\n\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\nll sqrtz(ll N) {\\n ll L = 0;\\n ll R = sqrt(N) + 10000;\\n while (abs(R - L) > 1) {\\n ll mid = (R + L) / 2;\\n if (mid * mid <= N)L = mid;\\n else R = mid;\\n }\\n return L;\\n\\n}\\n\\nvector<ll> fact, factinv, inv;\\nll mod = 1e9 + 7;\\nvoid prenCkModp(ll n) {\\n fact.resize(n + 5);\\n factinv.resize(n + 5);\\n inv.resize(n + 5);\\n fact.at(0) = fact.at(1) = 1;\\n factinv.at(0) = factinv.at(1) = 1;\\n inv.at(1) = 1;\\n for (ll i = 2; i < n + 5; i++) {\\n fact.at(i) = (fact.at(i - 1) * i) % mod;\\n inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;\\n factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;\\n }\\n\\n}\\nll nCk(ll n, ll k) {\\n if (n < k) return 0;\\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\\n}\\nll modPow(ll a, ll n, ll p) {\\n ll res = 1;\\n ll k = a;\\n while (n > 0) {\\n if (n % 2 == 1) {\\n res *= k;\\n if (res > p)res %= p;\\n }\\n k = k * k;\\n if (k > p)k %= p;\\n n /= 2;\\n }\\n return res;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n \\n while(1){\\n ll N;\\n cin>>N;\\n if(N==0)return 0;\\n map<ll,ll> MX,MY;\\n vector<pair<pair<ll,ll>,pair<ll,ll>>> P(N);\\n rep(i,N){\\n ll A,B,C,D;\\n cin>>A>>B>>C>>D;\\n swap(B,D);\\n MX[A]=MX[C]=1;\\n MY[B]=MY[D]=1;\\n P[i]={{A,B},{C,D}};\\n }\\n ll k=0,p=0;\\n for(auto x:MX){\\n MX[x.first]=2*k+1;\\n k++;\\n }\\n for(auto x:MY){\\n MY[x.first]=2*p+1;\\n p++;\\n }\\n vvll A(250,vll(250,0));\\n rep(i,N){\\n P[i].first.first=MX[P[i].first.first];\\n P[i].first.second=MY[P[i].first.second];\\n P[i].second.first=MX[P[i].second.first];\\n P[i].second.second=MY[P[i].second.second];\\n \\n for(ll j=P[i].first.first;j<=P[i].second.first;j++){\\n A[j][P[i].second.second]=1;\\n A[j][P[i].first.second]=1;\\n }\\n for(ll j=P[i].first.second;j<=P[i].second.second;j++){\\n A[P[i].second.first][j]=1;\\n A[P[i].first.first][j]=1;\\n }\\n }\\n //cout<<1<<endl;\\n ll an=0;\\n vll dx={1,0,-1,0};\\n vll dy={0,1,0,-1};\\n rep(i,250)rep(j,250){\\n if(A[i][j]==1)continue;\\n an++;\\n queue<pair<ll,ll>> Q;\\n Q.push({i,j});\\n while(!Q.empty()){\\n auto p=Q.front();\\n Q.pop();\\n if(A[p.first][p.second]==1)continue;\\n A[p.first][p.second]=1;\\n rep(d,4){\\n ll nx=p.first+dx[d];\\n ll ny=p.second+dy[d];\\n if(nx<0||ny<0||nx>=250||ny>=250)continue;\\n if(A[nx][ny]==1)continue;\\n Q.push({nx,ny});\\n }\\n }\\n }\\n cout<<an<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3824,\n \"score_of_the_acc\": -0.0229,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1337_6719103\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nstruct UF {\\n V<int> par;\\n UF(int n) : par(n, -1) {}\\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\\n bool merge(int x, int y) {\\n x = leader(x), y = leader(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n int size(int x) { return -par[leader(x)]; }\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N != 0) {\\n V<int> l(N), t(N), r(N), b(N);\\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\\n rep(i, N) {\\n zx.push_back(l[i]);\\n zx.push_back(r[i]);\\n zy.push_back(b[i]);\\n zy.push_back(t[i]);\\n }\\n sort(zx.begin(), zx.end());\\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\\n sort(zy.begin(), zy.end());\\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\\n rep(i, N) {\\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\\n }\\n int H = zx.size(), W = zy.size();\\n V<V<ll>> imos(H + 1, V<ll>(W + 1, 0));\\n rep(i, N) {\\n imos[l[i]][b[i]] += 1LL << i;\\n imos[l[i]][t[i]] -= 1LL << i;\\n imos[r[i]][b[i]] -= 1LL << i;\\n imos[r[i]][t[i]] += 1LL << i;\\n }\\n rep(x, H + 1) rep(y, W) imos[x][y + 1] += imos[x][y];\\n rep(x, H) rep(y, W + 1) imos[x + 1][y] += imos[x][y];\\n int M = (H + 1) * (W + 1);\\n UF uf(M);\\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n rep(k, 4) {\\n int nx = x + dx[k], ny = y + dy[k];\\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\\n if (imos[x][y] == imos[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\\n }\\n }\\n }\\n int ans = 0;\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\\n ans++;\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.0053,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1337_6719075\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nstruct UF {\\n V<int> par;\\n UF(int n) : par(n, -1) {}\\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\\n bool merge(int x, int y) {\\n x = leader(x), y = leader(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N != 0) {\\n V<int> l(N), t(N), r(N), b(N);\\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\\n rep(i, N) {\\n zx.push_back(l[i]);\\n zx.push_back(r[i]);\\n zy.push_back(b[i]);\\n zy.push_back(t[i]);\\n }\\n sort(zx.begin(), zx.end());\\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\\n sort(zy.begin(), zy.end());\\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\\n rep(i, N) {\\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\\n }\\n int H = zx.size(), W = zy.size();\\n V<V<ll>> cum(H + 1, V<ll>(W + 1, 0));\\n rep(i, N) {\\n cum[l[i]][b[i]] += 1LL << i;\\n cum[l[i]][t[i]] -= 1LL << i;\\n cum[r[i]][b[i]] -= 1LL << i;\\n cum[r[i]][t[i]] += 1LL << i;\\n }\\n rep(x, H) rep(y, W) cum[x + 1][y + 1] += cum[x + 1][y] + cum[x][y + 1] - cum[x][y];\\n int M = (H + 1) * (W + 1);\\n UF uf(M);\\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n rep(k, 4) {\\n int nx = x + dx[k], ny = y + dy[k];\\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\\n if (cum[x][y] == cum[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\\n }\\n }\\n }\\n int ans = 0;\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\\n ans++;\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.0053,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1337_6719074\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nstruct UF {\\n V<int> par;\\n UF(int n) : par(n, -1) {}\\n int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }\\n bool merge(int x, int y) {\\n x = leader(x), y = leader(y);\\n if (x == y) return false;\\n if (par[x] > par[y]) swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n int size(int x) { return -par[leader(x)]; }\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N;\\n while (cin >> N, N != 0) {\\n V<int> l(N), t(N), r(N), b(N);\\n rep(i, N) cin >> l[i] >> t[i] >> r[i] >> b[i];\\n V<int> zx = {-1, 1000001}, zy = {-1, 1000001};\\n rep(i, N) {\\n zx.push_back(l[i]);\\n zx.push_back(r[i]);\\n zy.push_back(b[i]);\\n zy.push_back(t[i]);\\n }\\n sort(zx.begin(), zx.end());\\n zx.erase(unique(zx.begin(), zx.end()), zx.end());\\n sort(zy.begin(), zy.end());\\n zy.erase(unique(zy.begin(), zy.end()), zy.end());\\n rep(i, N) {\\n l[i] = lower_bound(zx.begin(), zx.end(), l[i]) - zx.begin();\\n r[i] = lower_bound(zx.begin(), zx.end(), r[i]) - zx.begin();\\n b[i] = lower_bound(zy.begin(), zy.end(), b[i]) - zy.begin();\\n t[i] = lower_bound(zy.begin(), zy.end(), t[i]) - zy.begin();\\n }\\n int H = zx.size(), W = zy.size();\\n V<V<ll>> cum(H + 1, V<ll>(W + 1, 0));\\n rep(i, N) {\\n cum[l[i]][b[i]] += 1LL << i;\\n cum[l[i]][t[i]] -= 1LL << i;\\n cum[r[i]][b[i]] -= 1LL << i;\\n cum[r[i]][t[i]] += 1LL << i;\\n }\\n rep(x, H) rep(y, W) cum[x + 1][y + 1] += cum[x + 1][y] + cum[x][y + 1] - cum[x][y];\\n int M = (H + 1) * (W + 1);\\n UF uf(M);\\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n rep(k, 4) {\\n int nx = x + dx[k], ny = y + dy[k];\\n if (!(0 <= nx and nx <= H and 0 <= ny and ny <= W)) continue;\\n if (cum[x][y] == cum[nx][ny]) uf.merge(x * (W + 1) + y, nx * (W + 1) + ny);\\n }\\n }\\n }\\n int ans = 0;\\n rep(x, H + 1) {\\n rep(y, W + 1) {\\n if (x * (W + 1) + y == uf.leader(x * (W + 1) + y)) {\\n ans++;\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.0062,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1337_6458457\",\n \"code_snippet\": \"#line 1 \\\"f.cpp\\\"\\n/**\\n *\\tauthor: nok0\\n *\\tcreated: 2022.04.06 14:06:15\\n**/\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/dsu.hpp\\\"\\n\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\n\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\n#define REPname(a, b, c, d, e, ...) e\\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int i = 0; i < (x); ++i)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &...tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\nstd::vector<std::pair<char, int>> rle(const string &s) {\\n\\tint n = s.size();\\n\\tstd::vector<std::pair<char, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and s[l] == s[r]; r++) {}\\n\\t\\tret.emplace_back(s[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T>\\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\\n\\tint n = v.size();\\n\\tstd::vector<std::pair<T, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and v[l] == v[r]; r++) {}\\n\\t\\tret.emplace_back(v[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\nstd::vector<int> iota(int n) {\\n\\tstd::vector<int> p(n);\\n\\tstd::iota(p.begin(), p.end(), 0);\\n\\treturn p;\\n}\\ntemplate <class T>\\nstruct cum_vector {\\npublic:\\n\\tcum_vector() = default;\\n\\ttemplate <class U>\\n\\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\\n\\t\\tfor(int i = 0; i < (int)vec.size(); i++)\\n\\t\\t\\tcum[i + 1] = cum[i] + vec[i];\\n\\t}\\n\\tT prod(int l, int r) {\\n\\t\\treturn cum[r] - cum[l];\\n\\t}\\n\\nprivate:\\n\\tstd::vector<T> cum;\\n};\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\ta = (a % mod + mod) % mod;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f) {\\n\\twhile(abs(ok - ng) > 1) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f, int loop) {\\n\\tfor(int i = 0; i < loop; i++) {\\n\\t\\tT mid = (ok + ng) / 2;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nvoid main_();\\n\\nint main() {\\n\\tmain_();\\n\\treturn 0;\\n}\\n#line 7 \\\"f.cpp\\\"\\n\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\nvoid main_() {\\n\\twhile(true) {\\n\\t\\tINT(n);\\n\\t\\tif(!n) break;\\n\\t\\tusing T = tuple<int, int, int, int>;\\n\\t\\tV<T> vec;\\n\\t\\tV<> xp{-inf, inf}, yp{-inf, inf};\\n\\t\\tREP(i, n) {\\n\\t\\t\\tINT(sx, gy, gx, sy);\\n\\t\\t\\txp.pb(sx);\\n\\t\\t\\txp.pb(gx);\\n\\t\\t\\typ.pb(sy);\\n\\t\\t\\typ.pb(gy);\\n\\t\\t\\tvec.pb(T(sx, sy, gx, gy));\\n\\t\\t}\\n\\t\\tauto rx = press(xp);\\n\\t\\tauto ry = press(yp);\\n\\t\\tint h = SZ(rx) - 1, w = SZ(ry) - 1;\\n\\t\\tvector board(h, vector(w, 0));\\n\\t\\tREP(k, n) {\\n\\t\\t\\tauto [sx, sy, gx, gy] = vec[k];\\n\\t\\t\\tsx = lb(rx, sx);\\n\\t\\t\\tgx = lb(rx, gx);\\n\\t\\t\\tsy = lb(ry, sy);\\n\\t\\t\\tgy = lb(ry, gy);\\n\\t\\t\\t//(sx, sy) - (gx,sy)\\n\\t\\t\\tREP(i, sx, gx) {\\n\\t\\t\\t\\tboard[i][sy - 1] |= 1 << 1;\\n\\t\\t\\t\\tboard[i][sy] |= 1 << 3;\\n\\t\\t\\t\\tboard[i][gy - 1] |= 1 << 1;\\n\\t\\t\\t\\tboard[i][gy] |= 1 << 3;\\n\\t\\t\\t}\\n\\t\\t\\tREP(i, sy, gy) {\\n\\t\\t\\t\\tboard[sx - 1][i] |= 1 << 0;\\n\\t\\t\\t\\tboard[sx][i] |= 1 << 2;\\n\\t\\t\\t\\tboard[gx - 1][i] |= 1 << 0;\\n\\t\\t\\t\\tboard[gx][i] |= 1 << 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tatcoder::dsu uf(h * w);\\n\\t\\tREP(i, h) {\\n\\t\\t\\tREP(j, w) {\\n\\t\\t\\t\\tint u = i * w + j;\\n\\t\\t\\t\\tREP(k, 4) {\\n\\t\\t\\t\\t\\tif(!(board[i][j] >> k & 1)) {\\n\\t\\t\\t\\t\\t\\tint nx = i + dx[k];\\n\\t\\t\\t\\t\\t\\tint ny = j + dy[k];\\n\\t\\t\\t\\t\\t\\tif(nx < 0 or nx >= h or ny < 0 or ny >= w) continue;\\n\\t\\t\\t\\t\\t\\tint v = nx * w + ny;\\n\\t\\t\\t\\t\\t\\tuf.merge(u, v);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprint(SZ(uf.groups()));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3872,\n \"score_of_the_acc\": -0.012,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1337_6020675\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define ll long long\\n#define pp pair<ll,ll>\\n#define ld long double\\n#define all(a) (a).begin(),(a).end()\\n#define mk make_pair\\n#define difine define\\nconstexpr int inf=1000001000;\\nconstexpr ll INF=2e18;\\nconstexpr ll MOD=1000000007;\\nconstexpr ll mod=998244353;\\nint dx[4]={1,-1,-1,1},dy[4]={1,-1,1,-1};\\n\\nvector<int> a(4);\\nstring s;\\n \\n// #include <atcoder/all>\\n// typedef atcoder::modint1000000007 mint;\\n// typedef atcoder::modint998244353 mint;\\n\\nint main() {\\n while(true){\\n int n;\\n cin >> n;\\n if (n==0) break;\\n set<int> sx,sy;\\n vector<int> l(n),t(n),r(n),b(n);\\n rep(i,n){\\n cin >> l[i] >> t[i] >> r[i] >> b[i];\\n sx.insert(l[i]);\\n sx.insert(r[i]);\\n sy.insert(t[i]);\\n sy.insert(b[i]);\\n }\\n map<int,int> mx,my;\\n int x=1,y=1;\\n for (auto it=sx.begin();it!=sx.end();it++){\\n int f=*it;\\n mx[f]=x;\\n x++;\\n }\\n for (auto it=sy.begin();it!=sy.end();it++){\\n int f=*it;\\n my[f]=y;\\n y++;\\n }\\n x+=2;\\n y+=2;\\n rep(i,n){\\n l[i]=mx[l[i]];\\n r[i]=mx[r[i]];\\n t[i]=my[t[i]];\\n b[i]=my[b[i]];\\n }\\n vector<vector<int>> d(x,vector<int>(y,0));\\n int ans=0;\\n rep(i,x){\\n rep(j,y){\\n if (d[i][j]==1) continue;\\n // cout << i << \\\" \\\" << j << endl;\\n ans++;\\n d[i][j]=1;\\n queue<pair<int,int>> q;\\n q.push({i,j});\\n while(!q.empty()){\\n auto [f,g]=q.front();\\n q.pop();\\n if (f+1!=x){\\n bool ok=true;\\n if (d[f+1][g]==1) ok=false;\\n rep(k,n){\\n if (g>=b[k] && g<t[k] && (f+1==l[k] || f+1==r[k])) ok=false;\\n }\\n if (ok){\\n q.push({f+1,g});\\n d[f+1][g]=1;\\n }\\n }\\n if (f-1!=-1){\\n bool ok=true;\\n if (d[f-1][g]==1) ok=false;\\n rep(k,n){\\n if (g>=b[k] && g<t[k] && (f==l[k] || f==r[k])) ok=false;\\n }\\n if (ok){\\n q.push({f-1,g});\\n d[f-1][g]=1;\\n }\\n }\\n if (g+1!=y){\\n bool ok=true;\\n if (d[f][g+1]==1) ok=false;\\n rep(k,n){\\n if (f>=l[k] && f<r[k] && (g+1==b[k] || g+1==t[k])) ok=false;\\n }\\n if (ok){\\n q.push({f,g+1});\\n d[f][g+1]=1;\\n }\\n }\\n if (g-1!=-1){\\n bool ok=true;\\n if (d[f][g-1]==1) ok=false;\\n rep(k,n){\\n if (f>=l[k] && f<r[k] && (g==b[k] || g==t[k])) ok=false;\\n }\\n if (ok){\\n q.push({f,g-1});\\n d[f][g-1]=1;\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -0.0458,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1337_6020497\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing P = pair<int,int>;\\n\\nint main() {\\n \\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n \\n vector<int> di = {1,0,-1,0};\\n vector<int> dj = {0,1,0,-1};\\n int n;\\n cin >> n;\\n while (n != 0) {\\n vector<int> l(n),t(n),r(n),b(n);\\n for (int i=0;i<n;i++) {\\n cin >> l[i] >> t[i] >> r[i] >> b[i];\\n }\\n vector<int> xs;\\n vector<int> ys;\\n for (int i=0;i<n;i++) {\\n xs.emplace_back(l[i]);\\n xs.emplace_back(r[i]);\\n ys.emplace_back(t[i]);\\n ys.emplace_back(b[i]);\\n }\\n xs.emplace_back(-100);\\n xs.emplace_back(1e7);\\n ys.emplace_back(-100);\\n ys.emplace_back(1e7);\\n sort(xs.begin(),xs.end());\\n sort(ys.begin(),ys.end());\\n auto itx = unique(xs.begin(),xs.end());\\n auto ity = unique(ys.begin(),ys.end());\\n xs.erase(itx,xs.end());\\n ys.erase(ity,ys.end());\\n int nx = xs.size();\\n int ny = ys.size();\\n vector<vector<long long>> maps(nx-1,vector<long long>(ny-1,0));\\n for (int i=0;i<n;i++) {\\n for (int j=0;j<nx-1;j++) {\\n for (int k=0;k<ny-1;k++) {\\n if (xs[j] >= l[i] && r[i] >= xs[j+1] && ys[k] >= b[i] && t[i] >= ys[k+1]) {\\n maps[j][k] += 1LL<<i;\\n }\\n }\\n }\\n }\\n vector<vector<bool>> used(nx-1,vector<bool>(ny-1,false));\\n int ans = 0;\\n for (int i=0;i<nx-1;i++) {\\n for (int j=0;j<ny-1;j++) {\\n if (used[i][j]) continue;\\n ans++;\\n queue<P> q;\\n q.push(P(i,j));\\n used[i][j] = true;\\n while (!q.empty()) {\\n P np = q.front();\\n q.pop();\\n int ni = np.first;\\n int nj = np.second;\\n //cout << maps[ni][nj] << endl;\\n for (int k=0;k<4;k++) {\\n int toi = ni+di[k];\\n int toj = nj+dj[k];\\n if (toi < 0 || toi >= nx-1 || toj < 0 || toj >= ny-1) {\\n continue;\\n }\\n if (maps[toi][toj] != maps[ni][nj]) continue;\\n if (used[toi][toj]) continue;\\n used[toi][toj] = true;\\n q.push(P(toi,toj));\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n cin >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0124,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1337_6001211\",\n \"code_snippet\": \"#define rep(i, n) for(int i=0; i<(n); ++i)\\n#define rrep(i, n) for(int i=(n-1); i>=0; --i)\\n#define rep2(i, s, n) for(int i=s; i<(n); ++i)\\n#define ALL(v) (v).begin(), (v).end()\\n#define memr(dp, val) memset(dp, val, sizeof(dp))\\n#define fi first\\n#define se second\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<typename T>\\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T> >;\\ntypedef long long ll;\\nconst int INTINF = INT_MAX >> 1;\\nstatic const ll LLINF = (LLONG_MAX >> 1);\\n\\nint dx[4] = {0, 0, -1, 1};\\nint dy[4] = {1, -1, 0, 0};\\n\\nint mx, my;\\n\\nint n;\\nint l[51], t[51], r[51], b[51];\\n\\nset<int> s[501][501];\\nbool used[501][501];\\n\\nbool input(){\\n\\n cin >> n;\\n if(!n) return false;\\n set<int> xs, ys;\\n xs.insert(0);\\n xs.insert(1000000);\\n ys.insert(0);\\n ys.insert(1000000);\\n map<int, int> xcomp, ycomp;\\n rep(i, n) {\\n cin >> l[i] >> t[i] >> r[i] >> b[i];\\n xs.insert(l[i]);\\n xs.insert(r[i]);\\n ys.insert(t[i]);\\n ys.insert(b[i]);\\n }\\n\\n int cnt = 1;\\n int bef = -1;\\n for(int x : xs) {\\n xcomp[x] = cnt;\\n cnt++;\\n bef = x;\\n }\\n bef = -1;\\n cnt = 1;\\n for(int y : ys) {\\n ycomp[y] = cnt;\\n cnt++;\\n bef = y;\\n }\\n\\n rep(i, n){\\n l[i] = xcomp[l[i]];\\n r[i] = xcomp[r[i]];\\n t[i] = ycomp[t[i]];\\n b[i] = ycomp[b[i]];\\n }\\n mx = xcomp[1000000] + 2;\\n my = ycomp[1000000] + 2;\\n\\n\\treturn true;\\n}\\n\\nint main(){\\n std::cout << std::fixed << std::setprecision(15);\\n\\n while(input()){\\n rep(i, my){\\n rep(j, mx){\\n s[i][j].clear();\\n }\\n }\\n\\n rep(i, n){\\n rep(j, r[i] - l[i]){\\n rep(k, t[i] - b[i]){\\n s[b[i] + k][l[i] + j].insert(i);\\n }\\n }\\n }\\n\\n memr(used, 0);\\n int ans = 0;\\n rep(i, my){\\n rep(j, mx){\\n if(!used[i][j]){\\n ans++;\\n queue<pair<int, int> > q;\\n q.push({j, i});\\n used[i][j] = true;\\n while(q.size()){\\n auto f = q.front(); q.pop();\\n rep(k, 4){\\n int nx = f.fi + dx[k];\\n int ny = f.se + dy[k];\\n if(nx < 0 || nx >= mx) continue;\\n if(ny < 0 || ny >= my) continue;\\n if(used[ny][nx]) continue;\\n if(s[ny][nx] != s[f.se][f.fi]) continue;\\n\\n used[ny][nx] = true;\\n q.push({nx, ny});\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 22960,\n \"score_of_the_acc\": -0.3079,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1337_5964938\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nvector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};\\n\\n// 座標圧縮\\nmap<ll, int> compress(const vector<ll> &x) {\\n map<ll, int> comp;\\n for (int i = 0; i < x.size(); i++) comp[x.at(i)] = 1;\\n int i = 0;\\n for (auto it = comp.begin(); it != comp.end(); it++, i++) it->second = i;\\n return comp;\\n}\\n\\nvoid bfs(vector<vector<bool>> &dp, int si, int sj) {\\n dp[si][sj] = true;\\n queue<pair<int, int>> q;\\n q.push(make_pair(si, sj));\\n while (!q.empty()) {\\n pair<int, int> p = q.front();\\n q.pop();\\n for (int i = 0; i < 4; i++) {\\n int ni = p.first + dx[i], nj = p.second + dy[i];\\n if (0 <= ni && ni < dp.size() && 0 <= nj && nj < dp[0].size() && !dp[ni][nj]) {\\n dp[ni][nj] = true;\\n q.push(make_pair(ni, nj));\\n }\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) return 0;\\n\\n vector<ll> l(n), t(n), r(n), b(n), x, y;\\n for (int i = 0; i < n; i++) {\\n cin >> l[i] >> t[i] >> r[i] >> b[i];\\n x.emplace_back(l[i]);\\n x.emplace_back(r[i]);\\n y.emplace_back(t[i]);\\n y.emplace_back(b[i]);\\n }\\n x.emplace_back(-10);\\n x.emplace_back(10000000);\\n y.emplace_back(-10);\\n y.emplace_back(10000000);\\n\\n map<ll, int> mpx = compress(x), mpy = compress(y);\\n\\n vector<vector<bool>> dp((int) mpx.size() * 3, vector<bool>((int) mpy.size() * 3, false));\\n for (int i = 0; i < n; i++) {\\n for (int ii = mpx[l[i]] * 3 + 1; ii <= mpx[r[i]] * 3 + 1; ii++) {\\n dp[ii][mpy[b[i]] * 3 + 1] = true;\\n dp[ii][mpy[t[i]] * 3 + 1] = true;\\n }\\n for (int jj = mpy[b[i]] * 3 + 1; jj <= mpy[t[i]] * 3 + 1; jj++) {\\n dp[mpx[l[i]] * 3 + 1][jj] = true;\\n dp[mpx[r[i]] * 3 + 1][jj] = true;\\n }\\n }\\n\\n int ans = 0;\\n for (int i = 0; i < dp.size(); i++) {\\n for (int j = 0; j < dp[0].size(); j++) {\\n if (!dp[i][j]) {\\n bfs(dp, i, j);\\n ans++;\\n }\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.0247,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1337_5963211\",\n \"code_snippet\": \"// #include \\\"atcoder/all\\\"\\n#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include <iomanip> // setprecision\\n#include <complex> // complex\\n#include <math.h>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing P = pair<ll,ll>;\\nconstexpr ll INF = 1e15;\\nconstexpr ll LLMAX = 9223372036854775807;\\nconstexpr int inf = 1e9;\\n// constexpr ll mod = 1000000007;\\nconstexpr ll mod = 998244353;\\n// 右下左上\\nconst int dx[8] = {1, 0, -1, 0,1,1,-1,-1};\\nconst int dy[8] = {0, 1, 0, -1,1,-1,1,-1};\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define eol \\\"\\\\n\\\"\\n// ---------------------------------------------------------------------------\\n\\ntemplate<typename T>\\nstruct Compress {\\n\\tvector<T> v;\\n\\tCompress() {}\\n\\tCompress(vector<T> _v) {\\n\\t\\tbuild(_v);\\n\\t}\\n \\n\\tvoid build(vector<T> _v) {\\n\\t\\tv = _v;\\n\\t\\tsort(v.begin(), v.end());\\n\\t\\tv.erase(unique(v.begin(), v.end()), v.end());\\n\\t}\\n\\tint get(T x) {\\n\\t\\treturn lower_bound(v.begin(), v.end(), x) - v.begin();\\n\\t}\\n \\n\\tT& operator[](int i) { return v[i]; }\\n \\n \\n\\tint size() {\\n\\t\\treturn (int)v.size();\\n\\t}\\n};\\n\\n\\nstruct UnionFind {\\n vector<int> par, w;\\n\\n UnionFind(int n) : par(n, -1), w(n, 0) { }\\n void init(int n) { par.assign(n, -1); w.assign(n, 0); }\\n\\n int root(int x) {\\n if (par[x] < 0) return x;\\n else return par[x] = root(par[x]);\\n }\\n\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n bool merge(int x, int y) {\\n x = root(x); y = root(y);\\n if (x == y) {\\n ++w[x];\\n return false;\\n }\\n if (par[x] > par[y]) swap(x, y); // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n w[x] += w[y];\\n ++w[x];\\n return true;\\n }\\n\\n int size(int x) {\\n return -par[root(x)];\\n }\\n\\n int wei(int x) {\\n return w[root(x)];\\n }\\n};\\n\\n\\nbool solve(){\\n int N;\\n cin >> N;\\n if(N == 0) return false;\\n vector<int> X,Y;\\n vector<int> lx(N),ly(N),rx(N),ry(N);\\n for(int i=0; i<N; i++){\\n cin >> lx[i] >> ry[i] >> rx[i] >> ly[i];\\n X.emplace_back(lx[i]);\\n X.emplace_back(rx[i]);\\n Y.emplace_back(ly[i]);\\n Y.emplace_back(ry[i]);\\n }\\n X.emplace_back(-1);\\n X.emplace_back(inf);\\n Y.emplace_back(-1);\\n Y.emplace_back(inf);\\n Compress<int> CX(X),CY(Y);\\n vector<vector<ll>> G(CX.size()+1,vector<ll>(CY.size()+1));\\n for(int i=0; i<N; i++){\\n for(int x=CX.get(lx[i]); x<CX.get(rx[i]); x++){\\n for(int y=CY.get(ly[i]); y<CY.get(ry[i]); y++){\\n G[x][y] += (1LL<<i);\\n }\\n }\\n }\\n // for(int i=0; i<CX.size(); i++){\\n // for(int j=0; j<CY.size(); j++){\\n // cout << G[i][j] << \\\" \\\\n\\\"[j+1==CY.size()];\\n // }\\n // }\\n int ans = 0;\\n vector<vector<int>> used(CX.size(),vector<int>(CY.size(),0));\\n for(int i=0; i<CX.size(); i++){\\n for(int j=0; j<CY.size(); j++){\\n if(used[i][j] != 0) continue;\\n ans++;\\n queue<P> que;\\n que.emplace(i,j);\\n used[i][j] = ans;\\n while(que.size()){\\n int y = que.front().first;\\n int x = que.front().second;\\n que.pop();\\n for(int k=0; k<4; k++){\\n int ny = y + dy[k];\\n int nx = x + dx[k];\\n if(ny<0 || ny>=CX.size() || nx<0 || nx>=CY.size()) continue;\\n if(G[y][x] != G[ny][nx]) continue;\\n if(used[ny][nx] != 0) continue;\\n used[ny][nx] = ans;\\n que.emplace(ny,nx);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.01,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1337_5956478\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing T = tuple<int,int,int,int>;\\nconst int MAX = 500;\\n\\nmap<int64_t,int64_t> mx;\\nmap<int64_t,int64_t> my;\\n\\nset<int> sum[MAX][MAX];\\nvoid init(){\\n for(int i=0; i<MAX; i++){\\n for(int j=0; j<MAX; j++){\\n sum[i][j].clear();\\n }\\n }\\n}\\n\\n//一次元座標圧縮\\nmap<int64_t, int64_t> compression(vector<int64_t> V){\\n map<int64_t, int64_t> ret;\\n int64_t cnt = 0;\\n sort(V.begin(),V.end());\\n for(int i=0; i<V.size(); i++){\\n if(!ret.count(V[i])){\\n ret[V[i]] = cnt;\\n cnt++;\\n }\\n }\\n return ret;\\n}\\n\\n//UnionFind\\nint n = 500*500;\\nvector<int> par(n);\\nvector<int> Size(n);\\n\\nvoid init_union(int n){\\n for(int i=0; i<n; i++){\\n par.at(i) = i;\\n Size.at(i) = 1;\\n }\\n}\\n\\nint root(int x){\\n if(par.at(x) == x){\\n return x;\\n }\\n else{\\n return par.at(x) = root(par.at(x));\\n }\\n}\\n\\nbool same(int x, int y){\\n return root(x) == root(y);\\n}\\n\\nvoid unite(int x, int y){\\n x = root(x);\\n y = root(y);\\n if(x == y){\\n return;\\n }\\n if (Size.at(x) < Size.at(y)){\\n swap(x, y);\\n }\\n Size.at(x) += Size.at(y);\\n par.at(y) = x;\\n}\\n\\nint Size_x(int x){\\n return Size.at(root(x));\\n}\\n\\nvoid solve(int N){\\n init();\\n vector<T> vec(N);\\n vector<int64_t> X = {-1000000000, 1000000000};\\n vector<int64_t> Y = {-1000000000, 1000000000};\\n for(int i=0; i<N; i++){\\n int x1, y1, x2, y2;\\n cin >> x1 >> y2 >> x2 >> y1;\\n x2--; y2--;\\n vec[i] = {x1,y1,x2,y2};\\n for(int j=-1; j<=1; j++){\\n X.push_back(x1+j);\\n X.push_back(x2+j);\\n Y.push_back(y1+j);\\n Y.push_back(y2+j);\\n }\\n }\\n mx = compression(X);\\n my = compression(Y);\\n for(int i=0; i<N; i++){\\n auto[x1,y1,x2,y2] = vec[i];\\n for(auto itr = mx.begin(); itr != mx.end(); itr++){\\n int x = itr->first;\\n for(auto itr2 = my.begin(); itr2 != my.end(); itr2++){\\n int y = itr2->first;\\n if(x1 <= x && x <= x2 && y1 <= y && y <= y2){\\n sum[itr->second][itr2->second].insert(i);\\n }\\n }\\n }\\n }\\n init_union(n);\\n vector<int> dx = {0,1,0,-1};\\n vector<int> dy = {1,0,-1,0};\\n for(int i=0; i<MAX; i++){\\n for(int j=0; j<MAX; j++){\\n for(int k=0; k<4; k++){\\n if(0 <= i+dx[k] && i+dx[k] < MAX-1 && 0 <= j+dy[k] && j+dy[k] < MAX-1){\\n if(sum[i][j] == sum[i+dx[k]][j+dy[k]]){\\n unite(i*MAX+j, (i+dx[k])*MAX + j+dy[k]);\\n }\\n }\\n }\\n }\\n }\\n int ans = 0;\\n for(int i=0; i<X.size(); i++){\\n for(int j=0; j<Y.size(); j++){\\n if(root(i*MAX+j) == i*MAX+j){\\n ans++;\\n }\\n }\\n }\\n cout << ans << endl;\\n \\n /*for(int i=0; i<X.size(); i++){\\n for(int j=0; j<Y.size(); j++){\\n cout << num[i][j] << \\\" \\\";\\n }\\n cout << endl;\\n }*/\\n}\\n\\nint main(){\\n while(true){\\n int N;\\n cin >> N;\\n if(N == 0){\\n break;\\n }\\n solve(N);\\n //break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6120,\n \"memory_kb\": 87764,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1337_5927964\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#pragma region Macros\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/data_structure/compress.hpp\\\"\\ntemplate <typename T> struct Compress {\\n vector<T> v;\\n Compress() {}\\n Compress(vector<T> vv) : v(vv) {\\n sort(ALL(v));\\n v.erase(unique(ALL(v)), end(v));\\n }\\n void build(vector<T> vv) {\\n v = vv;\\n sort(ALL(v));\\n v.erase(unique(ALL(v)), end(v));\\n }\\n int get(T x) { return (int)(lower_bound(ALL(v), x) - v.begin()); }\\n T &operator[](int i) { return v[i]; }\\n size_t size() { return v.size(); }\\n};\\n#line 1 \\\"/home/siro53/kyo-pro/compro_library/graph/dsu.hpp\\\"\\nstruct UnionFind {\\n vector<int> par;\\n\\n UnionFind(int n) : par(n, -1) {}\\n void init(int n) { par.assign(n, -1); }\\n\\n int root(int x) {\\n if(par[x] < 0)\\n return x;\\n else\\n return par[x] = root(par[x]);\\n }\\n\\n bool issame(int x, int y) { return root(x) == root(y); }\\n\\n bool merge(int x, int y) {\\n x = root(x);\\n y = root(y);\\n if(x == y)\\n return false;\\n if(par[x] > par[y])\\n swap(x, y); // merge technique\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n\\n int size(int x) { return -par[root(x)]; }\\n};\\n#line 74 \\\"main.cpp\\\"\\n\\nusing R = array<int, 4>;\\n\\nbool solve() {\\n int N;\\n cin >> N;\\n if(N == 0) return false;\\n vector<R> recs(N);\\n Compress<int> comp_x, comp_y;\\n {\\n vector<int> vx = {-1, 1000001}, vy = {-1, 1000001};\\n REP(i, N) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y2 >> x2 >> y1;\\n vx.push_back(x1);\\n vy.push_back(y1);\\n vx.push_back(x2);\\n vy.push_back(y2);\\n recs[i] = {x1, y1, x2, y2};\\n }\\n comp_x.build(vx); comp_y.build(vy);\\n REP(i, N) {\\n recs[i][0] = comp_x.get(recs[i][0]) * 2;\\n recs[i][1] = comp_y.get(recs[i][1]) * 2;\\n recs[i][2] = comp_x.get(recs[i][2]) * 2;\\n recs[i][3] = comp_y.get(recs[i][3]) * 2;\\n }\\n }\\n int Lx = comp_x.size() * 2;\\n int Ly = comp_y.size() * 2;\\n vector G(Lx, vector<int>(Ly, 0));\\n REP(i, N) {\\n auto [x1, y1, x2, y2] = recs[i];\\n FOR(y, y1, y2+1) G[x1][y] = G[x2][y] = 1;\\n FOR(x, x1, x2+1) G[x][y1] = G[x][y2] = 1;\\n }\\n UnionFind uf(Lx*Ly);\\n\\n REP(i, Lx) REP(j, Ly) {\\n if(G[i][j]) continue;\\n REP(dir, 4) {\\n int ni = i + dx[dir], nj = j + dy[dir];\\n if(ni < 0 or ni >= Lx or nj < 0 or nj >= Ly) continue;\\n if(G[ni][nj]) continue;\\n uf.merge(i*Ly + j, ni*Ly + nj);\\n }\\n }\\n set<int> se;\\n REP(i, Lx) REP(j, Ly) {\\n if(G[i][j]) continue;\\n se.insert(uf.root(i*Ly + j));\\n }\\n cout << se.size() << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -0.0223,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1337_5926769\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing ull = unsigned long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<P,int>;\\nusing PP = pair<P, P>;\\nconstexpr int INF32 = 1 << 30;\\nconstexpr ll INF64 = 1LL << 60;\\nconstexpr ll MOD = 1000000007;\\n// constexpr ll MOD = 998244353;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr int di8[] = {0, 1, 1, 1, 0, -1, -1, -1};\\nconstexpr int dj8[] = {1, 1, 0, -1, -1, -1, 0, 1};\\nconstexpr double EPS = 1e-9;\\nconst double PI = acos(-1);\\n\\n#define ALL(v) (v).begin(),(v).end()\\n#define REP(i,n) for(int i=0,i_len=n; i<i_len; ++i)\\n\\ntemplate<typename T1,typename T2> bool chmax(T1 &a, T2 b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<typename T1,typename T2> bool chmin(T1 &a, T2 b) { if (b<a) { a=b; return 1; } return 0; }\\n\\nstruct UnionFindTree {\\n vector<int> par;\\n vector<int> rank;\\n vector<int> siz;\\n int N;\\n\\n void init(int n) {\\n par.resize(n);\\n rank.resize(n);\\n siz.resize(n);\\n for (int i = 0; i < n; i++) {\\n par[i] = i;\\n rank[i] = 0;\\n siz[i] = 1;\\n N = n;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) {\\n return x;\\n } else {\\n return par[x] = find(par[x]);\\n }\\n }\\n void unite(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if (x == y) return;\\n if (rank[x] < rank[y]) swap(x, y);\\n if (rank[x] == rank[y]) rank[x]++;\\n par[y] = x;\\n siz[x] += siz[y];\\n N--;\\n }\\n bool is_same(int x, int y) {\\n return find(x) == find(y);\\n }\\n int size(int x) {\\n x = find(x);\\n return siz[x];\\n }\\n};\\n\\nmap<int,int> compress(vector<int> x){\\n auto v = x;\\n sort(ALL(v));\\n v.erase(unique(ALL(v)),v.end());\\n map<int,int> ord;\\n for(int i=0;i<v.size();i++) ord[v[i]] = i;\\n return ord;\\n}\\n\\nint solve(){\\n int n;\\n cin >> n;\\n if(n == 0) return 1;\\n vector<int> xs, ys, l(n), t(n), r(n), b(n);\\n REP(i,n){\\n cin >> l[i] >> t[i] >> r[i] >> b[i];\\n xs.push_back(l[i]);\\n xs.push_back(r[i]);\\n ys.push_back(t[i]);\\n ys.push_back(b[i]);\\n }\\n auto xord = compress(xs);\\n auto yord = compress(ys);\\n int m = max(xord.size(), yord.size()) + 1;\\n REP(i,n){\\n l[i] = xord[l[i]]+1;\\n r[i] = xord[r[i]]+1;\\n t[i] = yord[t[i]]+1;\\n b[i] = yord[b[i]]+1;\\n }\\n vector<vector<ll> > a(m+1, vector<ll>(m+1));\\n REP(i,n){\\n a[l[i]][b[i]] |= 1LL<<i;\\n a[l[i]][t[i]] |= 1LL<<i;\\n a[r[i]][b[i]] |= 1LL<<i;\\n a[r[i]][t[i]] |= 1LL<<i;\\n }\\n REP(i,m+1) REP(j,m) a[i][j+1] ^= a[i][j];\\n REP(i,m) REP(j,m+1) a[i+1][j] ^= a[i][j];\\n UnionFindTree uf;\\n uf.init((m+1)*(m+1));\\n REP(i,m+1) REP(j,m+1){\\n if(i<m && a[i][j]==a[i+1][j]) uf.unite(i*(m+1)+j, (i+1)*(m+1)+j);\\n if(j<m && a[i][j]==a[i][j+1]) uf.unite(i*(m+1)+j, i*(m+1)+j+1);\\n }\\n cout << uf.N << endl;\\n return 0;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n // solve();\\n // int T; cin >> T; REP(t,T) solve();\\n while(!solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.0023,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":789,"cells":{"group_id":{"kind":"string","value":"aoj_1344_cpp"},"problem_description":{"kind":"string","value":"Problem J:\nC(O|W|A*RD*|S)* CROSSWORD\nPuzzle\nThe first crossword puzzle was published on December 21, 1913 by Arthur Wynne. To celebrate the centennial of his great-great-grandfather's invention, John \"Coward\" Wynne\n1\nwas struggling to make crossword puzzles. He was such a coward that whenever he thought of a tricky clue for a word, he couldn’t stop worrying if people would blame him for choosing a bad clue that could never mean that word. At the end of the day, he cowardly chose boring clues, which made his puzzles less interesting.\nOne day, he came up with a brilliant idea: puzzles in which word meanings do not matter, and yet interesting. He told his idea to his colleagues, who admitted that the idea was intriguing. They even named his puzzles \"Coward's Crossword Puzzles\" after his nickname.\nHowever, making a Coward's crossword puzzle was not easy. Even though he did not have to think about word meanings, it was not easy to check if a puzzle has one and only one set of answers. As the day of the centennial anniversary was approaching, John started worrying if he would not be able to make interesting ones in time. Let's help John by writing a program that solves Coward's crossword puzzles.\nEach puzzle consists of\nh\n×\nw\ncells along with\nh\nacross clues and\nw\ndown clues. The clues are regular expressions written in a pattern language whose BNF syntax is given as in the table below.\nclue ::= \"^\" pattern \"$\"\npattern ::= simple | pattern \"|\" simple\nsimple ::= basic | simple basic\nbasic ::= elementary | elementary \"*\"\nelementary ::= \".\" | \"A\" | \"B\" | ... | \"Z\" | \"(\" pattern \")\"\nTable J.1. BNF syntax of the pattern language.\nThe clues (as denoted by p and q below) match words (as denoted by s below) according to the\nfollowing rules.\n^\np\n$\nmatches\ns\nif\np\nmatches\ns\n.\np\n|\nq\nmatches a string\ns\nif\np\nand/or\nq\nmatches\ns\n.\npq\nmatches a string\ns\nif there exist\ns\n1\nand\ns\n2\nsuch that\ns\n1\ns\n2\n=\ns\n,\np\nmatches\ns\n1\n, and\nq\nmatches\ns\n2\n.\np\n*\nmatches a string\ns\nif\ns\nis empty, or there exist\ns\n1\nand\ns\n2\nsuch that\ns\n1\ns\n2\n=\ns\n,\np\nmatches\ns\n1\n, and\np\n*\nmatches\ns\n2\n.\nEach of\nA\n,\nB\n, . . . ,\nZ\nmatches the respective letter itself.\n(\np\n)\nmatches\ns\nif\np\nmatches\ns\n.\n.\nis the shorthand of\n(A|B|C|D|E|F|G|H|I|J|K|L|M|N|O|P|Q|R|S|T|U|V|W|X|Y|Z)\n.\nBelow is an example of a Coward’s crossword puzzle with the answers filled in the cells.\nJava Specific:\nSubmitted Java programs may not use classes in the java.util.regex package.\nC++ Specific:\nSubmitted C++ programs may not use the std::regex class.\nInput\nThe input consists of multiple datasets, each of which represents a puzzle given in the following format.\nh\nw\np\n1\np\n2\n...\np\nh\nq\n1\nq\n2\n...\nq\n2\nHere,\nh\nand\nw\nrepresent the vertical and horizontal numbers of cells, respectively, where 2 ≤\nh,w\n≤ 4. The\np\ni\nand\nq\nj\nare the across and down clues for the\ni\n-th row and\nj\n-th column, respectively. Any clue has no more than 512 characters.\nThe last dataset is followed by a line of two zeros. You may assume that there are no more \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1344_5432770","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <algorithm>\n#include <cctype>\n#include <cassert>\n#include <array>\n#include <set>\nusing namespace std;\n\n#define ALL(v) begin(v),end(v)\n\nnamespace{\n\nstruct flags{\n\tusing gtype = unsigned short;\n\tvector<gtype> v;\n\tgtype gen;\n\tvoid init(int sz){\n\t\tv.assign(sz, 0);\n\t\tgen = 1;\n\t}\n\tbool marked(int i){ return v[i] == gen; }\n\tvoid mark(int i){ v[i] = gen; }\n\tvoid reset(){\n\t\t++gen;\n\t\tif(gen == 0){\n\t\t\tmemset(&v[0], 0, v.size() * sizeof(gtype));\n\t\t\tgen = 1;\n\t\t}\n\t}\n};\n\nusing node = array<vector<int>, 27>;\n\nstruct parser{\n\tvector<node> nodes;\n\tconst char *p;\n\tflags fs;\n\tvector<int> res;\n\tvector<int> tmpv[8];\n\tvector<int> cands(string s, int len){\n\t\treverse(ALL(s));\n\t\tp = s.c_str() + 1;\n\t\tnodes.reserve(1100);\n\t\tnodes.emplace_back();\n\t\tint start = pattern(0);\n\t\tassert(*p == '^');\n\t\tfs.init(nodes.size());\n\t\tvector<int> us = {start};\n\t\tdfs(us, 0, len);\n\n\t\treturn res;\n\t}\n\tvoid dfs(vector<int> &us, int bits, int rem){\n\t\tif(us.empty()){ return; }\n\t\taddeps(us);\n\t\tif(rem == 0){\n\t\t\tfor(int u : us){\n\t\t\t\tif(u == 0){\n\t\t\t\t\tres.push_back(bits);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tvector<int> &vs = tmpv[rem];\n\t\tfor(int i = 1; i <= 26; ++i){\n\t\t\tvs.clear();\n\t\t\tfs.reset();\n\t\t\tfor(int u : us){\n\t\t\t\tfor(int v : nodes[u][i]){\n\t\t\t\t\tif(!fs.marked(v)){\n\t\t\t\t\t\tfs.mark(v);\n\t\t\t\t\t\tvs.push_back(v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdfs(vs, bits << 5 | i, rem - 1);\n\t\t}\n\t}\n\tvoid addeps(vector<int> &us){\n\t\tfs.reset();\n\t\tfor(size_t i = 0; i < us.size(); ++i){\n\t\t\tfor(int v : nodes[us[i]][0]){\n\t\t\t\tif(!fs.marked(v)){\n\t\t\t\t\tfs.mark(v);\n\t\t\t\t\tus.push_back(v);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint pattern(int u){\n\t\tconst char *sp = p;\n\t\tint v = simple(u);\n\t\tset<string> dup; // ad-hoc optimization\n\t\tdup.emplace(sp, p);\n\t\twhile(*p == '|'){\n\t\t\t++p;\n\t\t\tsp = p;\n\t\t\tint w = simple(u);\n\t\t\tif(dup.emplace(sp, p).second){\n\t\t\t\tnodes[v][0].push_back(w);\n\t\t\t}\n\t\t}\n\t\treturn v;\n\t}\n\tint simple(int u){\n\t\twhile(1){\n\t\t\tint v = basic(u);\n\t\t\tif(v == -1){ break; }\n\t\t\tu = v;\n\t\t}\n\t\treturn u;\n\t}\n\tint basic(int u){\n\t\tif(*p == '*'){\n\t\t\t++p;\n\t\t\tint v = nodes.size();\n\t\t\tnodes.emplace_back();\n\t\t\tnodes[v][0].push_back(u);\n\t\t\tint w = nodes.size();\n\t\t\tnodes.emplace_back();\n\t\t\tnodes[w][0].push_back(v);\n\t\t\tint x = elementary(v);\n\t\t\tassert(x != -1);\n\t\t\tnodes[v][0].push_back(x);\n\t\t\treturn w;\n\t\t}\n\t\treturn elementary(u);\n\t}\n\tint elementary(int u){\n\t\tif(*p == ')'){\n\t\t\t++p;\n\t\t\tint v = pattern(u);\n\t\t\tassert(*p == '(');\n\t\t\t++p;\n\t\t\treturn v;\n\t\t}\n\t\tif(*p == '.' || isupper(*p)){\n\t\t\tint v = nodes.size();\n\t\t\tnodes.emplace_back();\n\t\t\tif(*p == '.'){\n\t\t\t\tfor(int i = 1; i <= 26; ++i){\n\t\t\t\t\tnodes[v][i].push_back(u);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tnodes[v][*p - 'A' + 1].push_back(u);\n\t\t\t}\n\t\t\t++p;\n\t\t\treturn v;\n\t\t}\n\t\treturn -1;\n\t}\n};\n\nstruct solver{\n\tusing pvii = pair<vector<int>,int>;\n\tvector<pvii> rcs, ccs;\n\tvector<int> rows, cols;\n\tvector<int> ans;\n\tvector<int> tmp;\n\t\n\tbool check(const pvii &v, int b, int und){\n\t\tint q = *lower_bound(ALL(v.first), b);\n\t\treturn q < b + (1 << (und * 5));\n\t}\n\t\n\tvoid dfs(unsigned y, unsigned x){\n\t\tif(x == cols.size()){\n\t\t\tx = 0;\n\t\t\t++y;\n\t\t\tif(y == rows.size()){\n\t\t\t\tif(ans.empty()){\n\t\t\t\t\tans = rows;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthrow 0;\n\t\t\t}\n\t\t}\n\t\tint tmpr = rows[y], tmpc = cols[x];\n\t\tfor(int i = 1; i <= 26; ++i){\n\t\t\tint dx = cols.size() - x - 1;\n\t\t\tint dy = rows.size() - y - 1;\n\t\t\trows[y] |= i << dx* 5;\n\t\t\tcols[x] |= i << dy * 5;\n\t\t\tif(check(rcs[y], rows[y], dx) && check(ccs[x], cols[x], dy)){\n\t\t\t\tdfs(y, x + 1);\n\t\t\t}\n\t\t\trows[y] = tmpr;\n\t\t\tcols[x] = tmpc;\n\t\t}\n\t}\n\t\n\ttemplate <class T>\n\tvector<int> seconds(const vector<T> &v){\n\t\tvector<int> w;\n\t\tfor(const auto &x : v){ w.push_back(x.second); }\n\t\treturn w;\n\t}\n\t\n\tvoid perm(vector<int> &v, const vector<int> &p){\n\t\ttmp.clear();\n\t\ttmp.reserve(v.size() + 1);\n\t\tint n = p.size();\n\t\tfor(int r : v){\n\t\t\tint s = 0;\n\t\t\tfor(int q : p){\n\t\t\t\ts = s << 5 | ((r >> (n - q - 1) * 5) & 31);\n\t\t\t}\n\t\t\ttmp.push_back(s);\n\t\t}\n\t\tsort(ALL(tmp));\n\t\ttmp.push_back(0xfffff);\n\t\tv.swap(tmp);\n\t}\n\t\n\tvoid solve(int h, int w){\n\t\tfor(int i = 0; i < h; ++i){\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\trcs.emplace_back(parser().cands(s, w), i);\n\t\t}\n\t\tfor(int i = 0; i < w; ++i){\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tccs.emplace_back(parser().cands(s, h), i);\n\t\t}\n\n\t\tsort(ALL(rcs), [](const pvii &a, const pvii &b){ return a.first.size() < b.first.size(); });\n\t\tsort(ALL(ccs), [](const pvii &a, const pvii &b){ return a.first.size() < b.first.size(); });\n\t\tvector<int> pr = seconds(rcs), pc = seconds(ccs);\n\n\t\ttry{\n\t\t\tbool inv = rcs[0].first.size() > ccs[0].first.size();\n\t\t\tfor(auto &a : rcs){\n\t\t\t\tperm(a.first, pc);\n\t\t\t}\n\t\t\tfor(auto &a : ccs){\n\t\t\t\tperm(a.first, pr);\n\t\t\t}\n\t\t\trows.assign(h, 0);\n\t\t\tcols.assign(w, 0);\n\t\t\tif(inv){\n\t\t\t\trows.swap(cols);\n\t\t\t\tpr.swap(pc);\n\t\t\t\trcs.swap(ccs);\n\t\t\t}\n\t\t\tdfs(0, 0);\n\t\t\t\n\t\t\tif(ans.empty()){\n\t\t\t\tcout << \"none\\n\";\n\t\t\t}\n\t\t\telse{\n\t\t\t\tvector<string> out(h, string(w, '_'));\n\t\t\t\tfor(size_t i = 0; i < rcs.size(); ++i)\n\t\t\t\tfor(size_t j = 0; j < ccs.size(); ++j){\n\t\t\t\t\tint y = pr[i];\n\t\t\t\t\tint x = pc[j];\n\t\t\t\t\tif(inv){ swap(y, x); }\n\t\t\t\t\tout[y][x] = 'A' - 1 + ((ans[i] >> (ccs.size() - j - 1) * 5) & 31);\n\t\t\t\t}\n\t\t\t\tfor(const string &s : out){\n\t\t\t\t\tcout << s << '\\n';\n\t\t\t\t}\n\t\t\t}\n\t\t}catch(int){\n\t\t\tcout << \"ambiguous\\n\";\n\t\t}\n\t}\n};\n\n}\n\nint main(){\n\tint h, w;\n\tfor(int cnt = 1; cin >> h >> w && h; ++cnt){\n\t\tsolver().solve(h, w);\n//\t\tcerr << cnt << endl;\n\t}\n}","accuracy":1,"time_ms":1800,"memory_kb":22644,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1344_1517635","code_snippet":"// very kuso problem\n\n#include <cassert>// c\n#include <iostream>// io\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <vector>// container\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <algorithm>// other\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\n\n#define ALL(c) c.begin(),c.end()\n#define IN(l,v,r) (l<=v && v < r)\ntemplate<class T> void UNIQUE(T& v){\n\tsort(ALL(v));\n\tv.erase(unique(ALL(v)),v.end());\n}\n\n#define DUMP(x) cerr << #x <<\" = \" << (x)\n#define LINE() cerr<< \" (L\" << __LINE__ << \")\"\n\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\n// struct range{\n// \tstruct Iter{\n// \t\tint v,step;\n// \t\tIter& operator++(){v+=step;return *this;}\n// \t\tbool operator!=(Iter& itr){return v<itr.v;}\n// \t\tint& operator*(){return v;}\n// \t};\n// \tIter i, n;\n// \trange(int i, int n,int step):i({i,step}), n({n,step}){}\n// \trange(int i, int n):range(i,n,1){}\n// \trange(int n):range(0,n){}\n// \tIter& begin(){return i;}\n// \tIter& end(){return n;}\n// };\n\n//input\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\n//output\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\" \"; os<<a;}return os;}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\" \"<<p.second;}\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\" \"<<get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t);}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\" \"; os<<as[i];}return os;}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\n\nstruct Edge{\n\tchar c;int f,t;\n};\n\nclass NFA{\npublic:\n\tstatic NFA ONE;\n\tint N;\n\tvector<Edge> es;\n\tvector<vector<int>> f_cache, t_cache;\n\t\n\tvector<vector<int>> reachable;\n\tvector<vector<vector<int>>> trans;\n\n\tint s,t;\n\tNFA(int N = 0):N(N),s(0),t(1){\n\t\tf_cache = t_cache = vector<vector<int>>(N);\n\t}\n\tvoid add_edge(char c,int f,int t){\n\t\tint eid = es.size();\n\t\tes.push_back({c,f,t});\n\t\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\n\t}\n\tstatic NFA *disjoint(NFA* a,NFA* b){\n\t\t// merge technique\n\t\tNFA *res = (a->es.size() < b->es.size()? b : a),*add = (a->es.size() < b->es.size()? a : b);\n\t\tres->f_cache.resize(res->N + add->N);res->t_cache.resize(res->N + add->N);\n\t\tint eid = res->es.size();\n\t\tfor(Edge& e:add->es){\n\t\t\te.f += res->N; e.t += res->N;\n\t\t\tres->es.push_back(e);\n\t\t\tres->f_cache[e.f].push_back(eid);res->t_cache[e.t].push_back(eid);eid++;\n\t\t}\n\t\tres->N += add->N;\n\t\treturn res;\n\t}\n\tstatic NFA* Union(NFA* a,NFA* b){\n\t\tbool bl = a->es.size() < b->es.size();\n\t\tint as = (bl?b->N:0)+a->s,at = (bl?b->N:0)+a->t,bs = (!bl?a->N:0)+b->s,bt = (!bl?a->N:0)+b->t;\n\t\tint S = a->N+b->N,T = a->N+b->N+1;\n\t\tNFA* ab = disjoint(a,b),*ab1 = disjoint(ab,&ONE),*res = disjoint(ab1,&ONE);\n\t\tres->add_edge('-',S,as); res->add_edge('-',S,bs);res->add_edge('-',at,T); res->add_edge('-',bt,T);\n\t\tres->s = S; res->t = T;\n\t\treturn res;\n\t}\n\tstatic NFA* Concat(NFA* a,NFA* b){\n\t\tbool bl = a->es.size() < b->es.size();\n\t\tint as = (bl?b->N:0)+a->s,at = (bl?b->N:0)+a->t,bs = (!bl?a->N:0)+b->s,bt = (!bl?a->N:0)+b->t;\n\t\tNFA* res = disjoint(a,b);\n\t\tres->add_edge('-',at,bs);\n\t\tres->s = as; res->t = bt;\n\t\treturn res;\n\t}\n\tstatic NFA* Star(NFA* a){\n\t\tNFA* res = disjoint(a,&ONE);\n\t\tres->add_edge('-',res->N-1,a->s); res->add_edge('-',a->t,res->N-1);\n\t\tres->s = res->t = res->N-1;\n\t\treturn res;\n\t}\n\n\t// step\n\tvoid create_reachable(){\n\t\tqueue<pair<int,int>> que; que.push({t,0});\n\n\t\treachable = vector<vector<int>>(N,vector<int>(4));\n\t\treachable[t][0] = true;\n\t\twhile(!que.empty()){\n\t\t\tint t,d;tie(t,d) = que.front();que.pop();\n\t\t\t//back\n\t\t\tfor(int eid:t_cache[t]){\n\t\t\t\tEdge& e = es[eid];\n\t\t\t\tif(e.c=='-'){\n\t\t\t\t\tif(!reachable[e.f][d]){\n\t\t\t\t\t\treachable[e.f][d] = true;\n\t\t\t\t\t\tque.push({e.f,d});\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(d+1 <reachable[e.f].size() && !reachable[e.f][d+1]){\n\t\t\t\t\t\treachable[e.f][d+1] = true;\n\t\t\t\t\t\tque.push({e.f,d+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid create_trans(){\n\t\ttrans = vector<vector<vector<int>>>(N,vector<vector<int>>(27));\n\t\t// eps trans\n\t\trange(st,0,N){\n\t\t\tvector<bool> passed(N);\n\t\t\tpassed[st] = true;\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : f_cache[s])if(es[eid].c =='-' && !passed[es[eid].t]){\n\t\t\t\t\tpassed[es[eid].t] = true;\n\t\t\t\t\tque.push(es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t\trange(i,0,N)if(passed[i]) trans[st][26].push_back(i);\n\t\t}\n\t\trange(st,0,N)range(c,'A','Z'+1){\n\t\t\t// eps trans\n\t\t\tvector<bool> passed(N);\n\t\t\tfor(int s:trans[st][26])passed[s]=true;\n\t\t\tvector<bool> npassed(N);\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : f_cache[s])if((es[eid].c == c || es[eid].c =='.') && !npassed[es[eid].t]){\n\t\t\t\t\tnpassed[es[eid].t] = true;\n\t\t\t\t\tque.push(es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t\t// eps trans\n\t\t\trange(i,0,N)if(npassed[i])for(int s:trans[i][26]) npassed[s] = true;\n\t\t\trange(s,0,npassed.size())if(npassed[s]){\n\t\t\t\tbool alleps = true;\n\t\t\t\tfor(int eid : f_cache[s])alleps &= es[eid].c=='-';\n\t\t\t\t// ???????????? ?? ????§???????????????´?????????????????? for ?????????\n\t\t\t\tif(alleps && t != s)continue; \n\t\t\t\ttrans[st][c-'A'].push_back(s);\n\t\t\t}\n\t\t}\n\t}\n} NFA::ONE = NFA(1);\n\nclass REGtoNFA{\npublic:\n\tstatic NFA* pattern(string& s,int& i,int e){\n\t\tNFA* p = simple(s,i,e);\n\t\twhile(i < e && s[i]=='|'){\n\t\t\ti++;// '|'\n\t\t\tNFA* q = simple(s,i,e);\n\t\t\tp = NFA::Union(p,q);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA* simple(string& s,int& i,int e){\n\t\tNFA* p = basic(s,i,e);\n\t\twhile(i < e && s[i]!='|'){\n\t\t\tNFA* q = basic(s,i,e);\n\t\t\tp = NFA::Concat(p,q);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA* basic(string& s,int& i,int e){\n\t\tNFA* p = elementary(s,i,e);\n\t\tif(i < (int)s.size() && s[i]=='*'){\n\t\t\ti++;// *\n\t\t\tp = NFA::Star(p);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA* elementary(string& s,int& i,int e){\n\t\tNFA* p;\n\t\tif(s[i]=='('){\n\t\t\ti++; // (\n\t\t\tint d=1;\n\t\t\tfor(int j=i;j<e;j++){\n\t\t\t\tif(s[j]=='(') d++;\n\t\t\t\tif(s[j]==')') d--;\n\t\t\t\tif(d==0){\n\t\t\t\t\te = j;break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = pattern(s,i,e);\n\t\t\ti++; // )\n\t\t}else{\n\t\t\tp = new NFA(2);\n\t\t\tp->add_edge(s[i],p->s,p->t);\n\t\t\ti++;// c\n\t\t}\n\t\treturn p;\n\t}\n};\n\n\nint rc = 0;\nclass Main{\n\tpublic:\n\tint h,w;\n\tvector<string> tmp,res;\n\n\tvector<NFA> NFAs;\n\tvector<vector<int>> stats;\n\n\tvoid dfs(int y,int x,int c){\n\t\tif(rc>1)return;\n\t\tif(y==h){\n\t\t\trc+=c; \n\t\t\tres = tmp;\n\t\t\treturn;\n\t\t}\n\t\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\n\t\tvector<vector<vector<int>>> nstats(2,vector<vector<int>>(26));\n\t\tvector<int> nfai={y,h+x};\n\t\trange(ni,0,2)for(char nc = 'A';nc <= 'Z'; nc++){\n\t\t\tfor(int s:stats[nfai[ni]])for(int t:NFAs[nfai[ni]].trans[s][nc-'A']) nstats[ni][nc-'A'].push_back(t);\n\t\t\tUNIQUE(nstats[ni][nc-'A']);\n\t\t}\n\t\tvector<int> gid(26);iota(ALL(gid),0);\n\t\tfor(char c1='A'; c1 <= 'Z';c1++)for(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\n\t\t\tif(nstats[0][c1-'A'].size() == nstats[0][c2-'A'].size() && nstats[1][c1-'A'].size() == nstats[1][c2-'A'].size()){\n\t\t\t\tbool eq = true;\n\t\t\t\trange(ni,0,2){\n\t\t\t\t\trange(i,0,nstats[ni][c1-'A'].size()){\n\t\t\t\t\t\teq &= nstats[ni][c1-'A'][i] == nstats[ni][c2-'A'][i];\n\t\t\t\t\t\tif(!eq)break;\n\t\t\t\t\t}\n\t\t\t\t\tif(!eq)break;\n\t\t\t\t}\n\t\t\t\tif(eq){\n\t\t\t\t\tgid[c1-'A'] = gid[c2-'A'];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int> gc(26);\n\t\trange(i,0,26)gc[gid[i]]++;\n\n\t\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\n\t\t\ttmp[y][x] = c;\n\t\t\tbool tmpOK = true;\n\t\t\t// eda ??????????????? de ikerukana ?\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:nstats[0][c-'A'])ok |= NFAs[y].reachable[s][w-1-x];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:nstats[1][c-'A'])ok |= NFAs[h+x].reachable[s][h-1-y];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(x == w-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:nstats[0][c-'A'])ok |= s == NFAs[y].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(y == h-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:nstats[1][c-'A'])ok |= s == NFAs[h+x].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(tmpOK){\n\t\t\t\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\n\t\t\t\tstats[y] = nstats[0][c-'A']; stats[h+x] = nstats[1][c-'A'];\n\t\t\t\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\n\t\t\t\telse dfs(y+1,0,gc[c-'A']);\n\t\t\t\tstats[y] = tmpp; stats[h + x] = tmpq;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid run(){\n\t\twhile(true){\n\t\t\tcin >> h >> w;\n\t\t\tif(h==0 && w==0)break;\n\t\t\trc = 0;\n\t\t\ttmp = res = vector<string>(h,string(w,'-'));\n\t\t\tvector<string> ss(h+w);cin >> ss;\n \t\t\t// h <= 4, w <= 4\n\t\t\tNFAs = vector<NFA>(h+w);\n\t\t\trange(i,0,h+w){\n\t\t\t\tstring s = \"\";\n\t\t\t\trange(j,1,ss[i].size()-1) s+=ss[i][j];\n\t\t\t\tint cur = 0, e = s.size();\n\t\t\t\tNFAs[i] = *REGtoNFA::pattern(s,cur,e);\n\t\t\t}\n\t\t\trange(i,0,h+w){\n\t\t\t\tNFAs[i].create_reachable();\n\t\t\t\tNFAs[i].create_trans();\n\t\t\t}\n\t\t\tstats = vector<vector<int>>(h+w);\n\t\t\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\n\n\t\t\tdfs(0,0,1);\n\t\t\tif(rc > 1){\n\t\t\t\tcout << \"ambiguous\" <<endl; \n\t\t\t}else if(rc == 0){\n\t\t\t\tcout << \"none\" <<endl;\n\t\t\t}else{\n\t\t\t\trange(i,0,h) cout << res[i] <<endl;\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main(){\n\tcout <<fixed<<setprecision(20);\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tMain().run();\n\treturn 0;\n}","accuracy":1,"time_ms":5620,"memory_kb":41044,"score_of_the_acc":-2,"final_rank":4},{"submission_id":"aoj_1344_1517593","code_snippet":"// very kuso problem\n\n#include <cassert>// c\n#include <iostream>// io\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <vector>// container\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <algorithm>// other\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\n\n#define ALL(c) c.begin(),c.end()\n#define IN(l,v,r) (l<=v && v < r)\ntemplate<class T> void UNIQUE(T& v){\n\tsort(ALL(v));\n\tv.erase(unique(ALL(v)),v.end());\n}\n\n#define DUMP(x) cerr << #x <<\" = \" << (x)\n#define LINE() cerr<< \" (L\" << __LINE__ << \")\"\n\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\n// struct range{\n// \tstruct Iter{\n// \t\tint v,step;\n// \t\tIter& operator++(){v+=step;return *this;}\n// \t\tbool operator!=(Iter& itr){return v<itr.v;}\n// \t\tint& operator*(){return v;}\n// \t};\n// \tIter i, n;\n// \trange(int i, int n,int step):i({i,step}), n({n,step}){}\n// \trange(int i, int n):range(i,n,1){}\n// \trange(int n):range(0,n){}\n// \tIter& begin(){return i;}\n// \tIter& end(){return n;}\n// };\n\n//input\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\n//output\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\" \"; os<<a;}return os;}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\" \"<<p.second;}\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\" \"<<get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t);}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\" \"; os<<as[i];}return os;}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\n\nstruct Edge{\n\tchar c;int f,t;\n};\n\nclass NFA{\npublic:\n\tstatic NFA ONE;\n\tint N;\n\tvector<Edge> es;\n\tvector<vector<int>> f_cache, t_cache;\n\n\tint s,t;\n\tNFA(int N = 0):N(N),s(0),t(1){\n\t\tf_cache = t_cache = vector<vector<int>>(N);\n\t}\n\tvoid add_edge(char c,int f,int t){\n\t\tint eid = es.size();\n\t\tes.push_back({c,f,t});\n\t\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\n\t}\n\tstatic NFA disjoint(NFA& a,NFA& b){\n\t\t// merge technique\n\t\tNFA& res = (a.es.size() < b.es.size()? b : a), add = (a.es.size() < b.es.size()? a : b);\n\t\t\n\t\tres.f_cache.resize(res.N + add.N);res.t_cache.resize(res.N + add.N);\n\t\tint eid = res.es.size();\n\t\tfor(Edge& e:add.es){\n\t\t\te.f += res.N; e.t += res.N;\n\t\t\tres.es.push_back(e);\n\t\t\tres.f_cache[e.f].push_back(eid);res.t_cache[e.t].push_back(eid);eid++;\n\t\t}\n\t\tres.N += add.N;\n\t\treturn res;\n\t}\n\tstatic NFA Union(NFA& a,NFA& b){\n\t\tbool bl = a.es.size() < b.es.size();\n\t\tint as = (bl?b.N:0)+a.s,at = (bl?b.N:0)+a.t,aN = a.N, bs = (!bl?a.N:0)+b.s,bt = (!bl?a.N:0)+b.t, bN = b.N;\n\t\tint S = aN+bN,T = aN+bN+1;\n\t\tNFA ab = disjoint(a,b),ab1 = disjoint(ab,ONE),res = disjoint(ab1,ONE);\n\t\tres.add_edge('-',S,as); res.add_edge('-',S,bs);res.add_edge('-',at,T); res.add_edge('-',bt,T);\n\t\tres.s = S; res.t = T;\n\t\treturn res;\n\t}\n\tstatic NFA Concat(NFA& a,NFA& b){\n\t\tbool bl = a.es.size() < b.es.size();\n\t\tint as = (bl?b.N:0)+a.s,at = (bl?b.N:0)+a.t,aN = a.N, bs = (!bl?a.N:0)+b.s,bt = (!bl?a.N:0)+b.t, bN = b.N;\n\t\tNFA res = disjoint(a,b);\n\t\tres.add_edge('-',at,bs);\n\t\tres.s = as; res.t = bt;\n\t\treturn res;\n\t}\n\tstatic NFA Star(NFA& a){\n\t\tNFA res = disjoint(a,ONE);\n\t\tres.add_edge('-',res.N-1,a.s);\n\t\tres.add_edge('-',a.t,res.N-1);\n\t\tres.s = res.t = res.N-1;\n\t\treturn res;\n\t}\n\n\t// parsing \n\tstatic NFA pattern(string& s,int& i,int e){\n\t\tNFA p = simple(s,i,e);\n\t\twhile(i < e && s[i]=='|'){\n\t\t\ti++;// '|'\n\t\t\tNFA q = simple(s,i,e);\n\t\t\tp = NFA::Union(p,q);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA simple(string& s,int& i,int e){\n\t\tNFA p = basic(s,i,e);\n\t\twhile(i < e && s[i]!='|'){\n\t\t\tNFA q = basic(s,i,e);\n\t\t\tp = NFA::Concat(p,q);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA basic(string& s,int& i,int e){\n\t\tNFA p = elementary(s,i,e);\n\t\tif(i < (int)s.size() && s[i]=='*'){\n\t\t\ti++;// *\n\t\t\tp = NFA::Star(p);\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA elementary(string& s,int& i,int e){\n\t\tNFA p;\n\t\tif(s[i]=='('){\n\t\t\ti++; // (\n\t\t\tint d=1;\n\t\t\tfor(int j=i;j<e;j++){\n\t\t\t\tif(s[j]=='(') d++;\n\t\t\t\tif(s[j]==')') d--;\n\t\t\t\tif(d==0){\n\t\t\t\t\te = j;break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = pattern(s,i,e);\n\t\t\ti++; // )\n\t\t}else{\n\t\t\tp = NFA(2);\n\t\t\tp.add_edge(s[i],p.s,p.t);\n\t\t\ti++;// c\n\t\t}\n\t\treturn p;\n\t}\n} NFA::ONE = NFA(1);\n\nint rc = 0;\nclass Main{\n\tpublic:\n\n\tint h,w;\n\tvector<string> tmp,res;\n\n\tvector<NFA> NFAs;\n\tvector<vector<int>> stats;\n\tvector<vector<vector<int>>> reachable;\n\tvector<vector<vector<vector<int>>>> trans;\n\n\tvoid create_reachable(int nind){\n\t\tNFA& nfa = NFAs[nind];\n\t\tqueue<pair<int,int>> que; que.push({nfa.t,0});\n\t\treachable[nind][nfa.t][0] = true;\n\t\twhile(!que.empty()){\n\t\t\tint t,d;tie(t,d) = que.front();que.pop();\n\t\t\t//back\n\t\t\tfor(int eid:nfa.t_cache[t]){\n\t\t\t\tEdge& e = nfa.es[eid];\n\t\t\t\tif(e.c=='-'){\n\t\t\t\t\tif(!reachable[nind][e.f][d]){\n\t\t\t\t\t\treachable[nind][e.f][d] = true;\n\t\t\t\t\t\tque.push({e.f,d});\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(d+1 <reachable[nind][e.f].size() && !reachable[nind][e.f][d+1]){\n\t\t\t\t\t\treachable[nind][e.f][d+1] = true;\n\t\t\t\t\t\tque.push({e.f,d+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid create_trans(int nind,int st,char nc){\n\t\tNFA& nfa = NFAs[nind];\n\n\t\tvector<bool> passed(nfa.N);\n\t\tpassed[st] = true;\n\t\t// eps trans\n\t\t{\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\n\t\t\t\t\tpassed[nfa.es[eid].t] = true;\n\t\t\t\t\tque.push(nfa.es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// trans\n\t\t{\n\t\t\tvector<bool> npassed(nfa.N);\n\t\t\trange(s,0,nfa.N)if(passed[s]) for(int eid : nfa.f_cache[s]){\n\t\t\t\tchar c = nfa.es[eid].c;\n\t\t\t\tint t = nfa.es[eid].t;\n\t\t\t\tif(nc==c || c=='.') npassed[t] = true;\n\t\t\t}\n\t\t\tpassed = npassed;\n\t\t}\n\n\t\t// eps trans\n\t\t{\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\n\t\t\t\t\tpassed[nfa.es[eid].t] = true;\n\t\t\t\t\tque.push(nfa.es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trange(s,0,passed.size())if(passed[s]){\n\t\t\tbool exeps = false, alleps = true;\n\t\t\tfor(int eid : nfa.f_cache[s]){\n\t\t\t\texeps |= nfa.es[eid].c=='-';\n\t\t\t\talleps &= nfa.es[eid].c=='-';\n\t\t\t}\n\t\t\t// ?? ????§???????????????´?????????????????? for ?????????\n\t\t\tif(exeps && alleps && nfa.t != s)continue; \n\t\t\ttrans[nind][st][nc-'A'].push_back(s);\n\t\t}\n\t}\n\n\tvoid dfs(int y,int x,int c){\n\t\t// cerr << y <<\" \" << x <<endl;\n\t\t// cerr << tmp <<endl;\n\n\t\tif(rc>1)return;\n\t\tif(y==h){\n\t\t\trc+=c;\n\t\t\tres = tmp;\n\t\t\treturn;\n\t\t}\n\n\t\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\n\t\tvector<vector<int>> ynstats(26),xnstats(26);\n\t\tfor(char nc = 'A';nc <= 'Z'; nc++){\n\t\t\tfor(int s:stats[y])for(int t:trans[y][s][nc-'A'])ynstats[nc-'A'].push_back(t);\n\t\t\tUNIQUE(ynstats[nc-'A']);\n\t\t}\n\t\tfor(char nc = 'A';nc <= 'Z'; nc++){\n\t\t\tfor(int s:stats[h+x])for(int t:trans[h+x][s][nc-'A'])xnstats[nc-'A'].push_back(t);\n\t\t\tUNIQUE(xnstats[nc-'A']);\n\t\t}\n\t\tvector<int> gid(26);iota(ALL(gid),0);\n\t\tfor(char c1='A'; c1 <= 'Z';c1++){\n\t\t\tfor(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\n\t\t\t\tif(ynstats[c1-'A'].size() == ynstats[c2-'A'].size() && xnstats[c1-'A'].size() == xnstats[c2-'A'].size()){\n\t\t\t\t\tbool eq = true;\n\t\t\t\t\trange(i,0,ynstats[c1-'A'].size())eq &= ynstats[c1-'A'][i] == ynstats[c2-'A'][i];\n\t\t\t\t\trange(i,0,xnstats[c1-'A'].size())eq &= xnstats[c1-'A'][i] == xnstats[c2-'A'][i];\n\t\t\t\t\tif(eq){\n\t\t\t\t\t\tgid[c1-'A']=gid[c2-'A'];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int> gc(26);\n\t\trange(i,0,26)gc[gid[i]]++;\n\n\t\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\n\t\t\ttmp[y][x] = c;\n\t\t\tbool tmpOK = true;\n\t\t\t// eda ??????????????? de ikerukana ?\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:ynstats[c-'A'])ok |= reachable[y][s][w-1-x];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:xnstats[c-'A'])ok |= reachable[h+x][s][h-1-y];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(x == w-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:ynstats[c-'A'])ok |= s == NFAs[y].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(y == h-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:xnstats[c-'A'])ok |= s == NFAs[h+x].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(tmpOK){\n\t\t\t\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\n\t\t\t\tstats[y] = ynstats[c-'A']; stats[h+x] = xnstats[c-'A'];\n\t\t\t\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\n\t\t\t\telse dfs(y+1,0,gc[c-'A']);\n\t\t\t\tstats[y] = tmpp; stats[h + x] = tmpq;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid run(){\n\t\twhile(true){\n\t\t\tcin >> h >> w;\n\t\t\tif(h==0 && w==0)break;\n\t\t\trc = 0;\n\t\t\ttmp = res = vector<string>(h,string(w,'-'));\n\t\t\tvector<string> ss(h+w);cin >> ss;\n \t\t\t// h <= 4, w <= 4\n\t\t\tNFAs = vector<NFA>(h+w);\n\t\t\trange(i,0,h+w){\n\t\t\t\tstring s = \"\";\n\t\t\t\trange(j,1,ss[i].size()-1)s+=ss[i][j];\n\t\t\t\tint cur = 0, e = s.size();\n\t\t\t\tNFAs[i]= NFA::pattern(s,cur,e);\n\t\t\t}\n\t\t\tstats = vector<vector<int>>(h+w);\n\t\t\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\n\n\t\t\treachable = vector<vector<vector<int>>>(h+w);\n\t\t\trange(i,0,h){\n\t\t\t\treachable[i] = vector<vector<int>>(NFAs[i].N);\n\t\t\t\trange(s,0,NFAs[i].N) reachable[i][s] = vector<int>(h+1);\n\t\t\t}\n\t\t\trange(i,0,w){\n\t\t\t\treachable[h+i] = vector<vector<int>>(NFAs[h+i].N);\n\t\t\t\trange(s,0,NFAs[h+i].N) reachable[h+i][s] = vector<int>(w+1);\n\t\t\t}\n\t\t\trange(i,0,h+w) create_reachable(i);\n\t\t\t\n\t\t\ttrans = vector<vector<vector<vector<int>>>>(h+w);\n\t\t\trange(i,0,h+w){\n\t\t\t\ttrans[i] = vector<vector<vector<int>>>(NFAs[i].N,vector<vector<int>>(26));\n\t\t\t\trange(s,0,NFAs[i].N)range(c,'A','Z'+1)create_trans(i,s,c);\n\t\t\t}\n\n\t\t\t// cerr << NFAs[0].t <<endl;\n\t\t\t// range(i,0,NFAs[0].es.size()){\n\t\t\t// \tcerr << NFAs[0].es[i].c <<\" \" <<NFAs[0].es[i].f <<\" \" <<NFAs[0].es[i].t <<endl;\n\t\t\t// }\n\t\t\t// cerr << NFAs[0].t_cache <<endl;\n\n\t\t\tdfs(0,0,1);\n\t\t\tif(rc > 1){\n\t\t\t\tcout << \"ambiguous\" <<endl; \n\t\t\t}else if(rc == 0){\n\t\t\t\tcout << \"none\" <<endl;\n\t\t\t}else{\n\t\t\t\trange(i,0,h) cout << res[i] <<endl;\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main(){\n\tcout <<fixed<<setprecision(20);\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tMain().run();\n\treturn 0;\n}","accuracy":1,"time_ms":5390,"memory_kb":29680,"score_of_the_acc":-1.3222,"final_rank":3},{"submission_id":"aoj_1344_1514737","code_snippet":"// very kuso problem\n\n#include <cassert>// c\n#include <iostream>// io\n#include <iomanip>\n#include <fstream>\n#include <sstream>\n#include <vector>// container\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <algorithm>// other\n#include <complex>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <regex>\nusing namespace std;\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\n\n#define ALL(c) c.begin(),c.end()\n#define IN(l,v,r) (l<=v && v < r)\ntemplate<class T> void UNIQUE(T& v){\n\tsort(ALL(v));\n\tv.erase(unique(ALL(v)),v.end());\n}\n\n#define DUMP(x) cerr << #x <<\" = \" << (x)\n#define LINE() cerr<< \" (L\" << __LINE__ << \")\"\n\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\n// struct range{\n// \tstruct Iter{\n// \t\tint v,step;\n// \t\tIter& operator++(){v+=step;return *this;}\n// \t\tbool operator!=(Iter& itr){return v<itr.v;}\n// \t\tint& operator*(){return v;}\n// \t};\n// \tIter i, n;\n// \trange(int i, int n,int step):i({i,step}), n({n,step}){}\n// \trange(int i, int n):range(i,n,1){}\n// \trange(int n):range(0,n){}\n// \tIter& begin(){return i;}\n// \tIter& end(){return n;}\n// };\n\n//input\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\n//output\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\" \"; os<<a;}return os;}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\" \"<<p.second;}\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\" \"<<get<1>(t);}\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t);}\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\" \"<<get<1>(t)<<\" \"<<get<2>(t)<<\" \"<<get<3>(t);}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\" \"; os<<as[i];}return os;}\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\n\nstruct Edge{\n\tchar c;int f,t;\n};\n\nclass NFA{\npublic:\n\t// (source)initial state = 0, (target)acc state = 0 or 1\n\tint N;\n\tvector<Edge> es;\n\tvector<vector<int>> f_cache, t_cache;\n\n\tint s,t;\n\tNFA(int N = 0):N(N),s(0),t(1){\n\t\tf_cache = t_cache = vector<vector<int>>(N);\n\t}\n\tvoid add_edge(char c,int f,int t){\n\t\tint eid = es.size();\n\t\tes.push_back({c,f,t});\n\t\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\n\t}\n\tvoid disjoint(NFA& b){\n\t\tf_cache.resize(N+b.N);\n\t\tt_cache.resize(N+b.N);\n\t\tfor(Edge& e:b.es){\n\t\t\te.f+=N; e.t+=N;\n\t\t\tint eid = es.size();\n\t\t\tes.push_back(e);\n\t\t\tf_cache[e.f].push_back(eid); t_cache[e.t].push_back(eid);\n\t\t}\n\t\tN +=b.N;\n\t}\n\tvoid Union(NFA b){\n\t\tint as = s,at = t,aN = N, bs = b.s,bt = b.t, bN = b.N;\n\t\tdisjoint(b);\n\t\tNFA sp = NFA(1);\n\t\tdisjoint(sp);\n\t\tNFA tp = NFA(1);\n\t\tdisjoint(tp);\n\t\tadd_edge('-',aN+bN,as);\n\t\tadd_edge('-',aN+bN,aN + bs);\n\t\tadd_edge('-',at,aN+bN+1);\n\t\tadd_edge('-',aN+bt,aN+bN+1);\n\t\ts = aN+bN; t = aN + bN +1;\n\t}\n\tvoid Concat(NFA b){\n\t\tint as = s,at = t,aN = N, bs = b.s,bt = b.t, bN = b.N;\n\t\tdisjoint(b);\n\t\tadd_edge('-',at,aN + bs);\n\t\ts = as;t = aN + bt;\n\t}\n\tvoid Star(){\n\t\tNFA sp = NFA(1);\n\t\tdisjoint(sp);\n\t\tadd_edge('-',N-1,s);\n\t\tadd_edge('-',t,N-1);\n\t\ts = t = N-1;\n\t}\n\n\t// parsing \n\tstatic NFA pattern(string& s,int& i,int e){\n\t\tNFA p = simple(s,i,e);\n\t\twhile(i < e && s[i]=='|'){\n\t\t\ti++;// '|'\n\t\t\tp.Union(simple(s,i,e));\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA simple(string& s,int& i,int e){\n\t\tNFA p = basic(s,i,e);\n\t\twhile(i < e && s[i]!='|'){\n\t\t\tp.Concat(basic(s,i,e));\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA basic(string& s,int& i,int e){\n\t\tNFA p = elementary(s,i,e);\n\t\tif(i < (int)s.size() && s[i]=='*'){\n\t\t\ti++;// *\n\t\t\tp.Star();\n\t\t}\n\t\treturn p;\n\t}\n\tstatic NFA elementary(string& s,int& i,int e){\n\t\tNFA p;\n\t\tif(s[i]=='('){\n\t\t\ti++; // (\n\t\t\tint d=1;\n\t\t\tfor(int j=i;j<e;j++){\n\t\t\t\tif(s[j]=='(') d++;\n\t\t\t\tif(s[j]==')') d--;\n\t\t\t\tif(d==0){\n\t\t\t\t\te = j;break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = pattern(s,i,e);\n\t\t\ti++; // )\n\t\t}else{\n\t\t\tp = NFA(2);\n\t\t\tp.add_edge(s[i],p.s,p.t);\n\t\t\ti++;// c\n\t\t}\n\t\treturn p;\n\t}\n};\n\n\nint rc = 0;\nclass Main{\n\tpublic:\n\n\tint h,w;\n\tvector<string> tmp,res;\n\n\tvector<NFA> NFAs;\n\tvector<vector<int>> stats;\n\tvector<vector<vector<int>>> reachable;\n\tvector<vector<vector<vector<int>>>> trans;\n\n\tvoid create_reachable(int nind){\n\t\tNFA& nfa = NFAs[nind];\n\t\tqueue<pair<int,int>> que; que.push({nfa.t,0});\n\t\treachable[nind][nfa.t][0] = true;\n\t\twhile(!que.empty()){\n\t\t\tint t,d;tie(t,d) = que.front();que.pop();\n\t\t\t//back\n\t\t\tfor(int eid:nfa.t_cache[t]){\n\t\t\t\tEdge& e = nfa.es[eid];\n\t\t\t\tif(e.c=='-'){\n\t\t\t\t\tif(!reachable[nind][e.f][d]){\n\t\t\t\t\t\treachable[nind][e.f][d] = true;\n\t\t\t\t\t\tque.push({e.f,d});\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(d+1 <reachable[nind][e.f].size() && !reachable[nind][e.f][d+1]){\n\t\t\t\t\t\treachable[nind][e.f][d+1] = true;\n\t\t\t\t\t\tque.push({e.f,d+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid create_trans(int nind,int st,char nc){\n\t\tNFA& nfa = NFAs[nind];\n\n\t\tvector<bool> passed(nfa.N);\n\t\tpassed[st] = true;\n\t\t// eps trans\n\t\t{\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\n\t\t\t\t\tpassed[nfa.es[eid].t] = true;\n\t\t\t\t\tque.push(nfa.es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// trans\n\t\t{\n\t\t\tvector<bool> npassed(nfa.N);\n\t\t\trange(s,0,nfa.N)if(passed[s]) for(int eid : nfa.f_cache[s]){\n\t\t\t\tchar c = nfa.es[eid].c;\n\t\t\t\tint t = nfa.es[eid].t;\n\t\t\t\tif(nc==c || c=='.') npassed[t] = true;\n\t\t\t}\n\t\t\tpassed = npassed;\n\t\t}\n\n\t\t// eps trans\n\t\t{\n\t\t\tqueue<int> que;\n\t\t\trange(i,0,passed.size())if(passed[i])que.push(i);\n\t\t\twhile(!que.empty()){\n\t\t\t\tint s = que.front();que.pop();\n\t\t\t\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\n\t\t\t\t\tpassed[nfa.es[eid].t] = true;\n\t\t\t\t\tque.push(nfa.es[eid].t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\trange(s,0,passed.size())if(passed[s]){\n\t\t\tbool exeps = false, alleps = true;\n\t\t\tfor(int eid : nfa.f_cache[s]){\n\t\t\t\texeps |= nfa.es[eid].c=='-';\n\t\t\t\talleps &= nfa.es[eid].c=='-';\n\t\t\t}\n\t\t\t// ?? ????§???????????????´?????????????????? for ?????????\n\t\t\tif(exeps && alleps && nfa.t != s)continue; \n\t\t\ttrans[nind][st][nc-'A'].push_back(s);\n\t\t}\n\t}\n\n\tvoid dfs(int y,int x,int c){\n\t\t// cerr << y <<\" \" << x <<endl;\n\t\t// cerr << tmp <<endl;\n\n\t\tif(rc>1)return;\n\t\tif(y==h){\n\t\t\trc+=c;\n\t\t\tres = tmp;\n\t\t\treturn;\n\t\t}\n\n\t\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\n\t\tvector<vector<int>> ynstats(26),xnstats(26);\n\t\tfor(char nc = 'A';nc <= 'Z'; nc++){\n\t\t\tfor(int s:stats[y])for(int t:trans[y][s][nc-'A'])ynstats[nc-'A'].push_back(t);\n\t\t\tUNIQUE(ynstats[nc-'A']);\n\t\t}\n\t\tfor(char nc = 'A';nc <= 'Z'; nc++){\n\t\t\tfor(int s:stats[h+x])for(int t:trans[h+x][s][nc-'A'])xnstats[nc-'A'].push_back(t);\n\t\t\tUNIQUE(xnstats[nc-'A']);\n\t\t}\n\t\tvector<int> gid(26);iota(ALL(gid),0);\n\t\tfor(char c1='A'; c1 <= 'Z';c1++){\n\t\t\tfor(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\n\t\t\t\tif(ynstats[c1-'A'].size() == ynstats[c2-'A'].size() && xnstats[c1-'A'].size() == xnstats[c2-'A'].size()){\n\t\t\t\t\tbool eq = true;\n\t\t\t\t\trange(i,0,ynstats[c1-'A'].size())eq &= ynstats[c1-'A'][i] == ynstats[c2-'A'][i];\n\t\t\t\t\trange(i,0,xnstats[c1-'A'].size())eq &= xnstats[c1-'A'][i] == xnstats[c2-'A'][i];\n\t\t\t\t\tif(eq){\n\t\t\t\t\t\tgid[c1-'A']=gid[c2-'A'];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<int> gc(26);\n\t\trange(i,0,26)gc[gid[i]]++;\n\n\t\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\n\t\t\ttmp[y][x] = c;\n\t\t\tbool tmpOK = true;\n\t\t\t// eda ??????????????? de ikerukana ?\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:ynstats[c-'A'])ok |= reachable[y][s][w-1-x];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\t{\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:xnstats[c-'A'])ok |= reachable[h+x][s][h-1-y];\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(x == w-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:ynstats[c-'A'])ok |= s == NFAs[y].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(y == h-1){\n\t\t\t\tbool ok = false;\n\t\t\t\tfor(int s:xnstats[c-'A'])ok |= s == NFAs[h+x].t;\n\t\t\t\ttmpOK &= ok;\n\t\t\t}\n\t\t\tif(tmpOK){\n\t\t\t\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\n\t\t\t\tstats[y] = ynstats[c-'A']; stats[h+x] = xnstats[c-'A'];\n\t\t\t\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\n\t\t\t\telse dfs(y+1,0,gc[c-'A']);\n\t\t\t\tstats[y] = tmpp; stats[h + x] = tmpq;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid run(){\n\t\twhile(true){\n\t\t\tcin >> h >> w;\n\t\t\tif(h==0 && w==0)break;\n\t\t\trc = 0;\n\t\t\ttmp = res = vector<string>(h,string(w,'-'));\n\t\t\tvector<string> ss(h+w);cin >> ss;\n \t\t\t// h <= 4, w <= 4\n\t\t\tNFAs = vector<NFA>(h+w);\n\t\t\trange(i,0,h+w){\n\t\t\t\tstring s = \"\";\n\t\t\t\trange(j,1,ss[i].size()-1)s+=ss[i][j];\n\t\t\t\tint cur = 0, e = s.size();\n\t\t\t\tNFAs[i]= NFA::pattern(s,cur,e);\n\t\t\t}\n\t\t\tstats = vector<vector<int>>(h+w);\n\t\t\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\n\n\t\t\treachable = vector<vector<vector<int>>>(h+w);\n\t\t\trange(i,0,h){\n\t\t\t\treachable[i] = vector<vector<int>>(NFAs[i].N);\n\t\t\t\trange(s,0,NFAs[i].N) reachable[i][s] = vector<int>(h+1);\n\t\t\t}\n\t\t\trange(i,0,w){\n\t\t\t\treachable[h+i] = vector<vector<int>>(NFAs[h+i].N);\n\t\t\t\trange(s,0,NFAs[h+i].N) reachable[h+i][s] = vector<int>(w+1);\n\t\t\t}\n\t\t\trange(i,0,h+w) create_reachable(i);\n\t\t\t\n\t\t\ttrans = vector<vector<vector<vector<int>>>>(h+w);\n\t\t\trange(i,0,h+w){\n\t\t\t\ttrans[i] = vector<vector<vector<int>>>(NFAs[i].N,vector<vector<int>>(26));\n\t\t\t\trange(s,0,NFAs[i].N)range(c,'A','Z'+1)create_trans(i,s,c);\n\t\t\t}\n\n\t\t\t// cerr << NFAs[0].t <<endl;\n\t\t\t// range(i,0,NFAs[0].es.size()){\n\t\t\t// \tcerr << NFAs[0].es[i].c <<\" \" <<NFAs[0].es[i].f <<\" \" <<NFAs[0].es[i].t <<endl;\n\t\t\t// }\n\t\t\t// cerr << NFAs[0].t_cache <<endl;\n\t\t\t\n\t\t\tdfs(0,0,1);\n\t\t\tif(rc > 1){\n\t\t\t\tcout << \"ambiguous\" <<endl; \n\t\t\t}else if(rc == 0){\n\t\t\t\tcout << \"none\" <<endl;\n\t\t\t}else{\n\t\t\t\trange(i,0,h) cout << res[i] <<endl;\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main(){\n\tcout <<fixed<<setprecision(20);\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tMain().run();\n\treturn 0;\n}","accuracy":1,"time_ms":5100,"memory_kb":29868,"score_of_the_acc":-1.2565,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1344_5432770\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <cstring>\\n#include <algorithm>\\n#include <cctype>\\n#include <cassert>\\n#include <array>\\n#include <set>\\nusing namespace std;\\n\\n#define ALL(v) begin(v),end(v)\\n\\nnamespace{\\n\\nstruct flags{\\n\\tusing gtype = unsigned short;\\n\\tvector<gtype> v;\\n\\tgtype gen;\\n\\tvoid init(int sz){\\n\\t\\tv.assign(sz, 0);\\n\\t\\tgen = 1;\\n\\t}\\n\\tbool marked(int i){ return v[i] == gen; }\\n\\tvoid mark(int i){ v[i] = gen; }\\n\\tvoid reset(){\\n\\t\\t++gen;\\n\\t\\tif(gen == 0){\\n\\t\\t\\tmemset(&v[0], 0, v.size() * sizeof(gtype));\\n\\t\\t\\tgen = 1;\\n\\t\\t}\\n\\t}\\n};\\n\\nusing node = array<vector<int>, 27>;\\n\\nstruct parser{\\n\\tvector<node> nodes;\\n\\tconst char *p;\\n\\tflags fs;\\n\\tvector<int> res;\\n\\tvector<int> tmpv[8];\\n\\tvector<int> cands(string s, int len){\\n\\t\\treverse(ALL(s));\\n\\t\\tp = s.c_str() + 1;\\n\\t\\tnodes.reserve(1100);\\n\\t\\tnodes.emplace_back();\\n\\t\\tint start = pattern(0);\\n\\t\\tassert(*p == '^');\\n\\t\\tfs.init(nodes.size());\\n\\t\\tvector<int> us = {start};\\n\\t\\tdfs(us, 0, len);\\n\\n\\t\\treturn res;\\n\\t}\\n\\tvoid dfs(vector<int> &us, int bits, int rem){\\n\\t\\tif(us.empty()){ return; }\\n\\t\\taddeps(us);\\n\\t\\tif(rem == 0){\\n\\t\\t\\tfor(int u : us){\\n\\t\\t\\t\\tif(u == 0){\\n\\t\\t\\t\\t\\tres.push_back(bits);\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tvector<int> &vs = tmpv[rem];\\n\\t\\tfor(int i = 1; i <= 26; ++i){\\n\\t\\t\\tvs.clear();\\n\\t\\t\\tfs.reset();\\n\\t\\t\\tfor(int u : us){\\n\\t\\t\\t\\tfor(int v : nodes[u][i]){\\n\\t\\t\\t\\t\\tif(!fs.marked(v)){\\n\\t\\t\\t\\t\\t\\tfs.mark(v);\\n\\t\\t\\t\\t\\t\\tvs.push_back(v);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdfs(vs, bits << 5 | i, rem - 1);\\n\\t\\t}\\n\\t}\\n\\tvoid addeps(vector<int> &us){\\n\\t\\tfs.reset();\\n\\t\\tfor(size_t i = 0; i < us.size(); ++i){\\n\\t\\t\\tfor(int v : nodes[us[i]][0]){\\n\\t\\t\\t\\tif(!fs.marked(v)){\\n\\t\\t\\t\\t\\tfs.mark(v);\\n\\t\\t\\t\\t\\tus.push_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint pattern(int u){\\n\\t\\tconst char *sp = p;\\n\\t\\tint v = simple(u);\\n\\t\\tset<string> dup; // ad-hoc optimization\\n\\t\\tdup.emplace(sp, p);\\n\\t\\twhile(*p == '|'){\\n\\t\\t\\t++p;\\n\\t\\t\\tsp = p;\\n\\t\\t\\tint w = simple(u);\\n\\t\\t\\tif(dup.emplace(sp, p).second){\\n\\t\\t\\t\\tnodes[v][0].push_back(w);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn v;\\n\\t}\\n\\tint simple(int u){\\n\\t\\twhile(1){\\n\\t\\t\\tint v = basic(u);\\n\\t\\t\\tif(v == -1){ break; }\\n\\t\\t\\tu = v;\\n\\t\\t}\\n\\t\\treturn u;\\n\\t}\\n\\tint basic(int u){\\n\\t\\tif(*p == '*'){\\n\\t\\t\\t++p;\\n\\t\\t\\tint v = nodes.size();\\n\\t\\t\\tnodes.emplace_back();\\n\\t\\t\\tnodes[v][0].push_back(u);\\n\\t\\t\\tint w = nodes.size();\\n\\t\\t\\tnodes.emplace_back();\\n\\t\\t\\tnodes[w][0].push_back(v);\\n\\t\\t\\tint x = elementary(v);\\n\\t\\t\\tassert(x != -1);\\n\\t\\t\\tnodes[v][0].push_back(x);\\n\\t\\t\\treturn w;\\n\\t\\t}\\n\\t\\treturn elementary(u);\\n\\t}\\n\\tint elementary(int u){\\n\\t\\tif(*p == ')'){\\n\\t\\t\\t++p;\\n\\t\\t\\tint v = pattern(u);\\n\\t\\t\\tassert(*p == '(');\\n\\t\\t\\t++p;\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t\\tif(*p == '.' || isupper(*p)){\\n\\t\\t\\tint v = nodes.size();\\n\\t\\t\\tnodes.emplace_back();\\n\\t\\t\\tif(*p == '.'){\\n\\t\\t\\t\\tfor(int i = 1; i <= 26; ++i){\\n\\t\\t\\t\\t\\tnodes[v][i].push_back(u);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tnodes[v][*p - 'A' + 1].push_back(u);\\n\\t\\t\\t}\\n\\t\\t\\t++p;\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\\n};\\n\\nstruct solver{\\n\\tusing pvii = pair<vector<int>,int>;\\n\\tvector<pvii> rcs, ccs;\\n\\tvector<int> rows, cols;\\n\\tvector<int> ans;\\n\\tvector<int> tmp;\\n\\t\\n\\tbool check(const pvii &v, int b, int und){\\n\\t\\tint q = *lower_bound(ALL(v.first), b);\\n\\t\\treturn q < b + (1 << (und * 5));\\n\\t}\\n\\t\\n\\tvoid dfs(unsigned y, unsigned x){\\n\\t\\tif(x == cols.size()){\\n\\t\\t\\tx = 0;\\n\\t\\t\\t++y;\\n\\t\\t\\tif(y == rows.size()){\\n\\t\\t\\t\\tif(ans.empty()){\\n\\t\\t\\t\\t\\tans = rows;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tthrow 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint tmpr = rows[y], tmpc = cols[x];\\n\\t\\tfor(int i = 1; i <= 26; ++i){\\n\\t\\t\\tint dx = cols.size() - x - 1;\\n\\t\\t\\tint dy = rows.size() - y - 1;\\n\\t\\t\\trows[y] |= i << dx* 5;\\n\\t\\t\\tcols[x] |= i << dy * 5;\\n\\t\\t\\tif(check(rcs[y], rows[y], dx) && check(ccs[x], cols[x], dy)){\\n\\t\\t\\t\\tdfs(y, x + 1);\\n\\t\\t\\t}\\n\\t\\t\\trows[y] = tmpr;\\n\\t\\t\\tcols[x] = tmpc;\\n\\t\\t}\\n\\t}\\n\\t\\n\\ttemplate <class T>\\n\\tvector<int> seconds(const vector<T> &v){\\n\\t\\tvector<int> w;\\n\\t\\tfor(const auto &x : v){ w.push_back(x.second); }\\n\\t\\treturn w;\\n\\t}\\n\\t\\n\\tvoid perm(vector<int> &v, const vector<int> &p){\\n\\t\\ttmp.clear();\\n\\t\\ttmp.reserve(v.size() + 1);\\n\\t\\tint n = p.size();\\n\\t\\tfor(int r : v){\\n\\t\\t\\tint s = 0;\\n\\t\\t\\tfor(int q : p){\\n\\t\\t\\t\\ts = s << 5 | ((r >> (n - q - 1) * 5) & 31);\\n\\t\\t\\t}\\n\\t\\t\\ttmp.push_back(s);\\n\\t\\t}\\n\\t\\tsort(ALL(tmp));\\n\\t\\ttmp.push_back(0xfffff);\\n\\t\\tv.swap(tmp);\\n\\t}\\n\\t\\n\\tvoid solve(int h, int w){\\n\\t\\tfor(int i = 0; i < h; ++i){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> s;\\n\\t\\t\\trcs.emplace_back(parser().cands(s, w), i);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < w; ++i){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin >> s;\\n\\t\\t\\tccs.emplace_back(parser().cands(s, h), i);\\n\\t\\t}\\n\\n\\t\\tsort(ALL(rcs), [](const pvii &a, const pvii &b){ return a.first.size() < b.first.size(); });\\n\\t\\tsort(ALL(ccs), [](const pvii &a, const pvii &b){ return a.first.size() < b.first.size(); });\\n\\t\\tvector<int> pr = seconds(rcs), pc = seconds(ccs);\\n\\n\\t\\ttry{\\n\\t\\t\\tbool inv = rcs[0].first.size() > ccs[0].first.size();\\n\\t\\t\\tfor(auto &a : rcs){\\n\\t\\t\\t\\tperm(a.first, pc);\\n\\t\\t\\t}\\n\\t\\t\\tfor(auto &a : ccs){\\n\\t\\t\\t\\tperm(a.first, pr);\\n\\t\\t\\t}\\n\\t\\t\\trows.assign(h, 0);\\n\\t\\t\\tcols.assign(w, 0);\\n\\t\\t\\tif(inv){\\n\\t\\t\\t\\trows.swap(cols);\\n\\t\\t\\t\\tpr.swap(pc);\\n\\t\\t\\t\\trcs.swap(ccs);\\n\\t\\t\\t}\\n\\t\\t\\tdfs(0, 0);\\n\\t\\t\\t\\n\\t\\t\\tif(ans.empty()){\\n\\t\\t\\t\\tcout << \\\"none\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tvector<string> out(h, string(w, '_'));\\n\\t\\t\\t\\tfor(size_t i = 0; i < rcs.size(); ++i)\\n\\t\\t\\t\\tfor(size_t j = 0; j < ccs.size(); ++j){\\n\\t\\t\\t\\t\\tint y = pr[i];\\n\\t\\t\\t\\t\\tint x = pc[j];\\n\\t\\t\\t\\t\\tif(inv){ swap(y, x); }\\n\\t\\t\\t\\t\\tout[y][x] = 'A' - 1 + ((ans[i] >> (ccs.size() - j - 1) * 5) & 31);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(const string &s : out){\\n\\t\\t\\t\\t\\tcout << s << '\\\\n';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}catch(int){\\n\\t\\t\\tcout << \\\"ambiguous\\\\n\\\";\\n\\t\\t}\\n\\t}\\n};\\n\\n}\\n\\nint main(){\\n\\tint h, w;\\n\\tfor(int cnt = 1; cin >> h >> w && h; ++cnt){\\n\\t\\tsolver().solve(h, w);\\n//\\t\\tcerr << cnt << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 22644,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1344_1517635\",\n \"code_snippet\": \"// very kuso problem\\n\\n#include <cassert>// c\\n#include <iostream>// io\\n#include <iomanip>\\n#include <fstream>\\n#include <sstream>\\n#include <vector>// container\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <algorithm>// other\\n#include <complex>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <regex>\\nusing namespace std;\\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\\n\\n#define ALL(c) c.begin(),c.end()\\n#define IN(l,v,r) (l<=v && v < r)\\ntemplate<class T> void UNIQUE(T& v){\\n\\tsort(ALL(v));\\n\\tv.erase(unique(ALL(v)),v.end());\\n}\\n\\n#define DUMP(x) cerr << #x <<\\\" = \\\" << (x)\\n#define LINE() cerr<< \\\" (L\\\" << __LINE__ << \\\")\\\"\\n\\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\\n// struct range{\\n// \\tstruct Iter{\\n// \\t\\tint v,step;\\n// \\t\\tIter& operator++(){v+=step;return *this;}\\n// \\t\\tbool operator!=(Iter& itr){return v<itr.v;}\\n// \\t\\tint& operator*(){return v;}\\n// \\t};\\n// \\tIter i, n;\\n// \\trange(int i, int n,int step):i({i,step}), n({n,step}){}\\n// \\trange(int i, int n):range(i,n,1){}\\n// \\trange(int n):range(0,n){}\\n// \\tIter& begin(){return i;}\\n// \\tIter& end(){return n;}\\n// };\\n\\n//input\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\\n//output\\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\\\" \\\"; os<<a;}return os;}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\\\" \\\"<<p.second;}\\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t)<<\\\" \\\"<<get<3>(t);}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\\\" \\\"; os<<as[i];}return os;}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\\n\\nstruct Edge{\\n\\tchar c;int f,t;\\n};\\n\\nclass NFA{\\npublic:\\n\\tstatic NFA ONE;\\n\\tint N;\\n\\tvector<Edge> es;\\n\\tvector<vector<int>> f_cache, t_cache;\\n\\t\\n\\tvector<vector<int>> reachable;\\n\\tvector<vector<vector<int>>> trans;\\n\\n\\tint s,t;\\n\\tNFA(int N = 0):N(N),s(0),t(1){\\n\\t\\tf_cache = t_cache = vector<vector<int>>(N);\\n\\t}\\n\\tvoid add_edge(char c,int f,int t){\\n\\t\\tint eid = es.size();\\n\\t\\tes.push_back({c,f,t});\\n\\t\\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\\n\\t}\\n\\tstatic NFA *disjoint(NFA* a,NFA* b){\\n\\t\\t// merge technique\\n\\t\\tNFA *res = (a->es.size() < b->es.size()? b : a),*add = (a->es.size() < b->es.size()? a : b);\\n\\t\\tres->f_cache.resize(res->N + add->N);res->t_cache.resize(res->N + add->N);\\n\\t\\tint eid = res->es.size();\\n\\t\\tfor(Edge& e:add->es){\\n\\t\\t\\te.f += res->N; e.t += res->N;\\n\\t\\t\\tres->es.push_back(e);\\n\\t\\t\\tres->f_cache[e.f].push_back(eid);res->t_cache[e.t].push_back(eid);eid++;\\n\\t\\t}\\n\\t\\tres->N += add->N;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA* Union(NFA* a,NFA* b){\\n\\t\\tbool bl = a->es.size() < b->es.size();\\n\\t\\tint as = (bl?b->N:0)+a->s,at = (bl?b->N:0)+a->t,bs = (!bl?a->N:0)+b->s,bt = (!bl?a->N:0)+b->t;\\n\\t\\tint S = a->N+b->N,T = a->N+b->N+1;\\n\\t\\tNFA* ab = disjoint(a,b),*ab1 = disjoint(ab,&ONE),*res = disjoint(ab1,&ONE);\\n\\t\\tres->add_edge('-',S,as); res->add_edge('-',S,bs);res->add_edge('-',at,T); res->add_edge('-',bt,T);\\n\\t\\tres->s = S; res->t = T;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA* Concat(NFA* a,NFA* b){\\n\\t\\tbool bl = a->es.size() < b->es.size();\\n\\t\\tint as = (bl?b->N:0)+a->s,at = (bl?b->N:0)+a->t,bs = (!bl?a->N:0)+b->s,bt = (!bl?a->N:0)+b->t;\\n\\t\\tNFA* res = disjoint(a,b);\\n\\t\\tres->add_edge('-',at,bs);\\n\\t\\tres->s = as; res->t = bt;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA* Star(NFA* a){\\n\\t\\tNFA* res = disjoint(a,&ONE);\\n\\t\\tres->add_edge('-',res->N-1,a->s); res->add_edge('-',a->t,res->N-1);\\n\\t\\tres->s = res->t = res->N-1;\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// step\\n\\tvoid create_reachable(){\\n\\t\\tqueue<pair<int,int>> que; que.push({t,0});\\n\\n\\t\\treachable = vector<vector<int>>(N,vector<int>(4));\\n\\t\\treachable[t][0] = true;\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint t,d;tie(t,d) = que.front();que.pop();\\n\\t\\t\\t//back\\n\\t\\t\\tfor(int eid:t_cache[t]){\\n\\t\\t\\t\\tEdge& e = es[eid];\\n\\t\\t\\t\\tif(e.c=='-'){\\n\\t\\t\\t\\t\\tif(!reachable[e.f][d]){\\n\\t\\t\\t\\t\\t\\treachable[e.f][d] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(d+1 <reachable[e.f].size() && !reachable[e.f][d+1]){\\n\\t\\t\\t\\t\\t\\treachable[e.f][d+1] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d+1});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid create_trans(){\\n\\t\\ttrans = vector<vector<vector<int>>>(N,vector<vector<int>>(27));\\n\\t\\t// eps trans\\n\\t\\trange(st,0,N){\\n\\t\\t\\tvector<bool> passed(N);\\n\\t\\t\\tpassed[st] = true;\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : f_cache[s])if(es[eid].c =='-' && !passed[es[eid].t]){\\n\\t\\t\\t\\t\\tpassed[es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,N)if(passed[i]) trans[st][26].push_back(i);\\n\\t\\t}\\n\\t\\trange(st,0,N)range(c,'A','Z'+1){\\n\\t\\t\\t// eps trans\\n\\t\\t\\tvector<bool> passed(N);\\n\\t\\t\\tfor(int s:trans[st][26])passed[s]=true;\\n\\t\\t\\tvector<bool> npassed(N);\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : f_cache[s])if((es[eid].c == c || es[eid].c =='.') && !npassed[es[eid].t]){\\n\\t\\t\\t\\t\\tnpassed[es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// eps trans\\n\\t\\t\\trange(i,0,N)if(npassed[i])for(int s:trans[i][26]) npassed[s] = true;\\n\\t\\t\\trange(s,0,npassed.size())if(npassed[s]){\\n\\t\\t\\t\\tbool alleps = true;\\n\\t\\t\\t\\tfor(int eid : f_cache[s])alleps &= es[eid].c=='-';\\n\\t\\t\\t\\t// ???????????? ?? ????§???????????????´?????????????????? for ?????????\\n\\t\\t\\t\\tif(alleps && t != s)continue; \\n\\t\\t\\t\\ttrans[st][c-'A'].push_back(s);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n} NFA::ONE = NFA(1);\\n\\nclass REGtoNFA{\\npublic:\\n\\tstatic NFA* pattern(string& s,int& i,int e){\\n\\t\\tNFA* p = simple(s,i,e);\\n\\t\\twhile(i < e && s[i]=='|'){\\n\\t\\t\\ti++;// '|'\\n\\t\\t\\tNFA* q = simple(s,i,e);\\n\\t\\t\\tp = NFA::Union(p,q);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA* simple(string& s,int& i,int e){\\n\\t\\tNFA* p = basic(s,i,e);\\n\\t\\twhile(i < e && s[i]!='|'){\\n\\t\\t\\tNFA* q = basic(s,i,e);\\n\\t\\t\\tp = NFA::Concat(p,q);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA* basic(string& s,int& i,int e){\\n\\t\\tNFA* p = elementary(s,i,e);\\n\\t\\tif(i < (int)s.size() && s[i]=='*'){\\n\\t\\t\\ti++;// *\\n\\t\\t\\tp = NFA::Star(p);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA* elementary(string& s,int& i,int e){\\n\\t\\tNFA* p;\\n\\t\\tif(s[i]=='('){\\n\\t\\t\\ti++; // (\\n\\t\\t\\tint d=1;\\n\\t\\t\\tfor(int j=i;j<e;j++){\\n\\t\\t\\t\\tif(s[j]=='(') d++;\\n\\t\\t\\t\\tif(s[j]==')') d--;\\n\\t\\t\\t\\tif(d==0){\\n\\t\\t\\t\\t\\te = j;break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp = pattern(s,i,e);\\n\\t\\t\\ti++; // )\\n\\t\\t}else{\\n\\t\\t\\tp = new NFA(2);\\n\\t\\t\\tp->add_edge(s[i],p->s,p->t);\\n\\t\\t\\ti++;// c\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n};\\n\\n\\nint rc = 0;\\nclass Main{\\n\\tpublic:\\n\\tint h,w;\\n\\tvector<string> tmp,res;\\n\\n\\tvector<NFA> NFAs;\\n\\tvector<vector<int>> stats;\\n\\n\\tvoid dfs(int y,int x,int c){\\n\\t\\tif(rc>1)return;\\n\\t\\tif(y==h){\\n\\t\\t\\trc+=c; \\n\\t\\t\\tres = tmp;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\\n\\t\\tvector<vector<vector<int>>> nstats(2,vector<vector<int>>(26));\\n\\t\\tvector<int> nfai={y,h+x};\\n\\t\\trange(ni,0,2)for(char nc = 'A';nc <= 'Z'; nc++){\\n\\t\\t\\tfor(int s:stats[nfai[ni]])for(int t:NFAs[nfai[ni]].trans[s][nc-'A']) nstats[ni][nc-'A'].push_back(t);\\n\\t\\t\\tUNIQUE(nstats[ni][nc-'A']);\\n\\t\\t}\\n\\t\\tvector<int> gid(26);iota(ALL(gid),0);\\n\\t\\tfor(char c1='A'; c1 <= 'Z';c1++)for(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\\n\\t\\t\\tif(nstats[0][c1-'A'].size() == nstats[0][c2-'A'].size() && nstats[1][c1-'A'].size() == nstats[1][c2-'A'].size()){\\n\\t\\t\\t\\tbool eq = true;\\n\\t\\t\\t\\trange(ni,0,2){\\n\\t\\t\\t\\t\\trange(i,0,nstats[ni][c1-'A'].size()){\\n\\t\\t\\t\\t\\t\\teq &= nstats[ni][c1-'A'][i] == nstats[ni][c2-'A'][i];\\n\\t\\t\\t\\t\\t\\tif(!eq)break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(!eq)break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(eq){\\n\\t\\t\\t\\t\\tgid[c1-'A'] = gid[c2-'A'];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int> gc(26);\\n\\t\\trange(i,0,26)gc[gid[i]]++;\\n\\n\\t\\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\\n\\t\\t\\ttmp[y][x] = c;\\n\\t\\t\\tbool tmpOK = true;\\n\\t\\t\\t// eda ??????????????? de ikerukana ?\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:nstats[0][c-'A'])ok |= NFAs[y].reachable[s][w-1-x];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:nstats[1][c-'A'])ok |= NFAs[h+x].reachable[s][h-1-y];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(x == w-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:nstats[0][c-'A'])ok |= s == NFAs[y].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(y == h-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:nstats[1][c-'A'])ok |= s == NFAs[h+x].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmpOK){\\n\\t\\t\\t\\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\\n\\t\\t\\t\\tstats[y] = nstats[0][c-'A']; stats[h+x] = nstats[1][c-'A'];\\n\\t\\t\\t\\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\\n\\t\\t\\t\\telse dfs(y+1,0,gc[c-'A']);\\n\\t\\t\\t\\tstats[y] = tmpp; stats[h + x] = tmpq;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid run(){\\n\\t\\twhile(true){\\n\\t\\t\\tcin >> h >> w;\\n\\t\\t\\tif(h==0 && w==0)break;\\n\\t\\t\\trc = 0;\\n\\t\\t\\ttmp = res = vector<string>(h,string(w,'-'));\\n\\t\\t\\tvector<string> ss(h+w);cin >> ss;\\n \\t\\t\\t// h <= 4, w <= 4\\n\\t\\t\\tNFAs = vector<NFA>(h+w);\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\tstring s = \\\"\\\";\\n\\t\\t\\t\\trange(j,1,ss[i].size()-1) s+=ss[i][j];\\n\\t\\t\\t\\tint cur = 0, e = s.size();\\n\\t\\t\\t\\tNFAs[i] = *REGtoNFA::pattern(s,cur,e);\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\tNFAs[i].create_reachable();\\n\\t\\t\\t\\tNFAs[i].create_trans();\\n\\t\\t\\t}\\n\\t\\t\\tstats = vector<vector<int>>(h+w);\\n\\t\\t\\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\\n\\n\\t\\t\\tdfs(0,0,1);\\n\\t\\t\\tif(rc > 1){\\n\\t\\t\\t\\tcout << \\\"ambiguous\\\" <<endl; \\n\\t\\t\\t}else if(rc == 0){\\n\\t\\t\\t\\tcout << \\\"none\\\" <<endl;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\trange(i,0,h) cout << res[i] <<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nint main(){\\n\\tcout <<fixed<<setprecision(20);\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tMain().run();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5620,\n \"memory_kb\": 41044,\n \"score_of_the_acc\": -2,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1344_1517593\",\n \"code_snippet\": \"// very kuso problem\\n\\n#include <cassert>// c\\n#include <iostream>// io\\n#include <iomanip>\\n#include <fstream>\\n#include <sstream>\\n#include <vector>// container\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <algorithm>// other\\n#include <complex>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <regex>\\nusing namespace std;\\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\\n\\n#define ALL(c) c.begin(),c.end()\\n#define IN(l,v,r) (l<=v && v < r)\\ntemplate<class T> void UNIQUE(T& v){\\n\\tsort(ALL(v));\\n\\tv.erase(unique(ALL(v)),v.end());\\n}\\n\\n#define DUMP(x) cerr << #x <<\\\" = \\\" << (x)\\n#define LINE() cerr<< \\\" (L\\\" << __LINE__ << \\\")\\\"\\n\\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\\n// struct range{\\n// \\tstruct Iter{\\n// \\t\\tint v,step;\\n// \\t\\tIter& operator++(){v+=step;return *this;}\\n// \\t\\tbool operator!=(Iter& itr){return v<itr.v;}\\n// \\t\\tint& operator*(){return v;}\\n// \\t};\\n// \\tIter i, n;\\n// \\trange(int i, int n,int step):i({i,step}), n({n,step}){}\\n// \\trange(int i, int n):range(i,n,1){}\\n// \\trange(int n):range(0,n){}\\n// \\tIter& begin(){return i;}\\n// \\tIter& end(){return n;}\\n// };\\n\\n//input\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\\n//output\\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\\\" \\\"; os<<a;}return os;}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\\\" \\\"<<p.second;}\\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t)<<\\\" \\\"<<get<3>(t);}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\\\" \\\"; os<<as[i];}return os;}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\\n\\nstruct Edge{\\n\\tchar c;int f,t;\\n};\\n\\nclass NFA{\\npublic:\\n\\tstatic NFA ONE;\\n\\tint N;\\n\\tvector<Edge> es;\\n\\tvector<vector<int>> f_cache, t_cache;\\n\\n\\tint s,t;\\n\\tNFA(int N = 0):N(N),s(0),t(1){\\n\\t\\tf_cache = t_cache = vector<vector<int>>(N);\\n\\t}\\n\\tvoid add_edge(char c,int f,int t){\\n\\t\\tint eid = es.size();\\n\\t\\tes.push_back({c,f,t});\\n\\t\\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\\n\\t}\\n\\tstatic NFA disjoint(NFA& a,NFA& b){\\n\\t\\t// merge technique\\n\\t\\tNFA& res = (a.es.size() < b.es.size()? b : a), add = (a.es.size() < b.es.size()? a : b);\\n\\t\\t\\n\\t\\tres.f_cache.resize(res.N + add.N);res.t_cache.resize(res.N + add.N);\\n\\t\\tint eid = res.es.size();\\n\\t\\tfor(Edge& e:add.es){\\n\\t\\t\\te.f += res.N; e.t += res.N;\\n\\t\\t\\tres.es.push_back(e);\\n\\t\\t\\tres.f_cache[e.f].push_back(eid);res.t_cache[e.t].push_back(eid);eid++;\\n\\t\\t}\\n\\t\\tres.N += add.N;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA Union(NFA& a,NFA& b){\\n\\t\\tbool bl = a.es.size() < b.es.size();\\n\\t\\tint as = (bl?b.N:0)+a.s,at = (bl?b.N:0)+a.t,aN = a.N, bs = (!bl?a.N:0)+b.s,bt = (!bl?a.N:0)+b.t, bN = b.N;\\n\\t\\tint S = aN+bN,T = aN+bN+1;\\n\\t\\tNFA ab = disjoint(a,b),ab1 = disjoint(ab,ONE),res = disjoint(ab1,ONE);\\n\\t\\tres.add_edge('-',S,as); res.add_edge('-',S,bs);res.add_edge('-',at,T); res.add_edge('-',bt,T);\\n\\t\\tres.s = S; res.t = T;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA Concat(NFA& a,NFA& b){\\n\\t\\tbool bl = a.es.size() < b.es.size();\\n\\t\\tint as = (bl?b.N:0)+a.s,at = (bl?b.N:0)+a.t,aN = a.N, bs = (!bl?a.N:0)+b.s,bt = (!bl?a.N:0)+b.t, bN = b.N;\\n\\t\\tNFA res = disjoint(a,b);\\n\\t\\tres.add_edge('-',at,bs);\\n\\t\\tres.s = as; res.t = bt;\\n\\t\\treturn res;\\n\\t}\\n\\tstatic NFA Star(NFA& a){\\n\\t\\tNFA res = disjoint(a,ONE);\\n\\t\\tres.add_edge('-',res.N-1,a.s);\\n\\t\\tres.add_edge('-',a.t,res.N-1);\\n\\t\\tres.s = res.t = res.N-1;\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// parsing \\n\\tstatic NFA pattern(string& s,int& i,int e){\\n\\t\\tNFA p = simple(s,i,e);\\n\\t\\twhile(i < e && s[i]=='|'){\\n\\t\\t\\ti++;// '|'\\n\\t\\t\\tNFA q = simple(s,i,e);\\n\\t\\t\\tp = NFA::Union(p,q);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA simple(string& s,int& i,int e){\\n\\t\\tNFA p = basic(s,i,e);\\n\\t\\twhile(i < e && s[i]!='|'){\\n\\t\\t\\tNFA q = basic(s,i,e);\\n\\t\\t\\tp = NFA::Concat(p,q);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA basic(string& s,int& i,int e){\\n\\t\\tNFA p = elementary(s,i,e);\\n\\t\\tif(i < (int)s.size() && s[i]=='*'){\\n\\t\\t\\ti++;// *\\n\\t\\t\\tp = NFA::Star(p);\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA elementary(string& s,int& i,int e){\\n\\t\\tNFA p;\\n\\t\\tif(s[i]=='('){\\n\\t\\t\\ti++; // (\\n\\t\\t\\tint d=1;\\n\\t\\t\\tfor(int j=i;j<e;j++){\\n\\t\\t\\t\\tif(s[j]=='(') d++;\\n\\t\\t\\t\\tif(s[j]==')') d--;\\n\\t\\t\\t\\tif(d==0){\\n\\t\\t\\t\\t\\te = j;break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp = pattern(s,i,e);\\n\\t\\t\\ti++; // )\\n\\t\\t}else{\\n\\t\\t\\tp = NFA(2);\\n\\t\\t\\tp.add_edge(s[i],p.s,p.t);\\n\\t\\t\\ti++;// c\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n} NFA::ONE = NFA(1);\\n\\nint rc = 0;\\nclass Main{\\n\\tpublic:\\n\\n\\tint h,w;\\n\\tvector<string> tmp,res;\\n\\n\\tvector<NFA> NFAs;\\n\\tvector<vector<int>> stats;\\n\\tvector<vector<vector<int>>> reachable;\\n\\tvector<vector<vector<vector<int>>>> trans;\\n\\n\\tvoid create_reachable(int nind){\\n\\t\\tNFA& nfa = NFAs[nind];\\n\\t\\tqueue<pair<int,int>> que; que.push({nfa.t,0});\\n\\t\\treachable[nind][nfa.t][0] = true;\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint t,d;tie(t,d) = que.front();que.pop();\\n\\t\\t\\t//back\\n\\t\\t\\tfor(int eid:nfa.t_cache[t]){\\n\\t\\t\\t\\tEdge& e = nfa.es[eid];\\n\\t\\t\\t\\tif(e.c=='-'){\\n\\t\\t\\t\\t\\tif(!reachable[nind][e.f][d]){\\n\\t\\t\\t\\t\\t\\treachable[nind][e.f][d] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(d+1 <reachable[nind][e.f].size() && !reachable[nind][e.f][d+1]){\\n\\t\\t\\t\\t\\t\\treachable[nind][e.f][d+1] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d+1});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid create_trans(int nind,int st,char nc){\\n\\t\\tNFA& nfa = NFAs[nind];\\n\\n\\t\\tvector<bool> passed(nfa.N);\\n\\t\\tpassed[st] = true;\\n\\t\\t// eps trans\\n\\t\\t{\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\\n\\t\\t\\t\\t\\tpassed[nfa.es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(nfa.es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// trans\\n\\t\\t{\\n\\t\\t\\tvector<bool> npassed(nfa.N);\\n\\t\\t\\trange(s,0,nfa.N)if(passed[s]) for(int eid : nfa.f_cache[s]){\\n\\t\\t\\t\\tchar c = nfa.es[eid].c;\\n\\t\\t\\t\\tint t = nfa.es[eid].t;\\n\\t\\t\\t\\tif(nc==c || c=='.') npassed[t] = true;\\n\\t\\t\\t}\\n\\t\\t\\tpassed = npassed;\\n\\t\\t}\\n\\n\\t\\t// eps trans\\n\\t\\t{\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\\n\\t\\t\\t\\t\\tpassed[nfa.es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(nfa.es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trange(s,0,passed.size())if(passed[s]){\\n\\t\\t\\tbool exeps = false, alleps = true;\\n\\t\\t\\tfor(int eid : nfa.f_cache[s]){\\n\\t\\t\\t\\texeps |= nfa.es[eid].c=='-';\\n\\t\\t\\t\\talleps &= nfa.es[eid].c=='-';\\n\\t\\t\\t}\\n\\t\\t\\t// ?? ????§???????????????´?????????????????? for ?????????\\n\\t\\t\\tif(exeps && alleps && nfa.t != s)continue; \\n\\t\\t\\ttrans[nind][st][nc-'A'].push_back(s);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid dfs(int y,int x,int c){\\n\\t\\t// cerr << y <<\\\" \\\" << x <<endl;\\n\\t\\t// cerr << tmp <<endl;\\n\\n\\t\\tif(rc>1)return;\\n\\t\\tif(y==h){\\n\\t\\t\\trc+=c;\\n\\t\\t\\tres = tmp;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\\n\\t\\tvector<vector<int>> ynstats(26),xnstats(26);\\n\\t\\tfor(char nc = 'A';nc <= 'Z'; nc++){\\n\\t\\t\\tfor(int s:stats[y])for(int t:trans[y][s][nc-'A'])ynstats[nc-'A'].push_back(t);\\n\\t\\t\\tUNIQUE(ynstats[nc-'A']);\\n\\t\\t}\\n\\t\\tfor(char nc = 'A';nc <= 'Z'; nc++){\\n\\t\\t\\tfor(int s:stats[h+x])for(int t:trans[h+x][s][nc-'A'])xnstats[nc-'A'].push_back(t);\\n\\t\\t\\tUNIQUE(xnstats[nc-'A']);\\n\\t\\t}\\n\\t\\tvector<int> gid(26);iota(ALL(gid),0);\\n\\t\\tfor(char c1='A'; c1 <= 'Z';c1++){\\n\\t\\t\\tfor(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\\n\\t\\t\\t\\tif(ynstats[c1-'A'].size() == ynstats[c2-'A'].size() && xnstats[c1-'A'].size() == xnstats[c2-'A'].size()){\\n\\t\\t\\t\\t\\tbool eq = true;\\n\\t\\t\\t\\t\\trange(i,0,ynstats[c1-'A'].size())eq &= ynstats[c1-'A'][i] == ynstats[c2-'A'][i];\\n\\t\\t\\t\\t\\trange(i,0,xnstats[c1-'A'].size())eq &= xnstats[c1-'A'][i] == xnstats[c2-'A'][i];\\n\\t\\t\\t\\t\\tif(eq){\\n\\t\\t\\t\\t\\t\\tgid[c1-'A']=gid[c2-'A'];\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int> gc(26);\\n\\t\\trange(i,0,26)gc[gid[i]]++;\\n\\n\\t\\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\\n\\t\\t\\ttmp[y][x] = c;\\n\\t\\t\\tbool tmpOK = true;\\n\\t\\t\\t// eda ??????????????? de ikerukana ?\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:ynstats[c-'A'])ok |= reachable[y][s][w-1-x];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:xnstats[c-'A'])ok |= reachable[h+x][s][h-1-y];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(x == w-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:ynstats[c-'A'])ok |= s == NFAs[y].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(y == h-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:xnstats[c-'A'])ok |= s == NFAs[h+x].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmpOK){\\n\\t\\t\\t\\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\\n\\t\\t\\t\\tstats[y] = ynstats[c-'A']; stats[h+x] = xnstats[c-'A'];\\n\\t\\t\\t\\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\\n\\t\\t\\t\\telse dfs(y+1,0,gc[c-'A']);\\n\\t\\t\\t\\tstats[y] = tmpp; stats[h + x] = tmpq;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid run(){\\n\\t\\twhile(true){\\n\\t\\t\\tcin >> h >> w;\\n\\t\\t\\tif(h==0 && w==0)break;\\n\\t\\t\\trc = 0;\\n\\t\\t\\ttmp = res = vector<string>(h,string(w,'-'));\\n\\t\\t\\tvector<string> ss(h+w);cin >> ss;\\n \\t\\t\\t// h <= 4, w <= 4\\n\\t\\t\\tNFAs = vector<NFA>(h+w);\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\tstring s = \\\"\\\";\\n\\t\\t\\t\\trange(j,1,ss[i].size()-1)s+=ss[i][j];\\n\\t\\t\\t\\tint cur = 0, e = s.size();\\n\\t\\t\\t\\tNFAs[i]= NFA::pattern(s,cur,e);\\n\\t\\t\\t}\\n\\t\\t\\tstats = vector<vector<int>>(h+w);\\n\\t\\t\\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\\n\\n\\t\\t\\treachable = vector<vector<vector<int>>>(h+w);\\n\\t\\t\\trange(i,0,h){\\n\\t\\t\\t\\treachable[i] = vector<vector<int>>(NFAs[i].N);\\n\\t\\t\\t\\trange(s,0,NFAs[i].N) reachable[i][s] = vector<int>(h+1);\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,w){\\n\\t\\t\\t\\treachable[h+i] = vector<vector<int>>(NFAs[h+i].N);\\n\\t\\t\\t\\trange(s,0,NFAs[h+i].N) reachable[h+i][s] = vector<int>(w+1);\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,h+w) create_reachable(i);\\n\\t\\t\\t\\n\\t\\t\\ttrans = vector<vector<vector<vector<int>>>>(h+w);\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\ttrans[i] = vector<vector<vector<int>>>(NFAs[i].N,vector<vector<int>>(26));\\n\\t\\t\\t\\trange(s,0,NFAs[i].N)range(c,'A','Z'+1)create_trans(i,s,c);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// cerr << NFAs[0].t <<endl;\\n\\t\\t\\t// range(i,0,NFAs[0].es.size()){\\n\\t\\t\\t// \\tcerr << NFAs[0].es[i].c <<\\\" \\\" <<NFAs[0].es[i].f <<\\\" \\\" <<NFAs[0].es[i].t <<endl;\\n\\t\\t\\t// }\\n\\t\\t\\t// cerr << NFAs[0].t_cache <<endl;\\n\\n\\t\\t\\tdfs(0,0,1);\\n\\t\\t\\tif(rc > 1){\\n\\t\\t\\t\\tcout << \\\"ambiguous\\\" <<endl; \\n\\t\\t\\t}else if(rc == 0){\\n\\t\\t\\t\\tcout << \\\"none\\\" <<endl;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\trange(i,0,h) cout << res[i] <<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nint main(){\\n\\tcout <<fixed<<setprecision(20);\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tMain().run();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5390,\n \"memory_kb\": 29680,\n \"score_of_the_acc\": -1.3222,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1344_1514737\",\n \"code_snippet\": \"// very kuso problem\\n\\n#include <cassert>// c\\n#include <iostream>// io\\n#include <iomanip>\\n#include <fstream>\\n#include <sstream>\\n#include <vector>// container\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <algorithm>// other\\n#include <complex>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <regex>\\nusing namespace std;\\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;\\n\\n#define ALL(c) c.begin(),c.end()\\n#define IN(l,v,r) (l<=v && v < r)\\ntemplate<class T> void UNIQUE(T& v){\\n\\tsort(ALL(v));\\n\\tv.erase(unique(ALL(v)),v.end());\\n}\\n\\n#define DUMP(x) cerr << #x <<\\\" = \\\" << (x)\\n#define LINE() cerr<< \\\" (L\\\" << __LINE__ << \\\")\\\"\\n\\n#define range(i,l,r) for(int i=(int)l;i<(int)(r);i++)\\n// struct range{\\n// \\tstruct Iter{\\n// \\t\\tint v,step;\\n// \\t\\tIter& operator++(){v+=step;return *this;}\\n// \\t\\tbool operator!=(Iter& itr){return v<itr.v;}\\n// \\t\\tint& operator*(){return v;}\\n// \\t};\\n// \\tIter i, n;\\n// \\trange(int i, int n,int step):i({i,step}), n({n,step}){}\\n// \\trange(int i, int n):range(i,n,1){}\\n// \\trange(int n):range(0,n){}\\n// \\tIter& begin(){return i;}\\n// \\tIter& end(){return n;}\\n// };\\n\\n//input\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}\\ntemplate<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}\\ntemplate<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}\\ntemplate<typename T> istream& operator >> (istream& is,vector<T>& as){range(i,0,as.size())is >>as[i];return is;}\\n//output\\ntemplate<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<\\\" \\\"; os<<a;}return os;}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<\\\" \\\"<<p.second;}\\ntemplate<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}\\ntemplate<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}\\ntemplate<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t);}\\ntemplate<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t);}\\ntemplate<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<\\\" \\\"<<get<1>(t)<<\\\" \\\"<<get<2>(t)<<\\\" \\\"<<get<3>(t);}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<T>& as){range(i,0,as.size()){if(i!=0)os<<\\\" \\\"; os<<as[i];}return os;}\\ntemplate<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){range(i,0,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}\\n\\nstruct Edge{\\n\\tchar c;int f,t;\\n};\\n\\nclass NFA{\\npublic:\\n\\t// (source)initial state = 0, (target)acc state = 0 or 1\\n\\tint N;\\n\\tvector<Edge> es;\\n\\tvector<vector<int>> f_cache, t_cache;\\n\\n\\tint s,t;\\n\\tNFA(int N = 0):N(N),s(0),t(1){\\n\\t\\tf_cache = t_cache = vector<vector<int>>(N);\\n\\t}\\n\\tvoid add_edge(char c,int f,int t){\\n\\t\\tint eid = es.size();\\n\\t\\tes.push_back({c,f,t});\\n\\t\\tf_cache[f].push_back(eid);t_cache[t].push_back(eid);\\n\\t}\\n\\tvoid disjoint(NFA& b){\\n\\t\\tf_cache.resize(N+b.N);\\n\\t\\tt_cache.resize(N+b.N);\\n\\t\\tfor(Edge& e:b.es){\\n\\t\\t\\te.f+=N; e.t+=N;\\n\\t\\t\\tint eid = es.size();\\n\\t\\t\\tes.push_back(e);\\n\\t\\t\\tf_cache[e.f].push_back(eid); t_cache[e.t].push_back(eid);\\n\\t\\t}\\n\\t\\tN +=b.N;\\n\\t}\\n\\tvoid Union(NFA b){\\n\\t\\tint as = s,at = t,aN = N, bs = b.s,bt = b.t, bN = b.N;\\n\\t\\tdisjoint(b);\\n\\t\\tNFA sp = NFA(1);\\n\\t\\tdisjoint(sp);\\n\\t\\tNFA tp = NFA(1);\\n\\t\\tdisjoint(tp);\\n\\t\\tadd_edge('-',aN+bN,as);\\n\\t\\tadd_edge('-',aN+bN,aN + bs);\\n\\t\\tadd_edge('-',at,aN+bN+1);\\n\\t\\tadd_edge('-',aN+bt,aN+bN+1);\\n\\t\\ts = aN+bN; t = aN + bN +1;\\n\\t}\\n\\tvoid Concat(NFA b){\\n\\t\\tint as = s,at = t,aN = N, bs = b.s,bt = b.t, bN = b.N;\\n\\t\\tdisjoint(b);\\n\\t\\tadd_edge('-',at,aN + bs);\\n\\t\\ts = as;t = aN + bt;\\n\\t}\\n\\tvoid Star(){\\n\\t\\tNFA sp = NFA(1);\\n\\t\\tdisjoint(sp);\\n\\t\\tadd_edge('-',N-1,s);\\n\\t\\tadd_edge('-',t,N-1);\\n\\t\\ts = t = N-1;\\n\\t}\\n\\n\\t// parsing \\n\\tstatic NFA pattern(string& s,int& i,int e){\\n\\t\\tNFA p = simple(s,i,e);\\n\\t\\twhile(i < e && s[i]=='|'){\\n\\t\\t\\ti++;// '|'\\n\\t\\t\\tp.Union(simple(s,i,e));\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA simple(string& s,int& i,int e){\\n\\t\\tNFA p = basic(s,i,e);\\n\\t\\twhile(i < e && s[i]!='|'){\\n\\t\\t\\tp.Concat(basic(s,i,e));\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA basic(string& s,int& i,int e){\\n\\t\\tNFA p = elementary(s,i,e);\\n\\t\\tif(i < (int)s.size() && s[i]=='*'){\\n\\t\\t\\ti++;// *\\n\\t\\t\\tp.Star();\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n\\tstatic NFA elementary(string& s,int& i,int e){\\n\\t\\tNFA p;\\n\\t\\tif(s[i]=='('){\\n\\t\\t\\ti++; // (\\n\\t\\t\\tint d=1;\\n\\t\\t\\tfor(int j=i;j<e;j++){\\n\\t\\t\\t\\tif(s[j]=='(') d++;\\n\\t\\t\\t\\tif(s[j]==')') d--;\\n\\t\\t\\t\\tif(d==0){\\n\\t\\t\\t\\t\\te = j;break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp = pattern(s,i,e);\\n\\t\\t\\ti++; // )\\n\\t\\t}else{\\n\\t\\t\\tp = NFA(2);\\n\\t\\t\\tp.add_edge(s[i],p.s,p.t);\\n\\t\\t\\ti++;// c\\n\\t\\t}\\n\\t\\treturn p;\\n\\t}\\n};\\n\\n\\nint rc = 0;\\nclass Main{\\n\\tpublic:\\n\\n\\tint h,w;\\n\\tvector<string> tmp,res;\\n\\n\\tvector<NFA> NFAs;\\n\\tvector<vector<int>> stats;\\n\\tvector<vector<vector<int>>> reachable;\\n\\tvector<vector<vector<vector<int>>>> trans;\\n\\n\\tvoid create_reachable(int nind){\\n\\t\\tNFA& nfa = NFAs[nind];\\n\\t\\tqueue<pair<int,int>> que; que.push({nfa.t,0});\\n\\t\\treachable[nind][nfa.t][0] = true;\\n\\t\\twhile(!que.empty()){\\n\\t\\t\\tint t,d;tie(t,d) = que.front();que.pop();\\n\\t\\t\\t//back\\n\\t\\t\\tfor(int eid:nfa.t_cache[t]){\\n\\t\\t\\t\\tEdge& e = nfa.es[eid];\\n\\t\\t\\t\\tif(e.c=='-'){\\n\\t\\t\\t\\t\\tif(!reachable[nind][e.f][d]){\\n\\t\\t\\t\\t\\t\\treachable[nind][e.f][d] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(d+1 <reachable[nind][e.f].size() && !reachable[nind][e.f][d+1]){\\n\\t\\t\\t\\t\\t\\treachable[nind][e.f][d+1] = true;\\n\\t\\t\\t\\t\\t\\tque.push({e.f,d+1});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid create_trans(int nind,int st,char nc){\\n\\t\\tNFA& nfa = NFAs[nind];\\n\\n\\t\\tvector<bool> passed(nfa.N);\\n\\t\\tpassed[st] = true;\\n\\t\\t// eps trans\\n\\t\\t{\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\\n\\t\\t\\t\\t\\tpassed[nfa.es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(nfa.es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// trans\\n\\t\\t{\\n\\t\\t\\tvector<bool> npassed(nfa.N);\\n\\t\\t\\trange(s,0,nfa.N)if(passed[s]) for(int eid : nfa.f_cache[s]){\\n\\t\\t\\t\\tchar c = nfa.es[eid].c;\\n\\t\\t\\t\\tint t = nfa.es[eid].t;\\n\\t\\t\\t\\tif(nc==c || c=='.') npassed[t] = true;\\n\\t\\t\\t}\\n\\t\\t\\tpassed = npassed;\\n\\t\\t}\\n\\n\\t\\t// eps trans\\n\\t\\t{\\n\\t\\t\\tqueue<int> que;\\n\\t\\t\\trange(i,0,passed.size())if(passed[i])que.push(i);\\n\\t\\t\\twhile(!que.empty()){\\n\\t\\t\\t\\tint s = que.front();que.pop();\\n\\t\\t\\t\\tfor(int eid : nfa.f_cache[s])if(nfa.es[eid].c =='-' && !passed[nfa.es[eid].t]){\\n\\t\\t\\t\\t\\tpassed[nfa.es[eid].t] = true;\\n\\t\\t\\t\\t\\tque.push(nfa.es[eid].t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\trange(s,0,passed.size())if(passed[s]){\\n\\t\\t\\tbool exeps = false, alleps = true;\\n\\t\\t\\tfor(int eid : nfa.f_cache[s]){\\n\\t\\t\\t\\texeps |= nfa.es[eid].c=='-';\\n\\t\\t\\t\\talleps &= nfa.es[eid].c=='-';\\n\\t\\t\\t}\\n\\t\\t\\t// ?? ????§???????????????´?????????????????? for ?????????\\n\\t\\t\\tif(exeps && alleps && nfa.t != s)continue; \\n\\t\\t\\ttrans[nind][st][nc-'A'].push_back(s);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid dfs(int y,int x,int c){\\n\\t\\t// cerr << y <<\\\" \\\" << x <<endl;\\n\\t\\t// cerr << tmp <<endl;\\n\\n\\t\\tif(rc>1)return;\\n\\t\\tif(y==h){\\n\\t\\t\\trc+=c;\\n\\t\\t\\tres = tmp;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// ????????????????????¶??????????????´????????????????????????????????¢?´¢\\n\\t\\tvector<vector<int>> ynstats(26),xnstats(26);\\n\\t\\tfor(char nc = 'A';nc <= 'Z'; nc++){\\n\\t\\t\\tfor(int s:stats[y])for(int t:trans[y][s][nc-'A'])ynstats[nc-'A'].push_back(t);\\n\\t\\t\\tUNIQUE(ynstats[nc-'A']);\\n\\t\\t}\\n\\t\\tfor(char nc = 'A';nc <= 'Z'; nc++){\\n\\t\\t\\tfor(int s:stats[h+x])for(int t:trans[h+x][s][nc-'A'])xnstats[nc-'A'].push_back(t);\\n\\t\\t\\tUNIQUE(xnstats[nc-'A']);\\n\\t\\t}\\n\\t\\tvector<int> gid(26);iota(ALL(gid),0);\\n\\t\\tfor(char c1='A'; c1 <= 'Z';c1++){\\n\\t\\t\\tfor(char c2='A'; c2 < c1;c2++)if(gid[c2-'A']==c2-'A'){\\n\\t\\t\\t\\tif(ynstats[c1-'A'].size() == ynstats[c2-'A'].size() && xnstats[c1-'A'].size() == xnstats[c2-'A'].size()){\\n\\t\\t\\t\\t\\tbool eq = true;\\n\\t\\t\\t\\t\\trange(i,0,ynstats[c1-'A'].size())eq &= ynstats[c1-'A'][i] == ynstats[c2-'A'][i];\\n\\t\\t\\t\\t\\trange(i,0,xnstats[c1-'A'].size())eq &= xnstats[c1-'A'][i] == xnstats[c2-'A'][i];\\n\\t\\t\\t\\t\\tif(eq){\\n\\t\\t\\t\\t\\t\\tgid[c1-'A']=gid[c2-'A'];\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<int> gc(26);\\n\\t\\trange(i,0,26)gc[gid[i]]++;\\n\\n\\t\\tfor(char c='A'; c <= 'Z';c++)if(gid[c-'A']==c-'A'){\\n\\t\\t\\ttmp[y][x] = c;\\n\\t\\t\\tbool tmpOK = true;\\n\\t\\t\\t// eda ??????????????? de ikerukana ?\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:ynstats[c-'A'])ok |= reachable[y][s][w-1-x];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:xnstats[c-'A'])ok |= reachable[h+x][s][h-1-y];\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(x == w-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:ynstats[c-'A'])ok |= s == NFAs[y].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(y == h-1){\\n\\t\\t\\t\\tbool ok = false;\\n\\t\\t\\t\\tfor(int s:xnstats[c-'A'])ok |= s == NFAs[h+x].t;\\n\\t\\t\\t\\ttmpOK &= ok;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmpOK){\\n\\t\\t\\t\\tvector<int> tmpp = stats[y],tmpq = stats[h+x];\\n\\t\\t\\t\\tstats[y] = ynstats[c-'A']; stats[h+x] = xnstats[c-'A'];\\n\\t\\t\\t\\tif(x+1 < w) dfs(y,x+1,gc[c-'A']);\\n\\t\\t\\t\\telse dfs(y+1,0,gc[c-'A']);\\n\\t\\t\\t\\tstats[y] = tmpp; stats[h + x] = tmpq;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid run(){\\n\\t\\twhile(true){\\n\\t\\t\\tcin >> h >> w;\\n\\t\\t\\tif(h==0 && w==0)break;\\n\\t\\t\\trc = 0;\\n\\t\\t\\ttmp = res = vector<string>(h,string(w,'-'));\\n\\t\\t\\tvector<string> ss(h+w);cin >> ss;\\n \\t\\t\\t// h <= 4, w <= 4\\n\\t\\t\\tNFAs = vector<NFA>(h+w);\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\tstring s = \\\"\\\";\\n\\t\\t\\t\\trange(j,1,ss[i].size()-1)s+=ss[i][j];\\n\\t\\t\\t\\tint cur = 0, e = s.size();\\n\\t\\t\\t\\tNFAs[i]= NFA::pattern(s,cur,e);\\n\\t\\t\\t}\\n\\t\\t\\tstats = vector<vector<int>>(h+w);\\n\\t\\t\\trange(i,0,h+w) stats[i].push_back(NFAs[i].s);\\n\\n\\t\\t\\treachable = vector<vector<vector<int>>>(h+w);\\n\\t\\t\\trange(i,0,h){\\n\\t\\t\\t\\treachable[i] = vector<vector<int>>(NFAs[i].N);\\n\\t\\t\\t\\trange(s,0,NFAs[i].N) reachable[i][s] = vector<int>(h+1);\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,w){\\n\\t\\t\\t\\treachable[h+i] = vector<vector<int>>(NFAs[h+i].N);\\n\\t\\t\\t\\trange(s,0,NFAs[h+i].N) reachable[h+i][s] = vector<int>(w+1);\\n\\t\\t\\t}\\n\\t\\t\\trange(i,0,h+w) create_reachable(i);\\n\\t\\t\\t\\n\\t\\t\\ttrans = vector<vector<vector<vector<int>>>>(h+w);\\n\\t\\t\\trange(i,0,h+w){\\n\\t\\t\\t\\ttrans[i] = vector<vector<vector<int>>>(NFAs[i].N,vector<vector<int>>(26));\\n\\t\\t\\t\\trange(s,0,NFAs[i].N)range(c,'A','Z'+1)create_trans(i,s,c);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// cerr << NFAs[0].t <<endl;\\n\\t\\t\\t// range(i,0,NFAs[0].es.size()){\\n\\t\\t\\t// \\tcerr << NFAs[0].es[i].c <<\\\" \\\" <<NFAs[0].es[i].f <<\\\" \\\" <<NFAs[0].es[i].t <<endl;\\n\\t\\t\\t// }\\n\\t\\t\\t// cerr << NFAs[0].t_cache <<endl;\\n\\t\\t\\t\\n\\t\\t\\tdfs(0,0,1);\\n\\t\\t\\tif(rc > 1){\\n\\t\\t\\t\\tcout << \\\"ambiguous\\\" <<endl; \\n\\t\\t\\t}else if(rc == 0){\\n\\t\\t\\t\\tcout << \\\"none\\\" <<endl;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\trange(i,0,h) cout << res[i] <<endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nint main(){\\n\\tcout <<fixed<<setprecision(20);\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tMain().run();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5100,\n \"memory_kb\": 29868,\n \"score_of_the_acc\": -1.2565,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":790,"cells":{"group_id":{"kind":"string","value":"aoj_1332_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nCompany Organization\nYou started a company a few years ago and fortunately it has been highly successful. As the growth of the company, you noticed that you need to manage employees in a more organized way, and decided to form several groups and assign employees to them.\nNow, you are planning to form n groups, each of which corresponds to a project in the company. Sometimes you have constraints on members in groups. For example, a group must be a subset of another group because the former group will consist of senior members of the latter group, the members in two groups must be the same because current activities of the two projects are closely related, the members in two groups must not be exactly the same to avoid corruption, two groups cannot have a common employee because of a security reason, and two groups must have a common employee to facilitate collaboration.\nIn summary, by letting\nX\ni\n(\ni\n= 1, ... ,\nn\n) be the set of employees assigned to the\ni\n-th group, we have five types of constraints as follows.\nX\ni\n⊆\nX\nj\nX\ni\n=\nX\nj\nX\ni\n≠\nX\nj\nX\ni\n∩\nX\nj\n= ∅\nX\ni\n∩\nX\nj\n≠ ∅\nSince you have listed up constraints without considering consistency, it might be the case that you cannot satisfy all the constraints. Constraints are thus ordered according to their priorities, and you now want to know how many constraints of the highest priority can be satisfied.\nYou do not have to take ability of employees into consideration. That is, you can assign anyone to any group. Also, you can form groups with no employee. Furthermore, you can hire or fire as many employees as you want if you can satisfy more constraints by doing so.\nFor example, suppose that we have the following five constraints on three groups in the order of their priorities, corresponding to the first dataset in the sample input.\nX\n2\n⊆\nX\n1\nX\n3\n⊆\nX\n2\nX\n1\n⊆\nX\n3\nX\n1\n≠\nX\n3\nX\n3\n⊆\nX\n1\nBy assigning the same set of employees to\nX\n1\n,\nX\n2\n, and\nX\n3\n, we can satisfy the first three constraints. However, no matter how we assign employees to\nX\n1\n,\nX\n2\n, and\nX\n3\n, we cannot satisfy the first four highest priority constraints at the same time. Though we can satisfy the first three constraints and the fifth constraint at the same time, the answer should be three.\nInput\nThe input consists of several datasets. The first line of a dataset consists of two integers\nn\n(2 ≤\nn\n≤ 100) and\nm\n(1 ≤\nm\n≤ 10000), which indicate the number of groups and the number of constraints, respectively. Then, description of\nm\nconstraints follows. The description of each constraint consists of three integers\ns\n(1 ≤\ns\n≤ 5),\ni\n(1 ≤\ni\n≤\nn\n), and\nj\n(1 ≤\nj\n≤\nn\n,\nj\n≠=\ni\n), meaning a constraint of the\ns\n-th type imposed on the\ni\n-th group and the\nj\n-th group. The type number of a constraint is as listed above. The constraints are given in the descending order of priority.\nThe input ends with a line containing two zeros.\nOutput\nFor each dataset, output the number of constraints of the highest priority satisfiable at the same time.\nSample \n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1332_10851055","code_snippet":"#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <iostream>\n\nusing namespace std;\n\nconst int MAXN = 1e4+10;\nconst int MAXG = 110;\n\nint n,m;\nint x[MAXN],op[MAXN],y[MAXN];\n\nint f[MAXG][MAXG],g[MAXG][MAXG];\nbool check(int mid) {\n for (int i=1; i<=n; i++)\n for (int j=1; j<=n; j++)\n f[i][j] = 0 ;\n for (int i=1; i<=n; i++) {\n for (int j=1; j<=n; j++) g[i][j]=0;\n g[i][i]=1;\n }\n for (int Q=1; Q<=mid; Q++) {\n int i = x[Q] , j = y[Q] , ope = op[Q];\n if (ope==1) g[i][j] = 1 ;\n else if (ope==2) g[i][j] = g[j][i] = 1 ;\n else if (ope==4) f[i][j] = f[j][i] = 1 ;\n }\n for (int k = 1 ; k <= n ; k++)\n for (int i = 1 ; i <= n ; i++)\n for (int j = 1 ; j <= n ; j++)\n if (g[i][k] && g[k][j]) g[i][j] = 1 ;\n\n for (int k = 1 ; k <= n ; k++)\n for (int i = 1 ; i <= n ; i++)\n for (int j = 1 ; j <= n ; j++)\n if (f[i][k] && g[j][k]) f[i][j] = f[j][i] = 1 ;\n\n for (int Q = 1 ; Q <= mid ; Q++) {\n int i = x[Q] , j = y[Q] , ope = op[Q];\n if (ope==3) {\n if (f[i][i] && f[j][j]) return false ;\n if (g[i][j] && g[j][i]) return false ;\n } else if (ope==5) {\n if (f[i][j] || f[j][i] || f[i][i] || f[j][j]) return false ;\n }\n }\n return true ;\n}\n\nint main() {\n while (~scanf(\"%d%d\",&n,&m) && (n+m)) {\n for (int i=1; i<=m; i++) scanf(\"%d%d%d\",&op[i],&x[i],&y[i]);\n int l=1,r=m,ans=0;\n while (l<=r) {\n int mid=l+r>>1;\n if (check(mid)) {\n ans=mid;\n l=mid+1;\n } else r=mid-1;\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":3628,"score_of_the_acc":-0.1514,"final_rank":10},{"submission_id":"aoj_1332_8322631","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct info {\n\tint t, a, b;\n};\n\nbool solve(int N, int M, const vector<info>& I) {\n\tvector<vector<bool> > adj(N, vector<bool>(N, false));\n\tfor (info s : I) {\n\t\tif (s.t == 1) {\n\t\t\tadj[s.a][s.b] = true;\n\t\t}\n\t\tif (s.t == 2) {\n\t\t\tadj[s.a][s.b] = true;\n\t\t\tadj[s.b][s.a] = true;\n\t\t}\n\t}\n\tvector<vector<bool> > reach = adj;\n\tfor (int i = 0; i < N; i++) {\n\t\treach[i][i] = true;\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (reach[j][i] && reach[i][k]) {\n\t\t\t\t\treach[j][k] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<bool> > sameval(N, vector<bool>(N, false));\n\tvector<int> empty(N, -1);\n\tfor (info s : I) {\n\t\tif (s.t == 4) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[i][s.a] && reach[i][s.b]) {\n\t\t\t\t\tif (empty[i] == 0) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tempty[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (s.t == 5) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[s.a][i] || reach[s.b][i]) {\n\t\t\t\t\tif (empty[i] == 1) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tempty[i] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (info s : I) {\n\t\tif (s.t == 5) {\n\t\t\tvector<int> v;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[s.a][i] || reach[s.b][i]) {\n\t\t\t\t\tv.push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i : v) {\n\t\t\t\tfor (int j : v) {\n\t\t\t\t\tsameval[i][j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (info s : I) {\n\t\tif (s.t == 3 && ((reach[s.a][s.b] && reach[s.b][s.a]) || (empty[s.a] == 1 && empty[s.b] == 1))) {\n\t\t\treturn false;\n\t\t}\n\t\tif (s.t == 4 && sameval[s.a][s.b]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<info> I(M);\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tcin >> I[i].t >> I[i].a >> I[i].b;\n\t\t\tI[i].a -= 1;\n\t\t\tI[i].b -= 1;\n\t\t}\n\t\tint l = 0, r = M + 1;\n\t\twhile (r - l > 1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tvector<info> J(I.begin(), I.begin() + m);\n\t\t\tif (solve(N, M, J)) {\n\t\t\t\tl = m;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tr = m;\n\t\t\t}\n\t\t}\n\t\tcout << l << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":340,"memory_kb":3620,"score_of_the_acc":-0.1469,"final_rank":9},{"submission_id":"aoj_1332_8321954","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nclass unionfind {\nprivate:\n\tint n;\n\tvector<int> par;\npublic:\n\tunionfind() : n(0), par(vector<int>()) {}\n\tunionfind(int n_) : n(n_) {\n\t\tpar.resize(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint root(int x) {\n\t\tif (x == par[x]) {\n\t\t\treturn x;\n\t\t}\n\t\treturn par[x] = root(par[x]);\n\t}\n\tvoid link(int x, int y) {\n\t\tx = root(x);\n\t\ty = root(y);\n\t\tpar[y] = x;\n\t}\n\tbool connected(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n};\n\nstruct info {\n\tint t, a, b;\n};\n\nbool solve_dag(int N, int M, const vector<info>& I) {\n\tvector<vector<bool> > adj(N, vector<bool>(N, false));\n\tfor (info s : I) {\n\t\tif (s.t == 1) {\n\t\t\tadj[s.a][s.b] = true;\n\t\t}\n\t}\n\tvector<vector<bool> > reach = adj;\n\tfor (int i = 0; i < N; i++) {\n\t\treach[i][i] = true;\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (reach[j][i] && reach[i][k]) {\n\t\t\t\t\treach[j][k] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<bool> > sameval(N, vector<bool>(N, false));\n\tvector<int> empty(N, -1);\n\tfor (info s : I) {\n\t\tif (s.t == 4) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[i][s.a] && reach[i][s.b]) {\n\t\t\t\t\tif (empty[i] == 0) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tempty[i] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (s.t == 5) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[s.a][i] || reach[s.b][i]) {\n\t\t\t\t\tif (empty[i] == 1) {\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tempty[i] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tunionfind uf(N);\n\tfor (info s : I) {\n\t\tif (s.t == 5) {\n\t\t\tvector<int> v;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (reach[s.a][i] || reach[s.b][i]) {\n\t\t\t\t\tv.push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i : v) {\n\t\t\t\tfor (int j : v) {\n\t\t\t\t\tsameval[i][j] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (info s : I) {\n\t\tif (s.t == 3 && (s.a == s.b || (empty[s.a] == 1 && empty[s.b] == 1))) {\n\t\t\treturn false;\n\t\t}\n\t\tif (s.t == 4 && sameval[s.a][s.b]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nbool solve(int N, int M, const vector<info>& I) {\n\tvector<vector<bool> > adj(N, vector<bool>(N, false));\n\tfor (info s : I) {\n\t\tif (s.t == 1) {\n\t\t\tadj[s.a][s.b] = true;\n\t\t}\n\t\tif (s.t == 2) {\n\t\t\tadj[s.a][s.b] = true;\n\t\t\tadj[s.b][s.a] = true;\n\t\t}\n\t}\n\tvector<bool> vis(N, false);\n\tvector<int> ord;\n\tauto dfs1 = [&](auto& self, int pos) -> void {\n\t\tvis[pos] = true;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (adj[pos][i] && !vis[i]) {\n\t\t\t\tself(self, i);\n\t\t\t}\n\t\t}\n\t\tord.push_back(pos);\n\t};\n\tfor (int i = N - 1; i >= 0; i--) {\n\t\tif (!vis[i]) {\n\t\t\tdfs1(dfs1, i);\n\t\t}\n\t}\n\treverse(ord.begin(), ord.end());\n\tint counter = 0;\n\tvector<int> col(N, -1);\n\tauto dfs2 = [&](auto& self, int pos) -> void {\n\t\tcol[pos] = counter;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (adj[i][pos] && col[i] == -1) {\n\t\t\t\tself(self, i);\n\t\t\t}\n\t\t}\n\t};\n\tfor (int i : ord) {\n\t\tif (col[i] == -1) {\n\t\t\tdfs2(dfs2, i);\n\t\t\tcounter += 1;\n\t\t}\n\t}\n\tvector<info> J;\n\tfor (info s : I) {\n\t\tif (s.t == 1 && col[s.a] != col[s.b]) {\n\t\t\tJ.push_back(info{1, col[s.a], col[s.b]});\n\t\t}\n\t\tif (s.t >= 3) {\n\t\t\tJ.push_back(info{s.t, col[s.a], col[s.b]});\n\t\t}\n\t}\n\treturn solve_dag(counter, J.size(), J);\n}\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<info> I(M);\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tcin >> I[i].t >> I[i].a >> I[i].b;\n\t\t\tI[i].a -= 1;\n\t\t\tI[i].b -= 1;\n\t\t}\n\t\tint l = 0, r = M + 1;\n\t\twhile (r - l > 1) {\n\t\t\tint m = (l + r) / 2;\n\t\t\tvector<info> J(I.begin(), I.begin() + m);\n\t\t\tif (solve(N, M, J)) {\n\t\t\t\tl = m;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tr = m;\n\t\t\t}\n\t\t}\n\t\tcout << l << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":3716,"score_of_the_acc":-0.1202,"final_rank":8},{"submission_id":"aoj_1332_6402290","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\n//constexpr ll mod = 998244353;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\t//if (x == 0)return 0;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tint n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) {\n\t\tif (m < 0 || mod <= m) {\n\t\t\tm %= mod; if (m < 0)m += mod;\n\t\t}\n\t\tn = m;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 20;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\ntemplate<typename T>\nvoid addv(vector<T>& v, int loc, T val) {\n\tif (loc >= v.size())v.resize(loc + 1, 0);\n\tv[loc] += val;\n}\n/*const int mn = 100005;\nbool isp[mn];\nvector<int> ps;\nvoid init() {\n\tfill(isp + 2, isp + mn, true);\n\tfor (int i = 2; i < mn; i++) {\n\t\tif (!isp[i])continue;\n\t\tps.push_back(i);\n\t\tfor (int j = 2 * i; j < mn; j += i) {\n\t\t\tisp[j] = false;\n\t\t}\n\t}\n}*/\n\n//[,val)\ntemplate<typename T>\nauto prev_itr(set<T>& st, T val) {\n\tauto res = st.lower_bound(val);\n\tif (res == st.begin())return st.end();\n\tres--; return res;\n}\n\n//[val,)\ntemplate<typename T>\nauto next_itr(set<T>& st, T val) {\n\tauto res = st.lower_bound(val);\n\treturn res;\n}\nusing mP = pair<modint, modint>;\n\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n//-----------------------------------------\n\nstruct graph {\nprivate:\n\tint n;\n\tvector<vector<int>> G, rG;\n\tvector<bool> used;\n\tvector<int> vs;\n\n\tint mk;\n\tvector<vector<int>> fG;\n\tvector<vector<int>> ori;\n\tvector<int> trans;\npublic:\n\tgraph(int sz) {\n\t\tn = sz;\n\t\tG.resize(n);\n\t\trG.resize(n);\n\t\tused.resize(n);\n\n\t\tfG.resize(n);\n\t\ttrans.resize(n, -1);\n\t\tori.resize(n);\n\t}\n\tvoid add_edge(int a, int b) {\n\t\tG[a].push_back(b);\n\t\trG[b].push_back(a);\n\t}\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\trep(i, G[v].size()) {\n\t\t\tif (!used[G[v][i]])dfs(G[v][i]);\n\t\t}\n\t\tvs.push_back(v);\n\t}\n\tvoid rdfs(int v, int k) {\n\t\tused[v] = true;\n\t\tqueue<int> q; q.push(v);\n\t\tvector<int> c;\n\t\twhile (!q.empty()) {\n\t\t\tint id = q.front(); q.pop();\n\t\t\tori[k].push_back(id);\n\t\t\trep(j, rG[id].size()) {\n\t\t\t\tint to = rG[id][j];\n\t\t\t\tif (used[to]) {\n\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tused[to] = true; q.push(to);\n\t\t\t}\n\t\t}\n\t\tsort(c.begin(), c.end());\n\t\tint len = unique(c.begin(), c.end()) - c.begin();\n\t\trep(i, len) {\n\t\t\tfG[c[i]].push_back(k);\n\t\t}\n\t\trep(i, ori[k].size()) {\n\t\t\ttrans[ori[k][i]] = k;\n\t\t}\n\t}\n\tvoid scc() {\n\t\tfill(used.begin(), used.end(), false);\n\t\trep(i, n) {\n\t\t\tif (!used[i])dfs(i);\n\t\t}\n\t\tfill(used.begin(), used.end(), false);\n\t\tint k = 0;\n\t\tper(i, (int)vs.size()) {\n\t\t\tif (!used[vs[i]]) {\n\t\t\t\trdfs(vs[i], k); k++;\n\t\t\t}\n\t\t}\n\t\tmk = k;\n\t}\n\tbool eq(int a, int b) {\n\t\treturn trans[a] == trans[b];\n\t}\n\tbool istwosat(int sup) {\n\t\trep(i, sup)if (trans[i] == trans[i + sup])return false;\n\t\treturn true;\n\t}\n};\n\nbool can[100][100];\nbool ss[100][100];\nint n, m;\nvoid solve() {\n\tvector<int> typ(m), a(m), b(m);\n\trep(i, m) {\n\t\tcin >> typ[i] >> a[i] >> b[i];\n\t\ta[i]--; b[i]--;\n\t}\n\tauto ok = [&](int c) {\n\t\tvector<vector<int>> G(n);\n\t\trep(i, n)rep(j, n) {\n\t\t\tcan[i][j] = false;\n\t\t}\n\t\trep(i, c) {\n\t\t\tif (typ[i] == 1) {\n\t\t\t\tG[a[i]].push_back(b[i]);\n\t\t\t}\n\t\t\telse if (typ[i] == 2) {\n\t\t\t\tG[a[i]].push_back(b[i]);\n\t\t\t\tG[b[i]].push_back(a[i]);\n\t\t\t}\n\t\t}\n\t\trep(i, n) {\n\t\t\tcan[i][i] = true;\n\t\t\tqueue<int> q; q.push(i);\n\t\t\twhile (!q.empty()) {\n\t\t\t\tint id = q.front(); q.pop();\n\t\t\t\tfor (int to : G[id]) {\n\t\t\t\t\tif (!can[i][to]) {\n\t\t\t\t\t\tcan[i][to] = true;\n\t\t\t\t\t\tq.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//equal check\n\t\tgraph g(n);\n\t\trep(i, c) {\n\t\t\tif (typ[i] == 1) {\n\t\t\t\tg.add_edge(a[i], b[i]);\n\t\t\t}\n\t\t\telse if (typ[i] == 2) {\n\t\t\t\tg.add_edge(a[i], b[i]);\n\t\t\t\tg.add_edge(b[i], a[i]);\n\t\t\t}\n\t\t}\n\t\tg.scc();\n\t\trep(i, c)if (typ[i] == 3) {\n\t\t\tif (g.eq(a[i], b[i])) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\t//2-sat about empty set\n\t\tgraph st(2 * n);\n\t\trep(i, c) {\n\t\t\tif (typ[i] == 1) {\n\t\t\t\tst.add_edge(b[i], a[i]);\n\t\t\t\tst.add_edge(a[i] + n, b[i] + n);\n\t\t\t}\n\t\t\telse if (typ[i] == 2) {\n\t\t\t\tst.add_edge(a[i], b[i]);\n\t\t\t\tst.add_edge(b[i], a[i]);\n\t\t\t\tst.add_edge(a[i] + n, b[i] + n);\n\t\t\t\tst.add_edge(b[i] + n, a[i] + n);\n\t\t\t}\n\t\t\telse if (typ[i] == 3) {\n\t\t\t\tst.add_edge(a[i], b[i] + n);\n\t\t\t\tst.add_edge(b[i], a[i] + n);\n\t\t\t\tif (can[a[i]][b[i]])st.add_edge(b[i], b[i] + n);\n\t\t\t\tif (can[b[i]][a[i]])st.add_edge(a[i], a[i] + n);\n\t\t\t}\n\t\t\telse if (typ[i] == 4) {\n\t\t\t\tif (can[a[i]][b[i]]) {\n\t\t\t\t\tst.add_edge(a[i] + n, a[i]);\n\t\t\t\t}\n\t\t\t\tif (can[b[i]][a[i]]) {\n\t\t\t\t\tst.add_edge(b[i] + n, b[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (typ[i] == 5) {\n\t\t\t\tst.add_edge(a[i], a[i] + n);\n\t\t\t\tst.add_edge(b[i], b[i] + n);\n\t\t\t}\n\t\t}\n\t\t\n\t\t//conflict between 4 and 5\n\t\trep(i, n)rep(j, n) {\n\t\t\tss[i][j] = false;\n\t\t}\n\t\trep(i, c)if (typ[i] == 5) {\n\t\t\tss[a[i]][b[i]] = ss[b[i]][a[i]] = true;\n\t\t}\n\t\trep(i, n) {\n\t\t\tqueue<int> q;\n\t\t\trep(j, n) {\n\t\t\t\tif (ss[i][j]) {\n\t\t\t\t\tq.push(j);\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile (!q.empty()) {\n\t\t\t\tint id = q.front(); q.pop();\n\t\t\t\tfor (int to : G[id]) {\n\t\t\t\t\tif (!ss[i][to]) {\n\t\t\t\t\t\tss[i][to] = true;\n\t\t\t\t\t\tq.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(j, n) {\n\t\t\tqueue<int> q;\n\t\t\trep(i, n)if (ss[i][j])q.push(i);\n\t\t\twhile (!q.empty()) {\n\t\t\t\tint id = q.front(); q.pop();\n\t\t\t\tfor (int to : G[id]) {\n\t\t\t\t\tif (!ss[to][j]) {\n\t\t\t\t\t\tss[to][j] = true;\n\t\t\t\t\t\tq.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(i, c)if (typ[i] == 4) {\n\t\t\tif (ss[a[i]][b[i]])return false;\n\t\t}\n\n\t\trep(i, n) {\n\t\t\tbool exi = false;\n\t\t\trep(j, n)if (ss[i][j])exi = true;\n\t\t\tif (exi)st.add_edge(i, i + n);\n\t\t}\n\t\trep(i, c)if (typ[i] == 4) {\n\t\t\trep(pre, n) {\n\t\t\t\tif (can[pre][a[i]] && can[pre][b[i]]) {\n\t\t\t\t\tst.add_edge(pre+n,pre);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tst.scc();\n\t\t//cout << \"nande \" << c << \"\\n\";\n\t\tif (!st.istwosat(n)) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t};\n\tint le = 0;\n\tint ri = m + 1;\n\twhile (ri - le > 1) {\n\t\tint x = (le + ri) / 2;\n\t\tif (ok(x))le = x;\n\t\telse ri = x;\n\t}\n\tcout << le << \"\\n\";\n\t\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//while(true)\n\t//expr();\n\t//int t; cin >> t; rep(i, t)\n\twhile(cin>>n>>m,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":470,"memory_kb":30884,"score_of_the_acc":-1.0917,"final_rank":14},{"submission_id":"aoj_1332_3974896","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define FOR(i,a,b) for(int i=(int)(a); i<(int)(b); i++)\n#define FORR(i,a,b) for(int i=(int)(b)-1; i>=(int)(a); i--)\n\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pid = pair<int,double>;\n\nint n,m;\nbool ok;\nbool g[252][252];\nint ty[12525], xi[12525], xj[12525];\nvector<int> fook[252][252];\n\nvoid f(int id){\n int s = xi[id], t = xj[id];\n if(ty[id] == 3){\n if(g[s][t] && g[t][s]){\n ok = false;\n }else if(g[s][s+n] && g[t][t+n]){\n ok = false;\n }\n }else if(ty[id] == 5){\n if(g[s][s+n] || g[t][t+n]){\n ok = false;\n }else if(g[s][t+n] && g[t][s+n]){\n ok = false;\n }\n }\n}\n\nvoid add_edge(int i, int j){\n if(g[i][j])return;\n g[i][j] = true;\n // (i,j) check\n for(int id : fook[i][j]){\n f(id);\n }\n // add others\n REP(s,2*n)if(g[s][i] && !g[s][j]){\n add_edge(s,j);\n }\n REP(t,2*n)if(g[j][t] && !g[i][t]){\n add_edge(i,t);\n }\n if(i+n==j){\n REP(s,n)if(g[s][i]){\n add_edge(i,s);\n add_edge(s,s+n);\n add_edge(s+n,i+n);\n }\n }\n if(i<n && j<n && g[j][j+n] && !g[j][i]){\n add_edge(i,i+n);\n add_edge(j,i);\n add_edge(i+n,j+n);\n }\n}\n\nint solve(){\n // initialize\n ok = true;\n REP(i,2*n)REP(j,2*n)g[i][j] = false;\n REP(i,2*n)REP(j,2*n)fook[i][j].clear();\n REP(i,m){\n int s = xi[i], t = xj[i];\n if(ty[i]==1){\n add_edge(s,t);\n add_edge(t+n,s+n);\n }else if(ty[i]==2){\n add_edge(s,t);\n add_edge(t+n,s+n);\n add_edge(t,s);\n add_edge(s+n,t+n);\n }else if(ty[i]==4){\n add_edge(s,t+n);\n add_edge(t,s+n);\n }else if(ty[i]==3){\n f(i);\n fook[s][s+n].push_back(i);\n fook[t][t+n].push_back(i);\n fook[s][t].push_back(i);\n fook[t][s].push_back(i);\n }else if(ty[i]==5){\n f(i);\n fook[s][s+n].push_back(i);\n fook[t][t+n].push_back(i);\n fook[s][t+n].push_back(i);\n fook[t][s+n].push_back(i);\n }\n if(!ok){\n return i;\n }\n }\n return m;\n}\n\nint naive(){\n int n2 = 1<<n;\n int ans = 0;\n REP(s,1<<n2){\n vector<int> ss(n);\n REP(i,n){\n REP(j,n2)if((j>>i&1) && (s>>j&1))ss[i] += 1<<j;\n }\n bool ok = true;\n REP(i,m){\n if(ty[i]==1){\n if((ss[xi[i]] & ss[xj[i]]) != ss[xi[i]])ok=false;\n }else if(ty[i]==2){\n if(ss[xi[i]] != ss[xj[i]])ok=false;\n }else if(ty[i]==3){\n if(ss[xi[i]] == ss[xj[i]])ok=false;\n }else if(ty[i]==4){\n if((ss[xi[i]] & ss[xj[i]]) != 0)ok=false;\n }else if(ty[i]==5){\n if((ss[xi[i]] & ss[xj[i]]) == 0)ok=false;\n }\n if(!ok){\n ans = max(ans, i);\n break;\n }\n }\n if(ok){\n ans = m;\n break;\n }\n }\n return ans;\n}\n\nint main(){\n while(false){\n n = 3;\n m = 8;\n REP(i,m){\n ty[i] = rand() % 5 + 1;\n xi[i] = rand() % n;\n xj[i] = rand() % (n-1);\n if(xj[i] >= xi[i])xj[i]++;\n }\n int ans1 = solve();\n int ans2 = naive();\n if(ans1 != ans2){\n printf(\"%d %d\\n\", n,m);\n REP(i,m)printf(\"%d %d %d\\n\",ty[i],xi[i]+1,xj[i]+1);\n printf(\"ans1: %d\\n\",ans1);\n printf(\"ans2: %d\\n\",ans2);\n return 0;\n }\n }\n while(true){\n scanf(\"%d%d\",&n,&m);\n if(n+m==0)break;\n REP(i,m)scanf(\"%d%d%d\",ty+i,xi+i,xj+i),xi[i]--,xj[i]--;\n printf(\"%d\\n\", solve());\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":6572,"score_of_the_acc":-0.1822,"final_rank":11},{"submission_id":"aoj_1332_3711792","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 105\n\nenum Type{\n\tYES,\n\tNO,\n\tUNDEFINED,\n};\n\nenum Relation{\n\tIS_SUBSET_OF,\n\tEQUAL,\n\tDIFFERENT,\n\tNO_COMMON,\n\tHAVE_COMMON,\n};\n\nstruct Info{\n\tRelation relation;\n\tint LEFT,RIGHT;\n};\n\nint N,M;\nInfo info[SIZE*SIZE];\nType is_Empty[SIZE],is_Subset[SIZE][SIZE],have_Common[SIZE][SIZE];\nRelation relate_array[5] = {IS_SUBSET_OF,EQUAL,DIFFERENT,NO_COMMON,HAVE_COMMON};\n\n\nbool func_Empty(int base){ //baseが新しく空集合であることが確定した\n\n\t//空集合の部分集合は、全て空集合でなければならない\n\tfor(int i = 0; i < N; i++){\n\t\tif(is_Subset[i][base] == YES){\n\t\t\tif(is_Empty[i] == NO){\n\n\t\t\t\treturn false;\n\n\t\t\t}else{\n\n\t\t\t\tis_Empty[i] = YES;\n\t\t\t}\n\t\t}\n\t}\n\n\t//空集合とHAVE_COMMONな要素があってはならない\n\tfor(int i = 0; i < N; i++){\n\t\tif(i != base){\n\t\t\tif(have_Common[i][base] == YES){\n\n\t\t\t\treturn false;\n\n\t\t\t}else{\n\n\t\t\t\thave_Common[i][base] = NO;\n\t\t\t\thave_Common[base][i] = NO;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool check(int MID){\n\n\t//テーブルの初期化\n\n\t//空集合かどうか\n\tfor(int i = 0; i < N; i++){\n\n\t\tis_Empty[i] = UNDEFINED;\n\t}\n\n\t//部分集合かどうか\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(k == i){\n\n\t\t\t\tis_Subset[k][i] = YES;\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tis_Subset[k][i] = UNDEFINED;\n\t\t\t}\n\t\t}\n\t}\n\n\t//共通の要素があるかどうか\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\thave_Common[k][i] = UNDEFINED; //空集合なら、φ∩Φ = Φ\n\t\t}\n\t}\n\n\t//まずは、部分集合関係を演算する\n\tfor(int i = 0; i <= MID; i++){\n\t\tif(info[i].relation == IS_SUBSET_OF){\n\n\t\t\tis_Subset[info[i].LEFT][info[i].RIGHT] = YES; //LEFTがRIGHTの部分集合\n\n\t\t}else if(info[i].relation == EQUAL){\n\n\t\t\tis_Subset[info[i].LEFT][info[i].RIGHT] = YES;\n\t\t\tis_Subset[info[i].RIGHT][info[i].LEFT] = YES;\n\t\t}\n\t}\n\n\t//ワーシャルフロイドで情報を伝達\n\tfor(int mid = 0; mid < N; mid++){\n\t\tfor(int start = 0; start < N; start++){\n\t\t\tif(is_Subset[start][mid] != YES)continue;\n\t\t\tfor(int goal = 0; goal < N; goal++){\n\t\t\t\tif(is_Subset[mid][goal] != YES)continue;\n\n\t\t\t\tis_Subset[start][goal] = YES;\n\t\t\t}\n\t\t}\n\t}\n\n\t//共通要素を持つなら空集合ではない\n\tfor(int i = 0; i <= MID; i++){\n\t\tif(info[i].relation == HAVE_COMMON){\n\t\t\tis_Empty[info[i].LEFT] = NO;\n\t\t\tis_Empty[info[i].RIGHT] = NO;\n\n\t\t\thave_Common[info[i].LEFT][info[i].RIGHT] = YES;\n\t\t\thave_Common[info[i].RIGHT][info[i].LEFT] = YES;\n\n\t\t\t//LEFT∩RIGHT != Φなので、[LEFTおよびLEFTとおなじもの]は[RIGHTおよびRIGHTと同じもの]とHAVE_COMMONになる\n\t\t\tfor(int a = 0; a < N; a++){\n\t\t\t\tif(is_Subset[a][info[i].LEFT] == YES && is_Subset[info[i].LEFT][a] == YES){\n\t\t\t\t\tfor(int b = 0; b < N; b++){\n\t\t\t\t\t\tif(is_Subset[b][info[i].RIGHT] == YES && is_Subset[info[i].RIGHT][b] == YES){\n\n\t\t\t\t\t\t\tis_Empty[a] = NO;\n\t\t\t\t\t\t\tis_Empty[b] = NO;\n\n\t\t\t\t\t\t\thave_Common[a][b] = YES;\n\t\t\t\t\t\t\thave_Common[b][a] = YES;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//LEFT∩RIGHT = Φの場合を処理\n\tfor(int i = 0; i <= MID; i++){\n\t\tif(info[i].relation == NO_COMMON){\n\n\t\t\t//LEFT∩RIGHT = Φより、A⊆LEFT,A⊆RIGHTとなるAについて、A = Φが成り立つ\n\t\t\tfor(int k = 0; k < N; k++){\n\t\t\t\tif(is_Subset[k][info[i].LEFT] == YES && is_Subset[k][info[i].RIGHT] == YES){\n\n\t\t\t\t\tif(is_Empty[k] == NO){\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tis_Empty[k] = YES;\n\t\t\t\t\t\tif(!func_Empty(k)){ //情報の反映\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//矛盾\n\t\t\tif(have_Common[info[i].LEFT][info[i].RIGHT] == YES){\n\n\t\t\t\treturn false;\n\n\t\t\t}else{\n\n\t\t\t\thave_Common[info[i].LEFT][info[i].RIGHT] = NO;\n\t\t\t}\n\n\t\t\t//LEFT⊆RIGHTでNO_COMMONなら、少なくともLEFTは空集合\n\t\t\tif(is_Subset[info[i].LEFT][info[i].RIGHT] == YES){\n\n\t\t\t\tif(is_Empty[info[i].LEFT] == NO){\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tis_Empty[info[i].LEFT] = YES;\n\t\t\t\t\tif(!func_Empty(info[i].LEFT)){\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//RIGHT⊆LEFTでNO_COMMONなら、少なくともRIGHTは空集合\n\t\t\tif(is_Subset[info[i].RIGHT][info[i].LEFT] == YES){\n\t\t\t\tif(is_Empty[info[i].RIGHT] == NO){\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tis_Empty[info[i].RIGHT] = YES;\n\t\t\t\t\tif(!func_Empty(info[i].RIGHT)){\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\t//DIFFERENTを確認\n\tfor(int i = 0; i <= MID; i++){\n\t\tif(info[i].relation != DIFFERENT)continue;\n\n\t\tif(is_Subset[info[i].LEFT][info[i].RIGHT] == YES &&\n\t\t\t\tis_Subset[info[i].RIGHT][info[i].LEFT] == YES){\n\n\t\t\treturn false;\n\n\t\t}else if(is_Empty[info[i].LEFT] == YES && is_Empty[info[i].RIGHT] == YES){ //両方が空集合なら不可\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t//emptyをもう一度確認\n\tfor(int i = 0; i < N; i++){\n\t\tif(is_Empty[i] != YES)continue;\n\n\t\t//空集合の部分集合は、全て空集合でなければならない\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(is_Subset[k][i] == YES){\n\t\t\t\tif(is_Empty[k] == NO){\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tis_Empty[k] = YES;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//空集合とHAVE_COMMONな要素があってはならない\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(k != i){\n\t\t\t\tif(have_Common[k][i] == YES){\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}else{\n\n\t\t\t\t\thave_Common[k][i] = NO;\n\t\t\t\t\thave_Common[i][k] = NO;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//have_Commonの情報を更新\n\tfor(int a = 0; a < N; a++){\n\t\tfor(int b = 0; b < N; b++){\n\t\t\tif(have_Common[a][b] != NO)continue;\n\t\t\tfor(int c = 0; c < N; c++){\n\t\t\t\tif(is_Subset[c][a] != YES)continue;\n\t\t\t\tfor(int d = 0; d < N; d++){\n\t\t\t\t\tif(is_Subset[d][b] != YES)continue;\n\n\t\t\t\t\tif(have_Common[c][d] == YES){\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}else{\n\t\t\t\t\t\thave_Common[c][d] = NO;\n\t\t\t\t\t\thave_Common[d][c] = NO;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//HAVE_COMMONを最後に確認\n\tfor(int i = 0; i <= MID; i++){\n\t\tif(info[i].relation != HAVE_COMMON)continue;\n\n\t\tif(have_Common[info[i].LEFT][info[i].RIGHT] == NO){\n\n\t\t\treturn false;\n\n\t\t}else if(is_Empty[info[i].LEFT] == YES || is_Empty[info[i].RIGHT] == YES){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid func(){\n\n\tint command;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%d %d %d\",&command,&info[i].LEFT,&info[i].RIGHT);\n\n\t\tcommand--;\n\n\t\tinfo[i].LEFT--;\n\t\tinfo[i].RIGHT--;\n\t\tinfo[i].relation = relate_array[command];\n\t}\n\n\t//2分探索で、条件を満たす最大行数を求める\n\tint ans = -1;\n\tint L = 0,R = M-1,MID = (L+R)/2;\n\n\twhile(L <= R){\n\n\t\tif(check(MID)){\n\n\t\t\tans = MID;\n\t\t\tL = MID+1;\n\n\t\t}else{\n\n\t\t\tR = MID-1;\n\t\t}\n\t\tMID = (L+R)/2;\n\t}\n\n\tprintf(\"%d\\n\",ans+1);\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":4730,"memory_kb":3424,"score_of_the_acc":-1.0763,"final_rank":13},{"submission_id":"aoj_1332_1696925","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define all(c) c.begin(),c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\nusing namespace std;\nint N,M,t[10000],v[10000],u[10000];\nbool can(int M){\n\tbool e[100][100]={},emp[10000]={},no[100][100]={};\n\trep(i,N) e[i][i]=1;\n\trep(i,M){\n\t\tif(t[i]==1) e[u[i]][v[i]]=1;\n\t\tif(t[i]==2) e[u[i]][v[i]]=e[v[i]][u[i]]=1;\n\t}\n\trep(i,N) rep(j,N) rep(k,N) e[j][k]|=(e[j][i]&&e[i][k]);\n\trep(i,M){\n\t\tif(t[i]==4){\n\t\t\tint a=v[i],b=u[i];\n\t\t\trep(c,N) if(e[a][c]&&e[b][c]) emp[c]=1;\n\t\t\tno[a][b]=no[b][a]=1;\n\t\t}\n\t}\n\trep(i,N) if(emp[i]){\n\t\trep(j,N) if(e[i][j]) emp[j]=1;\n\t}\n\trep(i,N) rep(j,N) if(no[i][j]){\n\t\trep(I,N) rep(J,N){\n\t\t\tif(e[i][I]&&e[j][J]){\n\t\t\t\tno[I][J]=1;\n\t\t\t}\n\t\t}\n\t}\n\t// puts(\"no\");\n\t// rep(i,N){\n\t// \trep(j,N) cout<<no[i][j]<<\" \";\n\t// \tputs(\"\");\n\t// }\n\trep(i,M){\n\t\tint a=v[i],b=u[i];\n\t\tif(t[i]==3){\n\t\t\tif(emp[a]&&emp[b]) return 0;\n\t\t\tif(e[a][b]&&e[b][a]) return 0;\n\t\t}\n\t\tif(t[i]==5){\n\t\t\tif(emp[a]||emp[b]) return 0;\n\t\t\tif(no[a][b]) return 0;\n\t\t}\n\t}\n\treturn 1;\n}\nint main(){\n\twhile(true){\n\t\tcin>>N>>M;\n\t\tif(N==0) break;\n\t\trep(i,M){\n\t\t\tcin>>t[i]>>v[i]>>u[i],v[i]--,u[i]--;\n\t\t}\n\t\tint ub=M+1,lb=0;\n\t\twhile(ub-lb>1){\n\t\t\tint m=(ub+lb)/2;\n\t\t\tif(can(m)) lb=m;\n\t\t\telse ub=m;\n\t\t}\n\t\tcout<<lb<<endl;\n\t}\n}","accuracy":1,"time_ms":3740,"memory_kb":3160,"score_of_the_acc":-0.8563,"final_rank":12},{"submission_id":"aoj_1332_1261646","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<string>\n#include<algorithm>\n#include<iostream>\n#include<vector>\n#include<queue>\n#include<map>\n#include<set>\n#include<stack>\n\n#define msn(x) (memset((x),0,sizeof((x))))\n#define msi(x) (memset((x),-1,sizeof((x))))\n#define msx(x) (memset((x),0x7f,sizeof((x))))\n#define fuck(x) cerr << #x << \" <- \" << x << endl\n#define acer cout<<\"sb\"<<endl\ntypedef long long ll;\nusing namespace std;\nconst int maxn=107;\nconst int maxm=1e4+7;\nstruct node\n{\n int o,u,v;\n}q[maxm];\nvector<node>cmp;\nint n,m;\nbool dp[maxn][maxn];\nbool emp[maxn][maxn];\nvector<int>a,b;\nbool check(int x)\n{\n //queue< pair<int ,int> >q;\n cmp.clear();\n msn(dp);\n msn(emp);\n for(int i=1;i<=n;i++)dp[i][i]=1;\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==1)\n {\n dp[now.u][now.v]=1;\n }\n else if(now.o==2)\n {\n dp[now.u][now.v]=dp[now.v][now.u]=1;\n }\n }\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n for(int k=1;k<=n;k++)\n dp[j][k]|=(dp[j][i]&&dp[i][k]);\n }\n }\n\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==4)cmp.push_back(now);\n }\n // random_shuffle(cmp.begin(),cmp.end());\n for(int z=0;z<cmp.size();z++)\n {\n node &now=cmp[z];\n if(emp[now.u][now.v])continue;\n a.clear(),b.clear();\n for(int i=1;i<=n;i++)if(dp[i][now.u])a.push_back(i);\n for(int i=1;i<=n;i++)if(dp[i][now.v])b.push_back(i);\n for(int i=0;i<a.size();i++)\n {\n for(int j=0;j<b.size();j++)\n emp[b[j]][a[i]]=emp[a[i]][b[j]]=1;\n }\n }\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==5)\n {\n if(emp[now.u][now.v]||emp[now.u][now.u]||emp[now.v][now.v])return 0;\n }\n }\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==3)\n {\n if(emp[now.u][now.u]==1&&emp[now.v][now.v]==1)return 0;\n if(dp[now.u][now.v]==1&&dp[now.v][now.u]==1)return 0;\n }\n }\n return 1;\n}\nint main()\n{\n while(scanf(\"%d %d\",&n,&m))\n {\n if(n==0&&m==0)break;\n for(int i=0;i<m;i++)\n {\n scanf(\"%d%d%d\",&q[i].o,&q[i].u,&q[i].v);\n }\n int l=0,r=m;\n while(l<r)\n {\n int mid=(l+r)/2+1;\n if(check(mid))l=mid;\n else r=mid-1;\n }\n printf(\"%d\\n\",l);\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":1556,"score_of_the_acc":-0.0668,"final_rank":6},{"submission_id":"aoj_1332_1261644","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<string>\n#include<algorithm>\n#include<iostream>\n#include<vector>\n#include<queue>\n#include<map>\n#include<set>\n#include<stack>\n\n#define msn(x) (memset((x),0,sizeof((x))))\n#define msi(x) (memset((x),-1,sizeof((x))))\n#define msx(x) (memset((x),0x7f,sizeof((x))))\n#define fuck(x) cerr << #x << \" <- \" << x << endl\n#define acer cout<<\"sb\"<<endl\ntypedef long long ll;\nusing namespace std;\nconst int maxn=107;\nconst int maxm=1e4+7;\nstruct node\n{\n int o,u,v;\n}q[maxm];\nvector<node>cmp;\nint n,m;\nbool dp[maxn][maxn];\nbool emp[maxn][maxn];\nvector<int>a,b;\nbool check(int x)\n{\n //queue< pair<int ,int> >q;\n cmp.clear();\n msn(dp);\n msn(emp);\n for(int i=1;i<=n;i++)dp[i][i]=1;\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==1)\n {\n dp[now.u][now.v]=1;\n }\n else if(now.o==2)\n {\n dp[now.u][now.v]=dp[now.v][now.u]=1;\n }\n }\n for(int i=1;i<=n;i++)\n {\n for(int j=1;j<=n;j++)\n {\n for(int k=1;k<=n;k++)\n dp[j][k]|=(dp[j][i]&&dp[i][k]);\n }\n }\n\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==4)cmp.push_back(now);\n }\n random_shuffle(cmp.begin(),cmp.end());\n for(int z=0;z<cmp.size();z++)\n {\n node &now=cmp[z];\n if(emp[now.u][now.v])continue;\n a.clear(),b.clear();\n for(int i=1;i<=n;i++)if(dp[i][now.u])a.push_back(i);\n for(int i=1;i<=n;i++)if(dp[i][now.v])b.push_back(i);\n for(int i=0;i<a.size();i++)\n {\n for(int j=0;j<b.size();j++)\n emp[b[j]][a[i]]=emp[a[i]][b[j]]=1;\n }\n }\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==5)\n {\n if(emp[now.u][now.v]||emp[now.u][now.u]||emp[now.v][now.v])return 0;\n }\n }\n for(int i=0;i<x;i++)\n {\n node &now=q[i];\n if(now.o==3)\n {\n if(emp[now.u][now.u]==1&&emp[now.v][now.v]==1)return 0;\n if(dp[now.u][now.v]==1&&dp[now.v][now.u]==1)return 0;\n }\n }\n return 1;\n}\nint main()\n{\n while(scanf(\"%d %d\",&n,&m))\n {\n if(n==0&&m==0)break;\n for(int i=0;i<m;i++)\n {\n scanf(\"%d%d%d\",&q[i].o,&q[i].u,&q[i].v);\n }\n int l=0,r=m;\n while(l<r)\n {\n int mid=(l+r)/2+1;\n if(check(mid))l=mid;\n else r=mid-1;\n }\n printf(\"%d\\n\",l);\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":1556,"score_of_the_acc":-0.0668,"final_rank":6},{"submission_id":"aoj_1332_1235793","code_snippet":"#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n\nusing namespace std;\n\nint M;\nint type[10100],is[10100],js[10100];\n\nvector<int> G[200];\nbool reached[200];\nint N;\n\nvoid init_graph(){\n\tfor(int i=0;i<N*2;i++) G[i].clear();\n}\n\nvoid add_edge(int t,int i,int j){\n\tif(t==1){\n\t\tG[i].push_back(j);\n\t\tG[j+N].push_back(i+N);\n\t}else if(t==2){\n\t\tadd_edge(1,i,j);\n\t\tadd_edge(1,j,i);\n\t}else if(t==4){\n\t\tG[i].push_back(j+N);\n\t\tG[j].push_back(i+N);\n\t}\n}\n\nbool bfs(int s1,int s2){\n\tfor(int i=0;i<N*2;i++) reached[i]=false;\n\treached[s1]=true;\n\treached[s2]=true;\n\tqueue<int> que;\n\tque.push(s1);\n\tque.push(s2);\n\twhile(!que.empty()){\n\t\tint v=que.front();\n\t\tque.pop();\n\t\tfor(int i=0;i<G[v].size();i++){\n\t\t\tint u=G[v][i];\n\t\t\tif(reached[u]) continue;\n\t\t\treached[u]=true;\n\t\t\tif(u>=N){\n\t\t\t\tif(reached[u-N]) return false;\n\t\t\t}else{\n\t\t\t\tif(reached[u+N]) return false;\n\t\t\t}\n\t\t\tque.push(u);\n\t\t}\n\t}\n\treturn true;\n}\n\nbool check(int K){\n\tinit_graph();\n\tfor(int i=0;i<K;i++) add_edge(type[i],is[i],js[i]);\n\tbool ok=true;\n\tfor(int i=0;i<K;i++){\n\t\tif(type[i]==3){\n\t\t\tint u=is[i],v=js[i]+N;\n\t\t\tbool flg=bfs(u,v);\n\t\t\tu+=N;\n\t\t\tv-=N;\n\t\t\tbool flg2=bfs(u,v);\n\t\t\tif(flg==false&&flg2==false){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}else if(type[i]==5){\n\t\t\tint u=is[i],v=js[i];\n\t\t\tbool flg=bfs(u,v);\n\t\t\tif(!flg) return false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main(){\n\twhile(true){\n\t\tscanf(\"%d%d\",&N,&M);\n\t\tif(N==0&&M==0) break;\n\t\tfor(int i=0;i<M;i++){\n\t\t\tscanf(\"%d%d%d\",type+i,is+i,js+i);\n\t\t\tis[i]--;js[i]--;\n\t\t}\n\t\tint lb=1,ub=M+1;\n\t\twhile(ub-lb>1){\n\t\t\tint mid=(ub+lb)/2;\n\t\t\tbool flg=check(mid);\n\t\t\tif(flg) lb=mid;\n\t\t\telse ub=mid;\n\t\t}\n\t\tprintf(\"%d\\n\",lb);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":270,"memory_kb":1532,"score_of_the_acc":-0.0617,"final_rank":4},{"submission_id":"aoj_1332_1222767","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <cctype>\nusing namespace std;\n#define N 105\nint n , m;\nstruct query\n{\n int id , x , y;\n}q[N * N];\nbool g[N][N] , f[N][N];\nbool Q(int x , int y)\n{\n for (int i = 1 ; i <= n ; ++ i)\n if (g[x][i] && f[y][i] || g[y][i] && f[x][i])\n return 1;\n return 0;\n}\nbool check(int V)\n{\n int i , j , k, x , y;\n memset(f , 0 , sizeof(f));\n memset(g , 0 , sizeof(g));\n for (i = 1 ; i <= n ; ++ i)\n g[i][i] = 1;\n for (i = 1 ; i <= V ; ++ i)\n if (q[i].id <= 2)\n {\n x = q[i].x , y = q[i].y;\n g[x][y] = 1;\n if (q[i].id == 2)\n g[y][x] = 1;\n }\n for (k = 1 ; k <= n ; ++ k)\n for (i = 1 ; i <= n ; ++ i) if (g[i][k])\n for (j = 1 ; j <= n ; ++ j) if (g[k][j])\n g[i][j] = 1;\n for (i = 1 ; i <= V ; ++ i)\n if (q[i].id == 4)\n {\n x = q[i].x , y = q[i].y;\n /* for (j = 1 ; j <= n ; ++ j) if (g[j][x])\n for (k = 1 ; k <= n ; ++ k) if (g[k][y])\n f[j][k] = f[k][j] = 1;*/\n for (j = 1 ; j <= n ; ++ j) if (g[j][x])\n f[j][y] = 1;\n for (j = 1 ; j <= n ; ++ j) if (g[j][y])\n f[j][x] = 1;\n }\n for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) f[i][j] |= f[j][i];\n for (i = 1 ; i <= V ; ++ i)\n {\n x = q[i].x , y = q[i].y;\n if (q[i].id == 3) // x != y\n {// x , y = empty x == y\n if (g[x][y] && g[y][x])\n return 0;\n if (Q(x , x) && Q(y , y))\n return 0;\n }\n else if (q[i].id == 5) // x ins y != empty\n { //x = empty y = empty x ins y == empty\n if (Q(x , x) || Q(y , y) || Q(x , y) || Q(y , x))\n return 0;\n }\n }\n return 1;\n}\n\nint main()\n{\n while (scanf(\"%d%d\",&n,&m))\n {\n \tif(n == 0 && m == 0) break;\n for (int i = 1 ; i <= m ; ++ i)\n scanf(\"%d%d%d\",&q[i].id, &q[i].x , &q[i].y);\n\n int top = 1 , bot = m , mid;\n while (top < bot)\n {\n mid = top + bot + 1 >> 1;\n if (check(mid))\n top = mid;\n else\n bot = mid - 1;\n }\n printf(\"%d\\n\" , top);\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":1156,"score_of_the_acc":-0.0405,"final_rank":3},{"submission_id":"aoj_1332_1046508","code_snippet":"#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <iostream>\n\nusing namespace std;\n\nconst int MAXN = 1e4+10;\nconst int MAXG = 110;\n\nint n,m;\nint x[MAXN],op[MAXN],y[MAXN];\nint f[MAXG][MAXG],g[MAXG][MAXG];\nbool vis[MAXG] ;\n\nvoid dfs(int u){\n int i, k;\n vis[u] = 1;\n for(i=1;i<=n;i++)\n if(g[u][i]){\n if(!vis[i]) dfs(i);\n for(k=1;k<=n;k++)\n if(f[i][k])\n f[u][k] = f[k][u] = 1;\n }\n}\n\nbool check(int mid) {\n for (int i=1; i<=n; i++)\n for (int j=1; j<=n; j++)\n f[i][j] = 0 ;\n for (int i=1; i<=n; i++) {\n for (int j=1; j<=n; j++) g[i][j]=0;\n g[i][i]=1;\n }\n for (int Q=1; Q<=mid; Q++) {\n int i = x[Q] , j = y[Q] , ope = op[Q];\n if (ope==1) g[i][j] = 1 ;\n else if (ope==2) g[i][j] = g[j][i] = 1 ;\n else if (ope==4) f[i][j] = f[j][i] = 1 ;\n }\n for (int k = 1 ; k <= n ; k++)\n for (int i = 1 ; i <= n ; i++)\n for (int j = 1 ; j <= n ; j++)\n if (g[i][k] && g[k][j]) g[i][j] = 1 ;\n\n memset(vis,0,sizeof(vis));\n for(int i=1;i<=n;i++)\n if(!vis[i]) dfs(i);\n\n for (int Q = 1 ; Q <= mid ; Q++) {\n int i = x[Q] , j = y[Q] , ope = op[Q];\n if (ope==3) {\n if (f[i][i] && f[j][j]) return false ;\n if (g[i][j] && g[j][i]) return false ;\n } else if (ope==5) {\n if (f[i][j] || f[j][i] || f[i][i] || f[j][j]) return false ;\n }\n }\n return true ;\n}\n\nint main() {\n while (~scanf(\"%d%d\",&n,&m) && (n+m)) {\n for (int i=1; i<=m; i++) scanf(\"%d%d%d\",&op[i],&x[i],&y[i]);\n int l=1,r=m,ans=0;\n while (l<=r) {\n int mid=l+r>>1;\n if (check(mid)) {\n ans=mid;\n l=mid+1;\n } else r=mid-1;\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":1400,"score_of_the_acc":-0.0658,"final_rank":5},{"submission_id":"aoj_1332_626123","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n\n#define frs first\n#define scn second\n#define mkp make_pair\n#define phb push_back\n#define ppb pop_back\n\nusing namespace std;\n\ntypedef pair< int, int > Pr;\ntypedef pair< int, Pr > Cmd;\n\nint N, M;\nCmd C[10010];\n\nvector< int > graph[110], stk;\nint dfi, dfn[110], lwn[110], cmp[110];\nint vst[110], vst_cnt;\nbool is_in_stk[110];\n\nbitset< 110 > dscn[110], ancs[110];\nbool is_zero[110], is_nonzero[110];\nbitset< 110 > is_intr[110];\n\nvoid read();\nvoid soups_on();\nbool yee_haw(int);\nvoid tarjan(int);\nvoid dfs(int, int);\n\nint main() {\n ios::sync_with_stdio(false);\n while (cin >> N >> M, N + M)\n read(), soups_on();\n\n return 0;\n}\n\nvoid read() {\n int s, u, v;\n\n for (int i = 0; i < M; ++i)\n cin >> s >> u >> v, C[i] = mkp(s, mkp(u, v));\n}\n\nvoid soups_on() {\n int low, up, mid;\n\n low = 0, up = M;\n while (low < up) {\n mid = (low + up) / 2 + 1;\n if (yee_haw(mid))\n low = mid;\n else\n up = mid - 1;\n }\n\n cout << low << \"\\n\";\n}\n\nbool yee_haw(int lm) {\n int u, v;\n vector< Pr > t[6];\n\n for (int i = 0; i < lm; ++i)\n t[C[i].frs].phb(C[i].scn);\n\n for (int i = 1; i <= N; ++i)\n graph[i].clear();\n\n // build graph\n for (int i = 0; i < int(t[1].size()); ++i) {\n u = t[1][i].frs, v = t[1][i].scn;\n graph[v].phb(u);\n }\n\n for (int i = 0; i < int(t[2].size()); ++i) {\n u = t[2][i].frs, v = t[2][i].scn;\n graph[u].phb(v), graph[v].phb(u);\n }\n\n // find scc\n ++vst_cnt, dfi = 0;\n for (int i = 1; i <= N; ++i)\n if (vst[i] != vst_cnt)\n tarjan(i);\n\n for (int i = 1; i <= N; ++i)\n dscn[i].reset(), ancs[i].reset(), dscn[i].set(i), ancs[i].set(i);\n\n // find descendants and ancestors\n for (int i = 1; i <= N; ++i)\n if (cmp[i] == i)\n ++vst_cnt, dfs(i, i);\n\n fill(&is_zero[0], &is_zero[N + 1], false);\n fill(&is_nonzero[0], &is_nonzero[N + 1], false);\n\n for (int i = 1; i <= N; ++i)\n is_intr[i].reset();\n\n // dealing with constraint type 5\n\n for (int i = 0; i < int(t[5].size()); ++i) {\n u = cmp[t[5][i].frs], v = cmp[t[5][i].scn];\n bitset< 110 > tmp = ancs[u] | ancs[v];\n for (int j = 1; j <= N; ++j)\n if (ancs[u][j] || ancs[v][j])\n is_nonzero[j] = true, is_intr[j] |= tmp;\n }\n\n // dealing with constraint type 4\n for (int i = 0; i < int(t[4].size()); ++i) {\n u = cmp[t[4][i].frs], v = cmp[t[4][i].scn];\n if (u == v)\n is_zero[u] = true;\n else {\n if (is_intr[u][v])\n return false;\n bitset< 110 > tmp = dscn[u] & dscn[v];\n for (int j = 1; j <= N; ++j)\n if (tmp[j])\n is_zero[j] = true;\n }\n }\n\n // dealing with constraint type 3\n for (int i = 0; i < int(t[3].size()); ++i) {\n u = cmp[t[3][i].frs], v = cmp[t[3][i].scn];\n if (u == v) return false;\n if (is_zero[u] && is_zero[v]) return false;\n }\n\n // dealing with other confliction between constraint type 4 and 5\n for (int i = 1; i <= N; ++i)\n if (cmp[i] == i && (is_zero[i] && is_nonzero[i]))\n return false;\n\n return true;\n}\n\nvoid tarjan(int u) {\n int v;\n\n vst[u] = vst_cnt;\n dfn[u] = lwn[u] = ++dfi;\n stk.phb(u), is_in_stk[u] = true;\n\n for (int i = 0; i < int(graph[u].size()); ++i)\n if (vst[v = graph[u][i]] != vst_cnt)\n tarjan(v), lwn[u] = min(lwn[u], lwn[v]);\n else if (is_in_stk[v])\n lwn[u] = min(lwn[u], dfn[v]);\n\n if (dfn[u] == lwn[u]) {\n do {\n v = stk.back(), stk.ppb(), is_in_stk[v] = false;\n cmp[v] = u;\n } while (u != v);\n }\n}\n\nvoid dfs(int u, int k) {\n int v;\n\n vst[u] = vst_cnt;\n for (int i = 0; i < int(graph[u].size()); ++i)\n if (vst[v = graph[u][i]] != vst_cnt) {\n if (cmp[v] == v)\n dscn[k].set(v), ancs[v].set(k);\n dfs(v, k);\n }\n}","accuracy":1,"time_ms":70,"memory_kb":1660,"score_of_the_acc":-0.0234,"final_rank":1},{"submission_id":"aoj_1332_626122","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <bitset>\n\n#define frs first\n#define scn second\n#define mkp make_pair\n#define phb push_back\n#define ppb pop_back\n\nusing namespace std;\n\ntypedef pair< int, int > Pr;\ntypedef pair< int, Pr > Cmd;\n\nint N, M;\nCmd C[10010];\n\nvector< int > graph[110], stk;\nint dfi, dfn[110], lwn[110], cmp[110];\nint vst[110], vst_cnt;\nbool is_in_stk[110];\n\nbitset< 110 > dscn[110], ancs[110];\nbool is_zero[110], is_nonzero[110];\nbitset< 110 > is_intr[110];\n\nvoid read();\nvoid soups_on();\nbool yee_haw(int);\nvoid tarjan(int);\nvoid dfs(int, int);\n\nint main() {\n while (cin >> N >> M, N + M)\n read(), soups_on();\n\n return 0;\n}\n\nvoid read() {\n int s, u, v;\n\n for (int i = 0; i < M; ++i)\n cin >> s >> u >> v, C[i] = mkp(s, mkp(u, v));\n}\n\nvoid soups_on() {\n int low, up, mid;\n\n low = 0, up = M;\n while (low < up) {\n mid = (low + up) / 2 + 1;\n if (yee_haw(mid))\n low = mid;\n else\n up = mid - 1;\n }\n\n cout << low << \"\\n\";\n}\n\nbool yee_haw(int lm) {\n int u, v;\n vector< Pr > t[6];\n\n for (int i = 0; i < lm; ++i)\n t[C[i].frs].phb(C[i].scn);\n\n for (int i = 1; i <= N; ++i)\n graph[i].clear();\n\n // build graph\n for (int i = 0; i < int(t[1].size()); ++i) {\n u = t[1][i].frs, v = t[1][i].scn;\n graph[v].phb(u);\n }\n\n for (int i = 0; i < int(t[2].size()); ++i) {\n u = t[2][i].frs, v = t[2][i].scn;\n graph[u].phb(v), graph[v].phb(u);\n }\n\n // find scc\n ++vst_cnt, dfi = 0;\n for (int i = 1; i <= N; ++i)\n if (vst[i] != vst_cnt)\n tarjan(i);\n\n for (int i = 1; i <= N; ++i)\n dscn[i].reset(), ancs[i].reset(), dscn[i].set(i), ancs[i].set(i);\n\n // find descendants and ancestors\n for (int i = 1; i <= N; ++i)\n if (cmp[i] == i)\n ++vst_cnt, dfs(i, i);\n\n fill(&is_zero[0], &is_zero[N + 1], false);\n fill(&is_nonzero[0], &is_nonzero[N + 1], false);\n\n for (int i = 1; i <= N; ++i)\n is_intr[i].reset();\n\n // dealing with constraint type 5\n\n for (int i = 0; i < int(t[5].size()); ++i) {\n u = cmp[t[5][i].frs], v = cmp[t[5][i].scn];\n bitset< 110 > tmp = ancs[u] | ancs[v];\n for (int j = 1; j <= N; ++j)\n if (ancs[u][j] || ancs[v][j])\n is_nonzero[j] = true, is_intr[j] |= tmp;\n }\n\n // dealing with constraint type 4\n for (int i = 0; i < int(t[4].size()); ++i) {\n u = cmp[t[4][i].frs], v = cmp[t[4][i].scn];\n if (u == v)\n is_zero[u] = true;\n else {\n if (is_intr[u][v])\n return false;\n bitset< 110 > tmp = dscn[u] & dscn[v];\n for (int j = 1; j <= N; ++j)\n if (tmp[j])\n is_zero[j] = true;\n }\n }\n\n // dealing with constraint type 3\n for (int i = 0; i < int(t[3].size()); ++i) {\n u = cmp[t[3][i].frs], v = cmp[t[3][i].scn];\n if (u == v) return false;\n if (is_zero[u] && is_zero[v]) return false;\n }\n\n // dealing with other confliction between constraint type 4 and 5\n for (int i = 1; i <= N; ++i)\n if (cmp[i] == i && (is_zero[i] && is_nonzero[i]))\n return false;\n\n return true;\n}\n\nvoid tarjan(int u) {\n int v;\n\n vst[u] = vst_cnt;\n dfn[u] = lwn[u] = ++dfi;\n stk.phb(u), is_in_stk[u] = true;\n\n for (int i = 0; i < int(graph[u].size()); ++i)\n if (vst[v = graph[u][i]] != vst_cnt)\n tarjan(v), lwn[u] = min(lwn[u], lwn[v]);\n else if (is_in_stk[v])\n lwn[u] = min(lwn[u], dfn[v]);\n\n if (dfn[u] == lwn[u]) {\n do {\n v = stk.back(), stk.ppb(), is_in_stk[v] = false;\n cmp[v] = u;\n } while (u != v);\n }\n}\n\nvoid dfs(int u, int k) {\n int v;\n\n vst[u] = vst_cnt;\n for (int i = 0; i < int(graph[u].size()); ++i)\n if (vst[v = graph[u][i]] != vst_cnt) {\n if (cmp[v] == v)\n dscn[k].set(v), ancs[v].set(k);\n dfs(v, k);\n }\n}","accuracy":1,"time_ms":110,"memory_kb":1648,"score_of_the_acc":-0.0315,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1332_10851055\",\n \"code_snippet\": \"#include <cstring>\\n#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n\\nusing namespace std;\\n\\nconst int MAXN = 1e4+10;\\nconst int MAXG = 110;\\n\\nint n,m;\\nint x[MAXN],op[MAXN],y[MAXN];\\n\\nint f[MAXG][MAXG],g[MAXG][MAXG];\\nbool check(int mid) {\\n for (int i=1; i<=n; i++)\\n for (int j=1; j<=n; j++)\\n f[i][j] = 0 ;\\n for (int i=1; i<=n; i++) {\\n for (int j=1; j<=n; j++) g[i][j]=0;\\n g[i][i]=1;\\n }\\n for (int Q=1; Q<=mid; Q++) {\\n int i = x[Q] , j = y[Q] , ope = op[Q];\\n if (ope==1) g[i][j] = 1 ;\\n else if (ope==2) g[i][j] = g[j][i] = 1 ;\\n else if (ope==4) f[i][j] = f[j][i] = 1 ;\\n }\\n for (int k = 1 ; k <= n ; k++)\\n for (int i = 1 ; i <= n ; i++)\\n for (int j = 1 ; j <= n ; j++)\\n if (g[i][k] && g[k][j]) g[i][j] = 1 ;\\n\\n for (int k = 1 ; k <= n ; k++)\\n for (int i = 1 ; i <= n ; i++)\\n for (int j = 1 ; j <= n ; j++)\\n if (f[i][k] && g[j][k]) f[i][j] = f[j][i] = 1 ;\\n\\n for (int Q = 1 ; Q <= mid ; Q++) {\\n int i = x[Q] , j = y[Q] , ope = op[Q];\\n if (ope==3) {\\n if (f[i][i] && f[j][j]) return false ;\\n if (g[i][j] && g[j][i]) return false ;\\n } else if (ope==5) {\\n if (f[i][j] || f[j][i] || f[i][i] || f[j][j]) return false ;\\n }\\n }\\n return true ;\\n}\\n\\nint main() {\\n while (~scanf(\\\"%d%d\\\",&n,&m) && (n+m)) {\\n for (int i=1; i<=m; i++) scanf(\\\"%d%d%d\\\",&op[i],&x[i],&y[i]);\\n int l=1,r=m,ans=0;\\n while (l<=r) {\\n int mid=l+r>>1;\\n if (check(mid)) {\\n ans=mid;\\n l=mid+1;\\n } else r=mid-1;\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.1514,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1332_8322631\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct info {\\n\\tint t, a, b;\\n};\\n\\nbool solve(int N, int M, const vector<info>& I) {\\n\\tvector<vector<bool> > adj(N, vector<bool>(N, false));\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 1) {\\n\\t\\t\\tadj[s.a][s.b] = true;\\n\\t\\t}\\n\\t\\tif (s.t == 2) {\\n\\t\\t\\tadj[s.a][s.b] = true;\\n\\t\\t\\tadj[s.b][s.a] = true;\\n\\t\\t}\\n\\t}\\n\\tvector<vector<bool> > reach = adj;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\treach[i][i] = true;\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tif (reach[j][i] && reach[i][k]) {\\n\\t\\t\\t\\t\\treach[j][k] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<vector<bool> > sameval(N, vector<bool>(N, false));\\n\\tvector<int> empty(N, -1);\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 4) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[i][s.a] && reach[i][s.b]) {\\n\\t\\t\\t\\t\\tif (empty[i] == 0) {\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tempty[i] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (s.t == 5) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[s.a][i] || reach[s.b][i]) {\\n\\t\\t\\t\\t\\tif (empty[i] == 1) {\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tempty[i] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 5) {\\n\\t\\t\\tvector<int> v;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[s.a][i] || reach[s.b][i]) {\\n\\t\\t\\t\\t\\tv.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i : v) {\\n\\t\\t\\t\\tfor (int j : v) {\\n\\t\\t\\t\\t\\tsameval[i][j] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 3 && ((reach[s.a][s.b] && reach[s.b][s.a]) || (empty[s.a] == 1 && empty[s.b] == 1))) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif (s.t == 4 && sameval[s.a][s.b]) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<info> I(M);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tcin >> I[i].t >> I[i].a >> I[i].b;\\n\\t\\t\\tI[i].a -= 1;\\n\\t\\t\\tI[i].b -= 1;\\n\\t\\t}\\n\\t\\tint l = 0, r = M + 1;\\n\\t\\twhile (r - l > 1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tvector<info> J(I.begin(), I.begin() + m);\\n\\t\\t\\tif (solve(N, M, J)) {\\n\\t\\t\\t\\tl = m;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tr = m;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << l << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.1469,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1332_8321954\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nclass unionfind {\\nprivate:\\n\\tint n;\\n\\tvector<int> par;\\npublic:\\n\\tunionfind() : n(0), par(vector<int>()) {}\\n\\tunionfind(int n_) : n(n_) {\\n\\t\\tpar.resize(n);\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint root(int x) {\\n\\t\\tif (x == par[x]) {\\n\\t\\t\\treturn x;\\n\\t\\t}\\n\\t\\treturn par[x] = root(par[x]);\\n\\t}\\n\\tvoid link(int x, int y) {\\n\\t\\tx = root(x);\\n\\t\\ty = root(y);\\n\\t\\tpar[y] = x;\\n\\t}\\n\\tbool connected(int x, int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n};\\n\\nstruct info {\\n\\tint t, a, b;\\n};\\n\\nbool solve_dag(int N, int M, const vector<info>& I) {\\n\\tvector<vector<bool> > adj(N, vector<bool>(N, false));\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 1) {\\n\\t\\t\\tadj[s.a][s.b] = true;\\n\\t\\t}\\n\\t}\\n\\tvector<vector<bool> > reach = adj;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\treach[i][i] = true;\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tif (reach[j][i] && reach[i][k]) {\\n\\t\\t\\t\\t\\treach[j][k] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<vector<bool> > sameval(N, vector<bool>(N, false));\\n\\tvector<int> empty(N, -1);\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 4) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[i][s.a] && reach[i][s.b]) {\\n\\t\\t\\t\\t\\tif (empty[i] == 0) {\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tempty[i] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (s.t == 5) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[s.a][i] || reach[s.b][i]) {\\n\\t\\t\\t\\t\\tif (empty[i] == 1) {\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tempty[i] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tunionfind uf(N);\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 5) {\\n\\t\\t\\tvector<int> v;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (reach[s.a][i] || reach[s.b][i]) {\\n\\t\\t\\t\\t\\tv.push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i : v) {\\n\\t\\t\\t\\tfor (int j : v) {\\n\\t\\t\\t\\t\\tsameval[i][j] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 3 && (s.a == s.b || (empty[s.a] == 1 && empty[s.b] == 1))) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif (s.t == 4 && sameval[s.a][s.b]) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nbool solve(int N, int M, const vector<info>& I) {\\n\\tvector<vector<bool> > adj(N, vector<bool>(N, false));\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 1) {\\n\\t\\t\\tadj[s.a][s.b] = true;\\n\\t\\t}\\n\\t\\tif (s.t == 2) {\\n\\t\\t\\tadj[s.a][s.b] = true;\\n\\t\\t\\tadj[s.b][s.a] = true;\\n\\t\\t}\\n\\t}\\n\\tvector<bool> vis(N, false);\\n\\tvector<int> ord;\\n\\tauto dfs1 = [&](auto& self, int pos) -> void {\\n\\t\\tvis[pos] = true;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (adj[pos][i] && !vis[i]) {\\n\\t\\t\\t\\tself(self, i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tord.push_back(pos);\\n\\t};\\n\\tfor (int i = N - 1; i >= 0; i--) {\\n\\t\\tif (!vis[i]) {\\n\\t\\t\\tdfs1(dfs1, i);\\n\\t\\t}\\n\\t}\\n\\treverse(ord.begin(), ord.end());\\n\\tint counter = 0;\\n\\tvector<int> col(N, -1);\\n\\tauto dfs2 = [&](auto& self, int pos) -> void {\\n\\t\\tcol[pos] = counter;\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (adj[i][pos] && col[i] == -1) {\\n\\t\\t\\t\\tself(self, i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tfor (int i : ord) {\\n\\t\\tif (col[i] == -1) {\\n\\t\\t\\tdfs2(dfs2, i);\\n\\t\\t\\tcounter += 1;\\n\\t\\t}\\n\\t}\\n\\tvector<info> J;\\n\\tfor (info s : I) {\\n\\t\\tif (s.t == 1 && col[s.a] != col[s.b]) {\\n\\t\\t\\tJ.push_back(info{1, col[s.a], col[s.b]});\\n\\t\\t}\\n\\t\\tif (s.t >= 3) {\\n\\t\\t\\tJ.push_back(info{s.t, col[s.a], col[s.b]});\\n\\t\\t}\\n\\t}\\n\\treturn solve_dag(counter, J.size(), J);\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tif (N == 0 && M == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<info> I(M);\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tcin >> I[i].t >> I[i].a >> I[i].b;\\n\\t\\t\\tI[i].a -= 1;\\n\\t\\t\\tI[i].b -= 1;\\n\\t\\t}\\n\\t\\tint l = 0, r = M + 1;\\n\\t\\twhile (r - l > 1) {\\n\\t\\t\\tint m = (l + r) / 2;\\n\\t\\t\\tvector<info> J(I.begin(), I.begin() + m);\\n\\t\\t\\tif (solve(N, M, J)) {\\n\\t\\t\\t\\tl = m;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tr = m;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << l << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.1202,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1332_6402290\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\n//constexpr ll mod = 998244353;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\t//if (x == 0)return 0;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tint n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) {\\n\\t\\tif (m < 0 || mod <= m) {\\n\\t\\t\\tm %= mod; if (m < 0)m += mod;\\n\\t\\t}\\n\\t\\tn = m;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 20;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\ntemplate<typename T>\\nvoid addv(vector<T>& v, int loc, T val) {\\n\\tif (loc >= v.size())v.resize(loc + 1, 0);\\n\\tv[loc] += val;\\n}\\n/*const int mn = 100005;\\nbool isp[mn];\\nvector<int> ps;\\nvoid init() {\\n\\tfill(isp + 2, isp + mn, true);\\n\\tfor (int i = 2; i < mn; i++) {\\n\\t\\tif (!isp[i])continue;\\n\\t\\tps.push_back(i);\\n\\t\\tfor (int j = 2 * i; j < mn; j += i) {\\n\\t\\t\\tisp[j] = false;\\n\\t\\t}\\n\\t}\\n}*/\\n\\n//[,val)\\ntemplate<typename T>\\nauto prev_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\tif (res == st.begin())return st.end();\\n\\tres--; return res;\\n}\\n\\n//[val,)\\ntemplate<typename T>\\nauto next_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\treturn res;\\n}\\nusing mP = pair<modint, modint>;\\n\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n//-----------------------------------------\\n\\nstruct graph {\\nprivate:\\n\\tint n;\\n\\tvector<vector<int>> G, rG;\\n\\tvector<bool> used;\\n\\tvector<int> vs;\\n\\n\\tint mk;\\n\\tvector<vector<int>> fG;\\n\\tvector<vector<int>> ori;\\n\\tvector<int> trans;\\npublic:\\n\\tgraph(int sz) {\\n\\t\\tn = sz;\\n\\t\\tG.resize(n);\\n\\t\\trG.resize(n);\\n\\t\\tused.resize(n);\\n\\n\\t\\tfG.resize(n);\\n\\t\\ttrans.resize(n, -1);\\n\\t\\tori.resize(n);\\n\\t}\\n\\tvoid add_edge(int a, int b) {\\n\\t\\tG[a].push_back(b);\\n\\t\\trG[b].push_back(a);\\n\\t}\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\trep(i, G[v].size()) {\\n\\t\\t\\tif (!used[G[v][i]])dfs(G[v][i]);\\n\\t\\t}\\n\\t\\tvs.push_back(v);\\n\\t}\\n\\tvoid rdfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\tqueue<int> q; q.push(v);\\n\\t\\tvector<int> c;\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\tori[k].push_back(id);\\n\\t\\t\\trep(j, rG[id].size()) {\\n\\t\\t\\t\\tint to = rG[id][j];\\n\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[to] = true; q.push(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(c.begin(), c.end());\\n\\t\\tint len = unique(c.begin(), c.end()) - c.begin();\\n\\t\\trep(i, len) {\\n\\t\\t\\tfG[c[i]].push_back(k);\\n\\t\\t}\\n\\t\\trep(i, ori[k].size()) {\\n\\t\\t\\ttrans[ori[k][i]] = k;\\n\\t\\t}\\n\\t}\\n\\tvoid scc() {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (!used[i])dfs(i);\\n\\t\\t}\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tint k = 0;\\n\\t\\tper(i, (int)vs.size()) {\\n\\t\\t\\tif (!used[vs[i]]) {\\n\\t\\t\\t\\trdfs(vs[i], k); k++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmk = k;\\n\\t}\\n\\tbool eq(int a, int b) {\\n\\t\\treturn trans[a] == trans[b];\\n\\t}\\n\\tbool istwosat(int sup) {\\n\\t\\trep(i, sup)if (trans[i] == trans[i + sup])return false;\\n\\t\\treturn true;\\n\\t}\\n};\\n\\nbool can[100][100];\\nbool ss[100][100];\\nint n, m;\\nvoid solve() {\\n\\tvector<int> typ(m), a(m), b(m);\\n\\trep(i, m) {\\n\\t\\tcin >> typ[i] >> a[i] >> b[i];\\n\\t\\ta[i]--; b[i]--;\\n\\t}\\n\\tauto ok = [&](int c) {\\n\\t\\tvector<vector<int>> G(n);\\n\\t\\trep(i, n)rep(j, n) {\\n\\t\\t\\tcan[i][j] = false;\\n\\t\\t}\\n\\t\\trep(i, c) {\\n\\t\\t\\tif (typ[i] == 1) {\\n\\t\\t\\t\\tG[a[i]].push_back(b[i]);\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 2) {\\n\\t\\t\\t\\tG[a[i]].push_back(b[i]);\\n\\t\\t\\t\\tG[b[i]].push_back(a[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, n) {\\n\\t\\t\\tcan[i][i] = true;\\n\\t\\t\\tqueue<int> q; q.push(i);\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\t\\tfor (int to : G[id]) {\\n\\t\\t\\t\\t\\tif (!can[i][to]) {\\n\\t\\t\\t\\t\\t\\tcan[i][to] = true;\\n\\t\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//equal check\\n\\t\\tgraph g(n);\\n\\t\\trep(i, c) {\\n\\t\\t\\tif (typ[i] == 1) {\\n\\t\\t\\t\\tg.add_edge(a[i], b[i]);\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 2) {\\n\\t\\t\\t\\tg.add_edge(a[i], b[i]);\\n\\t\\t\\t\\tg.add_edge(b[i], a[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tg.scc();\\n\\t\\trep(i, c)if (typ[i] == 3) {\\n\\t\\t\\tif (g.eq(a[i], b[i])) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//2-sat about empty set\\n\\t\\tgraph st(2 * n);\\n\\t\\trep(i, c) {\\n\\t\\t\\tif (typ[i] == 1) {\\n\\t\\t\\t\\tst.add_edge(b[i], a[i]);\\n\\t\\t\\t\\tst.add_edge(a[i] + n, b[i] + n);\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 2) {\\n\\t\\t\\t\\tst.add_edge(a[i], b[i]);\\n\\t\\t\\t\\tst.add_edge(b[i], a[i]);\\n\\t\\t\\t\\tst.add_edge(a[i] + n, b[i] + n);\\n\\t\\t\\t\\tst.add_edge(b[i] + n, a[i] + n);\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 3) {\\n\\t\\t\\t\\tst.add_edge(a[i], b[i] + n);\\n\\t\\t\\t\\tst.add_edge(b[i], a[i] + n);\\n\\t\\t\\t\\tif (can[a[i]][b[i]])st.add_edge(b[i], b[i] + n);\\n\\t\\t\\t\\tif (can[b[i]][a[i]])st.add_edge(a[i], a[i] + n);\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 4) {\\n\\t\\t\\t\\tif (can[a[i]][b[i]]) {\\n\\t\\t\\t\\t\\tst.add_edge(a[i] + n, a[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (can[b[i]][a[i]]) {\\n\\t\\t\\t\\t\\tst.add_edge(b[i] + n, b[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (typ[i] == 5) {\\n\\t\\t\\t\\tst.add_edge(a[i], a[i] + n);\\n\\t\\t\\t\\tst.add_edge(b[i], b[i] + n);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//conflict between 4 and 5\\n\\t\\trep(i, n)rep(j, n) {\\n\\t\\t\\tss[i][j] = false;\\n\\t\\t}\\n\\t\\trep(i, c)if (typ[i] == 5) {\\n\\t\\t\\tss[a[i]][b[i]] = ss[b[i]][a[i]] = true;\\n\\t\\t}\\n\\t\\trep(i, n) {\\n\\t\\t\\tqueue<int> q;\\n\\t\\t\\trep(j, n) {\\n\\t\\t\\t\\tif (ss[i][j]) {\\n\\t\\t\\t\\t\\tq.push(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\t\\tfor (int to : G[id]) {\\n\\t\\t\\t\\t\\tif (!ss[i][to]) {\\n\\t\\t\\t\\t\\t\\tss[i][to] = true;\\n\\t\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(j, n) {\\n\\t\\t\\tqueue<int> q;\\n\\t\\t\\trep(i, n)if (ss[i][j])q.push(i);\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\t\\tfor (int to : G[id]) {\\n\\t\\t\\t\\t\\tif (!ss[to][j]) {\\n\\t\\t\\t\\t\\t\\tss[to][j] = true;\\n\\t\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, c)if (typ[i] == 4) {\\n\\t\\t\\tif (ss[a[i]][b[i]])return false;\\n\\t\\t}\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tbool exi = false;\\n\\t\\t\\trep(j, n)if (ss[i][j])exi = true;\\n\\t\\t\\tif (exi)st.add_edge(i, i + n);\\n\\t\\t}\\n\\t\\trep(i, c)if (typ[i] == 4) {\\n\\t\\t\\trep(pre, n) {\\n\\t\\t\\t\\tif (can[pre][a[i]] && can[pre][b[i]]) {\\n\\t\\t\\t\\t\\tst.add_edge(pre+n,pre);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tst.scc();\\n\\t\\t//cout << \\\"nande \\\" << c << \\\"\\\\n\\\";\\n\\t\\tif (!st.istwosat(n)) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\tint le = 0;\\n\\tint ri = m + 1;\\n\\twhile (ri - le > 1) {\\n\\t\\tint x = (le + ri) / 2;\\n\\t\\tif (ok(x))le = x;\\n\\t\\telse ri = x;\\n\\t}\\n\\tcout << le << \\\"\\\\n\\\";\\n\\t\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//while(true)\\n\\t//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile(cin>>n>>m,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 30884,\n \"score_of_the_acc\": -1.0917,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1332_3974896\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n#define FOR(i,a,b) for(int i=(int)(a); i<(int)(b); i++)\\n#define FORR(i,a,b) for(int i=(int)(b)-1; i>=(int)(a); i--)\\n\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pid = pair<int,double>;\\n\\nint n,m;\\nbool ok;\\nbool g[252][252];\\nint ty[12525], xi[12525], xj[12525];\\nvector<int> fook[252][252];\\n\\nvoid f(int id){\\n int s = xi[id], t = xj[id];\\n if(ty[id] == 3){\\n if(g[s][t] && g[t][s]){\\n ok = false;\\n }else if(g[s][s+n] && g[t][t+n]){\\n ok = false;\\n }\\n }else if(ty[id] == 5){\\n if(g[s][s+n] || g[t][t+n]){\\n ok = false;\\n }else if(g[s][t+n] && g[t][s+n]){\\n ok = false;\\n }\\n }\\n}\\n\\nvoid add_edge(int i, int j){\\n if(g[i][j])return;\\n g[i][j] = true;\\n // (i,j) check\\n for(int id : fook[i][j]){\\n f(id);\\n }\\n // add others\\n REP(s,2*n)if(g[s][i] && !g[s][j]){\\n add_edge(s,j);\\n }\\n REP(t,2*n)if(g[j][t] && !g[i][t]){\\n add_edge(i,t);\\n }\\n if(i+n==j){\\n REP(s,n)if(g[s][i]){\\n add_edge(i,s);\\n add_edge(s,s+n);\\n add_edge(s+n,i+n);\\n }\\n }\\n if(i<n && j<n && g[j][j+n] && !g[j][i]){\\n add_edge(i,i+n);\\n add_edge(j,i);\\n add_edge(i+n,j+n);\\n }\\n}\\n\\nint solve(){\\n // initialize\\n ok = true;\\n REP(i,2*n)REP(j,2*n)g[i][j] = false;\\n REP(i,2*n)REP(j,2*n)fook[i][j].clear();\\n REP(i,m){\\n int s = xi[i], t = xj[i];\\n if(ty[i]==1){\\n add_edge(s,t);\\n add_edge(t+n,s+n);\\n }else if(ty[i]==2){\\n add_edge(s,t);\\n add_edge(t+n,s+n);\\n add_edge(t,s);\\n add_edge(s+n,t+n);\\n }else if(ty[i]==4){\\n add_edge(s,t+n);\\n add_edge(t,s+n);\\n }else if(ty[i]==3){\\n f(i);\\n fook[s][s+n].push_back(i);\\n fook[t][t+n].push_back(i);\\n fook[s][t].push_back(i);\\n fook[t][s].push_back(i);\\n }else if(ty[i]==5){\\n f(i);\\n fook[s][s+n].push_back(i);\\n fook[t][t+n].push_back(i);\\n fook[s][t+n].push_back(i);\\n fook[t][s+n].push_back(i);\\n }\\n if(!ok){\\n return i;\\n }\\n }\\n return m;\\n}\\n\\nint naive(){\\n int n2 = 1<<n;\\n int ans = 0;\\n REP(s,1<<n2){\\n vector<int> ss(n);\\n REP(i,n){\\n REP(j,n2)if((j>>i&1) && (s>>j&1))ss[i] += 1<<j;\\n }\\n bool ok = true;\\n REP(i,m){\\n if(ty[i]==1){\\n if((ss[xi[i]] & ss[xj[i]]) != ss[xi[i]])ok=false;\\n }else if(ty[i]==2){\\n if(ss[xi[i]] != ss[xj[i]])ok=false;\\n }else if(ty[i]==3){\\n if(ss[xi[i]] == ss[xj[i]])ok=false;\\n }else if(ty[i]==4){\\n if((ss[xi[i]] & ss[xj[i]]) != 0)ok=false;\\n }else if(ty[i]==5){\\n if((ss[xi[i]] & ss[xj[i]]) == 0)ok=false;\\n }\\n if(!ok){\\n ans = max(ans, i);\\n break;\\n }\\n }\\n if(ok){\\n ans = m;\\n break;\\n }\\n }\\n return ans;\\n}\\n\\nint main(){\\n while(false){\\n n = 3;\\n m = 8;\\n REP(i,m){\\n ty[i] = rand() % 5 + 1;\\n xi[i] = rand() % n;\\n xj[i] = rand() % (n-1);\\n if(xj[i] >= xi[i])xj[i]++;\\n }\\n int ans1 = solve();\\n int ans2 = naive();\\n if(ans1 != ans2){\\n printf(\\\"%d %d\\\\n\\\", n,m);\\n REP(i,m)printf(\\\"%d %d %d\\\\n\\\",ty[i],xi[i]+1,xj[i]+1);\\n printf(\\\"ans1: %d\\\\n\\\",ans1);\\n printf(\\\"ans2: %d\\\\n\\\",ans2);\\n return 0;\\n }\\n }\\n while(true){\\n scanf(\\\"%d%d\\\",&n,&m);\\n if(n+m==0)break;\\n REP(i,m)scanf(\\\"%d%d%d\\\",ty+i,xi+i,xj+i),xi[i]--,xj[i]--;\\n printf(\\\"%d\\\\n\\\", solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6572,\n \"score_of_the_acc\": -0.1822,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1332_3711792\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 105\\n\\nenum Type{\\n\\tYES,\\n\\tNO,\\n\\tUNDEFINED,\\n};\\n\\nenum Relation{\\n\\tIS_SUBSET_OF,\\n\\tEQUAL,\\n\\tDIFFERENT,\\n\\tNO_COMMON,\\n\\tHAVE_COMMON,\\n};\\n\\nstruct Info{\\n\\tRelation relation;\\n\\tint LEFT,RIGHT;\\n};\\n\\nint N,M;\\nInfo info[SIZE*SIZE];\\nType is_Empty[SIZE],is_Subset[SIZE][SIZE],have_Common[SIZE][SIZE];\\nRelation relate_array[5] = {IS_SUBSET_OF,EQUAL,DIFFERENT,NO_COMMON,HAVE_COMMON};\\n\\n\\nbool func_Empty(int base){ //baseが新しく空集合であることが確定した\\n\\n\\t//空集合の部分集合は、全て空集合でなければならない\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(is_Subset[i][base] == YES){\\n\\t\\t\\tif(is_Empty[i] == NO){\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tis_Empty[i] = YES;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//空集合とHAVE_COMMONな要素があってはならない\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(i != base){\\n\\t\\t\\tif(have_Common[i][base] == YES){\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\thave_Common[i][base] = NO;\\n\\t\\t\\t\\thave_Common[base][i] = NO;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nbool check(int MID){\\n\\n\\t//テーブルの初期化\\n\\n\\t//空集合かどうか\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tis_Empty[i] = UNDEFINED;\\n\\t}\\n\\n\\t//部分集合かどうか\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(k == i){\\n\\n\\t\\t\\t\\tis_Subset[k][i] = YES;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\n\\t\\t\\t\\tis_Subset[k][i] = UNDEFINED;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//共通の要素があるかどうか\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\thave_Common[k][i] = UNDEFINED; //空集合なら、φ∩Φ = Φ\\n\\t\\t}\\n\\t}\\n\\n\\t//まずは、部分集合関係を演算する\\n\\tfor(int i = 0; i <= MID; i++){\\n\\t\\tif(info[i].relation == IS_SUBSET_OF){\\n\\n\\t\\t\\tis_Subset[info[i].LEFT][info[i].RIGHT] = YES; //LEFTがRIGHTの部分集合\\n\\n\\t\\t}else if(info[i].relation == EQUAL){\\n\\n\\t\\t\\tis_Subset[info[i].LEFT][info[i].RIGHT] = YES;\\n\\t\\t\\tis_Subset[info[i].RIGHT][info[i].LEFT] = YES;\\n\\t\\t}\\n\\t}\\n\\n\\t//ワーシャルフロイドで情報を伝達\\n\\tfor(int mid = 0; mid < N; mid++){\\n\\t\\tfor(int start = 0; start < N; start++){\\n\\t\\t\\tif(is_Subset[start][mid] != YES)continue;\\n\\t\\t\\tfor(int goal = 0; goal < N; goal++){\\n\\t\\t\\t\\tif(is_Subset[mid][goal] != YES)continue;\\n\\n\\t\\t\\t\\tis_Subset[start][goal] = YES;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//共通要素を持つなら空集合ではない\\n\\tfor(int i = 0; i <= MID; i++){\\n\\t\\tif(info[i].relation == HAVE_COMMON){\\n\\t\\t\\tis_Empty[info[i].LEFT] = NO;\\n\\t\\t\\tis_Empty[info[i].RIGHT] = NO;\\n\\n\\t\\t\\thave_Common[info[i].LEFT][info[i].RIGHT] = YES;\\n\\t\\t\\thave_Common[info[i].RIGHT][info[i].LEFT] = YES;\\n\\n\\t\\t\\t//LEFT∩RIGHT != Φなので、[LEFTおよびLEFTとおなじもの]は[RIGHTおよびRIGHTと同じもの]とHAVE_COMMONになる\\n\\t\\t\\tfor(int a = 0; a < N; a++){\\n\\t\\t\\t\\tif(is_Subset[a][info[i].LEFT] == YES && is_Subset[info[i].LEFT][a] == YES){\\n\\t\\t\\t\\t\\tfor(int b = 0; b < N; b++){\\n\\t\\t\\t\\t\\t\\tif(is_Subset[b][info[i].RIGHT] == YES && is_Subset[info[i].RIGHT][b] == YES){\\n\\n\\t\\t\\t\\t\\t\\t\\tis_Empty[a] = NO;\\n\\t\\t\\t\\t\\t\\t\\tis_Empty[b] = NO;\\n\\n\\t\\t\\t\\t\\t\\t\\thave_Common[a][b] = YES;\\n\\t\\t\\t\\t\\t\\t\\thave_Common[b][a] = YES;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//LEFT∩RIGHT = Φの場合を処理\\n\\tfor(int i = 0; i <= MID; i++){\\n\\t\\tif(info[i].relation == NO_COMMON){\\n\\n\\t\\t\\t//LEFT∩RIGHT = Φより、A⊆LEFT,A⊆RIGHTとなるAについて、A = Φが成り立つ\\n\\t\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\t\\tif(is_Subset[k][info[i].LEFT] == YES && is_Subset[k][info[i].RIGHT] == YES){\\n\\n\\t\\t\\t\\t\\tif(is_Empty[k] == NO){\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tis_Empty[k] = YES;\\n\\t\\t\\t\\t\\t\\tif(!func_Empty(k)){ //情報の反映\\n\\t\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//矛盾\\n\\t\\t\\tif(have_Common[info[i].LEFT][info[i].RIGHT] == YES){\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\thave_Common[info[i].LEFT][info[i].RIGHT] = NO;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//LEFT⊆RIGHTでNO_COMMONなら、少なくともLEFTは空集合\\n\\t\\t\\tif(is_Subset[info[i].LEFT][info[i].RIGHT] == YES){\\n\\n\\t\\t\\t\\tif(is_Empty[info[i].LEFT] == NO){\\n\\n\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tis_Empty[info[i].LEFT] = YES;\\n\\t\\t\\t\\t\\tif(!func_Empty(info[i].LEFT)){\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t//RIGHT⊆LEFTでNO_COMMONなら、少なくともRIGHTは空集合\\n\\t\\t\\tif(is_Subset[info[i].RIGHT][info[i].LEFT] == YES){\\n\\t\\t\\t\\tif(is_Empty[info[i].RIGHT] == NO){\\n\\n\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tis_Empty[info[i].RIGHT] = YES;\\n\\t\\t\\t\\t\\tif(!func_Empty(info[i].RIGHT)){\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//DIFFERENTを確認\\n\\tfor(int i = 0; i <= MID; i++){\\n\\t\\tif(info[i].relation != DIFFERENT)continue;\\n\\n\\t\\tif(is_Subset[info[i].LEFT][info[i].RIGHT] == YES &&\\n\\t\\t\\t\\tis_Subset[info[i].RIGHT][info[i].LEFT] == YES){\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}else if(is_Empty[info[i].LEFT] == YES && is_Empty[info[i].RIGHT] == YES){ //両方が空集合なら不可\\n\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\t//emptyをもう一度確認\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(is_Empty[i] != YES)continue;\\n\\n\\t\\t//空集合の部分集合は、全て空集合でなければならない\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(is_Subset[k][i] == YES){\\n\\t\\t\\t\\tif(is_Empty[k] == NO){\\n\\n\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tis_Empty[k] = YES;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//空集合とHAVE_COMMONな要素があってはならない\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(k != i){\\n\\t\\t\\t\\tif(have_Common[k][i] == YES){\\n\\n\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\thave_Common[k][i] = NO;\\n\\t\\t\\t\\t\\thave_Common[i][k] = NO;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//have_Commonの情報を更新\\n\\tfor(int a = 0; a < N; a++){\\n\\t\\tfor(int b = 0; b < N; b++){\\n\\t\\t\\tif(have_Common[a][b] != NO)continue;\\n\\t\\t\\tfor(int c = 0; c < N; c++){\\n\\t\\t\\t\\tif(is_Subset[c][a] != YES)continue;\\n\\t\\t\\t\\tfor(int d = 0; d < N; d++){\\n\\t\\t\\t\\t\\tif(is_Subset[d][b] != YES)continue;\\n\\n\\t\\t\\t\\t\\tif(have_Common[c][d] == YES){\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\thave_Common[c][d] = NO;\\n\\t\\t\\t\\t\\t\\thave_Common[d][c] = NO;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//HAVE_COMMONを最後に確認\\n\\tfor(int i = 0; i <= MID; i++){\\n\\t\\tif(info[i].relation != HAVE_COMMON)continue;\\n\\n\\t\\tif(have_Common[info[i].LEFT][info[i].RIGHT] == NO){\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}else if(is_Empty[info[i].LEFT] == YES || is_Empty[info[i].RIGHT] == YES){\\n\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nvoid func(){\\n\\n\\tint command;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%d %d %d\\\",&command,&info[i].LEFT,&info[i].RIGHT);\\n\\n\\t\\tcommand--;\\n\\n\\t\\tinfo[i].LEFT--;\\n\\t\\tinfo[i].RIGHT--;\\n\\t\\tinfo[i].relation = relate_array[command];\\n\\t}\\n\\n\\t//2分探索で、条件を満たす最大行数を求める\\n\\tint ans = -1;\\n\\tint L = 0,R = M-1,MID = (L+R)/2;\\n\\n\\twhile(L <= R){\\n\\n\\t\\tif(check(MID)){\\n\\n\\t\\t\\tans = MID;\\n\\t\\t\\tL = MID+1;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tR = MID-1;\\n\\t\\t}\\n\\t\\tMID = (L+R)/2;\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans+1);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4730,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1.0763,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1332_1696925\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\\n#define all(c) c.begin(),c.end()\\n#define pb push_back\\n#define fs first\\n#define sc second\\n#define show(x) cout << #x << \\\" = \\\" << x << endl\\n#define chmin(x,y) x=min(x,y)\\n#define chmax(x,y) x=max(x,y)\\nusing namespace std;\\nint N,M,t[10000],v[10000],u[10000];\\nbool can(int M){\\n\\tbool e[100][100]={},emp[10000]={},no[100][100]={};\\n\\trep(i,N) e[i][i]=1;\\n\\trep(i,M){\\n\\t\\tif(t[i]==1) e[u[i]][v[i]]=1;\\n\\t\\tif(t[i]==2) e[u[i]][v[i]]=e[v[i]][u[i]]=1;\\n\\t}\\n\\trep(i,N) rep(j,N) rep(k,N) e[j][k]|=(e[j][i]&&e[i][k]);\\n\\trep(i,M){\\n\\t\\tif(t[i]==4){\\n\\t\\t\\tint a=v[i],b=u[i];\\n\\t\\t\\trep(c,N) if(e[a][c]&&e[b][c]) emp[c]=1;\\n\\t\\t\\tno[a][b]=no[b][a]=1;\\n\\t\\t}\\n\\t}\\n\\trep(i,N) if(emp[i]){\\n\\t\\trep(j,N) if(e[i][j]) emp[j]=1;\\n\\t}\\n\\trep(i,N) rep(j,N) if(no[i][j]){\\n\\t\\trep(I,N) rep(J,N){\\n\\t\\t\\tif(e[i][I]&&e[j][J]){\\n\\t\\t\\t\\tno[I][J]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t// puts(\\\"no\\\");\\n\\t// rep(i,N){\\n\\t// \\trep(j,N) cout<<no[i][j]<<\\\" \\\";\\n\\t// \\tputs(\\\"\\\");\\n\\t// }\\n\\trep(i,M){\\n\\t\\tint a=v[i],b=u[i];\\n\\t\\tif(t[i]==3){\\n\\t\\t\\tif(emp[a]&&emp[b]) return 0;\\n\\t\\t\\tif(e[a][b]&&e[b][a]) return 0;\\n\\t\\t}\\n\\t\\tif(t[i]==5){\\n\\t\\t\\tif(emp[a]||emp[b]) return 0;\\n\\t\\t\\tif(no[a][b]) return 0;\\n\\t\\t}\\n\\t}\\n\\treturn 1;\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>N>>M;\\n\\t\\tif(N==0) break;\\n\\t\\trep(i,M){\\n\\t\\t\\tcin>>t[i]>>v[i]>>u[i],v[i]--,u[i]--;\\n\\t\\t}\\n\\t\\tint ub=M+1,lb=0;\\n\\t\\twhile(ub-lb>1){\\n\\t\\t\\tint m=(ub+lb)/2;\\n\\t\\t\\tif(can(m)) lb=m;\\n\\t\\t\\telse ub=m;\\n\\t\\t}\\n\\t\\tcout<<lb<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3740,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.8563,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1332_1261646\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<cmath>\\n#include<string>\\n#include<algorithm>\\n#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<set>\\n#include<stack>\\n\\n#define msn(x) (memset((x),0,sizeof((x))))\\n#define msi(x) (memset((x),-1,sizeof((x))))\\n#define msx(x) (memset((x),0x7f,sizeof((x))))\\n#define fuck(x) cerr << #x << \\\" <- \\\" << x << endl\\n#define acer cout<<\\\"sb\\\"<<endl\\ntypedef long long ll;\\nusing namespace std;\\nconst int maxn=107;\\nconst int maxm=1e4+7;\\nstruct node\\n{\\n int o,u,v;\\n}q[maxm];\\nvector<node>cmp;\\nint n,m;\\nbool dp[maxn][maxn];\\nbool emp[maxn][maxn];\\nvector<int>a,b;\\nbool check(int x)\\n{\\n //queue< pair<int ,int> >q;\\n cmp.clear();\\n msn(dp);\\n msn(emp);\\n for(int i=1;i<=n;i++)dp[i][i]=1;\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==1)\\n {\\n dp[now.u][now.v]=1;\\n }\\n else if(now.o==2)\\n {\\n dp[now.u][now.v]=dp[now.v][now.u]=1;\\n }\\n }\\n for(int i=1;i<=n;i++)\\n {\\n for(int j=1;j<=n;j++)\\n {\\n for(int k=1;k<=n;k++)\\n dp[j][k]|=(dp[j][i]&&dp[i][k]);\\n }\\n }\\n\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==4)cmp.push_back(now);\\n }\\n // random_shuffle(cmp.begin(),cmp.end());\\n for(int z=0;z<cmp.size();z++)\\n {\\n node &now=cmp[z];\\n if(emp[now.u][now.v])continue;\\n a.clear(),b.clear();\\n for(int i=1;i<=n;i++)if(dp[i][now.u])a.push_back(i);\\n for(int i=1;i<=n;i++)if(dp[i][now.v])b.push_back(i);\\n for(int i=0;i<a.size();i++)\\n {\\n for(int j=0;j<b.size();j++)\\n emp[b[j]][a[i]]=emp[a[i]][b[j]]=1;\\n }\\n }\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==5)\\n {\\n if(emp[now.u][now.v]||emp[now.u][now.u]||emp[now.v][now.v])return 0;\\n }\\n }\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==3)\\n {\\n if(emp[now.u][now.u]==1&&emp[now.v][now.v]==1)return 0;\\n if(dp[now.u][now.v]==1&&dp[now.v][now.u]==1)return 0;\\n }\\n }\\n return 1;\\n}\\nint main()\\n{\\n while(scanf(\\\"%d %d\\\",&n,&m))\\n {\\n if(n==0&&m==0)break;\\n for(int i=0;i<m;i++)\\n {\\n scanf(\\\"%d%d%d\\\",&q[i].o,&q[i].u,&q[i].v);\\n }\\n int l=0,r=m;\\n while(l<r)\\n {\\n int mid=(l+r)/2+1;\\n if(check(mid))l=mid;\\n else r=mid-1;\\n }\\n printf(\\\"%d\\\\n\\\",l);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 1556,\n \"score_of_the_acc\": -0.0668,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1332_1261644\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<cmath>\\n#include<string>\\n#include<algorithm>\\n#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<set>\\n#include<stack>\\n\\n#define msn(x) (memset((x),0,sizeof((x))))\\n#define msi(x) (memset((x),-1,sizeof((x))))\\n#define msx(x) (memset((x),0x7f,sizeof((x))))\\n#define fuck(x) cerr << #x << \\\" <- \\\" << x << endl\\n#define acer cout<<\\\"sb\\\"<<endl\\ntypedef long long ll;\\nusing namespace std;\\nconst int maxn=107;\\nconst int maxm=1e4+7;\\nstruct node\\n{\\n int o,u,v;\\n}q[maxm];\\nvector<node>cmp;\\nint n,m;\\nbool dp[maxn][maxn];\\nbool emp[maxn][maxn];\\nvector<int>a,b;\\nbool check(int x)\\n{\\n //queue< pair<int ,int> >q;\\n cmp.clear();\\n msn(dp);\\n msn(emp);\\n for(int i=1;i<=n;i++)dp[i][i]=1;\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==1)\\n {\\n dp[now.u][now.v]=1;\\n }\\n else if(now.o==2)\\n {\\n dp[now.u][now.v]=dp[now.v][now.u]=1;\\n }\\n }\\n for(int i=1;i<=n;i++)\\n {\\n for(int j=1;j<=n;j++)\\n {\\n for(int k=1;k<=n;k++)\\n dp[j][k]|=(dp[j][i]&&dp[i][k]);\\n }\\n }\\n\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==4)cmp.push_back(now);\\n }\\n random_shuffle(cmp.begin(),cmp.end());\\n for(int z=0;z<cmp.size();z++)\\n {\\n node &now=cmp[z];\\n if(emp[now.u][now.v])continue;\\n a.clear(),b.clear();\\n for(int i=1;i<=n;i++)if(dp[i][now.u])a.push_back(i);\\n for(int i=1;i<=n;i++)if(dp[i][now.v])b.push_back(i);\\n for(int i=0;i<a.size();i++)\\n {\\n for(int j=0;j<b.size();j++)\\n emp[b[j]][a[i]]=emp[a[i]][b[j]]=1;\\n }\\n }\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==5)\\n {\\n if(emp[now.u][now.v]||emp[now.u][now.u]||emp[now.v][now.v])return 0;\\n }\\n }\\n for(int i=0;i<x;i++)\\n {\\n node &now=q[i];\\n if(now.o==3)\\n {\\n if(emp[now.u][now.u]==1&&emp[now.v][now.v]==1)return 0;\\n if(dp[now.u][now.v]==1&&dp[now.v][now.u]==1)return 0;\\n }\\n }\\n return 1;\\n}\\nint main()\\n{\\n while(scanf(\\\"%d %d\\\",&n,&m))\\n {\\n if(n==0&&m==0)break;\\n for(int i=0;i<m;i++)\\n {\\n scanf(\\\"%d%d%d\\\",&q[i].o,&q[i].u,&q[i].v);\\n }\\n int l=0,r=m;\\n while(l<r)\\n {\\n int mid=(l+r)/2+1;\\n if(check(mid))l=mid;\\n else r=mid-1;\\n }\\n printf(\\\"%d\\\\n\\\",l);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 1556,\n \"score_of_the_acc\": -0.0668,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1332_1235793\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint M;\\nint type[10100],is[10100],js[10100];\\n\\nvector<int> G[200];\\nbool reached[200];\\nint N;\\n\\nvoid init_graph(){\\n\\tfor(int i=0;i<N*2;i++) G[i].clear();\\n}\\n\\nvoid add_edge(int t,int i,int j){\\n\\tif(t==1){\\n\\t\\tG[i].push_back(j);\\n\\t\\tG[j+N].push_back(i+N);\\n\\t}else if(t==2){\\n\\t\\tadd_edge(1,i,j);\\n\\t\\tadd_edge(1,j,i);\\n\\t}else if(t==4){\\n\\t\\tG[i].push_back(j+N);\\n\\t\\tG[j].push_back(i+N);\\n\\t}\\n}\\n\\nbool bfs(int s1,int s2){\\n\\tfor(int i=0;i<N*2;i++) reached[i]=false;\\n\\treached[s1]=true;\\n\\treached[s2]=true;\\n\\tqueue<int> que;\\n\\tque.push(s1);\\n\\tque.push(s2);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();\\n\\t\\tque.pop();\\n\\t\\tfor(int i=0;i<G[v].size();i++){\\n\\t\\t\\tint u=G[v][i];\\n\\t\\t\\tif(reached[u]) continue;\\n\\t\\t\\treached[u]=true;\\n\\t\\t\\tif(u>=N){\\n\\t\\t\\t\\tif(reached[u-N]) return false;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(reached[u+N]) return false;\\n\\t\\t\\t}\\n\\t\\t\\tque.push(u);\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nbool check(int K){\\n\\tinit_graph();\\n\\tfor(int i=0;i<K;i++) add_edge(type[i],is[i],js[i]);\\n\\tbool ok=true;\\n\\tfor(int i=0;i<K;i++){\\n\\t\\tif(type[i]==3){\\n\\t\\t\\tint u=is[i],v=js[i]+N;\\n\\t\\t\\tbool flg=bfs(u,v);\\n\\t\\t\\tu+=N;\\n\\t\\t\\tv-=N;\\n\\t\\t\\tbool flg2=bfs(u,v);\\n\\t\\t\\tif(flg==false&&flg2==false){\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}else if(type[i]==5){\\n\\t\\t\\tint u=is[i],v=js[i];\\n\\t\\t\\tbool flg=bfs(u,v);\\n\\t\\t\\tif(!flg) return false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d%d\\\",&N,&M);\\n\\t\\tif(N==0&&M==0) break;\\n\\t\\tfor(int i=0;i<M;i++){\\n\\t\\t\\tscanf(\\\"%d%d%d\\\",type+i,is+i,js+i);\\n\\t\\t\\tis[i]--;js[i]--;\\n\\t\\t}\\n\\t\\tint lb=1,ub=M+1;\\n\\t\\twhile(ub-lb>1){\\n\\t\\t\\tint mid=(ub+lb)/2;\\n\\t\\t\\tbool flg=check(mid);\\n\\t\\t\\tif(flg) lb=mid;\\n\\t\\t\\telse ub=mid;\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",lb);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 1532,\n \"score_of_the_acc\": -0.0617,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1332_1222767\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <vector>\\n#include <cctype>\\nusing namespace std;\\n#define N 105\\nint n , m;\\nstruct query\\n{\\n int id , x , y;\\n}q[N * N];\\nbool g[N][N] , f[N][N];\\nbool Q(int x , int y)\\n{\\n for (int i = 1 ; i <= n ; ++ i)\\n if (g[x][i] && f[y][i] || g[y][i] && f[x][i])\\n return 1;\\n return 0;\\n}\\nbool check(int V)\\n{\\n int i , j , k, x , y;\\n memset(f , 0 , sizeof(f));\\n memset(g , 0 , sizeof(g));\\n for (i = 1 ; i <= n ; ++ i)\\n g[i][i] = 1;\\n for (i = 1 ; i <= V ; ++ i)\\n if (q[i].id <= 2)\\n {\\n x = q[i].x , y = q[i].y;\\n g[x][y] = 1;\\n if (q[i].id == 2)\\n g[y][x] = 1;\\n }\\n for (k = 1 ; k <= n ; ++ k)\\n for (i = 1 ; i <= n ; ++ i) if (g[i][k])\\n for (j = 1 ; j <= n ; ++ j) if (g[k][j])\\n g[i][j] = 1;\\n for (i = 1 ; i <= V ; ++ i)\\n if (q[i].id == 4)\\n {\\n x = q[i].x , y = q[i].y;\\n /* for (j = 1 ; j <= n ; ++ j) if (g[j][x])\\n for (k = 1 ; k <= n ; ++ k) if (g[k][y])\\n f[j][k] = f[k][j] = 1;*/\\n for (j = 1 ; j <= n ; ++ j) if (g[j][x])\\n f[j][y] = 1;\\n for (j = 1 ; j <= n ; ++ j) if (g[j][y])\\n f[j][x] = 1;\\n }\\n for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) f[i][j] |= f[j][i];\\n for (i = 1 ; i <= V ; ++ i)\\n {\\n x = q[i].x , y = q[i].y;\\n if (q[i].id == 3) // x != y\\n {// x , y = empty x == y\\n if (g[x][y] && g[y][x])\\n return 0;\\n if (Q(x , x) && Q(y , y))\\n return 0;\\n }\\n else if (q[i].id == 5) // x ins y != empty\\n { //x = empty y = empty x ins y == empty\\n if (Q(x , x) || Q(y , y) || Q(x , y) || Q(y , x))\\n return 0;\\n }\\n }\\n return 1;\\n}\\n\\nint main()\\n{\\n while (scanf(\\\"%d%d\\\",&n,&m))\\n {\\n \\tif(n == 0 && m == 0) break;\\n for (int i = 1 ; i <= m ; ++ i)\\n scanf(\\\"%d%d%d\\\",&q[i].id, &q[i].x , &q[i].y);\\n\\n int top = 1 , bot = m , mid;\\n while (top < bot)\\n {\\n mid = top + bot + 1 >> 1;\\n if (check(mid))\\n top = mid;\\n else\\n bot = mid - 1;\\n }\\n printf(\\\"%d\\\\n\\\" , top);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 1156,\n \"score_of_the_acc\": -0.0405,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1332_1046508\",\n \"code_snippet\": \"#include <cstring>\\n#include <cstdio>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n\\nusing namespace std;\\n\\nconst int MAXN = 1e4+10;\\nconst int MAXG = 110;\\n\\nint n,m;\\nint x[MAXN],op[MAXN],y[MAXN];\\nint f[MAXG][MAXG],g[MAXG][MAXG];\\nbool vis[MAXG] ;\\n\\nvoid dfs(int u){\\n int i, k;\\n vis[u] = 1;\\n for(i=1;i<=n;i++)\\n if(g[u][i]){\\n if(!vis[i]) dfs(i);\\n for(k=1;k<=n;k++)\\n if(f[i][k])\\n f[u][k] = f[k][u] = 1;\\n }\\n}\\n\\nbool check(int mid) {\\n for (int i=1; i<=n; i++)\\n for (int j=1; j<=n; j++)\\n f[i][j] = 0 ;\\n for (int i=1; i<=n; i++) {\\n for (int j=1; j<=n; j++) g[i][j]=0;\\n g[i][i]=1;\\n }\\n for (int Q=1; Q<=mid; Q++) {\\n int i = x[Q] , j = y[Q] , ope = op[Q];\\n if (ope==1) g[i][j] = 1 ;\\n else if (ope==2) g[i][j] = g[j][i] = 1 ;\\n else if (ope==4) f[i][j] = f[j][i] = 1 ;\\n }\\n for (int k = 1 ; k <= n ; k++)\\n for (int i = 1 ; i <= n ; i++)\\n for (int j = 1 ; j <= n ; j++)\\n if (g[i][k] && g[k][j]) g[i][j] = 1 ;\\n\\n memset(vis,0,sizeof(vis));\\n for(int i=1;i<=n;i++)\\n if(!vis[i]) dfs(i);\\n\\n for (int Q = 1 ; Q <= mid ; Q++) {\\n int i = x[Q] , j = y[Q] , ope = op[Q];\\n if (ope==3) {\\n if (f[i][i] && f[j][j]) return false ;\\n if (g[i][j] && g[j][i]) return false ;\\n } else if (ope==5) {\\n if (f[i][j] || f[j][i] || f[i][i] || f[j][j]) return false ;\\n }\\n }\\n return true ;\\n}\\n\\nint main() {\\n while (~scanf(\\\"%d%d\\\",&n,&m) && (n+m)) {\\n for (int i=1; i<=m; i++) scanf(\\\"%d%d%d\\\",&op[i],&x[i],&y[i]);\\n int l=1,r=m,ans=0;\\n while (l<=r) {\\n int mid=l+r>>1;\\n if (check(mid)) {\\n ans=mid;\\n l=mid+1;\\n } else r=mid-1;\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 1400,\n \"score_of_the_acc\": -0.0658,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1332_626123\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n\\n#define frs first\\n#define scn second\\n#define mkp make_pair\\n#define phb push_back\\n#define ppb pop_back\\n\\nusing namespace std;\\n\\ntypedef pair< int, int > Pr;\\ntypedef pair< int, Pr > Cmd;\\n\\nint N, M;\\nCmd C[10010];\\n\\nvector< int > graph[110], stk;\\nint dfi, dfn[110], lwn[110], cmp[110];\\nint vst[110], vst_cnt;\\nbool is_in_stk[110];\\n\\nbitset< 110 > dscn[110], ancs[110];\\nbool is_zero[110], is_nonzero[110];\\nbitset< 110 > is_intr[110];\\n\\nvoid read();\\nvoid soups_on();\\nbool yee_haw(int);\\nvoid tarjan(int);\\nvoid dfs(int, int);\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n while (cin >> N >> M, N + M)\\n read(), soups_on();\\n\\n return 0;\\n}\\n\\nvoid read() {\\n int s, u, v;\\n\\n for (int i = 0; i < M; ++i)\\n cin >> s >> u >> v, C[i] = mkp(s, mkp(u, v));\\n}\\n\\nvoid soups_on() {\\n int low, up, mid;\\n\\n low = 0, up = M;\\n while (low < up) {\\n mid = (low + up) / 2 + 1;\\n if (yee_haw(mid))\\n low = mid;\\n else\\n up = mid - 1;\\n }\\n\\n cout << low << \\\"\\\\n\\\";\\n}\\n\\nbool yee_haw(int lm) {\\n int u, v;\\n vector< Pr > t[6];\\n\\n for (int i = 0; i < lm; ++i)\\n t[C[i].frs].phb(C[i].scn);\\n\\n for (int i = 1; i <= N; ++i)\\n graph[i].clear();\\n\\n // build graph\\n for (int i = 0; i < int(t[1].size()); ++i) {\\n u = t[1][i].frs, v = t[1][i].scn;\\n graph[v].phb(u);\\n }\\n\\n for (int i = 0; i < int(t[2].size()); ++i) {\\n u = t[2][i].frs, v = t[2][i].scn;\\n graph[u].phb(v), graph[v].phb(u);\\n }\\n\\n // find scc\\n ++vst_cnt, dfi = 0;\\n for (int i = 1; i <= N; ++i)\\n if (vst[i] != vst_cnt)\\n tarjan(i);\\n\\n for (int i = 1; i <= N; ++i)\\n dscn[i].reset(), ancs[i].reset(), dscn[i].set(i), ancs[i].set(i);\\n\\n // find descendants and ancestors\\n for (int i = 1; i <= N; ++i)\\n if (cmp[i] == i)\\n ++vst_cnt, dfs(i, i);\\n\\n fill(&is_zero[0], &is_zero[N + 1], false);\\n fill(&is_nonzero[0], &is_nonzero[N + 1], false);\\n\\n for (int i = 1; i <= N; ++i)\\n is_intr[i].reset();\\n\\n // dealing with constraint type 5\\n\\n for (int i = 0; i < int(t[5].size()); ++i) {\\n u = cmp[t[5][i].frs], v = cmp[t[5][i].scn];\\n bitset< 110 > tmp = ancs[u] | ancs[v];\\n for (int j = 1; j <= N; ++j)\\n if (ancs[u][j] || ancs[v][j])\\n is_nonzero[j] = true, is_intr[j] |= tmp;\\n }\\n\\n // dealing with constraint type 4\\n for (int i = 0; i < int(t[4].size()); ++i) {\\n u = cmp[t[4][i].frs], v = cmp[t[4][i].scn];\\n if (u == v)\\n is_zero[u] = true;\\n else {\\n if (is_intr[u][v])\\n return false;\\n bitset< 110 > tmp = dscn[u] & dscn[v];\\n for (int j = 1; j <= N; ++j)\\n if (tmp[j])\\n is_zero[j] = true;\\n }\\n }\\n\\n // dealing with constraint type 3\\n for (int i = 0; i < int(t[3].size()); ++i) {\\n u = cmp[t[3][i].frs], v = cmp[t[3][i].scn];\\n if (u == v) return false;\\n if (is_zero[u] && is_zero[v]) return false;\\n }\\n\\n // dealing with other confliction between constraint type 4 and 5\\n for (int i = 1; i <= N; ++i)\\n if (cmp[i] == i && (is_zero[i] && is_nonzero[i]))\\n return false;\\n\\n return true;\\n}\\n\\nvoid tarjan(int u) {\\n int v;\\n\\n vst[u] = vst_cnt;\\n dfn[u] = lwn[u] = ++dfi;\\n stk.phb(u), is_in_stk[u] = true;\\n\\n for (int i = 0; i < int(graph[u].size()); ++i)\\n if (vst[v = graph[u][i]] != vst_cnt)\\n tarjan(v), lwn[u] = min(lwn[u], lwn[v]);\\n else if (is_in_stk[v])\\n lwn[u] = min(lwn[u], dfn[v]);\\n\\n if (dfn[u] == lwn[u]) {\\n do {\\n v = stk.back(), stk.ppb(), is_in_stk[v] = false;\\n cmp[v] = u;\\n } while (u != v);\\n }\\n}\\n\\nvoid dfs(int u, int k) {\\n int v;\\n\\n vst[u] = vst_cnt;\\n for (int i = 0; i < int(graph[u].size()); ++i)\\n if (vst[v = graph[u][i]] != vst_cnt) {\\n if (cmp[v] == v)\\n dscn[k].set(v), ancs[v].set(k);\\n dfs(v, k);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1660,\n \"score_of_the_acc\": -0.0234,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1332_626122\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <bitset>\\n\\n#define frs first\\n#define scn second\\n#define mkp make_pair\\n#define phb push_back\\n#define ppb pop_back\\n\\nusing namespace std;\\n\\ntypedef pair< int, int > Pr;\\ntypedef pair< int, Pr > Cmd;\\n\\nint N, M;\\nCmd C[10010];\\n\\nvector< int > graph[110], stk;\\nint dfi, dfn[110], lwn[110], cmp[110];\\nint vst[110], vst_cnt;\\nbool is_in_stk[110];\\n\\nbitset< 110 > dscn[110], ancs[110];\\nbool is_zero[110], is_nonzero[110];\\nbitset< 110 > is_intr[110];\\n\\nvoid read();\\nvoid soups_on();\\nbool yee_haw(int);\\nvoid tarjan(int);\\nvoid dfs(int, int);\\n\\nint main() {\\n while (cin >> N >> M, N + M)\\n read(), soups_on();\\n\\n return 0;\\n}\\n\\nvoid read() {\\n int s, u, v;\\n\\n for (int i = 0; i < M; ++i)\\n cin >> s >> u >> v, C[i] = mkp(s, mkp(u, v));\\n}\\n\\nvoid soups_on() {\\n int low, up, mid;\\n\\n low = 0, up = M;\\n while (low < up) {\\n mid = (low + up) / 2 + 1;\\n if (yee_haw(mid))\\n low = mid;\\n else\\n up = mid - 1;\\n }\\n\\n cout << low << \\\"\\\\n\\\";\\n}\\n\\nbool yee_haw(int lm) {\\n int u, v;\\n vector< Pr > t[6];\\n\\n for (int i = 0; i < lm; ++i)\\n t[C[i].frs].phb(C[i].scn);\\n\\n for (int i = 1; i <= N; ++i)\\n graph[i].clear();\\n\\n // build graph\\n for (int i = 0; i < int(t[1].size()); ++i) {\\n u = t[1][i].frs, v = t[1][i].scn;\\n graph[v].phb(u);\\n }\\n\\n for (int i = 0; i < int(t[2].size()); ++i) {\\n u = t[2][i].frs, v = t[2][i].scn;\\n graph[u].phb(v), graph[v].phb(u);\\n }\\n\\n // find scc\\n ++vst_cnt, dfi = 0;\\n for (int i = 1; i <= N; ++i)\\n if (vst[i] != vst_cnt)\\n tarjan(i);\\n\\n for (int i = 1; i <= N; ++i)\\n dscn[i].reset(), ancs[i].reset(), dscn[i].set(i), ancs[i].set(i);\\n\\n // find descendants and ancestors\\n for (int i = 1; i <= N; ++i)\\n if (cmp[i] == i)\\n ++vst_cnt, dfs(i, i);\\n\\n fill(&is_zero[0], &is_zero[N + 1], false);\\n fill(&is_nonzero[0], &is_nonzero[N + 1], false);\\n\\n for (int i = 1; i <= N; ++i)\\n is_intr[i].reset();\\n\\n // dealing with constraint type 5\\n\\n for (int i = 0; i < int(t[5].size()); ++i) {\\n u = cmp[t[5][i].frs], v = cmp[t[5][i].scn];\\n bitset< 110 > tmp = ancs[u] | ancs[v];\\n for (int j = 1; j <= N; ++j)\\n if (ancs[u][j] || ancs[v][j])\\n is_nonzero[j] = true, is_intr[j] |= tmp;\\n }\\n\\n // dealing with constraint type 4\\n for (int i = 0; i < int(t[4].size()); ++i) {\\n u = cmp[t[4][i].frs], v = cmp[t[4][i].scn];\\n if (u == v)\\n is_zero[u] = true;\\n else {\\n if (is_intr[u][v])\\n return false;\\n bitset< 110 > tmp = dscn[u] & dscn[v];\\n for (int j = 1; j <= N; ++j)\\n if (tmp[j])\\n is_zero[j] = true;\\n }\\n }\\n\\n // dealing with constraint type 3\\n for (int i = 0; i < int(t[3].size()); ++i) {\\n u = cmp[t[3][i].frs], v = cmp[t[3][i].scn];\\n if (u == v) return false;\\n if (is_zero[u] && is_zero[v]) return false;\\n }\\n\\n // dealing with other confliction between constraint type 4 and 5\\n for (int i = 1; i <= N; ++i)\\n if (cmp[i] == i && (is_zero[i] && is_nonzero[i]))\\n return false;\\n\\n return true;\\n}\\n\\nvoid tarjan(int u) {\\n int v;\\n\\n vst[u] = vst_cnt;\\n dfn[u] = lwn[u] = ++dfi;\\n stk.phb(u), is_in_stk[u] = true;\\n\\n for (int i = 0; i < int(graph[u].size()); ++i)\\n if (vst[v = graph[u][i]] != vst_cnt)\\n tarjan(v), lwn[u] = min(lwn[u], lwn[v]);\\n else if (is_in_stk[v])\\n lwn[u] = min(lwn[u], dfn[v]);\\n\\n if (dfn[u] == lwn[u]) {\\n do {\\n v = stk.back(), stk.ppb(), is_in_stk[v] = false;\\n cmp[v] = u;\\n } while (u != v);\\n }\\n}\\n\\nvoid dfs(int u, int k) {\\n int v;\\n\\n vst[u] = vst_cnt;\\n for (int i = 0; i < int(graph[u].size()); ++i)\\n if (vst[v = graph[u][i]] != vst_cnt) {\\n if (cmp[v] == v)\\n dscn[k].set(v), ancs[v].set(k);\\n dfs(v, k);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1648,\n \"score_of_the_acc\": -0.0315,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":791,"cells":{"group_id":{"kind":"string","value":"aoj_1339_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nDragon's Cruller\nDragon's Cruller is a sliding puzzle on a torus. The torus surface is partitioned into nine squares as shown in its development in Figure E.1. Here, two squares with one of the sides on the development labeled with the same letter are adjacent to each other, actually sharing the side. Figure E.2 shows which squares are adjacent to which and in which way. Pieces numbered from 1 through 8 are placed on eight out of the nine squares, leaving the remaining one empty.\nFigure E.1. A 3 × 3 Dragon’s Cruller torus\nA piece can be slid to an empty square from one of its adjacent squares. The goal of the puzzle is, by sliding pieces a number of times, to reposition the pieces from the given starting arrangement into the given goal arrangement. Figure E.3 illustrates arrangements directly reached from the arrangement shown in the center after four possible slides. The cost to slide a piece depends on the direction but is independent of the position nor the piece.\nYour mission is to find the minimum cost required to reposition the pieces from the given starting\narrangement into the given goal arrangement.\nFigure E.2. Adjacency\nFigure E.3. Examples of sliding steps\nUnlike some sliding puzzles on a flat square, it is known that any goal arrangement can be reached from any starting arrangements on this torus.\nInput\nThe input is a sequence of at most 30 datasets.\nA dataset consists of seven lines. The first line contains two positive integers\nc\nh\nand\nc\nv\n, which represent the respective costs to move a piece horizontally and vertically. You can assume that\nboth\nc\nh\nand\nc\nv\nare less than 100. The next three lines specify the starting arrangement and the last three the goal arrangement, each in the following format.\nd\nA\nd\nB\nd\nC\nd\nD\nd\nE\nd\nF\nd\nG\nd\nH\nd\nI\nEach line consists of three digits separated by a space. The digit\nd\nX\n(\nX\nis one of\nA\nthrough\nI\n) indicates the state of the square\nX\nas shown in Figure E.2. Digits\n1\n, . . . ,\n8\nindicate that the piece of that number is on the square. The digit\n0\nindicates that the square is empty.\nThe end of the input is indicated by two zeros separated by a space.\nOutput\nFor each dataset, output the minimum total cost to achieve the goal, in a line. The total cost is the sum of the costs of moves from the starting arrangement to the goal arrangement. No other characters should appear in the output.\nSample Input\n4 9\n6 3 0\n8 1 2\n4 5 7\n6 3 0\n8 1 2\n4 5 7\n31 31\n4 3 6\n0 1 5\n8 2 7\n0 3 6\n4 1 5\n8 2 7\n92 4\n1 5 3\n4 0 7\n8 2 6\n1 5 0\n4 7 3\n8 2 6\n12 28\n3 4 5\n0 2 6\n7 1 8\n5 7 1\n8 6 2\n0 3 4\n0 0\nOutput for the Sample Input\n0\n31\n96\n312"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1339_10857961","code_snippet":"#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define HASH 1000003\n#define MAXN 1000010\nint first[10], e, next[40], v[40], w[40];\nstruct HN {\n\tLL s;\n\tint d;\n\tHN() {}\n\tHN(LL s, int d): s(s), d(d) {}\n\tbool operator < (const HN &t) const {\n\t\treturn d > t.d;\n\t}\n};\nstruct HM {\n\tint first[HASH], e, next[MAXN], d[MAXN];\n\tLL s[MAXN];\n\tvoid init() {\n\t\tmemset(first, -1, sizeof(first)), e = 0;\n\t}\n\tint hash(LL v) {\n\t\treturn v % HASH;\n\t}\n\tint find(LL v) {\n\t\tint h = hash(v);\n\t\tfor(int i = first[h]; i != -1; i = next[i]) {\n\t\t\tif(s[i] == v) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tvoid add(LL v, int dis) {\n\t\tint h = hash(v);\n\t\ts[e] = v, d[e] = dis;\n\t\tnext[e] = first[h], first[h] = e ++;\n\t}\n}hm;\nvoid add(int x, int y, int z) {\n\tv[e] = y, w[e] = z;\n\tnext[e] = first[x], first[x] = e ++;\n}\nvoid init() {\n\tmemset(first, -1, sizeof(first)), e = 0;\n\tfor(int i = 0; i < 9; i ++) {\n\t\tadd(i, (i + 1) % 9, 0), add(i, (i - 1 + 9) % 9, 0);\n\t\tadd(i, (i + 3) % 9, 1), add(i, (i - 3 + 9) % 9, 1);\n\t}\n}\nLL encode(int a[]) {\n\tLL ans = 0;\n\tfor(int i = 0; i < 9; i ++) {\n\t\tans = ans << 4 | a[i];\n\t}\n\treturn ans;\n}\nvoid decode(int a[], LL s) {\n\tfor(int i = 8; i >= 0; i --) {\n\t\ta[i] = s & 15;\n\t\ts >>= 4;\n\t}\n}\nint CH, CV, bm[10], em[10], a[10];\nLL BM, EM;\nvoid process() {\n\thm.init();\n\tstd::priority_queue<HN> q;\n\thm.add(BM, 0);\n\tq.push(HN(BM, 0));\n\twhile(!q.empty()) {\n\t\tHN hn = q.top();\n\t\tq.pop();\n\t\tif(hn.s == EM) {\n\t\t\tprintf(\"%d\\n\", hn.d);\n\t\t\tbreak;\n\t\t}\n\t\tint k = hm.find(hn.s);\n\t\tif(hn.d > hm.d[k]) {\n\t\t\tcontinue;\n\t\t}\n\t\tdecode(a, hn.s);\n\t\tfor(int j = 0; j < 9; j ++) {\n\t\t\tif(a[j] == 0) {\n\t\t\t\tfor(int i = first[j]; i != -1; i = next[i]) {\n\t\t\t\t\tint jj = v[i], dd = hn.d + (w[i] == 0 ? CH : CV);\n\t\t\t\t\tstd::swap(a[j], a[jj]);\n\t\t\t\t\tLL v = encode(a);\n\t\t\t\t\tk = hm.find(v);\n\t\t\t\t\tif(k == -1) {\n\t\t\t\t\t\thm.add(v, dd);\n\t\t\t\t\t\tq.push(HN(v, dd));\n\t\t\t\t\t} else if(dd < hm.d[k]) {\n\t\t\t\t\t\thm.d[k] = dd;\n\t\t\t\t\t\tq.push(HN(v, dd));\n\t\t\t\t\t}\n\t\t\t\t\tstd::swap(a[j], a[jj]);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\nint main() {\n\t//freopen(\"test.in\", \"rb\", stdin);\n\tinit();\n\twhile(scanf(\"%d%d\", &CH, &CV), CH) {\n\t\tfor(int i = 0; i < 9; i ++) {\n\t\t\tscanf(\"%d\", &bm[i]);\n\t\t}\n\t\tfor(int i = 0; i < 9; i ++) {\n\t\t\tscanf(\"%d\", &em[i]);\n\t\t}\n\t\tBM = encode(bm), EM = encode(em);\n\t\tprocess();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":400,"memory_kb":24024,"score_of_the_acc":-0.1905,"final_rank":2},{"submission_id":"aoj_1339_9277663","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i, a, b) for(ll i = a; i < b; i++)\n#define all(x) (x).begin(), (x).end()\n\ntemplate <typename T>\nbool chmin(T& a, T b) {\n if (a <= b) return 0;\n a = b;\n return 1;\n}\n\nusing Grid = array<int,9>;\n\nconst vector<vector<int>> edges_h = {\n {1, 8},\n {2, 0},\n {3, 1},\n {4, 2},\n {5, 3},\n {6, 4},\n {7, 5},\n {8, 6},\n {0, 7}\n};\n\nconst vector<vector<int>> edges_v = {\n {6, 3},\n {7, 4},\n {8, 5},\n {0, 6},\n {1, 7},\n {2, 8},\n {3, 0},\n {4, 1},\n {5, 2}\n};\n\nint main() {\n while (true) {\n int ch, cv;\n cin >> ch >> cv;\n\n if (ch == 0 && cv == 0) {\n return 0;\n }\n Grid initial_grid;\n rep(i, 0, 9) {\n cin >> initial_grid[i];\n }\n Grid goal_grid;\n rep(i, 0, 9) {\n cin >> goal_grid[i];\n }\n map<Grid,int> costs;\n costs[initial_grid] = 0;\n priority_queue<pair<int,Grid>> todo;\n todo.push({0, initial_grid});\n while (true) {\n auto [cost, s] = todo.top();\n todo.pop();\n cost *= -1;\n if (costs[s] < cost) {\n continue;\n }\n if (s == goal_grid) {\n cout << cost << \"\\n\";\n break;\n }\n int p = distance(s.begin(), find(s.begin(), s.end(), 0));\n for (int q : edges_h[p]) {\n swap(s[p], s[q]);\n int c = cost + ch;\n if (costs.count(s) == 0) {\n costs[s] = c;\n todo.push({-c, s});\n } else if (chmin(costs[s], c)) {\n todo.push({-c, s});\n }\n swap(s[p], s[q]);\n }\n for (int q : edges_v[p]) {\n swap(s[p], s[q]);\n int c = cost + cv;\n if (costs.count(s) == 0) {\n costs[s] = c;\n todo.push({-c, s});\n } else if (chmin(costs[s], c)) {\n todo.push({-c, s});\n }\n swap(s[p], s[q]);\n }\n }\n }\n}","accuracy":1,"time_ms":5040,"memory_kb":36628,"score_of_the_acc":-0.9738,"final_rank":16},{"submission_id":"aoj_1339_8497890","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll=long long;\n\nbool solve();\n\nmap<vector<int>,int>mp;\nvector<vector<pair<ll,ll>>>adj;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n=9;\n vector<int>ord(n);\n std::iota(ord.begin(), ord.end(),0);\n std::sort(ord.begin(), ord.end());\n int now=0;\n do{\n mp[ord]=now++;\n }while(next_permutation(ord.begin(),ord.end()));\n std::sort(ord.begin(), ord.end());\n adj.resize(now);\n do{\n int at=mp[ord];\n for (int i = 0; i < n; ++i) {\n if(ord[i]==0){\n for(auto dy:{-1,1}){\n auto i2=(i+dy+n)%n;\n swap(ord[i],ord[i2]);\n adj[at].emplace_back(mp[ord],0);\n swap(ord[i],ord[i2]);\n }\n for(auto dx:{-3,3}){\n auto i2=(i+dx+n)%n;\n swap(ord[i],ord[i2]);\n adj[at].emplace_back(mp[ord],1);\n swap(ord[i],ord[i2]);\n }\n }\n }\n }while(next_permutation(ord.begin(),ord.end()));\n while(1){\n int cw,ch;cin>>cw>>ch;\n if(cw==0 and ch==0){\n return 0;\n }\n int n=9;\n vector<int>d(n);\n for (int i = 0; i < n; ++i) {\n cin>>d[i];\n }\n vector<int>tar(n);\n for (int i = 0; i < n; ++i) {\n cin>>tar[i];\n }\n auto target=mp[tar];\n const ll INF=1e15;\n vector<ll>dist(now,INF);\n using P=pair<ll,ll>;\n priority_queue<P,vector<P>,greater<P>>q;\n q.emplace(0,mp[d]);\n dist[mp[d]]=0;\n while(q.size()){\n auto [dd,v]=q.top();q.pop();\n if(dd!=dist[v])continue;\n if(v==target){\n cout<<dd<<\"\\n\";\n break;\n }\n for(auto [to,ty]:adj[v]){\n ll cost=(ty==0)?cw:ch;\n if(dist[to]>dd+cost){\n dist[to]=dd+cost;\n q.emplace(dist[to],to);\n }\n }\n }\n }\n return 0;\n}\n\nbool solve(){\n int cw,ch;cin>>cw>>ch;\n if(cw==0 and ch==0){\n return false;\n }\n int n=9;\n vector<int>d(n);\n for (int i = 0; i < n; ++i) {\n cin>>d[i];\n }\n vector<int>tar(n);\n for (int i = 0; i < n; ++i) {\n cin>>tar[i];\n }\n auto target=mp[tar];\n vector<ll>dist(adj.size());\n using P=pair<ll,ll>;\n priority_queue<P,vector<P>,greater<P>>q;\n q.emplace(0,mp[d]);\n while(q.size()){\n auto [dd,v]=q.top();q.pop();\n if(dd!=dist[v])continue;\n if(v==target){\n// cerr<<dd<<\"\\n\";\n cout<<dd<<\"\\n\";\n return true;\n }\n for(auto [to,ty]:adj[v]){\n ll cost=(ty==0)?cw:ch;\n if(dist[to]>dd+cost){\n dist[to]=dd+cost;\n q.emplace(dist[to],to);\n }\n }\n }\n return true;\n}","accuracy":1,"time_ms":1010,"memory_kb":94752,"score_of_the_acc":-1.084,"final_rank":19},{"submission_id":"aoj_1339_8497889","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing ll=long long;\n\nbool solve(){\n int cw,ch;cin>>cw>>ch;\n if(cw==0 and ch==0){\n return false;\n }\n int n=9;\n vector<int>d(n);\n for (int i = 0; i < n; ++i) {\n cin>>d[i];\n }\n vector<int>tar(n);\n for (int i = 0; i < n; ++i) {\n cin>>tar[i];\n }\n map<vector<int>,int>mp;\n using P=pair<ll,vector<int>>;\n priority_queue<P,vector<P>,greater<P>>q;\n q.emplace(0,d);\n auto add=[&](vector<int>&v,ll dd){\n if(!mp.count(v)){\n mp[v]=dd;\n q.emplace(dd,v);\n }\n else{\n if(mp[v]>dd){\n mp[v]=dd;\n q.emplace(dd,v);\n }\n }\n };\n while(q.size()){\n auto [dd,v]=q.top();q.pop();\n if(mp.count(v) and dd!=mp[v])continue;\n if(v==tar){\n// cerr<<dd<<\"\\n\";\n cout<<dd<<\"\\n\";\n return true;\n }\n for (int i = 0; i < n; ++i) {\n if(v[i]==0){\n for(auto dy:{-1,1}){\n auto i2=(i+dy+n)%n;\n swap(v[i],v[i2]);\n add(v,dd+cw);\n swap(v[i],v[i2]);\n }\n for(auto dx:{-3,3}){\n auto i2=(i+dx+n)%n;\n swap(v[i],v[i2]);\n add(v,dd+ch);\n swap(v[i],v[i2]);\n }\n }\n }\n }\n return true;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":7660,"memory_kb":58176,"score_of_the_acc":-1.5814,"final_rank":20},{"submission_id":"aoj_1339_3991914","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\nint v[9][2];\nint h[9][2];\nll ch, cv;\ntemplate <typename T>\nbool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\nmap<ll, ll> mp;\nvoid print(vector<int> v) {\n for(int i = 0; i < 9; i++) {\n cerr << v[i] << \" \";\n if(i % 3 == 2) cerr << endl;\n }\n}\n\nll f(vector<int> v) {\n ll ret = 0;\n for(int i = v.size() - 1; i >= 0; i--) {\n ret *= 10;\n ret += v[i];\n }\n return ret;\n}\n\nvector<int> g(ll a) {\n vector<int> ret;\n for(int i = 0; i < 9; i++) {\n ret.push_back(a % 10);\n a /= 10;\n }\n return ret;\n}\n\ntypedef pair<ll, vector<int>> lll;\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n for(int i = 0; i <= 8; i++) {\n h[i][0] = (i + 1) % 9;\n h[i][1] = (i + 8) % 9;\n v[i][0] = (i + 3) % 9;\n v[i][1] = (i + 6) % 9;\n }\n while(true) {\n cin >> ch >> cv;\n if(ch == 0) break;\n vector<int> start(9);\n vector<int> goal(9);\n for(int i = 0; i < 9; i++) cin >> start[i];\n for(int i = 0; i < 9; i++) cin >> goal[i];\n mp.clear();\n priority_queue<l_l, vector<l_l>, greater<l_l>> que;\n que.push({0, f(start)});\n while(true) {\n ll nowcost = que.top().first;\n ll nowval = que.top().second;\n vector<int> now = g(que.top().second);\n que.pop();\n if(now == goal) {\n cout << nowcost << endl;\n break;\n }\n int zeroindex;\n for(int i = 0; i < 9; i++) {\n if(now[i] == 0) zeroindex = i;\n }\n for(int i = 0; i < 2; i++) {\n ll newcost = nowcost + ch;\n vector<int> to = now;\n swap(to[zeroindex], to[h[zeroindex][i]]);\n auto a = f(to);\n if(mp.count(a) == 0 || mp[a] > newcost) {\n mp[a] = newcost;\n que.push({newcost, a});\n }\n /*\n cerr << \"---------------\" << endl;\n print(now);\n cerr << \"to(horizon)\" << endl;\n print(to);\n */\n }\n for(int i = 0; i < 2; i++) {\n ll newcost = nowcost + cv;\n vector<int> to = now;\n swap(to[zeroindex], to[v[zeroindex][i]]);\n auto a = f(to);\n if(mp.count(a) == 0 || chmin(mp[a], newcost)) {\n mp[a] = newcost;\n que.push({newcost, a});\n }\n /*\n cerr << \"---------------\" << endl;\n print(now);\n cerr << \"to(vertical)\" << endl;\n print(to);\n */\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":4730,"memory_kb":27452,"score_of_the_acc":-0.8261,"final_rank":15},{"submission_id":"aoj_1339_3904260","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <queue>\n#include <cstring>\n#include <set>\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long ll;\n\n#define SIZE 400\n#define LLINF 1000000000000000000LL\n\nint swapH[][2] = {{0, 1}, {0, 8}, {1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}, {6, 7}, {7, 8} };\n\nint swapV[][2] = {{0, 6}, {0, 3}, {1, 4}, {1, 7}, {2, 5}, {2, 8}, {3, 6}, {4, 7}, {5, 8} };\n\nint b[9], g[9];\nint gHash;\n\nvoid toArray(int *b, int hash) {\n for (int i=8; i>=0; i--) {\n b[i] = hash % 9;\n hash /= 9;\n }\n}\n\nint toHash(int *b) {\n int res = 0;\n for (int i=0; i<9; i++)\n res = res * 9 + b[i];\n\n return res;\n}\n\nint H, V;\n\nint base9[9];\n\nint swapp(int hash, int a, int b) {\n int p = hash / base9[a] % 9;\n int q = hash / base9[b] % 9;\n\n return hash + (p - q) * base9[b] + (q - p) * base9[a];\n}\n\nint isOK(int hash, int a, int b) {\n int r = hash / base9[a] % 9;\n int s = hash / base9[b] % 9;\n return r == 0 || s == 0;\n}\n\nll dfs(ll cost = 0) {\n int hash = toHash(b);\n\n priority_queue<pair<ll,int> > pq;\n set<int> memo;\n\n pq.push({0, hash});\n\n while(pq.size()) {\n auto p = pq.top();\n pq.pop();\n\n int hash = p.second;\n ll cost = -p.first;\n\n if (memo.find(hash) != memo.end()) continue;\n memo.insert(hash);\n\n if (hash == gHash) {\n return cost;\n }\n\n for (int i=0; i<9; i++) {\n if (isOK(hash, swapH[i][0], swapH[i][1]))\n pq.push({-cost-H, swapp(hash, swapH[i][0], swapH[i][1])});\n }\n\n for (int i=0; i<9; i++) {\n if (isOK(hash, swapV[i][0], swapV[i][1]))\n pq.push({-cost-V, swapp(hash, swapV[i][0], swapV[i][1])});\n }\n }\n\n return LLINF;\n}\n\nbool solve() {\n\n scanf(\"%d%d\", &H, &V);\n\n if (!H) return false;\n\n for (int i=0; i<9; i++)\n scanf(\"%d\", b+i);\n\n for (int i=0; i<9; i++)\n scanf(\"%d\", g+i);\n\n gHash = toHash(g);\n\n ll ans = dfs();\n\n assert(ans < LLINF);\n\n printf(\"%lld\\n\", ans);\n\n return true;\n}\n\nint main() {\n\n base9[8] = 1;\n\n for (int i=7;i >=0; i--)\n base9[i] = base9[i+1] * 9;\n\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":2850,"memory_kb":25808,"score_of_the_acc":-0.5483,"final_rank":14},{"submission_id":"aoj_1339_3048448","code_snippet":"/*\n * Author: Gatevin\n * Created Time: 2015/10/31 13:46:57\n * File Name: Sakura_Chiyo.cpp\n */\n#include<iostream>\n#include<sstream>\n#include<fstream>\n#include<vector>\n#include<list>\n#include<deque>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<algorithm>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cctype>\n#include<cmath>\n#include<ctime>\n#include<iomanip>\nusing namespace std;\nconst double eps(1e-8);\ntypedef long long lint;\n \nint a[10];\nint ch, cv;\nint st, ed;\nint fac[10];\nint b[10], c[10];\n \n#define maxn (1*2*3*4*5*6*7*8*9+10)\n \nstruct Edge\n{\n int to, nex, w, typ;\n Edge(){}\n Edge(int _to, int _nex, int _w, int _typ)\n {\n to = _to, nex = _nex, w = _w, typ = _typ;\n }\n};\nEdge edge[maxn*4*2 + 2];\n \nint head[maxn];\nint E;\n \nvoid add_Edge(int u, int v, int w, int typ)\n{\n edge[++E] = Edge(v, head[u], w, typ);\n head[u] = E;\n}\n \nint change[9][4] =//转移\n{\n {1, 8, 6, 3},\n {2, 0, 7, 4},\n {3, 1, 8, 5},\n {4, 2, 0, 6},\n {5, 3, 1, 7},\n {6, 4, 2, 8},\n {7, 5, 3, 0},\n {8, 6, 4, 1},\n {0, 7, 5, 2}\n};\n \nvoid build()\n{\n ch = cv = 0;\n memset(head, -1, sizeof(head));\n E = 0;\n int start = 0;\n int end = 0;\n for(int i = 0; i <= 8; i++)\n end += i*fac[i];\n for(int i = start; i <= end; i++)//解Cantor展开\n {\n int ti = i;\n int emp;\n memset(a, 0, sizeof(a));\n for(int j = 8; j >= 0; j--)\n {\n int cnt = ti / fac[j];\n for(int p = 0; p <= 8; p++)\n {\n //if(a[i] == 0) cnt--;\n if(cnt == 0 && a[p] == 0)\n {\n b[j] = p;\n a[p] = 1;\n break;\n }\n else if(a[p] == 0) cnt--;\n }\n ti %= fac[j];\n if(b[j] == 0) emp = j;\n }\n for(int k = 0; k < 4; k++)//计算目标状态的Cantor展开的值\n {\n int swa = change[emp][k];\n for(int g = 0; g <= 8; g++)\n c[g] = b[g];\n swap(c[emp], c[swa]);\n int to = 0;\n for(int g = 0; g <= 8; g++)\n {\n int cnt = 0;\n for(int mabi = 0; mabi < g; mabi++)\n if(c[mabi] < c[g]) cnt++;\n to += cnt*fac[g];\n }\n add_Edge(to, i, (k > 1) ? cv : ch, (k > 1));\n }\n }\n}\n \nint Cantor()\n{\n int ret = 0;\n for(int i = 0; i < 9; i++)\n {\n int cnt = 0;\n for(int j = 0; j < i; j++)\n if(a[i] > a[j]) cnt++;\n ret += cnt*fac[i];\n }\n return ret;\n}\n \nbool vis[maxn];\nint dis[maxn];\nconst int inf = 1e9;\n \nvoid solve()//spfa\n{\n memset(vis, 0, sizeof(vis));\n fill(dis, dis + fac[9] + 1, inf);\n dis[st] = 0;\n queue<int> Q;\n Q.push(st);\n vis[st] = 1;\n while(!Q.empty())\n {\n int now = Q.front();\n Q.pop();\n vis[now] = 0;\n for(int i = head[now]; i + 1; i = edge[i].nex)\n {\n int nex = edge[i].to;\n if(dis[nex] > dis[now] + edge[i].w)\n {\n dis[nex] = dis[now] + edge[i].w;\n if(!vis[nex])\n Q.push(nex), vis[nex] = 1;\n }\n }\n }\n printf(\"%d\\n\", dis[ed]);\n}\n \nint main()\n{\n fac[0] = fac[1] = 1;\n for(int i = 2; i < 10; i++) fac[i] = fac[i - 1]*i;\n build();\n while(scanf(\"%d %d\", &ch, &cv), ch || cv)\n {\n for(int i = 0; i < 9; i++)\n scanf(\"%d\", &a[i]);\n st = Cantor();\n for(int i = 0; i < 9; i++)\n scanf(\"%d\", &a[i]);\n ed = Cantor();\n //build();\n for(int i = 1; i <= E; i++)\n if(edge[i].typ == 1)\n edge[i].w = cv;\n else edge[i].w = ch;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":1990,"memory_kb":29248,"score_of_the_acc":-0.4693,"final_rank":12},{"submission_id":"aoj_1339_2736732","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n const int xx=2647079;\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(xx,false);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%xx]){\n mp[num%xx]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":2870,"memory_kb":14580,"score_of_the_acc":-0.4226,"final_rank":6},{"submission_id":"aoj_1339_2736707","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n const int xx=3029561;\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(xx,false);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%xx]){\n mp[num%xx]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":2910,"memory_kb":15008,"score_of_the_acc":-0.433,"final_rank":8},{"submission_id":"aoj_1339_2736701","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n const int xx=4573769;\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(xx,false);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%xx]){\n mp[num%xx]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%xx])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":3120,"memory_kb":15716,"score_of_the_acc":-0.47,"final_rank":13},{"submission_id":"aoj_1339_2736679","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(3000000);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%2966911]){\n mp[num%2966911]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%2966911])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%2966911])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%2966911])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%2966911])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":2890,"memory_kb":14576,"score_of_the_acc":-0.4253,"final_rank":7},{"submission_id":"aoj_1339_2736673","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(5000000);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%4853333]){\n mp[num%4853333]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":3000,"memory_kb":15400,"score_of_the_acc":-0.4499,"final_rank":10},{"submission_id":"aoj_1339_2736672","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(5000000,false);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%4853333]){\n mp[num%4853333]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":3000,"memory_kb":15372,"score_of_the_acc":-0.4496,"final_rank":9},{"submission_id":"aoj_1339_2736667","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconstexpr int pDec[]={1,10,100,1000,10000,100000,1000000,10000000,100000000};\nconstexpr int fct[]={40320,5040,720,120,24,6,2,1};\nconstexpr int dif[]={-1,1,-3,3};\nint makeHash(int num){\n int ans=0;\n int f=0;\n for(int i=0;i<8;i++){\n int tmp=num%10;\n // auto index=lower_bound(vDigit.begin(),vDigit.end(),tmp);\n // ans+=(index-vDigit.begin())*fct[i];\n //vDigit.erase(index);\n \n ans+=(tmp-__builtin_popcount(f&(1<<tmp)-1))*fct[i];\n f|=(1<<tmp);\n num/=10;\n }\n return ans;\n}\n\nint main(void){\n // cout<<makeHash(305147826)<<endl;\n // return 0;\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\n \n // int count=0;\n // do{\n // int num=0;\n // for(int i=9;i>0;i--){\n // num+=pDec[i-1]*vDigit[9-i];\n // }\n // mp.emplace(num,count++);\n // }while(next_permutation(vDigit.begin(),vDigit.end()));\n // Your code here!\n int h,v;\n while(cin>>h>>v,h||v){\n int hv[]={h,h,v,v};\n int st=0;\n int end=0;\n int a;\n vector<bool> visited(362880,false);\n cin>>st;\n for(int i=0;i<8;i++){\n st*=10;\n cin>>a;\n st+=a;\n }\n cin>>end;\n for(int i=0;i<8;i++){\n end*=10;\n cin>>a;\n end+=a;\n }\n priority_queue<pair<int,int>> q;\n q.emplace(0,st);\n while(1){\n int pos=q.top().second;\n int cost=q.top().first;\n if(pos==end){\n cout<<-cost<<endl;\n break;\n }\n q.pop();\n int hash=makeHash(pos);\n if(visited[hash]){\n continue;\n }\n visited[hash]=true;\n int zero=to_string(pos+1000000000).find('0')-1;\n for(int i=0;i<4;i++){\n int s=pos,t=8-((zero+dif[i]+9)%9);\n int tmp=(pos/pDec[t])%10;\n s+=(pDec[8-zero]*tmp-pDec[t]*tmp);\n //cout<<tmp<<\" \"<<pos<<\" \"<<s<<endl;\n q.emplace(cost-hv[i],s);\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":1990,"memory_kb":10132,"score_of_the_acc":-0.2505,"final_rank":3},{"submission_id":"aoj_1339_2736663","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n vector<bool> mp(5000000,false);\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if(!mp[num%4853333]){\n mp[num%4853333]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if(!mp[stoi(ns)%4853333])\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":3050,"memory_kb":15428,"score_of_the_acc":-0.4571,"final_rank":11},{"submission_id":"aoj_1339_2736655","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define fs first\n#define sc second\nconstexpr int tv[]={-3,-1,1,3};\nconstexpr int p10[]={100000000,10000000,1000000,100000,10000,1000,100,10,1};\nconstexpr int fact[]={40320,5040,720,120,24,6,2,1};\n\nint my_hash(int f){\n int flag=0,ret=0;\n rep(i,8){\n ret+=fact[i]*(f%10-__builtin_popcount(flag&((1<<(f%10))-1)));\n flag|=1<<(f%10);\n f/=10;\n }\n return ret;\n}\n\n\nint main(){\n \n int h,v;\n string a=\"123456789\",b=\"123456789\";\n using data=pair<int,int>;\n \n while(cin>>h>>v, h or v){\n vector<int> hm(362880,-10000000);\n int tc[]={v,h,h,v};\n rep(i,9)cin>>a[i];\n rep(i,9)cin>>b[i];\n int sa=stoi(\"1\"+a)-1000000000,sb=stoi(\"1\"+b)-1000000000;\n\n priority_queue<data> q;\n q.emplace(0,sa);\n \n while(1){\n int cost=q.top().fs;\n int board=q.top().sc;\n if(board==sb){\n cout<<-cost<<endl;\n break;\n }\n q.pop();\n int index=to_string(board).find('0');\n if(index==-1)index=0;\n rep(i,4){\n int fixed=(index+tv[i]+9)%9;\n int next=board;\n int fx=board/p10[fixed]%10;\n next=next+(p10[index]-p10[fixed]) * fx;\n int nc=cost-tc[i];\n int hval=my_hash(next);\n if(hm[hval]<nc){\n q.emplace(nc, next);\n hm[hval]=nc;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":1400,"memory_kb":7428,"score_of_the_acc":-0.1382,"final_rank":1},{"submission_id":"aoj_1339_2736642","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define fs first\n#define sc second\nconstexpr int tv[]={-3,-1,1,3};\nconstexpr int p10[]={100000000,10000000,1000000,100000,10000,1000,100,10,1};\nconstexpr int fact[]={40320,5040,720,120,24,6,2,1};\n\nint my_hash(int f){\n vector<int> v={0,1,2,3,4,5,6,7,8};\n int ret=0;\n rep(i,8){\n auto itr=lower_bound(v.begin(),v.end(),f%10);\n ret+=fact[i]*(itr-v.begin());\n v.erase(itr);\n f/=10;\n }\n return ret;\n}\n\n\nint main(){\n \n int h,v;\n string a=\"123456789\",b=\"123456789\";\n using data=pair<int,int>;\n \n while(cin>>h>>v, h or v){\n vector<int> hm(362880,-10000000);\n int tc[]={v,h,h,v};\n rep(i,9)cin>>a[i];\n rep(i,9)cin>>b[i];\n int sa=stoi(\"1\"+a)-1000000000,sb=stoi(\"1\"+b)-1000000000;\n\n priority_queue<data> q;\n q.emplace(0,sa);\n \n while(1){\n int cost=q.top().fs;\n int board=q.top().sc;\n if(board==sb){\n cout<<-cost<<endl;\n break;\n }\n q.pop();\n int index=to_string(board).find('0');\n if(index==-1)index=0;\n rep(i,4){\n int fixed=(index+tv[i]+9)%9;\n int next=board;\n int fx=board/p10[fixed]%10;\n next=next+(p10[index]-p10[fixed]) * fx;\n int nc=cost-tc[i];\n int hval=my_hash(next);\n if(hm[hval]<nc){\n q.emplace(nc, next);\n hm[hval]=nc;\n }\n }\n }\n }\n}","accuracy":1,"time_ms":2310,"memory_kb":7384,"score_of_the_acc":-0.2631,"final_rank":4},{"submission_id":"aoj_1339_2736634","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n unordered_map<int,bool> mp;\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if((mp.find(num)==mp.end())){\n mp[num]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-v,ns));\n }\n }\n}","accuracy":1,"time_ms":5900,"memory_kb":29756,"score_of_the_acc":-1.0136,"final_rank":18},{"submission_id":"aoj_1339_2736632","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h,v,i;\n while(cin>>h>>v,h){\n string s=\"\",e=\"\";\n char tmp;\n for(i=0;i<9;i++){\n cin>>tmp;\n s+=tmp;\n }\n for(i=0;i<9;i++){\n cin>>tmp;\n e+=tmp;\n }\n priority_queue<pair<int,string>> q;\n q.push(make_pair(0,s));\n unordered_map<int,bool> mp;\n pair<int,string> now;\n int num,zero;\n while(!q.empty()){\n now=q.top();q.pop();\n now.first*=-1;\n num=stoi(now.second);\n if(now.second==e){\n cout<<now.first<<endl;\n break;\n }\n if((mp.find(num)==mp.end())){\n mp[num]=true;\n }else{\n continue;\n }\n zero=now.second.find('0');\n string ns=now.second;\n ns[zero]=ns[(zero+1)%9];\n ns[(zero+1)%9]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-h,ns));\n ns[(zero+1)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\n ns[(zero-1<0)?8:(zero-1)]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-h,ns));\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero+3)%9];\n ns[(zero+3)%9]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-v,ns));\n ns[(zero+3)%9]=ns[zero];\n ns[zero]='0';\n \n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\n if((mp.find(stoi(ns))==mp.end()))\n q.push(make_pair(-now.first-v,ns));\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]=ns[zero];\n ns[zero]='0';\n }\n }\n}","accuracy":1,"time_ms":5860,"memory_kb":29868,"score_of_the_acc":-1.0094,"final_rank":17},{"submission_id":"aoj_1339_2736630","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\nint makeHash(int num){\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\n vector<int> pDec{1,10,100,1000,10000,100000,1000000,10000000,100000000};\n int base=9;\n int fct=362880;\n int ans=0;\n for(int i=base;i>1;i--){\n fct/=i;\n auto index=lower_bound(vDigit.begin(),vDigit.end(),(num/pDec[i-1])%10);\n ans+=(index-vDigit.begin())*fct;\n vDigit.erase(index);\n }\n return ans;\n}\n\nint main(void){\n // cout<<makeHash(305147826)<<endl;\n // return 0;\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\n vector<int> pDec{1,10,100,1000,10000,100000,1000000,10000000,100000000};\n \n vector<int> dif{-1,1,-3,3};\n // int count=0;\n // do{\n // int num=0;\n // for(int i=9;i>0;i--){\n // num+=pDec[i-1]*vDigit[9-i];\n // }\n // mp.emplace(num,count++);\n // }while(next_permutation(vDigit.begin(),vDigit.end()));\n // Your code here!\n int h,v;\n while(cin>>h>>v,h||v){\n string st=\" \";\n string end=\" \";\n vector<bool> visited(362880,false);\n vector<int> hv{h,h,v,v};\n for(int i=0;i<9;i++){\n cin>>st[i];\n }\n for(int i=0;i<9;i++){\n cin>>end[i];\n }\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;\n q.emplace(0,stoi(st));\n int iend=stoi(end);\n while(1){\n int pos=q.top().second;\n int cost=q.top().first;\n if(pos==iend){\n cout<<cost<<endl;\n break;\n }\n q.pop();\n int hash=makeHash(pos);\n if(visited[hash]){\n continue;\n }\n visited[hash]=true;\n int zero=to_string(pos+1000000000).find('0')-1;\n for(int i=0;i<4;i++){\n int s=pos,t=8-((zero+dif[i]+9)%9);\n int tmp=(pos/pDec[t])%10;\n s+=(pDec[8-zero]*tmp-pDec[t]*tmp);\n //cout<<tmp<<\" \"<<pos<<\" \"<<s<<endl;\n q.emplace(cost+hv[i],s);\n }\n }\n }\n return 0;\n}","accuracy":1,"time_ms":2800,"memory_kb":10088,"score_of_the_acc":-0.3615,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_1339_10857961\",\n \"code_snippet\": \"#include<map>\\n#include<set>\\n#include<cmath>\\n#include<queue>\\n#include<cctype>\\n#include<cstdio>\\n#include<vector>\\n#include<cstdlib>\\n#include<cstring>\\n#include<algorithm>\\ntypedef long long LL;\\n#define HASH 1000003\\n#define MAXN 1000010\\nint first[10], e, next[40], v[40], w[40];\\nstruct HN {\\n\\tLL s;\\n\\tint d;\\n\\tHN() {}\\n\\tHN(LL s, int d): s(s), d(d) {}\\n\\tbool operator < (const HN &t) const {\\n\\t\\treturn d > t.d;\\n\\t}\\n};\\nstruct HM {\\n\\tint first[HASH], e, next[MAXN], d[MAXN];\\n\\tLL s[MAXN];\\n\\tvoid init() {\\n\\t\\tmemset(first, -1, sizeof(first)), e = 0;\\n\\t}\\n\\tint hash(LL v) {\\n\\t\\treturn v % HASH;\\n\\t}\\n\\tint find(LL v) {\\n\\t\\tint h = hash(v);\\n\\t\\tfor(int i = first[h]; i != -1; i = next[i]) {\\n\\t\\t\\tif(s[i] == v) {\\n\\t\\t\\t\\treturn i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\\n\\tvoid add(LL v, int dis) {\\n\\t\\tint h = hash(v);\\n\\t\\ts[e] = v, d[e] = dis;\\n\\t\\tnext[e] = first[h], first[h] = e ++;\\n\\t}\\n}hm;\\nvoid add(int x, int y, int z) {\\n\\tv[e] = y, w[e] = z;\\n\\tnext[e] = first[x], first[x] = e ++;\\n}\\nvoid init() {\\n\\tmemset(first, -1, sizeof(first)), e = 0;\\n\\tfor(int i = 0; i < 9; i ++) {\\n\\t\\tadd(i, (i + 1) % 9, 0), add(i, (i - 1 + 9) % 9, 0);\\n\\t\\tadd(i, (i + 3) % 9, 1), add(i, (i - 3 + 9) % 9, 1);\\n\\t}\\n}\\nLL encode(int a[]) {\\n\\tLL ans = 0;\\n\\tfor(int i = 0; i < 9; i ++) {\\n\\t\\tans = ans << 4 | a[i];\\n\\t}\\n\\treturn ans;\\n}\\nvoid decode(int a[], LL s) {\\n\\tfor(int i = 8; i >= 0; i --) {\\n\\t\\ta[i] = s & 15;\\n\\t\\ts >>= 4;\\n\\t}\\n}\\nint CH, CV, bm[10], em[10], a[10];\\nLL BM, EM;\\nvoid process() {\\n\\thm.init();\\n\\tstd::priority_queue<HN> q;\\n\\thm.add(BM, 0);\\n\\tq.push(HN(BM, 0));\\n\\twhile(!q.empty()) {\\n\\t\\tHN hn = q.top();\\n\\t\\tq.pop();\\n\\t\\tif(hn.s == EM) {\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\", hn.d);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tint k = hm.find(hn.s);\\n\\t\\tif(hn.d > hm.d[k]) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tdecode(a, hn.s);\\n\\t\\tfor(int j = 0; j < 9; j ++) {\\n\\t\\t\\tif(a[j] == 0) {\\n\\t\\t\\t\\tfor(int i = first[j]; i != -1; i = next[i]) {\\n\\t\\t\\t\\t\\tint jj = v[i], dd = hn.d + (w[i] == 0 ? CH : CV);\\n\\t\\t\\t\\t\\tstd::swap(a[j], a[jj]);\\n\\t\\t\\t\\t\\tLL v = encode(a);\\n\\t\\t\\t\\t\\tk = hm.find(v);\\n\\t\\t\\t\\t\\tif(k == -1) {\\n\\t\\t\\t\\t\\t\\thm.add(v, dd);\\n\\t\\t\\t\\t\\t\\tq.push(HN(v, dd));\\n\\t\\t\\t\\t\\t} else if(dd < hm.d[k]) {\\n\\t\\t\\t\\t\\t\\thm.d[k] = dd;\\n\\t\\t\\t\\t\\t\\tq.push(HN(v, dd));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tstd::swap(a[j], a[jj]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint main() {\\n\\t//freopen(\\\"test.in\\\", \\\"rb\\\", stdin);\\n\\tinit();\\n\\twhile(scanf(\\\"%d%d\\\", &CH, &CV), CH) {\\n\\t\\tfor(int i = 0; i < 9; i ++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &bm[i]);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < 9; i ++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &em[i]);\\n\\t\\t}\\n\\t\\tBM = encode(bm), EM = encode(em);\\n\\t\\tprocess();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 24024,\n \"score_of_the_acc\": -0.1905,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1339_9277663\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i, a, b) for(ll i = a; i < b; i++)\\n#define all(x) (x).begin(), (x).end()\\n\\ntemplate <typename T>\\nbool chmin(T& a, T b) {\\n if (a <= b) return 0;\\n a = b;\\n return 1;\\n}\\n\\nusing Grid = array<int,9>;\\n\\nconst vector<vector<int>> edges_h = {\\n {1, 8},\\n {2, 0},\\n {3, 1},\\n {4, 2},\\n {5, 3},\\n {6, 4},\\n {7, 5},\\n {8, 6},\\n {0, 7}\\n};\\n\\nconst vector<vector<int>> edges_v = {\\n {6, 3},\\n {7, 4},\\n {8, 5},\\n {0, 6},\\n {1, 7},\\n {2, 8},\\n {3, 0},\\n {4, 1},\\n {5, 2}\\n};\\n\\nint main() {\\n while (true) {\\n int ch, cv;\\n cin >> ch >> cv;\\n\\n if (ch == 0 && cv == 0) {\\n return 0;\\n }\\n Grid initial_grid;\\n rep(i, 0, 9) {\\n cin >> initial_grid[i];\\n }\\n Grid goal_grid;\\n rep(i, 0, 9) {\\n cin >> goal_grid[i];\\n }\\n map<Grid,int> costs;\\n costs[initial_grid] = 0;\\n priority_queue<pair<int,Grid>> todo;\\n todo.push({0, initial_grid});\\n while (true) {\\n auto [cost, s] = todo.top();\\n todo.pop();\\n cost *= -1;\\n if (costs[s] < cost) {\\n continue;\\n }\\n if (s == goal_grid) {\\n cout << cost << \\\"\\\\n\\\";\\n break;\\n }\\n int p = distance(s.begin(), find(s.begin(), s.end(), 0));\\n for (int q : edges_h[p]) {\\n swap(s[p], s[q]);\\n int c = cost + ch;\\n if (costs.count(s) == 0) {\\n costs[s] = c;\\n todo.push({-c, s});\\n } else if (chmin(costs[s], c)) {\\n todo.push({-c, s});\\n }\\n swap(s[p], s[q]);\\n }\\n for (int q : edges_v[p]) {\\n swap(s[p], s[q]);\\n int c = cost + cv;\\n if (costs.count(s) == 0) {\\n costs[s] = c;\\n todo.push({-c, s});\\n } else if (chmin(costs[s], c)) {\\n todo.push({-c, s});\\n }\\n swap(s[p], s[q]);\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5040,\n \"memory_kb\": 36628,\n \"score_of_the_acc\": -0.9738,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1339_8497890\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nusing ll=long long;\\n\\nbool solve();\\n\\nmap<vector<int>,int>mp;\\nvector<vector<pair<ll,ll>>>adj;\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n=9;\\n vector<int>ord(n);\\n std::iota(ord.begin(), ord.end(),0);\\n std::sort(ord.begin(), ord.end());\\n int now=0;\\n do{\\n mp[ord]=now++;\\n }while(next_permutation(ord.begin(),ord.end()));\\n std::sort(ord.begin(), ord.end());\\n adj.resize(now);\\n do{\\n int at=mp[ord];\\n for (int i = 0; i < n; ++i) {\\n if(ord[i]==0){\\n for(auto dy:{-1,1}){\\n auto i2=(i+dy+n)%n;\\n swap(ord[i],ord[i2]);\\n adj[at].emplace_back(mp[ord],0);\\n swap(ord[i],ord[i2]);\\n }\\n for(auto dx:{-3,3}){\\n auto i2=(i+dx+n)%n;\\n swap(ord[i],ord[i2]);\\n adj[at].emplace_back(mp[ord],1);\\n swap(ord[i],ord[i2]);\\n }\\n }\\n }\\n }while(next_permutation(ord.begin(),ord.end()));\\n while(1){\\n int cw,ch;cin>>cw>>ch;\\n if(cw==0 and ch==0){\\n return 0;\\n }\\n int n=9;\\n vector<int>d(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>d[i];\\n }\\n vector<int>tar(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>tar[i];\\n }\\n auto target=mp[tar];\\n const ll INF=1e15;\\n vector<ll>dist(now,INF);\\n using P=pair<ll,ll>;\\n priority_queue<P,vector<P>,greater<P>>q;\\n q.emplace(0,mp[d]);\\n dist[mp[d]]=0;\\n while(q.size()){\\n auto [dd,v]=q.top();q.pop();\\n if(dd!=dist[v])continue;\\n if(v==target){\\n cout<<dd<<\\\"\\\\n\\\";\\n break;\\n }\\n for(auto [to,ty]:adj[v]){\\n ll cost=(ty==0)?cw:ch;\\n if(dist[to]>dd+cost){\\n dist[to]=dd+cost;\\n q.emplace(dist[to],to);\\n }\\n }\\n }\\n }\\n return 0;\\n}\\n\\nbool solve(){\\n int cw,ch;cin>>cw>>ch;\\n if(cw==0 and ch==0){\\n return false;\\n }\\n int n=9;\\n vector<int>d(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>d[i];\\n }\\n vector<int>tar(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>tar[i];\\n }\\n auto target=mp[tar];\\n vector<ll>dist(adj.size());\\n using P=pair<ll,ll>;\\n priority_queue<P,vector<P>,greater<P>>q;\\n q.emplace(0,mp[d]);\\n while(q.size()){\\n auto [dd,v]=q.top();q.pop();\\n if(dd!=dist[v])continue;\\n if(v==target){\\n// cerr<<dd<<\\\"\\\\n\\\";\\n cout<<dd<<\\\"\\\\n\\\";\\n return true;\\n }\\n for(auto [to,ty]:adj[v]){\\n ll cost=(ty==0)?cw:ch;\\n if(dist[to]>dd+cost){\\n dist[to]=dd+cost;\\n q.emplace(dist[to],to);\\n }\\n }\\n }\\n return true;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 94752,\n \"score_of_the_acc\": -1.084,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1339_8497889\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nusing ll=long long;\\n\\nbool solve(){\\n int cw,ch;cin>>cw>>ch;\\n if(cw==0 and ch==0){\\n return false;\\n }\\n int n=9;\\n vector<int>d(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>d[i];\\n }\\n vector<int>tar(n);\\n for (int i = 0; i < n; ++i) {\\n cin>>tar[i];\\n }\\n map<vector<int>,int>mp;\\n using P=pair<ll,vector<int>>;\\n priority_queue<P,vector<P>,greater<P>>q;\\n q.emplace(0,d);\\n auto add=[&](vector<int>&v,ll dd){\\n if(!mp.count(v)){\\n mp[v]=dd;\\n q.emplace(dd,v);\\n }\\n else{\\n if(mp[v]>dd){\\n mp[v]=dd;\\n q.emplace(dd,v);\\n }\\n }\\n };\\n while(q.size()){\\n auto [dd,v]=q.top();q.pop();\\n if(mp.count(v) and dd!=mp[v])continue;\\n if(v==tar){\\n// cerr<<dd<<\\\"\\\\n\\\";\\n cout<<dd<<\\\"\\\\n\\\";\\n return true;\\n }\\n for (int i = 0; i < n; ++i) {\\n if(v[i]==0){\\n for(auto dy:{-1,1}){\\n auto i2=(i+dy+n)%n;\\n swap(v[i],v[i2]);\\n add(v,dd+cw);\\n swap(v[i],v[i2]);\\n }\\n for(auto dx:{-3,3}){\\n auto i2=(i+dx+n)%n;\\n swap(v[i],v[i2]);\\n add(v,dd+ch);\\n swap(v[i],v[i2]);\\n }\\n }\\n }\\n }\\n return true;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7660,\n \"memory_kb\": 58176,\n \"score_of_the_acc\": -1.5814,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1339_3991914\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\nint v[9][2];\\nint h[9][2];\\nll ch, cv;\\ntemplate <typename T>\\nbool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nmap<ll, ll> mp;\\nvoid print(vector<int> v) {\\n for(int i = 0; i < 9; i++) {\\n cerr << v[i] << \\\" \\\";\\n if(i % 3 == 2) cerr << endl;\\n }\\n}\\n\\nll f(vector<int> v) {\\n ll ret = 0;\\n for(int i = v.size() - 1; i >= 0; i--) {\\n ret *= 10;\\n ret += v[i];\\n }\\n return ret;\\n}\\n\\nvector<int> g(ll a) {\\n vector<int> ret;\\n for(int i = 0; i < 9; i++) {\\n ret.push_back(a % 10);\\n a /= 10;\\n }\\n return ret;\\n}\\n\\ntypedef pair<ll, vector<int>> lll;\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n for(int i = 0; i <= 8; i++) {\\n h[i][0] = (i + 1) % 9;\\n h[i][1] = (i + 8) % 9;\\n v[i][0] = (i + 3) % 9;\\n v[i][1] = (i + 6) % 9;\\n }\\n while(true) {\\n cin >> ch >> cv;\\n if(ch == 0) break;\\n vector<int> start(9);\\n vector<int> goal(9);\\n for(int i = 0; i < 9; i++) cin >> start[i];\\n for(int i = 0; i < 9; i++) cin >> goal[i];\\n mp.clear();\\n priority_queue<l_l, vector<l_l>, greater<l_l>> que;\\n que.push({0, f(start)});\\n while(true) {\\n ll nowcost = que.top().first;\\n ll nowval = que.top().second;\\n vector<int> now = g(que.top().second);\\n que.pop();\\n if(now == goal) {\\n cout << nowcost << endl;\\n break;\\n }\\n int zeroindex;\\n for(int i = 0; i < 9; i++) {\\n if(now[i] == 0) zeroindex = i;\\n }\\n for(int i = 0; i < 2; i++) {\\n ll newcost = nowcost + ch;\\n vector<int> to = now;\\n swap(to[zeroindex], to[h[zeroindex][i]]);\\n auto a = f(to);\\n if(mp.count(a) == 0 || mp[a] > newcost) {\\n mp[a] = newcost;\\n que.push({newcost, a});\\n }\\n /*\\n cerr << \\\"---------------\\\" << endl;\\n print(now);\\n cerr << \\\"to(horizon)\\\" << endl;\\n print(to);\\n */\\n }\\n for(int i = 0; i < 2; i++) {\\n ll newcost = nowcost + cv;\\n vector<int> to = now;\\n swap(to[zeroindex], to[v[zeroindex][i]]);\\n auto a = f(to);\\n if(mp.count(a) == 0 || chmin(mp[a], newcost)) {\\n mp[a] = newcost;\\n que.push({newcost, a});\\n }\\n /*\\n cerr << \\\"---------------\\\" << endl;\\n print(now);\\n cerr << \\\"to(vertical)\\\" << endl;\\n print(to);\\n */\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4730,\n \"memory_kb\": 27452,\n \"score_of_the_acc\": -0.8261,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1339_3904260\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <queue>\\n#include <cstring>\\n#include <set>\\n#include <cassert>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n#define SIZE 400\\n#define LLINF 1000000000000000000LL\\n\\nint swapH[][2] = {{0, 1}, {0, 8}, {1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}, {6, 7}, {7, 8} };\\n\\nint swapV[][2] = {{0, 6}, {0, 3}, {1, 4}, {1, 7}, {2, 5}, {2, 8}, {3, 6}, {4, 7}, {5, 8} };\\n\\nint b[9], g[9];\\nint gHash;\\n\\nvoid toArray(int *b, int hash) {\\n for (int i=8; i>=0; i--) {\\n b[i] = hash % 9;\\n hash /= 9;\\n }\\n}\\n\\nint toHash(int *b) {\\n int res = 0;\\n for (int i=0; i<9; i++)\\n res = res * 9 + b[i];\\n\\n return res;\\n}\\n\\nint H, V;\\n\\nint base9[9];\\n\\nint swapp(int hash, int a, int b) {\\n int p = hash / base9[a] % 9;\\n int q = hash / base9[b] % 9;\\n\\n return hash + (p - q) * base9[b] + (q - p) * base9[a];\\n}\\n\\nint isOK(int hash, int a, int b) {\\n int r = hash / base9[a] % 9;\\n int s = hash / base9[b] % 9;\\n return r == 0 || s == 0;\\n}\\n\\nll dfs(ll cost = 0) {\\n int hash = toHash(b);\\n\\n priority_queue<pair<ll,int> > pq;\\n set<int> memo;\\n\\n pq.push({0, hash});\\n\\n while(pq.size()) {\\n auto p = pq.top();\\n pq.pop();\\n\\n int hash = p.second;\\n ll cost = -p.first;\\n\\n if (memo.find(hash) != memo.end()) continue;\\n memo.insert(hash);\\n\\n if (hash == gHash) {\\n return cost;\\n }\\n\\n for (int i=0; i<9; i++) {\\n if (isOK(hash, swapH[i][0], swapH[i][1]))\\n pq.push({-cost-H, swapp(hash, swapH[i][0], swapH[i][1])});\\n }\\n\\n for (int i=0; i<9; i++) {\\n if (isOK(hash, swapV[i][0], swapV[i][1]))\\n pq.push({-cost-V, swapp(hash, swapV[i][0], swapV[i][1])});\\n }\\n }\\n\\n return LLINF;\\n}\\n\\nbool solve() {\\n\\n scanf(\\\"%d%d\\\", &H, &V);\\n\\n if (!H) return false;\\n\\n for (int i=0; i<9; i++)\\n scanf(\\\"%d\\\", b+i);\\n\\n for (int i=0; i<9; i++)\\n scanf(\\\"%d\\\", g+i);\\n\\n gHash = toHash(g);\\n\\n ll ans = dfs();\\n\\n assert(ans < LLINF);\\n\\n printf(\\\"%lld\\\\n\\\", ans);\\n\\n return true;\\n}\\n\\nint main() {\\n\\n base9[8] = 1;\\n\\n for (int i=7;i >=0; i--)\\n base9[i] = base9[i+1] * 9;\\n\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2850,\n \"memory_kb\": 25808,\n \"score_of_the_acc\": -0.5483,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1339_3048448\",\n \"code_snippet\": \"/*\\n * Author: Gatevin\\n * Created Time: 2015/10/31 13:46:57\\n * File Name: Sakura_Chiyo.cpp\\n */\\n#include<iostream>\\n#include<sstream>\\n#include<fstream>\\n#include<vector>\\n#include<list>\\n#include<deque>\\n#include<queue>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cctype>\\n#include<cmath>\\n#include<ctime>\\n#include<iomanip>\\nusing namespace std;\\nconst double eps(1e-8);\\ntypedef long long lint;\\n \\nint a[10];\\nint ch, cv;\\nint st, ed;\\nint fac[10];\\nint b[10], c[10];\\n \\n#define maxn (1*2*3*4*5*6*7*8*9+10)\\n \\nstruct Edge\\n{\\n int to, nex, w, typ;\\n Edge(){}\\n Edge(int _to, int _nex, int _w, int _typ)\\n {\\n to = _to, nex = _nex, w = _w, typ = _typ;\\n }\\n};\\nEdge edge[maxn*4*2 + 2];\\n \\nint head[maxn];\\nint E;\\n \\nvoid add_Edge(int u, int v, int w, int typ)\\n{\\n edge[++E] = Edge(v, head[u], w, typ);\\n head[u] = E;\\n}\\n \\nint change[9][4] =//转移\\n{\\n {1, 8, 6, 3},\\n {2, 0, 7, 4},\\n {3, 1, 8, 5},\\n {4, 2, 0, 6},\\n {5, 3, 1, 7},\\n {6, 4, 2, 8},\\n {7, 5, 3, 0},\\n {8, 6, 4, 1},\\n {0, 7, 5, 2}\\n};\\n \\nvoid build()\\n{\\n ch = cv = 0;\\n memset(head, -1, sizeof(head));\\n E = 0;\\n int start = 0;\\n int end = 0;\\n for(int i = 0; i <= 8; i++)\\n end += i*fac[i];\\n for(int i = start; i <= end; i++)//解Cantor展开\\n {\\n int ti = i;\\n int emp;\\n memset(a, 0, sizeof(a));\\n for(int j = 8; j >= 0; j--)\\n {\\n int cnt = ti / fac[j];\\n for(int p = 0; p <= 8; p++)\\n {\\n //if(a[i] == 0) cnt--;\\n if(cnt == 0 && a[p] == 0)\\n {\\n b[j] = p;\\n a[p] = 1;\\n break;\\n }\\n else if(a[p] == 0) cnt--;\\n }\\n ti %= fac[j];\\n if(b[j] == 0) emp = j;\\n }\\n for(int k = 0; k < 4; k++)//计算目标状态的Cantor展开的值\\n {\\n int swa = change[emp][k];\\n for(int g = 0; g <= 8; g++)\\n c[g] = b[g];\\n swap(c[emp], c[swa]);\\n int to = 0;\\n for(int g = 0; g <= 8; g++)\\n {\\n int cnt = 0;\\n for(int mabi = 0; mabi < g; mabi++)\\n if(c[mabi] < c[g]) cnt++;\\n to += cnt*fac[g];\\n }\\n add_Edge(to, i, (k > 1) ? cv : ch, (k > 1));\\n }\\n }\\n}\\n \\nint Cantor()\\n{\\n int ret = 0;\\n for(int i = 0; i < 9; i++)\\n {\\n int cnt = 0;\\n for(int j = 0; j < i; j++)\\n if(a[i] > a[j]) cnt++;\\n ret += cnt*fac[i];\\n }\\n return ret;\\n}\\n \\nbool vis[maxn];\\nint dis[maxn];\\nconst int inf = 1e9;\\n \\nvoid solve()//spfa\\n{\\n memset(vis, 0, sizeof(vis));\\n fill(dis, dis + fac[9] + 1, inf);\\n dis[st] = 0;\\n queue<int> Q;\\n Q.push(st);\\n vis[st] = 1;\\n while(!Q.empty())\\n {\\n int now = Q.front();\\n Q.pop();\\n vis[now] = 0;\\n for(int i = head[now]; i + 1; i = edge[i].nex)\\n {\\n int nex = edge[i].to;\\n if(dis[nex] > dis[now] + edge[i].w)\\n {\\n dis[nex] = dis[now] + edge[i].w;\\n if(!vis[nex])\\n Q.push(nex), vis[nex] = 1;\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dis[ed]);\\n}\\n \\nint main()\\n{\\n fac[0] = fac[1] = 1;\\n for(int i = 2; i < 10; i++) fac[i] = fac[i - 1]*i;\\n build();\\n while(scanf(\\\"%d %d\\\", &ch, &cv), ch || cv)\\n {\\n for(int i = 0; i < 9; i++)\\n scanf(\\\"%d\\\", &a[i]);\\n st = Cantor();\\n for(int i = 0; i < 9; i++)\\n scanf(\\\"%d\\\", &a[i]);\\n ed = Cantor();\\n //build();\\n for(int i = 1; i <= E; i++)\\n if(edge[i].typ == 1)\\n edge[i].w = cv;\\n else edge[i].w = ch;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1990,\n \"memory_kb\": 29248,\n \"score_of_the_acc\": -0.4693,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1339_2736732\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n const int xx=2647079;\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(xx,false);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%xx]){\\n mp[num%xx]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2870,\n \"memory_kb\": 14580,\n \"score_of_the_acc\": -0.4226,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1339_2736707\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n const int xx=3029561;\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(xx,false);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%xx]){\\n mp[num%xx]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2910,\n \"memory_kb\": 15008,\n \"score_of_the_acc\": -0.433,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1339_2736701\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n const int xx=4573769;\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(xx,false);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%xx]){\\n mp[num%xx]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%xx])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3120,\n \"memory_kb\": 15716,\n \"score_of_the_acc\": -0.47,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1339_2736679\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(3000000);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%2966911]){\\n mp[num%2966911]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%2966911])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%2966911])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%2966911])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%2966911])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2890,\n \"memory_kb\": 14576,\n \"score_of_the_acc\": -0.4253,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1339_2736673\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(5000000);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%4853333]){\\n mp[num%4853333]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3000,\n \"memory_kb\": 15400,\n \"score_of_the_acc\": -0.4499,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1339_2736672\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(5000000,false);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%4853333]){\\n mp[num%4853333]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3000,\n \"memory_kb\": 15372,\n \"score_of_the_acc\": -0.4496,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1339_2736667\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconstexpr int pDec[]={1,10,100,1000,10000,100000,1000000,10000000,100000000};\\nconstexpr int fct[]={40320,5040,720,120,24,6,2,1};\\nconstexpr int dif[]={-1,1,-3,3};\\nint makeHash(int num){\\n int ans=0;\\n int f=0;\\n for(int i=0;i<8;i++){\\n int tmp=num%10;\\n // auto index=lower_bound(vDigit.begin(),vDigit.end(),tmp);\\n // ans+=(index-vDigit.begin())*fct[i];\\n //vDigit.erase(index);\\n \\n ans+=(tmp-__builtin_popcount(f&(1<<tmp)-1))*fct[i];\\n f|=(1<<tmp);\\n num/=10;\\n }\\n return ans;\\n}\\n\\nint main(void){\\n // cout<<makeHash(305147826)<<endl;\\n // return 0;\\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\\n \\n // int count=0;\\n // do{\\n // int num=0;\\n // for(int i=9;i>0;i--){\\n // num+=pDec[i-1]*vDigit[9-i];\\n // }\\n // mp.emplace(num,count++);\\n // }while(next_permutation(vDigit.begin(),vDigit.end()));\\n // Your code here!\\n int h,v;\\n while(cin>>h>>v,h||v){\\n int hv[]={h,h,v,v};\\n int st=0;\\n int end=0;\\n int a;\\n vector<bool> visited(362880,false);\\n cin>>st;\\n for(int i=0;i<8;i++){\\n st*=10;\\n cin>>a;\\n st+=a;\\n }\\n cin>>end;\\n for(int i=0;i<8;i++){\\n end*=10;\\n cin>>a;\\n end+=a;\\n }\\n priority_queue<pair<int,int>> q;\\n q.emplace(0,st);\\n while(1){\\n int pos=q.top().second;\\n int cost=q.top().first;\\n if(pos==end){\\n cout<<-cost<<endl;\\n break;\\n }\\n q.pop();\\n int hash=makeHash(pos);\\n if(visited[hash]){\\n continue;\\n }\\n visited[hash]=true;\\n int zero=to_string(pos+1000000000).find('0')-1;\\n for(int i=0;i<4;i++){\\n int s=pos,t=8-((zero+dif[i]+9)%9);\\n int tmp=(pos/pDec[t])%10;\\n s+=(pDec[8-zero]*tmp-pDec[t]*tmp);\\n //cout<<tmp<<\\\" \\\"<<pos<<\\\" \\\"<<s<<endl;\\n q.emplace(cost-hv[i],s);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1990,\n \"memory_kb\": 10132,\n \"score_of_the_acc\": -0.2505,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1339_2736663\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n vector<bool> mp(5000000,false);\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if(!mp[num%4853333]){\\n mp[num%4853333]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if(!mp[stoi(ns)%4853333])\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3050,\n \"memory_kb\": 15428,\n \"score_of_the_acc\": -0.4571,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1339_2736655\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define fs first\\n#define sc second\\nconstexpr int tv[]={-3,-1,1,3};\\nconstexpr int p10[]={100000000,10000000,1000000,100000,10000,1000,100,10,1};\\nconstexpr int fact[]={40320,5040,720,120,24,6,2,1};\\n\\nint my_hash(int f){\\n int flag=0,ret=0;\\n rep(i,8){\\n ret+=fact[i]*(f%10-__builtin_popcount(flag&((1<<(f%10))-1)));\\n flag|=1<<(f%10);\\n f/=10;\\n }\\n return ret;\\n}\\n\\n\\nint main(){\\n \\n int h,v;\\n string a=\\\"123456789\\\",b=\\\"123456789\\\";\\n using data=pair<int,int>;\\n \\n while(cin>>h>>v, h or v){\\n vector<int> hm(362880,-10000000);\\n int tc[]={v,h,h,v};\\n rep(i,9)cin>>a[i];\\n rep(i,9)cin>>b[i];\\n int sa=stoi(\\\"1\\\"+a)-1000000000,sb=stoi(\\\"1\\\"+b)-1000000000;\\n\\n priority_queue<data> q;\\n q.emplace(0,sa);\\n \\n while(1){\\n int cost=q.top().fs;\\n int board=q.top().sc;\\n if(board==sb){\\n cout<<-cost<<endl;\\n break;\\n }\\n q.pop();\\n int index=to_string(board).find('0');\\n if(index==-1)index=0;\\n rep(i,4){\\n int fixed=(index+tv[i]+9)%9;\\n int next=board;\\n int fx=board/p10[fixed]%10;\\n next=next+(p10[index]-p10[fixed]) * fx;\\n int nc=cost-tc[i];\\n int hval=my_hash(next);\\n if(hm[hval]<nc){\\n q.emplace(nc, next);\\n hm[hval]=nc;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 7428,\n \"score_of_the_acc\": -0.1382,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1339_2736642\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define fs first\\n#define sc second\\nconstexpr int tv[]={-3,-1,1,3};\\nconstexpr int p10[]={100000000,10000000,1000000,100000,10000,1000,100,10,1};\\nconstexpr int fact[]={40320,5040,720,120,24,6,2,1};\\n\\nint my_hash(int f){\\n vector<int> v={0,1,2,3,4,5,6,7,8};\\n int ret=0;\\n rep(i,8){\\n auto itr=lower_bound(v.begin(),v.end(),f%10);\\n ret+=fact[i]*(itr-v.begin());\\n v.erase(itr);\\n f/=10;\\n }\\n return ret;\\n}\\n\\n\\nint main(){\\n \\n int h,v;\\n string a=\\\"123456789\\\",b=\\\"123456789\\\";\\n using data=pair<int,int>;\\n \\n while(cin>>h>>v, h or v){\\n vector<int> hm(362880,-10000000);\\n int tc[]={v,h,h,v};\\n rep(i,9)cin>>a[i];\\n rep(i,9)cin>>b[i];\\n int sa=stoi(\\\"1\\\"+a)-1000000000,sb=stoi(\\\"1\\\"+b)-1000000000;\\n\\n priority_queue<data> q;\\n q.emplace(0,sa);\\n \\n while(1){\\n int cost=q.top().fs;\\n int board=q.top().sc;\\n if(board==sb){\\n cout<<-cost<<endl;\\n break;\\n }\\n q.pop();\\n int index=to_string(board).find('0');\\n if(index==-1)index=0;\\n rep(i,4){\\n int fixed=(index+tv[i]+9)%9;\\n int next=board;\\n int fx=board/p10[fixed]%10;\\n next=next+(p10[index]-p10[fixed]) * fx;\\n int nc=cost-tc[i];\\n int hval=my_hash(next);\\n if(hm[hval]<nc){\\n q.emplace(nc, next);\\n hm[hval]=nc;\\n }\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2310,\n \"memory_kb\": 7384,\n \"score_of_the_acc\": -0.2631,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1339_2736634\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n unordered_map<int,bool> mp;\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if((mp.find(num)==mp.end())){\\n mp[num]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-v,ns));\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5900,\n \"memory_kb\": 29756,\n \"score_of_the_acc\": -1.0136,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1339_2736632\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h,v,i;\\n while(cin>>h>>v,h){\\n string s=\\\"\\\",e=\\\"\\\";\\n char tmp;\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n s+=tmp;\\n }\\n for(i=0;i<9;i++){\\n cin>>tmp;\\n e+=tmp;\\n }\\n priority_queue<pair<int,string>> q;\\n q.push(make_pair(0,s));\\n unordered_map<int,bool> mp;\\n pair<int,string> now;\\n int num,zero;\\n while(!q.empty()){\\n now=q.top();q.pop();\\n now.first*=-1;\\n num=stoi(now.second);\\n if(now.second==e){\\n cout<<now.first<<endl;\\n break;\\n }\\n if((mp.find(num)==mp.end())){\\n mp[num]=true;\\n }else{\\n continue;\\n }\\n zero=now.second.find('0');\\n string ns=now.second;\\n ns[zero]=ns[(zero+1)%9];\\n ns[(zero+1)%9]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero+1)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-1<0)?8:(zero-1)];\\n ns[(zero-1<0)?8:(zero-1)]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-h,ns));\\n ns[(zero-1<0)?8:(zero-1)]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero+3)%9];\\n ns[(zero+3)%9]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero+3)%9]=ns[zero];\\n ns[zero]='0';\\n \\n ns[zero]=ns[(zero-3>=0)?zero-3:(9-(3-zero))];\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]='0';\\n if((mp.find(stoi(ns))==mp.end()))\\n q.push(make_pair(-now.first-v,ns));\\n ns[(zero-3>=0)?zero-3:(9-(3-zero))]=ns[zero];\\n ns[zero]='0';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5860,\n \"memory_kb\": 29868,\n \"score_of_the_acc\": -1.0094,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1339_2736630\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\nint makeHash(int num){\\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\\n vector<int> pDec{1,10,100,1000,10000,100000,1000000,10000000,100000000};\\n int base=9;\\n int fct=362880;\\n int ans=0;\\n for(int i=base;i>1;i--){\\n fct/=i;\\n auto index=lower_bound(vDigit.begin(),vDigit.end(),(num/pDec[i-1])%10);\\n ans+=(index-vDigit.begin())*fct;\\n vDigit.erase(index);\\n }\\n return ans;\\n}\\n\\nint main(void){\\n // cout<<makeHash(305147826)<<endl;\\n // return 0;\\n vector<int> vDigit{0,1,2,3,4,5,6,7,8};\\n vector<int> pDec{1,10,100,1000,10000,100000,1000000,10000000,100000000};\\n \\n vector<int> dif{-1,1,-3,3};\\n // int count=0;\\n // do{\\n // int num=0;\\n // for(int i=9;i>0;i--){\\n // num+=pDec[i-1]*vDigit[9-i];\\n // }\\n // mp.emplace(num,count++);\\n // }while(next_permutation(vDigit.begin(),vDigit.end()));\\n // Your code here!\\n int h,v;\\n while(cin>>h>>v,h||v){\\n string st=\\\" \\\";\\n string end=\\\" \\\";\\n vector<bool> visited(362880,false);\\n vector<int> hv{h,h,v,v};\\n for(int i=0;i<9;i++){\\n cin>>st[i];\\n }\\n for(int i=0;i<9;i++){\\n cin>>end[i];\\n }\\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;\\n q.emplace(0,stoi(st));\\n int iend=stoi(end);\\n while(1){\\n int pos=q.top().second;\\n int cost=q.top().first;\\n if(pos==iend){\\n cout<<cost<<endl;\\n break;\\n }\\n q.pop();\\n int hash=makeHash(pos);\\n if(visited[hash]){\\n continue;\\n }\\n visited[hash]=true;\\n int zero=to_string(pos+1000000000).find('0')-1;\\n for(int i=0;i<4;i++){\\n int s=pos,t=8-((zero+dif[i]+9)%9);\\n int tmp=(pos/pDec[t])%10;\\n s+=(pDec[8-zero]*tmp-pDec[t]*tmp);\\n //cout<<tmp<<\\\" \\\"<<pos<<\\\" \\\"<<s<<endl;\\n q.emplace(cost+hv[i],s);\\n }\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2800,\n \"memory_kb\": 10088,\n \"score_of_the_acc\": -0.3615,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":792,"cells":{"group_id":{"kind":"string","value":"aoj_1340_cpp"},"problem_description":{"kind":"string","value":"Problem F:\nDirectional Resemblance\nVectors have their directions and two vectors make an angle between them. Given a set of three-dimensional vectors, your task is to find the pair among them that makes the smallest angle.\nInput\nThe input is a sequence of datasets. A dataset specifies a set of three-dimensional vectors, some of which are directly given in the dataset and the others are generated by the procedure described below.\nEach dataset is formatted as follows.\nm\nn\nS\nW\nx\n1\ny\n1\nz\n1\nx\n2\ny\n2\nz\n2\n:\nx\nm\ny\nm\nz\nm\nThe first line contains four integers\nm\n,\nn\n,\nS\n, and\nW\n.\nThe integer\nm\nis the number of vectors whose three components are directly specified in the\ndataset. Starting from the second line,\nm\nlines have the three components of\nm\nvectors. The\ni\n-th line of which indicates the vector\nv\ni\n= (\nx\ni\n,\ny\ni\n,\nz\ni\n). All the vector components are positive integers less than or equal to 100.\nThe integer\nn\nis the number of vectors generated by the following procedure.\nint g = S;\nfor(int i=m+1; i<=m+n; i++) {\n x[i] = (g/7) %100 + 1;\n y[i] = (g/700) %100 + 1;\n z[i] = (g/70000)%100 + 1;\n if( g%2 == 0 ) { g = (g/2); }\n else { g = (g/2) ^ W; }\n}\nFor\ni = m + 1, . . . , m + n\n, the\ni\n-th vector\nv\ni\nof the set has three components\nx[i]\n,\ny[i]\n, and\nz[i]\ngenerated by this procedure.\nHere, values of\nS\nand\nW\nare the parameters\nS\nand\nW\ngiven in the first line of the dataset. You may assume 1 ≤\nS\n≤ 10\n9\nand 1 ≤\nW\n≤ 10\n9\n.\nThe total number of vectors satisfies 2 ≤\nm + n\n≤ 12 × 10\n4\n. Note that exactly the same vector may be specified twice or more in a single dataset.\nA line containing four zeros indicates the end of the input. The total of\nm+n\nfor all the datasets in the input never exceeds 16 × 10\n5\n.\nOutput\nFor each dataset, output the pair of vectors among the specified set with the smallest non-zero angle in between. It is assured that there are at least two vectors having different directions.\nVectors should be indicated by their three components. The output for a pair of vectors\nv\na\nand\nv\nb\nshould be formatted in a line as follows.\nx\na\ny\na\nz\na\nx\nb\ny\nb\nz\nb\nTwo vectors (\nx\na\n,\ny\na\n,\nz\na\n) and (\nx\nb\n,\ny\nb\n,\nz\nb\n) are ordered in the dictionary order, that is,\nv\na\n<\nv\nb\nif\nx\na\n<\nx\nb\n, or if\nx\na\n= x\nb\nand\ny\na\n<\ny\nb\n, or if\nx\na\n= x\nb\n,\ny\na\n= y\nb\nand\nz\na\n<\nz\nb\n. When a vector pair is output, the smaller vector in this order should be output first.\nIf more than one pair makes the equal smallest angle, the pair that is the smallest among them in the dictionary order between vector pairs should be output. The pair (\nv\ni\n,\nv\nj\n) is smaller than the pair (\nv\nk\n,\nv\nl\n) if\nv\ni\n<\nv\nk\n, or if\nv\ni\n= v\nk\nand\nv\nj\n<\nv\nl\n.\nSample Input\n4 0 2013 1124\n1 1 1\n2 2 2\n2 1 1\n1 2 1\n2 100 131832453 129800231\n42 40 46\n42 40 46\n0 100000 7004674 484521438\n0 0 0 0\nOutput for the Sample Input\n1 1 1 1 2 1\n42 40 46 83 79 91\n92 92 79 99 99 85"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1340_10848362","code_snippet":"#include <bits/stdc++.h>\n//using namespace std;\n\ntypedef long double LD;\n\nconst LD INF = 1e15;\nconst LD eps = 1e-13;\nconst int N = 155555;\n\nint n, m, S, W;\n\ninline LD norm(const LD &x) {\n\treturn x * x;\n}\n\nstruct OriP {\n\tint x, y, z;\n} p[N];\n\nstruct Point {\n\tLD x, y, z;\n\tint id;\n\tPoint() = default;\n\tPoint(const OriP &p) {\n\t\tx = p.x;\n\t\ty = p.y;\n\t\tz = p.z;\n\t}\n\tconst LD& operator [] (int index) const {\n\t\tif (index == 0) {\n\t\t\treturn x;\n\t\t} else {\n\t\t\treturn index == 1 ? y : z;\n\t\t}\n\t}\n\tfriend LD dist(const Point &a, const Point &b) {\n\t\tLD result = 0.0;\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tresult += norm(a[i] - b[i]);\n\t\t}\n\t\treturn result;\n\t}\n} point[N];\n\ninline bool operator == (const OriP &p, const OriP &q) {\n\treturn p.x == q.x && p.y == q.y && p.z == q.z;\n}\n\ninline bool operator < (const OriP &p, const OriP &q) {\n\tif (p.x != q.x) {\n\t\treturn p.x < q.x;\n\t}\n\tif (p.y != q.y) {\n\t\treturn p.y < q.y; \n\t} else {\n\t\treturn p.z < q.z;\n\t}\n}\n\ninline bool operator > (const OriP &p, const OriP &q) {\n\tif (p.x != q.x) {\n\t\treturn p.x > q.x;\n\t}\n\tif (p.y != q.y) {\n\t\treturn p.y > q.y; \n\t} else {\n\t\treturn p.z > q.z;\n\t}\n}\n\nstruct Rectangle {\n\tLD min[3], max[3];\n\tRectangle() {\n\t\tmin[0] = min[1] = min[2] = INF;\n\t\tmax[0] = max[1] = max[2] = -INF;\n\t}\n\tvoid add(const Point &p) {\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tmin[i] = std::min(min[i], p[i]);\n\t\t\tmax[i] = std::max(max[i], p[i]);\n\t\t}\n//assert(min[0] > -1 && min[1] > -1 && min[2] > -1);\n//assert(min[0] < 100 && min[1] < 100 && min[2] < 100);\n\t}\n\tdouble dist(const Point &p) {\n\t\n\t//std::cout << min[0] << \" \" << min[1] << \" \" << min[2] << std::endl;\n\t//std::cout << max[0] << \" \" << max[1] << \" \" << max[2] << std::endl;\n\t\tdouble result = 0;\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tresult += norm(std::min(std::max(p[i], min[i]), max[i]) - p[i]);\n\t\t\t//result += std::max(norm(max[i] - p[i]), norm(min[i] - p[i]));\n\t\t}\n//assert(min[0] > -1 && min[1] > -1 && min[2] > -1);\n//assert(min[0] < 100 && min[1] < 100 && min[2] < 100);\n//return INF;\n\t\treturn result;\n\t}\n};\n\nstruct Node {\n\tPoint seperator;\n\tRectangle rectangle;\n\tint child[2];\n\tvoid reset(const Point &p) {\n\t\tseperator = p;\n\t\trectangle = Rectangle();\n\t\trectangle.add(p);\n\t\tchild[0] = child[1] = 0;\n\t}\n} tree[N << 1];\n\nint size, pivot;\n\ninline int sign(LD x) {\n\tif (x < -eps) {\n\t\treturn -1;\n\t}\n\telse {\n\t\treturn x > eps;\n\t}\n}\n\ninline bool compare(const Point &a, const Point &b) {\n//std::cerr << \"cmp\" << \" \" << pivot << \" \" << a.x << \" \" << a.y << \" \" << a.z << \" \" << b.x << \" \" << b.y << \" \" << b.z << std::endl;\n//std::cerr << a[pivot] << \" \" << b[pivot] << std::endl;\n\tif (sign(a[pivot] - b[pivot]) == 0) {\n//std::cerr << \"check_id \" << a.id << \" \" << b.id << std::endl;\n\t\tif (a.id == -1 || b.id == -1) {\n\t\t\treturn true;\n\t\t}\n\t\treturn p[a.id] < p[b.id];\n\t} else {\n\t\treturn a[pivot] < b[pivot];\n\t}\n}\n\ninline int build(int l, int r, int type = 1) {\n//std::cout << l << \" \" << r << \" \" << std::endl;\n\tpivot = type;\n\tif (l > r) {\n\t\treturn 0;\n\t}\n\tint x = ++size;\n\tint mid = l + r >> 1;\n\tstd::nth_element(point + l, point + mid, point + r, compare);\n\ttree[x].reset(point[mid]);\n//std::cout << l << \" \" << mid << \" \" << r << \" \" << tree[x].seperator.id << std::endl;\n//std::cout << tree[x].seperator.x << \" \" << tree[x].seperator.y << \" \" << tree[x].seperator.z << \" \" << std::endl;\n\tfor (int i = l; i <= r; ++i) {\n\t\ttree[x].rectangle.add(point[i]);\n\t}\n\ttree[x].child[0] = build(l, mid - 1, (type + 1) % 3);\n\ttree[x].child[1] = build(mid + 1, r, (type + 1) % 3);\n\t\n//assert(tree[x].rectangle.min[0] > -1 && tree[x].rectangle.min[1] > -1 && tree[x].rectangle.min[2] > -1);\n//assert(tree[x].rectangle.min[0] < 100 && tree[x].rectangle.min[1] < 100 && tree[x].rectangle.min[2] < 100);\n\treturn x;\n}\n\ninline void query(int x, const Point &u, std::pair<LD, int> & answer, int type = 1) {\n//std::cout << \"root = \" << x << \" \" << u.x << \" \" << u.y << \" \" << u.z << std::endl;\n\tif (!x) {\n\t\treturn;\n\t}\n\tpivot = type;\n//std::cout << tree[x].rectangle.dist(u) << std::endl;\n\tif (tree[x].rectangle.dist(u) > answer.first + 1e-6) {\n\t\treturn;\n\t}\n\tdouble d = dist(tree[x].seperator, u);\n\t\n/*std::cout << \"asdfasf\" << std::endl;\nstd::cout << u.x << \" \" << u.y << \" \" << u.z << std::endl;\nstd::cout << tree[x].seperator.x << \" \" << tree[x].seperator.y << \" \" << tree[x].seperator.z << \" \" << std::endl;\nstd::cout << d << \" \" << sign(d) << std::endl;\n*/\n\t\n\tif (sign(d) && (sign(d - answer.first) == -1 || sign(d - answer.first) == 0 && p[tree[x].seperator.id] < p[answer.second])) {\n\t\tanswer = std::make_pair(d, tree[x].seperator.id);\n\t}\n//std::cerr << \"gogogo\" << std::endl;\n\tif (compare(u, tree[x].seperator)) {\n\t\tquery(tree[x].child[0], u, answer, (type + 1) % 3);\n\t\tquery(tree[x].child[1], u, answer, (type + 1) % 3);\n\t} else {\n\t\tquery(tree[x].child[1], u, answer, (type + 1) % 3);\n\t\tquery(tree[x].child[0], u, answer, (type + 1) % 3);\n\t}\n} \n\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tstd::cout.tie(0);\n\t\n\twhile (std::cin >> m >> n >> S >> W) {\n\t\tif (!m && !n && !S && !W) {\n\t\t\treturn 0;\n\t\t}\n\t\tfor (int i = 1; i <= m; ++i) {\n\t\t\tstd::cin >> p[i].x >> p[i].y >> p[i].z;\n\t\t}\n\t\tint g = S;\n\t\tfor (int i = 1; i <= n; ++i) {\n\t\t//std::cerr << i << std::endl;\n\t\t\tp[i + m].x = (g / 7) % 100 + 1;\n\t\t\tp[i + m].y = (g / 700) % 100 + 1;\n\t\t\tp[i + m].z = (g / 70000) % 100 + 1;\n\t\t\tif (g % 2 == 0) {\n\t\t\t\tg = g / 2;\t\n\t\t\t} else {\n\t\t\t\tg = (g / 2) ^ W;\n\t\t\t}\n\t\t}\n\t\tn += m;//return 0;\n\t\t\n\t\tstd::pair<LD, int> nowans;\n\t\tfor (int i = 1; i <= n; ++i) {\n\t\t\tdouble dist = sqrt(p[i].x * p[i].x + p[i].y * p[i].y + p[i].z * p[i].z);\n\t\t\tpoint[i].x = p[i].x / dist;\n\t\t\tpoint[i].y = p[i].y / dist;\n\t\t\tpoint[i].z = p[i].z / dist;\n\t\t\tpoint[i].id = i;\n//std::cout << \"node[\" << i << \"]= \" << p[i].x << \" \" << p[i].y << \" \" << p[i].z << std::endl;\n//std::cout << point[i].x << \" \" << point[i].y << \" \" << point[i].z << std::endl;\n\t\t}\n\t\tsize = 0;\n\t\tbuild(1, n);// return 0;\n\t\t//std::cout << size << std::endl; return 0;\n\t\t//std::cout << \"adsf\" << std::endl;\n\t\tstd::pair<int, int> ans = std::make_pair(-1, 2);\n\t\tdouble ansd = (p[1].x * p[2].x + p[1].y * p[2].y + p[1].z * p[2].z) \n\t\t\t\t/ sqrt(p[1].x * p[1].x + p[1].y * p[1].y + p[1].z * p[1].z)\n\t\t\t\t/ sqrt(p[2].x * p[2].x + p[2].y * p[2].y + p[2].z * p[2].z);\n\t\tfor (int i = 1; i <= n; ++i) {\n\t\t\tnowans = std::make_pair(INF, 0);\n\t\t\tPoint u(p[i]);\n\t\t\tdouble d = sqrt(p[i].x * p[i].x + p[i].y * p[i].y + p[i].z * p[i].z);\n\t\t\tu.x /= d;\n\t\t\tu.y /= d;\n\t\t\tu.z /= d;\n\t\t\tu.id = -1;\n//std::cerr << \"query \" << i << \" \" << std::endl;\n\t\t\tquery(1, u, nowans);\n\t\t\tstd::pair<int, int> now = std::make_pair(i, nowans.second);\n\t\t\tif (p[now.first] > p[now.second]) {\n\t\t\t\tstd::swap(now.first, now.second);\n\t\t\t}\n\t\t\tint j = now.first, k = now.second;\n\t\t\td = (p[j].x * p[k].x + p[j].y * p[k].y + p[j].z * p[k].z) \n\t\t\t\t/ sqrt(p[j].x * p[j].x + p[j].y * p[j].y + p[j].z * p[j].z)\n\t\t\t\t/ sqrt(p[k].x * p[k].x + p[k].y * p[k].y + p[k].z * p[k].z);\n/*std::cout << \"now: \" << i << \" \" << d << \" \" << nowans.second << \" \" << nowans.first << std::endl;\nstd::cout << u.x << \" \" << u.y << \" \" << u.z << std::endl;\nstd::cout << p[nowans.second].x << \" \" << p[nowans.second].y << \" \" << p[nowans.second].z << std::endl;\t\n*/\t\t\tif (ans.first == -1) {\n\t\t\t\tans = now;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (sign(d - ansd) == -1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (sign(d - ansd) == 1) {\t\n\t\t\t\tans = now;\n\t\t\t\tansd = d;\n\t\t\t} else {\n\t\t\t\tif (p[j] < p[ans.first] || p[j] == p[ans.first] && p[k] < p[ans.second]) {\n\t\t\t\t\tans = now;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//std::cerr << \"123\" << std::endl;\n\t\t\n\t\tstd::cout << p[ans.first].x << \" \" << p[ans.first].y << \" \" << p[ans.first].z << \" \" \n\t\t\t\t<< p[ans.second].x << \" \" << p[ans.second].y << \" \" << p[ans.second].z << std::endl;\n\t}\t\n}","accuracy":1,"time_ms":3400,"memory_kb":67544,"score_of_the_acc":-1.4083,"final_rank":19},{"submission_id":"aoj_1340_6148187","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\n\n\n\n\nint m, n, s, w;\nvoid solve() {\n\tvector<vector<int>> v(m + n);\n\trep(i, m) {\n\t\tv[i].resize(3);\n\t\trep(j, 3)cin >> v[i][j];\n\t}\n\tint g = s;\n\trep(i, n) {\n\t\tv[i + m].resize(3);\n\t\tv[i + m][0] = (g / 7) % 100 + 1;\n\t\tv[i + m][1] = (g / 700) % 100 + 1;\n\t\tv[i + m][2] = (g / 70000) % 100 + 1;\n\t\tif (g % 2 == 0)g /= 2;\n\t\telse g = (g / 2) ^ w;\n\t}\n\t//erase same vector\n\t{\n\t\tvector<vector<int>> nv;\n\t\tset<vector<int>> st;\n\t\trep(i, m + n) {\n\t\t\tint g = 0;\n\t\t\trep(j, 3)g = gcd(g, v[i][j]);\n\t\t\tvector<int> cur(3);\n\t\t\trep(j, 3)cur[j] = v[i][j] / g;\n\t\t\tif (!st.count(cur)) {\n\t\t\t\tnv.push_back(v[i]);\n\t\t\t\tst.insert(cur);\n\t\t\t}\n\t\t}\n\t\tswap(v, nv);\n\t\tn = v.size();\n\t\tsort(all(v));\n\t}\n\tassert(n >= 2);\n\tvector<pair<LDP, int>> vtp;\n\tvector<ld> rr(n);\n\trep(i, n) {\n\t\trr[i] = sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1] + v[i][2] * v[i][2]);\n\t\tvtp.push_back({ {v[i][0] / rr[i],v[i][1] / rr[i]},i });\n\t}\n\tsort(all(vtp));\n\tauto calc = [&](int i, int j) {\n\t\tld res = 0;\n\t\trep(k, 3)res += (v[i][k]/rr[i] - v[j][k]/rr[j]) * (v[i][k]/rr[i] - v[j][k]/rr[j]);\n\t\treturn res;\n\t};\n\tld ans = mod;\n\tP ansp = { -1,-1 };\n\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\n\t\tld mi = mod;\n\t\tif (l + 1 == r)return mod;\n\t\tint m = (l + r) / 2;\n\t\tchmin(mi, yaru(l, m));\n\t\tchmin(mi, yaru(m, r));\n\t\tld res = mi;\n\t\tld t = vtp[m - 1].first.first;\n\t\tvector<pair<ld, int>> vl, vr;\n\t\tRep(i, l, m) {\n\t\t\tld dx = t - vtp[i].first.first;\n\t\t\tif (dx*dx > ans + (1e-8))continue;\n\t\t\tvl.push_back({ vtp[i].first.second,vtp[i].second });\n\t\t}\n\t\tRep(i, m, r) {\n\t\t\tld dx = t - vtp[i].first.first;\n\t\t\tif (dx * dx > ans + (1e-8))continue;\n\t\t\tvr.push_back({ vtp[i].first.second,vtp[i].second });\n\t\t}\n\t\tsort(all(vl));\n\t\tsort(all(vr));\n\t\tint locl = 0;\n\t\tint locr = 0;\n\t\t//[locl,locr)\n\t\trep(i, vl.size()) {\n\t\t\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\n\t\t\t\tld dy = vl[i].first - vr[locl].first;\n\t\t\t\tif (dy * dy > ans + (1e-8))locl++;\n\t\t\t\telse break;\n\t\t\t}\n\t\t\twhile (locr < vr.size()) {\n\t\t\t\tif (vr[locr].first < vl[i].first)locr++;\n\t\t\t\telse {\n\t\t\t\t\tld dy = vr[locr].first - vl[i].first;\n\t\t\t\t\tif (dy * dy > ans + (1e-8))break;\n\t\t\t\t\telse locr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tassert(locl <= locr);\n\t\t\tRep(j, locl, locr) {\n\t\t\t\tld val = calc(vl[i].second,vr[j].second);\n\t\t\t\tP p = minmax(vl[i].second, vr[j].second);\n\t\t\t\tif (abs(ans - val) < (1e-12)) {\n\t\t\t\t\tansp = min(ansp, p);\n\t\t\t\t}\n\t\t\t\telse if (ans > val) {\n\t\t\t\t\tans = val;\n\t\t\t\t\tansp = p;\n\t\t\t\t}\n\t\t\t\tres = min(res, val);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t};\n\tyaru(0, n);\n\tassert(ansp.first >= 0);\n\tvector<int> anss;\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.first][j]);\n\t}\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.second][j]);\n\t}\n\tcoutarray(anss);\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\twhile (cin >> m >> n >> s >> w, m + n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":1510,"memory_kb":26936,"score_of_the_acc":-0.5104,"final_rank":4},{"submission_id":"aoj_1340_6148183","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tif (x == 0)return 0;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tint n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) {\n\t\tif (m < 0 || mod <= m) {\n\t\t\tm %= mod; if (m < 0)m += mod;\n\t\t}\n\t\tn = m;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 20;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\n\n\n\nint m, n, s, w;\nvoid solve() {\n\tvector<vector<int>> v(m + n);\n\trep(i, m) {\n\t\tv[i].resize(3);\n\t\trep(j, 3)cin >> v[i][j];\n\t}\n\tint g = s;\n\trep(i, n) {\n\t\tv[i + m].resize(3);\n\t\tv[i + m][0] = (g / 7) % 100 + 1;\n\t\tv[i + m][1] = (g / 700) % 100 + 1;\n\t\tv[i + m][2] = (g / 70000) % 100 + 1;\n\t\tif (g % 2 == 0)g /= 2;\n\t\telse g = (g / 2) ^ w;\n\t}\n\t//erase same vector\n\t{\n\t\tvector<vector<int>> nv;\n\t\tset<vector<int>> st;\n\t\trep(i, m + n) {\n\t\t\tint g = 0;\n\t\t\trep(j, 3)g = gcd(g, v[i][j]);\n\t\t\tvector<int> cur(3);\n\t\t\trep(j, 3)cur[j] = v[i][j] / g;\n\t\t\tif (!st.count(cur)) {\n\t\t\t\tnv.push_back(v[i]);\n\t\t\t\tst.insert(cur);\n\t\t\t}\n\t\t}\n\t\tswap(v, nv);\n\t\tn = v.size();\n\t\tsort(all(v));\n\t}\n\tassert(n >= 2);\n\tvector<pair<LDP, int>> vtp;\n\tvector<ld> rr(n);\n\trep(i, n) {\n\t\trr[i] = sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1] + v[i][2] * v[i][2]);\n\t\tvtp.push_back({ {v[i][0] / rr[i],v[i][1] / rr[i]},i });\n\t}\n\tsort(all(vtp));\n\tauto calc = [&](int i, int j) {\n\t\tld res = 0;\n\t\trep(k, 3)res += (v[i][k]/rr[i] - v[j][k]/rr[j]) * (v[i][k]/rr[i] - v[j][k]/rr[j]);\n\t\treturn res;\n\t};\n\tld ans = mod;\n\tP ansp = { -1,-1 };\n\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\n\t\tld mi = mod;\n\t\tif (l + 1 == r)return mod;\n\t\tint m = (l + r) / 2;\n\t\tchmin(mi, yaru(l, m));\n\t\tchmin(mi, yaru(m, r));\n\t\tld res = mi;\n\t\tld t = vtp[m - 1].first.first;\n\t\tvector<pair<ld, int>> vl, vr;\n\t\tRep(i, l, m) {\n\t\t\tld dx = t - vtp[i].first.first;\n\t\t\tif (dx*dx > ans + (1e-8))continue;\n\t\t\tvl.push_back({ vtp[i].first.second,vtp[i].second });\n\t\t}\n\t\tRep(i, m, r) {\n\t\t\tld dx = t - vtp[i].first.first;\n\t\t\tif (dx * dx > ans + (1e-8))continue;\n\t\t\tvr.push_back({ vtp[i].first.second,vtp[i].second });\n\t\t}\n\t\tsort(all(vl));\n\t\tsort(all(vr));\n\t\t//cout << \"! \" << l << \" \" << r << \" \" << vl.size() << \" \" << vr.size() << \"\\n\";\n\t\tint locl = 0;\n\t\tint locr = 0;\n\t\t//[locl,locr)\n\t\trep(i, vl.size()) {\n\t\t\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\n\t\t\t\tld dy = vl[i].first - vr[locl].first;\n\t\t\t\tif (dy * dy > ans + (1e-8))locl++;\n\t\t\t\telse break;\n\t\t\t}\n\t\t\twhile (locr < vr.size()) {\n\t\t\t\tif (vr[locr].first < vl[i].first)locr++;\n\t\t\t\telse {\n\t\t\t\t\tld dy = vr[locr].first - vl[i].first;\n\t\t\t\t\tif (dy * dy > ans + (1e-8))break;\n\t\t\t\t\telse locr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tassert(locl <= locr);\n\t\t\tRep(j, locl, locr) {\n\t\t\t\tld val = calc(vl[i].second,vr[j].second);\n\t\t\t\tP p = minmax(vl[i].second, vr[j].second);\n\t\t\t\tif (abs(ans - val) < (1e-12)) {\n\t\t\t\t\tansp = min(ansp, p);\n\t\t\t\t}\n\t\t\t\telse if (ans > val) {\n\t\t\t\t\tans = val;\n\t\t\t\t\tansp = p;\n\t\t\t\t}\n\t\t\t\tres = min(res, val);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t};\n\tyaru(0, n);\n\tassert(ansp.first >= 0);\n\tvector<int> anss;\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.first][j]);\n\t}\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.second][j]);\n\t}\n\t//cout << \"ans is \";\n\tcoutarray(anss);\n\t/*int id1 = -1;\n\trep(i, v.size())if (v[i] == vector<int>{42, 40, 46})id1 = i;\n\tint id2 = -1;\n\trep(i, v.size())if (v[i] == vector<int>{83, 79, 91})id2 = i;\n\tcout << ans << \" \" << calc(id1,id2) << \"\\n\";\n\tcout << \"! \" << id1 << \" \" << id2 << \"\\n\";*/\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//while(true)\n\t//expr();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\twhile (cin >> m >> n >> s >> w, m + n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":1510,"memory_kb":35164,"score_of_the_acc":-0.6411,"final_rank":5},{"submission_id":"aoj_1340_6148147","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\n#include<chrono>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\ntemplate<typename T>\nvoid chmin(T& a, T b) {\n\ta = min(a, b);\n}\ntemplate<typename T>\nvoid chmax(T& a, T b) {\n\ta = max(a, b);\n}\ntemplate<typename T>\nvoid cinarray(vector<T>& v) {\n\trep(i, v.size())cin >> v[i];\n}\ntemplate<typename T>\nvoid coutarray(vector<T>& v) {\n\trep(i, v.size()) {\n\t\tif (i > 0)cout << \" \"; cout << v[i];\n\t}\n\tcout << \"\\n\";\n}\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tif (x == 0)return 0;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tint n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) {\n\t\tif (m < 0 || mod <= m) {\n\t\t\tm %= mod; if (m < 0)m += mod;\n\t\t}\n\t\tn = m;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 20;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nll gcd(ll a, ll b) {\n\ta = abs(a); b = abs(b);\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tll r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\n\n\n\nint m, n, s, w;\nvoid solve() {\n\tvector<vector<int>> v(m + n);\n\trep(i, m) {\n\t\tv[i].resize(3);\n\t\trep(j, 3)cin >> v[i][j];\n\t}\n\tint g = s;\n\trep(i, n) {\n\t\tv[i + m].resize(3);\n\t\tv[i + m][0] = (g / 7) % 100 + 1;\n\t\tv[i + m][1] = (g / 700) % 100 + 1;\n\t\tv[i + m][2] = (g / 70000) % 100 + 1;\n\t\tif (g % 2 == 0)g /= 2;\n\t\telse g = (g / 2) ^ w;\n\t}\n\t//erase same vector\n\t{\n\t\tvector<vector<int>> nv;\n\t\tset<vector<int>> st;\n\t\trep(i, m + n) {\n\t\t\tint g = 0;\n\t\t\trep(j, 3)g = gcd(g, v[i][j]);\n\t\t\tvector<int> cur(3);\n\t\t\trep(j, 3)cur[j] = v[i][j] / g;\n\t\t\tif (!st.count(cur)) {\n\t\t\t\tnv.push_back(v[i]);\n\t\t\t\tst.insert(cur);\n\t\t\t}\n\t\t}\n\t\tswap(v, nv);\n\t\tn = v.size();\n\t\tsort(all(v));\n\t}\n\tassert(n >= 2);\n\t//rep(i, n)coutarray(v[i]);\n\tvector<LDP> vt(n);\n\trep(i, n) {\n\t\tvt[i] = { atan2l(v[i][1],v[i][0]),atan2l(v[i][2],sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1])) };\n\t}\n\tvector<pair<LDP, int>> vtp;\n\trep(i, n) {\n\t\tvtp.push_back({ vt[i],i });\n\t}\n\tsort(all(vtp));\n\tauto trans = [&](LDP a, ld& x, ld& y, ld& z) {\n\t\tz = sin(a.second);\n\t\tld xy = cos(a.second);\n\t\tx = xy * cos(a.first);\n\t\ty = xy * sin(a.first);\n\t};\n\tauto calc = [&](LDP a, LDP b) {\n\t\tld x1, y1, z1, x2, y2, z2;\n\t\ttrans(a, x1, y1, z1);\n\t\ttrans(b, x2, y2, z2);\n\t\treturn (x1 * x2 + y1 * y2 + z1 * z2) / sqrt(x1 * x1 + y1 * y1 + z1 * z1) / sqrt(x2 * x2 + y2 * y2 + z2 * z2);\n\t};\n\tld ans = 0;\n\tP ansp = { -1,-1 };\n\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\n\t\tld ma = 0;\n\t\tif (l + 1 == r)return 0;\n\t\tint m = (l + r) / 2;\n\t\tchmax(ma, yaru(l, m));\n\t\tchmax(ma, yaru(m, r));\n\t\tld res = ma;\n\t\tld t = vt[m - 1].first;\n\t\tvector<pair<ld, int>> vl, vr;\n\t\tRep(i, l, m) {\n\t\t\tLDP mirr = { t,vt[i].second };\n\t\t\tif (calc(mirr, vt[i]) < ma - (1e-0))continue;\n\t\t\t//if (l == 0 &&r == n)cout << \"!! \" << i << \"\\n\";\n\t\t\tvl.push_back({ vt[i].second,i });\n\t\t}\n\t\tRep(i, m, r) {\n\t\t\tLDP mirr = { t,vt[i].second };\n\t\t\tif (calc(mirr, vt[i]) < ma - (1e-0))continue;\n\t\t\tvr.push_back({ vt[i].second,i });\n\t\t\t//if (l == 0 && r == n)cout << \"!! \" << i << \"\\n\";\n\t\t}\n\t\tsort(all(vl));\n\t\tsort(all(vr));\n\t\t//cout << \"! \" << l << \" \" << r << \" \" << vl.size() << \" \" << vr.size() << \"\\n\";\n\t\tint locl = 0;\n\t\tint locr = 0;\n\t\t//[locl,locr)\n\t\trep(i, vl.size()) {\n\t\t\tLDP cur = vt[vl[i].second];\n\t\t\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\n\t\t\t\tLDP mirr = cur; mirr.second = vr[locl].first;\n\t\t\t\tif (calc(mirr, cur) < ma - (1e-8))locl++;\n\t\t\t\telse break;\n\t\t\t}\n\t\t\twhile (locr < vr.size()) {\n\t\t\t\tif (vr[locr].first < vl[i].first)locr++;\n\t\t\t\telse {\n\t\t\t\t\tLDP mirr = cur; mirr.second = vr[locr].first;\n\t\t\t\t\tif (calc(mirr, cur) < ma - (1e-8))break;\n\t\t\t\t\telse locr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tassert(locl <= locr);\n\t\t\tRep(j, locl, locr) {\n\t\t\t\tld val = calc(cur, vt[vr[j].second]);\n\t\t\t\tP p = { vl[i].second,vr[j].second };\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\t//cout << \"!! \" << p.first << \" \" << p.second << \"\\n\";\n\t\t\t\tif (abs(ans - val) < (1e-12)) {\n\t\t\t\t\tansp = min(ansp, p);\n\t\t\t\t}\n\t\t\t\telse if (ans < val) {\n\t\t\t\t\tans = val;\n\t\t\t\t\tansp = p;\n\t\t\t\t}\n\t\t\t\tres = max(res, val);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t};\n\tyaru(0, n);\n\tassert(ansp.first >= 0);\n\tvector<int> anss;\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.first][j]);\n\t}\n\trep(j, 3) {\n\t\tanss.push_back(v[ansp.second][j]);\n\t}\n\t//cout << \"ans is \";\n\tcoutarray(anss);\n\t/*int id1 = -1;\n\trep(i, v.size())if (v[i] == vector<int>{42, 40, 46})id1 = i;\n\tint id2 = -1;\n\trep(i, v.size())if (v[i] == vector<int>{83, 79, 91})id2 = i;*/\n\t//cout << ans << \" \" << calc(vt[id1], vt[id2]) << \"\\n\";\n\t//cout << \"! \" << id1 << \" \" << id2 << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(10);\n\t//init_f();\n\t//init();\n\t//while(true)\n\t//expr();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\twhile (cin >> m >> n >> s >> w, m + n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":5280,"memory_kb":35448,"score_of_the_acc":-1.1503,"final_rank":13},{"submission_id":"aoj_1340_3707121","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n//#define EPS 0.000000001\nusing namespace std;\n\n#define EPS 0.0000001\n#define NUM 120005\n\nstruct Info{\n\n\tbool operator<(const struct Info &arg) const{\n\t\treturn angle < arg.angle;\n\t}\n\tll x,y,z;\n\tdouble angle;\n};\n\n\nint N;\nInfo info[NUM];\n\n\ndouble calc_angle(Info A,Info B){\n\n\tdouble bunshi = A.x*B.x+A.y*B.y+A.z*B.z;\n\tdouble bunbo = sqrt(A.x*A.x+A.y*A.y+A.z*A.z)*sqrt(B.x*B.x+B.y*B.y+B.z*B.z);\n\n\treturn acos(bunshi/bunbo);\n}\n\nbool compare(Info A,Info B){\n\n\tif(A.x != B.x){\n\n\t\treturn A.x < B.x;\n\n\t}else if(A.y != B.y){\n\n\t\treturn A.y < B.y;\n\n\t}else if(A.z != B.z){\n\n\t\treturn A.z < B.z;\n\t}\n\treturn -1;\n}\n\nbool isSame(Info A,Info B){\n\n\treturn A.x == B.x && A.y == B.y && A.z == B.z;\n}\n\nvoid func(){\n\n\n\tInfo base;\n\tbase.x = 1;\n\tbase.y = 1;\n\tbase.z = 1;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tinfo[i].angle = calc_angle(base,info[i]);\n\t}\n\n\tsort(info,info+N);\n\n\tInfo ans_L,ans_R;\n\n\tdouble minimum = acos(0);\n\tdouble tmp_angle;\n\n\tfor(int i = 0; i < N-1; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(fabs(info[i].angle - info[k].angle) > minimum) break;\n\n\t\t\ttmp_angle = calc_angle(info[i],info[k]);\n\t\t\tif(tmp_angle < EPS)continue;\n\n\t\t\tif(tmp_angle+EPS < minimum){\n\t\t\t\tminimum = tmp_angle;\n\n\t\t\t\tif(compare(info[i],info[k])){\n\n\t\t\t\t\tans_L = info[i];\n\t\t\t\t\tans_R = info[k];\n\n\t\t\t\t}else{\n\n\t\t\t\t\tans_L = info[k];\n\t\t\t\t\tans_R = info[i];\n\t\t\t\t}\n\n\t\t\t}else if(fabs(tmp_angle-minimum) < EPS){\n\n\t\t\t\tif(compare(info[i],info[k])){\n\n\t\t\t\t\tif((compare(info[i],ans_L) == true) || (isSame(info[i],ans_L) && compare(info[k],ans_R) == true)){\n\n\t\t\t\t\t\tans_L = info[i];\n\t\t\t\t\t\tans_R = info[k];\n\t\t\t\t\t}\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif((compare(info[k],ans_L) == true) || (isSame(info[k],ans_L) && compare(info[i],ans_R) == true)){\n\n\t\t\t\t\t\tans_L = info[k];\n\t\t\t\t\t\tans_R = info[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld %lld %lld %lld %lld %lld\\n\",ans_L.x,ans_L.y,ans_L.z,ans_R.x,ans_R.y,ans_R.z);\n}\n\nint main(){\n\n\tll num_1,num_2,S,W;\n\n\twhile(true){\n\n\t\tscanf(\"%lld %lld %lld %lld\",&num_1,&num_2,&S,&W);\n\t\tif(num_1 == 0 && num_2 == 0 && S == 0 && W == 0)break;\n\n\t\tfor(int i = 0; i < num_1; i++){\n\n\t\t\tscanf(\"%lld %lld %lld\",&info[i].x,&info[i].y,&info[i].z);\n\t\t}\n\n\t\tll g = S;\n\n\t\tfor(int i = 0; i < num_2; i++){\n\t\t\tinfo[i+num_1].x = (g/7) %100 + 1;\n\t\t\tinfo[i+num_1].y = (g/700) %100 + 1;\n\t\t\tinfo[i+num_1].z = (g/70000)%100 + 1;\n\t\t\tif( g%2 == 0 ) { g = (g/2); }\n\t\t\telse { g = (g/2) ^ W; }\n\t\t}\n\n\t\tN = num_1+num_2;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":1010,"memory_kb":6756,"score_of_the_acc":-0.123,"final_rank":2},{"submission_id":"aoj_1340_3086248","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <map>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e18;\n\nbool epsleq(const double &a, const double &b){\n return a +EPS < b;\n}\nbool epseq(const double &a, const double &b){\n return abs(a-b) < EPS;\n}\n\nstruct Point{\n double x,y,z;\n Point(double x, double y, double z):x(x), y(y), z(z){}\n Point(){}\n Point &operator +=(const Point &a){ x+=a.x; y+=a.y; z+=a.z; return *this; }\n Point &operator -=(const Point &a){ x-=a.x; y-=a.y; z-=a.z; return *this; }\n Point &operator *=(const double &a){ x*=a; y*=a; z*=a; return *this; }\n Point operator +(const Point &a) const{ return Point(x+a.x, y+a.y, z+a.z); }\n Point operator -(const Point &a) const{ return Point(x-a.x, y-a.y, z-a.z); }\n Point operator *(const double &a) const{ return Point(a*x, a*y, a*z); }\n Point operator -() { return Point(-x, -y, -z); }\n bool operator <(const Point &a) const{\n return !epseq(x, a.x)? x < a.x: !epseq(y, a.y)? y < a.y: epsleq(z, a.z);\n }\n bool operator ==(const Point &a) const{\n double dx=x-a.x, dy=y-a.y, dz=z-a.z;\n return sqrt(dx*dx +dy*dy +dz*dz) < EPS;\n }\n};\n\ndouble dot(const Point &a, const Point &b){\n return a.x*b.x +a.y*b.y +a.z*b.z;\n}\nPoint cross(const Point &a, const Point &b){\n return Point(a.y*b.z -a.z*b.y, a.z*b.x -a.x*b.z, a.x*b.y -a.y*b.x);\n}\ndouble abs(const Point &a){\n return sqrt(dot(a, a));\n}\nPoint unit(const Point &a){\n return a *(1/abs(a));\n}\n\nbool ycomp(const Point &a, const Point &b){\n return !epseq(a.y, b.y)? a.y < b.y: !epseq(a.x, b.x)? a.x < b.x: epsleq(a.z, b.z);\n}\nbool dpcomp(const pair<double, pair<Point, Point> > &a, const pair<double, pair<Point, Point> > &b){\n return !epseq(a.first, b.first)? a.first < b.first : a.second < b.second;\n}\n\npair<double, pair<Point, Point> > closest(vector<Point> &v, int first, int last, map<Point, Point> &conv){\n if(last -first <= 1) return make_pair(INF, make_pair(Point(), Point()));\n int mid = (first +last)/2;\n double midx = v[mid].x;\n pair<double, pair<Point, Point> > cp = min(closest(v, first, mid, conv), closest(v, mid, last, conv), dpcomp);\n inplace_merge(v.begin()+first, v.begin()+mid, v.begin()+last, ycomp);\n \n vector<Point> near;\n for(int i=first; i<last; i++){\n if(abs(v[i].x -midx) > cp.first +EPS) continue;\n for(int j=near.size()-1; j>=0; j--){\n if(abs(v[i].y -near[j].y) > cp.first +EPS){\n break;\n }\n pair<double, pair<Point, Point> > ncp(abs(v[i] -near[j]), pair<Point, Point>(conv[v[i]], conv[near[j]]));\n if(ncp.second.second < ncp.second.first) swap(ncp.second.first, ncp.second.second);\n cp = min(cp, ncp, dpcomp);\n }\n near.push_back(v[i]);\n }\n return cp;\n}\n\nint main(){\n while(1){\n int m,n,s,w;\n cin >> m >> n >> s >> w;\n if(m==0 && n==0) break;\n\n vector<Point> v(m+n);\n for(int i=0; i<m; i++){\n cin >> v[i].x >> v[i].y >> v[i].z;\n }\n for(int i=m; i<m+n; i++){\n v[i].x = (s/7) %100 +1;\n v[i].y = (s/700) %100 +1;\n v[i].z = (s/70000) %100 +1;\n if(s%2 == 0){\n s = s/2;\n }else{\n s = (s/2) ^ w;\n }\n }\n\n n += m;\n map<Point, Point> conv;\n for(int i=0; i<n; i++){\n Point univec = unit(v[i]);\n if(conv.count(univec) == 0){\n conv[univec] = v[i];\n }else{\n conv[univec] = min(conv[univec], v[i]);\n }\n }\n\n vector<Point> uni;\n for(pair<Point, Point> pp: conv){\n uni.push_back(pp.first);\n }\n pair<double, pair<Point, Point> > ret = closest(uni, 0, uni.size(), conv);\n Point &a = ret.second.first;\n Point &b = ret.second.second;\n cout << fixed << setprecision(0);\n cout << a.x << \" \" << a.y << \" \" << a.z << \" \";\n cout << b.x << \" \" << b.y << \" \" << b.z << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1750,"memory_kb":19516,"score_of_the_acc":-0.4247,"final_rank":3},{"submission_id":"aoj_1340_3060374","code_snippet":"// AOJ 1340: Directional Resemblence\n#include <cmath>\n#include <cstdio>\n#include <algorithm>\nusing namespace std;\nint n, m, S, W, px[120009], py[120009], pz[120009], p[120009]; long double x[120009], y[120009], z[120009];\nint main() {\n\twhile(scanf(\"%d %d %d %d\", &n, &m, &S, &W), n + m != 0) {\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tscanf(\"%d %d %d\", &px[i], &py[i], &pz[i]);\n\t\t}\n\t\tfor(int i = n; i < n + m; ++i) {\n\t\t\tpx[i] = S / 7 % 100 + 1;\n\t\t\tpy[i] = S / 700 % 100 + 1;\n\t\t\tpz[i] = S / 70000 % 100 + 1;\n\t\t\tif(S & 1) S = (S >> 1) ^ W;\n\t\t\telse S >>= 1;\n\t\t}\n\t\tn += m;\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\tlong double d = sqrt((long double)(px[i] * px[i] + py[i] * py[i] + pz[i] * pz[i]));\n\t\t\tx[i] = px[i] / d;\n\t\t\ty[i] = py[i] / d;\n\t\t\tz[i] = pz[i] / d;\n\t\t\tp[i] = i;\n\t\t}\n\t\tsort(p, p + n, [](int i, int j) {\n\t\t\tif(abs(x[i] - x[j]) > 1.0e-12L) return x[i] < x[j];\n\t\t\tif(abs(y[i] - y[j]) > 1.0e-12L) return y[i] < y[j];\n\t\t\tif(abs(z[i] - z[j]) > 1.0e-12L) return z[i] < z[j];\n\t\t\tif(px[i] != px[j]) return px[i] < px[j];\n\t\t\tif(py[i] != py[j]) return py[i] < py[j];\n\t\t\treturn pz[i] < pz[j];\n\t\t});\n\t\tlong double ans = 1.0e+9;\n\t\tint pa = -1, pb = -1, r = 0;\n\t\tfor(int i = 0; i < n; ++i) {\n\t\t\twhile(r != n && abs(x[p[i]] - x[p[r]]) < 1.0e-12L && abs(y[p[i]] - y[p[r]]) < 1.0e-12L && abs(z[p[i]] - z[p[r]]) < 1.0e-12) ++r;\n\t\t\tfor(int j = r; j < n && (x[p[j]] - x[p[i]]) * (x[p[j]] - x[p[i]]) < ans - 1.0e-12L; ++j) {\n\t\t\t\tlong double d = (x[p[i]] - x[p[j]]) * (x[p[i]] - x[p[j]]) + (y[p[i]] - y[p[j]]) * (y[p[i]] - y[p[j]]) + (z[p[i]] - z[p[j]]) * (z[p[i]] - z[p[j]]);\n\t\t\t\tif(d < ans - 1.0e-16L) {\n\t\t\t\t\tans = d;\n\t\t\t\t\tpa = p[i];\n\t\t\t\t\tpb = p[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ax = px[pa], ay = py[pa], az = pz[pa], bx = px[pb], by = py[pb], bz = pz[pb];\n\t\tif(ax > bx || (ax == bx && (ay > by || (ay == by && az > bz)))) {\n\t\t\tswap(ax, bx);\n\t\t\tswap(ay, by);\n\t\t\tswap(az, bz);\n\t\t}\n\t\tprintf(\"%d %d %d %d %d %d\\n\", ax, ay, az, bx, by, bz);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":350,"memory_kb":9028,"score_of_the_acc":-0.0708,"final_rank":1},{"submission_id":"aoj_1340_2740822","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(a) a.begin(),a.end()\n\nconst double EPS=1E-15;\nconstexpr int gcd(int a,int b){return b?gcd(b,a%b):a;}\n\nstruct v{\n\tint x,y,z,g;\n\tdouble L2,nx,ny,nz;\n\tbool operator==(const v&r)const{return this->x==r.x and this->y==r.y and this->z==r.z and this->g==r.g;};\n\tvoid setData(){\n\t g=gcd(x,gcd(y,z));\n L2=sqrt(x*x+y*y+z*z)/g;\n nx=x/g/L2;\n ny=y/g/L2;\n nz=z/g/L2;\n\t}\n\tfriend ostream& operator<<(ostream&os,const v&p);\n};\n\nbool operator<(const v&l,const v&r){return l.nx<r.nx or (l.nx==r.nx and (l.ny<r.ny or (l.ny==r.ny and l.nz<r.nz)));};\nostream& operator<<(ostream&os, const v&p){os<<p.x<<\" \"<<p.y<<\" \"<<p.z; return os;};\n\nv makeData(int X, int Y, int Z){\n\tv ret;\n\tret.x=X, ret.y=Y, ret.z=Z;\n\tret.setData();\n\treturn ret;\n}\n\nbool same(v a,v b){\n return a.x/a.g==b.x/b.g and a.y/a.g==b.y/b.g and a.z/a.g==b.z/b.g;\n}\n\nbool cmp(v a,v b){\n\treturn a.x<b.x or (b.x==a.x and (a.y<b.y or (b.y==a.y and a.z<b.z)));\n}\n\ndouble dist(v a, v b){\n if(same(a,b)) return 10000; \n return sqrt((b.nx-a.nx)*(b.nx-a.nx) + (b.ny-a.ny)*(b.ny-a.ny) + (b.nz-a.nz)*(b.nz-a.nz));\n}\n\n\nusing data=pair<double,pair<v,v>>;\ndata closest_pair(vector<v> vec){\n if(vec.size()<=1) return {10000,{v(),v()}};\n if(vec.size()==2){\n\t\tif(cmp(vec[1],vec[0])){\n\t\t\t//cout<<\"Ret (2) :\"<<vec[1]<<\" \"<<vec[0]<<\" = \"<<dist(vec[0],vec[1])<<endl;\n\t\t\treturn {dist(vec[0],vec[1]),{vec[1],vec[0]}};\n\t\t}else{\n\t\t\t//cout<<\"Ret (2) :\"<<vec[0]<<\" \"<<vec[1]<<\" = \"<<dist(vec[0],vec[1])<<endl;\n\t\t\treturn {dist(vec[0],vec[1]),{vec[0],vec[1]}};\n\t\t}\n\t}\n vector<v> vs1,vs2,vs3;\n int index=vec.size()/2;\n double sep=vec[index].nx;\n copy(vec.begin(), vec.begin()+index, back_inserter(vs1));\n copy(vec.begin()+index, vec.end(), back_inserter(vs2));\n \n\tdata s1=closest_pair(vs1), s2=closest_pair(vs2), minDist;\n\tif(fabs(s1.first-s2.first)>EPS){\n\t\tminDist=min(s1,s2);\n\t}else{\n\t\tif(cmp(s1.second.first,s2.second.first) or (s1.second.first==s2.second.first and cmp(s1.second.second,s2.second.second))){\n\t\t\tminDist=s1;\n\t\t}else{\n\t\t\tminDist=s2;\n\t\t}\n\t}\n \n sort(all(vec),[](v a,v b){return a.ny<b.ny;});\n \n for(auto d:vec){\n if(fabs(d.nx-sep)>=minDist.first) continue;\n for(int i=vs3.size()-1;i>=0;i--){\n double dst=dist(vs3[i],d);\n\t\t\t//if(dst>minDist.first)break;\n\t\t\tv n1=vs3[i],n2=d;\n\t\t\tif(cmp(n2,n1))swap(n1,n2);\n\t\t\tif(fabs(minDist.first-dst)<EPS){\n\t\t\t\tif(cmp(n1,minDist.second.first) or (n1==minDist.second.first and cmp(n2,minDist.second.second))){\n\t\t\t\t\t//cout<<\" \"<<n1<<\" \"<<n2<<endl;\n\t\t\t\t\tminDist={dst,{n1,n2}};\n\t\t\t\t}\n\t\t\t}else if(dst<minDist.first){\n\t\t\t\t//cout<<\" \"<<n1<<\" \"<<n2<<endl;\n minDist={dst,{n1,n2}};\n }\n }\n vs3.push_back(d);\n }\n\t//cout<<\"Ret (\"<<vec.size()<<\") :\"<<minDist.second.first<<\" \"<<minDist.second.second<<\" = \"<<minDist.first<<endl;\n return minDist;\n \n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t\n\tint m,n,s,w;\n\twhile(cin>>m>>n>>s>>w, m or n){\n\t\tvector<v> vec;\n\t\trep(i,m){\n\t\t\tint x,y,z;\n\t\t\tcin>>x>>y>>z;\n\t\t\tvec.push_back(makeData(x,y,z));\n\t\t}\n\t\tint g=s;\n\t\trep(i,n) {\n\t\t\tvec.push_back(makeData((g/7)%100+1, (g/700)%100+1, (g/70000)%100+1));\n\t\t\tif(g%2==0)g/=2;\n\t\t\telse g=(g/2) xor w;\n\t\t}\n\t sort(all(vec),[](v a,v b){return a.nx<b.nx;});\n\t\tvec.erase(unique(all(vec),same),vec.end());\n\t\t//for(auto d:vec)cout<<d<<\"(\"<<d.nx<<\")\"<<endl;\n\t\t//cout<<\"====\"<<endl;\n\t data ans=closest_pair(vec);\n\t v a1=ans.second.first;\n\t v a2=ans.second.second;\n\t if(cmp(a2,a1)) swap(a1,a2);\n\t cout<<a1<<\" \"<<a2<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3860,"memory_kb":25824,"score_of_the_acc":-0.8074,"final_rank":8},{"submission_id":"aoj_1340_2643757","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ld = long double;\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\n#define all(v) v.begin(),v.end()\nconst ld EPS = 1e-8;\nbool eq(ld a, ld b) { return abs(a - b) < EPS; }\n\ntemplate<class T>\nstruct Point {\n T x, y, z;\n bool operator < (const Point<T> &r) const { return make_tuple(x, y, z) < make_tuple(r.x, r.y, r.z); }\n};\n\ntemplate<class T>\nld length(const Point<T> &p) {\n return sqrtl(p.x * p.x + p.y * p.y + p.z * p.z);\n}\ntemplate<class T>\nld dot(const Point<T> &a, const Point<T> &b) {\n return a.x * b.x + a.y * b.y + a.z * b.z;\n}\ntemplate<class T>\nld angle(const Point<T> &a, const Point<T> &b) {\n return acosl(dot(a, b) / length(a) / length(b));\n}\ntemplate<class T>\nPoint<ld> unit(Point<T> a) {\n Point<ld> p = {(ld)a.x, (ld)a.y, (ld)a.z};\n ld l = length(p);\n p.x /= l;\n p.y /= l;\n p.z /= l;\n return p;\n}\n\nbool solve() {\n using PI = Point<int>;\n int m, n, S, W; cin >> m >> n >> S >> W;\n if(m == 0 and n == 0 and S == 0 and W == 0) return false;\n vector<PI> V(m + n);\n rep(i, m) cin >> V[i].x >> V[i].y >> V[i].z;\n { // generate\n int g = S;\n for(int i=m; i<m+n; i++) {\n V[i].x = (g/7) %100 + 1;\n V[i].y = (g/700) %100 + 1;\n V[i].z = (g/70000)%100 + 1;\n if( g%2 == 0 ) { g = (g/2); }\n else { g = (g/2) ^ W; }\n }\n }\n sort(all(V), [&] (PI a, PI b) { return unit(a).x > unit(b).x; });\n \n ld min_angle = 1e9; \n PI a, b;\n\n auto need_check = [&] (PI &a, PI &b) {\n ld alpha = acosl(unit(a).x);\n return cosl(alpha + min_angle) < unit(b).x + EPS;\n };\n \n queue<PI> que;\n rep(i, V.size()) {\n queue<PI> nxt_que;\n while(que.size()) {\n auto p = que.front(); que.pop();\n if(not need_check(p, V[i])) continue;\n ld ang = angle(V[i], p);\n if(ang > EPS) {\n if(min_angle + EPS > ang) { \n auto va = V[i], vb = p;\n if(vb < va) swap(va, vb);\n if(!eq(min_angle, ang) or make_pair(a, b) > make_pair(va, vb)) {\n a = va;\n b = vb;\n }\n min_angle = ang;\n }\n }\n nxt_que.push(p);\n }\n nxt_que.push(V[i]);\n swap(que, nxt_que);\n }\n printf(\"%d %d %d %d %d %d\\n\", a.x, a.y, a.z, b.x, b.y, b.z);\n return true;\n}\n\nint main() {\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":5290,"memory_kb":4748,"score_of_the_acc":-0.6641,"final_rank":7},{"submission_id":"aoj_1340_2643742","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing pii = pair<int,int>;\nusing ll = long long;\nusing ld = long double;\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\n#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)\n#define all(v) v.begin(),v.end()\n#define debug(x) cerr << #x << \" : \" << x << endl\n\ntemplate<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; }\ntemplate<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; }\n// vector\ntemplate<class T> istream&\noperator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }\ntemplate<class T> ostream&\noperator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << \"\\t\" << t; return os << endl; }\n// pair\ntemplate<class T, class U> ostream&\noperator << (ostream &os , const pair<T, U> &v) { return os << \"<\" << v.first << \", \" << v.second << \">\"; }\n\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 60;\nconst ld EPS = 1e-9;\nbool eq(ld a, ld b) { return abs(a - b) < EPS; }\ntemplate<class T>\nstruct Point {\n T x, y, z;\n bool operator < (const Point<T> &r) const {\n return make_tuple(x, y, z) < make_tuple(r.x, r.y, r.z);\n }\n};\ntemplate<class T>\nld length(const Point<T> &p) { return sqrtl(p.x * p.x + p.y * p.y + p.z * p.z); }\ntemplate<class T>\nld dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y + a.z * b.z; }\ntemplate<class T>\nld angle(const Point<T> &a, const Point<T> &b) {\n return acosl(dot(a, b) / length(a) / length(b));\n}\ntemplate<class T>\nPoint<ld> unit(Point<T> a) {\n Point<ld> p = {(ld)a.x, (ld)a.y, (ld)a.z};\n ld l = length(p);\n p.x /= l;\n p.y /= l;\n p.z /= l;\n return p;\n}\n\nbool solve() {\n int m, n, S, W; cin >> m >> n >> S >> W;\n if(m == 0 and n == 0 and S == 0 and W == 0) return false;\n vector<Point<int>> VI(m + n);\n rep(i, m) {\n cin >> VI[i].x >> VI[i].y >> VI[i].z;\n }\n int g = S;\n for(int i=m; i<m+n; i++) {\n VI[i].x = (g/7) %100 + 1;\n VI[i].y = (g/700) %100 + 1;\n VI[i].z = (g/70000)%100 + 1;\n if( g%2 == 0 ) { g = (g/2); }\n else { g = (g/2) ^ W; }\n }\n sort(all(VI), [&] (Point<int> a, Point<int> b) {\n return unit(a).x > unit(b).x;\n });\n ld min_angle = 1e9; \n Point<int> a, b;\n\n auto need_check = [&] (Point<int> &a, Point<int> &b) {\n ld alpha = acosl(unit(a).x);\n auto ss = cosl(alpha + min_angle);\n auto tt = unit(b).x;\n // cerr << ss << \" \" << tt << endl;\n return ss < tt + EPS*10;\n };\n \n queue<Point<int>> que;\n rep(i, VI.size()) {\n queue<Point<int>> nxt_que;\n while(que.size()) {\n auto p = que.front(); que.pop();\n if(not need_check(p, VI[i])) continue;\n ld ang = angle(VI[i], p);\n if(ang > EPS) {\n if(min_angle + EPS > ang) { \n auto aa = VI[i], bb = p;\n if(bb < aa) swap(aa, bb);\n if(!eq(min_angle, ang) or make_pair(a, b) > make_pair(aa, bb)) {\n a = aa;\n b = bb;\n }\n min_angle = ang;\n }\n }\n nxt_que.push(p);\n }\n nxt_que.push(VI[i]);\n swap(que, nxt_que);\n }\n printf(\"%d %d %d %d %d %d\\n\",\n a.x, a.y, a.z,\n b.x, b.y, b.z);\n return true;\n}\n\nint main() {\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":5310,"memory_kb":4572,"score_of_the_acc":-0.664,"final_rank":6},{"submission_id":"aoj_1340_2047412","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tshared_ptr<kdtree<T>> ltree, rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\n\n\t}\n\t~kdtree() {\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\tvoid getmindis() {\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tanswer = min(answer, nans);\n\t\t}\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tltree.reset();\n\t\trtree.reset();\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto&&a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6290,"memory_kb":26912,"score_of_the_acc":-1.1499,"final_rank":12},{"submission_id":"aoj_1340_2047410","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tshared_ptr<kdtree<T>> ltree, rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\n\n\t}\n\t~kdtree() {\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\tvoid getmindis() {\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tanswer = min(answer, nans);\n\t\t}\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tltree.reset();\n\t\trtree.reset();\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto&&a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6530,"memory_kb":26840,"score_of_the_acc":-1.1809,"final_rank":15},{"submission_id":"aoj_1340_2047406","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tshared_ptr<kdtree<T>> ltree, rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\n\n\t}\n\t~kdtree() {\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\tvoid getmindis() {\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tanswer = min(answer, nans);\n\t\t}\n\n\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tltree.reset();\n\t\trtree.reset();\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6300,"memory_kb":26912,"score_of_the_acc":-1.1513,"final_rank":14},{"submission_id":"aoj_1340_2047403","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tshared_ptr<kdtree<T>> ltree, rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\n\n\t}\n\t~kdtree() {\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\tvoid getmindis() {\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tif (p.first == 1524 && 2763 == p.second) {\n\t\t\t\tint a = 1; a++;\n\t\t\t}\n\t\t\t//if (p.first == 2763 && 1524 == p.second)assert(false);\n\t\t\tanswer = min(answer, nans);\n\t\t\tint b;\n\t\t\tb = 1; b++;\n\t\t}\n\n\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tltree.reset();\n\t\trtree.reset();\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t}\n\treturn 0;\n}\n//1524,2763","accuracy":1,"time_ms":6840,"memory_kb":26992,"score_of_the_acc":-1.2248,"final_rank":16},{"submission_id":"aoj_1340_2047023","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tkdtree<T> *ltree, *rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(nullptr), rtree(nullptr) {\n\n\t}\n\t~kdtree() {\n\t\tif (ltree != nullptr) {\n\t\t\tdelete(ltree);\n\t\t\tltree = nullptr;\n\t\t}\n\n\t\tif (rtree != nullptr) {\n\t\t\tdelete(rtree);\n\t\t\trtree = nullptr;\n\t\t}\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\t/*vector<T>query(const T & amin, const T&amax) {\n\tvector<T>ans;\n\tbool aok = true;\n\tfor (int i = 0; i < Dim; ++i) {\n\tif (amin.coors[i] <= midpo.coors[i] && midpo.coors[i] <= amax.coors[i]) {\n\n\t}\n\telse {\n\taok = false;\n\tbreak;\n\t}\n\t}\n\tif (aok) {\n\tans.emplace_back(val);\n\t}\n\taxisSorter<T> as(axis);\n\tif (as(midpo, amax) || midpo.coors[axis] == amax.coors[axis]) {\n\tif (rtree != nullptr) {\n\tvector<T>tans(rtree->query(amin, amax));\n\tans.insert(ans.end(), tans.begin(), tans.end());\n\t}\n\t}\n\tif (as(amin, midpo) || midpo.coors[axis] == amin.coors[axis]) {\n\tif (ltree != nullptr) {\n\tvector<T>tans(ltree->query(amin, amax));\n\tans.insert(ans.end(), tans.begin(), tans.end());\n\t}\n\t}\n\treturn ans;\n\t}*/\n\tvoid getmindis() {\n\t\t/*if (ltree != nullptr) {\n\t\tauto p =ltree->getmindis();\n\t\tif (ansnum > p.second) {\n\t\tansnum = p.second;\n\t\tansp = p.first;\n\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\tauto p = rtree->getmindis();\n\t\tif (ansnum > p.second) {\n\t\tansnum = p.second;\n\t\tansp = p.first;\n\t\t}\n\t\t}*/\n\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tif (p.first == 1524 && 2763 == p.second) {\n\t\t\t\tint a = 1; a++;\n\t\t\t}\n\t\t\t//if (p.first == 2763 && 1524 == p.second)assert(false);\n\t\t\tanswer = min(answer, nans);\n\t\t\tint b;\n\t\t\tb = 1; b++;\n\t\t}\n\n\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tconst int mid = (l + r) / 2;\n\t\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tif (ltree) {\n\t\t\tdelete(ltree);\n\t\t\tltree = nullptr;\n\t\t}\n\t\tif (rtree) {\n\t\t\tdelete(rtree);\n\t\t\trtree = nullptr;\n\t\t}\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nkdtree<T> *make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn new kdtree<T>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t\tdelete(tree);\n\t}\n\treturn 0;\n}\n//1524,2763","accuracy":1,"time_ms":6990,"memory_kb":26888,"score_of_the_acc":-1.2433,"final_rank":17},{"submission_id":"aoj_1340_2046975","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\nld getdis(vector<ld>&l, vector<ld>&r) {\n\tld sum = 0;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tsum += (l[i] - r[i])*(l[i] - r[i]);\n\t}\n\treturn sqrt(sum);\n}\n\nstruct po {\n\tint index;\n\tvector<ld> coors;\n\tpo(int _d) :coors(_d) {\n\t\tindex = -1;\n\t}\n\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\n\n\t}\n\tpo() {}\n};\nld getdis(po&lpo, po&rpo) {\n\treturn getdis(lpo.coors, rpo.coors);\n}\ntemplate<class T>\nclass axisSorter {\n\tint k;\npublic:\n\taxisSorter(int _k) : k(_k) {}\n\tbool operator()(const T &a, const T &b) {\n\t\treturn a.coors[k] < b.coors[k];\n\t}\n};\n\n\n\nstruct Ans {\n\tld dis;\n\tpair<int, int>p;\n\n};\n\n\nbool operator<(const Ans&l, const Ans&r) {\n\tif (abs(l.dis - r.dis) < eps) {\n\t\tassert(l.p.first < l.p.second);\n\t\tassert(r.p.first < r.p.second);\n\t\treturn l.p < r.p;\n\t}\n\telse {\n\t\treturn l.dis < r.dis;\n\t}\n\treturn true;\n}\nAns answer;\n\ntemplate<class T, int Dim = 3>\nstruct kdtree {\npublic:\n\tT midpo;\n\tvector<T>pos;\n\tkdtree<T> *ltree, *rtree;\n\tint depth;\n\tint axis;\n\tkdtree(const T &p_) :midpo(p_), ltree(nullptr), rtree(nullptr) {\n\n\t}\n\t~kdtree() {\n\t\tif (ltree != nullptr) {\n\t\t\tdelete(ltree);\n\t\t\tltree = nullptr;\n\t\t}\n\n\t\tif (rtree != nullptr) {\n\t\t\tdelete(rtree);\n\t\t\trtree = nullptr;\n\t\t}\n\t}\n\n\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\n\t\tinit(ps_, l, r);\n\t}\n\t/*vector<T>query(const T & amin, const T&amax) {\n\tvector<T>ans;\n\tbool aok = true;\n\tfor (int i = 0; i < Dim; ++i) {\n\tif (amin.coors[i] <= midpo.coors[i] && midpo.coors[i] <= amax.coors[i]) {\n\n\t}\n\telse {\n\taok = false;\n\tbreak;\n\t}\n\t}\n\tif (aok) {\n\tans.emplace_back(val);\n\t}\n\taxisSorter<T> as(axis);\n\tif (as(midpo, amax) || midpo.coors[axis] == amax.coors[axis]) {\n\tif (rtree != nullptr) {\n\tvector<T>tans(rtree->query(amin, amax));\n\tans.insert(ans.end(), tans.begin(), tans.end());\n\t}\n\t}\n\tif (as(amin, midpo) || midpo.coors[axis] == amin.coors[axis]) {\n\tif (ltree != nullptr) {\n\tvector<T>tans(ltree->query(amin, amax));\n\tans.insert(ans.end(), tans.begin(), tans.end());\n\t}\n\t}\n\treturn ans;\n\t}*/\n\tvoid getmindis() {\n\t\t/*if (ltree != nullptr) {\n\t\tauto p =ltree->getmindis();\n\t\tif (ansnum > p.second) {\n\t\tansnum = p.second;\n\t\tansp = p.first;\n\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\tauto p = rtree->getmindis();\n\t\tif (ansnum > p.second) {\n\t\tansnum = p.second;\n\t\tansp = p.first;\n\t\t}\n\t\t}*/\n\n\t\tvector<po>lpos, rpos;\n\t\tld axisvalue = midpo.coors[axis];\n\n\t\tif (ltree != nullptr) {\n\t\t\tfor (auto &po : ltree->pos) {\n\t\t\t\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\n\t\t\t\t\tlpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (rtree != nullptr) {\n\t\t\tfor (auto &po : rtree->pos) {\n\t\t\t\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\n\t\t\t\t\trpos.emplace_back(po);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& lpo : lpos) {\n\t\t\tfor (auto& rpo : rpos) {\n\t\t\t\tld dis = getdis(lpo, rpo);\n\t\t\t\tpair<int, int> p(rpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t\t{\n\t\t\t\tld dis = getdis(lpo, midpo);\n\t\t\t\tpair<int, int> p(midpo.index, lpo.index);\n\t\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\t\tAns nans{ dis,p };\n\t\t\t\tanswer = min(answer, nans);\n\t\t\t}\n\t\t}\n\t\tfor (auto& rpo : rpos) {\n\t\t\tld dis = getdis(midpo, rpo);\n\t\t\tpair<int, int> p(midpo.index, rpo.index);\n\t\t\tif (p.first > p.second)swap(p.first, p.second);\n\t\t\tAns nans{ dis,p };\n\t\t\tif (p.first == 1524 && 2763 == p.second) {\n\t\t\t\tint a = 1; a++;\n\t\t\t}\n\t\t\t//if (p.first == 2763 && 1524 == p.second)assert(false);\n\t\t\tanswer = min(answer, nans);\n\t\t\tint b;\n\t\t\tb = 1; b++;\n\t\t}\n\n\n\t}\nprivate:\n\tvoid init(vector<T>&ps, const int& l, const int& r) {\n\t\tif (l >= r) {\n\t\t\treturn;\n\t\t}\n\t\tsort(ps.begin() + l, ps.begin() + r, axisSorter<T>(axis));\n\t\tconst int mid = (l + r) / 2;\n\t\tmidpo = ps[mid];\n\n\t\tltree = make_kdtree(ps, l, mid, depth + 1);\n\t\t\n\t\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\n\t\tgetmindis();\n\t\tif (ltree) {\n\t\t\tdelete(ltree);\n\t\t\tltree = nullptr;\n\t\t}\n\t\tif (rtree) {\n\t\t\tdelete(rtree);\n\t\t\trtree = nullptr;\n\t\t}\n\t\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\n\t}\n};\n\n\n//[l..r)\ntemplate<class T>\nkdtree<T> *make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\n\tif (l >= r)return nullptr;\n\telse {\n\t\treturn new kdtree<T>(ps_, l, r, depth);\n\t}\n}\n\nvector<ld>getunit(vector<int>v) {\n\tvector<ld>unit;\n\tld len = 0;\n\tfor (auto a : v) {\n\t\tlen += a*a;\n\t\tunit.emplace_back(ld(a));\n\t}\n\tlen = sqrt(len);\n\tfor (auto&u : unit) {\n\t\tu /= len;\n\t}\n\treturn unit;\n}\nint gcd(int l, int r) {\n\tassert(l > 0 && r > 0);\n\tif (l > r)return gcd(r, l);\n\telse {\n\t\tconst int num = r%l;\n\t\tif (num) {\n\t\t\treturn gcd(l, num);\n\t\t}\n\t\telse {\n\t\t\treturn l;\n\t\t}\n\t}\n}\nint gcd(vector<int>nums) {\n\tif (nums.size() == 1)return nums[0];\n\tint num = nums[0];\n\n\tfor (int i = 1; i < nums.size(); ++i) {\n\t\tnum = gcd(num, nums[i]);\n\t}\n\treturn num;\n}\n\nint main() {\n\twhile (1) {\n\t\tanswer = Ans{ 1e18,make_pair(-1,-1) };\n\t\tint M, N, S, W; cin >> M >> N >> S >> W;\n\t\tif (!M&&!N&&!S&&!W)break;\n\t\tvector<po>pos;\n\t\tvector<vector<int>>memo;\n\t\t{\n\t\t\t{\n\t\t\t\tint nx, ny, nz;\n\t\t\t\tfor (int i = 0; i < M; ++i) {\n\t\t\t\t\tcin >> nx >> ny >> nz;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t}\n\t\t\t\tint g = S;\n\t\t\t\tfor (int i = M; i < M + N; ++i) {\n\t\t\t\t\tnx = (g / 7) % 100 + 1;\n\t\t\t\t\tny = (g / 700) % 100 + 1;\n\t\t\t\t\tnz = (g / 70000) % 100 + 1;\n\t\t\t\t\tmemo.push_back(vector<int>{nx, ny, nz});\n\t\t\t\t\tif (g % 2 == 0)g = g / 2;\n\t\t\t\t\telse g = (g / 2) ^ W;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\t{\n\t\t\t\tvector<vector<int>>newmemo;\n\t\t\t\tmap<vector<int>, int>amap;\n\t\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\t\tint agcd = gcd(memo[i]);\n\t\t\t\t\tvector<int>v(3);\n\t\t\t\t\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\n\t\t\t\t\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\n\t\t\t\t\t\tamap[v] = agcd;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (auto m : amap) {\n\t\t\t\t\tauto v = m.first;\n\t\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\t\tv[i] *= m.second;\n\t\t\t\t\t}\n\t\t\t\t\tnewmemo.emplace_back(v);\n\t\t\t\t}\n\t\t\t\tmemo = newmemo;\n\t\t\t}\n\t\t\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\n\t\t\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\t\t\tif (l[i] == r[i])continue;\n\t\t\t\t\telse return l[i] < r[i];\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t});\n\t\t\tfor (int i = 0; i < memo.size(); ++i) {\n\t\t\t\tpo p(i, getunit(memo[i]));\n\t\t\t\tpos.emplace_back(p);\n\t\t\t}\n\t\t}\n\n\t\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\n\t\ttree->getmindis();\n\t\tauto ansp = answer;\n\t\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.first][i] << \" \";\n\t\t}\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tcout << memo[answer.p.second][i];\n\t\t\tif (i == 2)cout << endl;\n\t\t\telse cout << \" \";\n\t\t}\n\t\tdelete(tree);\n\t}\n\treturn 0;\n}\n//1524,2763","accuracy":1,"time_ms":7820,"memory_kb":26876,"score_of_the_acc":-1.3542,"final_rank":18},{"submission_id":"aoj_1340_1569119","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace ClosestPair{\n\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()?????´\n\tconst double EPS = 1e-9;\n\tconst int DIM = 3;\n\ttypedef array<double,DIM> P;\n\n\tdouble dist(const P &p1,const P &p2){\n\t\tdouble ans = 0;\n\t\tfor(int i = 0 ; i < DIM ; i++)\n\t\t\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\n\t\treturn sqrt(ans);\n\t}\n\ttypedef array<int,DIM> Block;\n\ttypedef unordered_map<unsigned long long,vector<int>> Bucket;\n\tBlock getBlock(const P &p,double w){\n\t\tBlock res;\n\t\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\n\t\treturn res;\n\t}\n\tunsigned long long toHash(const Block &bl){\n\t\tunsigned long long h = 0;\n\t\tfor(int i = 0 ; i < DIM ; i++){\n\t\t\th = h * 100000007 + bl[i];\n\t\t}\n\t\treturn h;\n\t}\n\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\n\t\tvector<int> res;\n\t\tauto key = getBlock(p,w);\n\t\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\n\t\t\tfor(int x1 = -1 ; x1 <= 1 ; x1++){\n\t\t\t\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\n\t\t\t\t\tauto it = b.find(toHash(Block{key[0]+x0,key[1]+x1,key[2]+x2}));\n\t\t\t\t\tif( it != b.end() ){\n\t\t\t\t\t\tfor( int id : it->second ) res.push_back(id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\treturn res;\n\t}\n\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\n\tBucket makeBucket(const vector<P> &ps,double w){\n\t\tBucket b;\n\t\tfor(int i = 0 ; i < ps.size() ; i++)\n\t\t\tb[toHash(getBlock(ps[i],w))].push_back(i);\n\t\treturn b;\n\t}\n\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\n\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\??????????\n\tdouble closetPairDistance(vector<P> ps){\n\t\tassert(ps.size()>=2);\n\t\trandom_shuffle(ps.begin(),ps.end());\n\t\tdouble w = dist(ps[0],ps[1]);\n\t\tvector<P> build = {ps[0],ps[1]};\n\t\tauto b = makeBucket(build,w);\n\t\tint a = 0;\n\t\tfor(int i = 2 ; i < ps.size() ; i++){\n\t\t\tdouble next_w = w;\n\t\t\tfor( int j : getNearPoints(b,w,ps[i]) )\n\t\t\t\tnext_w = min(next_w,dist(ps[i],ps[j]));\n\t\t\tbuild.push_back(ps[i]);\n\t\t\tif( w - EPS > next_w ){\n\t\t\t\tw = next_w;\n\t\t\t\tb = makeBucket(build,w);\n\t\t\t\ta++;\n\t\t\t}else{\n\t\t\t\tb[toHash(getBlock(ps[i],w))].push_back(i);\n\t\t\t}\n\t\t}\n\t\treturn w;\n\t}\n};\nusing namespace ClosestPair;\n\n\nstruct Pt{\n\tdouble x,y,z;\n};\nbool operator < (const Pt &a,const Pt &b){\n\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\n\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\n\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\n\treturn false;\n}\n\ndouble X[150000];\ndouble Y[150000];\ndouble Z[150000];\nint main(){\n int m,n,S,W;\n int tst = 1;\n while( cin >> m >> n >> S >> W && m+n ){\n map<Pt,vector<P>> dic;\n for(int i = 0 ; i < m ; i++){\n scanf(\"%lf%lf%lf\",X+i,Y+i,Z+i);\n }\n int g = S;\n for(int i=m; i<m+n; i++) {\n X[i] = (g/7) %100 + 1;\n Y[i] = (g/700) %100 + 1;\n Z[i] = (g/70000)%100 + 1;\n if( g%2 == 0 ) { g = (g/2); }\n else { g = (g/2) ^ W; }\n }\n for(int i = 0 ; i < m+n ; i++){\n double x = X[i];\n double y = Y[i];\n double z = Z[i];\n P p = {x,y,z};\n double d = dist(P{0,0,0},p);\n Pt e;\n e.x = x / d;\n e.y = y / d;\n e.z = z / d;\n dic[e].push_back(p);\n }\n vector<P> ps;\n vector<P> cand;\n for( auto &p : dic ){\n ps.push_back(P{p.first.x,p.first.y,p.first.z});\n \n cand.push_back(*min_element(p.second.begin(),p.second.end()));\n }\n \n double w = closetPairDistance(ps);\n auto b = makeBucket(ps,w);\n pair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\n for(int i = 0 ; i < ps.size() ; i++){\n for( auto j : getNearPoints(b,w,ps[i]) ){\n if( i != j ){\n if( fabs(dist(ps[i],ps[j])-w) < EPS ){\n best = min(best,pair<P,P>{cand[i],cand[j]});\n }\n }\n }\n }\n cout << (int)best.first[0] << \" \" << (int)best.first[1] << \" \" << (int)best.first[2] << \" \";\n cout << (int)best.second[0] << \" \" << (int)best.second[1] << \" \" << (int)best.second[2] << \"\\n\";\n }\n \n \n}","accuracy":1,"time_ms":4330,"memory_kb":41448,"score_of_the_acc":-1.1184,"final_rank":11},{"submission_id":"aoj_1340_1569104","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace ClosestPair{\n\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\n\tconst double EPS = 1e-9;\n\tconst int DIM = 3;\n\ttypedef array<double,DIM> P;\n\n\tdouble dist(const P &p1,const P &p2){\n\t\tdouble ans = 0;\n\t\tfor(int i = 0 ; i < DIM ; i++)\n\t\t\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\n\t\treturn sqrt(ans);\n\t}\n\ttypedef array<int,DIM> Block;\n\ttypedef map<Block,vector<int>> Bucket;\n\tBlock getBlock(const P &p,double w){\n\t\tBlock res;\n\t\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\n\t\treturn res;\n\t}\n\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\n\t\tvector<int> res;\n\t\tauto key = getBlock(p,w);\n\t\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\n\t\t\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\n\t\t\t\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\n\t\t\t\t\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\n\t\t\t\t\tif( it != b.end() ){\n\t\t\t\t\t\tfor( int id : it->second ) res.push_back(id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\treturn res;\n\t}\n\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\n\tBucket makeBucket(const vector<P> &ps,double w){\n\t\tBucket b;\n\t\tfor(int i = 0 ; i < ps.size() ; i++)\n\t\t\tb[getBlock(ps[i],w)].push_back(i);\n\t\treturn b;\n\t}\n\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\n\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\??????????\n\tdouble closetPairDistance(vector<P> ps){\n\t\tdouble w = 1e9;\n\t\tfor( auto &p : ps ){\n\t\t\ttie(p[0],p[1]) = make_pair(p[0]*cos(0)-p[1]*sin(0),p[0]*sin(0)+p[1]*cos(0));\n\t\t}\n\t\tsort(ps.begin(),ps.end());\n\t\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\t\tfor(int j = i-1 ; j >= 0 ; j--){\n\t\t\t\tif( ps[i][0]-ps[j][0] >= w ) break;\n\t\t\t\tw = min(w,dist(ps[i],ps[j]));\n\t\t\t}\n\t\t}\n\t\treturn w;\n\t}\n};\n\nusing namespace ClosestPair;\n\n\nstruct Pt{\n\tdouble x,y,z;\n};\nbool operator < (const Pt &a,const Pt &b){\n\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\n\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\n\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\n\treturn false;\n}\n\ndouble X[150000];\ndouble Y[150000];\ndouble Z[150000];\n\nint main(){\n\tint m,n,S,W;\n\tint tst = 1;\n\twhile( cin >> m >> n >> S >> W && m+n ){\n\t\tmap<Pt,vector<P>> dic;\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tscanf(\"%lf%lf%lf\",X+i,Y+i,Z+i);\n\t\t}\n\t\tint g = S;\n\t\tfor(int i=m; i<m+n; i++) {\n\t\t X[i] = (g/7) %100 + 1;\n\t\t Y[i] = (g/700) %100 + 1;\n\t\t Z[i] = (g/70000)%100 + 1;\n\t\t if( g%2 == 0 ) { g = (g/2); }\n\t\t else { g = (g/2) ^ W; }\n\t\t}\n\t\tfor(int i = 0 ; i < m+n ; i++){\n\t\t\tdouble x = X[i];\n\t\t\tdouble y = Y[i];\n\t\t\tdouble z = Z[i];\n\t\t\tP p = {x,y,z};\n\t\t\tdouble d = dist(P{0,0,0},p);\n\t\t\tPt e;\n\t\t\te.x = x / d;\n\t\t\te.y = y / d;\n\t\t\te.z = z / d;\n\t\t\tdic[e].push_back(p);\n\t\t}\n\t\tvector<P> ps;\n\t\tvector<P> cand;\n\t\tfor( auto &p : dic ){\n\t\t\tps.push_back(P{p.first.x,p.first.y,p.first.z});\n\t\t\t\n\t\t\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\n\t\t}\n\t\n\t\tdouble w = closetPairDistance(ps);\n\t\tauto b = makeBucket(ps,2*w);\n\t\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\n\t\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\t\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\n\t\t\t\tif( i != j ){\n\t\t\t\t\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\n\t\t\t\t\t\tbest = min(best,pair<P,P>{cand[i],cand[j]});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << (int)best.first[0] << \" \" << (int)best.first[1] << \" \" << (int)best.first[2] << \" \";\n\t\tcout << (int)best.second[0] << \" \" << (int)best.second[1] << \" \" << (int)best.second[2] << \"\\n\";\n\t}\n\t\n\n}","accuracy":1,"time_ms":3580,"memory_kb":31536,"score_of_the_acc":-0.8606,"final_rank":9},{"submission_id":"aoj_1340_1569103","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace ClosestPair{\n\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\n\tconst double EPS = 1e-9;\n\tconst int DIM = 3;\n\ttypedef array<double,DIM> P;\n\n\tdouble dist(const P &p1,const P &p2){\n\t\tdouble ans = 0;\n\t\tfor(int i = 0 ; i < DIM ; i++)\n\t\t\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\n\t\treturn sqrt(ans);\n\t}\n\ttypedef array<int,DIM> Block;\n\ttypedef map<Block,vector<int>> Bucket;\n\tBlock getBlock(const P &p,double w){\n\t\tBlock res;\n\t\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\n\t\treturn res;\n\t}\n\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\n\t\tvector<int> res;\n\t\tauto key = getBlock(p,w);\n\t\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\n\t\t\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\n\t\t\t\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\n\t\t\t\t\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\n\t\t\t\t\tif( it != b.end() ){\n\t\t\t\t\t\tfor( int id : it->second ) res.push_back(id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\treturn res;\n\t}\n\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\n\tBucket makeBucket(const vector<P> &ps,double w){\n\t\tBucket b;\n\t\tfor(int i = 0 ; i < ps.size() ; i++)\n\t\t\tb[getBlock(ps[i],w)].push_back(i);\n\t\treturn b;\n\t}\n\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\n\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\??????????\n\tdouble closetPairDistance(vector<P> ps){\n\t\tdouble w = 1e9;\n\t\tfor( auto &p : ps ){\n\t\t\ttie(p[0],p[1]) = make_pair(p[0]*cos(2)-p[1]*sin(2),p[0]*sin(2)+p[1]*cos(2));\n\t\t}\n\t\tsort(ps.begin(),ps.end());\n\t\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\t\tfor(int j = i-1 ; j >= 0 ; j--){\n\t\t\t\tif( ps[i][0]-ps[j][0] >= w ) break;\n\t\t\t\tw = min(w,dist(ps[i],ps[j]));\n\t\t\t}\n\t\t}\n\t\treturn w;\n\t}\n};\n\nusing namespace ClosestPair;\n\n\nstruct Pt{\n\tdouble x,y,z;\n};\nbool operator < (const Pt &a,const Pt &b){\n\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\n\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\n\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\n\treturn false;\n}\n\ndouble X[150000];\ndouble Y[150000];\ndouble Z[150000];\n\nint main(){\n\tint m,n,S,W;\n\tint tst = 1;\n\twhile( cin >> m >> n >> S >> W && m+n ){\n\t\tmap<Pt,vector<P>> dic;\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tscanf(\"%lf%lf%lf\",X+i,Y+i,Z+i);\n\t\t}\n\t\tint g = S;\n\t\tfor(int i=m; i<m+n; i++) {\n\t\t X[i] = (g/7) %100 + 1;\n\t\t Y[i] = (g/700) %100 + 1;\n\t\t Z[i] = (g/70000)%100 + 1;\n\t\t if( g%2 == 0 ) { g = (g/2); }\n\t\t else { g = (g/2) ^ W; }\n\t\t}\n\t\tfor(int i = 0 ; i < m+n ; i++){\n\t\t\tdouble x = X[i];\n\t\t\tdouble y = Y[i];\n\t\t\tdouble z = Z[i];\n\t\t\tP p = {x,y,z};\n\t\t\tdouble d = dist(P{0,0,0},p);\n\t\t\tPt e;\n\t\t\te.x = x / d;\n\t\t\te.y = y / d;\n\t\t\te.z = z / d;\n\t\t\tdic[e].push_back(p);\n\t\t}\n\t\tvector<P> ps;\n\t\tvector<P> cand;\n\t\tfor( auto &p : dic ){\n\t\t\tps.push_back(P{p.first.x,p.first.y,p.first.z});\n\t\t\t\n\t\t\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\n\t\t}\n\t\n\t\tdouble w = closetPairDistance(ps);\n\t\tauto b = makeBucket(ps,2*w);\n\t\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\n\t\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\t\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\n\t\t\t\tif( i != j ){\n\t\t\t\t\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\n\t\t\t\t\t\tbest = min(best,pair<P,P>{cand[i],cand[j]});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << (int)best.first[0] << \" \" << (int)best.first[1] << \" \" << (int)best.first[2] << \" \";\n\t\tcout << (int)best.second[0] << \" \" << (int)best.second[1] << \" \" << (int)best.second[2] << \"\\n\";\n\t}\n\t\n\n}","accuracy":1,"time_ms":3670,"memory_kb":31612,"score_of_the_acc":-0.8738,"final_rank":10},{"submission_id":"aoj_1340_1569098","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace ClosestPair{\n\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\n\tconst double EPS = 1e-9;\n\tconst int DIM = 3;\n\ttypedef array<double,DIM> P;\n\n\tdouble dist(const P &p1,const P &p2){\n\t\tdouble ans = 0;\n\t\tfor(int i = 0 ; i < DIM ; i++)\n\t\t\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\n\t\treturn sqrt(ans);\n\t}\n\ttypedef array<int,DIM> Block;\n\ttypedef map<Block,vector<int>> Bucket;\n\tBlock getBlock(const P &p,double w){\n\t\tBlock res;\n\t\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\n\t\treturn res;\n\t}\n\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\n\t\tvector<int> res;\n\t\tauto key = getBlock(p,w);\n\t\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\n\t\t\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\n\t\t\t\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\n\t\t\t\t\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\n\t\t\t\t\tif( it != b.end() ){\n\t\t\t\t\t\tfor( int id : it->second ) res.push_back(id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\treturn res;\n\t}\n\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\n\tBucket makeBucket(const vector<P> &ps,double w){\n\t\tBucket b;\n\t\tfor(int i = 0 ; i < ps.size() ; i++)\n\t\t\tb[getBlock(ps[i],w)].push_back(i);\n\t\treturn b;\n\t}\n\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\n\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\??????????\n\tdouble closetPairDistance(vector<P> ps){\n\t\tassert(ps.size()>=2);\n\t\trandom_shuffle(ps.begin(),ps.end());\n\t\tdouble w = dist(ps[0],ps[1]);\n\t\tvector<P> build = {ps[0],ps[1]};\n\t\tauto b = makeBucket(build,2*w);\n\t\tfor(int i = 2 ; i < ps.size() ; i++){\n\t\t\tdouble next_w = w;\n\t\t\tfor( int j : getNearPoints(b,2*w,ps[i]) )\n\t\t\t\tnext_w = min(next_w,dist(ps[i],ps[j]));\n\t\t\tbuild.push_back(ps[i]);\n\t\t\tif( w - EPS > next_w ){\n\t\t\t\tw = next_w;\n\t\t\t\tb = makeBucket(build,2*w);\n\t\t\t}else{\n\t\t\t\tb[getBlock(ps[i],2*w)].push_back(i);\n\t\t\t}\n\t\t}\n\t\treturn w;\n\t}\n};\n\nusing namespace ClosestPair;\n\n\nstruct Pt{\n\tdouble x,y,z;\n};\nbool operator < (const Pt &a,const Pt &b){\n\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\n\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\n\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\n\treturn false;\n}\n\ndouble X[150000];\ndouble Y[150000];\ndouble Z[150000];\n\nint main(){\n\tint m,n,S,W;\n\tint tst = 1;\n\twhile( cin >> m >> n >> S >> W && m+n ){\n\t\tmap<Pt,vector<P>> dic;\n\t\tfor(int i = 0 ; i < m ; i++){\n\t\t\tscanf(\"%lf%lf%lf\",X+i,Y+i,Z+i);\n\t\t}\n\t\tint g = S;\n\t\tfor(int i=m; i<m+n; i++) {\n\t\t X[i] = (g/7) %100 + 1;\n\t\t Y[i] = (g/700) %100 + 1;\n\t\t Z[i] = (g/70000)%100 + 1;\n\t\t if( g%2 == 0 ) { g = (g/2); }\n\t\t else { g = (g/2) ^ W; }\n\t\t}\n\t\tfor(int i = 0 ; i < m+n ; i++){\n\t\t\tdouble x = X[i];\n\t\t\tdouble y = Y[i];\n\t\t\tdouble z = Z[i];\n\t\t\tP p = {x,y,z};\n\t\t\tdouble d = dist(P{0,0,0},p);\n\t\t\tPt e;\n\t\t\te.x = x / d;\n\t\t\te.y = y / d;\n\t\t\te.z = z / d;\n\t\t\tdic[e].push_back(p);\n\t\t}\n\t\tvector<P> ps;\n\t\tvector<P> cand;\n\t\tfor( auto &p : dic ){\n\t\t\tps.push_back(P{p.first.x,p.first.y,p.first.z});\n\t\t\t\n\t\t\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\n\t\t}\n\t\n\t\tdouble w = closetPairDistance(ps);\n\t\tauto b = makeBucket(ps,2*w);\n\t\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\n\t\tfor(int i = 0 ; i < ps.size() ; i++){\n\t\t\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\n\t\t\t\tif( i != j ){\n\t\t\t\t\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\n\t\t\t\t\t\tbest = min(best,pair<P,P>{cand[i],cand[j]});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << (int)best.first[0] << \" \" << (int)best.first[1] << \" \" << (int)best.first[2] << \" \";\n\t\tcout << (int)best.second[0] << \" \" << (int)best.second[1] << \" \" << (int)best.second[2] << \"\\n\";\n\t\t\n\t}\n\t\n\n}","accuracy":1,"time_ms":7430,"memory_kb":44408,"score_of_the_acc":-1.5804,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_1340_10848362\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//using namespace std;\\n\\ntypedef long double LD;\\n\\nconst LD INF = 1e15;\\nconst LD eps = 1e-13;\\nconst int N = 155555;\\n\\nint n, m, S, W;\\n\\ninline LD norm(const LD &x) {\\n\\treturn x * x;\\n}\\n\\nstruct OriP {\\n\\tint x, y, z;\\n} p[N];\\n\\nstruct Point {\\n\\tLD x, y, z;\\n\\tint id;\\n\\tPoint() = default;\\n\\tPoint(const OriP &p) {\\n\\t\\tx = p.x;\\n\\t\\ty = p.y;\\n\\t\\tz = p.z;\\n\\t}\\n\\tconst LD& operator [] (int index) const {\\n\\t\\tif (index == 0) {\\n\\t\\t\\treturn x;\\n\\t\\t} else {\\n\\t\\t\\treturn index == 1 ? y : z;\\n\\t\\t}\\n\\t}\\n\\tfriend LD dist(const Point &a, const Point &b) {\\n\\t\\tLD result = 0.0;\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tresult += norm(a[i] - b[i]);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} point[N];\\n\\ninline bool operator == (const OriP &p, const OriP &q) {\\n\\treturn p.x == q.x && p.y == q.y && p.z == q.z;\\n}\\n\\ninline bool operator < (const OriP &p, const OriP &q) {\\n\\tif (p.x != q.x) {\\n\\t\\treturn p.x < q.x;\\n\\t}\\n\\tif (p.y != q.y) {\\n\\t\\treturn p.y < q.y; \\n\\t} else {\\n\\t\\treturn p.z < q.z;\\n\\t}\\n}\\n\\ninline bool operator > (const OriP &p, const OriP &q) {\\n\\tif (p.x != q.x) {\\n\\t\\treturn p.x > q.x;\\n\\t}\\n\\tif (p.y != q.y) {\\n\\t\\treturn p.y > q.y; \\n\\t} else {\\n\\t\\treturn p.z > q.z;\\n\\t}\\n}\\n\\nstruct Rectangle {\\n\\tLD min[3], max[3];\\n\\tRectangle() {\\n\\t\\tmin[0] = min[1] = min[2] = INF;\\n\\t\\tmax[0] = max[1] = max[2] = -INF;\\n\\t}\\n\\tvoid add(const Point &p) {\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tmin[i] = std::min(min[i], p[i]);\\n\\t\\t\\tmax[i] = std::max(max[i], p[i]);\\n\\t\\t}\\n//assert(min[0] > -1 && min[1] > -1 && min[2] > -1);\\n//assert(min[0] < 100 && min[1] < 100 && min[2] < 100);\\n\\t}\\n\\tdouble dist(const Point &p) {\\n\\t\\n\\t//std::cout << min[0] << \\\" \\\" << min[1] << \\\" \\\" << min[2] << std::endl;\\n\\t//std::cout << max[0] << \\\" \\\" << max[1] << \\\" \\\" << max[2] << std::endl;\\n\\t\\tdouble result = 0;\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tresult += norm(std::min(std::max(p[i], min[i]), max[i]) - p[i]);\\n\\t\\t\\t//result += std::max(norm(max[i] - p[i]), norm(min[i] - p[i]));\\n\\t\\t}\\n//assert(min[0] > -1 && min[1] > -1 && min[2] > -1);\\n//assert(min[0] < 100 && min[1] < 100 && min[2] < 100);\\n//return INF;\\n\\t\\treturn result;\\n\\t}\\n};\\n\\nstruct Node {\\n\\tPoint seperator;\\n\\tRectangle rectangle;\\n\\tint child[2];\\n\\tvoid reset(const Point &p) {\\n\\t\\tseperator = p;\\n\\t\\trectangle = Rectangle();\\n\\t\\trectangle.add(p);\\n\\t\\tchild[0] = child[1] = 0;\\n\\t}\\n} tree[N << 1];\\n\\nint size, pivot;\\n\\ninline int sign(LD x) {\\n\\tif (x < -eps) {\\n\\t\\treturn -1;\\n\\t}\\n\\telse {\\n\\t\\treturn x > eps;\\n\\t}\\n}\\n\\ninline bool compare(const Point &a, const Point &b) {\\n//std::cerr << \\\"cmp\\\" << \\\" \\\" << pivot << \\\" \\\" << a.x << \\\" \\\" << a.y << \\\" \\\" << a.z << \\\" \\\" << b.x << \\\" \\\" << b.y << \\\" \\\" << b.z << std::endl;\\n//std::cerr << a[pivot] << \\\" \\\" << b[pivot] << std::endl;\\n\\tif (sign(a[pivot] - b[pivot]) == 0) {\\n//std::cerr << \\\"check_id \\\" << a.id << \\\" \\\" << b.id << std::endl;\\n\\t\\tif (a.id == -1 || b.id == -1) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn p[a.id] < p[b.id];\\n\\t} else {\\n\\t\\treturn a[pivot] < b[pivot];\\n\\t}\\n}\\n\\ninline int build(int l, int r, int type = 1) {\\n//std::cout << l << \\\" \\\" << r << \\\" \\\" << std::endl;\\n\\tpivot = type;\\n\\tif (l > r) {\\n\\t\\treturn 0;\\n\\t}\\n\\tint x = ++size;\\n\\tint mid = l + r >> 1;\\n\\tstd::nth_element(point + l, point + mid, point + r, compare);\\n\\ttree[x].reset(point[mid]);\\n//std::cout << l << \\\" \\\" << mid << \\\" \\\" << r << \\\" \\\" << tree[x].seperator.id << std::endl;\\n//std::cout << tree[x].seperator.x << \\\" \\\" << tree[x].seperator.y << \\\" \\\" << tree[x].seperator.z << \\\" \\\" << std::endl;\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\ttree[x].rectangle.add(point[i]);\\n\\t}\\n\\ttree[x].child[0] = build(l, mid - 1, (type + 1) % 3);\\n\\ttree[x].child[1] = build(mid + 1, r, (type + 1) % 3);\\n\\t\\n//assert(tree[x].rectangle.min[0] > -1 && tree[x].rectangle.min[1] > -1 && tree[x].rectangle.min[2] > -1);\\n//assert(tree[x].rectangle.min[0] < 100 && tree[x].rectangle.min[1] < 100 && tree[x].rectangle.min[2] < 100);\\n\\treturn x;\\n}\\n\\ninline void query(int x, const Point &u, std::pair<LD, int> & answer, int type = 1) {\\n//std::cout << \\\"root = \\\" << x << \\\" \\\" << u.x << \\\" \\\" << u.y << \\\" \\\" << u.z << std::endl;\\n\\tif (!x) {\\n\\t\\treturn;\\n\\t}\\n\\tpivot = type;\\n//std::cout << tree[x].rectangle.dist(u) << std::endl;\\n\\tif (tree[x].rectangle.dist(u) > answer.first + 1e-6) {\\n\\t\\treturn;\\n\\t}\\n\\tdouble d = dist(tree[x].seperator, u);\\n\\t\\n/*std::cout << \\\"asdfasf\\\" << std::endl;\\nstd::cout << u.x << \\\" \\\" << u.y << \\\" \\\" << u.z << std::endl;\\nstd::cout << tree[x].seperator.x << \\\" \\\" << tree[x].seperator.y << \\\" \\\" << tree[x].seperator.z << \\\" \\\" << std::endl;\\nstd::cout << d << \\\" \\\" << sign(d) << std::endl;\\n*/\\n\\t\\n\\tif (sign(d) && (sign(d - answer.first) == -1 || sign(d - answer.first) == 0 && p[tree[x].seperator.id] < p[answer.second])) {\\n\\t\\tanswer = std::make_pair(d, tree[x].seperator.id);\\n\\t}\\n//std::cerr << \\\"gogogo\\\" << std::endl;\\n\\tif (compare(u, tree[x].seperator)) {\\n\\t\\tquery(tree[x].child[0], u, answer, (type + 1) % 3);\\n\\t\\tquery(tree[x].child[1], u, answer, (type + 1) % 3);\\n\\t} else {\\n\\t\\tquery(tree[x].child[1], u, answer, (type + 1) % 3);\\n\\t\\tquery(tree[x].child[0], u, answer, (type + 1) % 3);\\n\\t}\\n} \\n\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tstd::cout.tie(0);\\n\\t\\n\\twhile (std::cin >> m >> n >> S >> W) {\\n\\t\\tif (!m && !n && !S && !W) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= m; ++i) {\\n\\t\\t\\tstd::cin >> p[i].x >> p[i].y >> p[i].z;\\n\\t\\t}\\n\\t\\tint g = S;\\n\\t\\tfor (int i = 1; i <= n; ++i) {\\n\\t\\t//std::cerr << i << std::endl;\\n\\t\\t\\tp[i + m].x = (g / 7) % 100 + 1;\\n\\t\\t\\tp[i + m].y = (g / 700) % 100 + 1;\\n\\t\\t\\tp[i + m].z = (g / 70000) % 100 + 1;\\n\\t\\t\\tif (g % 2 == 0) {\\n\\t\\t\\t\\tg = g / 2;\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tg = (g / 2) ^ W;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tn += m;//return 0;\\n\\t\\t\\n\\t\\tstd::pair<LD, int> nowans;\\n\\t\\tfor (int i = 1; i <= n; ++i) {\\n\\t\\t\\tdouble dist = sqrt(p[i].x * p[i].x + p[i].y * p[i].y + p[i].z * p[i].z);\\n\\t\\t\\tpoint[i].x = p[i].x / dist;\\n\\t\\t\\tpoint[i].y = p[i].y / dist;\\n\\t\\t\\tpoint[i].z = p[i].z / dist;\\n\\t\\t\\tpoint[i].id = i;\\n//std::cout << \\\"node[\\\" << i << \\\"]= \\\" << p[i].x << \\\" \\\" << p[i].y << \\\" \\\" << p[i].z << std::endl;\\n//std::cout << point[i].x << \\\" \\\" << point[i].y << \\\" \\\" << point[i].z << std::endl;\\n\\t\\t}\\n\\t\\tsize = 0;\\n\\t\\tbuild(1, n);// return 0;\\n\\t\\t//std::cout << size << std::endl; return 0;\\n\\t\\t//std::cout << \\\"adsf\\\" << std::endl;\\n\\t\\tstd::pair<int, int> ans = std::make_pair(-1, 2);\\n\\t\\tdouble ansd = (p[1].x * p[2].x + p[1].y * p[2].y + p[1].z * p[2].z) \\n\\t\\t\\t\\t/ sqrt(p[1].x * p[1].x + p[1].y * p[1].y + p[1].z * p[1].z)\\n\\t\\t\\t\\t/ sqrt(p[2].x * p[2].x + p[2].y * p[2].y + p[2].z * p[2].z);\\n\\t\\tfor (int i = 1; i <= n; ++i) {\\n\\t\\t\\tnowans = std::make_pair(INF, 0);\\n\\t\\t\\tPoint u(p[i]);\\n\\t\\t\\tdouble d = sqrt(p[i].x * p[i].x + p[i].y * p[i].y + p[i].z * p[i].z);\\n\\t\\t\\tu.x /= d;\\n\\t\\t\\tu.y /= d;\\n\\t\\t\\tu.z /= d;\\n\\t\\t\\tu.id = -1;\\n//std::cerr << \\\"query \\\" << i << \\\" \\\" << std::endl;\\n\\t\\t\\tquery(1, u, nowans);\\n\\t\\t\\tstd::pair<int, int> now = std::make_pair(i, nowans.second);\\n\\t\\t\\tif (p[now.first] > p[now.second]) {\\n\\t\\t\\t\\tstd::swap(now.first, now.second);\\n\\t\\t\\t}\\n\\t\\t\\tint j = now.first, k = now.second;\\n\\t\\t\\td = (p[j].x * p[k].x + p[j].y * p[k].y + p[j].z * p[k].z) \\n\\t\\t\\t\\t/ sqrt(p[j].x * p[j].x + p[j].y * p[j].y + p[j].z * p[j].z)\\n\\t\\t\\t\\t/ sqrt(p[k].x * p[k].x + p[k].y * p[k].y + p[k].z * p[k].z);\\n/*std::cout << \\\"now: \\\" << i << \\\" \\\" << d << \\\" \\\" << nowans.second << \\\" \\\" << nowans.first << std::endl;\\nstd::cout << u.x << \\\" \\\" << u.y << \\\" \\\" << u.z << std::endl;\\nstd::cout << p[nowans.second].x << \\\" \\\" << p[nowans.second].y << \\\" \\\" << p[nowans.second].z << std::endl;\\t\\n*/\\t\\t\\tif (ans.first == -1) {\\n\\t\\t\\t\\tans = now;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (sign(d - ansd) == -1) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (sign(d - ansd) == 1) {\\t\\n\\t\\t\\t\\tans = now;\\n\\t\\t\\t\\tansd = d;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (p[j] < p[ans.first] || p[j] == p[ans.first] && p[k] < p[ans.second]) {\\n\\t\\t\\t\\t\\tans = now;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//std::cerr << \\\"123\\\" << std::endl;\\n\\t\\t\\n\\t\\tstd::cout << p[ans.first].x << \\\" \\\" << p[ans.first].y << \\\" \\\" << p[ans.first].z << \\\" \\\" \\n\\t\\t\\t\\t<< p[ans.second].x << \\\" \\\" << p[ans.second].y << \\\" \\\" << p[ans.second].z << std::endl;\\n\\t}\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3400,\n \"memory_kb\": 67544,\n \"score_of_the_acc\": -1.4083,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1340_6148187\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\n\\n\\n\\n\\nint m, n, s, w;\\nvoid solve() {\\n\\tvector<vector<int>> v(m + n);\\n\\trep(i, m) {\\n\\t\\tv[i].resize(3);\\n\\t\\trep(j, 3)cin >> v[i][j];\\n\\t}\\n\\tint g = s;\\n\\trep(i, n) {\\n\\t\\tv[i + m].resize(3);\\n\\t\\tv[i + m][0] = (g / 7) % 100 + 1;\\n\\t\\tv[i + m][1] = (g / 700) % 100 + 1;\\n\\t\\tv[i + m][2] = (g / 70000) % 100 + 1;\\n\\t\\tif (g % 2 == 0)g /= 2;\\n\\t\\telse g = (g / 2) ^ w;\\n\\t}\\n\\t//erase same vector\\n\\t{\\n\\t\\tvector<vector<int>> nv;\\n\\t\\tset<vector<int>> st;\\n\\t\\trep(i, m + n) {\\n\\t\\t\\tint g = 0;\\n\\t\\t\\trep(j, 3)g = gcd(g, v[i][j]);\\n\\t\\t\\tvector<int> cur(3);\\n\\t\\t\\trep(j, 3)cur[j] = v[i][j] / g;\\n\\t\\t\\tif (!st.count(cur)) {\\n\\t\\t\\t\\tnv.push_back(v[i]);\\n\\t\\t\\t\\tst.insert(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(v, nv);\\n\\t\\tn = v.size();\\n\\t\\tsort(all(v));\\n\\t}\\n\\tassert(n >= 2);\\n\\tvector<pair<LDP, int>> vtp;\\n\\tvector<ld> rr(n);\\n\\trep(i, n) {\\n\\t\\trr[i] = sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1] + v[i][2] * v[i][2]);\\n\\t\\tvtp.push_back({ {v[i][0] / rr[i],v[i][1] / rr[i]},i });\\n\\t}\\n\\tsort(all(vtp));\\n\\tauto calc = [&](int i, int j) {\\n\\t\\tld res = 0;\\n\\t\\trep(k, 3)res += (v[i][k]/rr[i] - v[j][k]/rr[j]) * (v[i][k]/rr[i] - v[j][k]/rr[j]);\\n\\t\\treturn res;\\n\\t};\\n\\tld ans = mod;\\n\\tP ansp = { -1,-1 };\\n\\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\\n\\t\\tld mi = mod;\\n\\t\\tif (l + 1 == r)return mod;\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tchmin(mi, yaru(l, m));\\n\\t\\tchmin(mi, yaru(m, r));\\n\\t\\tld res = mi;\\n\\t\\tld t = vtp[m - 1].first.first;\\n\\t\\tvector<pair<ld, int>> vl, vr;\\n\\t\\tRep(i, l, m) {\\n\\t\\t\\tld dx = t - vtp[i].first.first;\\n\\t\\t\\tif (dx*dx > ans + (1e-8))continue;\\n\\t\\t\\tvl.push_back({ vtp[i].first.second,vtp[i].second });\\n\\t\\t}\\n\\t\\tRep(i, m, r) {\\n\\t\\t\\tld dx = t - vtp[i].first.first;\\n\\t\\t\\tif (dx * dx > ans + (1e-8))continue;\\n\\t\\t\\tvr.push_back({ vtp[i].first.second,vtp[i].second });\\n\\t\\t}\\n\\t\\tsort(all(vl));\\n\\t\\tsort(all(vr));\\n\\t\\tint locl = 0;\\n\\t\\tint locr = 0;\\n\\t\\t//[locl,locr)\\n\\t\\trep(i, vl.size()) {\\n\\t\\t\\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\\n\\t\\t\\t\\tld dy = vl[i].first - vr[locl].first;\\n\\t\\t\\t\\tif (dy * dy > ans + (1e-8))locl++;\\n\\t\\t\\t\\telse break;\\n\\t\\t\\t}\\n\\t\\t\\twhile (locr < vr.size()) {\\n\\t\\t\\t\\tif (vr[locr].first < vl[i].first)locr++;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tld dy = vr[locr].first - vl[i].first;\\n\\t\\t\\t\\t\\tif (dy * dy > ans + (1e-8))break;\\n\\t\\t\\t\\t\\telse locr++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tassert(locl <= locr);\\n\\t\\t\\tRep(j, locl, locr) {\\n\\t\\t\\t\\tld val = calc(vl[i].second,vr[j].second);\\n\\t\\t\\t\\tP p = minmax(vl[i].second, vr[j].second);\\n\\t\\t\\t\\tif (abs(ans - val) < (1e-12)) {\\n\\t\\t\\t\\t\\tansp = min(ansp, p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ans > val) {\\n\\t\\t\\t\\t\\tans = val;\\n\\t\\t\\t\\t\\tansp = p;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres = min(res, val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\tyaru(0, n);\\n\\tassert(ansp.first >= 0);\\n\\tvector<int> anss;\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.first][j]);\\n\\t}\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.second][j]);\\n\\t}\\n\\tcoutarray(anss);\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\twhile (cin >> m >> n >> s >> w, m + n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1510,\n \"memory_kb\": 26936,\n \"score_of_the_acc\": -0.5104,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1340_6148183\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tif (x == 0)return 0;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tint n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) {\\n\\t\\tif (m < 0 || mod <= m) {\\n\\t\\t\\tm %= mod; if (m < 0)m += mod;\\n\\t\\t}\\n\\t\\tn = m;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 20;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\n\\n\\n\\nint m, n, s, w;\\nvoid solve() {\\n\\tvector<vector<int>> v(m + n);\\n\\trep(i, m) {\\n\\t\\tv[i].resize(3);\\n\\t\\trep(j, 3)cin >> v[i][j];\\n\\t}\\n\\tint g = s;\\n\\trep(i, n) {\\n\\t\\tv[i + m].resize(3);\\n\\t\\tv[i + m][0] = (g / 7) % 100 + 1;\\n\\t\\tv[i + m][1] = (g / 700) % 100 + 1;\\n\\t\\tv[i + m][2] = (g / 70000) % 100 + 1;\\n\\t\\tif (g % 2 == 0)g /= 2;\\n\\t\\telse g = (g / 2) ^ w;\\n\\t}\\n\\t//erase same vector\\n\\t{\\n\\t\\tvector<vector<int>> nv;\\n\\t\\tset<vector<int>> st;\\n\\t\\trep(i, m + n) {\\n\\t\\t\\tint g = 0;\\n\\t\\t\\trep(j, 3)g = gcd(g, v[i][j]);\\n\\t\\t\\tvector<int> cur(3);\\n\\t\\t\\trep(j, 3)cur[j] = v[i][j] / g;\\n\\t\\t\\tif (!st.count(cur)) {\\n\\t\\t\\t\\tnv.push_back(v[i]);\\n\\t\\t\\t\\tst.insert(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(v, nv);\\n\\t\\tn = v.size();\\n\\t\\tsort(all(v));\\n\\t}\\n\\tassert(n >= 2);\\n\\tvector<pair<LDP, int>> vtp;\\n\\tvector<ld> rr(n);\\n\\trep(i, n) {\\n\\t\\trr[i] = sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1] + v[i][2] * v[i][2]);\\n\\t\\tvtp.push_back({ {v[i][0] / rr[i],v[i][1] / rr[i]},i });\\n\\t}\\n\\tsort(all(vtp));\\n\\tauto calc = [&](int i, int j) {\\n\\t\\tld res = 0;\\n\\t\\trep(k, 3)res += (v[i][k]/rr[i] - v[j][k]/rr[j]) * (v[i][k]/rr[i] - v[j][k]/rr[j]);\\n\\t\\treturn res;\\n\\t};\\n\\tld ans = mod;\\n\\tP ansp = { -1,-1 };\\n\\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\\n\\t\\tld mi = mod;\\n\\t\\tif (l + 1 == r)return mod;\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tchmin(mi, yaru(l, m));\\n\\t\\tchmin(mi, yaru(m, r));\\n\\t\\tld res = mi;\\n\\t\\tld t = vtp[m - 1].first.first;\\n\\t\\tvector<pair<ld, int>> vl, vr;\\n\\t\\tRep(i, l, m) {\\n\\t\\t\\tld dx = t - vtp[i].first.first;\\n\\t\\t\\tif (dx*dx > ans + (1e-8))continue;\\n\\t\\t\\tvl.push_back({ vtp[i].first.second,vtp[i].second });\\n\\t\\t}\\n\\t\\tRep(i, m, r) {\\n\\t\\t\\tld dx = t - vtp[i].first.first;\\n\\t\\t\\tif (dx * dx > ans + (1e-8))continue;\\n\\t\\t\\tvr.push_back({ vtp[i].first.second,vtp[i].second });\\n\\t\\t}\\n\\t\\tsort(all(vl));\\n\\t\\tsort(all(vr));\\n\\t\\t//cout << \\\"! \\\" << l << \\\" \\\" << r << \\\" \\\" << vl.size() << \\\" \\\" << vr.size() << \\\"\\\\n\\\";\\n\\t\\tint locl = 0;\\n\\t\\tint locr = 0;\\n\\t\\t//[locl,locr)\\n\\t\\trep(i, vl.size()) {\\n\\t\\t\\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\\n\\t\\t\\t\\tld dy = vl[i].first - vr[locl].first;\\n\\t\\t\\t\\tif (dy * dy > ans + (1e-8))locl++;\\n\\t\\t\\t\\telse break;\\n\\t\\t\\t}\\n\\t\\t\\twhile (locr < vr.size()) {\\n\\t\\t\\t\\tif (vr[locr].first < vl[i].first)locr++;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tld dy = vr[locr].first - vl[i].first;\\n\\t\\t\\t\\t\\tif (dy * dy > ans + (1e-8))break;\\n\\t\\t\\t\\t\\telse locr++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tassert(locl <= locr);\\n\\t\\t\\tRep(j, locl, locr) {\\n\\t\\t\\t\\tld val = calc(vl[i].second,vr[j].second);\\n\\t\\t\\t\\tP p = minmax(vl[i].second, vr[j].second);\\n\\t\\t\\t\\tif (abs(ans - val) < (1e-12)) {\\n\\t\\t\\t\\t\\tansp = min(ansp, p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ans > val) {\\n\\t\\t\\t\\t\\tans = val;\\n\\t\\t\\t\\t\\tansp = p;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres = min(res, val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\tyaru(0, n);\\n\\tassert(ansp.first >= 0);\\n\\tvector<int> anss;\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.first][j]);\\n\\t}\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.second][j]);\\n\\t}\\n\\t//cout << \\\"ans is \\\";\\n\\tcoutarray(anss);\\n\\t/*int id1 = -1;\\n\\trep(i, v.size())if (v[i] == vector<int>{42, 40, 46})id1 = i;\\n\\tint id2 = -1;\\n\\trep(i, v.size())if (v[i] == vector<int>{83, 79, 91})id2 = i;\\n\\tcout << ans << \\\" \\\" << calc(id1,id2) << \\\"\\\\n\\\";\\n\\tcout << \\\"! \\\" << id1 << \\\" \\\" << id2 << \\\"\\\\n\\\";*/\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//while(true)\\n\\t//expr();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile (cin >> m >> n >> s >> w, m + n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1510,\n \"memory_kb\": 35164,\n \"score_of_the_acc\": -0.6411,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1340_6148147\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\n#include<chrono>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\ntemplate<typename T>\\nvoid chmin(T& a, T b) {\\n\\ta = min(a, b);\\n}\\ntemplate<typename T>\\nvoid chmax(T& a, T b) {\\n\\ta = max(a, b);\\n}\\ntemplate<typename T>\\nvoid cinarray(vector<T>& v) {\\n\\trep(i, v.size())cin >> v[i];\\n}\\ntemplate<typename T>\\nvoid coutarray(vector<T>& v) {\\n\\trep(i, v.size()) {\\n\\t\\tif (i > 0)cout << \\\" \\\"; cout << v[i];\\n\\t}\\n\\tcout << \\\"\\\\n\\\";\\n}\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tif (x == 0)return 0;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tint n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) {\\n\\t\\tif (m < 0 || mod <= m) {\\n\\t\\t\\tm %= mod; if (m < 0)m += mod;\\n\\t\\t}\\n\\t\\tn = m;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 20;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nll gcd(ll a, ll b) {\\n\\ta = abs(a); b = abs(b);\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tll r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\n\\n\\n\\nint m, n, s, w;\\nvoid solve() {\\n\\tvector<vector<int>> v(m + n);\\n\\trep(i, m) {\\n\\t\\tv[i].resize(3);\\n\\t\\trep(j, 3)cin >> v[i][j];\\n\\t}\\n\\tint g = s;\\n\\trep(i, n) {\\n\\t\\tv[i + m].resize(3);\\n\\t\\tv[i + m][0] = (g / 7) % 100 + 1;\\n\\t\\tv[i + m][1] = (g / 700) % 100 + 1;\\n\\t\\tv[i + m][2] = (g / 70000) % 100 + 1;\\n\\t\\tif (g % 2 == 0)g /= 2;\\n\\t\\telse g = (g / 2) ^ w;\\n\\t}\\n\\t//erase same vector\\n\\t{\\n\\t\\tvector<vector<int>> nv;\\n\\t\\tset<vector<int>> st;\\n\\t\\trep(i, m + n) {\\n\\t\\t\\tint g = 0;\\n\\t\\t\\trep(j, 3)g = gcd(g, v[i][j]);\\n\\t\\t\\tvector<int> cur(3);\\n\\t\\t\\trep(j, 3)cur[j] = v[i][j] / g;\\n\\t\\t\\tif (!st.count(cur)) {\\n\\t\\t\\t\\tnv.push_back(v[i]);\\n\\t\\t\\t\\tst.insert(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(v, nv);\\n\\t\\tn = v.size();\\n\\t\\tsort(all(v));\\n\\t}\\n\\tassert(n >= 2);\\n\\t//rep(i, n)coutarray(v[i]);\\n\\tvector<LDP> vt(n);\\n\\trep(i, n) {\\n\\t\\tvt[i] = { atan2l(v[i][1],v[i][0]),atan2l(v[i][2],sqrt(v[i][0] * v[i][0] + v[i][1] * v[i][1])) };\\n\\t}\\n\\tvector<pair<LDP, int>> vtp;\\n\\trep(i, n) {\\n\\t\\tvtp.push_back({ vt[i],i });\\n\\t}\\n\\tsort(all(vtp));\\n\\tauto trans = [&](LDP a, ld& x, ld& y, ld& z) {\\n\\t\\tz = sin(a.second);\\n\\t\\tld xy = cos(a.second);\\n\\t\\tx = xy * cos(a.first);\\n\\t\\ty = xy * sin(a.first);\\n\\t};\\n\\tauto calc = [&](LDP a, LDP b) {\\n\\t\\tld x1, y1, z1, x2, y2, z2;\\n\\t\\ttrans(a, x1, y1, z1);\\n\\t\\ttrans(b, x2, y2, z2);\\n\\t\\treturn (x1 * x2 + y1 * y2 + z1 * z2) / sqrt(x1 * x1 + y1 * y1 + z1 * z1) / sqrt(x2 * x2 + y2 * y2 + z2 * z2);\\n\\t};\\n\\tld ans = 0;\\n\\tP ansp = { -1,-1 };\\n\\tfunction<ld(int, int)> yaru = [&](int l, int r)->ld {\\n\\t\\tld ma = 0;\\n\\t\\tif (l + 1 == r)return 0;\\n\\t\\tint m = (l + r) / 2;\\n\\t\\tchmax(ma, yaru(l, m));\\n\\t\\tchmax(ma, yaru(m, r));\\n\\t\\tld res = ma;\\n\\t\\tld t = vt[m - 1].first;\\n\\t\\tvector<pair<ld, int>> vl, vr;\\n\\t\\tRep(i, l, m) {\\n\\t\\t\\tLDP mirr = { t,vt[i].second };\\n\\t\\t\\tif (calc(mirr, vt[i]) < ma - (1e-0))continue;\\n\\t\\t\\t//if (l == 0 &&r == n)cout << \\\"!! \\\" << i << \\\"\\\\n\\\";\\n\\t\\t\\tvl.push_back({ vt[i].second,i });\\n\\t\\t}\\n\\t\\tRep(i, m, r) {\\n\\t\\t\\tLDP mirr = { t,vt[i].second };\\n\\t\\t\\tif (calc(mirr, vt[i]) < ma - (1e-0))continue;\\n\\t\\t\\tvr.push_back({ vt[i].second,i });\\n\\t\\t\\t//if (l == 0 && r == n)cout << \\\"!! \\\" << i << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t\\tsort(all(vl));\\n\\t\\tsort(all(vr));\\n\\t\\t//cout << \\\"! \\\" << l << \\\" \\\" << r << \\\" \\\" << vl.size() << \\\" \\\" << vr.size() << \\\"\\\\n\\\";\\n\\t\\tint locl = 0;\\n\\t\\tint locr = 0;\\n\\t\\t//[locl,locr)\\n\\t\\trep(i, vl.size()) {\\n\\t\\t\\tLDP cur = vt[vl[i].second];\\n\\t\\t\\twhile (locl < vr.size() && vr[locl].first < vl[i].first) {\\n\\t\\t\\t\\tLDP mirr = cur; mirr.second = vr[locl].first;\\n\\t\\t\\t\\tif (calc(mirr, cur) < ma - (1e-8))locl++;\\n\\t\\t\\t\\telse break;\\n\\t\\t\\t}\\n\\t\\t\\twhile (locr < vr.size()) {\\n\\t\\t\\t\\tif (vr[locr].first < vl[i].first)locr++;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tLDP mirr = cur; mirr.second = vr[locr].first;\\n\\t\\t\\t\\t\\tif (calc(mirr, cur) < ma - (1e-8))break;\\n\\t\\t\\t\\t\\telse locr++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tassert(locl <= locr);\\n\\t\\t\\tRep(j, locl, locr) {\\n\\t\\t\\t\\tld val = calc(cur, vt[vr[j].second]);\\n\\t\\t\\t\\tP p = { vl[i].second,vr[j].second };\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\t//cout << \\\"!! \\\" << p.first << \\\" \\\" << p.second << \\\"\\\\n\\\";\\n\\t\\t\\t\\tif (abs(ans - val) < (1e-12)) {\\n\\t\\t\\t\\t\\tansp = min(ansp, p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ans < val) {\\n\\t\\t\\t\\t\\tans = val;\\n\\t\\t\\t\\t\\tansp = p;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres = max(res, val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\tyaru(0, n);\\n\\tassert(ansp.first >= 0);\\n\\tvector<int> anss;\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.first][j]);\\n\\t}\\n\\trep(j, 3) {\\n\\t\\tanss.push_back(v[ansp.second][j]);\\n\\t}\\n\\t//cout << \\\"ans is \\\";\\n\\tcoutarray(anss);\\n\\t/*int id1 = -1;\\n\\trep(i, v.size())if (v[i] == vector<int>{42, 40, 46})id1 = i;\\n\\tint id2 = -1;\\n\\trep(i, v.size())if (v[i] == vector<int>{83, 79, 91})id2 = i;*/\\n\\t//cout << ans << \\\" \\\" << calc(vt[id1], vt[id2]) << \\\"\\\\n\\\";\\n\\t//cout << \\\"! \\\" << id1 << \\\" \\\" << id2 << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(10);\\n\\t//init_f();\\n\\t//init();\\n\\t//while(true)\\n\\t//expr();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\twhile (cin >> m >> n >> s >> w, m + n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5280,\n \"memory_kb\": 35448,\n \"score_of_the_acc\": -1.1503,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1340_3707121\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n#define EPS 0.0000001\\n#define NUM 120005\\n\\nstruct Info{\\n\\n\\tbool operator<(const struct Info &arg) const{\\n\\t\\treturn angle < arg.angle;\\n\\t}\\n\\tll x,y,z;\\n\\tdouble angle;\\n};\\n\\n\\nint N;\\nInfo info[NUM];\\n\\n\\ndouble calc_angle(Info A,Info B){\\n\\n\\tdouble bunshi = A.x*B.x+A.y*B.y+A.z*B.z;\\n\\tdouble bunbo = sqrt(A.x*A.x+A.y*A.y+A.z*A.z)*sqrt(B.x*B.x+B.y*B.y+B.z*B.z);\\n\\n\\treturn acos(bunshi/bunbo);\\n}\\n\\nbool compare(Info A,Info B){\\n\\n\\tif(A.x != B.x){\\n\\n\\t\\treturn A.x < B.x;\\n\\n\\t}else if(A.y != B.y){\\n\\n\\t\\treturn A.y < B.y;\\n\\n\\t}else if(A.z != B.z){\\n\\n\\t\\treturn A.z < B.z;\\n\\t}\\n\\treturn -1;\\n}\\n\\nbool isSame(Info A,Info B){\\n\\n\\treturn A.x == B.x && A.y == B.y && A.z == B.z;\\n}\\n\\nvoid func(){\\n\\n\\n\\tInfo base;\\n\\tbase.x = 1;\\n\\tbase.y = 1;\\n\\tbase.z = 1;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tinfo[i].angle = calc_angle(base,info[i]);\\n\\t}\\n\\n\\tsort(info,info+N);\\n\\n\\tInfo ans_L,ans_R;\\n\\n\\tdouble minimum = acos(0);\\n\\tdouble tmp_angle;\\n\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(fabs(info[i].angle - info[k].angle) > minimum) break;\\n\\n\\t\\t\\ttmp_angle = calc_angle(info[i],info[k]);\\n\\t\\t\\tif(tmp_angle < EPS)continue;\\n\\n\\t\\t\\tif(tmp_angle+EPS < minimum){\\n\\t\\t\\t\\tminimum = tmp_angle;\\n\\n\\t\\t\\t\\tif(compare(info[i],info[k])){\\n\\n\\t\\t\\t\\t\\tans_L = info[i];\\n\\t\\t\\t\\t\\tans_R = info[k];\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tans_L = info[k];\\n\\t\\t\\t\\t\\tans_R = info[i];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else if(fabs(tmp_angle-minimum) < EPS){\\n\\n\\t\\t\\t\\tif(compare(info[i],info[k])){\\n\\n\\t\\t\\t\\t\\tif((compare(info[i],ans_L) == true) || (isSame(info[i],ans_L) && compare(info[k],ans_R) == true)){\\n\\n\\t\\t\\t\\t\\t\\tans_L = info[i];\\n\\t\\t\\t\\t\\t\\tans_R = info[k];\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif((compare(info[k],ans_L) == true) || (isSame(info[k],ans_L) && compare(info[i],ans_R) == true)){\\n\\n\\t\\t\\t\\t\\t\\tans_L = info[k];\\n\\t\\t\\t\\t\\t\\tans_R = info[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld %lld %lld %lld %lld %lld\\\\n\\\",ans_L.x,ans_L.y,ans_L.z,ans_R.x,ans_R.y,ans_R.z);\\n}\\n\\nint main(){\\n\\n\\tll num_1,num_2,S,W;\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%lld %lld %lld %lld\\\",&num_1,&num_2,&S,&W);\\n\\t\\tif(num_1 == 0 && num_2 == 0 && S == 0 && W == 0)break;\\n\\n\\t\\tfor(int i = 0; i < num_1; i++){\\n\\n\\t\\t\\tscanf(\\\"%lld %lld %lld\\\",&info[i].x,&info[i].y,&info[i].z);\\n\\t\\t}\\n\\n\\t\\tll g = S;\\n\\n\\t\\tfor(int i = 0; i < num_2; i++){\\n\\t\\t\\tinfo[i+num_1].x = (g/7) %100 + 1;\\n\\t\\t\\tinfo[i+num_1].y = (g/700) %100 + 1;\\n\\t\\t\\tinfo[i+num_1].z = (g/70000)%100 + 1;\\n\\t\\t\\tif( g%2 == 0 ) { g = (g/2); }\\n\\t\\t\\telse { g = (g/2) ^ W; }\\n\\t\\t}\\n\\n\\t\\tN = num_1+num_2;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 6756,\n \"score_of_the_acc\": -0.123,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1340_3086248\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <iomanip>\\n#include <map>\\nusing namespace std;\\nconst double EPS = 1e-8;\\nconst double INF = 1e18;\\n\\nbool epsleq(const double &a, const double &b){\\n return a +EPS < b;\\n}\\nbool epseq(const double &a, const double &b){\\n return abs(a-b) < EPS;\\n}\\n\\nstruct Point{\\n double x,y,z;\\n Point(double x, double y, double z):x(x), y(y), z(z){}\\n Point(){}\\n Point &operator +=(const Point &a){ x+=a.x; y+=a.y; z+=a.z; return *this; }\\n Point &operator -=(const Point &a){ x-=a.x; y-=a.y; z-=a.z; return *this; }\\n Point &operator *=(const double &a){ x*=a; y*=a; z*=a; return *this; }\\n Point operator +(const Point &a) const{ return Point(x+a.x, y+a.y, z+a.z); }\\n Point operator -(const Point &a) const{ return Point(x-a.x, y-a.y, z-a.z); }\\n Point operator *(const double &a) const{ return Point(a*x, a*y, a*z); }\\n Point operator -() { return Point(-x, -y, -z); }\\n bool operator <(const Point &a) const{\\n return !epseq(x, a.x)? x < a.x: !epseq(y, a.y)? y < a.y: epsleq(z, a.z);\\n }\\n bool operator ==(const Point &a) const{\\n double dx=x-a.x, dy=y-a.y, dz=z-a.z;\\n return sqrt(dx*dx +dy*dy +dz*dz) < EPS;\\n }\\n};\\n\\ndouble dot(const Point &a, const Point &b){\\n return a.x*b.x +a.y*b.y +a.z*b.z;\\n}\\nPoint cross(const Point &a, const Point &b){\\n return Point(a.y*b.z -a.z*b.y, a.z*b.x -a.x*b.z, a.x*b.y -a.y*b.x);\\n}\\ndouble abs(const Point &a){\\n return sqrt(dot(a, a));\\n}\\nPoint unit(const Point &a){\\n return a *(1/abs(a));\\n}\\n\\nbool ycomp(const Point &a, const Point &b){\\n return !epseq(a.y, b.y)? a.y < b.y: !epseq(a.x, b.x)? a.x < b.x: epsleq(a.z, b.z);\\n}\\nbool dpcomp(const pair<double, pair<Point, Point> > &a, const pair<double, pair<Point, Point> > &b){\\n return !epseq(a.first, b.first)? a.first < b.first : a.second < b.second;\\n}\\n\\npair<double, pair<Point, Point> > closest(vector<Point> &v, int first, int last, map<Point, Point> &conv){\\n if(last -first <= 1) return make_pair(INF, make_pair(Point(), Point()));\\n int mid = (first +last)/2;\\n double midx = v[mid].x;\\n pair<double, pair<Point, Point> > cp = min(closest(v, first, mid, conv), closest(v, mid, last, conv), dpcomp);\\n inplace_merge(v.begin()+first, v.begin()+mid, v.begin()+last, ycomp);\\n \\n vector<Point> near;\\n for(int i=first; i<last; i++){\\n if(abs(v[i].x -midx) > cp.first +EPS) continue;\\n for(int j=near.size()-1; j>=0; j--){\\n if(abs(v[i].y -near[j].y) > cp.first +EPS){\\n break;\\n }\\n pair<double, pair<Point, Point> > ncp(abs(v[i] -near[j]), pair<Point, Point>(conv[v[i]], conv[near[j]]));\\n if(ncp.second.second < ncp.second.first) swap(ncp.second.first, ncp.second.second);\\n cp = min(cp, ncp, dpcomp);\\n }\\n near.push_back(v[i]);\\n }\\n return cp;\\n}\\n\\nint main(){\\n while(1){\\n int m,n,s,w;\\n cin >> m >> n >> s >> w;\\n if(m==0 && n==0) break;\\n\\n vector<Point> v(m+n);\\n for(int i=0; i<m; i++){\\n cin >> v[i].x >> v[i].y >> v[i].z;\\n }\\n for(int i=m; i<m+n; i++){\\n v[i].x = (s/7) %100 +1;\\n v[i].y = (s/700) %100 +1;\\n v[i].z = (s/70000) %100 +1;\\n if(s%2 == 0){\\n s = s/2;\\n }else{\\n s = (s/2) ^ w;\\n }\\n }\\n\\n n += m;\\n map<Point, Point> conv;\\n for(int i=0; i<n; i++){\\n Point univec = unit(v[i]);\\n if(conv.count(univec) == 0){\\n conv[univec] = v[i];\\n }else{\\n conv[univec] = min(conv[univec], v[i]);\\n }\\n }\\n\\n vector<Point> uni;\\n for(pair<Point, Point> pp: conv){\\n uni.push_back(pp.first);\\n }\\n pair<double, pair<Point, Point> > ret = closest(uni, 0, uni.size(), conv);\\n Point &a = ret.second.first;\\n Point &b = ret.second.second;\\n cout << fixed << setprecision(0);\\n cout << a.x << \\\" \\\" << a.y << \\\" \\\" << a.z << \\\" \\\";\\n cout << b.x << \\\" \\\" << b.y << \\\" \\\" << b.z << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1750,\n \"memory_kb\": 19516,\n \"score_of_the_acc\": -0.4247,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1340_3060374\",\n \"code_snippet\": \"// AOJ 1340: Directional Resemblence\\n#include <cmath>\\n#include <cstdio>\\n#include <algorithm>\\nusing namespace std;\\nint n, m, S, W, px[120009], py[120009], pz[120009], p[120009]; long double x[120009], y[120009], z[120009];\\nint main() {\\n\\twhile(scanf(\\\"%d %d %d %d\\\", &n, &m, &S, &W), n + m != 0) {\\n\\t\\tfor(int i = 0; i < n; ++i) {\\n\\t\\t\\tscanf(\\\"%d %d %d\\\", &px[i], &py[i], &pz[i]);\\n\\t\\t}\\n\\t\\tfor(int i = n; i < n + m; ++i) {\\n\\t\\t\\tpx[i] = S / 7 % 100 + 1;\\n\\t\\t\\tpy[i] = S / 700 % 100 + 1;\\n\\t\\t\\tpz[i] = S / 70000 % 100 + 1;\\n\\t\\t\\tif(S & 1) S = (S >> 1) ^ W;\\n\\t\\t\\telse S >>= 1;\\n\\t\\t}\\n\\t\\tn += m;\\n\\t\\tfor(int i = 0; i < n; ++i) {\\n\\t\\t\\tlong double d = sqrt((long double)(px[i] * px[i] + py[i] * py[i] + pz[i] * pz[i]));\\n\\t\\t\\tx[i] = px[i] / d;\\n\\t\\t\\ty[i] = py[i] / d;\\n\\t\\t\\tz[i] = pz[i] / d;\\n\\t\\t\\tp[i] = i;\\n\\t\\t}\\n\\t\\tsort(p, p + n, [](int i, int j) {\\n\\t\\t\\tif(abs(x[i] - x[j]) > 1.0e-12L) return x[i] < x[j];\\n\\t\\t\\tif(abs(y[i] - y[j]) > 1.0e-12L) return y[i] < y[j];\\n\\t\\t\\tif(abs(z[i] - z[j]) > 1.0e-12L) return z[i] < z[j];\\n\\t\\t\\tif(px[i] != px[j]) return px[i] < px[j];\\n\\t\\t\\tif(py[i] != py[j]) return py[i] < py[j];\\n\\t\\t\\treturn pz[i] < pz[j];\\n\\t\\t});\\n\\t\\tlong double ans = 1.0e+9;\\n\\t\\tint pa = -1, pb = -1, r = 0;\\n\\t\\tfor(int i = 0; i < n; ++i) {\\n\\t\\t\\twhile(r != n && abs(x[p[i]] - x[p[r]]) < 1.0e-12L && abs(y[p[i]] - y[p[r]]) < 1.0e-12L && abs(z[p[i]] - z[p[r]]) < 1.0e-12) ++r;\\n\\t\\t\\tfor(int j = r; j < n && (x[p[j]] - x[p[i]]) * (x[p[j]] - x[p[i]]) < ans - 1.0e-12L; ++j) {\\n\\t\\t\\t\\tlong double d = (x[p[i]] - x[p[j]]) * (x[p[i]] - x[p[j]]) + (y[p[i]] - y[p[j]]) * (y[p[i]] - y[p[j]]) + (z[p[i]] - z[p[j]]) * (z[p[i]] - z[p[j]]);\\n\\t\\t\\t\\tif(d < ans - 1.0e-16L) {\\n\\t\\t\\t\\t\\tans = d;\\n\\t\\t\\t\\t\\tpa = p[i];\\n\\t\\t\\t\\t\\tpb = p[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ax = px[pa], ay = py[pa], az = pz[pa], bx = px[pb], by = py[pb], bz = pz[pb];\\n\\t\\tif(ax > bx || (ax == bx && (ay > by || (ay == by && az > bz)))) {\\n\\t\\t\\tswap(ax, bx);\\n\\t\\t\\tswap(ay, by);\\n\\t\\t\\tswap(az, bz);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d %d %d %d %d %d\\\\n\\\", ax, ay, az, bx, by, bz);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 9028,\n \"score_of_the_acc\": -0.0708,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1340_2740822\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define all(a) a.begin(),a.end()\\n\\nconst double EPS=1E-15;\\nconstexpr int gcd(int a,int b){return b?gcd(b,a%b):a;}\\n\\nstruct v{\\n\\tint x,y,z,g;\\n\\tdouble L2,nx,ny,nz;\\n\\tbool operator==(const v&r)const{return this->x==r.x and this->y==r.y and this->z==r.z and this->g==r.g;};\\n\\tvoid setData(){\\n\\t g=gcd(x,gcd(y,z));\\n L2=sqrt(x*x+y*y+z*z)/g;\\n nx=x/g/L2;\\n ny=y/g/L2;\\n nz=z/g/L2;\\n\\t}\\n\\tfriend ostream& operator<<(ostream&os,const v&p);\\n};\\n\\nbool operator<(const v&l,const v&r){return l.nx<r.nx or (l.nx==r.nx and (l.ny<r.ny or (l.ny==r.ny and l.nz<r.nz)));};\\nostream& operator<<(ostream&os, const v&p){os<<p.x<<\\\" \\\"<<p.y<<\\\" \\\"<<p.z; return os;};\\n\\nv makeData(int X, int Y, int Z){\\n\\tv ret;\\n\\tret.x=X, ret.y=Y, ret.z=Z;\\n\\tret.setData();\\n\\treturn ret;\\n}\\n\\nbool same(v a,v b){\\n return a.x/a.g==b.x/b.g and a.y/a.g==b.y/b.g and a.z/a.g==b.z/b.g;\\n}\\n\\nbool cmp(v a,v b){\\n\\treturn a.x<b.x or (b.x==a.x and (a.y<b.y or (b.y==a.y and a.z<b.z)));\\n}\\n\\ndouble dist(v a, v b){\\n if(same(a,b)) return 10000; \\n return sqrt((b.nx-a.nx)*(b.nx-a.nx) + (b.ny-a.ny)*(b.ny-a.ny) + (b.nz-a.nz)*(b.nz-a.nz));\\n}\\n\\n\\nusing data=pair<double,pair<v,v>>;\\ndata closest_pair(vector<v> vec){\\n if(vec.size()<=1) return {10000,{v(),v()}};\\n if(vec.size()==2){\\n\\t\\tif(cmp(vec[1],vec[0])){\\n\\t\\t\\t//cout<<\\\"Ret (2) :\\\"<<vec[1]<<\\\" \\\"<<vec[0]<<\\\" = \\\"<<dist(vec[0],vec[1])<<endl;\\n\\t\\t\\treturn {dist(vec[0],vec[1]),{vec[1],vec[0]}};\\n\\t\\t}else{\\n\\t\\t\\t//cout<<\\\"Ret (2) :\\\"<<vec[0]<<\\\" \\\"<<vec[1]<<\\\" = \\\"<<dist(vec[0],vec[1])<<endl;\\n\\t\\t\\treturn {dist(vec[0],vec[1]),{vec[0],vec[1]}};\\n\\t\\t}\\n\\t}\\n vector<v> vs1,vs2,vs3;\\n int index=vec.size()/2;\\n double sep=vec[index].nx;\\n copy(vec.begin(), vec.begin()+index, back_inserter(vs1));\\n copy(vec.begin()+index, vec.end(), back_inserter(vs2));\\n \\n\\tdata s1=closest_pair(vs1), s2=closest_pair(vs2), minDist;\\n\\tif(fabs(s1.first-s2.first)>EPS){\\n\\t\\tminDist=min(s1,s2);\\n\\t}else{\\n\\t\\tif(cmp(s1.second.first,s2.second.first) or (s1.second.first==s2.second.first and cmp(s1.second.second,s2.second.second))){\\n\\t\\t\\tminDist=s1;\\n\\t\\t}else{\\n\\t\\t\\tminDist=s2;\\n\\t\\t}\\n\\t}\\n \\n sort(all(vec),[](v a,v b){return a.ny<b.ny;});\\n \\n for(auto d:vec){\\n if(fabs(d.nx-sep)>=minDist.first) continue;\\n for(int i=vs3.size()-1;i>=0;i--){\\n double dst=dist(vs3[i],d);\\n\\t\\t\\t//if(dst>minDist.first)break;\\n\\t\\t\\tv n1=vs3[i],n2=d;\\n\\t\\t\\tif(cmp(n2,n1))swap(n1,n2);\\n\\t\\t\\tif(fabs(minDist.first-dst)<EPS){\\n\\t\\t\\t\\tif(cmp(n1,minDist.second.first) or (n1==minDist.second.first and cmp(n2,minDist.second.second))){\\n\\t\\t\\t\\t\\t//cout<<\\\" \\\"<<n1<<\\\" \\\"<<n2<<endl;\\n\\t\\t\\t\\t\\tminDist={dst,{n1,n2}};\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else if(dst<minDist.first){\\n\\t\\t\\t\\t//cout<<\\\" \\\"<<n1<<\\\" \\\"<<n2<<endl;\\n minDist={dst,{n1,n2}};\\n }\\n }\\n vs3.push_back(d);\\n }\\n\\t//cout<<\\\"Ret (\\\"<<vec.size()<<\\\") :\\\"<<minDist.second.first<<\\\" \\\"<<minDist.second.second<<\\\" = \\\"<<minDist.first<<endl;\\n return minDist;\\n \\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t\\n\\tint m,n,s,w;\\n\\twhile(cin>>m>>n>>s>>w, m or n){\\n\\t\\tvector<v> vec;\\n\\t\\trep(i,m){\\n\\t\\t\\tint x,y,z;\\n\\t\\t\\tcin>>x>>y>>z;\\n\\t\\t\\tvec.push_back(makeData(x,y,z));\\n\\t\\t}\\n\\t\\tint g=s;\\n\\t\\trep(i,n) {\\n\\t\\t\\tvec.push_back(makeData((g/7)%100+1, (g/700)%100+1, (g/70000)%100+1));\\n\\t\\t\\tif(g%2==0)g/=2;\\n\\t\\t\\telse g=(g/2) xor w;\\n\\t\\t}\\n\\t sort(all(vec),[](v a,v b){return a.nx<b.nx;});\\n\\t\\tvec.erase(unique(all(vec),same),vec.end());\\n\\t\\t//for(auto d:vec)cout<<d<<\\\"(\\\"<<d.nx<<\\\")\\\"<<endl;\\n\\t\\t//cout<<\\\"====\\\"<<endl;\\n\\t data ans=closest_pair(vec);\\n\\t v a1=ans.second.first;\\n\\t v a2=ans.second.second;\\n\\t if(cmp(a2,a1)) swap(a1,a2);\\n\\t cout<<a1<<\\\" \\\"<<a2<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3860,\n \"memory_kb\": 25824,\n \"score_of_the_acc\": -0.8074,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1340_2643757\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ld = long double;\\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\\n#define all(v) v.begin(),v.end()\\nconst ld EPS = 1e-8;\\nbool eq(ld a, ld b) { return abs(a - b) < EPS; }\\n\\ntemplate<class T>\\nstruct Point {\\n T x, y, z;\\n bool operator < (const Point<T> &r) const { return make_tuple(x, y, z) < make_tuple(r.x, r.y, r.z); }\\n};\\n\\ntemplate<class T>\\nld length(const Point<T> &p) {\\n return sqrtl(p.x * p.x + p.y * p.y + p.z * p.z);\\n}\\ntemplate<class T>\\nld dot(const Point<T> &a, const Point<T> &b) {\\n return a.x * b.x + a.y * b.y + a.z * b.z;\\n}\\ntemplate<class T>\\nld angle(const Point<T> &a, const Point<T> &b) {\\n return acosl(dot(a, b) / length(a) / length(b));\\n}\\ntemplate<class T>\\nPoint<ld> unit(Point<T> a) {\\n Point<ld> p = {(ld)a.x, (ld)a.y, (ld)a.z};\\n ld l = length(p);\\n p.x /= l;\\n p.y /= l;\\n p.z /= l;\\n return p;\\n}\\n\\nbool solve() {\\n using PI = Point<int>;\\n int m, n, S, W; cin >> m >> n >> S >> W;\\n if(m == 0 and n == 0 and S == 0 and W == 0) return false;\\n vector<PI> V(m + n);\\n rep(i, m) cin >> V[i].x >> V[i].y >> V[i].z;\\n { // generate\\n int g = S;\\n for(int i=m; i<m+n; i++) {\\n V[i].x = (g/7) %100 + 1;\\n V[i].y = (g/700) %100 + 1;\\n V[i].z = (g/70000)%100 + 1;\\n if( g%2 == 0 ) { g = (g/2); }\\n else { g = (g/2) ^ W; }\\n }\\n }\\n sort(all(V), [&] (PI a, PI b) { return unit(a).x > unit(b).x; });\\n \\n ld min_angle = 1e9; \\n PI a, b;\\n\\n auto need_check = [&] (PI &a, PI &b) {\\n ld alpha = acosl(unit(a).x);\\n return cosl(alpha + min_angle) < unit(b).x + EPS;\\n };\\n \\n queue<PI> que;\\n rep(i, V.size()) {\\n queue<PI> nxt_que;\\n while(que.size()) {\\n auto p = que.front(); que.pop();\\n if(not need_check(p, V[i])) continue;\\n ld ang = angle(V[i], p);\\n if(ang > EPS) {\\n if(min_angle + EPS > ang) { \\n auto va = V[i], vb = p;\\n if(vb < va) swap(va, vb);\\n if(!eq(min_angle, ang) or make_pair(a, b) > make_pair(va, vb)) {\\n a = va;\\n b = vb;\\n }\\n min_angle = ang;\\n }\\n }\\n nxt_que.push(p);\\n }\\n nxt_que.push(V[i]);\\n swap(que, nxt_que);\\n }\\n printf(\\\"%d %d %d %d %d %d\\\\n\\\", a.x, a.y, a.z, b.x, b.y, b.z);\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5290,\n \"memory_kb\": 4748,\n \"score_of_the_acc\": -0.6641,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1340_2643742\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing pii = pair<int,int>;\\nusing ll = long long;\\nusing ld = long double;\\n#define rep(i, j) for(int i=0; i < (int)(j); i++)\\n#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)\\n#define all(v) v.begin(),v.end()\\n#define debug(x) cerr << #x << \\\" : \\\" << x << endl\\n\\ntemplate<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; }\\ntemplate<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; }\\n// vector\\ntemplate<class T> istream&\\noperator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }\\ntemplate<class T> ostream&\\noperator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << \\\"\\\\t\\\" << t; return os << endl; }\\n// pair\\ntemplate<class T, class U> ostream&\\noperator << (ostream &os , const pair<T, U> &v) { return os << \\\"<\\\" << v.first << \\\", \\\" << v.second << \\\">\\\"; }\\n\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 60;\\nconst ld EPS = 1e-9;\\nbool eq(ld a, ld b) { return abs(a - b) < EPS; }\\ntemplate<class T>\\nstruct Point {\\n T x, y, z;\\n bool operator < (const Point<T> &r) const {\\n return make_tuple(x, y, z) < make_tuple(r.x, r.y, r.z);\\n }\\n};\\ntemplate<class T>\\nld length(const Point<T> &p) { return sqrtl(p.x * p.x + p.y * p.y + p.z * p.z); }\\ntemplate<class T>\\nld dot(const Point<T> &a, const Point<T> &b) { return a.x * b.x + a.y * b.y + a.z * b.z; }\\ntemplate<class T>\\nld angle(const Point<T> &a, const Point<T> &b) {\\n return acosl(dot(a, b) / length(a) / length(b));\\n}\\ntemplate<class T>\\nPoint<ld> unit(Point<T> a) {\\n Point<ld> p = {(ld)a.x, (ld)a.y, (ld)a.z};\\n ld l = length(p);\\n p.x /= l;\\n p.y /= l;\\n p.z /= l;\\n return p;\\n}\\n\\nbool solve() {\\n int m, n, S, W; cin >> m >> n >> S >> W;\\n if(m == 0 and n == 0 and S == 0 and W == 0) return false;\\n vector<Point<int>> VI(m + n);\\n rep(i, m) {\\n cin >> VI[i].x >> VI[i].y >> VI[i].z;\\n }\\n int g = S;\\n for(int i=m; i<m+n; i++) {\\n VI[i].x = (g/7) %100 + 1;\\n VI[i].y = (g/700) %100 + 1;\\n VI[i].z = (g/70000)%100 + 1;\\n if( g%2 == 0 ) { g = (g/2); }\\n else { g = (g/2) ^ W; }\\n }\\n sort(all(VI), [&] (Point<int> a, Point<int> b) {\\n return unit(a).x > unit(b).x;\\n });\\n ld min_angle = 1e9; \\n Point<int> a, b;\\n\\n auto need_check = [&] (Point<int> &a, Point<int> &b) {\\n ld alpha = acosl(unit(a).x);\\n auto ss = cosl(alpha + min_angle);\\n auto tt = unit(b).x;\\n // cerr << ss << \\\" \\\" << tt << endl;\\n return ss < tt + EPS*10;\\n };\\n \\n queue<Point<int>> que;\\n rep(i, VI.size()) {\\n queue<Point<int>> nxt_que;\\n while(que.size()) {\\n auto p = que.front(); que.pop();\\n if(not need_check(p, VI[i])) continue;\\n ld ang = angle(VI[i], p);\\n if(ang > EPS) {\\n if(min_angle + EPS > ang) { \\n auto aa = VI[i], bb = p;\\n if(bb < aa) swap(aa, bb);\\n if(!eq(min_angle, ang) or make_pair(a, b) > make_pair(aa, bb)) {\\n a = aa;\\n b = bb;\\n }\\n min_angle = ang;\\n }\\n }\\n nxt_que.push(p);\\n }\\n nxt_que.push(VI[i]);\\n swap(que, nxt_que);\\n }\\n printf(\\\"%d %d %d %d %d %d\\\\n\\\",\\n a.x, a.y, a.z,\\n b.x, b.y, b.z);\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5310,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.664,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1340_2047412\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tshared_ptr<kdtree<T>> ltree, rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\tvoid getmindis() {\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t}\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tltree.reset();\\n\\t\\trtree.reset();\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto&&a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6290,\n \"memory_kb\": 26912,\n \"score_of_the_acc\": -1.1499,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1340_2047410\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tshared_ptr<kdtree<T>> ltree, rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\tvoid getmindis() {\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t}\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tltree.reset();\\n\\t\\trtree.reset();\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto&&a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6530,\n \"memory_kb\": 26840,\n \"score_of_the_acc\": -1.1809,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1340_2047406\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tshared_ptr<kdtree<T>> ltree, rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\tvoid getmindis() {\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 10) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 10) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t}\\n\\n\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tltree.reset();\\n\\t\\trtree.reset();\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6300,\n \"memory_kb\": 26912,\n \"score_of_the_acc\": -1.1513,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1340_2047403\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tshared_ptr<kdtree<T>> ltree, rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(), rtree() {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\tvoid getmindis() {\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tif (p.first == 1524 && 2763 == p.second) {\\n\\t\\t\\t\\tint a = 1; a++;\\n\\t\\t\\t}\\n\\t\\t\\t//if (p.first == 2763 && 1524 == p.second)assert(false);\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\tint b;\\n\\t\\t\\tb = 1; b++;\\n\\t\\t}\\n\\n\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tltree.reset();\\n\\t\\trtree.reset();\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nunique_ptr<kdtree<T>>make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn make_unique<kdtree<T>>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n//1524,2763\",\n \"accuracy\": 1,\n \"time_ms\": 6840,\n \"memory_kb\": 26992,\n \"score_of_the_acc\": -1.2248,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1340_2047023\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tkdtree<T> *ltree, *rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(nullptr), rtree(nullptr) {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tdelete(ltree);\\n\\t\\t\\tltree = nullptr;\\n\\t\\t}\\n\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tdelete(rtree);\\n\\t\\t\\trtree = nullptr;\\n\\t\\t}\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\t/*vector<T>query(const T & amin, const T&amax) {\\n\\tvector<T>ans;\\n\\tbool aok = true;\\n\\tfor (int i = 0; i < Dim; ++i) {\\n\\tif (amin.coors[i] <= midpo.coors[i] && midpo.coors[i] <= amax.coors[i]) {\\n\\n\\t}\\n\\telse {\\n\\taok = false;\\n\\tbreak;\\n\\t}\\n\\t}\\n\\tif (aok) {\\n\\tans.emplace_back(val);\\n\\t}\\n\\taxisSorter<T> as(axis);\\n\\tif (as(midpo, amax) || midpo.coors[axis] == amax.coors[axis]) {\\n\\tif (rtree != nullptr) {\\n\\tvector<T>tans(rtree->query(amin, amax));\\n\\tans.insert(ans.end(), tans.begin(), tans.end());\\n\\t}\\n\\t}\\n\\tif (as(amin, midpo) || midpo.coors[axis] == amin.coors[axis]) {\\n\\tif (ltree != nullptr) {\\n\\tvector<T>tans(ltree->query(amin, amax));\\n\\tans.insert(ans.end(), tans.begin(), tans.end());\\n\\t}\\n\\t}\\n\\treturn ans;\\n\\t}*/\\n\\tvoid getmindis() {\\n\\t\\t/*if (ltree != nullptr) {\\n\\t\\tauto p =ltree->getmindis();\\n\\t\\tif (ansnum > p.second) {\\n\\t\\tansnum = p.second;\\n\\t\\tansp = p.first;\\n\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\tauto p = rtree->getmindis();\\n\\t\\tif (ansnum > p.second) {\\n\\t\\tansnum = p.second;\\n\\t\\tansp = p.first;\\n\\t\\t}\\n\\t\\t}*/\\n\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tif (p.first == 1524 && 2763 == p.second) {\\n\\t\\t\\t\\tint a = 1; a++;\\n\\t\\t\\t}\\n\\t\\t\\t//if (p.first == 2763 && 1524 == p.second)assert(false);\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\tint b;\\n\\t\\t\\tb = 1; b++;\\n\\t\\t}\\n\\n\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tnth_element(ps.begin() + l, ps.begin() + mid, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tif (ltree) {\\n\\t\\t\\tdelete(ltree);\\n\\t\\t\\tltree = nullptr;\\n\\t\\t}\\n\\t\\tif (rtree) {\\n\\t\\t\\tdelete(rtree);\\n\\t\\t\\trtree = nullptr;\\n\\t\\t}\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nkdtree<T> *make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn new kdtree<T>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t\\tdelete(tree);\\n\\t}\\n\\treturn 0;\\n}\\n//1524,2763\",\n \"accuracy\": 1,\n \"time_ms\": 6990,\n \"memory_kb\": 26888,\n \"score_of_the_acc\": -1.2433,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1340_2046975\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\nld getdis(vector<ld>&l, vector<ld>&r) {\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tsum += (l[i] - r[i])*(l[i] - r[i]);\\n\\t}\\n\\treturn sqrt(sum);\\n}\\n\\nstruct po {\\n\\tint index;\\n\\tvector<ld> coors;\\n\\tpo(int _d) :coors(_d) {\\n\\t\\tindex = -1;\\n\\t}\\n\\tpo(int _index, vector<ld>_coors) :index(_index), coors(_coors) {\\n\\n\\t}\\n\\tpo() {}\\n};\\nld getdis(po&lpo, po&rpo) {\\n\\treturn getdis(lpo.coors, rpo.coors);\\n}\\ntemplate<class T>\\nclass axisSorter {\\n\\tint k;\\npublic:\\n\\taxisSorter(int _k) : k(_k) {}\\n\\tbool operator()(const T &a, const T &b) {\\n\\t\\treturn a.coors[k] < b.coors[k];\\n\\t}\\n};\\n\\n\\n\\nstruct Ans {\\n\\tld dis;\\n\\tpair<int, int>p;\\n\\n};\\n\\n\\nbool operator<(const Ans&l, const Ans&r) {\\n\\tif (abs(l.dis - r.dis) < eps) {\\n\\t\\tassert(l.p.first < l.p.second);\\n\\t\\tassert(r.p.first < r.p.second);\\n\\t\\treturn l.p < r.p;\\n\\t}\\n\\telse {\\n\\t\\treturn l.dis < r.dis;\\n\\t}\\n\\treturn true;\\n}\\nAns answer;\\n\\ntemplate<class T, int Dim = 3>\\nstruct kdtree {\\npublic:\\n\\tT midpo;\\n\\tvector<T>pos;\\n\\tkdtree<T> *ltree, *rtree;\\n\\tint depth;\\n\\tint axis;\\n\\tkdtree(const T &p_) :midpo(p_), ltree(nullptr), rtree(nullptr) {\\n\\n\\t}\\n\\t~kdtree() {\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tdelete(ltree);\\n\\t\\t\\tltree = nullptr;\\n\\t\\t}\\n\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tdelete(rtree);\\n\\t\\t\\trtree = nullptr;\\n\\t\\t}\\n\\t}\\n\\n\\tkdtree(vector<T>&ps_, const int& l, const int& r, const int depth_ = 0) : ltree(nullptr), rtree(nullptr), depth(depth_), axis(depth%Dim) {\\n\\t\\tinit(ps_, l, r);\\n\\t}\\n\\t/*vector<T>query(const T & amin, const T&amax) {\\n\\tvector<T>ans;\\n\\tbool aok = true;\\n\\tfor (int i = 0; i < Dim; ++i) {\\n\\tif (amin.coors[i] <= midpo.coors[i] && midpo.coors[i] <= amax.coors[i]) {\\n\\n\\t}\\n\\telse {\\n\\taok = false;\\n\\tbreak;\\n\\t}\\n\\t}\\n\\tif (aok) {\\n\\tans.emplace_back(val);\\n\\t}\\n\\taxisSorter<T> as(axis);\\n\\tif (as(midpo, amax) || midpo.coors[axis] == amax.coors[axis]) {\\n\\tif (rtree != nullptr) {\\n\\tvector<T>tans(rtree->query(amin, amax));\\n\\tans.insert(ans.end(), tans.begin(), tans.end());\\n\\t}\\n\\t}\\n\\tif (as(amin, midpo) || midpo.coors[axis] == amin.coors[axis]) {\\n\\tif (ltree != nullptr) {\\n\\tvector<T>tans(ltree->query(amin, amax));\\n\\tans.insert(ans.end(), tans.begin(), tans.end());\\n\\t}\\n\\t}\\n\\treturn ans;\\n\\t}*/\\n\\tvoid getmindis() {\\n\\t\\t/*if (ltree != nullptr) {\\n\\t\\tauto p =ltree->getmindis();\\n\\t\\tif (ansnum > p.second) {\\n\\t\\tansnum = p.second;\\n\\t\\tansp = p.first;\\n\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\tauto p = rtree->getmindis();\\n\\t\\tif (ansnum > p.second) {\\n\\t\\tansnum = p.second;\\n\\t\\tansp = p.first;\\n\\t\\t}\\n\\t\\t}*/\\n\\n\\t\\tvector<po>lpos, rpos;\\n\\t\\tld axisvalue = midpo.coors[axis];\\n\\n\\t\\tif (ltree != nullptr) {\\n\\t\\t\\tfor (auto &po : ltree->pos) {\\n\\t\\t\\t\\tif (axisvalue>po.coors[axis] - eps * 1000000 && po.coors[axis]>axisvalue - sqrt(answer.dis) - eps * 1000000) {\\n\\t\\t\\t\\t\\tlpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rtree != nullptr) {\\n\\t\\t\\tfor (auto &po : rtree->pos) {\\n\\t\\t\\t\\tif (axisvalue<po.coors[axis] + eps * 1000000 && po.coors[axis]<axisvalue + sqrt(answer.dis) + eps * 1000000) {\\n\\t\\t\\t\\t\\trpos.emplace_back(po);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (auto& lpo : lpos) {\\n\\t\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\t\\tld dis = getdis(lpo, rpo);\\n\\t\\t\\t\\tpair<int, int> p(rpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tld dis = getdis(lpo, midpo);\\n\\t\\t\\t\\tpair<int, int> p(midpo.index, lpo.index);\\n\\t\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto& rpo : rpos) {\\n\\t\\t\\tld dis = getdis(midpo, rpo);\\n\\t\\t\\tpair<int, int> p(midpo.index, rpo.index);\\n\\t\\t\\tif (p.first > p.second)swap(p.first, p.second);\\n\\t\\t\\tAns nans{ dis,p };\\n\\t\\t\\tif (p.first == 1524 && 2763 == p.second) {\\n\\t\\t\\t\\tint a = 1; a++;\\n\\t\\t\\t}\\n\\t\\t\\t//if (p.first == 2763 && 1524 == p.second)assert(false);\\n\\t\\t\\tanswer = min(answer, nans);\\n\\t\\t\\tint b;\\n\\t\\t\\tb = 1; b++;\\n\\t\\t}\\n\\n\\n\\t}\\nprivate:\\n\\tvoid init(vector<T>&ps, const int& l, const int& r) {\\n\\t\\tif (l >= r) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tsort(ps.begin() + l, ps.begin() + r, axisSorter<T>(axis));\\n\\t\\tconst int mid = (l + r) / 2;\\n\\t\\tmidpo = ps[mid];\\n\\n\\t\\tltree = make_kdtree(ps, l, mid, depth + 1);\\n\\t\\t\\n\\t\\trtree = make_kdtree(ps, mid + 1, r, depth + 1);\\n\\t\\tgetmindis();\\n\\t\\tif (ltree) {\\n\\t\\t\\tdelete(ltree);\\n\\t\\t\\tltree = nullptr;\\n\\t\\t}\\n\\t\\tif (rtree) {\\n\\t\\t\\tdelete(rtree);\\n\\t\\t\\trtree = nullptr;\\n\\t\\t}\\n\\t\\tpos = vector<T>(ps.begin() + l, ps.begin() + r);\\n\\t}\\n};\\n\\n\\n//[l..r)\\ntemplate<class T>\\nkdtree<T> *make_kdtree(vector<T>&ps_, const int& l, const int& r, const int& depth = 0) {\\n\\tif (l >= r)return nullptr;\\n\\telse {\\n\\t\\treturn new kdtree<T>(ps_, l, r, depth);\\n\\t}\\n}\\n\\nvector<ld>getunit(vector<int>v) {\\n\\tvector<ld>unit;\\n\\tld len = 0;\\n\\tfor (auto a : v) {\\n\\t\\tlen += a*a;\\n\\t\\tunit.emplace_back(ld(a));\\n\\t}\\n\\tlen = sqrt(len);\\n\\tfor (auto&u : unit) {\\n\\t\\tu /= len;\\n\\t}\\n\\treturn unit;\\n}\\nint gcd(int l, int r) {\\n\\tassert(l > 0 && r > 0);\\n\\tif (l > r)return gcd(r, l);\\n\\telse {\\n\\t\\tconst int num = r%l;\\n\\t\\tif (num) {\\n\\t\\t\\treturn gcd(l, num);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn l;\\n\\t\\t}\\n\\t}\\n}\\nint gcd(vector<int>nums) {\\n\\tif (nums.size() == 1)return nums[0];\\n\\tint num = nums[0];\\n\\n\\tfor (int i = 1; i < nums.size(); ++i) {\\n\\t\\tnum = gcd(num, nums[i]);\\n\\t}\\n\\treturn num;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tanswer = Ans{ 1e18,make_pair(-1,-1) };\\n\\t\\tint M, N, S, W; cin >> M >> N >> S >> W;\\n\\t\\tif (!M&&!N&&!S&&!W)break;\\n\\t\\tvector<po>pos;\\n\\t\\tvector<vector<int>>memo;\\n\\t\\t{\\n\\t\\t\\t{\\n\\t\\t\\t\\tint nx, ny, nz;\\n\\t\\t\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\t\\t\\tcin >> nx >> ny >> nz;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint g = S;\\n\\t\\t\\t\\tfor (int i = M; i < M + N; ++i) {\\n\\t\\t\\t\\t\\tnx = (g / 7) % 100 + 1;\\n\\t\\t\\t\\t\\tny = (g / 700) % 100 + 1;\\n\\t\\t\\t\\t\\tnz = (g / 70000) % 100 + 1;\\n\\t\\t\\t\\t\\tmemo.push_back(vector<int>{nx, ny, nz});\\n\\t\\t\\t\\t\\tif (g % 2 == 0)g = g / 2;\\n\\t\\t\\t\\t\\telse g = (g / 2) ^ W;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<vector<int>>newmemo;\\n\\t\\t\\t\\tmap<vector<int>, int>amap;\\n\\t\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\t\\tint agcd = gcd(memo[i]);\\n\\t\\t\\t\\t\\tvector<int>v(3);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < 3; ++j)v[j] = memo[i][j] / agcd;\\n\\t\\t\\t\\t\\tif (amap.find(v) == amap.end() || amap[v] > agcd) {\\n\\t\\t\\t\\t\\t\\tamap[v] = agcd;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (auto m : amap) {\\n\\t\\t\\t\\t\\tauto v = m.first;\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\t\\tv[i] *= m.second;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tnewmemo.emplace_back(v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmemo = newmemo;\\n\\t\\t\\t}\\n\\t\\t\\tsort(memo.begin(), memo.end(), [](const vector<int>&l, const vector<int>&r) {\\n\\t\\t\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\t\\t\\tif (l[i] == r[i])continue;\\n\\t\\t\\t\\t\\telse return l[i] < r[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t});\\n\\t\\t\\tfor (int i = 0; i < memo.size(); ++i) {\\n\\t\\t\\t\\tpo p(i, getunit(memo[i]));\\n\\t\\t\\t\\tpos.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto tree = make_kdtree(pos, 0, pos.size(), 0);\\n\\t\\ttree->getmindis();\\n\\t\\tauto ansp = answer;\\n\\t\\tif (ansp.p.first >ansp.p.second)swap(ansp.p.first, ansp.p.second);\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.first][i] << \\\" \\\";\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\t\\tcout << memo[answer.p.second][i];\\n\\t\\t\\tif (i == 2)cout << endl;\\n\\t\\t\\telse cout << \\\" \\\";\\n\\t\\t}\\n\\t\\tdelete(tree);\\n\\t}\\n\\treturn 0;\\n}\\n//1524,2763\",\n \"accuracy\": 1,\n \"time_ms\": 7820,\n \"memory_kb\": 26876,\n \"score_of_the_acc\": -1.3542,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1340_1569119\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace ClosestPair{\\n\\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()?????´\\n\\tconst double EPS = 1e-9;\\n\\tconst int DIM = 3;\\n\\ttypedef array<double,DIM> P;\\n\\n\\tdouble dist(const P &p1,const P &p2){\\n\\t\\tdouble ans = 0;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++)\\n\\t\\t\\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\\n\\t\\treturn sqrt(ans);\\n\\t}\\n\\ttypedef array<int,DIM> Block;\\n\\ttypedef unordered_map<unsigned long long,vector<int>> Bucket;\\n\\tBlock getBlock(const P &p,double w){\\n\\t\\tBlock res;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\\n\\t\\treturn res;\\n\\t}\\n\\tunsigned long long toHash(const Block &bl){\\n\\t\\tunsigned long long h = 0;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++){\\n\\t\\t\\th = h * 100000007 + bl[i];\\n\\t\\t}\\n\\t\\treturn h;\\n\\t}\\n\\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\\n\\t\\tvector<int> res;\\n\\t\\tauto key = getBlock(p,w);\\n\\t\\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\\n\\t\\t\\tfor(int x1 = -1 ; x1 <= 1 ; x1++){\\n\\t\\t\\t\\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\\n\\t\\t\\t\\t\\tauto it = b.find(toHash(Block{key[0]+x0,key[1]+x1,key[2]+x2}));\\n\\t\\t\\t\\t\\tif( it != b.end() ){\\n\\t\\t\\t\\t\\t\\tfor( int id : it->second ) res.push_back(id);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\\n\\tBucket makeBucket(const vector<P> &ps,double w){\\n\\t\\tBucket b;\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++)\\n\\t\\t\\tb[toHash(getBlock(ps[i],w))].push_back(i);\\n\\t\\treturn b;\\n\\t}\\n\\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\\n\\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\\\??????????\\n\\tdouble closetPairDistance(vector<P> ps){\\n\\t\\tassert(ps.size()>=2);\\n\\t\\trandom_shuffle(ps.begin(),ps.end());\\n\\t\\tdouble w = dist(ps[0],ps[1]);\\n\\t\\tvector<P> build = {ps[0],ps[1]};\\n\\t\\tauto b = makeBucket(build,w);\\n\\t\\tint a = 0;\\n\\t\\tfor(int i = 2 ; i < ps.size() ; i++){\\n\\t\\t\\tdouble next_w = w;\\n\\t\\t\\tfor( int j : getNearPoints(b,w,ps[i]) )\\n\\t\\t\\t\\tnext_w = min(next_w,dist(ps[i],ps[j]));\\n\\t\\t\\tbuild.push_back(ps[i]);\\n\\t\\t\\tif( w - EPS > next_w ){\\n\\t\\t\\t\\tw = next_w;\\n\\t\\t\\t\\tb = makeBucket(build,w);\\n\\t\\t\\t\\ta++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tb[toHash(getBlock(ps[i],w))].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn w;\\n\\t}\\n};\\nusing namespace ClosestPair;\\n\\n\\nstruct Pt{\\n\\tdouble x,y,z;\\n};\\nbool operator < (const Pt &a,const Pt &b){\\n\\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\\n\\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\\n\\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\\n\\treturn false;\\n}\\n\\ndouble X[150000];\\ndouble Y[150000];\\ndouble Z[150000];\\nint main(){\\n int m,n,S,W;\\n int tst = 1;\\n while( cin >> m >> n >> S >> W && m+n ){\\n map<Pt,vector<P>> dic;\\n for(int i = 0 ; i < m ; i++){\\n scanf(\\\"%lf%lf%lf\\\",X+i,Y+i,Z+i);\\n }\\n int g = S;\\n for(int i=m; i<m+n; i++) {\\n X[i] = (g/7) %100 + 1;\\n Y[i] = (g/700) %100 + 1;\\n Z[i] = (g/70000)%100 + 1;\\n if( g%2 == 0 ) { g = (g/2); }\\n else { g = (g/2) ^ W; }\\n }\\n for(int i = 0 ; i < m+n ; i++){\\n double x = X[i];\\n double y = Y[i];\\n double z = Z[i];\\n P p = {x,y,z};\\n double d = dist(P{0,0,0},p);\\n Pt e;\\n e.x = x / d;\\n e.y = y / d;\\n e.z = z / d;\\n dic[e].push_back(p);\\n }\\n vector<P> ps;\\n vector<P> cand;\\n for( auto &p : dic ){\\n ps.push_back(P{p.first.x,p.first.y,p.first.z});\\n \\n cand.push_back(*min_element(p.second.begin(),p.second.end()));\\n }\\n \\n double w = closetPairDistance(ps);\\n auto b = makeBucket(ps,w);\\n pair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\\n for(int i = 0 ; i < ps.size() ; i++){\\n for( auto j : getNearPoints(b,w,ps[i]) ){\\n if( i != j ){\\n if( fabs(dist(ps[i],ps[j])-w) < EPS ){\\n best = min(best,pair<P,P>{cand[i],cand[j]});\\n }\\n }\\n }\\n }\\n cout << (int)best.first[0] << \\\" \\\" << (int)best.first[1] << \\\" \\\" << (int)best.first[2] << \\\" \\\";\\n cout << (int)best.second[0] << \\\" \\\" << (int)best.second[1] << \\\" \\\" << (int)best.second[2] << \\\"\\\\n\\\";\\n }\\n \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4330,\n \"memory_kb\": 41448,\n \"score_of_the_acc\": -1.1184,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1340_1569104\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace ClosestPair{\\n\\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\\n\\tconst double EPS = 1e-9;\\n\\tconst int DIM = 3;\\n\\ttypedef array<double,DIM> P;\\n\\n\\tdouble dist(const P &p1,const P &p2){\\n\\t\\tdouble ans = 0;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++)\\n\\t\\t\\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\\n\\t\\treturn sqrt(ans);\\n\\t}\\n\\ttypedef array<int,DIM> Block;\\n\\ttypedef map<Block,vector<int>> Bucket;\\n\\tBlock getBlock(const P &p,double w){\\n\\t\\tBlock res;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\\n\\t\\treturn res;\\n\\t}\\n\\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\\n\\t\\tvector<int> res;\\n\\t\\tauto key = getBlock(p,w);\\n\\t\\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\\n\\t\\t\\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\\n\\t\\t\\t\\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\\n\\t\\t\\t\\t\\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\\n\\t\\t\\t\\t\\tif( it != b.end() ){\\n\\t\\t\\t\\t\\t\\tfor( int id : it->second ) res.push_back(id);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\\n\\tBucket makeBucket(const vector<P> &ps,double w){\\n\\t\\tBucket b;\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++)\\n\\t\\t\\tb[getBlock(ps[i],w)].push_back(i);\\n\\t\\treturn b;\\n\\t}\\n\\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\\n\\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\\\??????????\\n\\tdouble closetPairDistance(vector<P> ps){\\n\\t\\tdouble w = 1e9;\\n\\t\\tfor( auto &p : ps ){\\n\\t\\t\\ttie(p[0],p[1]) = make_pair(p[0]*cos(0)-p[1]*sin(0),p[0]*sin(0)+p[1]*cos(0));\\n\\t\\t}\\n\\t\\tsort(ps.begin(),ps.end());\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\t\\tfor(int j = i-1 ; j >= 0 ; j--){\\n\\t\\t\\t\\tif( ps[i][0]-ps[j][0] >= w ) break;\\n\\t\\t\\t\\tw = min(w,dist(ps[i],ps[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn w;\\n\\t}\\n};\\n\\nusing namespace ClosestPair;\\n\\n\\nstruct Pt{\\n\\tdouble x,y,z;\\n};\\nbool operator < (const Pt &a,const Pt &b){\\n\\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\\n\\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\\n\\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\\n\\treturn false;\\n}\\n\\ndouble X[150000];\\ndouble Y[150000];\\ndouble Z[150000];\\n\\nint main(){\\n\\tint m,n,S,W;\\n\\tint tst = 1;\\n\\twhile( cin >> m >> n >> S >> W && m+n ){\\n\\t\\tmap<Pt,vector<P>> dic;\\n\\t\\tfor(int i = 0 ; i < m ; i++){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",X+i,Y+i,Z+i);\\n\\t\\t}\\n\\t\\tint g = S;\\n\\t\\tfor(int i=m; i<m+n; i++) {\\n\\t\\t X[i] = (g/7) %100 + 1;\\n\\t\\t Y[i] = (g/700) %100 + 1;\\n\\t\\t Z[i] = (g/70000)%100 + 1;\\n\\t\\t if( g%2 == 0 ) { g = (g/2); }\\n\\t\\t else { g = (g/2) ^ W; }\\n\\t\\t}\\n\\t\\tfor(int i = 0 ; i < m+n ; i++){\\n\\t\\t\\tdouble x = X[i];\\n\\t\\t\\tdouble y = Y[i];\\n\\t\\t\\tdouble z = Z[i];\\n\\t\\t\\tP p = {x,y,z};\\n\\t\\t\\tdouble d = dist(P{0,0,0},p);\\n\\t\\t\\tPt e;\\n\\t\\t\\te.x = x / d;\\n\\t\\t\\te.y = y / d;\\n\\t\\t\\te.z = z / d;\\n\\t\\t\\tdic[e].push_back(p);\\n\\t\\t}\\n\\t\\tvector<P> ps;\\n\\t\\tvector<P> cand;\\n\\t\\tfor( auto &p : dic ){\\n\\t\\t\\tps.push_back(P{p.first.x,p.first.y,p.first.z});\\n\\t\\t\\t\\n\\t\\t\\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\\n\\t\\t}\\n\\t\\n\\t\\tdouble w = closetPairDistance(ps);\\n\\t\\tauto b = makeBucket(ps,2*w);\\n\\t\\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\t\\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\\n\\t\\t\\t\\tif( i != j ){\\n\\t\\t\\t\\t\\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\\n\\t\\t\\t\\t\\t\\tbest = min(best,pair<P,P>{cand[i],cand[j]});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << (int)best.first[0] << \\\" \\\" << (int)best.first[1] << \\\" \\\" << (int)best.first[2] << \\\" \\\";\\n\\t\\tcout << (int)best.second[0] << \\\" \\\" << (int)best.second[1] << \\\" \\\" << (int)best.second[2] << \\\"\\\\n\\\";\\n\\t}\\n\\t\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3580,\n \"memory_kb\": 31536,\n \"score_of_the_acc\": -0.8606,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1340_1569103\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace ClosestPair{\\n\\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\\n\\tconst double EPS = 1e-9;\\n\\tconst int DIM = 3;\\n\\ttypedef array<double,DIM> P;\\n\\n\\tdouble dist(const P &p1,const P &p2){\\n\\t\\tdouble ans = 0;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++)\\n\\t\\t\\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\\n\\t\\treturn sqrt(ans);\\n\\t}\\n\\ttypedef array<int,DIM> Block;\\n\\ttypedef map<Block,vector<int>> Bucket;\\n\\tBlock getBlock(const P &p,double w){\\n\\t\\tBlock res;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\\n\\t\\treturn res;\\n\\t}\\n\\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\\n\\t\\tvector<int> res;\\n\\t\\tauto key = getBlock(p,w);\\n\\t\\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\\n\\t\\t\\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\\n\\t\\t\\t\\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\\n\\t\\t\\t\\t\\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\\n\\t\\t\\t\\t\\tif( it != b.end() ){\\n\\t\\t\\t\\t\\t\\tfor( int id : it->second ) res.push_back(id);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\\n\\tBucket makeBucket(const vector<P> &ps,double w){\\n\\t\\tBucket b;\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++)\\n\\t\\t\\tb[getBlock(ps[i],w)].push_back(i);\\n\\t\\treturn b;\\n\\t}\\n\\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\\n\\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\\\??????????\\n\\tdouble closetPairDistance(vector<P> ps){\\n\\t\\tdouble w = 1e9;\\n\\t\\tfor( auto &p : ps ){\\n\\t\\t\\ttie(p[0],p[1]) = make_pair(p[0]*cos(2)-p[1]*sin(2),p[0]*sin(2)+p[1]*cos(2));\\n\\t\\t}\\n\\t\\tsort(ps.begin(),ps.end());\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\t\\tfor(int j = i-1 ; j >= 0 ; j--){\\n\\t\\t\\t\\tif( ps[i][0]-ps[j][0] >= w ) break;\\n\\t\\t\\t\\tw = min(w,dist(ps[i],ps[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn w;\\n\\t}\\n};\\n\\nusing namespace ClosestPair;\\n\\n\\nstruct Pt{\\n\\tdouble x,y,z;\\n};\\nbool operator < (const Pt &a,const Pt &b){\\n\\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\\n\\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\\n\\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\\n\\treturn false;\\n}\\n\\ndouble X[150000];\\ndouble Y[150000];\\ndouble Z[150000];\\n\\nint main(){\\n\\tint m,n,S,W;\\n\\tint tst = 1;\\n\\twhile( cin >> m >> n >> S >> W && m+n ){\\n\\t\\tmap<Pt,vector<P>> dic;\\n\\t\\tfor(int i = 0 ; i < m ; i++){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",X+i,Y+i,Z+i);\\n\\t\\t}\\n\\t\\tint g = S;\\n\\t\\tfor(int i=m; i<m+n; i++) {\\n\\t\\t X[i] = (g/7) %100 + 1;\\n\\t\\t Y[i] = (g/700) %100 + 1;\\n\\t\\t Z[i] = (g/70000)%100 + 1;\\n\\t\\t if( g%2 == 0 ) { g = (g/2); }\\n\\t\\t else { g = (g/2) ^ W; }\\n\\t\\t}\\n\\t\\tfor(int i = 0 ; i < m+n ; i++){\\n\\t\\t\\tdouble x = X[i];\\n\\t\\t\\tdouble y = Y[i];\\n\\t\\t\\tdouble z = Z[i];\\n\\t\\t\\tP p = {x,y,z};\\n\\t\\t\\tdouble d = dist(P{0,0,0},p);\\n\\t\\t\\tPt e;\\n\\t\\t\\te.x = x / d;\\n\\t\\t\\te.y = y / d;\\n\\t\\t\\te.z = z / d;\\n\\t\\t\\tdic[e].push_back(p);\\n\\t\\t}\\n\\t\\tvector<P> ps;\\n\\t\\tvector<P> cand;\\n\\t\\tfor( auto &p : dic ){\\n\\t\\t\\tps.push_back(P{p.first.x,p.first.y,p.first.z});\\n\\t\\t\\t\\n\\t\\t\\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\\n\\t\\t}\\n\\t\\n\\t\\tdouble w = closetPairDistance(ps);\\n\\t\\tauto b = makeBucket(ps,2*w);\\n\\t\\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\t\\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\\n\\t\\t\\t\\tif( i != j ){\\n\\t\\t\\t\\t\\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\\n\\t\\t\\t\\t\\t\\tbest = min(best,pair<P,P>{cand[i],cand[j]});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << (int)best.first[0] << \\\" \\\" << (int)best.first[1] << \\\" \\\" << (int)best.first[2] << \\\" \\\";\\n\\t\\tcout << (int)best.second[0] << \\\" \\\" << (int)best.second[1] << \\\" \\\" << (int)best.second[2] << \\\"\\\\n\\\";\\n\\t}\\n\\t\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3670,\n \"memory_kb\": 31612,\n \"score_of_the_acc\": -0.8738,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1340_1569098\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace ClosestPair{\\n\\t// DIM=3????£????????¬????????????????????????´?????????getNearPoints()makeBucket()?????´\\n\\tconst double EPS = 1e-9;\\n\\tconst int DIM = 3;\\n\\ttypedef array<double,DIM> P;\\n\\n\\tdouble dist(const P &p1,const P &p2){\\n\\t\\tdouble ans = 0;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++)\\n\\t\\t\\tans += (p1[i]-p2[i])*(p1[i]-p2[i]);\\n\\t\\treturn sqrt(ans);\\n\\t}\\n\\ttypedef array<int,DIM> Block;\\n\\ttypedef map<Block,vector<int>> Bucket;\\n\\tBlock getBlock(const P &p,double w){\\n\\t\\tBlock res;\\n\\t\\tfor(int i = 0 ; i < DIM ; i++) res[i] = p[i] / w;\\n\\t\\treturn res;\\n\\t}\\n\\tvector<int> getNearPoints(const Bucket &b,double w,const P &p){\\n\\t\\tvector<int> res;\\n\\t\\tauto key = getBlock(p,w);\\n\\t\\tfor(int x0 = -1 ; x0 <= 1 ; x0++)\\n\\t\\t\\tfor(int x1 = -1 ; x1 <= 1 ; x1++)\\n\\t\\t\\t\\tfor(int x2 = -1 ; x2 <= 1 ; x2++){\\n\\t\\t\\t\\t\\tauto it = b.find(Block{key[0]+x0,key[1]+x1,key[2]+x2});\\n\\t\\t\\t\\t\\tif( it != b.end() ){\\n\\t\\t\\t\\t\\t\\tfor( int id : it->second ) res.push_back(id);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t//???w???n?¬?????????±????????????????????????????????¨????????°??¨??????????????????????±????????????¨?????§?????????\\n\\tBucket makeBucket(const vector<P> &ps,double w){\\n\\t\\tBucket b;\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++)\\n\\t\\t\\tb[getBlock(ps[i],w)].push_back(i);\\n\\t\\treturn b;\\n\\t}\\n\\t// ????????????????????¢????????????????????±???????¬??§??????? map????????¨?????????????????§???????¨???????O(n log n)\\n\\t// ?????±??????????????????????§???????????????????????¢????????£?????????????????????????????????§??????????????§???????????????2w??????????????????????????????w???????????????????\\\\??????????\\n\\tdouble closetPairDistance(vector<P> ps){\\n\\t\\tassert(ps.size()>=2);\\n\\t\\trandom_shuffle(ps.begin(),ps.end());\\n\\t\\tdouble w = dist(ps[0],ps[1]);\\n\\t\\tvector<P> build = {ps[0],ps[1]};\\n\\t\\tauto b = makeBucket(build,2*w);\\n\\t\\tfor(int i = 2 ; i < ps.size() ; i++){\\n\\t\\t\\tdouble next_w = w;\\n\\t\\t\\tfor( int j : getNearPoints(b,2*w,ps[i]) )\\n\\t\\t\\t\\tnext_w = min(next_w,dist(ps[i],ps[j]));\\n\\t\\t\\tbuild.push_back(ps[i]);\\n\\t\\t\\tif( w - EPS > next_w ){\\n\\t\\t\\t\\tw = next_w;\\n\\t\\t\\t\\tb = makeBucket(build,2*w);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tb[getBlock(ps[i],2*w)].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn w;\\n\\t}\\n};\\n\\nusing namespace ClosestPair;\\n\\n\\nstruct Pt{\\n\\tdouble x,y,z;\\n};\\nbool operator < (const Pt &a,const Pt &b){\\n\\tif( fabs(a.x-b.x) > EPS ) return a.x < b.x;\\n\\tif( fabs(a.y-b.y) > EPS ) return a.y < b.y;\\n\\tif( fabs(a.z-b.z) > EPS ) return a.z < b.z;\\n\\treturn false;\\n}\\n\\ndouble X[150000];\\ndouble Y[150000];\\ndouble Z[150000];\\n\\nint main(){\\n\\tint m,n,S,W;\\n\\tint tst = 1;\\n\\twhile( cin >> m >> n >> S >> W && m+n ){\\n\\t\\tmap<Pt,vector<P>> dic;\\n\\t\\tfor(int i = 0 ; i < m ; i++){\\n\\t\\t\\tscanf(\\\"%lf%lf%lf\\\",X+i,Y+i,Z+i);\\n\\t\\t}\\n\\t\\tint g = S;\\n\\t\\tfor(int i=m; i<m+n; i++) {\\n\\t\\t X[i] = (g/7) %100 + 1;\\n\\t\\t Y[i] = (g/700) %100 + 1;\\n\\t\\t Z[i] = (g/70000)%100 + 1;\\n\\t\\t if( g%2 == 0 ) { g = (g/2); }\\n\\t\\t else { g = (g/2) ^ W; }\\n\\t\\t}\\n\\t\\tfor(int i = 0 ; i < m+n ; i++){\\n\\t\\t\\tdouble x = X[i];\\n\\t\\t\\tdouble y = Y[i];\\n\\t\\t\\tdouble z = Z[i];\\n\\t\\t\\tP p = {x,y,z};\\n\\t\\t\\tdouble d = dist(P{0,0,0},p);\\n\\t\\t\\tPt e;\\n\\t\\t\\te.x = x / d;\\n\\t\\t\\te.y = y / d;\\n\\t\\t\\te.z = z / d;\\n\\t\\t\\tdic[e].push_back(p);\\n\\t\\t}\\n\\t\\tvector<P> ps;\\n\\t\\tvector<P> cand;\\n\\t\\tfor( auto &p : dic ){\\n\\t\\t\\tps.push_back(P{p.first.x,p.first.y,p.first.z});\\n\\t\\t\\t\\n\\t\\t\\tcand.push_back(*min_element(p.second.begin(),p.second.end()));\\n\\t\\t}\\n\\t\\n\\t\\tdouble w = closetPairDistance(ps);\\n\\t\\tauto b = makeBucket(ps,2*w);\\n\\t\\tpair<P,P> best = {P{1e9,1e9,1e9},P{1e9,1e9,1e9}};\\n\\t\\tfor(int i = 0 ; i < ps.size() ; i++){\\n\\t\\t\\tfor( auto j : getNearPoints(b,2*w,ps[i]) ){\\n\\t\\t\\t\\tif( i != j ){\\n\\t\\t\\t\\t\\tif( fabs(dist(ps[i],ps[j])-w) < EPS ){\\n\\t\\t\\t\\t\\t\\tbest = min(best,pair<P,P>{cand[i],cand[j]});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << (int)best.first[0] << \\\" \\\" << (int)best.first[1] << \\\" \\\" << (int)best.first[2] << \\\" \\\";\\n\\t\\tcout << (int)best.second[0] << \\\" \\\" << (int)best.second[1] << \\\" \\\" << (int)best.second[2] << \\\"\\\\n\\\";\\n\\t\\t\\n\\t}\\n\\t\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7430,\n \"memory_kb\": 44408,\n \"score_of_the_acc\": -1.5804,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":793,"cells":{"group_id":{"kind":"string","value":"aoj_1347_cpp"},"problem_description":{"kind":"string","value":"Problem C:\nShopping\nYour friend will enjoy shopping. She will walk through a mall along a straight street, where $N$ individual shops (numbered from 1 to $N$) are aligned at regular intervals. Each shop has one door and is located at the one side of the street. The distances between the doors of the adjacent shops are the same length, i.e. a unit length. Starting shopping at the entrance of the mall, she visits shops in order to purchase goods. She has to go to the exit of the mall after shopping.\nShe requires some restrictions on visiting order of shops. Each of the restrictions indicates that she shall visit a shop before visiting another shop. For example, when she wants to buy a nice dress before choosing heels, she shall visit a boutique before visiting a shoe store. When the boutique is farther than the shoe store, she must pass the shoe store before visiting the boutique, and go back to the shoe store after visiting the boutique.\nIf only the order of the visiting shops satisfies all the restrictions, she can visit other shops in any order she likes.\nWrite a program to determine the minimum required walking length for her to move from the entrance to the exit.\nAssume that the position of the door of the shop numbered $k$ is $k$ units far from the entrance, where the position of the exit is $N + 1$ units far from the entrance.\nInput\nThe input consists of a single test case.\n$N$ $m$\n$c_1$ $d_1$\n.\n.\n.\n$c_m$ $d_m$\nThe first line contains two integers $N$ and $m$, where $N$ ($1 \\leq N \\leq 1000$) is the number of shops, and $m$ ($0 \\leq m \\leq 500$) is the number of restrictions. Each of the next $m$ lines contains two integers $c_i$ and $d_i$ ($1 \\leq c_i < d_i \\leq N$) indicating the $i$-th restriction on the visiting order, where she must visit the shop numbered $c_i$ after she visits the shop numbered $d_i$ ($i = 1, . . . , m$).\nThere are no pair of $j$ and $k$ that satisfy $c_j = c_k$ and $d_j = d_k$.\nOutput\nOutput the minimum required walking length for her to move from the entrance to the exit. You should omit the length of her walk in the insides of shops.\nSample Input 1\n10 3\n3 7\n8 9\n2 5\nSample Output 1\n23\nSample Input 2\n10 3\n8 9\n6 7\n2 4\nSample Output 2\n19\nSample Input 3\n10 0\nSample Output 3\n11\nSample Input 4\n10 6\n6 7\n4 5\n2 5\n6 9\n3 5\n6 8\nSample Output 4\n23\nSample Input 5\n1000 8\n3 4\n6 1000\n5 1000\n7 1000\n8 1000\n4 1000\n9 1000\n1 2\nSample Output 5\n2997"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1347_2717021","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//dp\nint n, m;\nvector<P> vp2;\nll dp[510][1100];\n\nint main() {\n\tcin >> n >> m;\n\tif (m == 0) {\n\t\tcout << n + 1 << endl;\n\t\treturn 0;\n\t}\n\trep(i, m) {\n\t\tll c, d;\n\t\tcin >> c >> d;\n\t\tvp2.push_back({ c,d });\n\t}\n\tsort(ALL(vp2));\n\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\n\tdp[0][0] = 0;\n\tint now = 0;\n\trep(i, vp2.size()) {\n\t\tll ci = vp2[i].first;\n\t\tll di = vp2[i].second;\n\t\tFOR(j, di, n + 2) {//新しく経由する点\n\t\t\tFOR(k, now, n + 2) {//今までに経由した点\n\t\t\t\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\n\t\t\t\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\n\t\t\t}\n\t\t}\n\t\tnow = ci;\n\t}\n\tll ans = INF;\n\trep(i, n + 2) {\n\t\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\n\t}\n\tcout << ans << endl;\n}\n\n//int n, m;\n//vector<P> vp;\n//int sum[100100];\n//\n//int main() {\n//\tcin >> n >> m;\n//\tvp.resize(m);\n//\trep(i, m) {\n//\t\tint a, b;\n//\t\tcin >> a >> b;\n//\t\tsum[a]++;\n//\t\tsum[b]--;\n//\t}\n//\trep(i, n + 2)sum[i + 1] += sum[i];\n//\tll ans = 0;\n//\trep(i, n + 1) {\n//\t\tif (sum[i] > 0)ans += 3;\n//\t\telse ans++;\n//\t}\n//\tcout << ans << endl;\n//}","accuracy":1,"time_ms":460,"memory_kb":7516,"score_of_the_acc":-0.6185,"final_rank":3},{"submission_id":"aoj_1347_2717020","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//dp\nint n, m;\nvector<P> vp;\nll dp[510][1100];\n\nint main() {\n\tcin >> n >> m;\n\tif (m == 0) {\n\t\tcout << n + 1 << endl;\n\t\treturn 0;\n\t}\n\trep(i, m) {\n\t\tll c, d;\n\t\tcin >> c >> d;\n\t\tvp.push_back({ c,d });\n\t}\n\tsort(ALL(vp));\n\tvector<P> vp2;\n\tll d = -1;\n\trep(i, vp.size()) {\n\t\t//if (d < vp[i].second) {\n\t\t//\td = vp[i].second;\n\t\t\tvp2.push_back(vp[i]);\n\t\t//}\n\t}\n\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\n\tdp[0][0] = 0;\n\tint now = 0;\n\trep(i, vp2.size()) {\n\t\tll ci = vp2[i].first;\n\t\tll di = vp2[i].second;\n\t\tFOR(j, di, n + 2) {//新しく経由する点\n\t\t\tFOR(k, now, n + 2) {//今までに経由した点\n\t\t\t\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\n\t\t\t\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\n\t\t\t}\n\t\t}\n\t\tnow = ci;\n\t}\n\t//FOR(i, 1, m + 1) {\n\t//\tif (dp[i][5] == INF) {\n\t//\t\tcout << i << endl;\n\t//\t\tbreak;\n\t//\t}\n\t//}\n\t//rep(i, vp2.size() + 1) {\n\t//\tif (i != vp2.size())continue;\n\t//\trep(j, n + 1) {\n\t//\t\tif (dp[i][j] != INF)printf(\"%4d\", dp[i][j]);\n\t//\t\telse cout << \" INF\";\n\t//\t}\n\t//\tcout << endl;\n\t//}\n\tll ans = INF;\n\trep(i, n + 2) {\n\t\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\n\t}\n\tcout << ans << endl;\n\t//cout << dp[vp2.size()][d] + n + 1 - now << endl;\n}\n\n//int n, m;\n//vector<P> vp;\n//int sum[100100];\n//\n//int main() {\n//\tcin >> n >> m;\n//\tvp.resize(m);\n//\trep(i, m) {\n//\t\tint a, b;\n//\t\tcin >> a >> b;\n//\t\tsum[a]++;\n//\t\tsum[b]--;\n//\t}\n//\trep(i, n + 2)sum[i + 1] += sum[i];\n//\tll ans = 0;\n//\trep(i, n + 1) {\n//\t\tif (sum[i] > 0)ans += 3;\n//\t\telse ans++;\n//\t}\n//\tcout << ans << endl;\n//}","accuracy":1,"time_ms":460,"memory_kb":7532,"score_of_the_acc":-0.6188,"final_rank":4},{"submission_id":"aoj_1347_2717019","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//dp\nint n, m;\nvector<P> vp;\nll dp[510][1100];\n\nint main() {\n\tcin >> n >> m;\n\tif (m == 0) {\n\t\tcout << n + 1 << endl;\n\t\treturn 0;\n\t}\n\trep(i, m) {\n\t\tll c, d;\n\t\tcin >> c >> d;\n\t\tvp.push_back({ c,d });\n\t}\n\tsort(ALL(vp));\n\tvector<P> vp2;\n\tll d = -1;\n\trep(i, vp.size()) {\n\t\tif (d < vp[i].second) {\n\t\t\td = vp[i].second;\n\t\t\tvp2.push_back(vp[i]);\n\t\t}\n\t}\n\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\n\tdp[0][0] = 0;\n\tint now = 0;\n\trep(i, vp2.size()) {\n\t\tll ci = vp2[i].first;\n\t\tll di = vp2[i].second;\n\t\tFOR(j, di, n + 2) {//新しく経由する点\n\t\t\tFOR(k, now, n + 2) {//今までに経由した点\n\t\t\t\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\n\t\t\t\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\n\t\t\t}\n\t\t}\n\t\tnow = ci;\n\t}\n\t//FOR(i, 1, m + 1) {\n\t//\tif (dp[i][5] == INF) {\n\t//\t\tcout << i << endl;\n\t//\t\tbreak;\n\t//\t}\n\t//}\n\t//rep(i, vp2.size() + 1) {\n\t//\tif (i != vp2.size())continue;\n\t//\trep(j, n + 1) {\n\t//\t\tif (dp[i][j] != INF)printf(\"%4d\", dp[i][j]);\n\t//\t\telse cout << \" INF\";\n\t//\t}\n\t//\tcout << endl;\n\t//}\n\tll ans = INF;\n\trep(i, n + 2) {\n\t\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\n\t}\n\tcout << ans << endl;\n\t//cout << dp[vp2.size()][d] + n + 1 - now << endl;\n}\n\n//int n, m;\n//vector<P> vp;\n//int sum[100100];\n//\n//int main() {\n//\tcin >> n >> m;\n//\tvp.resize(m);\n//\trep(i, m) {\n//\t\tint a, b;\n//\t\tcin >> a >> b;\n//\t\tsum[a]++;\n//\t\tsum[b]--;\n//\t}\n//\trep(i, n + 2)sum[i + 1] += sum[i];\n//\tll ans = 0;\n//\trep(i, n + 1) {\n//\t\tif (sum[i] > 0)ans += 3;\n//\t\telse ans++;\n//\t}\n//\tcout << ans << endl;\n//}","accuracy":1,"time_ms":410,"memory_kb":7524,"score_of_the_acc":-0.5576,"final_rank":2},{"submission_id":"aoj_1347_2717012","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//dp\nint n, m;\nvector<P> vp;\nll dp[510][1010];\n\nint main() {\n\tcin >> n >> m;\n\tif (m == 0) {\n\t\tcout << n + 1 << endl;\n\t\treturn 0;\n\t}\n\trep(i, m) {\n\t\tll c, d;\n\t\tcin >> c >> d;\n\t\tvp.push_back({ c,d });\n\t}\n\tsort(ALL(vp));\n\tvector<P> vp2;\n\tll d = -1;\n\trep(i, vp.size()) {\n\t\tif (d < vp[i].second) {\n\t\t\td = vp[i].second;\n\t\t\tvp2.push_back(vp[i]);\n\t\t}\n\t}\n\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\n\tdp[0][0] = 0;\n\tint now = 0;\n\trep(i, vp2.size()) {\n\t\tll ci = vp2[i].first;\n\t\tll di = vp2[i].second;\n\t\tFOR(j, di, n + 2) {//新しく経由する点\n\t\t\tFOR(k, now, n + 2) {//今までに経由した点\n\t\t\t\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\n\t\t\t\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\n\t\t\t}\n\t\t}\n\t\tnow = ci;\n\t}\n\t//FOR(i, 1, m + 1) {\n\t//\tif (dp[i][5] == INF) {\n\t//\t\tcout << i << endl;\n\t//\t\tbreak;\n\t//\t}\n\t//}\n\t//rep(i, m + 1) {\n\t//\trep(j, n + 1) {\n\t//\t\tif (dp[i][j] != INF)printf(\"%4d\", dp[i][j]);\n\t//\t\telse cout << \" INF\";\n\t//\t}\n\t//\tcout << endl;\n\t//}\n\td = vp.back().second;\n\tcout << dp[vp2.size()][d] + n + 1 - now << endl;\n}\n\n//int n, m;\n//vector<P> vp;\n//int sum[100100];\n//\n//int main() {\n//\tcin >> n >> m;\n//\tvp.resize(m);\n//\trep(i, m) {\n//\t\tint a, b;\n//\t\tcin >> a >> b;\n//\t\tsum[a]++;\n//\t\tsum[b]--;\n//\t}\n//\trep(i, n + 2)sum[i + 1] += sum[i];\n//\tll ans = 0;\n//\trep(i, n + 1) {\n//\t\tif (sum[i] > 0)ans += 3;\n//\t\telse ans++;\n//\t}\n//\tcout << ans << endl;\n//}","accuracy":0.045454545454545456,"time_ms":370,"memory_kb":7148,"score_of_the_acc":-0.5029,"final_rank":9},{"submission_id":"aoj_1347_2716970","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#include <sstream>\n#include <complex>\n#include <fstream>\n#include <bitset>\n#include <time.h>\n#include <tuple>\n#include <iomanip>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef vector<ll> V;\ntypedef complex<double> Point;\n\n#define PI acos(-1.0)\n#define EPS 1e-10\nconst ll INF = 1e12;\nconst ll MOD = 1e9 + 7;\n\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,N) for(int i=0;i<(N);i++)\n#define ALL(s) (s).begin(),(s).end()\n#define EQ(a,b) (abs((a)-(b))<EPS)\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\n#define fi first\n#define se second\n#define N_SIZE (1LL << 20)\n#define NIL -1\n\nll sq(ll num) { return num*num; }\nll mod_pow(ll x, ll n) {\n\tif (n == 0)return 1;\n\tif (n == 1)return x%MOD;\n\tll res = sq(mod_pow(x, n / 2));\n\tres %= MOD;\n\tif (n % 2 == 1) {\n\t\tres *= x;\n\t\tres %= MOD;\n\t}\n\treturn res;\n}\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\nll mod_mul(ll a, ll b) { return a*b % MOD; }\n\n//dp\nint n, m;\nvector<P> vp;\nll dp[510][1010];\n\nint main() {\n\tcin >> n >> m;\n\tif (m == 0) {\n\t\tcout << n + 1 << endl;\n\t\treturn 0;\n\t}\n\trep(i, m) {\n\t\tll c, d;\n\t\tcin >> c >> d;\n\t\tvp.push_back({ c,d });\n\t}\n\tsort(ALL(vp));\n\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\n\tdp[0][0] = 0;\n\tint now = 0;\n\trep(i, m) {\n\t\tll ci = vp[i].first;\n\t\tll di = vp[i].second;\n\t\tFOR(j, di, n + 1) {//新しく経由する点\n\t\t\tFOR(k, now, n + 1) {//今までに経由した点\n\t\t\t\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\n\t\t\t\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\n\t\t\t}\n\t\t}\n\t\tnow = ci;\n\t}\n\t//rep(i, m + 1) {\n\t//\trep(j, n + 1) {\n\t//\t\tif (dp[i][j] != INF)printf(\"%4d\", dp[i][j]);\n\t//\t\telse cout << \" INF\";\n\t//\t}\n\t//\tcout << endl;\n\t//}\n\tll d = vp.back().second;\n\tcout << dp[m][d] + n + 1 - now << endl;\n}\n\n//int n, m;\n//vector<P> vp;\n//int sum[100100];\n//\n//int main() {\n//\tcin >> n >> m;\n//\tvp.resize(m);\n//\trep(i, m) {\n//\t\tint a, b;\n//\t\tcin >> a >> b;\n//\t\tsum[a]++;\n//\t\tsum[b]--;\n//\t}\n//\trep(i, n + 2)sum[i + 1] += sum[i];\n//\tll ans = 0;\n//\trep(i, n + 1) {\n//\t\tif (sum[i] > 0)ans += 3;\n//\t\telse ans++;\n//\t}\n//\tcout << ans << endl;\n//}","accuracy":0.045454545454545456,"time_ms":360,"memory_kb":7148,"score_of_the_acc":-0.4907,"final_rank":8},{"submission_id":"aoj_1347_2716228","code_snippet":"#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define rep(i,n) REP(i,0,n)\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\n#define repr(i, n) REPR(i, n, 0)\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\n#define pb push_back\n#define all(r) r.begin(),r.end()\n#define rall(r) r.rbegin(),r.rend()\n#define fi first\n#define se second\n \ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n \nconst int INF = 1e9;\nconst ll MOD = 1e9 + 7;\ndouble EPS = 1e-8;\n\nll dp[2][1010];\n\nint main(){\n int n, m;\n cin >> n >> m;\n vi c(m+1), d(m+1);\n rep(i, m) cin >> c[i+1] >> d[i+1]; \n if(m == 0) {\n cout << n+1 << endl;\n return 0;\n }\n vector<pii> p(m+1);\n rep(i, m+1) p[i] = make_pair(c[i], d[i]);\n sort(all(p));\n rep(i, m+1) {\n c[i] = p[i].fi;\n d[i] = p[i].se;\n }\n {\n rep(i, 1010) {\n dp[1][i] = 1e18;\n }\n REP(i, d[1], 1010) {\n dp[1][i] = i + i - c[1];\n }\n\n }\n int cur, nxt;\n REP(i, 1, m) {\n cur = i&1;\n nxt = (i+1)&1;\n rep(j, 1010) dp[nxt][j] = 1e18;\n // j番目からk番目まで進んでから、c[i]番目にいく\n rep(j, 1010) if(dp[cur][j] != 1e18) {\n REP(k, d[i+1], 1010) {\n if(j >= k) { // c[i] -> c[i+1]\n int pos = max(j, c[i+1]);\n dp[nxt][pos] = min(dp[nxt][pos], dp[cur][j] + c[i+1] - c[i]);\n }\n else { // c[i] -> k -> c[i+1]\n int pos = max(k, c[i+1]);\n dp[nxt][pos] = min(dp[nxt][pos], dp[cur][j] + abs(c[i] - k) + abs(k - c[i+1]));\n }\n }\n }\n // rep(j, 20) {\n // cout << \" \" << (dp[nxt][j] == 1e18 ? -1 : dp[nxt][j]);\n // }\n // cout << endl;\n }\n\n ll ans = 1e18;\n rep(i, n+1) {\n ans = min(ans, dp[nxt][i] + n+1-c.back());\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":830,"memory_kb":3152,"score_of_the_acc":-1,"final_rank":5},{"submission_id":"aoj_1347_2642468","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n \ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n \nint N, m;\nvector<Pii> d;\nunordered_map<int, int> dp[1001][1001];\n \nint dfs(int pre, int now, int n) {\n if ( n == m ) {\n return (now-pre + (N+1)-pre);\n }\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\n \n int ret = dfs(min(pre, d[n].sc), d[n].fr, n+1) + (d[n].fr-now);\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\n \n return dp[pre][now][n] = ret;\n}\n \nsigned main() {\n cin >> N >> m;\n \n Rep(i, m) {\n int c, b;\n cin >> c >> b;\n d.pb(Pii(b, c)); \n }\n \n sort(All(d));\n \n if ( m == 0 ) cout << N+1 << endl;\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":65728,"score_of_the_acc":-1.0485,"final_rank":6},{"submission_id":"aoj_1347_2641900","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nint N, m;\nvector<Pii> d;\nunordered_map<int, int> dp[1001][1001];\n\nint dfs(int pre, int now, int n) {\n if ( n == m ) {\n return (now-pre + (N+1)-pre);\n }\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\n\n int ret = dfs(min(pre, d[n].sc), d[n].fr, n+1) + (d[n].fr-now);\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\n\n return dp[pre][now][n] = ret;\n}\n\nsigned main() {\n cin >> N >> m;\n\n Rep(i, m) {\n int c, b;\n cin >> c >> b;\n d.pb(Pii(b, c)); \n }\n\n sort(All(d));\n\n if ( m == 0 ) cout << N+1 << endl;\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":65748,"score_of_the_acc":-1.0488,"final_rank":7},{"submission_id":"aoj_1347_2641888","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define pb push_back \n#define pf push_front \n#define mp make_pair\n#define fr first\n#define sc second\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\n#define All(v) v.begin(), v.end()\n\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\nconst int INF = 1107110711071107;\n\nint N, m;\nvector<Pii> d;\nunordered_map<int, int> dp[1001][1001];\n\nint dfs(int pre, int now, int n) {\n if ( n == m ) {\n return (now-pre + (N+1)-pre);\n }\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\n\n int ret = dfs(pre, d[n].fr, n+1) + (d[n].fr-now);\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\n\n return dp[pre][now][n] = ret;\n}\n\nsigned main() {\n cin >> N >> m;\n\n Rep(i, m) {\n int c, b;\n cin >> c >> b;\n d.pb(Pii(b, c)); \n }\n\n sort(All(d));\n\n if ( m == 0 ) cout << N+1 << endl;\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\n}","accuracy":0.045454545454545456,"time_ms":40,"memory_kb":63100,"score_of_the_acc":-0.9943,"final_rank":10},{"submission_id":"aoj_1347_1595101","code_snippet":"//#include <stdio.h>\n//#include <iostream>\n//#include <math.h>\n//#include <numeric>\n//#include <vector>\n//#include <map>\n//#include <functional>\n//#include <stdio.h>\n//#include <array>\n//#include <algorithm>\n//#include <string>\n//#include <assert.h>\n//#include <stdio.h>\n//#include <queue>\n//#include<iomanip>\n//using namespace std;\n//\n//\n//using namespace std;\n////\n////#define N (1<<17) \n////// update(l,r,v) := [l,r]の区間に対してvを一様に足す. k,a,bは飾り\n////\n////struct NODE{\n////\tint sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\n////\tint lazy;\t//遅延されている値を保存している\n////\tNODE(){\n////\t\tsum = lazy = 0;\n////\t}\n////};\n////\n////NODE seg[2 * N];\n////\n////// inlineつけないと大変なことになるよ!(遅い)\n////inline void lazy_evaluate_node(int k, int a, int b){\n////\tseg[k].sum +=seg[k].lazy;\n////\tif (k < N){ // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\n////\t\tseg[2 * k].lazy += seg[k].lazy;\t//次は君が伝搬してね☆って感じ.\n////\t\tseg[2 * k + 1].lazy += seg[k].lazy;\n////\t}\n////\tseg[k].lazy = 0;\n////}\n////\n////inline void update_node(int k){ // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\n////\tseg[k].sum = min(seg[2 * k].sum , seg[2 * k + 1].sum);\n////}\n////\n////// update(l,r,v) := [l,r]を更新する. 区間は1-indexed.\n////void update(int l, int r, int v, int k = 1, int a = 1, int b = N){\n////\tlazy_evaluate_node(k, a, b); \t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n////\n////\tif (b < l || r < a) //[a,b]と[l,r]が交差している場合\n////\t\treturn;\n////\tif (l <= a && b <= r){ // [l,r]が[a,b]を完全に含んでいる場合\n////\t\tseg[k].lazy += v;\n////\t\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\n////\t\treturn;\n////\t}\n////\n////\tint m = (a + b) / 2;\n////\tupdate(l, r, v, 2 * k, a, m);\n////\tupdate(l, r, v, 2 * k + 1, m + 1, b);\n////\tupdate_node(k);\n////}\n////\n////// get(l,r) := [l,r]に対するクエリの答えを得る. 区間は1-indexed.\n////int get(int l, int r, int k = 1, int a = 1, int b = N){\n////\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\n////\n////\tif (b < l || r < a) //[a,b]と[l,r]が交差している場合\n////\t\treturn 0;\n////\n////\tif (l <= a && b <= r){ // [l,r]が[a,b]を完全に含んでいる場合\n////\t\treturn seg[k].sum;\n////\t}\n////\n////\tint m = (a + b) / 2;\n////\tint vl = get(l, r, 2 * k, a, m);\n////\tint vr = get(l, r, 2 * k + 1, m + 1, b);\n////\tupdate_node(k);\n////\treturn min(vl , vr);\n////}\n//\n//\n//int main() {\n//\t//int n;\n//\t//cin >> n;\n//\t//vector<int> aa(n);\n//\t//vector<pair<int,int>>aaa;\n//\t//for (int i = 0; i < n; ++i){\n//\t//\tint a, b;\n//\t//\tcin >> a >> b;\n//\t//\taaa.push_back(make_pair(a, b)); \n//\t//\taa[a]++;\n//\t//\taa[b]--;\n//\t//}\n//\t//vector<int> ans;\n//\t//ans.push_back(aa[0]);\n//\t//int amin=99999999;\n//\t//for(int i=0;i<n;++i){\n//\t//\tans.push_back(ans[i] + aa[i]);\n//\t//}\n//\n//\t//RMQ r;\n//\t//r.init(65536);\n//\t//for (int i = 0; i < 65536;++i){\n//\t//\tr.update(i, ans[i]);\n//\t//}\n//\n//\t//cout << r.query(0, 7) << endl; //1\n//\t//cout << r.query(3, 6) << endl; //2\n//\t//cout << r.query(1, 5) << endl; //1\n//\t//cout << r.query(5, 7) << endl; //4\n//\t//return 0;\n//\n//\tvector<long long int>times;\n//\tfor (int i = 0; i < 7; ++i){\n//\t\tlong long int c;\n//\t\tcin >> c;\n//\t\ttimes.push_back(c);\n//\t}\n//\tif (times[0] == 0)cout << \"YES\" << endl;\n//\telse{\n//\t\ttimes[0]--;\n//\t}\n//\n//\t{\n//\t\tvector<long long int> atimes(times);\n//\t\twhile (1){\n//\t\t\tauto zero_it = find(atimes.begin(), atimes.end(), 0);\n//\t\t\tif (zero_it != atimes.end()){//5 3 2 0 4 4 2 \n//\t\t\t\tconst int num = zero_it - atimes.begin();\n//\t\t\t\tint from = num;\n//\t\t\t\twhile (1){\n//\t\t\t\t\tfrom = (from + 1) % 7;\n//\t\t\t\t\tif (from == num)break;\n//\t\t\t\t\tint to = (from + 1) % 7;\n//\t\t\t\t\tif (atimes[from] != 0 && atimes[to] == 0){\n//\t\t\t\t\t\tbreak;\n//\t\t\t\t\t}\n//\t\t\t\t\tif (atimes[from] > atimes[to]){\n//\t\t\t\t\t\tbreak;\n//\t\t\t\t\t}\n//\t\t\t\t\tlong long int amin = min(atimes[from], atimes[to]);\n//\t\t\t\t\tatimes[from] -= amin;\n//\t\t\t\t\tatimes[to] -= amin;\n//\t\t\t\t\tif (atimes[from] == 0 && atimes[to] == 0){\n//\t\t\t\t\t\tbreak;\n//\t\t\t\t\t}\n//\t\t\t\t}\n//\t\t\t\tif (all_of(atimes.begin(), atimes.end(), [](const int aaa){return aaa == 0; })){\n//\t\t\t\t\tcout << \"YES\" << endl;\n//\t\t\t\t\treturn 0;\n//\t\t\t\t}\n//\t\t\t\telse{\n//\t\t\t\t\tbreak;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\telse{\n//\t\t\t\tlong long int aamin = atimes[0];\n//\t\t\t\tfor (int i = 0; i < 7; ++i){\n//\t\t\t\t\taamin = min(aamin, atimes[i]);\n//\t\t\t\t}\n//\t\t\t\tfor (int i = 0; i < 7; ++i){\n//\t\t\t\t\tatimes[i] -= aamin;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t}\n//\t}\n//\t{\n//\t\tvector<long long int> btimes(times);\n//\t\tfor (int i = 0; i < 7; ++i){//times[i]のまえがあいだになる\n//\t\t\tbtimes = times;\n//\t\t\tint from = (i + 6) % 7;\n//\t\t\twhile (1){\n//\t\t\t\tfrom = (from + 1) % 7;\n//\t\t\t\tif (from == (i + 6) % 7)break;\n//\t\t\t\tint to = (from + 1) % 7;\n//\t\t\t\tif (btimes[from] != 0 && btimes[to] == 0){\n//\t\t\t\t\tbreak;\n//\t\t\t\t}\n//\t\t\t\tif (btimes[from] > btimes[to]){\n//\t\t\t\t\tbreak;\n//\t\t\t\t}\n//\t\t\t\tlong long int amin = min(btimes[from], btimes[to]);\n//\t\t\t\tbtimes[from] -= amin;\n//\t\t\t\tbtimes[to] -= amin;\n//\t\t\t\tif (btimes[from] == 0 && btimes[to] == 0){\n//\t\t\t\t\tbreak;\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\tif (all_of(btimes.begin(), btimes.end(), [=](int a){return a == 0; })){\n//\t\t\t\tcout << \"YES\" << endl;\n//\t\t\t\treturn 0;\n//\t\t\t}\n//\t\t\telse{\n//\t\t\t\tcontinue;\n//\t\t\t}\n//\t\t}\n//\t}\n//\tcout << \"NO\" << endl;\n//\treturn 0;\n//}\n////3 4 4 4 4 4 4\n\n#include<stdio.h>\n#include <iostream>\n#include <math.h>\n#include <numeric>\n#include <vector>\n#include <map>\n#include <functional>\n#include <stdio.h>\n#include <array>\n#include <algorithm>\n#include <string>\n#include <assert.h>\n#include <stdio.h>\n#include <queue>\n#include<iomanip>\n#include<bitset>\n#include<stack>\nusing namespace std;\n\n//7:10\n//\n//#define REP(i,n) for(int i=0;i<(int)n;++i)\n//#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n//#define ALL(c) (c).begin(), (c).end()\n//\n//typedef int Weight;\n//struct Edge {\n//\tint src, dst;\n//\tWeight weight;\n//\tEdge(int src, int dst, Weight weight) :\n//\t\tsrc(src), dst(dst), weight(weight) { }\n//};\n//bool operator < (const Edge &e, const Edge &f) {\n//\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n//\te.src != f.src ? e.src < f.src : e.dst < f.dst;\n//}\n//typedef vector<Edge> Edges;\n//typedef vector<Edges> Graph;\n//\n//typedef vector<Weight> Array;\n//typedef vector<Array> Matrix;\n//\n//#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n//Weight maximumFlow(const Graph &g, int s, int t) {\n//\tint n = g.size();\n//\tMatrix flow(n, Array(n)), capacity(n, Array(n));\n//\tREP(u, n) for (auto e = g[u].begin(); e != g[u].end();++e)capacity[e->src][e->dst] += e->weight;\n//\n//\tWeight total = 0;\n//\twhile (1) {\n//\t\tqueue<int> Q; Q.push(s);\n//\t\tvector<int> prev(n, -1); prev[s] = s;\n//\t\twhile (!Q.empty() && prev[t] < 0) {\n//\t\t\tint u = Q.front(); Q.pop();\n//\t\t\tfor (auto e = g[u].begin(); e != g[u].end(); ++e) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > 0) {\n//\t\t\t\tprev[e->dst] = u;\n//\t\t\t\tQ.push(e->dst);\n//\t\t\t}\n//\t\t}\n//\t\tif (prev[t] < 0) return total; // prev[x] == -1 <=> t-side\n//\t\tWeight inc = 999999999;\n//\t\tfor (int j = t; prev[j] != j; j = prev[j])\n//\t\t\tinc = min(inc, RESIDUE(prev[j], j));\n//\t\tfor (int j = t; prev[j] != j; j = prev[j])\n//\t\t\tflow[prev[j]][j] += inc, flow[j][prev[j]] -= inc;\n//\t\ttotal += inc;\n//\t}\n//\treturn total;\n//}\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst int mod = 1000000007;\n\nstruct Mod {\n\tlong long int num;\n\tMod() : num(0) { ; }\n\tMod(long long int n) : num((n % mod + mod) % mod) { ; }\n\toperator long long int() { return num; }\n};\n\nMod operator+(Mod a, Mod b) { return Mod((a.num + b.num) % mod); }\nMod operator-(Mod a, Mod b) { return Mod((mod + a.num - b.num) % mod); }\nMod operator*(Mod a, Mod b) { return Mod(((long long)a.num * b.num) % mod); }\nMod operator+=(Mod &a, Mod b) { return a = a + b; }\nMod operator-=(Mod &a, Mod b) { return a = a - b; }\nMod operator*=(Mod &a, Mod b) { return a = a * b; }\nMod operator^(Mod a, int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = (a * a) ^ (n / 2);\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod inv(Mod a) { return a ^ (mod - 2); }\nMod operator/(Mod a, Mod b) { return a * inv(b); }\n\n#define MAX_N 1024000\n\nMod fact[MAX_N], factinv[MAX_N];\nvoid init() {\n\tfact[0] = Mod(1); factinv[0] = 1;\n\tREP(i, MAX_N - 1) {\n\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n\t}\n}\nMod comb(int a, int b) {\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\nlong long int memo[20];//nけた\n\nlong long int powint(long long int a, int b){\n\tif (b == 0)return 1;\n\tif (b == 1)return a;\n\telse{\n\t\tlong long int ans = 1;\n\t\tlong long int c = powint(a, b / 2);\n\t\tans *= c*c;\n\t\tans *= (b % 2) ? a : 1;\n\t\treturn ans;\n\t}\n\n}\n\n\nint backnum[100000][20];\n\nstruct Node{\n\tNode(int aid):children(),ancs(){\n\t\tid=(aid);\n\t\tfor (int i = 0; i < 20; ++i){\n\t\t\tancs[i] = -1;\n\t\t}\n\t}\n\tint id;\n\tvector<int>children;\n\tarray<int, 20>ancs;\n};\n\nint main()\n{\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> Sa(N + 1);\n\tvector<int>Sum(N);\n\tfor (int i = 0; i < M; ++i){\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tif (a < b){\n\t\t\tSa[a]++;\n\t\t\tSa[b]--;\n\t\t}\n\t\t\n\t}\n\tint now = 0;\n\tfor (int i = 0; i < N; ++i){\n\t\tnow += Sa[i];\n\t\tSum[i] += now;\n\t}\n\tint a = count_if(Sum.begin(), Sum.end(), [](const int l){return l != 0; });\n\tcout << N + 1 + a * 2<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":19120,"score_of_the_acc":-0.2551,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1347_2717021\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n#include <bitset>\\n#include <time.h>\\n#include <tuple>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e12;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll sq(ll num) { return num*num; }\\nll mod_pow(ll x, ll n) {\\n\\tif (n == 0)return 1;\\n\\tif (n == 1)return x%MOD;\\n\\tll res = sq(mod_pow(x, n / 2));\\n\\tres %= MOD;\\n\\tif (n % 2 == 1) {\\n\\t\\tres *= x;\\n\\t\\tres %= MOD;\\n\\t}\\n\\treturn res;\\n}\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\n//dp\\nint n, m;\\nvector<P> vp2;\\nll dp[510][1100];\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tif (m == 0) {\\n\\t\\tcout << n + 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tll c, d;\\n\\t\\tcin >> c >> d;\\n\\t\\tvp2.push_back({ c,d });\\n\\t}\\n\\tsort(ALL(vp2));\\n\\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\\n\\tdp[0][0] = 0;\\n\\tint now = 0;\\n\\trep(i, vp2.size()) {\\n\\t\\tll ci = vp2[i].first;\\n\\t\\tll di = vp2[i].second;\\n\\t\\tFOR(j, di, n + 2) {//新しく経由する点\\n\\t\\t\\tFOR(k, now, n + 2) {//今までに経由した点\\n\\t\\t\\t\\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\\n\\t\\t\\t\\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow = ci;\\n\\t}\\n\\tll ans = INF;\\n\\trep(i, n + 2) {\\n\\t\\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\\n\\t}\\n\\tcout << ans << endl;\\n}\\n\\n//int n, m;\\n//vector<P> vp;\\n//int sum[100100];\\n//\\n//int main() {\\n//\\tcin >> n >> m;\\n//\\tvp.resize(m);\\n//\\trep(i, m) {\\n//\\t\\tint a, b;\\n//\\t\\tcin >> a >> b;\\n//\\t\\tsum[a]++;\\n//\\t\\tsum[b]--;\\n//\\t}\\n//\\trep(i, n + 2)sum[i + 1] += sum[i];\\n//\\tll ans = 0;\\n//\\trep(i, n + 1) {\\n//\\t\\tif (sum[i] > 0)ans += 3;\\n//\\t\\telse ans++;\\n//\\t}\\n//\\tcout << ans << endl;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 7516,\n \"score_of_the_acc\": -0.6185,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1347_2717020\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n#include <bitset>\\n#include <time.h>\\n#include <tuple>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e12;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll sq(ll num) { return num*num; }\\nll mod_pow(ll x, ll n) {\\n\\tif (n == 0)return 1;\\n\\tif (n == 1)return x%MOD;\\n\\tll res = sq(mod_pow(x, n / 2));\\n\\tres %= MOD;\\n\\tif (n % 2 == 1) {\\n\\t\\tres *= x;\\n\\t\\tres %= MOD;\\n\\t}\\n\\treturn res;\\n}\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\n//dp\\nint n, m;\\nvector<P> vp;\\nll dp[510][1100];\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tif (m == 0) {\\n\\t\\tcout << n + 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tll c, d;\\n\\t\\tcin >> c >> d;\\n\\t\\tvp.push_back({ c,d });\\n\\t}\\n\\tsort(ALL(vp));\\n\\tvector<P> vp2;\\n\\tll d = -1;\\n\\trep(i, vp.size()) {\\n\\t\\t//if (d < vp[i].second) {\\n\\t\\t//\\td = vp[i].second;\\n\\t\\t\\tvp2.push_back(vp[i]);\\n\\t\\t//}\\n\\t}\\n\\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\\n\\tdp[0][0] = 0;\\n\\tint now = 0;\\n\\trep(i, vp2.size()) {\\n\\t\\tll ci = vp2[i].first;\\n\\t\\tll di = vp2[i].second;\\n\\t\\tFOR(j, di, n + 2) {//新しく経由する点\\n\\t\\t\\tFOR(k, now, n + 2) {//今までに経由した点\\n\\t\\t\\t\\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\\n\\t\\t\\t\\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow = ci;\\n\\t}\\n\\t//FOR(i, 1, m + 1) {\\n\\t//\\tif (dp[i][5] == INF) {\\n\\t//\\t\\tcout << i << endl;\\n\\t//\\t\\tbreak;\\n\\t//\\t}\\n\\t//}\\n\\t//rep(i, vp2.size() + 1) {\\n\\t//\\tif (i != vp2.size())continue;\\n\\t//\\trep(j, n + 1) {\\n\\t//\\t\\tif (dp[i][j] != INF)printf(\\\"%4d\\\", dp[i][j]);\\n\\t//\\t\\telse cout << \\\" INF\\\";\\n\\t//\\t}\\n\\t//\\tcout << endl;\\n\\t//}\\n\\tll ans = INF;\\n\\trep(i, n + 2) {\\n\\t\\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cout << dp[vp2.size()][d] + n + 1 - now << endl;\\n}\\n\\n//int n, m;\\n//vector<P> vp;\\n//int sum[100100];\\n//\\n//int main() {\\n//\\tcin >> n >> m;\\n//\\tvp.resize(m);\\n//\\trep(i, m) {\\n//\\t\\tint a, b;\\n//\\t\\tcin >> a >> b;\\n//\\t\\tsum[a]++;\\n//\\t\\tsum[b]--;\\n//\\t}\\n//\\trep(i, n + 2)sum[i + 1] += sum[i];\\n//\\tll ans = 0;\\n//\\trep(i, n + 1) {\\n//\\t\\tif (sum[i] > 0)ans += 3;\\n//\\t\\telse ans++;\\n//\\t}\\n//\\tcout << ans << endl;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 7532,\n \"score_of_the_acc\": -0.6188,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1347_2717019\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n#include <bitset>\\n#include <time.h>\\n#include <tuple>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e12;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll sq(ll num) { return num*num; }\\nll mod_pow(ll x, ll n) {\\n\\tif (n == 0)return 1;\\n\\tif (n == 1)return x%MOD;\\n\\tll res = sq(mod_pow(x, n / 2));\\n\\tres %= MOD;\\n\\tif (n % 2 == 1) {\\n\\t\\tres *= x;\\n\\t\\tres %= MOD;\\n\\t}\\n\\treturn res;\\n}\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\n//dp\\nint n, m;\\nvector<P> vp;\\nll dp[510][1100];\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tif (m == 0) {\\n\\t\\tcout << n + 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tll c, d;\\n\\t\\tcin >> c >> d;\\n\\t\\tvp.push_back({ c,d });\\n\\t}\\n\\tsort(ALL(vp));\\n\\tvector<P> vp2;\\n\\tll d = -1;\\n\\trep(i, vp.size()) {\\n\\t\\tif (d < vp[i].second) {\\n\\t\\t\\td = vp[i].second;\\n\\t\\t\\tvp2.push_back(vp[i]);\\n\\t\\t}\\n\\t}\\n\\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\\n\\tdp[0][0] = 0;\\n\\tint now = 0;\\n\\trep(i, vp2.size()) {\\n\\t\\tll ci = vp2[i].first;\\n\\t\\tll di = vp2[i].second;\\n\\t\\tFOR(j, di, n + 2) {//新しく経由する点\\n\\t\\t\\tFOR(k, now, n + 2) {//今までに経由した点\\n\\t\\t\\t\\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\\n\\t\\t\\t\\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow = ci;\\n\\t}\\n\\t//FOR(i, 1, m + 1) {\\n\\t//\\tif (dp[i][5] == INF) {\\n\\t//\\t\\tcout << i << endl;\\n\\t//\\t\\tbreak;\\n\\t//\\t}\\n\\t//}\\n\\t//rep(i, vp2.size() + 1) {\\n\\t//\\tif (i != vp2.size())continue;\\n\\t//\\trep(j, n + 1) {\\n\\t//\\t\\tif (dp[i][j] != INF)printf(\\\"%4d\\\", dp[i][j]);\\n\\t//\\t\\telse cout << \\\" INF\\\";\\n\\t//\\t}\\n\\t//\\tcout << endl;\\n\\t//}\\n\\tll ans = INF;\\n\\trep(i, n + 2) {\\n\\t\\tans = min(dp[vp2.size()][i] + n + 1 - now, ans);\\n\\t}\\n\\tcout << ans << endl;\\n\\t//cout << dp[vp2.size()][d] + n + 1 - now << endl;\\n}\\n\\n//int n, m;\\n//vector<P> vp;\\n//int sum[100100];\\n//\\n//int main() {\\n//\\tcin >> n >> m;\\n//\\tvp.resize(m);\\n//\\trep(i, m) {\\n//\\t\\tint a, b;\\n//\\t\\tcin >> a >> b;\\n//\\t\\tsum[a]++;\\n//\\t\\tsum[b]--;\\n//\\t}\\n//\\trep(i, n + 2)sum[i + 1] += sum[i];\\n//\\tll ans = 0;\\n//\\trep(i, n + 1) {\\n//\\t\\tif (sum[i] > 0)ans += 3;\\n//\\t\\telse ans++;\\n//\\t}\\n//\\tcout << ans << endl;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 7524,\n \"score_of_the_acc\": -0.5576,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1347_2717012\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n#include <bitset>\\n#include <time.h>\\n#include <tuple>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e12;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll sq(ll num) { return num*num; }\\nll mod_pow(ll x, ll n) {\\n\\tif (n == 0)return 1;\\n\\tif (n == 1)return x%MOD;\\n\\tll res = sq(mod_pow(x, n / 2));\\n\\tres %= MOD;\\n\\tif (n % 2 == 1) {\\n\\t\\tres *= x;\\n\\t\\tres %= MOD;\\n\\t}\\n\\treturn res;\\n}\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\n//dp\\nint n, m;\\nvector<P> vp;\\nll dp[510][1010];\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tif (m == 0) {\\n\\t\\tcout << n + 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tll c, d;\\n\\t\\tcin >> c >> d;\\n\\t\\tvp.push_back({ c,d });\\n\\t}\\n\\tsort(ALL(vp));\\n\\tvector<P> vp2;\\n\\tll d = -1;\\n\\trep(i, vp.size()) {\\n\\t\\tif (d < vp[i].second) {\\n\\t\\t\\td = vp[i].second;\\n\\t\\t\\tvp2.push_back(vp[i]);\\n\\t\\t}\\n\\t}\\n\\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\\n\\tdp[0][0] = 0;\\n\\tint now = 0;\\n\\trep(i, vp2.size()) {\\n\\t\\tll ci = vp2[i].first;\\n\\t\\tll di = vp2[i].second;\\n\\t\\tFOR(j, di, n + 2) {//新しく経由する点\\n\\t\\t\\tFOR(k, now, n + 2) {//今までに経由した点\\n\\t\\t\\t\\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\\n\\t\\t\\t\\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow = ci;\\n\\t}\\n\\t//FOR(i, 1, m + 1) {\\n\\t//\\tif (dp[i][5] == INF) {\\n\\t//\\t\\tcout << i << endl;\\n\\t//\\t\\tbreak;\\n\\t//\\t}\\n\\t//}\\n\\t//rep(i, m + 1) {\\n\\t//\\trep(j, n + 1) {\\n\\t//\\t\\tif (dp[i][j] != INF)printf(\\\"%4d\\\", dp[i][j]);\\n\\t//\\t\\telse cout << \\\" INF\\\";\\n\\t//\\t}\\n\\t//\\tcout << endl;\\n\\t//}\\n\\td = vp.back().second;\\n\\tcout << dp[vp2.size()][d] + n + 1 - now << endl;\\n}\\n\\n//int n, m;\\n//vector<P> vp;\\n//int sum[100100];\\n//\\n//int main() {\\n//\\tcin >> n >> m;\\n//\\tvp.resize(m);\\n//\\trep(i, m) {\\n//\\t\\tint a, b;\\n//\\t\\tcin >> a >> b;\\n//\\t\\tsum[a]++;\\n//\\t\\tsum[b]--;\\n//\\t}\\n//\\trep(i, n + 2)sum[i + 1] += sum[i];\\n//\\tll ans = 0;\\n//\\trep(i, n + 1) {\\n//\\t\\tif (sum[i] > 0)ans += 3;\\n//\\t\\telse ans++;\\n//\\t}\\n//\\tcout << ans << endl;\\n//}\",\n \"accuracy\": 0.045454545454545456,\n \"time_ms\": 370,\n \"memory_kb\": 7148,\n \"score_of_the_acc\": -0.5029,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1347_2716970\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <functional>\\n#include <numeric>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <utility>\\n#include <sstream>\\n#include <complex>\\n#include <fstream>\\n#include <bitset>\\n#include <time.h>\\n#include <tuple>\\n#include <iomanip>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef vector<ll> V;\\ntypedef complex<double> Point;\\n\\n#define PI acos(-1.0)\\n#define EPS 1e-10\\nconst ll INF = 1e12;\\nconst ll MOD = 1e9 + 7;\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,N) for(int i=0;i<(N);i++)\\n#define ALL(s) (s).begin(),(s).end()\\n#define EQ(a,b) (abs((a)-(b))<EPS)\\n#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )\\n#define fi first\\n#define se second\\n#define N_SIZE (1LL << 20)\\n#define NIL -1\\n\\nll sq(ll num) { return num*num; }\\nll mod_pow(ll x, ll n) {\\n\\tif (n == 0)return 1;\\n\\tif (n == 1)return x%MOD;\\n\\tll res = sq(mod_pow(x, n / 2));\\n\\tres %= MOD;\\n\\tif (n % 2 == 1) {\\n\\t\\tres *= x;\\n\\t\\tres %= MOD;\\n\\t}\\n\\treturn res;\\n}\\nll mod_add(ll a, ll b) { return (a + b) % MOD; }\\nll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }\\nll mod_mul(ll a, ll b) { return a*b % MOD; }\\n\\n//dp\\nint n, m;\\nvector<P> vp;\\nll dp[510][1010];\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tif (m == 0) {\\n\\t\\tcout << n + 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i, m) {\\n\\t\\tll c, d;\\n\\t\\tcin >> c >> d;\\n\\t\\tvp.push_back({ c,d });\\n\\t}\\n\\tsort(ALL(vp));\\n\\trep(i, 510)rep(j, 1010)dp[i][j] = INF;\\n\\tdp[0][0] = 0;\\n\\tint now = 0;\\n\\trep(i, m) {\\n\\t\\tll ci = vp[i].first;\\n\\t\\tll di = vp[i].second;\\n\\t\\tFOR(j, di, n + 1) {//新しく経由する点\\n\\t\\t\\tFOR(k, now, n + 1) {//今までに経由した点\\n\\t\\t\\t\\tif (k < j)dp[i + 1][j] = min(dp[i + 1][j], dp[i][k] + (j - now) + (j - ci));\\n\\t\\t\\t\\telse dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (ci - now));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow = ci;\\n\\t}\\n\\t//rep(i, m + 1) {\\n\\t//\\trep(j, n + 1) {\\n\\t//\\t\\tif (dp[i][j] != INF)printf(\\\"%4d\\\", dp[i][j]);\\n\\t//\\t\\telse cout << \\\" INF\\\";\\n\\t//\\t}\\n\\t//\\tcout << endl;\\n\\t//}\\n\\tll d = vp.back().second;\\n\\tcout << dp[m][d] + n + 1 - now << endl;\\n}\\n\\n//int n, m;\\n//vector<P> vp;\\n//int sum[100100];\\n//\\n//int main() {\\n//\\tcin >> n >> m;\\n//\\tvp.resize(m);\\n//\\trep(i, m) {\\n//\\t\\tint a, b;\\n//\\t\\tcin >> a >> b;\\n//\\t\\tsum[a]++;\\n//\\t\\tsum[b]--;\\n//\\t}\\n//\\trep(i, n + 2)sum[i + 1] += sum[i];\\n//\\tll ans = 0;\\n//\\trep(i, n + 1) {\\n//\\t\\tif (sum[i] > 0)ans += 3;\\n//\\t\\telse ans++;\\n//\\t}\\n//\\tcout << ans << endl;\\n//}\",\n \"accuracy\": 0.045454545454545456,\n \"time_ms\": 360,\n \"memory_kb\": 7148,\n \"score_of_the_acc\": -0.4907,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1347_2716228\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n \\nusing namespace std;\\n \\n#define rep(i,n) REP(i,0,n)\\n#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)\\n#define repr(i, n) REPR(i, n, 0)\\n#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)\\n#define pb push_back\\n#define all(r) r.begin(),r.end()\\n#define rall(r) r.rbegin(),r.rend()\\n#define fi first\\n#define se second\\n \\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n \\nconst int INF = 1e9;\\nconst ll MOD = 1e9 + 7;\\ndouble EPS = 1e-8;\\n\\nll dp[2][1010];\\n\\nint main(){\\n int n, m;\\n cin >> n >> m;\\n vi c(m+1), d(m+1);\\n rep(i, m) cin >> c[i+1] >> d[i+1]; \\n if(m == 0) {\\n cout << n+1 << endl;\\n return 0;\\n }\\n vector<pii> p(m+1);\\n rep(i, m+1) p[i] = make_pair(c[i], d[i]);\\n sort(all(p));\\n rep(i, m+1) {\\n c[i] = p[i].fi;\\n d[i] = p[i].se;\\n }\\n {\\n rep(i, 1010) {\\n dp[1][i] = 1e18;\\n }\\n REP(i, d[1], 1010) {\\n dp[1][i] = i + i - c[1];\\n }\\n\\n }\\n int cur, nxt;\\n REP(i, 1, m) {\\n cur = i&1;\\n nxt = (i+1)&1;\\n rep(j, 1010) dp[nxt][j] = 1e18;\\n // j番目からk番目まで進んでから、c[i]番目にいく\\n rep(j, 1010) if(dp[cur][j] != 1e18) {\\n REP(k, d[i+1], 1010) {\\n if(j >= k) { // c[i] -> c[i+1]\\n int pos = max(j, c[i+1]);\\n dp[nxt][pos] = min(dp[nxt][pos], dp[cur][j] + c[i+1] - c[i]);\\n }\\n else { // c[i] -> k -> c[i+1]\\n int pos = max(k, c[i+1]);\\n dp[nxt][pos] = min(dp[nxt][pos], dp[cur][j] + abs(c[i] - k) + abs(k - c[i+1]));\\n }\\n }\\n }\\n // rep(j, 20) {\\n // cout << \\\" \\\" << (dp[nxt][j] == 1e18 ? -1 : dp[nxt][j]);\\n // }\\n // cout << endl;\\n }\\n\\n ll ans = 1e18;\\n rep(i, n+1) {\\n ans = min(ans, dp[nxt][i] + n+1-c.back());\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 830,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -1,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1347_2642468\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\n#define int long long\\n#define pb push_back \\n#define pf push_front \\n#define mp make_pair\\n#define fr first\\n#define sc second\\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\\n#define All(v) v.begin(), v.end()\\n \\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\\nconst int INF = 1107110711071107;\\n \\nint N, m;\\nvector<Pii> d;\\nunordered_map<int, int> dp[1001][1001];\\n \\nint dfs(int pre, int now, int n) {\\n if ( n == m ) {\\n return (now-pre + (N+1)-pre);\\n }\\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\\n \\n int ret = dfs(min(pre, d[n].sc), d[n].fr, n+1) + (d[n].fr-now);\\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\\n \\n return dp[pre][now][n] = ret;\\n}\\n \\nsigned main() {\\n cin >> N >> m;\\n \\n Rep(i, m) {\\n int c, b;\\n cin >> c >> b;\\n d.pb(Pii(b, c)); \\n }\\n \\n sort(All(d));\\n \\n if ( m == 0 ) cout << N+1 << endl;\\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 65728,\n \"score_of_the_acc\": -1.0485,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1347_2641900\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define pb push_back \\n#define pf push_front \\n#define mp make_pair\\n#define fr first\\n#define sc second\\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\\n#define All(v) v.begin(), v.end()\\n\\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\\nconst int INF = 1107110711071107;\\n\\nint N, m;\\nvector<Pii> d;\\nunordered_map<int, int> dp[1001][1001];\\n\\nint dfs(int pre, int now, int n) {\\n if ( n == m ) {\\n return (now-pre + (N+1)-pre);\\n }\\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\\n\\n int ret = dfs(min(pre, d[n].sc), d[n].fr, n+1) + (d[n].fr-now);\\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\\n\\n return dp[pre][now][n] = ret;\\n}\\n\\nsigned main() {\\n cin >> N >> m;\\n\\n Rep(i, m) {\\n int c, b;\\n cin >> c >> b;\\n d.pb(Pii(b, c)); \\n }\\n\\n sort(All(d));\\n\\n if ( m == 0 ) cout << N+1 << endl;\\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 65748,\n \"score_of_the_acc\": -1.0488,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1347_2641888\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define pb push_back \\n#define pf push_front \\n#define mp make_pair\\n#define fr first\\n#define sc second\\n#define Rep(i, n) for ( int i = 0 ; i < (n); i++ )\\n#define All(v) v.begin(), v.end()\\n\\ntypedef pair<int, int> Pii; typedef pair<int, Pii> Pip;\\nconst int INF = 1107110711071107;\\n\\nint N, m;\\nvector<Pii> d;\\nunordered_map<int, int> dp[1001][1001];\\n\\nint dfs(int pre, int now, int n) {\\n if ( n == m ) {\\n return (now-pre + (N+1)-pre);\\n }\\n if ( dp[pre][now][n] > 0 ) return dp[pre][now][n];\\n\\n int ret = dfs(pre, d[n].fr, n+1) + (d[n].fr-now);\\n ret = min(ret, dfs(d[n].sc, d[n].fr, n+1) + (now-pre + d[n].fr-pre));\\n\\n return dp[pre][now][n] = ret;\\n}\\n\\nsigned main() {\\n cin >> N >> m;\\n\\n Rep(i, m) {\\n int c, b;\\n cin >> c >> b;\\n d.pb(Pii(b, c)); \\n }\\n\\n sort(All(d));\\n\\n if ( m == 0 ) cout << N+1 << endl;\\n else cout << dfs(d[0].sc, d[0].fr, 1) + d[0].fr << endl;\\n}\",\n \"accuracy\": 0.045454545454545456,\n \"time_ms\": 40,\n \"memory_kb\": 63100,\n \"score_of_the_acc\": -0.9943,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1347_1595101\",\n \"code_snippet\": \"//#include <stdio.h>\\n//#include <iostream>\\n//#include <math.h>\\n//#include <numeric>\\n//#include <vector>\\n//#include <map>\\n//#include <functional>\\n//#include <stdio.h>\\n//#include <array>\\n//#include <algorithm>\\n//#include <string>\\n//#include <assert.h>\\n//#include <stdio.h>\\n//#include <queue>\\n//#include<iomanip>\\n//using namespace std;\\n//\\n//\\n//using namespace std;\\n////\\n////#define N (1<<17) \\n////// update(l,r,v) := [l,r]の区間に対してvを一様に足す. k,a,bは飾り\\n////\\n////struct NODE{\\n////\\tint sum;//更新された値. この値を参照する時は評価が完全に完了しているようにする.\\n////\\tint lazy;\\t//遅延されている値を保存している\\n////\\tNODE(){\\n////\\t\\tsum = lazy = 0;\\n////\\t}\\n////};\\n////\\n////NODE seg[2 * N];\\n////\\n////// inlineつけないと大変なことになるよ!(遅い)\\n////inline void lazy_evaluate_node(int k, int a, int b){\\n////\\tseg[k].sum +=seg[k].lazy;\\n////\\tif (k < N){ // 2*k(左の子番号) < 2*N (節点の数) のイメージで. 末端ノードじゃなきゃ伝搬するのと等価.\\n////\\t\\tseg[2 * k].lazy += seg[k].lazy;\\t//次は君が伝搬してね☆って感じ.\\n////\\t\\tseg[2 * k + 1].lazy += seg[k].lazy;\\n////\\t}\\n////\\tseg[k].lazy = 0;\\n////}\\n////\\n////inline void update_node(int k){ // kの子が既に評価されていることが前提. 末端以外のときしか呼び出さないような位置に書くのでif文要らない.\\n////\\tseg[k].sum = min(seg[2 * k].sum , seg[2 * k + 1].sum);\\n////}\\n////\\n////// update(l,r,v) := [l,r]を更新する. 区間は1-indexed.\\n////void update(int l, int r, int v, int k = 1, int a = 1, int b = N){\\n////\\tlazy_evaluate_node(k, a, b); \\t// とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n////\\n////\\tif (b < l || r < a) //[a,b]と[l,r]が交差している場合\\n////\\t\\treturn;\\n////\\tif (l <= a && b <= r){ // [l,r]が[a,b]を完全に含んでいる場合\\n////\\t\\tseg[k].lazy += v;\\n////\\t\\tlazy_evaluate_node(k, a, b); //一回遅延評価しとかないと都合悪いので.\\n////\\t\\treturn;\\n////\\t}\\n////\\n////\\tint m = (a + b) / 2;\\n////\\tupdate(l, r, v, 2 * k, a, m);\\n////\\tupdate(l, r, v, 2 * k + 1, m + 1, b);\\n////\\tupdate_node(k);\\n////}\\n////\\n////// get(l,r) := [l,r]に対するクエリの答えを得る. 区間は1-indexed.\\n////int get(int l, int r, int k = 1, int a = 1, int b = N){\\n////\\tlazy_evaluate_node(k, a, b); // とりあえず辿ったノードは都合がいいので伝搬しとけ精神.\\n////\\n////\\tif (b < l || r < a) //[a,b]と[l,r]が交差している場合\\n////\\t\\treturn 0;\\n////\\n////\\tif (l <= a && b <= r){ // [l,r]が[a,b]を完全に含んでいる場合\\n////\\t\\treturn seg[k].sum;\\n////\\t}\\n////\\n////\\tint m = (a + b) / 2;\\n////\\tint vl = get(l, r, 2 * k, a, m);\\n////\\tint vr = get(l, r, 2 * k + 1, m + 1, b);\\n////\\tupdate_node(k);\\n////\\treturn min(vl , vr);\\n////}\\n//\\n//\\n//int main() {\\n//\\t//int n;\\n//\\t//cin >> n;\\n//\\t//vector<int> aa(n);\\n//\\t//vector<pair<int,int>>aaa;\\n//\\t//for (int i = 0; i < n; ++i){\\n//\\t//\\tint a, b;\\n//\\t//\\tcin >> a >> b;\\n//\\t//\\taaa.push_back(make_pair(a, b)); \\n//\\t//\\taa[a]++;\\n//\\t//\\taa[b]--;\\n//\\t//}\\n//\\t//vector<int> ans;\\n//\\t//ans.push_back(aa[0]);\\n//\\t//int amin=99999999;\\n//\\t//for(int i=0;i<n;++i){\\n//\\t//\\tans.push_back(ans[i] + aa[i]);\\n//\\t//}\\n//\\n//\\t//RMQ r;\\n//\\t//r.init(65536);\\n//\\t//for (int i = 0; i < 65536;++i){\\n//\\t//\\tr.update(i, ans[i]);\\n//\\t//}\\n//\\n//\\t//cout << r.query(0, 7) << endl; //1\\n//\\t//cout << r.query(3, 6) << endl; //2\\n//\\t//cout << r.query(1, 5) << endl; //1\\n//\\t//cout << r.query(5, 7) << endl; //4\\n//\\t//return 0;\\n//\\n//\\tvector<long long int>times;\\n//\\tfor (int i = 0; i < 7; ++i){\\n//\\t\\tlong long int c;\\n//\\t\\tcin >> c;\\n//\\t\\ttimes.push_back(c);\\n//\\t}\\n//\\tif (times[0] == 0)cout << \\\"YES\\\" << endl;\\n//\\telse{\\n//\\t\\ttimes[0]--;\\n//\\t}\\n//\\n//\\t{\\n//\\t\\tvector<long long int> atimes(times);\\n//\\t\\twhile (1){\\n//\\t\\t\\tauto zero_it = find(atimes.begin(), atimes.end(), 0);\\n//\\t\\t\\tif (zero_it != atimes.end()){//5 3 2 0 4 4 2 \\n//\\t\\t\\t\\tconst int num = zero_it - atimes.begin();\\n//\\t\\t\\t\\tint from = num;\\n//\\t\\t\\t\\twhile (1){\\n//\\t\\t\\t\\t\\tfrom = (from + 1) % 7;\\n//\\t\\t\\t\\t\\tif (from == num)break;\\n//\\t\\t\\t\\t\\tint to = (from + 1) % 7;\\n//\\t\\t\\t\\t\\tif (atimes[from] != 0 && atimes[to] == 0){\\n//\\t\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t\\t}\\n//\\t\\t\\t\\t\\tif (atimes[from] > atimes[to]){\\n//\\t\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t\\t}\\n//\\t\\t\\t\\t\\tlong long int amin = min(atimes[from], atimes[to]);\\n//\\t\\t\\t\\t\\tatimes[from] -= amin;\\n//\\t\\t\\t\\t\\tatimes[to] -= amin;\\n//\\t\\t\\t\\t\\tif (atimes[from] == 0 && atimes[to] == 0){\\n//\\t\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t\\t}\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\tif (all_of(atimes.begin(), atimes.end(), [](const int aaa){return aaa == 0; })){\\n//\\t\\t\\t\\t\\tcout << \\\"YES\\\" << endl;\\n//\\t\\t\\t\\t\\treturn 0;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\telse{\\n//\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\telse{\\n//\\t\\t\\t\\tlong long int aamin = atimes[0];\\n//\\t\\t\\t\\tfor (int i = 0; i < 7; ++i){\\n//\\t\\t\\t\\t\\taamin = min(aamin, atimes[i]);\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\tfor (int i = 0; i < 7; ++i){\\n//\\t\\t\\t\\t\\tatimes[i] -= aamin;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t}\\n//\\t{\\n//\\t\\tvector<long long int> btimes(times);\\n//\\t\\tfor (int i = 0; i < 7; ++i){//times[i]のまえがあいだになる\\n//\\t\\t\\tbtimes = times;\\n//\\t\\t\\tint from = (i + 6) % 7;\\n//\\t\\t\\twhile (1){\\n//\\t\\t\\t\\tfrom = (from + 1) % 7;\\n//\\t\\t\\t\\tif (from == (i + 6) % 7)break;\\n//\\t\\t\\t\\tint to = (from + 1) % 7;\\n//\\t\\t\\t\\tif (btimes[from] != 0 && btimes[to] == 0){\\n//\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\tif (btimes[from] > btimes[to]){\\n//\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\tlong long int amin = min(btimes[from], btimes[to]);\\n//\\t\\t\\t\\tbtimes[from] -= amin;\\n//\\t\\t\\t\\tbtimes[to] -= amin;\\n//\\t\\t\\t\\tif (btimes[from] == 0 && btimes[to] == 0){\\n//\\t\\t\\t\\t\\tbreak;\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t}\\n//\\t\\t\\tif (all_of(btimes.begin(), btimes.end(), [=](int a){return a == 0; })){\\n//\\t\\t\\t\\tcout << \\\"YES\\\" << endl;\\n//\\t\\t\\t\\treturn 0;\\n//\\t\\t\\t}\\n//\\t\\t\\telse{\\n//\\t\\t\\t\\tcontinue;\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t}\\n//\\tcout << \\\"NO\\\" << endl;\\n//\\treturn 0;\\n//}\\n////3 4 4 4 4 4 4\\n\\n#include<stdio.h>\\n#include <iostream>\\n#include <math.h>\\n#include <numeric>\\n#include <vector>\\n#include <map>\\n#include <functional>\\n#include <stdio.h>\\n#include <array>\\n#include <algorithm>\\n#include <string>\\n#include <assert.h>\\n#include <stdio.h>\\n#include <queue>\\n#include<iomanip>\\n#include<bitset>\\n#include<stack>\\nusing namespace std;\\n\\n//7:10\\n//\\n//#define REP(i,n) for(int i=0;i<(int)n;++i)\\n//#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n//#define ALL(c) (c).begin(), (c).end()\\n//\\n//typedef int Weight;\\n//struct Edge {\\n//\\tint src, dst;\\n//\\tWeight weight;\\n//\\tEdge(int src, int dst, Weight weight) :\\n//\\t\\tsrc(src), dst(dst), weight(weight) { }\\n//};\\n//bool operator < (const Edge &e, const Edge &f) {\\n//\\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\\n//\\te.src != f.src ? e.src < f.src : e.dst < f.dst;\\n//}\\n//typedef vector<Edge> Edges;\\n//typedef vector<Edges> Graph;\\n//\\n//typedef vector<Weight> Array;\\n//typedef vector<Array> Matrix;\\n//\\n//#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\\n//Weight maximumFlow(const Graph &g, int s, int t) {\\n//\\tint n = g.size();\\n//\\tMatrix flow(n, Array(n)), capacity(n, Array(n));\\n//\\tREP(u, n) for (auto e = g[u].begin(); e != g[u].end();++e)capacity[e->src][e->dst] += e->weight;\\n//\\n//\\tWeight total = 0;\\n//\\twhile (1) {\\n//\\t\\tqueue<int> Q; Q.push(s);\\n//\\t\\tvector<int> prev(n, -1); prev[s] = s;\\n//\\t\\twhile (!Q.empty() && prev[t] < 0) {\\n//\\t\\t\\tint u = Q.front(); Q.pop();\\n//\\t\\t\\tfor (auto e = g[u].begin(); e != g[u].end(); ++e) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > 0) {\\n//\\t\\t\\t\\tprev[e->dst] = u;\\n//\\t\\t\\t\\tQ.push(e->dst);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t\\tif (prev[t] < 0) return total; // prev[x] == -1 <=> t-side\\n//\\t\\tWeight inc = 999999999;\\n//\\t\\tfor (int j = t; prev[j] != j; j = prev[j])\\n//\\t\\t\\tinc = min(inc, RESIDUE(prev[j], j));\\n//\\t\\tfor (int j = t; prev[j] != j; j = prev[j])\\n//\\t\\t\\tflow[prev[j]][j] += inc, flow[j][prev[j]] -= inc;\\n//\\t\\ttotal += inc;\\n//\\t}\\n//\\treturn total;\\n//}\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst int mod = 1000000007;\\n\\nstruct Mod {\\n\\tlong long int num;\\n\\tMod() : num(0) { ; }\\n\\tMod(long long int n) : num((n % mod + mod) % mod) { ; }\\n\\toperator long long int() { return num; }\\n};\\n\\nMod operator+(Mod a, Mod b) { return Mod((a.num + b.num) % mod); }\\nMod operator-(Mod a, Mod b) { return Mod((mod + a.num - b.num) % mod); }\\nMod operator*(Mod a, Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\nMod operator+=(Mod &a, Mod b) { return a = a + b; }\\nMod operator-=(Mod &a, Mod b) { return a = a - b; }\\nMod operator*=(Mod &a, Mod b) { return a = a * b; }\\nMod operator^(Mod a, int n) {\\n\\tif (n == 0) return Mod(1);\\n\\tMod res = (a * a) ^ (n / 2);\\n\\tif (n % 2) res = res * a;\\n\\treturn res;\\n}\\nMod inv(Mod a) { return a ^ (mod - 2); }\\nMod operator/(Mod a, Mod b) { return a * inv(b); }\\n\\n#define MAX_N 1024000\\n\\nMod fact[MAX_N], factinv[MAX_N];\\nvoid init() {\\n\\tfact[0] = Mod(1); factinv[0] = 1;\\n\\tREP(i, MAX_N - 1) {\\n\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n\\t}\\n}\\nMod comb(int a, int b) {\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\nlong long int memo[20];//nけた\\n\\nlong long int powint(long long int a, int b){\\n\\tif (b == 0)return 1;\\n\\tif (b == 1)return a;\\n\\telse{\\n\\t\\tlong long int ans = 1;\\n\\t\\tlong long int c = powint(a, b / 2);\\n\\t\\tans *= c*c;\\n\\t\\tans *= (b % 2) ? a : 1;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n\\nint backnum[100000][20];\\n\\nstruct Node{\\n\\tNode(int aid):children(),ancs(){\\n\\t\\tid=(aid);\\n\\t\\tfor (int i = 0; i < 20; ++i){\\n\\t\\t\\tancs[i] = -1;\\n\\t\\t}\\n\\t}\\n\\tint id;\\n\\tvector<int>children;\\n\\tarray<int, 20>ancs;\\n};\\n\\nint main()\\n{\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> Sa(N + 1);\\n\\tvector<int>Sum(N);\\n\\tfor (int i = 0; i < M; ++i){\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tif (a < b){\\n\\t\\t\\tSa[a]++;\\n\\t\\t\\tSa[b]--;\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\tint now = 0;\\n\\tfor (int i = 0; i < N; ++i){\\n\\t\\tnow += Sa[i];\\n\\t\\tSum[i] += now;\\n\\t}\\n\\tint a = count_if(Sum.begin(), Sum.end(), [](const int l){return l != 0; });\\n\\tcout << N + 1 + a * 2<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 19120,\n \"score_of_the_acc\": -0.2551,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":794,"cells":{"group_id":{"kind":"string","value":"aoj_1342_cpp"},"problem_description":{"kind":"string","value":"Problem H:\nDon't Burst the Balloon\nAn open-top box having a square bottom is placed on the floor. You see a number of needles vertically planted on its bottom.\nYou want to place a largest possible spheric balloon touching the box bottom, interfering with none of the side walls nor the needles.\nJava Specific:\nSubmitted Java programs may not use \"java.awt.geom.Area\". You may use it for your debugging purposes.\nFigure H.1 shows an example of a box with needles and the corresponding largest spheric balloon. It corresponds to the first dataset of the sample input below.\nFigure H.1. The upper shows an example layout and the lower shows the largest spheric balloon that can be placed.\nInput\nThe input is a sequence of datasets. Each dataset is formatted as follows.\nn\nw\nx\n1\ny\n1\nh\n1\n:\nx\nn\ny\nn\nh\nn\nThe first line of a dataset contains two positive integers,\nn\nand\nw\n, separated by a space.\nn\nrepresents the number of needles, and\nw\nrepresents the height of the side walls.\nThe bottom of the box is a 100 × 100 square. The corners of the bottom face are placed at positions (0, 0, 0), (0, 100, 0), (100, 100, 0), and (100, 0, 0).\nEach of the\nn\nlines following the first line contains three integers,\nx\ni\n,\ny\ni\n, and\nh\ni\n. (\nx\ni\n,\ny\ni\n, 0) and\nh\ni\nrepresent the base position and the height of the\ni\n-th needle. No two needles stand at the same position.\nYou can assume that 1 ≤\nn\n≤ 10, 10 ≤\nw\n≤ 200, 0 <\nx\ni\n< 100, 0 <\ny\ni\n< 100 and 1 ≤\nh\ni\n≤ 200. You can ignore the thicknesses of the needles and the walls.\nThe end of the input is indicated by a line of two zeros. The number of datasets does not exceed 1000.\nOutput\nFor each dataset, output a single line containing the maximum radius of a balloon that can touch the bottom of the box without interfering with the side walls or the needles. The output should not contain an error greater than 0.0001.\nSample Input\n5 16\n70 66 40\n38 52 20\n40 35 10\n70 30 10\n20 60 10\n1 100\n54 75 200\n1 10\n90 10 1\n1 11\n54 75 200\n3 10\n53 60 1\n61 38 1\n45 48 1\n4 10\n20 20 10\n20 80 10\n80 20 10\n80 80 10\n0 0\nOutput for the Sample Input\n26.00000\n39.00000\n130.00000\n49.49777\n85.00000\n95.00000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1342_9782093","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nusing T = long double;\nconst T eps = 1e-8;\nusing Point = complex<T>;\nusing Poly = vector<Point>;\n#define X real()\n#define Y imag()\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\n return fabs(a - b) < eps;\n}\nbool cmp(const Point &a, const Point &b) {\n auto sub = [&](Point a) {\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\n };\n if (sub(a) != sub(b))\n return sub(a) < sub(b);\n return a.Y * b.X < a.X * b.Y;\n}\nstruct Line {\n Point a, b, dir;\n Line() {}\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\n Line(T A, T B, T C) {\n if (eq(A, (T).0)) {\n a = Point(0, C / B), b = Point(1 / C / B);\n } else if (eq(B, (T).0)) {\n a = Point(C / A, 0), b = Point(C / A, 1);\n } else {\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n};\nstruct Segment : Line {\n Segment() {}\n Segment(Point _a, Point _b) : Line(_a, _b) {}\n};\nstruct Circle {\n Point p;\n T r;\n Circle() {}\n Circle(Point _p, T _r) : p(_p), r(_r) {}\n};\n\nistream &operator>>(istream &is, Point &p) {\n T x, y;\n is >> x >> y;\n p = Point(x, y);\n return is;\n}\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\n return os;\n}\nPoint unit(const Point &a) {\n return a / abs(a);\n}\nT dot(const Point &a, const Point &b) {\n return a.X * b.X + a.Y * b.Y;\n}\nT cross(const Point &a, const Point &b) {\n return a.X * b.Y - a.Y * b.X;\n}\nPoint rot(const Point &a, const T &theta) {\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\n sin(theta) * a.X + cos(theta) * a.Y);\n}\nPoint rot90(const Point &a) {\n return Point(-a.Y, a.X);\n}\nT arg(const Point &a, const Point &b, const Point &c) {\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\n if (cross(a - b, c - b) < 0)\n ret = -ret;\n return ret;\n}\n\nPoint Projection(const Line &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Projection(const Segment &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Reflection(const Line &l, const Point &p) {\n return p + (Projection(l, p) - p) * (T)2.;\n}\nint ccw(const Point &a, Point b, Point c) {\n b -= a;\n c -= a;\n if (cross(b, c) > eps)\n return 1; // ccw\n\n if (cross(b, c) < -eps)\n return -1; // cw\n\n if (dot(b, c) < 0)\n return 2; // c,a,b\n\n if (norm(b) < norm(c))\n return -2; // a,b,c\n\n return 0; // a,c,b\n\n}\nbool isOrthogonal(const Line &a, const Line &b) {\n return eq(dot(a.b - a.a, b.b - b.a), (T).0);\n}\nbool isParallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), (T).0);\n}\nbool isIntersect(const Segment &a, const Segment &b) {\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\n}\nint isIntersect(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d > a.r + b.r + eps)\n return 4;\n if (eq(d, a.r + b.r))\n return 3;\n if (eq(d, abs(a.r - b.r)))\n return 1;\n if (d < abs(a.r - b.r) - eps)\n return 0;\n return 2;\n}\nT Dist(const Line &a, const Point &b) {\n Point c = Projection(a, b);\n return abs(c - b);\n}\nT Dist(const Segment &a, const Point &b) {\n if (dot(a.b - a.a, b - a.a) < eps)\n return abs(b - a.a);\n if (dot(a.a - a.b, b - a.b) < eps)\n return abs(b - a.b);\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\n}\nT Dist(const Segment &a, const Segment &b) {\n if (isIntersect(a, b))\n return (T).0;\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\n return res;\n}\nPoint Intersection(const Line &a, const Line &b) {\n T d1 = cross(a.b - a.a, b.b - b.a);\n T d2 = cross(a.b - a.a, a.b - b.a);\n if (eq(d1, (T)0.) and eq(d2, (T)0.))\n return b.a;\n return b.a + (b.b - b.a) * (d2 / d1);\n}\nPoly Intersection(const Circle &a, const Line &b) {\n Poly res;\n T d = Dist(b, a.p);\n if (d > a.r + eps)\n return res;\n Point h = Projection(b, a.p);\n if (eq(d, a.r)) {\n res.push_back(h);\n return res;\n }\n Point e = unit(b.b - b.a);\n T ph = sqrt(a.r * a.r - d * d);\n res.push_back(h - e * ph);\n res.push_back(h + e * ph);\n return res;\n}\nPoly Intersection(const Circle &a, const Segment &b) {\n Line c(b.a, b.b);\n Poly sub = Intersection(a, c);\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\n Poly res;\n rep(i, 0, sub.size()) {\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\n res.push_back(sub[i]);\n }\n }\n return res;\n}\nPoly Intersection(const Circle &a, const Circle &b) {\n Poly res;\n int mode = isIntersect(a, b);\n T d = abs(a.p - b.p);\n if (mode == 4 or mode == 0)\n return res;\n if (mode == 3) {\n T t = a.r / (a.r + b.r);\n res.push_back(a.p + (b.p - a.p) * t);\n return res;\n }\n if (mode == 1) {\n if (b.r < a.r - eps) {\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\n } else {\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\n }\n return res;\n }\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / (T)2.;\n T rs = sqrt(a.r * a.r - rc * rc);\n if (a.r - abs(rc) < eps)\n rs = 0;\n Point e = unit(b.p - a.p);\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\n return res;\n}\nPoly HalfplaneIntersection(vector<Line> &H) {\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\n auto outside = [&](Line &L, Point p) -> bool {\n return cross(L.dir, p - L.a) < -eps;\n };\n deque<Line> deq;\n int sz = 0;\n rep(i, 0, SZ(H)) {\n while (sz > 1 and\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\n return {};\n }\n if (outside(H[i], deq[sz - 1].a)) {\n deq.pop_back();\n sz--;\n } else\n continue;\n }\n deq.push_back(H[i]);\n sz++;\n }\n\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz < 3)\n return {};\n deq.push_back(deq.front());\n Poly ret;\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\n return ret;\n}\n\nT Area(const Poly &a) {\n T res = 0;\n int n = a.size();\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\n return fabs(res / (T)2.);\n}\nT Area(const Poly &a, const Circle &b) {\n int n = a.size();\n if (n < 3)\n return (T).0;\n auto rec = [&](auto self, const Circle &c, const Point &p1,\n const Point &p2) {\n Point va = c.p - p1, vb = c.p - p2;\n T f = cross(va, vb), res = (T).0;\n if (eq(f, (T).0))\n return res;\n if (max(abs(va), abs(vb)) < c.r + eps)\n return f;\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\n return c.r * c.r * arg(vb * conj(va));\n auto u = Intersection(c, Segment(p1, p2));\n Poly sub;\n sub.push_back(p1);\n for (auto &x : u)\n sub.push_back(x);\n sub.push_back(p2);\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\n return res;\n };\n T res = (T).0;\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\n return fabs(res / (T)2.);\n}\nT Area(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d >= a.r + b.r - eps)\n return (T).0;\n if (d <= abs(a.r - b.r) + eps) {\n T r = min(a.r, b.r);\n return M_PI * r * r;\n }\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / (T)2.);\n T res = a.r * a.r * (ath - sin(ath * 2) / (T)2.);\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / (T)2.);\n res += b.r * b.r * (bth - sin(bth * 2) / (T)2.);\n return fabs(res);\n}\nbool isConvex(const Poly &a) {\n int n = a.size();\n int cur, pre, nxt;\n rep(i, 0, n) {\n pre = (i - 1 + n) % n;\n nxt = (i + 1) % n;\n cur = i;\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\n return 0;\n }\n return 1;\n}\nint isContained(const Poly &a,\n const Point &b) { // 0:not contain,1:on edge,2:contain\n\n bool res = 0;\n int n = a.size();\n rep(i, 0, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (p.Y > q.Y)\n swap(p, q);\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\n res ^= 1;\n if (eq(cross(p, q), (T).0) and dot(p, q) < eps)\n return 1;\n }\n return (res ? 2 : 0);\n}\nPoly ConvexHull(Poly &a) {\n sort(ALL(a), [](const Point &p, const Point &q) {\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\n });\n a.erase(unique(ALL(a)), a.end());\n int n = a.size(), k = 0;\n Poly res(n * 2);\n for (int i = 0; i < n; res[k++] = a[i++]) {\n while (k >= 2 and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\n while (k >= t and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n res.resize(k - 1);\n return res;\n}\nT Diam(const Poly &a) {\n int n = a.size();\n int x = 0, y = 0;\n rep(i, 1, n) {\n if (a[i].Y > a[x].Y)\n x = i;\n if (a[i].Y < a[y].Y)\n y = i;\n }\n T res = abs(a[x] - a[y]);\n int i = x, j = y;\n do {\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\n i = (i + 1) % n;\n else\n j = (j + 1) % n;\n chmax(res, abs(a[i] - a[j]));\n } while (i != x or j != y);\n return res;\n}\nPoly Cut(const Poly &a, const Line &l) {\n int n = a.size();\n Poly res;\n rep(i, 0, n) {\n Point p = a[i], q = a[(i + 1) % n];\n if (ccw(l.a, l.b, p) != -1)\n res.push_back(p);\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\n res.push_back(Intersection(Line(p, q), l));\n }\n return res;\n}\n\nT Closest(Poly &a) {\n int n = a.size();\n if (n <= 1)\n return 0;\n sort(ALL(a), [&](Point a, Point b) {\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\n });\n Poly buf(n);\n auto rec = [&](auto self, int lb, int rb) -> T {\n if (rb - lb <= 1)\n return (T)INF;\n int mid = (lb + rb) >> 1;\n auto x = a[mid].X;\n T res = min(self(self, lb, mid), self(self, mid, rb));\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\n [&](auto p, auto q) { return p.Y < q.Y; });\n int ptr = 0;\n rep(i, lb, rb) {\n if (abs(a[i].X - x) >= res)\n continue;\n rep(j, 0, ptr) {\n auto sub = a[i] - buf[ptr - 1 - j];\n if (sub.Y >= res)\n break;\n chmin(res, abs(sub));\n }\n buf[ptr++] = a[i];\n }\n return res;\n };\n return rec(rec, 0, n);\n}\n\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\n p /= (A + B + C);\n T r = Dist(Line(a, b), p);\n return Circle(p, r);\n}\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\n Line l1((a + b) / (T)2., (a + b) / (T)2. + (b - a) * Point(0, 1));\n Line l2((b + c) / (T)2., (b + c) / (T)2. + (c - b) * Point(0, 1));\n Point p = Intersection(l1, l2);\n return Circle(p, abs(p - a));\n}\nPoly tangent(const Point &a, const Circle &b) {\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\n}\nvector<Line> tangent(const Circle &a, const Circle &b) {\n vector<Line> res;\n T d = abs(a.p - b.p);\n if (eq(d, (T)0.))\n return res;\n Point u = unit(b.p - a.p);\n Point v = u * Point(0, 1);\n for (int t : {-1, 1}) {\n T h = (a.r + b.r * t) / d;\n if (eq(h * h, (T)1.)) {\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\n a.p + (h > 0 ? u : -u) * a.r + v));\n } else if (1 > h * h) {\n Point U = u * h, V = v * sqrt(1 - h * h);\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\n }\n }\n return res;\n}\n\n/**\n * @brief Geometry\n */\n\nint main() {\nwhile(1) {\n const long double L = 100.0L;\n int N;\n long double W;\n cin >> N >> W;\n if (N == 0) return 0;\n vector<Point> P(N);\n vector<long double> H(N);\n rep(i,0,N) {\n long double x, y;\n cin >> x >> y;\n P[i] = Point(x,y);\n cin >> H[i];\n }\n auto Judge = [&](long double M) -> bool {\n vector<Circle> C(N);\n rep(i,0,N) {\n if (M <= H[i]) C[i] = Circle(P[i],M);\n else C[i] = Circle(P[i],sqrt(M*H[i]*2.0L - H[i]*H[i]));\n }\n long double D;\n if (M <= W) D = M;\n else D = sqrt(M*W*2.0L - W*W);\n if (D >= 50.0) return false;\n vector<Segment> S(4);\n S[0] = Segment(Point(D,D),Point(D,L-D));\n S[1] = Segment(Point(D,D),Point(L-D,D));\n S[2] = Segment(Point(L-D,D),Point(L-D,L-D));\n S[3] = Segment(Point(D,L-D),Point(L-D,L-D));\n vector<Point> Cand;\n Cand.push_back(Point(D,D));\n Cand.push_back(Point(L-D,D));\n Cand.push_back(Point(D,L-D));\n Cand.push_back(Point(L-D,L-D));\n rep(i,0,4) {\n rep(j,0,N) {\n auto V = Intersection(C[j],S[i]);\n for (auto VP : V) Cand.push_back(VP);\n }\n }\n rep(i,0,N) {\n rep(j,i+1,N) {\n auto V = Intersection(C[i],C[j]);\n for (auto VP : V) {\n if (D <= VP.real() && VP.real() <= L-D && D <= VP.imag() && VP.imag() <= L-D) Cand.push_back(VP);\n }\n }\n }\n for (auto PP : Cand) {\n bool check = true;\n rep(i,0,N) {\n if (abs(C[i].p-PP) < C[i].r - eps) {\n check = false;\n break;\n }\n }\n if (check) return true;\n }\n return false;\n };\n long double OK = 0.0L, NG = 140.0;\n rep(_,0,100) {\n long double MID = (OK + NG) / 2;\n if (Judge(MID)) OK = MID;\n else NG = MID;\n }\n printf(\"%.12Lf\\n\",(OK+NG)/2.0L);\n}\n}","accuracy":1,"time_ms":630,"memory_kb":3560,"score_of_the_acc":-0.4338,"final_rank":6},{"submission_id":"aoj_1342_8526701","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\n#define X(p) real(p)\n#define Y(p) imag(p)\nusing R = double;\nusing P = complex<R>;\nusing VP = vector<P>;\n\nconst R EPS = 1e-7;\nconst R pi = acos(-1.0);\n\nstruct C {\n P p;\n R r;\n C() {}\n C(P p, R r) : p(p), r(r) {}\n};\n\nP rot(P p, R t) {\n return p * P(cos(t), sin(t));\n}\n\nR dot(P p, P q) {\n return X(p) * X(q) + Y(p) * Y(q);\n}\n\nR dist(P p, P q) {\n return abs(p - q);\n}\n\nVP crosspoint(C c1, C c2) {\n R d = abs(c1.p - c2.p);\n R a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n R t = atan2(Y(c2.p) - Y(c1.p), X(c2.p) - X(c1.p));\n VP ret;\n if (d < max(c1.r, c2.r) - min(c1.r, c2.r) || c1.r + c2.r < d)\n return ret;\n P p1 = c1.p + rot(P(c1.r, 0.0), t + a);\n P p2 = c1.p + rot(P(c1.r, 0.0), t - a);\n ret.eb(p1), ret.eb(p2);\n return ret;\n}\n\nint main() {\n auto calc = [](double h, double r) {\n chmin(h, r);\n return sqrt(r * r - (r - h) * (r - h));\n };\n auto cx = [](C c, R x) {\n VP ret;\n R d = abs(X(c.p) - x);\n if (d > c.r)\n return ret;\n R h = sqrt(c.r * c.r - d * d);\n ret.eb(x, Y(c.p) - h);\n ret.eb(x, Y(c.p) + h);\n return ret;\n };\n auto cy = [](C c, R y) {\n VP ret;\n R d = abs(Y(c.p) - y);\n if (d > c.r)\n return ret;\n R w = sqrt(c.r * c.r - d * d);\n ret.eb(X(c.p) - w, y);\n ret.eb(X(c.p) + w, y);\n return ret;\n };\n while (1) {\n int n, w;\n cin >> n >> w;\n if (!n)\n break;\n vector<int> x(n), y(n), h(n);\n rep(i, n) cin >> x[i] >> y[i] >> h[i];\n VP pn(n);\n rep(i, n) pn[i] = P(x[i], y[i]);\n double ok = 0, ng = 100000;\n rep(ti, 100) {\n double mid = (ok + ng) / 2;\n double dw = calc(w, mid);\n if (dw > 50) {\n ng = mid;\n continue;\n }\n vector<R> dn(n);\n rep(i, n) dn[i] = calc(h[i], mid);\n VP ls{P(50, 50)};\n rep(i, n) {\n C ci(pn[i], calc(h[i], mid));\n VP tmp;\n each(p, cx(ci, dw)) tmp.eb(p);\n each(p, cx(ci, 100 - dw)) tmp.eb(p);\n each(p, cy(ci, dw)) tmp.eb(p);\n each(p, cy(ci, 100 - dw)) tmp.eb(p);\n rep(j, n) if (i != j) each(p, crosspoint(ci, C(pn[j], dn[j]))) tmp.eb(p);\n if (empty(tmp))\n ls.eb(pn[i] + P(mid, 0));\n each(p, tmp) ls.eb(p);\n }\n bool f = false;\n R bl = dw - EPS, br = 100 - dw + EPS;\n each(p, ls) {\n bool fl = (bl < min(X(p), Y(p)) && max(X(p), Y(p)) < br);\n rep(i, n) fl &= dist(p, pn[i]) > dn[i] - EPS;\n if (fl)\n f = true;\n }\n (f ? ok : ng) = mid;\n }\n cout << ok << endl;\n }\n}","accuracy":1,"time_ms":980,"memory_kb":4024,"score_of_the_acc":-1.0062,"final_rank":16},{"submission_id":"aoj_1342_7236025","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\n//vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\ntemplate<typename T> vector<T> inv_perm(const vector<T>&ord){\n vector<T>inv(ord.size());\n for(int i=0;i<ord.size();i++)inv[ord[i]] = i;\n return inv;\n}\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\nll modulo(ll n,ll d){return (n%d+d)%d;};\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\n\ntemplate <typename F>\nclass\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\n [[nodiscard]]\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\nFixPoint final : private F\n{\npublic:\n template <typename G>\n explicit constexpr FixPoint(G&& g) noexcept\n : F{std::forward<G>(g)}\n {}\n\n template <typename... Args>\n constexpr decltype(auto)\n operator()(Args&&... args) const\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n}; // class FixPoint\n\n\n#if defined(__cpp_deduction_guides)\ntemplate <typename F>\nFixPoint(F&&)\n -> FixPoint<std::decay_t<F>>;\n#endif // defined(__cpp_deduction_guides)\n\n\nnamespace\n{\n template <typename F>\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n# if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n __attribute__((warn_unused_result))\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\n _Check_return_\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n inline constexpr decltype(auto)\n makeFixPoint(F&& f) noexcept\n{\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\n}\n} // namespace\n\nusing Real = long double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, PI = acos((Real)(-1.0));\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\ninline bool eq(Point a, Point b) { return fabs(b - a) < EPS; }\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, Point &p) {\n return os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\nPoint rotate(Real theta, const Point &p) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nnamespace std {\n bool operator<(const Point& a, const Point& b) {\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b): a(a), b(b) {}\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" to \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\nstruct Circle {\n Point c;\n Real r;\n Circle() = default;\n Circle(Point c, Real r): c(c), r(r) {}\n\n friend ostream &operator<<(ostream &os, Circle &c) {\n return os << c.c << \": \" << c.r;\n }\n\n friend istream &operator>>(istream &is, Circle &c) {\n return is >> c.c >> c.r;\n }\n};\n\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - real(b) * imag(a);\n}\n\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if (cross(b, c) > EPS) return +1; // COUNTER_CLOCKWISE\n if (cross(b, c) < -EPS) return -1; // CLOCKWISE\n if (dot(b, c) < 0) return +2; // ONLINE_BACK\n if (norm(b) < norm(c)) return -2; // ONLINE_FRONT\n return 0; // ON_SEGMENT\n}\n\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\nbool intersect(const Segment &s, const Segment&t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nbool intersect(const Line &l, const Segment& s) {\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nint intersect(const Circle &c, const Circle &d) {\n Real dis = fabs(c.c - d.c);\n\n if (dis > c.r + d.r + EPS) return 4;\n else if (eq(dis, c.r + d.r)) return 3;\n else if (eq(dis, abs(c.r - d.r))) return 1;\n else if (dis + min(c.r, d.r) < max(c.r, d.r) - EPS) return 0;\n else return 2;\n}\n\nbool parallel(const Line &a, const Line &b) {\n return abs(cross(a.b - a.a, b.b - b.a)) < EPS;\n}\n\nbool orthogonal(const Line &a, const Line &b) {\n return abs(dot(a.b - a.a, b.b - b.a)) < EPS;\n}\n\nPoint projection(const Line& s, const Point &p) {\n double t = dot(p - s.a, s.b - s.a) / norm(s.b - s. a);\n return s.a + (s.b - s.a) * t;\n}\n\nPoint projection(const Segment& l, const Point &p) {\n return projection(Line(l), p);\n}\n\nPoint reflection(const Line &l, const Point &p) {\n Point r = projection(l, p);\n return p + (r - p) * 2;\n}\n\nReal distance(const Line &l, const Point &p) {\n Point r = projection(l, p);\n return fabs(p - r);\n}\n\nReal distance(const Segment&s, const Point &p) {\n Point r = projection(s, p);\n if (intersect(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\nReal distance(const Segment& a, const Segment& b) {\n if (intersect(a, b)) return 0;\n return min({\n distance(a, b.a),\n distance(a, b.b),\n distance(b, a.a),\n distance(b, a.b)\n });\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\nPoint crosspoint(const Segment& l, const Segment& m) {\n return crosspoint(Line(l), Line(m));\n}\n\nLine bisector_of_angle(const Point& a, const Point& b, const Point& c) {\n Real d_ab = fabs(a - b);\n Real d_bc = fabs(b - c);\n Point c_ = b + (c - b) * d_ab / d_bc;\n\n return Line(b, (a + c_) * 0.5);\n}\n\nLine bisector(const Point& a, const Point& b) {\n Point c = (a + b) * 0.5;\n Point d = c + rotate(PI / 2, b - c);\n\n return Line(c, d);\n}\n\nint intersect(const Circle &c, const Line &l) {\n Real d = distance(l, c.c);\n\n if (d > c.r + EPS) return 0;\n if (eq(d, c.r)) return 1;\n return 2;\n}\n\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\n Real d = distance(l, c.c);\n\n Point p = projection(l, c.c);\n if (intersect(c, l) == 1) return { p, p };\n\n Real d2 = sqrt(c.r * c.r - d * d);\n Point v = (l.a - l.b) * (1.0 / fabs(l.a - l.b));\n\n return { p + d2 * v, p - d2 * v };\n}\n\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n Real d = fabs(c1.c - c2.c);\n Real x1 = (c1.r * c1.r + d * d - c2.r * c2.r) / 2 / d;\n Real y = sqrt(c1.r * c1.r - x1 * x1);\n\n Point base = (c2.c * x1 + c1.c * (d - x1)) * (1.0 / d);\n Point v = rotate(PI / 2, c1.c - base);\n v = v / fabs(v);\n\n return { base + v * y, base - v * y };\n}\n\npair<Point, Point> tangent(const Circle &c, const Point &p) {\n Real d = fabs(c.c - p);\n Real d2 = sqrt(d * d - c.r * c.r);\n Real a = acos(d2 / d);\n\n\n Point q = c.c - p;\n q = q / fabs(q);\n\n// cout << d << \" \" << d2 << \" \" << a << \" \" << q << endl;\n return {\n p + rotate(a, q) * d2,\n p + rotate(-a, q) * d2\n };\n}\n\nvector<Segment> common_tangent(Circle c1, Circle c2) {\n int isect = intersect(c1, c2);\n Real d = fabs(c1.c - c2.c);\n Point v = (c2.c - c1.c) / d;\n\n vector<Segment> res;\n\n if (isect == 0) {\n return {};\n } else if (isect == 1) {\n auto [p1, p2] = crosspoint(c1, Line(c1.c, c2.c));\n if (eq(fabs(p2 - c2.c), c2.r)) swap(p1, p2);\n\n Point v = p1 + rotate(PI/2, c2.c - p1);\n return { Segment(p1, v) };\n } else if (isect == 2) {\n } else if (isect == 3) {\n auto [p1, p2] = crosspoint(c1, c2);\n res.emplace_back(p1, rotate(PI / 2, c1.c - p1) + p1);\n } else {\n Real a = d * c1.r / (c1.r + c2.r);\n Point p = c1.c + v * a;\n\n Real d1 = sqrt(a * a - c1.r * c1.r), d2 = sqrt(norm(p - c2.c) - c2.r * c2.r);\n Real theta = acos(d1 / a);\n\n// cout << d << endl;\n// cout << a << \" \" << d1 << \" \" << d2 << \" \" << theta << \": \" << p << endl;\n\n Point e = (c1.c - p) * (1.0 / fabs(c1.c - p));\n Point e1 = rotate(theta, e), e2 = rotate(-theta, e);\n\n res.emplace_back(p + e1 * d1, p - e1 * d2);\n res.emplace_back(p + e2 * d1, p - e2 * d2);\n }\n\n if (eq(c1.r, c2.r)) {\n Point e = rotate(PI / 2, v);\n res.push_back(Segment(c1.c + e * c1.r, c2.c + e * c1.r));\n res.push_back(Segment(c1.c - e * c1.r, c2.c - e * c1.r));\n return res;\n }\n\n if (c1.r > c2.r) swap(c1, c2);\n\n v = c1.c - c2.c;\n Point p = v * (1.0 / (c2.r - c1.r)) * c2.r + c2.c;\n\n auto [q1, q2] = tangent(c1, p);\n res.emplace_back(q1, crosspoint(c2, Line(p, q1)).first);\n res.emplace_back(q2, crosspoint(c2, Line(p, q2)).first);\n\n return res;\n}\n\nusing Polygon = vector<Point>;\n\nistream& operator>>(istream& is, Polygon &p) {\n for (int i = 0; i < p.size(); i++) is >> p[i];\n return is;\n}\n\nostream& operator<<(ostream& os, Polygon &p) {\n for (int i = 0; i < p.size(); i++) os << p[i];\n return os;\n}\n\nReal area(const Polygon& p) {\n Real res = 0;\n for (int i = 0; i < p.size(); i++) {\n res += cross(p[i], p[(i + 1) % p.size()]);\n }\n return abs(res)/2;\n}\n\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(fabs(cross(a,b)) < EPS and dot(a,b) < EPS) return 1;\n if(a.imag()>b.imag()) swap(a,b);\n if(a.imag() < EPS and EPS < b.imag() and cross(a,b) > EPS ) {\n// cout << a << \" --- \" << b << \": \" << cross(a, b) << endl;\n x = !x;\n }\n }\n return (x?2:0);\n}\n\nPolygon convex_hull(Polygon Q) {\n sort(ALL(Q));\n\n Polygon upper({Q[0]}), lower({Q[0]});\n\n rep(i, 1, Q.size()) {\n while (upper.size() >= 2) {\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\n if (_ccw == 1) {\n upper.pop_back();\n } else {\n break;\n }\n }\n if (upper.size() <= 1) {\n upper.push_back(Q[i]);\n } else if (upper.size() > 1) {\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\n if (_ccw == -1 || _ccw == -2) {\n upper.push_back(Q[i]);\n }\n }\n }\n rep(i, 1, Q.size()) {\n while (lower.size() >= 2) {\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\n if (_ccw == -1) {\n lower.pop_back();\n } else {\n break;\n }\n }\n\n if (lower.size() <= 1) {\n lower.push_back(Q[i]);\n } else if (lower.size() > 1) {\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\n if (_ccw == 1 || _ccw == -2) {\n lower.push_back(Q[i]);\n }\n }\n }\n\n Polygon ret;\n\n rep(i, 0, lower.size()) {\n ret.push_back(lower[i]);\n// cout << lower[i] << endl;\n }\n\n// cout << \" | \" << endl;\n\n rrep(i, 0, upper.size()) {\n if (!eq(lower[0], upper[i]) && !eq(lower.back(), upper[i]))\n ret.push_back(upper[i]);\n// cout << upper[i] << endl;\n }\n\n int start = 0;\n\n// cout << ret.size() << endl;\n rep(i, 0, ret.size()) {\n if (ret[i].imag() < ret[start].imag() || (eq(ret[i].imag(), ret[start].imag()) && ret[i].real() < ret[start].real())) {\n start = i;\n }\n }\n\n cout << ret.size() << endl;\n rep(i, 0, ret.size()) {\n auto p = ret[(i + start) % ret.size()];\n cout << (int)p.real() << \" \" << (int)p.imag() << endl;\n }\n\n return ret;\n}\n\nReal closest_pair(vector<Point> &pts, int l, int r) {\n int m = (l + r) / 2;\n if (r - l <= 1) {\n return INF;\n } else if (r - l == 2) {\n if (imag(pts[l]) > imag(pts[l + 1])) swap(pts[l], pts[l + 1]);\n return fabs(pts[l] - pts[l + 1]);\n }\n\n Real mid = pts[m].real();\n Real d = min(closest_pair(pts, l, m), closest_pair(pts, m, r));\n\n inplace_merge(pts.begin() + l, pts.begin() + m, pts.begin() + r, [](const Point &a, const Point& b) {\n return a.imag() < b.imag();\n });\n\n vector<Point> ret;\n\n for (int i = l; i < r; i++) {\n if (fabs(pts[i].real() - mid) >= d) continue;\n\n for (int j = ret.size() - 1; j >= 0; j--) {\n if (fabs(imag(ret[j]) - imag(pts[i])) >= d) break;\n chmin(d, fabs(ret[j] - pts[i]));\n }\n\n ret.emplace_back(pts[i]);\n }\n\n return d;\n}\n\nint main() {\n cout << fixed << setprecision(5);\n\n int n;\n Real w;\n while (cin >> n >> w && n != 0) {\n vector<Point> needle(n);\n vector<Real> h(n);\n rep(i, 0, n) {\n cin >> needle[i] >> h[i];\n }\n\n auto check = [&](Real r) {\n// cout << r << endl;\n Polygon rect(4);\n if (r <= w) {\n rect = Polygon({\n Point(r, r), Point(100 - r, r), Point(100 - r, 100 - r), Point(r, 100 - r)\n });\n } else {\n Real d = sqrt(r * r - (r - w) * (r - w));\n rect = Polygon({\n Point(d, d), Point(100 - d, d), Point(100 - d, 100 - d), Point(d, 100 - d)\n });\n }\n if (rect[0].real() > rect[1].real() + EPS) return false;\n// cout << \"rect: \" << rect[0] << \" - \" << rect[2] << endl;\n\n vector<Circle> cirs(n);\n rep(i, 0, n) {\n Real d;\n if (r <= h[i]) d = r;\n else d = sqrt(r * r - (r - h[i]) * (r - h[i]));\n\n cirs[i] = Circle(needle[i], d);\n// cout << \"circle: \" << needle[i] << \" \" << d << endl;\n bool out = true;\n rep(j, 0, 4) {\n if (fabs(cirs[i].c - rect[j]) > cirs[i].r - EPS) out = false;\n }\n if (out) return false;\n }\n\n vector<Point> cands({rect[0], rect[1], rect[2], rect[3]});\n rep(i, 0, n) {\n rep(j, i + 1, n) {\n if (!intersect(cirs[i], cirs[j])) continue;\n\n auto [p1, p2] = crosspoint(cirs[i], cirs[j]);\n cands.push_back(p1);\n if (!eq(p1, p2)) cands.push_back(p2);\n }\n rep(j, 0, 4) {\n Segment sg(rect[j], rect[(j + 1) % 4]);\n if (!intersect(cirs[i], sg)) continue;\n\n auto [p1, p2] = crosspoint(cirs[i], sg);\n cands.push_back(p1);\n if (!eq(p1, p2)) cands.push_back(p2);\n }\n }\n\n for (auto &p : cands) {\n if (!(rect[0].real() - EPS < p.real() && p.real() < real(rect[2]) + EPS&&\n imag(rect[0]) - EPS < imag(p) && imag(p) < imag(rect[2]) + EPS)) {\n continue;\n }\n\n bool ok = true;\n rep(i, 0, n) {\n if (fabs(p - cirs[i].c) < cirs[i].r - EPS) {\n ok = false;\n break;\n }\n }\n if (ok) return true;\n }\n\n return false;\n };\n\n Real l = 1, r = (50 * 50 + w * w) / 2 / w, m;\n rep(_, 0, 35) {\n m = (l + r) / 2;\n if (check(m)) l = m;\n else r = m;\n }\n cout << l << endl;\n }\n}","accuracy":1,"time_ms":650,"memory_kb":3840,"score_of_the_acc":-0.7546,"final_rank":10},{"submission_id":"aoj_1342_6012521","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long int;\n//using Int=__int128;\n#define ALL(A) A.begin(),A.end()\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\n//→ ↓ ← ↑ \nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\n//右上から時計回り\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\n//long double EPS = 1e-6;\n//long double PI = acos(-1);\n//const ll INF=(1LL<<62);\nconst int MAX=(1<<30);\nconstexpr ll MOD=1000000000+7;\n//constexpr ll MOD=998244353;\n\n\ninline void bin101(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n}\n\nusing Graph=vector<vector<int>>;\n\ntemplate<typename T >\nstruct edge {\n\tint to;\n\tT cost;\n\tedge()=default;\n\tedge(int to, T cost) : to(to), cost(cost) {}\n\n};\ntemplate<typename T>\nusing WeightGraph=vector<vector<edge<T>>>;\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n\treturn vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n\tauto v=vmake(args...);\n\treturn vector<decltype(v)>(n,move(v));\n}\n////////////////////////////\n// マクロや型\n////////////////////////////\n\nusing DD=long double;\n\nconst DD EPS=1e-9;\nconst DD INF=1e50;\nconst DD PI=acosl(-1.0);\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\n\n#define X real()\n#define Y imag()\n\n\n//点\nusing Point=complex<DD>;\nistream &operator>>(istream &is, Point &p) {\n DD x,y;\n is>>x>>y;\n p=Point(x,y);\n return is;\n}\n\n//点a→点bの線分\n//aとbが等しい時、色々バグるから注意!\nstruct Segment{\n Point a,b;\n Segment()=default;\n Segment(Point a,Point b) :a(a),b(b){}\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){} \n};\nusing Line=Segment;\n\n//円\nstruct Circle{\n Point p;\n DD r;\n Circle()=default;\n Circle(Point p,DD r):p(p),r(r){}\n};\n\nusing Polygon=vector<Point>;\n\n////////////////////////////\n// 基本計算\n////////////////////////////\n\n//度→ラジアン\ninline DD torad(const DD deg){return deg*PI/180;}\n//ラジアン→度\ninline DD todeg(const DD rad){return rad*180/PI;}\n//内積 |a||b|cosθ\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\n//外積 |a||b|sinθ\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\n//ベクトルpを反時計回りにtheta(ラジアン)回転\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\n\n//余弦定理 cos(角度abc(ラジアン))を返す\n//長さの対応に注意 ab:辺abの長さ\n//verify:https://codeforces.com/gym/102056/problem/F\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\n}\n\ninline bool xy_sort(const Point &a,const Point &b){\n if(a.X+EPS<b.X) return true;\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\n return false;\n}\ninline bool yx_sort(const Point &a,const Point &b){\n if(a.Y+EPS<b.Y) return true;\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\n return false;\n}\nnamespace std{\n inline bool operator<(const Point &a,const Point &b)noexcept{\n return xy_sort(a,b);\n }\n}\n//DDの比較関数\n//map<DD,vector<pii>,DDcom>\nstruct DDcom{\n bool operator()(const DD a, const DD b) const noexcept {\n return a+EPS<b;\n }\n};\n\n\n////////////////////////////\n// 平行や直交\n////////////////////////////\n\nbool isOrthogonal(const Point &a,const Point &b){\n return EQ(dot(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isOrthogonal(const Segment &s,const Segment &t){\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\n}\nbool isParallel(const Point &a,const Point &b){\n return EQ(cross(a,b),0.0);\n}\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool isParallel(const Segment &s,const Segment &t){\n return EQ(cross(s.a-s.b,t.a-t.b),0);\n}\n//線分a→bに対して点cがどの位置にあるか\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n//線分a→bの端点にcがあるなら0と判定されるはず\nint ccw(const Point &a,Point b,Point c){\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\n b-=a;c-=a;\n if(cross(b,c)>EPS) return 1;\n if(cross(b,c)<-EPS) return -1;\n if(dot(b,c)<-EPS) return 2;\n if(LS(norm(b),norm(c))) return -2;\n return 0;\n}\n\n////////////////////////////\n// 射影と反射\n////////////////////////////\n\n//射影\n//直線lに点pから垂線を引いたときの交点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint project(const Point &p,const Line &l){\n Point base=l.b-l.a;\n DD r=dot(p-l.a,base)/norm(base);\n return l.a+base*r;\n}\n//反射\n//直線lに対して点pと対称な点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflect(const Point &p,const Line &l){\n return p+(project(p,l)-p)*(DD)2.0;\n}\n//反射\n//直線lに対して線分sと対称な線分(直線でも使える)\n//verify:https://onlinejudge.u-aizu.ac.jp/solutions/problem/1171/review/6009447/bin101/C++17\nSegment reflect(const Segment &s,const Line &l){\n return Segment(reflect(s.a,l) , reflect(s.b,l));\n}\n\n////////////////////////////\n// 点との距離\n////////////////////////////\n\n//点と直線の距離\nDD DistPL(const Point &p,const Line &l){\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\n}\n//点と線分の距離\nDD DistPS(const Point &p,const Segment &s){\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\n return DistPL(p,s);\n}\n\n////////////////////////////\n// 線分と直線\n////////////////////////////\n\n//線分a-b,c-dは交差するか?\n//接する場合も交差すると判定\n//接する場合は交差しないとするなら<=を<に変換\nbool intersect(const Point &a,const Point &b,const Point &c,const Point &d){\n return(ccw(a,b,c)*ccw(a,b,d)<=0 && ccw(c,d,a)*ccw(c,d,b)<=0);\n}\n//線分s,tは交差するか？\n//接する場合も交差すると判定\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B&lang=ja\n//接する場合は交差しないとするならintersectの<=を<に変換\nbool intersect(const Segment &s,const Segment &t){\n return intersect(s.a,s.b,t.a,t.b);\n}\n// 2直線の交点\n// 線分の場合はintersectをしてから使う\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C&lang=ja\nPoint crossPoint(const Line &s,const Line &t){\n Point base=t.b-t.a;\n DD d1=cross(base,t.a-s.a);\n DD d2=cross(base,s.b-s.a);\n if(EQ(d1,0) and EQ(d2,0)) return s.a; //同じ直線\n if(EQ(d2,0)) assert(false); //交点がない\n return s.a+d1/d2*(s.b-s.a);\n}\n//線分と線分の距離\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D&lang=ja\nDD Dist(const Segment &s,const Segment &t){\n if(intersect(s,t)) return 0.0;\n return min(min(DistPS(t.a,s),DistPS(t.b,s)),min(DistPS(s.a,t),DistPS(s.b,t)) );\n}\nbool issame(const Line &l,const Line &m){\n if (GR(abs(cross(m.a - l.a, l.b - l.a)),0) ) return false;\n if (GR(abs(cross(m.b - l.a, l.b - l.a)),0) ) return false;\n return true;\n}\n\n////////////////////////////\n// 円\n////////////////////////////\n//直線lと円Cの交点\n//l.aにより近い方がindexが小さい\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nvector<Point> crossPointLC(const Line &l,const Circle &c){\n vector<Point> ret;\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\n Point pr=project(c.p,l);\n Point e=(l.b-l.a)/(abs(l.b-l.a));\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\n ret.push_back(pr-e*base);\n ret.push_back(pr+e*base);\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\n return ret;\n}\n//線分sと円cの交点\n//交点がないときは空ベクトルを返す\n//線分の端が交わる場合も交点とみなす\n//s.aにより近い方がindexが小さい\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\n vector<Point> ret;\n if(DistPS(c.p,s)>c.r+EPS) return ret;\n auto koho=crossPointLC(s,c);\n for(auto p:koho){\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\n }\n return ret;\n}\n\n//円aと円bの共通接線の数\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\nint intersect(const Circle &a,const Circle &b){\n DD d=abs(a.p-b.p);\n if(GR(d,a.r+b.r)) return 4;\n if(EQ(d,a.r+b.r)) return 3;\n if(EQ(d,abs(a.r-b.r))) return 1;\n if(LS(d,abs(a.r-b.r))) return 0;\n return 2;\n}\n\n//円aと円bの交点\n//交点がないときは空ベクトルを返す\n//\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nvector<Point> crossPoint(const Circle &a,const Circle &b){\n vector<Point> ret;\n if(GR(abs(a.p-b.p),a.r+b.r)) return ret; //離れている\n DD d=abs(a.p-b.p);\n //cerr<<(a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)<<endl;\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\n DD t=arg(b.p-a.p);\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\n return ret;\n}\n\n//点pから円cに接線を引いたときの接点\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F&lang=ja\nvector<Point> TanLine(const Point &p,const Circle &c){\n vector<Point> ret;\n DD d=abs(p-c.p);\n if(LS(d,c.r)) return ret; //pがcの内部にある場合\n if(EQ(d,c.r)){\n ret.push_back(p);\n return ret; //円の線上にある場合\n } \n return crossPoint(c,Circle(p,sqrt(d*d-c.r*c.r)));\n}\n\n//円a,bの共通接線\n//https://www.slideshare.net/kujira16/ss-35861169\n//Line.aは円aと接線の交点\n//(接線と円bの交点)と(接線と円aの交点)が違う場合はLine.bは(接線と円bの交点)\n//一致する場合は円aの中心からLine.aに向かうベクトルを反時計回りに90度回転したものを\n//Line.aに足したもの\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2201\nvector<Line> TanLine(const Circle &a,const Circle &b){\n DD d=abs(a.p-b.p);\n vector<Line> ret;\n //外接線\n if(intersect(a,b)>=2){\n if(EQ(a.r,b.r)){\n Point up=polar(a.r,arg(b.p-a.p)+PI/2);\n ret.emplace_back(a.p+up,b.p+up);\n ret.emplace_back(a.p-up,b.p-up);\n }else{\n Point q=(a.p*b.r-b.p*a.r)/(b.r-a.r);\n auto as=TanLine(q,a);\n auto bs=TanLine(q,b);\n assert(as.size()==2 and bs.size()==2);\n for(int i=0;i<2;i++){\n ret.emplace_back(as[i],bs[i]);\n }\n }\n }else if(intersect(a,b)==1){ //内接する場合\n Point dir;\n if(a.r>b.r) dir=polar(a.r,arg(b.p-a.p));\n else dir=polar(a.r,arg(a.p-b.p));\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\n }\n //内接線\n if(GR(abs(a.p-b.p),a.r+b.r)){ //円が離れている場合\n Point q=a.p+(b.p-a.p)*a.r/(a.r+b.r);\n auto as=TanLine(q,a);\n auto bs=TanLine(q,b);\n assert(as.size()==2 and bs.size()==2);\n for(int i=0;i<2;i++){\n ret.emplace_back(as[i],bs[i]);\n }\n }else if(EQ(d,a.r+b.r)){ //円が接している場合\n Point dir=polar(a.r,arg(b.p-a.p));\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\n }\n return ret;\n}\n//２つの円の共通部分の面積\n//参考: https://tjkendev.github.io/procon-library/python/geometry/circles_intersection_area.html\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005736#1\nDD Area(const Circle &c1,const Circle &c2){\n DD cd=abs(c1.p-c2.p);\n if(LE(c1.r+c2.r,cd)) return 0; //円が離れている\n\n if(LE(cd,abs(c1.r-c2.r))) //片方の円が他方を包んでいる\n return min(c1.r,c2.r)*min(c1.r,c2.r)*PI;\n\n DD theta1=acosl(cosine_formula(c1.r,cd,c2.r));\n DD theta2=acosl(cosine_formula(c2.r,cd,c1.r));\n\n return c1.r*c1.r*theta1+c2.r*c2.r*theta2-c1.r*cd*sin(theta1);\n}\n\n\n////////////////////////////\n// 三角形\n////////////////////////////\n\n//ヘロンの公式 三角形の面積を返す\n//三角形が成立するか(平行ではないか)を忘れずに\nDD Heron(const DD ad,const DD bd,const DD cd){\n DD s=(ad+bd+cd)/2;\n return sqrt(s*(s-ad)*(s-bd)*(s-cd));\n}\n//三角形の外接円\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_C\nCircle CircumscribedCircle(const Point &a,const Point &b,const Point &c){\n Point bc=(b+c)/(DD)2.0;\n Line aa(bc,bc+rotate(c-b,PI/2));\n Point ab=(a+b)/(DD)2.0;\n Line cc(ab,ab+rotate(b-a,PI/2));\n Point p=crossPoint(aa,cc);\n return Circle(p,abs(a-p));\n}\n//三角形の内接円\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_B\nCircle InCircle(const Point &a,const Point &b,const Point &c){\n Line aa(a,a+polar((DD)1.0,(arg(b-a)+arg(c-a))/(DD)2.0));\n Line bb(b,b+polar((DD)1.0,(arg(a-b)+arg(c-b))/(DD)2.0));\n Point p=crossPoint(aa,bb);\n return Circle(p,DistPL(p,Line(a,b)));\n}\n\n////////////////////////////\n// 多角形\n////////////////////////////\n\n//点pが多角形gに対してどの位置にあるか\n//中:2 辺上:1 外:0\n//凸多角形である必要ない\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\nint contains(const Point &p,const vector<Point> &g){\n int n=(int)g.size();\n int x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(EQ(cross(a,b),0) && dot(a,b)<EPS) return 1;\n if(a.Y>b.Y) swap(a,b);\n if(a.Y<EPS && EPS<b.Y && cross(a,b)>EPS) x=!x;\n }\n return (x?2:0);\n}\n//凸性判定\n//多角形gは凸か？\n//gは反時計回りでも時計回りでもいい\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\nbool isConvex(const vector<Point> &g){\n int n=(int)g.size();\n if(n<=3) return true;\n int flag=0;\n int t;\n for(int i=0;i<n;i++){\n Point a(g[(i+1)%n]-g[i]),b(g[(i+2)%n]-g[i]);\n if(cross(a,b)>EPS) t=1;\n else if(cross(a,b)<-EPS) t=-1;\n else continue;\n if(flag==-t) return false;\n flag=t;\n }\n return true;\n}\n\n//凸包 アンドリューのアルゴリズム\n//O(NlogN)\n//反時計回りの多角形を返す\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\nvector<Point> ConvexHull(vector<Point> s,const bool on_edge){\n int j;\n if(on_edge) j=-1;\n else j=1;\n int sz=(int)s.size();\n if(sz<3) return s;\n sort(s.begin(),s.end(),yx_sort);\n\n int n=0;\n vector<Point> res(2*sz);\n for(int i=0;i<sz;i++){\n while(n>=2 && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\n n--;\n }\n res[n]=s[i];\n n++;\n }\n int t=n+1;\n for(int i=sz-2;i>=0;i--){\n while(n>=t && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\n n--;\n }\n res[n]=s[i];\n n++;\n }\n res.resize(n-1);\n return res;\n}\n\n//多角形g(凸でなくてもいい)の符号付き面積\n//反時計回りの多角形なら正の値を返す 時計回りなら負\n//O(N)\n//https://imagingsolution.net/math/calc_n_point_area/\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\nDD Area(const vector<Point> &g){\n DD ret=0.0;\n int n=(int)g.size();\n for(int i=0;i<n;i++){\n ret+=cross(g[i],g[(i+1)%n]);\n }\n return ret/2.0;\n}\n\n//凸多角形gを直線lで切断\n//直線の左側(向きを考慮)にできる凸多角形を返す\n//多角形gが反時計回りならば、反時計回りで返す(時計回りなら時計回り)\n//直線上の頂点を含む線分の交点は含めてない\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\nvector<Point> ConvexCut(const vector<Point> &g,const Line &l){\n vector<Point> ret;\n int gz=(int)g.size();\n for(int i=0;i<gz;i++){\n Point now=g[i],next=g[(i+1)%gz];\n if(ccw(l.a,l.b,now)!=-1) ret.push_back(now);\n if(EQ(DistPL(now,l),0) or EQ(DistPL(next,l),0)) continue;\n if(ccw(l.a,l.b,now)*ccw(l.a,l.b,next)<0){\n ret.push_back(crossPoint(Line(now,next),l));\n }\n }\n return ret;\n}\n//部品\ninline DD calc(const Point &a,const Point &b,const DD &r,const bool triangle){\n if(triangle) return cross(a,b);\n else return r*r*arg(b/a);\n}\n//部品\nDD calcArea(const DD &r,const Point &a,const Point &b){\n if(EQ(abs(a-b),0)) return 0;\n bool ina=(abs(a)<r+EPS);\n bool inb=(abs(b)<r+EPS);\n if(ina && inb) return cross(a,b);\n auto cr=crossPointSC(Segment(a,b),Circle(Point(0,0),r));\n if(cr.empty()) return calc(a,b,r,false);\n auto s=cr[0],t=cr.back();\n return calc(s,t,r,true)+calc(a,s,r,ina)+calc(t,b,r,inb);\n}\n//円と多角形の共通部分の面積\n//多角形が反時計回りならば正の値を返す\n//凸多角形でなくても大丈夫\n//http://drken1215.hatenablog.com/entry/2020/02/02/091000\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H&lang=ja\nDD Area(const Circle &c,const vector<Point> &g){\n DD ret=0.0;\n int gz=g.size();\n if(gz<=2) return ret;\n for(int i=0;i<gz;i++){\n Point a=g[i]-c.p,b=g[(i+1)%gz]-c.p;\n ret+=calcArea(c.r,g[i]-c.p,g[(i+1)%gz]-c.p);\n }\n return ret/2.0;\n}\n\n//点と多角形の距離\n//点が多角形の中にあるなら0\nDD Dist(const Point &a,const vector<Point> &b){\n\tif(b.size()==1) return abs(a-b[0]);\n\tif(contains(a,b)>=1) return 0.0L;\n\tDD ret=INF;\n\tfor(int i=0;i<b.size();i++){\n\t\tchmin(ret,DistPS(a,Segment(b[i],b[(i+1)%b.size()])));\n\t}\n\treturn ret;\n}\n\n//多角形と多角形の距離\n//どちらかが内側に入っていたら0\n//全ての線分の組み合わせの距離を求めて、その最小が答え\n//O(size(a)*size(b))\n//sizeが1の時は点との距離になる\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2827\nDD Dist(const vector<Point> &a,const vector<Point> &b){\n\tDD ret=INF;\n\tif(a.size()==1) return Dist(a[0],b);\n\tif(b.size()==1) return Dist(b[0],a);\n\n\tif(contains(a[0],b)>=1) return 0.0L;\n\tif(contains(b[0],a)>=1) return 0.0L;\n\n\tfor(int i=0;i<a.size();i++){\n\t\tfor(int j=0;j<b.size();j++){\n\t\t\tSegment sa(a[i],a[(i+1)%a.size()]);\n\t\t\tSegment sb(b[j],b[(j+1)%b.size()]);\n\t\t\tchmin(ret,Dist(sa,sb));\n\t\t}\n\t}\n\treturn ret;\n}\n\n////////////////////////////\n// 最近(遠)点間距離\n////////////////////////////\n//部品\nDD RecClosetPair(const vector<Point>::iterator it,const int n){\n if(n<=1) return INF;\n int m=n/2;\n DD x=it[m].X;\n DD d=min(RecClosetPair(it,m),RecClosetPair(it+m,n-m));\n inplace_merge(it,it+m,it+n,yx_sort);\n vector<Point> v;\n for(int i=0;i<n;i++){\n if(abs(it[i].X-x)>=d) continue;\n for(int j=0;j<v.size();j++){\n DD dy=it[i].Y-v[(int)v.size()-1-j].Y;\n if(dy>=d) break;\n DD dx=it[i].X-v[(int)v.size()-1-j].X;\n d=min(d,sqrt(dx*dx+dy*dy));\n }\n v.push_back(it[i]);\n }\n return d;\n}\n//最近点対の距離\n//点が1つのときINFを返す\n//O(NlogN)\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\nDD ClosetPair(vector<Point> g){\n sort(g.begin(),g.end(),xy_sort);\n return RecClosetPair(g.begin(),g.size());\n}\n\n//最遠頂点間\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\nDD Diameter(vector<Point> g){\n g=ConvexHull(g,1);\n int gz=g.size();\n int m=0,M=0;\n for(int i=1;i<gz;i++){\n if(g[i].Y<g[m].Y) m=i;\n if(g[i].Y>g[M].Y) M=i;\n }\n DD ret=0;\n int sm=m,sM=M;\n while(m!=sM || M!=sm){\n ret=max(ret,norm(g[m]-g[M]));\n if(cross(g[(m+1)%gz]-g[m],g[(M+1)%gz]-g[M])<0) m=(m+1)%gz;\n else M=(M+1)%gz;\n }\n return sqrt(ret);\n}\n//動的凸包\n//辺上にある点は含めない\n//verify:https://atcoder.jp/contests/geocon2013/tasks/geocon2013_c\nstruct DynamicConvex{\n\tset<Point> up,down;\n\tDynamicConvex(){}\n \n\tbool isContain(set<Point> &pol,Point p){\n\t\tif(pol.size()==0) return false;\n\t\tif(pol.size()==1){\n\t\t\tPoint q=*begin(pol);\n\t\t\treturn EQ(q.X,p.X) and GE(q.Y,p.Y);\n\t\t}\n\t\tassert(pol.size()>=2);\n auto left=begin(pol);\n auto right=(--end(pol));\n if(LS(p.X,left->X) or GR(p.X,right->X)) return false;\n \n \n auto q1=pol.upper_bound(Point(p.X,INF));\n if(q1==end(pol)){\n return GE(right->Y,p.Y);\n }\n auto q2=q1--; //q1が範囲外になるのは最初に弾いてる\n return GE(cross(p-*q1,*q2-*q1),0.0);\n\t}\n bool isContain(Point p){\n if(not isContain(up,p)) return false;\n if(not isContain(down,Point(p.X,-p.Y))) return false;\n return true;\n }\n \n\tvoid add(set<Point> &pol,Point p){\n\t\tif(pol.size()==0){\n\t\t\tpol.insert(p);\n\t\t\treturn;\n\t\t}\n\t\tif(pol.size()==1){\n Point q=*begin(pol);\n\t\t\tif(EQ(q.X,p.X)){\n pol.clear();\n pol.insert(max(p,q));\n\t\t\t}else{\n\t\t\t\tpol.insert(p);\n\t\t\t}\n return;\n\t\t}\n assert(pol.size()>=2);\n if(isContain(pol,p)) return;\n //left\n auto q1=pol.upper_bound(Point(p.X,INF));\n if(q1!=begin(pol)){\n q1--;\n while(pol.size()>=1 and q1!=begin(pol)){\n auto q2=q1--;\n if(GR(cross(*q2-p,*q1-p),0)) break;\n pol.erase(q2);\n }\n }\n //right\n q1=pol.lower_bound(Point(p.X,-INF));\n if(q1!=end(pol)){\n while(pol.size()>1 and q1!=--end(pol)){\n auto q2=q1++;\n if(GR(cross(*q1-p,*q2-p),0.0)) break;\n pol.erase(q2);\n }\n }\n pol.insert(p);\n\t}\n \n\tvoid add(Point p){\n\t\tadd(up,p);\n\t\tadd(down,Point(p.X,-p.Y)); //upと同じように処理をしたいから\n\t}\n};\n\n//垂直二等分線\n//p-↑-q こんなかんじ\n//voronoiで使う\nLine bisector(const Point &p, const Point &q) {\n Point c=(p+q)/DD(2.0);\n Point v=rotate(q-p,PI/2);\n v/=abs(v);\n return Line(c-v,c+v);\n}\n\n//ボロノイ図\n//pol:全体 ps:点の集合 id:中心となる点の添字 pp:中心となる点\n//計算量: pol.size()*ps.size()\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005648#1\nvector<Point> voronoi(Polygon pol,const vector<Point> &ps,int id=-1,const Point pp=Point()){\n Point p;\n if(id!=-1) p=ps[id];\n else p=pp;\n for(size_t i=0;i<ps.size();i++){\n if(i==id) continue;\n Line l=bisector(p,ps[i]);\n pol=ConvexCut(pol,l);\n }\n return pol;\n}\nint N,W;\n\nbool OK(vector<Circle> C,Point p){\n for(auto c:C){\n if(LS(abs(p-c.p),c.r)) return false; \n }\n\n return true;\n}\n\nvoid solve(){\nwhile(true){\n cin>>N>>W;\n if(N==0) return;\n vector<DD> x(N),y(N),H(N);\n for(int i=0;i<N;i++) cin>>x[i]>>y[i]>>H[i];\n\n DD ok=0,ng=1e4;\n int T=100;\n while(T--){\n DD mid=(ok+ng)/2;\n\n vector<Point> koho;\n vector<Circle> C;\n for(int i=0;i<N;i++){\n DD r;\n if(mid>H[i]) r=mid*mid-(mid-H[i])*(mid-H[i]);\n else r=mid*mid;\n //if(LE(r,0)) continue;\n r=sqrtl(r);\n C.emplace_back(Point(x[i],y[i]),r);\n }\n DD w;\n if(mid>W) w=mid*mid-(mid-W)*(mid-W);\n else w=mid*mid;\n w=sqrtl(w);\n vector<Segment> S;\n\n S.emplace_back(Point(w,w),Point(w,100-w));\n S.emplace_back(Point(w,w),Point(100-w,w));\n S.emplace_back(Point(100-w,100-w),Point(w,100-w));\n S.emplace_back(Point(100-w,100-w),Point(100-w,w));\n for(size_t i=0;i<C.size();i++){\n for(size_t j=i+1;j<C.size();j++){\n int s=intersect(C[i],C[j]);\n if(s==0) continue;\n auto x=crossPoint(C[i],C[j]);\n for(auto y:x){\n koho.push_back(y);\n }\n }\n for(auto s:S){\n auto v=crossPointSC(s,C[i]);\n for(auto y:v){\n koho.push_back(y);\n }\n }\n }\n koho.emplace_back(w,w);\n koho.emplace_back(w,100-w);\n koho.emplace_back(100-w,w);\n koho.emplace_back(100-w,100-w);\n\n bool Ok=false;\n for(auto y:koho){\n if(GR(y.X,100-w)) continue;\n if(GR(y.Y,100-w)) continue;\n if(LS(y.X,w)) continue;\n if(LS(y.Y,w)) continue;\n if(OK(C,y)) Ok=true;\n }\n if(Ok) ok=mid;\n else ng=mid; \n }\n cout<<ok<<endl;\n}\n}\n\nint main(){\n bin101();\n int T=1;\n //cin>>T;\n while(T--) solve();\n}","accuracy":1,"time_ms":1280,"memory_kb":3900,"score_of_the_acc":-0.904,"final_rank":14},{"submission_id":"aoj_1342_5792989","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.08.17 02:01:28 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region geometry\n\nusing Real = long double;\nusing Point = complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\n\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nReal distance(const Line &l, const Point &p);\n\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = min(c1.r, c2.r), r2 = max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / sqrt(g);\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// bisection of angle A-B-C\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\nLine bisection_of_angle(const Point &a, const Point &b, const Point &c) {\n\tReal da = distance(a, b);\n\tReal dc = distance(b, c);\n\treturn Line(b, (a * dc + c * da) / (da + dc));\n}\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\nCircle incircle_of_triangle(const Point &a, const Point &b, const Point &c) {\n\tPoint center = crosspoint(bisection_of_angle(a, b, c), bisection_of_angle(b, c, a));\n\treturn Circle(center, distance(Line(a, b), center));\n}\nCircle incircle_of_triangle(const Polygon &p) { return incircle_of_triangle(p[0], p[1], p[2]); }\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\nLine bisection_of_points(const Point &a, const Point &b) {\n\tPoint c = (a + b) * 0.5;\n\treturn Line(c, c + rotate(PI / 2, b - a));\n}\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\nCircle circumscribed_circle_of_triangle(const Point &a, const Point &b, const Point &c) {\n\tPoint center = crosspoint(bisection_of_points(a, b), bisection_of_points(b, c));\n\treturn Circle(center, distance(a, center));\n}\nCircle circumscribed_circle_of_triangle(const Polygon &p) { return circumscribed_circle_of_triangle(p[0], p[1], p[2]); }\n\n#pragma endregion\n\nusing R = Real;\nR solve() {\n\tint n;\n\tcin >> n;\n\tif(n == 0) exit(0);\n\tR w;\n\tcin >> w;\n\n\tPoints needles_place;\n\tV<R> needles_height;\n\trep(n) {\n\t\tReal x, y, h;\n\t\tcin >> x >> y >> h;\n\t\tneedles_place.emplace_back(x, y);\n\t\tneedles_height.push_back(h);\n\t}\n\n\tauto min_dist = [&](R radius, R hieght) -> R {\n\t\tif(radius < hieght) return radius;\n\t\treturn R(sqrt(radius * radius - (radius - hieght) * (radius - hieght)));\n\t};\n\n\tLines walls;\n\twalls.emplace_back(Point(0, 0), Point(0, 100));\n\twalls.emplace_back(Point(100, 100), Point(0, 100));\n\twalls.emplace_back(Point(0, 0), Point(100, 0));\n\twalls.emplace_back(Point(100, 100), Point(100, 0));\n\n\tLines internal;\n\tCircles cs(n);\n\n\tPoints crs;\n\n\tauto safe = [&](const Point ¢er, const R &radius) {\n\t\tif(isnan(center.real())) return false;\n\t\tif(isnan(center.imag())) return false;\n\n\t\tif(compare(center.real(), 0) == -1 || compare(center.real(), 100) == 1 || compare(center.imag(), 0) == -1 ||\n\t\t compare(center.imag(), 100) == 1) {\n\t\t\t// if(radius > 1. && radius < 3) debug(center, radius);\n\t\t\treturn false;\n\t\t}\n\n\t\trep(i, n) {\n\t\t\tif(compare(min_dist(radius, needles_height[i]), distance(center, needles_place[i])) == 1) return false;\n\t\t}\n\n\t\tR min_dist_wall = min_dist(radius, w);\n\t\tfoa(wall, walls) {\n\t\t\tif(compare(min_dist_wall, distance(wall, center)) == 1) return false;\n\t\t}\n\t\treturn true;\n\t};\n\n\tauto f = [&](R radius) {\n\t\tinternal.clear();\n\t\tcrs.clear();\n\t\tR min_dist_wall = min_dist(radius, w);\n\t\tinternal.emplace_back(Point(min_dist_wall, 0), Point(min_dist_wall, 100));\n\t\tinternal.emplace_back(Point(100, 100 - min_dist_wall), Point(0, 100 - min_dist_wall));\n\t\tinternal.emplace_back(Point(0, min_dist_wall), Point(100, min_dist_wall));\n\t\tinternal.emplace_back(Point(100 - min_dist_wall, 100), Point(100 - min_dist_wall, 0));\n\n\t\trep(i, n) { cs[i] = Circle(needles_place[i], min_dist(radius, needles_height[i])); }\n\n\t\tfoa(ln, internal) {\n\t\t\tfoa(ln2, internal) {\n\t\t\t\tif(intersect(ln, ln2)) crs.push_back(crosspoint(ln, ln2));\n\t\t\t}\n\n\t\t\tfoa(c, cs) {\n\t\t\t\tif(intersect(c, ln)) {\n\t\t\t\t\tauto ps = crosspoint(c, ln);\n\t\t\t\t\tcrs.push_back(ps.first);\n\t\t\t\t\tcrs.push_back(ps.second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfoa(c, cs) {\n\t\t\tfoa(d, cs) {\n\t\t\t\tif(intersect(c, d) > 0) {\n\t\t\t\t\tauto ps = crosspoint(c, d);\n\t\t\t\t\tcrs.push_back(ps.first);\n\t\t\t\t\tcrs.push_back(ps.second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfoa(pt, crs) {\n\t\t\tif(isnan(pt.real())) continue;\n\t\t\tif(safe(pt, radius)) {\n\t\t\t\tif(radius > 10000000000000.) debug(pt, radius);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t};\n\n\tR ok = 0.;\n\tR ng = 130;\n\trep(30) {\n\t\tR med = (ok + ng) / 2;\n\t\tif(f(med)) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\treturn ok;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\twhile(1) cout << solve() << dl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":800,"memory_kb":3928,"score_of_the_acc":-0.8739,"final_rank":13},{"submission_id":"aoj_1342_5792986","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.08.17 02:01:28 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region macros\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define popcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\n#pragma endregion\n\n#pragma region aliases\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nconst int inf = 1e9;\nconst long long INF = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\nconst int mod_1000000007 = 1000000007;\nconst int mod_998244353 = 998244353;\n\n#pragma endregion\n\n#pragma region basic_operation\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { std::cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(bool f = 1) { std::cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { std::cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag = true) {\n\tif(!flag) return;\n\tstd::cout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\treturn (a + b - 1) / b;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(std::vector<T> &a) {\n\tauto vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\nnamespace viewer {\nvoid view(const long long e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << \"(\";\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << '{';\n\tfor(const auto &t : v) {\n\t\tstd::cerr << \"\\n\\t\";\n\t\tview(t);\n\t\tstd::cerr << \",\";\n\t}\n\tstd::cerr << \"\\n}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n} // namespace viewer\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tviewer::view(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region geometry\n\nusing Real = long double;\nusing Point = complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\n\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\nReal distance(const Line &l, const Point &p);\n\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = min(c1.r, c2.r), r2 = max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / sqrt(g);\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// bisection of angle A-B-C\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\nLine bisection_of_angle(const Point &a, const Point &b, const Point &c) {\n\tReal da = distance(a, b);\n\tReal dc = distance(b, c);\n\treturn Line(b, (a * dc + c * da) / (da + dc));\n}\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\nCircle incircle_of_triangle(const Point &a, const Point &b, const Point &c) {\n\tPoint center = crosspoint(bisection_of_angle(a, b, c), bisection_of_angle(b, c, a));\n\treturn Circle(center, distance(Line(a, b), center));\n}\nCircle incircle_of_triangle(const Polygon &p) { return incircle_of_triangle(p[0], p[1], p[2]); }\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\nLine bisection_of_points(const Point &a, const Point &b) {\n\tPoint c = (a + b) * 0.5;\n\treturn Line(c, c + rotate(PI / 2, b - a));\n}\n\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\nCircle circumscribed_circle_of_triangle(const Point &a, const Point &b, const Point &c) {\n\tPoint center = crosspoint(bisection_of_points(a, b), bisection_of_points(b, c));\n\treturn Circle(center, distance(a, center));\n}\nCircle circumscribed_circle_of_triangle(const Polygon &p) { return circumscribed_circle_of_triangle(p[0], p[1], p[2]); }\n\n#pragma endregion\n\nusing R = Real;\nR solve() {\n\tint n;\n\tcin >> n;\n\tif(n == 0) exit(0);\n\tR w;\n\tcin >> w;\n\n\tPoints needles_place;\n\tV<R> needles_height;\n\trep(n) {\n\t\tReal x, y, h;\n\t\tcin >> x >> y >> h;\n\t\tneedles_place.emplace_back(x, y);\n\t\tneedles_height.push_back(h);\n\t}\n\n\tauto min_dist = [&](R radius, R hieght) -> R {\n\t\tif(radius < hieght) return radius;\n\t\treturn R(sqrt(radius * radius - (radius - hieght) * (radius - hieght)));\n\t};\n\n\tLines walls;\n\twalls.emplace_back(Point(0, 0), Point(0, 100));\n\twalls.emplace_back(Point(100, 100), Point(0, 100));\n\twalls.emplace_back(Point(0, 0), Point(100, 0));\n\twalls.emplace_back(Point(100, 100), Point(100, 0));\n\n\tLines internal;\n\tCircles cs(n);\n\n\tPoints crs;\n\n\tauto safe = [&](const Point ¢er, const R &radius) {\n\t\tif(isnan(center.real())) return false;\n\t\tif(isnan(center.imag())) return false;\n\n\t\tif(compare(center.real(), 0) == -1 || compare(center.real(), 100) == 1 || compare(center.imag(), 0) == -1 ||\n\t\t compare(center.imag(), 100) == 1) {\n\t\t\t// if(radius > 1. && radius < 3) debug(center, radius);\n\t\t\treturn false;\n\t\t}\n\n\t\trep(i, n) {\n\t\t\tif(compare(min_dist(radius, needles_height[i]), distance(center, needles_place[i])) == 1) return false;\n\t\t}\n\n\t\tR min_dist_wall = min_dist(radius, w);\n\t\tfoa(wall, walls) {\n\t\t\tif(compare(min_dist_wall, distance(wall, center)) == 1) return false;\n\t\t}\n\t\treturn true;\n\t};\n\n\tauto f = [&](R radius) {\n\t\tinternal.clear();\n\t\tcrs.clear();\n\t\tR min_dist_wall = min_dist(radius, w);\n\t\tinternal.emplace_back(Point(min_dist_wall, 0), Point(min_dist_wall, 100));\n\t\tinternal.emplace_back(Point(100, 100 - min_dist_wall), Point(0, 100 - min_dist_wall));\n\t\tinternal.emplace_back(Point(0, min_dist_wall), Point(100, min_dist_wall));\n\t\tinternal.emplace_back(Point(100 - min_dist_wall, 100), Point(100 - min_dist_wall, 0));\n\n\t\trep(i, n) { cs[i] = Circle(needles_place[i], min_dist(radius, needles_height[i])); }\n\n\t\tfoa(ln, internal) {\n\t\t\tfoa(ln2, internal) {\n\t\t\t\tif(intersect(ln, ln2)) crs.push_back(crosspoint(ln, ln2));\n\t\t\t}\n\n\t\t\tfoa(c, cs) {\n\t\t\t\tif(intersect(c, ln)) {\n\t\t\t\t\tauto ps = crosspoint(c, ln);\n\t\t\t\t\tcrs.push_back(ps.first);\n\t\t\t\t\tcrs.push_back(ps.second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfoa(c, cs) {\n\t\t\tfoa(d, cs) {\n\t\t\t\tif(intersect(c, d) > 0) {\n\t\t\t\t\tauto ps = crosspoint(c, d);\n\t\t\t\t\tcrs.push_back(ps.first);\n\t\t\t\t\tcrs.push_back(ps.second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfoa(pt, crs) {\n\t\t\tif(isnan(pt.real())) continue;\n\t\t\t// if(radius < 1.) debug(radius, pt);\n\t\t\tif(safe(pt, radius)) {\n\t\t\t\tif(radius > 10000000000000.) debug(pt, radius);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t};\n\n\tR ok = 0.;\n\tR ng = inf;\n\trep(200) {\n\t\tR med = (ok + ng) / 2;\n\t\tif(f(med)) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\treturn ok;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\tstd::cout << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\twhile(1) cout << solve() << dl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":5080,"memory_kb":3980,"score_of_the_acc":-1.4846,"final_rank":19},{"submission_id":"aoj_1342_5332100","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 0.0000001;\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator +(point P){\n return point(x + P.x, y + P.y);\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n point operator *(double k){\n return point(x * k, y * k);\n }\n point operator /(double k){\n return point(x / k, y / k);\n }\n};\npoint rotate90(point P){\n return point(P.y, -P.x);\n}\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dist(point P, point Q){\n return abs(Q - P);\n}\ndouble dot(point P, point Q){\n return P.x * Q.x + P.y * Q.y;\n}\ndouble cross(point P, point Q){\n return P.x * Q.y - P.y * Q.x;\n}\nstruct line{\n point A, B;\n line(){\n }\n line(point A, point B): A(A), B(B){\n }\n};\npoint vec(line L){\n return L.B - L.A;\n}\ndouble point_line_distance(point P, line L){\n return abs(cross(P - L.A, vec(L))) / abs(vec(L));\n}\npoint projection(point P, line L){\n return L.A + vec(L) / abs(vec(L)) * dot(P - L.A, vec(L)) / abs(vec(L));\n}\nstruct circle{\n point C;\n double r;\n circle(){\n }\n circle(point C, double r): C(C), r(r){\n }\n};\nbool point_in_circle(point P, circle C){\n return dist(P, C.C) < C.r - EPS;\n}\nbool line_circle_intersects(line L, circle C){\n return point_line_distance(C.C, L) < C.r - EPS;\n}\npair<point, point> line_circle_intersection(line L, circle C){\n point P = projection(C.C, L);\n double d = point_line_distance(C.C, L);\n double h = sqrt(C.r * C.r - d * d);\n point A = P + vec(L) / abs(vec(L)) * h;\n point B = P - vec(L) / abs(vec(L)) * h;\n return make_pair(A, B);\n}\nbool circle_intersects(circle C1, circle C2){\n double d = dist(C1.C, C2.C);\n return abs(C1.r - C2.r) + EPS < d && d < C1.r + C2.r - EPS;\n}\npair<point, point> circle_intersection(circle C1, circle C2){\n double d = dist(C1.C, C2.C);\n double d2 = (C1.r * C1.r + d * d - C2.r * C2.r) / (2 * d);\n point M = C1.C + (C2.C - C1.C) / d * d2;\n double h = sqrt(C1.r * C1.r - d2 * d2);\n point D = rotate90(C2.C - C1.C);\n point A = M + D / abs(D) * h;\n point B = M - D / abs(D) * h;\n return make_pair(A, B);\n}\nint main(){\n while (true){\n int n;\n double w;\n cin >> n >> w;\n if (n == 0 && w == 0){\n break;\n }\n vector<point> P(n);\n vector<double> h(n);\n for (int i = 0; i < n; i++){\n cin >> P[i].x >> P[i].y >> h[i];\n }\n double tv = 0, fv = 10000;\n for (int i = 0; i < 50; i++){\n double r = (tv + fv) / 2;\n double t;\n if (r < w){\n t = r;\n } else {\n t = sqrt(r * r - (r - w) * (r - w));\n }\n if (t > 50){\n fv = r;\n } else {\n vector<line> L(4);\n L[0] = line(point(t, t), point(t, 100 - t));\n L[1] = line(point(100 - t, t), point(100 - t, 100 - t));\n L[2] = line(point(t, t), point(100 - t, t));\n L[3] = line(point(t, 100 - t), point(100 - t, 100 - t));\n vector<circle> C(n);\n for (int j = 0; j < n; j++){\n if (r < h[j]){\n C[j] = circle(P[j], r);\n } else {\n C[j] = circle(P[j], sqrt(r * r - (r - h[j]) * (r - h[j])));\n }\n }\n vector<point> Q;\n Q.push_back(point(t, t));\n Q.push_back(point(t, 100 - t));\n Q.push_back(point(100 - t, t));\n Q.push_back(point(100 - t, 100 - t));\n for (int j = 0; j < n; j++){\n for (int k = 0; k < 4; k++){\n if (line_circle_intersects(L[k], C[j])){\n pair<point, point> I = line_circle_intersection(L[k], C[j]);\n Q.push_back(I.first);\n Q.push_back(I.second);\n }\n }\n for (int k = j + 1; k < n; k++){\n if (circle_intersects(C[j], C[k])){\n pair<point, point> I = circle_intersection(C[j], C[k]);\n Q.push_back(I.first);\n Q.push_back(I.second);\n }\n }\n }\n int cnt = Q.size();\n bool ok = false;\n for (int j = 0; j < cnt; j++){\n bool ok2 = true;\n if (Q[j].x < t - EPS || Q[j].x > 100 - t + EPS || Q[j].y < t - EPS || Q[j].y > 100 - t + EPS){\n ok2 = false;\n }\n for (int k = 0; k < n; k++){\n if (point_in_circle(Q[j], C[k])){\n ok2 = false;\n }\n }\n if (ok2){\n ok = true;\n }\n }\n if (ok){\n tv = r;\n } else {\n fv = r;\n }\n }\n }\n cout << tv << endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":3252,"score_of_the_acc":-0.0181,"final_rank":2},{"submission_id":"aoj_1342_5237482","code_snippet":"#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n#include \"iomanip\"\n#include \"cmath\"\n#include \"random\"\n#include \"bitset\"\n#include \"cstdio\"\n#include \"numeric\"\n#include \"cassert\"\n#include \"ctime\"\n\nusing namespace std;\n\n//constexpr long long int MOD = 1000000007;\n//constexpr int MOD = 1000000007;\n//constexpr int MOD = 998244353;\nconstexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nstruct Needle {\n\tlong double x, y, z;\n\tNeedle() {\n\t\tcin >> x >> y >> z;\n\t}\n\tNeedle(long double xx, long double yy, long double zz) :x(xx), y(yy), z(zz) {\n\n\t}\n};\n\nstruct Point {\n\tlong double x, y, z;\n\tPoint(long double xx, long double yy, long double zz) :x(xx), y(yy), z(zz) {\n\n\t}\n};\n\nlong double Dist(Needle n, Point p) {\n\tn.z = min(n.z, p.z);\n\t//cout << hypot(hypot(n.x - p.x, n.y - p.y), n.z - p.z) << endl;\n\treturn hypot(hypot(n.x - p.x, n.y - p.y), n.z - p.z);\n}\n\nvector<Point>CircleCross(Needle a,long double ar,Needle b, long double br) {\n\tvector<Point>ret;\n\tPoint dp(b.x - a.x, b.y - a.y, a.z);\n\tauto dis = hypot(a.x - b.x, a.y - b.y);\n\tif (ar + br < dis)return ret;\n\tif (abs(ar - br) >= dis)return ret;\n\tif (abs(ar + br - dis) <= EPS) {\n\t\tret.push_back(Point(a.x + b.x * (ar / (ar + br)), a.y + b.y * (ar / (ar + br)), a.z));\n\t\treturn ret;\n\t}\n\tif (abs(abs(ar - br) - dis) <= EPS) {\n\t\tret.push_back(Point(a.x + b.x * (ar / (ar - br)), a.y + b.y * (ar / (ar - br)), a.z));\n\t\treturn ret;\n\t}\n\tlong double ad;\n\tif (dis < 1) {\n\t\tcout << dis << endl;\n\t}\n\tad = (ar*ar - br*br + dis * dis) / 2 / dis;\n\tPoint cp(a.x + dp.x*(ad / dis), a.y + dp.y*(ad / dis), a.z);\n\tif (abs(ar) < abs(ad)) {\n\t\tcout << ar << \" \" << br << \" \" << dis << endl;\n\t\tcout << ar << \" \" << ad << endl;\n\t}\n\tlong double amari = sqrt(ar*ar - ad * ad);\n\tret.push_back(Point(cp.x - dp.y*amari / dis, cp.y + dp.x*amari / dis, cp.z));\n\tret.push_back(Point(cp.x + dp.y*amari / dis, cp.y - dp.x*amari / dis, cp.z));\n\treturn ret;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N >> H, N) {\n\t\tvector<Needle>n(N);\n\t\tlong double mx = (H*H + (long double)2500) / (2 * H);\n\t\tif (H >= 50) {\n\t\t\tmx = 50;\n\t\t}\n\t\tlong double l = 0, r = mx;\n\t\tfor (int loop = 0; loop < 50; loop++) {\n\t\t\tlong double mid = (l + r) / 2;\n\t\t\tvector<Point>p;\n\t\t\t{\n\t\t\t\tlong double d = 0;\n\t\t\t\tif (mid <= H) {\n\t\t\t\t\td = mid;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\td = sqrt(mid*H * 2 - H * H);\n\t\t\t\t}\n\t\t\t\tp.push_back(Point(d, d, mid));\n\t\t\t\tp.push_back(Point(100 - d, d, mid));\n\t\t\t\tp.push_back(Point(d, 100 - d, mid));\n\t\t\t\tp.push_back(Point(100 - d, 100 - d, mid));\n\t\t\t\tfor (auto i : n) {\n\t\t\t\t\tlong double r = 0;\n\t\t\t\t\tif (mid <= i.z) {\n\t\t\t\t\t\tr = mid;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tr = sqrt(mid*i.z * 2 - i.z*i.z);\n\t\t\t\t\t}\n\t\t\t//\t\tcout << mid << \" \" << d << \" \" << r << endl;\n\t\t\t\t\tif (i.x + r > d && i.x - r < d) {\n\t\t\t\t\t\tif (abs(r) < abs(i.x - d)) {\n\t\t\t\t\t\t\tcout << \"aaaaaaaaaaaaaaaaaaaaaaaa\" << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlong double dif = sqrt(r*r - (i.x - d)*(i.x - d));\n\t\t\t\t\t\tp.push_back(Point(d, i.y - dif, mid));\n\t\t\t\t\t\tp.push_back(Point(d, i.y + dif, mid));\n\t\t\t\t\t}\n\t\t\t\t\tif (i.x + r > 100 - d && i.x - r < 100 - d) {\n\t\t\t\t\t\tif (abs(r) < abs(i.x - (100 - d))) {\n\t\t\t\t\t\t\tcout << \"aaaaaaaaaaaaaaaaaaaaaaaa\" << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlong double dif = sqrt(r*r - (i.x - (100 - d))*(i.x - (100 - d)));\n\t\t\t\t\t\tp.push_back(Point(100 - d, i.y - dif, mid));\n\t\t\t\t\t\tp.push_back(Point(100 - d, i.y + dif, mid));\n\t\t\t\t\t}\n\t\t\t\t\tif (i.y + r > d && i.y - r < d) {\n\t\t\t\t\t\tif (abs(r) < abs(i.y-d)) {\n\t\t\t\t\t\t\tcout << \"aaaaaaaaaaaaaaaaaaaaaaaa\" << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlong double dif = sqrt(r*r - (i.y - d)*(i.y - d));\n\t\t\t\t\t\tp.push_back(Point(i.x - dif, d, mid));\n\t\t\t\t\t\tp.push_back(Point(i.x + dif, d, mid));\n\t\t\t\t\t}\n\t\t\t\t\tif (i.y + r > 100 - d && i.y - r < 100 - d) {\n\t\t\t\t\t\tif (abs(r) < abs(i.y - (100 - d))) {\n\t\t\t\t\t\t\tcout << \"aaaaaaaaaaaaaaaaaaaaaaaa\" << endl;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlong double dif = sqrt(r*r - (i.y - (100 - d))*(i.y - (100 - d)));\n\t\t\t\t\t\tp.push_back(Point(i.x - dif, 100 - d, mid));\n\t\t\t\t\t\tp.push_back(Point(i.x + dif, 100 - d, mid));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\t\tfor (int j = i + 1; j < N; j++) {\n\t\t\t\t\t\tauto box = CircleCross(n[i], sqrt(mid*mid - max((long double)0, (mid - n[i].z))*max((long double)0,(mid - n[i].z))), n[j], sqrt(mid*mid - max((long double)0, (mid - n[j].z))*max((long double)0, (mid - n[j].z))));\n\t\t\t\t\t\tfor (auto k : box) {\n\t\t\t\t\t\t\tk.z = mid;\n\t\t\t\t\t\t\tp.push_back(k);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tlong double flag = 0;\n\t\t\tfor (auto i : p) {\n\t\t\t//\tcout << i.x << \" \" << i.y << \" \" << i.z << \" \" << mid << endl;\n\t\t\t\tif (i.x < 0 || i.y < 0 || i.x >= 100 || i.y >= 100)continue;\n\t\t\t\tlong double dis = 20000;\n\t\t\t\tn.push_back(Needle(i.x, 0, H));\n\t\t\t\tn.push_back(Needle(i.x, 100, H));\n\t\t\t\tn.push_back(Needle(0, i.y, H));\n\t\t\t\tn.push_back(Needle(100, i.y, H));\n\t\t\t\tfor (auto j : n) {\n\t\t\t\t\tdis = min(dis, Dist(j, i));\n\t\t\t\t}\n\t\t\t\tn.pop_back();\n\t\t\t\tn.pop_back();\n\t\t\t\tn.pop_back();\n\t\t\t\tn.pop_back();\n\t\t\t\tflag = max(flag, dis);\n\t\t\t\t//cout << dis << \" \" << mid << endl;\n\t\t\t\t//if (dis >= mid - EPS) {\n\t\t\t\t//\tcout << i.x << \" \" << i.y << \" \" << i.z << endl;\n\t\t\t\t//}\n\t\t\t}\n\t\t//\tcout << flag << \" \" << mid << endl;\n\t\t\tif (flag>=mid-EPS) {\n\t\t\t\tl = mid;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tr = mid;\n\t\t\t}\n\t\t}\n\t\tcout << fixed << setprecision(20) << r << endl;\n\t}\n}","accuracy":1,"time_ms":1550,"memory_kb":3436,"score_of_the_acc":-0.4115,"final_rank":5},{"submission_id":"aoj_1342_5179238","code_snippet":"#pragma GCC optimize(\"Ofast\")\n//#ifndef ONLINE_JUDGE \n//#define _GLIBCXX_DEBUG\n//#endif\n#ifdef ONLINE_JUDGE \n#include <atcoder/all>\n#endif\n#include <bits/stdc++.h>\n#include <chrono>\n#include <random>\n#include <math.h>\n#include <complex>\n \n \nusing namespace std;\n#ifdef ONLINE_JUDGE \nusing namespace atcoder;\n#endif\n#define rep(i,n) for (int i = 0;i < (int)(n);i++)\nusing ll = long long;\n#ifdef ONLINE_JUDGE \n//using mint = modint998244353;\n//using mint = modint;\nusing mint = modint1000000007;\n#endif\nconst ll MOD=1000000007;\n//const ll MOD=998244353;\nconst long long INF = 1LL << 60;\nconst double pi=acos(-1.0);\nint dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};\nint dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};\n \ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\n \nusing Real = long double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2;\t // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 4;\t // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2;\t // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0;\t\t\t\t\t\t // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定 (反時計回り)\nbool is_convex(const Polygon &p) {\n\tint n = (int)p.size();\n\tfor(int i = 0; i < n; i++) {\n\t\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n\t}\n\treturn true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\nPolygon convex_hull(Polygon &p) {\n\tint n = (int)p.size(), k = 0;\n\tif(n <= 2) return p;\n\tsort(p.begin(), p.end()); // x -> yの順にソート\n\tvector<Point> ch(2 * n);\n\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\n\t\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\n\t\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n\tbool in = false;\n\tfor(int i = 0; i < Q.size(); i++) {\n\t\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n\t\tif(a.imag() > b.imag()) swap(a, b);\n\t\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n\t\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分の重複除去\nvoid merge_segments(vector<Segment> &segs) {\n\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\n\t\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n\t\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n\t\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n\t\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n\t\treturn true;\n\t};\n\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n\t}\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tfor(int j = i + 1; j < segs.size(); j++) {\n\t\t\tif(merge_if_able(segs[i], segs[j])) {\n\t\t\t\tsegs[j--] = segs.back(), segs.pop_back();\n\t\t\t}\n\t\t}\n\t}\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\n\tvector<vector<int>> g;\n\tint N = (int)segs.size();\n\tfor(int i = 0; i < N; i++) {\n\t\tps.emplace_back(segs[i].a);\n\t\tps.emplace_back(segs[i].b);\n\t\tfor(int j = i + 1; j < N; j++) {\n\t\t\tconst Point p1 = segs[i].b - segs[i].a;\n\t\t\tconst Point p2 = segs[j].b - segs[j].a;\n\t\t\tif(eq(cross(p1, p2), 0)) continue;\t// \" == 0\" となっていたのを訂正\n\t\t\tif(intersect(segs[i], segs[j])) {\n\t\t\t\tps.emplace_back(crosspoint(segs[i], segs[j]));\n\t\t\t}\n\t\t}\n\t}\n\tsort(begin(ps), end(ps));\n\tps.erase(unique(begin(ps), end(ps)), end(ps));\t// これ誤差とか大丈夫なのか？\n\n\tint M = (int)ps.size();\n\tg.resize(M);\n\tfor(int i = 0; i < N; i++) {\n\t\tvector<int> vec;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tif(intersect(segs[i], ps[j])) {\n\t\t\t\tvec.emplace_back(j);\n\t\t\t}\n\t\t}\n\t\tfor(int j = 1; j < vec.size(); j++) {\n\t\t\tg[vec[j - 1]].push_back(vec[j]);\n\t\t\tg[vec[j]].push_back(vec[j - 1]);\n\t\t}\n\t}\n\treturn (g);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\nPolygon convex_cut(const Polygon &U, Line l) {\n\tPolygon ret;\n\tfor(int i = 0; i < U.size(); i++) {\n\t\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\n\t\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n\t\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n\t\t\tret.push_back(crosspoint(Line(now, nxt), l));\n\t\t}\n\t}\n\treturn (ret);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// 多角形の面積\nReal area(const Polygon &p) {\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); ++i) {\n\t\tA += cross(p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\t // 0.5倍してなくない？\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\t // 0.5倍が抜けていたので修正;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// 二等分線\nLine bisection(Point a, Point b) {\n\ta = (a + b) * 0.5;\n\tb = rotate(PI / 2, b - a) + a;\n\treturn Line(a, b);\n}\n\n \nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n \n while(1) {\n ll N,W; cin>>N>>W; if(!N&&!W) break;\n \n Points P(N);\n vector<Real> H(N);\n rep(i,N) cin>>P[i]>>H[i];\n \n vector<Real> R(N);\n Real l,r,u,d;\n \n auto judge=[&](Real sphere){\n rep(i,N) {\n if(H[i]>sphere) R[i]=sphere;\n else R[i]=sqrt(pow(sphere,2)-pow(sphere-H[i],2));\n }\n auto hasi=(sphere>W?sqrt(pow(sphere,2)-pow(sphere-W,2)):sphere);\n l=hasi,r=100.0-hasi,u=hasi,d=100.0-hasi;\n \n auto safe=[&](Real x,Real y) {\n if(x<l-EPS||x>r+EPS||y<u-EPS||y>d+EPS) return false;\n rep(i,N) {\n if(distance(P[i],Point(x,y))<R[i]-EPS) return false;\n }\n return true;\n };\n \n auto safepoint=[&](Point p) {return safe(p.real(),p.imag());};\n \n if(safe(l,u)||safe(l,d)||safe(r,u)||safe(r,d)) return true;\n \n rep(i,N) for(int j=i+1;j<N;j++) {\n int num=intersect(Circle(P[i],R[i]),Circle(P[j],R[j]));\n if(num==0||num==4) continue;\n auto [p1,p2]=crosspoint(Circle(P[i],R[i]),Circle(P[j],R[j]));\n if(safepoint(p1)||safepoint(p2)) return true;\n }\n \n Points points(4);\n points[0]=Point(l,u);\n points[1]=Point(l,d);\n points[2]=Point(r,u);\n points[3]=Point(r,d);\n \n Lines lines(4);\n lines[0]=Line(points[0],points[1]);\n lines[1]=Line(points[1],points[2]);\n lines[2]=Line(points[2],points[3]);\n lines[3]=Line(points[3],points[0]);\n \n rep(i,N) rep(j,4) {\n if(!intersect(Circle(P[i],R[i]),lines[j])) continue;\n auto [p1,p2]=crosspoint(Circle(P[i],R[i]),lines[j]);\n if(safepoint(p1)||safepoint(p2)) return true;\n }\n \n return false;\n };\n \n Real ok=0.0;\n Real ng=10000.0;\n rep(_,100) {\n Real mid=(ok+ng)/2;\n (judge(mid)?ok:ng)=mid;\n }\n \n cout<<ok<<'\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":300,"memory_kb":3568,"score_of_the_acc":-0.4004,"final_rank":4},{"submission_id":"aoj_1342_5033646","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region geometry\n\nusing Real = long double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2;\t // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 4;\t // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2;\t // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0;\t\t\t\t\t\t // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定 (反時計回り)\nbool is_convex(const Polygon &p) {\n\tint n = (int)p.size();\n\tfor(int i = 0; i < n; i++) {\n\t\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n\t}\n\treturn true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\nPolygon convex_hull(Polygon &p) {\n\tint n = (int)p.size(), k = 0;\n\tif(n <= 2) return p;\n\tsort(p.begin(), p.end()); // x -> yの順にソート\n\tvector<Point> ch(2 * n);\n\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\n\t\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\n\t\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n\tbool in = false;\n\tfor(int i = 0; i < Q.size(); i++) {\n\t\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n\t\tif(a.imag() > b.imag()) swap(a, b);\n\t\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n\t\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分の重複除去\nvoid merge_segments(vector<Segment> &segs) {\n\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\n\t\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n\t\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n\t\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n\t\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n\t\treturn true;\n\t};\n\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n\t}\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tfor(int j = i + 1; j < segs.size(); j++) {\n\t\t\tif(merge_if_able(segs[i], segs[j])) {\n\t\t\t\tsegs[j--] = segs.back(), segs.pop_back();\n\t\t\t}\n\t\t}\n\t}\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\n\tvector<vector<int>> g;\n\tint N = (int)segs.size();\n\tfor(int i = 0; i < N; i++) {\n\t\tps.emplace_back(segs[i].a);\n\t\tps.emplace_back(segs[i].b);\n\t\tfor(int j = i + 1; j < N; j++) {\n\t\t\tconst Point p1 = segs[i].b - segs[i].a;\n\t\t\tconst Point p2 = segs[j].b - segs[j].a;\n\t\t\tif(eq(cross(p1, p2), 0)) continue;\t// \" == 0\" となっていたのを訂正\n\t\t\tif(intersect(segs[i], segs[j])) {\n\t\t\t\tps.emplace_back(crosspoint(segs[i], segs[j]));\n\t\t\t}\n\t\t}\n\t}\n\tsort(begin(ps), end(ps));\n\tps.erase(unique(begin(ps), end(ps)), end(ps));\t// これ誤差とか大丈夫なのか？\n\n\tint M = (int)ps.size();\n\tg.resize(M);\n\tfor(int i = 0; i < N; i++) {\n\t\tvector<int> vec;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tif(intersect(segs[i], ps[j])) {\n\t\t\t\tvec.emplace_back(j);\n\t\t\t}\n\t\t}\n\t\tfor(int j = 1; j < vec.size(); j++) {\n\t\t\tg[vec[j - 1]].push_back(vec[j]);\n\t\t\tg[vec[j]].push_back(vec[j - 1]);\n\t\t}\n\t}\n\treturn (g);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\nPolygon convex_cut(const Polygon &U, Line l) {\n\tPolygon ret;\n\tfor(int i = 0; i < U.size(); i++) {\n\t\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\n\t\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n\t\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n\t\t\tret.push_back(crosspoint(Line(now, nxt), l));\n\t\t}\n\t}\n\treturn (ret);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// 多角形の面積\nReal area(const Polygon &p) {\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); ++i) {\n\t\tA += cross(p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\t // 0.5倍してなくない？\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\t // 0.5倍が抜けていたので修正;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// 二等分線\nLine bisection(Point a, Point b) {\n\ta = (a + b) * 0.5;\n\tb = rotate(PI / 2, b - a) + a;\n\treturn Line(a, b);\n}\n\n#pragma endregion\n\nvoid sol() {\n\tint n, w;\n\tcin >> n >> w;\n\tif(n + w == 0) exit(0);\n\n\tPoints p(n);\n\tvector<Real> h(n);\n\tfor(int i = 0; i < n; i++) cin >> p[i] >> h[i];\n\n\tvector<Real> r(n);\n\tReal lef, dn, up, rig;\n\tconst Real sz = 100.0;\n\n\tauto judge = [&](Real sphere) {\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(h[i] > sphere) {\n\t\t\t\tr[i] = sphere;\n\t\t\t} else {\n\t\t\t\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\n\t\t\t}\n\t\t}\n\t\tReal margin = sphere;\n\t\tif(sphere > w) {\n\t\t\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\n\t\t}\n\n\t\tlef = margin;\n\t\trig = 100 - margin;\n\t\tup = 100 - margin;\n\t\tdn = margin;\n\n\t\tauto safe = [&](Real x, Real y) {\n\t\t\tif(x < lef - EPS || x > rig + EPS) return false;\n\t\t\tif(y < dn - EPS || y > up + EPS) return false;\n\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t};\n\n\t\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\n\n\t\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tPoints square(4);\n\t\tsquare[0] = Point(lef, up);\n\t\tsquare[1] = Point(lef, dn);\n\t\tsquare[2] = Point(rig, dn);\n\t\tsquare[3] = Point(rig, up);\n\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\t\tif(is == 4 || is == 0) continue;\n\n\t\t\t\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t\t}\n\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < 4; j++) {\n\t\t\t\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\n\t\t\t\t\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\n\t\t\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t\t\t}\n\t\t\t}\n\n\t\treturn false;\n\t};\n\n\tReal ok = 0.0;\n\tReal ng = 10000000000;\n\twhile(ng - ok > 0.00005) {\n\t\tReal med = (ok + ng) / 2;\n\t\tif(judge(med)) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\tcout << ok << '\\n';\n\treturn;\n}\n\nint main() {\n\twhile(1) sol();\n}","accuracy":1,"time_ms":250,"memory_kb":3824,"score_of_the_acc":-0.6849,"final_rank":9},{"submission_id":"aoj_1342_5033645","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region geometry\n\nusing Real = long double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2;\t // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 4;\t // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2;\t // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0;\t\t\t\t\t\t // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定 (反時計回り)\nbool is_convex(const Polygon &p) {\n\tint n = (int)p.size();\n\tfor(int i = 0; i < n; i++) {\n\t\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n\t}\n\treturn true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\nPolygon convex_hull(Polygon &p) {\n\tint n = (int)p.size(), k = 0;\n\tif(n <= 2) return p;\n\tsort(p.begin(), p.end()); // x -> yの順にソート\n\tvector<Point> ch(2 * n);\n\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\n\t\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\n\t\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n\tbool in = false;\n\tfor(int i = 0; i < Q.size(); i++) {\n\t\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n\t\tif(a.imag() > b.imag()) swap(a, b);\n\t\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n\t\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分の重複除去\nvoid merge_segments(vector<Segment> &segs) {\n\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\n\t\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n\t\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n\t\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n\t\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n\t\treturn true;\n\t};\n\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n\t}\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tfor(int j = i + 1; j < segs.size(); j++) {\n\t\t\tif(merge_if_able(segs[i], segs[j])) {\n\t\t\t\tsegs[j--] = segs.back(), segs.pop_back();\n\t\t\t}\n\t\t}\n\t}\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\n\tvector<vector<int>> g;\n\tint N = (int)segs.size();\n\tfor(int i = 0; i < N; i++) {\n\t\tps.emplace_back(segs[i].a);\n\t\tps.emplace_back(segs[i].b);\n\t\tfor(int j = i + 1; j < N; j++) {\n\t\t\tconst Point p1 = segs[i].b - segs[i].a;\n\t\t\tconst Point p2 = segs[j].b - segs[j].a;\n\t\t\tif(eq(cross(p1, p2), 0)) continue;\t// \" == 0\" となっていたのを訂正\n\t\t\tif(intersect(segs[i], segs[j])) {\n\t\t\t\tps.emplace_back(crosspoint(segs[i], segs[j]));\n\t\t\t}\n\t\t}\n\t}\n\tsort(begin(ps), end(ps));\n\tps.erase(unique(begin(ps), end(ps)), end(ps));\t// これ誤差とか大丈夫なのか？\n\n\tint M = (int)ps.size();\n\tg.resize(M);\n\tfor(int i = 0; i < N; i++) {\n\t\tvector<int> vec;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tif(intersect(segs[i], ps[j])) {\n\t\t\t\tvec.emplace_back(j);\n\t\t\t}\n\t\t}\n\t\tfor(int j = 1; j < vec.size(); j++) {\n\t\t\tg[vec[j - 1]].push_back(vec[j]);\n\t\t\tg[vec[j]].push_back(vec[j - 1]);\n\t\t}\n\t}\n\treturn (g);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\nPolygon convex_cut(const Polygon &U, Line l) {\n\tPolygon ret;\n\tfor(int i = 0; i < U.size(); i++) {\n\t\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\n\t\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n\t\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n\t\t\tret.push_back(crosspoint(Line(now, nxt), l));\n\t\t}\n\t}\n\treturn (ret);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// 多角形の面積\nReal area(const Polygon &p) {\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); ++i) {\n\t\tA += cross(p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\t // 0.5倍してなくない？\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\t // 0.5倍が抜けていたので修正;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// 二等分線\nLine bisection(Point a, Point b) {\n\ta = (a + b) * 0.5;\n\tb = rotate(PI / 2, b - a) + a;\n\treturn Line(a, b);\n}\n\n#pragma endregion\n\nusing R = Real;\n\nbool left_is_smaller(R left, R right) { return left < right - EPS; }\n\nvoid sol() {\n\tint n, w;\n\tcin >> n >> w;\n\tif(n + w == 0) exit(0);\n\n\tPoints p(n);\n\tvector<Real> h(n);\n\tfor(int i = 0; i < n; i++) cin >> p[i] >> h[i];\n\n\tvector<Real> r(n);\n\tReal lef, dn, up, rig;\n\tconst Real sz = 100.0;\n\n\tauto judge = [&](Real sphere) {\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(h[i] > sphere) {\n\t\t\t\tr[i] = sphere;\n\t\t\t} else {\n\t\t\t\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\n\t\t\t}\n\t\t}\n\t\tR margin = sphere;\n\t\tif(sphere > w) {\n\t\t\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\n\t\t}\n\n\t\tlef = margin;\n\t\trig = 100 - margin;\n\t\tup = 100 - margin;\n\t\tdn = margin;\n\n\t\tauto safe = [&](Real x, Real y) {\n\t\t\tif(x < lef - EPS || x > rig + EPS) return false;\n\t\t\tif(y < dn - EPS || y > up + EPS) return false;\n\n\t\t\tfor(int i = 0; i < n; i++) {\n\t\t\t\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t};\n\n\t\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\n\n\t\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tPoints square(4);\n\t\tsquare[0] = Point(lef, up);\n\t\tsquare[1] = Point(lef, dn);\n\t\tsquare[2] = Point(rig, dn);\n\t\tsquare[3] = Point(rig, up);\n\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\t\tif(is == 4 || is == 0) continue;\n\n\t\t\t\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t\t}\n\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < 4; j++) {\n\t\t\t\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\n\t\t\t\t\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\n\t\t\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t\t\t}\n\t\t\t}\n\n\t\treturn false;\n\t};\n\n\tR ok = 0.0;\n\tR ng = 10000000000;\n\twhile(ng - ok > 0.00005) {\n\t\tR med = (ok + ng) / 2;\n\t\tif(judge(med)) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\tcout << ok << '\\n';\n\treturn;\n}\n\nint main() {\n\twhile(1) sol();\n}","accuracy":1,"time_ms":250,"memory_kb":3668,"score_of_the_acc":-0.5076,"final_rank":8},{"submission_id":"aoj_1342_5032948","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2020.12.04 10:47:42 */\n\n// #ifdef LOCAL\n// #define _GLIBCXX_DEBUG\n// #endif\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region aliases\n\n#define rep(i, n) for(long long i = 0; i < (n); i++)\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bcnt(n) __builtin_popcountll(n)\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vb = vector<bool>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\ntemplate <class T = ll>\nusing V = vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T = ll>\nusing pqdn = priority_queue<T>;\n\n#pragma endregion\n\n#pragma region constants\n\nlong long const dekai = 1e18;\nconst long double pi = acos(-1);\nconst char dl = '\\n';\nconst char sp = ' ';\nint dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\nint dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};\n\nconst int mod = 1000000007;\n// const int mod = 998244353;\n\n#pragma endregion\n\n#pragma region basic_procedure\n\ntemplate <class T>\ninline bool isin(T x, T lef, T rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool f = 1) { cout << (f ? \"Yes\" : \"No\") << '\\n'; }\nvoid No() { cout << \"No\\n\"; }\nvoid YES(bool f = 1) { cout << (f ? \"YES\" : \"NO\") << '\\n'; }\nvoid NO() { cout << \"NO\\n\"; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tcout << answer << '\\n';\n\texit(0);\n}\n\nvoid err(bool flag) {\n\tif(!flag) return;\n\tcout << -1 << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(vector<T> const &v, bool tate = 0) {\n\tif(tate) {\n\t\tfor(auto const &a : v) {\n\t\t\tcout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tcout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tcout << ' ';\n\t\t}\n\t}\n\tcout << '\\n';\n\treturn;\n}\n\ninline void print() { cout << '\\n'; }\ntemplate <class T>\ninline void print(T x) {\n\tcout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(Head H, Tail... T) {\n\tcout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(vector<T> &v, T val) {\n\tfor(auto &a : v) a += val;\n\treturn;\n}\n\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b != 0);\n\tT x = abs(a);\n\tT y = abs(b);\n\tT z = (x + y - 1) / y;\n\tif((a < 0 && b > 0) || (a > 0 && b < 0))\n\t\treturn -z;\n\telse if(a == 0)\n\t\treturn 0;\n\telse\n\t\treturn z;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\nlong long POW(long long a, long long n) {\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\n// a * x % mod == __gcd(a,mod)なるxを返す\n// a が modの倍数でないことが条件\nlong long modinv(long long a, long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tswap(a, b);\n\t\tu -= t * v;\n\t\tswap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\nvvll comb(100, vll(100, -1));\nlong long com(long long n, long long k) { //普通の二項計数\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(comb[n][k] != -1) return comb[n][k];\n\tll res;\n\tif(n - k < k)\n\t\tres = com(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = com(n - 1, k - 1) + com(n - 1, k);\n\tcomb[n][k] = res;\n\treturn res;\n}\n\nconst int MAX = 5100000; // about 300ms, when MAX = 3*10^7 : 1900ms\nlong long fac[MAX], finv[MAX], inv[MAX];\n\nvoid cominit() {\n\tfac[0] = fac[1] = 1;\n\tfinv[0] = finv[1] = 1;\n\tinv[1] = 1;\n\tfor(int i = 2; i < MAX; i++) {\n\t\tfac[i] = fac[i - 1] * i % mod;\n\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t}\n}\nlong long commod(long long n, long long k) {\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\nlong long pmod(long long n, long long k) {\n\tif(n < k) return 0;\n\tif(n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\nlong long hmod(long long n, long long k) {\t// 重複組み合わせ\n\treturn commod(n + k - 1, n);\n}\n#pragma endregion\n\n#pragma region input\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tINPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tINPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tINPUT(__VA_ARGS__)\n\ntemplate <class T>\nvoid scan(T &a) {\n\tcin >> a;\n}\ntemplate <class T>\nvoid scan(vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\ntemplate <class T, class L>\nvoid scan(pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n#pragma endregion\n\n#pragma region debug\n\n#pragma region output\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(int i = 0; i < (int)v.size(); i++) {\n\t\tif(i) os << \" \";\n\t\tos << v[i];\n\t}\n\treturn os;\n}\n#pragma endregion\n\n#pragma region view\n\ntemplate <typename T>\nvoid view(const T e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << \"(\";\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << \")\";\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tif(s.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(auto &t : s) {\n\t\tview(t);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tif(v.empty()) {\n\t\tstd::cerr << \"{ }\";\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\tfor(const auto &e : v) {\n\t\tview(e);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : vv) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &c : v) {\n\t\tstd::cerr << \"\\t(\";\n\t\tview(c.first);\n\t\tstd::cerr << \", \";\n\t\tview(c.second);\n\t\tstd::cerr << \")\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &t : m) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(t.first);\n\t\tstd::cerr << \"] : \";\n\t\tview(t.second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\n#pragma endregion\n\n// when debugging : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tview(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(0)\n#define dump(x) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" \" << #x << \" : \"; \\\n\t\tview(x); \\\n\t\tstd::cerr << '\\n'; \\\n\t} while(0)\n\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\n#pragma endregion\n\n#pragma region geometry\n\nusing Real = long double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2;\t // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 4;\t // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2;\t // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0;\t\t\t\t\t\t // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定 (反時計回り)\nbool is_convex(const Polygon &p) {\n\tint n = (int)p.size();\n\tfor(int i = 0; i < n; i++) {\n\t\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\n\t}\n\treturn true;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\nPolygon convex_hull(Polygon &p) {\n\tint n = (int)p.size(), k = 0;\n\tif(n <= 2) return p;\n\tsort(p.begin(), p.end()); // x -> yの順にソート\n\tvector<Point> ch(2 * n);\n\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\n\t\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\n\t\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n\t}\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum { OUT, ON, IN };\n\nint contains(const Polygon &Q, const Point &p) {\n\tbool in = false;\n\tfor(int i = 0; i < Q.size(); i++) {\n\t\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n\t\tif(a.imag() > b.imag()) swap(a, b);\n\t\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n\t\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n\t}\n\treturn in ? IN : OUT;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分の重複除去\nvoid merge_segments(vector<Segment> &segs) {\n\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\n\t\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\n\t\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\n\t\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\n\t\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\n\t\treturn true;\n\t};\n\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\n\t}\n\tfor(int i = 0; i < segs.size(); i++) {\n\t\tfor(int j = i + 1; j < segs.size(); j++) {\n\t\t\tif(merge_if_able(segs[i], segs[j])) {\n\t\t\t\tsegs[j--] = segs.back(), segs.pop_back();\n\t\t\t}\n\t\t}\n\t}\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\n\tvector<vector<int>> g;\n\tint N = (int)segs.size();\n\tfor(int i = 0; i < N; i++) {\n\t\tps.emplace_back(segs[i].a);\n\t\tps.emplace_back(segs[i].b);\n\t\tfor(int j = i + 1; j < N; j++) {\n\t\t\tconst Point p1 = segs[i].b - segs[i].a;\n\t\t\tconst Point p2 = segs[j].b - segs[j].a;\n\t\t\tif(eq(cross(p1, p2), 0)) continue;\t// \" == 0\" となっていたのを訂正\n\t\t\tif(intersect(segs[i], segs[j])) {\n\t\t\t\tps.emplace_back(crosspoint(segs[i], segs[j]));\n\t\t\t}\n\t\t}\n\t}\n\tsort(begin(ps), end(ps));\n\tps.erase(unique(begin(ps), end(ps)), end(ps));\t// これ誤差とか大丈夫なのか？\n\n\tint M = (int)ps.size();\n\tg.resize(M);\n\tfor(int i = 0; i < N; i++) {\n\t\tvector<int> vec;\n\t\tfor(int j = 0; j < M; j++) {\n\t\t\tif(intersect(segs[i], ps[j])) {\n\t\t\t\tvec.emplace_back(j);\n\t\t\t}\n\t\t}\n\t\tfor(int j = 1; j < vec.size(); j++) {\n\t\t\tg[vec[j - 1]].push_back(vec[j]);\n\t\t\tg[vec[j]].push_back(vec[j - 1]);\n\t\t}\n\t}\n\treturn (g);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\nPolygon convex_cut(const Polygon &U, Line l) {\n\tPolygon ret;\n\tfor(int i = 0; i < U.size(); i++) {\n\t\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\n\t\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n\t\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n\t\t\tret.push_back(crosspoint(Line(now, nxt), l));\n\t\t}\n\t}\n\treturn (ret);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// 多角形の面積\nReal area(const Polygon &p) {\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); ++i) {\n\t\tA += cross(p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(const Polygon &p, const Circle &c) {\n\tif(p.size() < 3) return 0.0;\n\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n\t\tPoint va = c.p - a, vb = c.p - b;\n\t\tReal f = cross(va, vb), ret = 0.0;\n\t\tif(eq(f, 0.0)) return ret;\n\t\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\n\t\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\t // 0.5倍してなくない？\n\t\tauto u = crosspoint(c, Segment(a, b));\n\t\tvector<Point> tot{a, u.first, u.second, b};\n\t\tfor(int i = 0; i + 1 < tot.size(); i++) {\n\t\t\tret += cross_area(c, tot[i], tot[i + 1]);\n\t\t}\n\t\treturn ret;\n\t};\n\tReal A = 0;\n\tfor(int i = 0; i < p.size(); i++) {\n\t\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\n\t}\n\treturn A * 0.5;\t // 0.5倍が抜けていたので修正;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\nReal convex_diameter(const Polygon &p) {\n\tint N = (int)p.size();\n\tint is = 0, js = 0;\n\tfor(int i = 1; i < N; i++) {\n\t\tif(p[i].imag() > p[is].imag()) is = i;\n\t\tif(p[i].imag() < p[js].imag()) js = i;\n\t}\n\tReal maxdis = norm(p[is] - p[js]);\n\n\tint maxi, maxj, i, j;\n\ti = maxi = is;\n\tj = maxj = js;\n\tdo {\n\t\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\n\t\t\tj = (j + 1) % N;\n\t\t} else {\n\t\t\ti = (i + 1) % N;\n\t\t}\n\t\tif(norm(p[i] - p[j]) > maxdis) {\n\t\t\tmaxdis = norm(p[i] - p[j]);\n\t\t\tmaxi = i;\n\t\t\tmaxj = j;\n\t\t}\n\t} while(i != is || j != js);\n\treturn sqrt(maxdis);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\nReal closest_pair(Points ps) {\n\tif(ps.size() <= 1) throw(0);\n\tsort(begin(ps), end(ps)); // xでソート\n\n\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\n\tvector<Point> beet(ps.size());\n\tconst Real INF = 1e18;\n\n\tfunction<Real(int, int)> rec = [&](int left, int right) {\n\t\tif(right - left <= 1) return INF;\n\t\tint mid = (left + right) >> 1;\n\t\tauto x = real(ps[mid]);\t // 領域内でx座標真中の点\n\t\tauto ret = min(rec(left, mid), rec(mid, right));\n\t\t// y座標でソートされた2つの区間をマージ\n\t\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n\t\tint ptr = 0;\n\t\tfor(int i = left; i < right; i++) {\n\t\t\tif(abs(real(ps[i]) - x) >= ret) continue;\n\t\t\tfor(int j = 0; j < ptr; j++) {\n\t\t\t\tauto luz = ps[i] - beet[ptr - j - 1];\n\t\t\t\tif(imag(luz) >= ret) break;\n\t\t\t\tret = min(ret, abs(luz));\n\t\t\t}\n\t\t\tbeet[ptr++] = ps[i];\n\t\t}\n\t\treturn ret;\n\t};\n\treturn rec(0, (int)ps.size());\n}\n\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\n\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\n\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\n\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\n\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\n\treturn Circle(p, r);\n}\n\n// 二等分線\nLine bisection(Point a, Point b) {\n\ta = (a + b) * 0.5;\n\tb = rotate(PI / 2, b - a) + a;\n\treturn Line(a, b);\n}\n\n#pragma endregion\n\nusing R = Real;\n\nbool left_is_smaller(R left, R right) { return left < right - EPS; }\n\nvoid sol() {\n\tint n, w;\n\tcin >> n >> w;\n\tif(n + w == 0) exit(0);\n\n\tPoints p(n);\n\tV<Real> h(n);\n\trep(i, n) cin >> p[i] >> h[i];\n\n\tV<Real> r(n);\n\tReal lef, dn, up, rig;\n\tconst Real sz = 100.0;\n\n\tauto judge = [&](Real sphere) {\n\t\trep(i, n) {\n\t\t\tif(h[i] > sphere) {\n\t\t\t\tr[i] = sphere;\n\t\t\t} else {\n\t\t\t\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\n\t\t\t}\n\t\t}\n\t\tR margin = sphere;\n\t\tif(sphere > w) {\n\t\t\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\n\t\t}\n\n\t\tlef = margin;\n\t\trig = 100 - margin;\n\t\tup = 100 - margin;\n\t\tdn = margin;\n\n\t\tauto safe = [&](Real x, Real y) {\n\t\t\tif(x < lef - EPS || x > rig + EPS) return false;\n\t\t\tif(y < dn - EPS || y > up + EPS) return false;\n\n\t\t\trep(i, n) {\n\t\t\t\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t};\n\n\t\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\n\n\t\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\n\t\t\treturn true;\n\t\t}\n\n\t\tPoints square(4);\n\t\tsquare[0] = Point(lef, up);\n\t\tsquare[1] = Point(lef, dn);\n\t\tsquare[2] = Point(rig, dn);\n\t\tsquare[3] = Point(rig, up);\n\n\t\trep(i, n) Rep(j, i + 1, n) {\n\t\t\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\tif(is == 4 || is == 0) continue;\n\n\t\t\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\n\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t}\n\n\t\trep(i, n) rep(j, 4) {\n\t\t\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\n\t\t\t\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\n\t\t\t\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tR ok = 0.0;\n\tR ng = 10000000000;\n\trep(_, 1000) {\n\t\tR med = (ok + ng) / 2;\n\t\tif(judge(med)) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\tcout << ok << dl;\n\treturn;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\twhile(1) sol();\n\n\treturn 0;\n}","accuracy":1,"time_ms":6980,"memory_kb":3924,"score_of_the_acc":-1.6658,"final_rank":20},{"submission_id":"aoj_1342_5032173","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Real = double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-12, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0; // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 0; // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2; // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0; // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid solve() {\n\tint n, m;\n\tcin >> n >> m;\n\tif(!n) exit(0);\n\n\tPoints p(n);\n\tvector<Real> h(n);\n\t//input\n\tfor(int i = 0; i < n; i++)\n\t\tcin >> p[i] >> h[i];\n\n\t//二分探索の判定関数\n\tauto judge = [&](Real rad) {\n\t\t//確実に置けない円\n\t\tCircles Cir(n);\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(h[i] >= rad)\n\t\t\t\tCir[i].r = rad;\n\t\t\telse\n\t\t\t\tCir[i].r = sqrt(h[i] * rad * 2 - h[i] * h[i]);\n\t\t\tCir[i].p = p[i];\n\t\t}\n\n\t\tReal blank = (m >= rad ? rad : sqrt(m * rad * 2 - m * m));\n\n\t\tif(blank > 50) return false;\n\n\t\tPoint a = {blank, blank}, b = {blank, 100 - blank}, c = {100 - blank, 100 - blank}, d = {100 - blank, blank};\n\n\t\tSegments SEG = {Segment(a, b), Segment(b, c), Segment(c, d), Segment(d, a)};\n\n\t\tPoints candidate = {a, b, c, d};\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\t//円同士の交点を全列挙\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tif(intersect(Cir[i], Cir[j])) {\n\t\t\t\t\tauto [p1, p2] = crosspoint(Cir[i], Cir[j]);\n\t\t\t\t\tcandidate.push_back(p1);\n\t\t\t\t\tcandidate.push_back(p2);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//円と正方形の交点を全列挙\n\t\t\tfor(int j = 0; j < 4; j++) {\n\t\t\t\tif(intersect(Cir[i], SEG[j])) {\n\t\t\t\t\tauto [p1, p2] = crosspoint(Cir[i], SEG[j]);\n\t\t\t\t\tcandidate.push_back(p1);\n\t\t\t\t\tcandidate.push_back(p2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto satisfied = [&](Point p) {\n\t\t\tfor(auto c : Cir) {\n\t\t\t\tif(distance(p, c.p) + EPS < c.r) return false;\n\t\t\t}\n\t\t\tif(p.real() + EPS < blank) return false;\n\t\t\tif(p.imag() + EPS < blank) return false;\n\t\t\tif(p.real() - EPS > 100 - blank) return false;\n\t\t\tif(p.imag() - EPS > 100 - blank) return false;\n\t\t\treturn true;\n\t\t};\n\n\t\tfor(auto &p : candidate) \n\t\t\tif(satisfied(p)) return true;\n\t\t\n\t\treturn false;\n\t};\n\n\tReal ok = 0, ng = 200;\n\tfor(int i = 0; i < 25; i++) {\n\t\tReal mid = (ok + ng) / 2;\n\t\tif(judge(mid))\n\t\t\tok = mid;\n\t\telse\n\t\t\tng = mid;\n\t}\n\tcout << ok << '\\n';\n\treturn;\n}\n\nint main() {\n\tcout << fixed << setprecision(15);\n\twhile(1) solve();\n}","accuracy":1,"time_ms":80,"memory_kb":4076,"score_of_the_acc":-0.9493,"final_rank":15},{"submission_id":"aoj_1342_5032144","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Real = double; //時間がかかる割にdoubleと大差ない\nusing Point = complex<Real>;\nconst Real EPS = 1e-12, /*1e-8はたまに落ちる*/ PI = acos(-1);\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\n\n//実スカラー倍\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n\n// point入力受け取り\nistream &operator>>(istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\n// point出力\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// 点 p を反時計回りに theta 回転\nPoint rotate(Real theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\n\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\n\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\n\tif(alpha > beta) swap(alpha, beta);\n\tReal theta = (beta - alpha);\n\treturn min(theta, 2 * acos(-1) - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \" to \" << p.b; }\n\n\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\n//外積\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\n//内積\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1; // \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\"\n\tif(dot(b, c) < 0) return +2; // \"ONLINE_BACK\"\n\tif(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\"\n\treturn 0; // \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\n\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\n\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\n\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\n\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\n\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\n\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\nbool intersect(const Segment &s, const Segment &t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l) {\n\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\n\tconst Point h = projection(l, c.p);\n\tif(dot(l.a - h, l.b - h) < 0) return 2;\n\treturn 0;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2) {\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal d = abs(c1.p - c2.p);\n\tif(c1.r + c2.r < d) return 0; // 外に離れている\n\tif(eq(c1.r + c2.r, d)) return 3; // 外接\n\tif(c1.r - c2.r < d) return 2; // 交差\n\tif(eq(c1.r - c2.r, d)) return 1; // 内接\n\treturn 0; // 内包\n}\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\tif(intersect(s, r)) return abs(r - p);\n\treturn min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b) {\n\tif(intersect(a, b)) return 0;\n\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s) {\n\tif(intersect(l, s)) return 0;\n\treturn min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tPoint e = (l.b - l.a) / abs(l.b - l.a);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\n\treturn {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tLine aa = Line(l.a, l.b);\n\tif(intersect(c, l) == 2) return crosspoint(c, aa);\n\tauto ret = crosspoint(c, aa);\n\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn {p1, p2};\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\nLines tangent(Circle c1, Circle c2) {\n\tLines ret;\n\tif(c1.r < c2.r) swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tPoint u = (c2.p - c1.p) / sqrt(g);\n\tPoint v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid solve() {\n\tint n, m;\n\tcin >> n >> m;\n\tif(!n) exit(0);\n\tPoints p(n);\n\tvector<Real> h(n);\n\tfor(int i = 0; i < n; i++)\n\t\tcin >> p[i] >> h[i];\n\n\tauto judge = [&](Real rad) {\n\t\tCircles Cir(n);\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tif(h[i] >= rad)\n\t\t\t\tCir[i].r = rad;\n\t\t\telse\n\t\t\t\tCir[i].r = sqrt(h[i] * rad * 2 - h[i] * h[i]);\n\t\t\tCir[i].p = p[i];\n\t\t}\n\n\t\tReal blank = (m >= rad ? rad : sqrt(m * rad * 2 - m * m));\n\n\t\tif(blank > 50) return false;\n\n\t\tPoint a = {blank, blank}, b = {blank, 100 - blank}, c = {100 - blank, 100 - blank}, d = {100 - blank, blank};\n\n\t\tSegments SEG = {Segment(a, b), Segment(b, c), Segment(c, d), Segment(d, a)};\n\n\t\tPoints candidate = {a, b, c, d};\n\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\t//円同士の交点を全列挙\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tif(intersect(Cir[i], Cir[j])) {\n\t\t\t\t\tauto [p1, p2] = crosspoint(Cir[i], Cir[j]);\n\t\t\t\t\tcandidate.push_back(p1);\n\t\t\t\t\tcandidate.push_back(p2);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//円と正方形の交点を全列挙\n\t\t\tfor(int j = 0; j < 4; j++) {\n\t\t\t\tif(intersect(Cir[i], SEG[j])) {\n\t\t\t\t\tauto [p1, p2] = crosspoint(Cir[i], SEG[j]);\n\t\t\t\t\tcandidate.push_back(p1);\n\t\t\t\t\tcandidate.push_back(p2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto satisfied = [&](Point p) {\n\t\t\tfor(auto c : Cir) {\n\t\t\t\tif(distance(p, c.p) + EPS < c.r) return false;\n\t\t\t}\n\t\t\tif(p.real() + EPS < blank) return false;\n\t\t\tif(p.imag() + EPS < blank) return false;\n\t\t\tif(p.real() - EPS > 100 - blank) return false;\n\t\t\tif(p.imag() - EPS > 100 - blank) return false;\n\t\t\treturn true;\n\t\t};\n\n\t\tfor(auto &p : candidate) {\n\t\t\tif(satisfied(p)) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tReal ok = 0, ng = 300;\n\tfor(int i = 0; i < 50; i++) {\n\t\tReal mid = (ok + ng) / 2;\n\t\tif(judge(mid))\n\t\t\tok = mid;\n\t\telse\n\t\t\tng = mid;\n\t}\n\tcout << ok << '\\n';\n\treturn;\n}\n\nint main() {\n\tcout << fixed << setprecision(15);\n\twhile(1) solve();\n}","accuracy":1,"time_ms":150,"memory_kb":3956,"score_of_the_acc":-0.822,"final_rank":11},{"submission_id":"aoj_1342_4964564","code_snippet":"#line 1 \"a.cpp\"\nusing namespace std;\n#line 1 \"/home/kotatsugame/library/math/point.cpp\"\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<cmath>\n#include<iomanip>\nconst double EPS=1e-10;\nbool eq(double a,double b){return abs(a-b)<EPS;}\nstruct Point{\n\tdouble x,y;\n\tPoint(double x_=0,double y_=0):x(x_),y(y_){}\n\tPoint operator-()const{return Point(-x,-y);}\n\tPoint operator+(const Point&p)const{return Point(x+p.x,y+p.y);}\n\tPoint operator-(const Point&p)const{return Point(x-p.x,y-p.y);}\n\tPoint operator*(const double k)const{return Point(x*k,y*k);}\n\tPoint operator/(const double k)const{return Point(x/k,y/k);}\n\tbool operator<(const Point&p)const{return eq(x,p.x)?y<p.y:x<p.x;}\n\tbool operator==(const Point&p)const{return eq(x,p.x)&&eq(y,p.y);}\n};\nistream&operator>>(istream&is,Point&p){return is>>p.x>>p.y;}\nostream&operator<<(ostream&os,const Point&p){return os<<fixed<<setprecision(9)<<p.x<<' '<<p.y;}\nstruct Line{\n\tPoint p1,p2;\n\tLine(Point p1_=Point(),Point p2_=Point()):p1(p1_),p2(p2_){}\n};\nstruct Segment:Line{\n\tSegment(Point p1_=Point(),Point p2_=Point()):Line(p1_,p2_){}\n};\nstruct Circle{\n\tPoint o;\n\tdouble r;\n\tCircle(Point o_=Point(),double r_=0):o(o_),r(r_){}\n};\nusing Polygon=vector<Point>;\n//function list begin\nPoint vec(const Line&);\ndouble norm(const Point&);\ndouble norm(const Line&);\ndouble abs(const Point&);\ndouble abs(const Line&);\ndouble arg(const Point&);\ndouble arg(const Line&);\ndouble arg(const Point&,const Point&,const Point&);//a->b->c\nint argtype(const Point&);//(-pi,0]->0,(0,pi]->1\nbool argless(const Point&,const Point&);//sorting points with arg\ndouble dot(const Point&,const Point&);\ndouble cross(const Point&,const Point&);\nPoint polar(const double,const double);\nPoint rotate(const Point&,const double);\nenum{ONLINE_FRONT=-2,CLOCKWISE=-1,ON_SEGMENT=0,COUNTER_CLOCKWISE=1,ONLINE_BACK=2};\nint ccw(const Point&,const Point&);\nint ccw(const Point&,const Point&,const Point&);\nint ccw(const Line&,const Point&);\nbool orthogonal(const Point&,const Point&);\nbool orthogonal(const Line&,const Line&);\nbool parallel(const Point&,const Point&);\nbool parallel(const Line&,const Line&);\nbool intersect(const Line&,const Point&);\nbool intersect(const Line&,const Line&);\nbool intersect(const Segment&,const Point&);\nbool intersect(const Segment&,const Segment&);\nbool intersect(const Line&,const Segment&);\nbool intersect(const Segment&,const Line&);\nbool intersect(const Circle&,const Point&);\nint intersect(const Circle&,const Line&);//count contacts\nint intersect(const Circle&,const Segment&);\nint intersect(const Circle&,const Circle&);//count common tangents\ndouble distance(const Point&,const Point&);\ndouble distance(const Line&,const Point&);\ndouble distance(const Line&,const Line&);\ndouble distance(const Segment&,const Point&);\ndouble distance(const Segment&,const Segment&);\ndouble distance(const Line&,const Segment&);\ndouble distance(const Segment&,const Line&);\ndouble distance(const Circle&,const Point&);\ndouble distance(const Circle&,const Line&);\ndouble distance(const Circle&,const Segment&);\ndouble distance(const Circle&,const Circle&);\nPoint projection(const Line&,const Point&);\nPoint reflection(const Line&,const Point&);\nPoint crosspoint(const Line&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Line&);\npair<Point,Point>crosspoint(const Circle&,const Segment&);\npair<Point,Point>crosspoint(const Circle&,const Circle&);\npair<Point,Point>tangent(const Circle&,const Point&);\nvector<Line>tangent(const Circle&,const Circle&);\nbool is_convex(const Polygon&);\nPolygon convex_hull(Polygon,bool=false);\nenum{OUT,ON,IN};\nint contain(const Polygon&,const Point&);\nint contain(const Circle&,const Point&);\nint contain(const Circle&,const Segment&);\nPolygon convex_cut(const Polygon&,const Line&);\ndouble diameter(Polygon);\ndouble area(const Polygon&);\ndouble area(const Polygon&,const Line&);\ndouble area(const Polygon&,const Circle&);\n//function list end\nPoint vec(const Line&s){return s.p2-s.p1;}\ndouble norm(const Point&p){return p.x*p.x+p.y*p.y;}\ndouble norm(const Line&s){return norm(vec(s));}\ndouble abs(const Point&p){return hypot(p.x,p.y);}\ndouble abs(const Line&s){return abs(vec(s));}\ndouble arg(const Point&p){return atan2(p.y,p.x);}\ndouble arg(const Line&s){return arg(vec(s));}\ndouble arg(const Point&a,const Point&b,const Point&c){\n\tdouble A=arg(b-a),B=arg(c-b);\n\tdouble theta=abs(A-B);\n\treturn min(theta,2*M_PI-theta);\n}\nint argtype(const Point&a)\n{\n\treturn a.y<-EPS?0:a.y>EPS?1:a.x<0?1:0;\n}\nbool argless(const Point&a,const Point&b)\n{\n\tint at=argtype(a),bt=argtype(b);\n\treturn at!=bt?at<bt:ccw(a,b)>0;\n}\ndouble dot(const Point&a,const Point&b){return a.x*b.x+a.y*b.y;}\ndouble cross(const Point&a,const Point&b){return a.x*b.y-a.y*b.x;}\nPoint polar(const double r,const double theta){return Point(cos(theta),sin(theta))*r;}\nPoint rotate(const Point&p,const double theta){\n\treturn Point(p.x*cos(theta)-p.y*sin(theta),p.x*sin(theta)+p.y*cos(theta));\n}\nint ccw(const Point&a,const Point&b)\n{\n\treturn cross(a,b)>EPS?COUNTER_CLOCKWISE\n\t\t:cross(a,b)<-EPS?CLOCKWISE\n\t\t:dot(a,b)<0?ONLINE_BACK\n\t\t:norm(a)<norm(b)?ONLINE_FRONT\n\t\t:ON_SEGMENT;\n}\nint ccw(const Point&a,const Point&b,const Point&c){return ccw(b-a,c-a);}\nint ccw(const Line&s,const Point&p){return ccw(s.p1,s.p2,p);}\nbool orthogonal(const Point&a,const Point&b){return eq(dot(a,b),0);}\nbool orthogonal(const Line&s,const Line&t){return orthogonal(vec(s),vec(t));}\nbool parallel(const Point&a,const Point&b){return eq(cross(a,b),0);}\nbool parallel(const Line&s,const Line&t){return parallel(vec(s),vec(t));}\nbool intersect(const Line&s,const Point&p){return eq(cross(vec(s),p-s.p1),0);}\nbool intersect(const Line&s,const Line&t){return !parallel(s,t)||intersect(s,t.p1);}\nbool intersect(const Segment&s,const Point&p){return ccw(s,p)==ON_SEGMENT;}\nbool intersect(const Segment&s,const Segment&t){\n\treturn ccw(s,t.p1)*ccw(s,t.p2)<=0&&ccw(t,s.p1)*ccw(t,s.p2)<=0;\n}\nbool intersect(const Line&s,const Segment&t){\n\treturn cross(vec(s),t.p1-s.p1)*cross(vec(s),t.p2-s.p1)<EPS;\n}\nbool intersect(const Segment&s,const Line&t){return intersect(t,s);}\nbool intersect(const Circle&c,const Point&p){return eq(distance(c.o,p),c.r);}\nint intersect(const Circle&c,const Line&s){\n\tdouble d=distance(s,c.o);\n\treturn eq(d,c.r)?1:d<c.r?2:0;\n}\nint intersect(const Circle&c,const Segment&s){\n\tPoint h=projection(s,c.o);\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn distance(c.o,h)>c.r+EPS?0\n\t\t:d1<c.r-EPS&&d2<c.r-EPS?0\n\t\t:d1<c.r-EPS&&d2>c.r-EPS||d1>c.r-EPS&&d2<c.r-EPS?1\n\t\t:intersect(s,h)?eq(distance(c.o,h),c.r)?1:2\n\t\t:0;\n}\nint intersect(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\treturn eq(d,a.r+b.r)?3:d>a.r+b.r?4:eq(d,abs(a.r-b.r))?1:d>abs(a.r-b.r)?2:0;\n}\ndouble distance(const Point&a,const Point&b){return abs(a-b);}\ndouble distance(const Line&s,const Point&p){return distance(p,projection(s,p));}\ndouble distance(const Line&s,const Line&t){return intersect(s,t)?0:distance(s,t.p1);}\ndouble distance(const Segment&s,const Point&p){\n\treturn distance(p,\n\t\tdot(vec(s),p-s.p1)<0?s.p1\n\t\t:dot(-vec(s),p-s.p2)<0?s.p2\n\t\t:projection(s,p)\n\t);\n}\ndouble distance(const Segment&s,const Segment&t){\n\treturn intersect(s,t)?0:min({\n\t\tdistance(s,t.p1),distance(s,t.p2),\n\t\tdistance(t,s.p1),distance(t,s.p2)\n\t});\n}\ndouble distance(const Line&s,const Segment&t){\n\treturn intersect(s,t)?0:min(distance(s,t.p1),distance(s,t.p2));\n}\ndouble distance(const Segment&s,const Line&t){return distance(t,s);}\ndouble distance(const Circle&c,const Point&p){return abs(distance(c.o,p)-c.r);}\ndouble distance(const Circle&c,const Line&s){return max(distance(s,c.o)-c.r,0.);}\ndouble distance(const Circle&c,const Segment&s){\n\treturn intersect(c,s)?0\n\t\t:contain(c,s)?c.r-max(distance(c.o,s.p1),distance(c.o,s.p2))\n\t\t:distance(s,c.o)-c.r;\n}\ndouble distance(const Circle&a,const Circle&b){return max(distance(a.o,b.o)-a.r-b.r,0.);}\nPoint projection(const Line&s,const Point&p){\n\treturn s.p1+vec(s)*dot(p-s.p1,vec(s))/norm(s);\n}\nPoint reflection(const Line&s,const Point&p){return projection(s,p)*2-p;}\nPoint crosspoint(const Line&s,const Line&t){\n\tdouble d1=cross(vec(s),t.p1-s.p1);\n\tdouble d2=-cross(vec(s),t.p2-s.p1);\n\treturn t.p1+vec(t)*(d1/(d1+d2));\n}\npair<Point,Point>crosspoint(const Circle&c,const Line&s){\n\tPoint h=projection(s,c.o);\n\tPoint e=vec(s)/abs(s)*sqrt(c.r*c.r-norm(h-c.o));\n\treturn minmax(h-e,h+e);\n}\npair<Point,Point>crosspoint(const Circle&c,const Segment&s){\n\tpair<Point,Point>p=crosspoint(c,Line(s));\n\treturn intersect(c,s)==2?p\n\t\t:intersect(s,p.first)?make_pair(p.first,p.first)\n\t\t:make_pair(p.second,p.second);\n}\npair<Point,Point>crosspoint(const Circle&a,const Circle&b){\n\tdouble d=distance(a.o,b.o);\n\tdouble alpha=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\n\tdouble theta=arg(b.o-a.o);\n\treturn minmax(a.o+polar(a.r,theta+alpha),a.o+polar(a.r,theta-alpha));\n}\npair<Point,Point>tangent(const Circle&c,const Point&p){\n\treturn crosspoint(c,Circle(p,sqrt(norm(c.o-p)-c.r*c.r)));\n}\nvector<Line>tangent(const Circle&a,const Circle&b){\n\tvector<Line>ret;\n\tdouble g=distance(a.o,b.o);\n\tif(eq(g,0))return ret;\n\tPoint u=(b.o-a.o)/g;\n\tPoint v=rotate(u,M_PI/2);\n\tfor(int s:{-1,1}){\n\t\tdouble h=(a.r+b.r*s)/g;\n\t\tif(eq(h*h,1))ret.emplace_back(a.o+(h>0?u:-u)*a.r,a.o+(h>0?u:-u)*a.r+v);\n\t\telse if(1-h*h>0){\n\t\t\tPoint U=u*h,V=v*sqrt(1-h*h);\n\t\t\tret.emplace_back(a.o+(U+V)*a.r,b.o-(U+V)*b.r*s);\n\t\t\tret.emplace_back(a.o+(U-V)*a.r,b.o-(U-V)*b.r*s);\n\t\t}\n\t}\n\treturn ret;\n}\nbool is_convex(const Polygon&P){\n\tfor(int i=0;i<P.size();i++)\n\t\tif(ccw(P[i],P[(i+1)%P.size()],P[(i+2)%P.size()])==CLOCKWISE)return false;\n\treturn true;\n}\nPolygon convex_hull(Polygon P,bool ONSEG){\n\tif(P.size()<=2)return P;\n\tsort(P.begin(),P.end());\n\tPolygon ret(2*P.size());\n\tint k=0,t;\n\tif(ONSEG){\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)==CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])==CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\telse{\n\t\tfor(const Point&p:P){\n\t\t\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=p;\n\t\t}\n\t\tt=k;\n\t\tfor(int i=P.size()-2;i>=0;i--){\n\t\t\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])!=COUNTER_CLOCKWISE)k--;\n\t\t\tret[k++]=P[i];\n\t\t}\n\t}\n\tret.resize(k-1);\n\tint mi=0;\n\tfor(int i=1;i<k-1;i++)\n\t\tif(eq(ret[mi].y,ret[i].y)?ret[mi].x>ret[i].x:ret[mi].y>ret[i].y)mi=i;\n\trotate(ret.begin(),ret.begin()+mi,ret.end());\n\treturn ret;\n}\nint contain(const Polygon&P,const Point&p){\n\tbool in=false;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(intersect(s,p))return ON;\n\t\telse{\n\t\t\tPoint a=s.p1-p,b=s.p2-p;\n\t\t\tif(a.y>b.y)swap(a,b);\n\t\t\tif(a.y<EPS&&EPS<b.y&&cross(a,b)>EPS)in=!in;\n\t\t}\n\t}\n\treturn in?IN:OUT;\n}\nint contain(const Circle&c,const Point&p){\n\tdouble d=distance(c.o,p);\n\treturn eq(d,c.r)?ON:d<c.r?IN:OUT;\n}\nint contain(const Circle&c,const Segment&s){\n\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\n\treturn d1<c.r+EPS&&d2<c.r+EPS?eq(d1,c.r)||eq(d2,c.r)?ON:IN:OUT;\n}\nPolygon convex_cut(const Polygon&P,const Line&s){\n\tPolygon ret;\n\tfor(int i=0;i<P.size();i++){\n\t\tSegment t(P[i],P[(i+1)%P.size()]);\n\t\tif(ccw(s,t.p1)!=CLOCKWISE)ret.push_back(t.p1);\n\t\tif(!parallel(s,t)&&!intersect(s,t.p1)\n\t\t\t&&!intersect(s,t.p2)&&intersect(s,t))ret.push_back(crosspoint(s,t));\n\t}\n\treturn ret;\n}\ndouble diameter(Polygon P){\n\tif(!is_convex(P))P=convex_hull(P);\n\tint mi=0,Mi=0;\n\tfor(int i=1;i<P.size();i++){\n\t\tif(P[i].x<P[mi].x)mi=i;\n\t\tif(P[i].x>P[Mi].x)Mi=i;\n\t}\n\tdouble ret=0;\n\tint sm=mi,sM=Mi;\n\twhile(mi!=sM||Mi!=sm){\n\t\tret=max(ret,norm(P[mi]-P[Mi]));\n\t\tif(cross(P[(mi+1)%P.size()]-P[mi],P[(Mi+1)%P.size()]-P[Mi])<0)mi=(mi+1)%P.size();\n\t\telse Mi=(Mi+1)%P.size();\n\t}\n\treturn sqrt(ret);\n}\ndouble area(const Polygon&P){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)ret+=cross(P[i],P[(i+1)%P.size()]);\n\treturn ret/2;\n}\ndouble area(const Polygon&P,const Line&s){return area(convex_cut(P,s));}\ndouble area(const Polygon&P,const Circle&c){\n\tdouble ret=0;\n\tfor(int i=0;i<P.size();i++)\n\t{\n\t\tSegment s(P[i],P[(i+1)%P.size()]);\n\t\tif(contain(c,s))ret+=cross(s.p1-c.o,s.p2-c.o);\n\t\telse if(!intersect(c,s)){\n\t\t\tdouble a=arg(s.p2-c.o)-arg(s.p1-c.o);\n\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\tret+=c.r*c.r*a;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpair<Point,Point>p=crosspoint(c,s);\n\t\t\tPoint tmp[4]={s.p1,p.first,p.second,s.p2};\n\t\t\tif(intersect(c,Segment(s.p1,p.first))==2)swap(tmp[1],tmp[2]);\n\t\t\tfor(int j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSegment t(tmp[j],tmp[j+1]);\n\t\t\t\tif(contain(c,t))ret+=cross(t.p1-c.o,t.p2-c.o);\n\t\t\t\telse{\n\t\t\t\t\tdouble a=arg(t.p2-c.o)-arg(t.p1-c.o);\n\t\t\t\t\tif(a>M_PI)a-=2*M_PI;\n\t\t\t\t\tif(a<-M_PI)a+=2*M_PI;\n\t\t\t\t\tret+=c.r*c.r*a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ret/2;\n}\n#line 3 \"a.cpp\"\nint N,W;\nPoint p[10];\nint h[10];\nCircle C[10];\ndouble calc(double h,double r)\n{\n\tif(h>r)return r;\n\telse return sqrt(2*r*h-h*h);\n}\nbool in(Point p,double w)\n{\n\tfor(int i=0;i<N;i++)if(contain(C[i],p)==IN)return false;\n\treturn w-EPS<p.x&&p.x<100-w+EPS&&w-EPS<p.y&&p.y<100-w+EPS;\n}\nmain()\n{\n\twhile(cin>>N>>W,N)\n\t{\n\t\tfor(int i=0;i<N;i++)cin>>p[i]>>h[i];\n\t\tdouble le=0,ri=1e6;\n\t\tfor(int c=0;c<100;c++)\n\t\t{\n\t\t\tdouble r=(le+ri)/2;\n\t\t\tdouble w=calc(W,r);\n\t\t\tfor(int i=0;i<N;i++)\n\t\t\t{\n\t\t\t\tC[i]=Circle(p[i],calc(h[i],r));\n\t\t\t}\n\t\t\tbool ok=false;\n\t\t\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)\n\t\t\t{\n\t\t\t\tint cnt=intersect(C[i],C[j]);\n\t\t\t\tif(cnt==0||cnt==4)continue;\n\t\t\t\tpair<Point,Point>tmp=crosspoint(C[i],C[j]);\n\t\t\t\tif(in(tmp.first,w)||in(tmp.second,w))ok=true;\n\t\t\t}\n\t\t\tPoint cr[4]={Point(w,w),Point(w,100-w),Point(100-w,w),Point(100-w,100-w)};\n\t\t\tLine L[4]={Line(cr[0],cr[1]),Line(cr[0],cr[2]),Line(cr[1],cr[3]),Line(cr[2],cr[3])};\n\t\t\tfor(int i=0;i<N;i++)for(int j=0;j<4;j++)if(intersect(C[i],L[j]))\n\t\t\t{\n\t\t\t\tpair<Point,Point>tmp=crosspoint(C[i],L[j]);\n\t\t\t\tif(in(tmp.first,w)||in(tmp.second,w))ok=true;\n\t\t\t}\n\t\t\tfor(int i=0;i<4;i++)for(int j=i+1;j<4;j++)\n\t\t\t{\n\t\t\t\tif(in(crosspoint(L[i],L[j]),w))ok=true;\n\t\t\t}\n\t\t\tif(ok)le=r;\n\t\t\telse ri=r;\n\t\t}\n\t\tcout<<fixed<<setprecision(16)<<le<<endl;\n\t}\n}","accuracy":1,"time_ms":490,"memory_kb":3576,"score_of_the_acc":-0.434,"final_rank":7},{"submission_id":"aoj_1342_4952281","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=2005;\n//const int INF=1<<30;\nconst ll INF=1LL<<60;\n//幾何ライブラリ\n\nconst double eps=1e-8;\nconst double pi=acos((double)-1.0L);\n#define equals(a,b) (fabs((a)-(b))<eps)\n\ndouble torad(int deg) {return (double)(deg)*pi/180.0;}\ndouble todeg(double ang) {return ang*180.0/pi;}\n\nclass Point{\npublic:\n double x,y;\n \n Point(double x=0,double y=0):x(x),y(y){}\n \n Point operator + (Point p){return Point(x+p.x,y+p.y);}\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\n Point operator * (double a){return Point(a*x,a*y);}\n Point operator / (double a){return Point(x/a,y/a);}\n \n double abs(){return sqrt(norm());}\n double norm(){return x*x+y*y;}\n \n bool operator < (const Point &p)const{\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\n }\n \n bool operator == (const Point &p)const{\n return fabs(x-p.x)<eps/100000&&fabs(y-p.y)<eps/100000;\n }\n};\n\ntypedef Point Vector;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x+a.y*b.y;\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\nstruct Segment{\n Point p1,p2;\n};\n\nbool isOrthogonal(Vector a,Vector b){\n return equals(dot(a,b),0.0);\n}\n\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\n return isOrthogonal(a1-a2,b1-b2);\n}\n\nbool isOrthogonal(Segment s1,Segment s2){\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\n return isParallel(a1-a2,b1-b2);\n}\n\nbool isParallel(Segment s1,Segment s2){\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\n}\n\nPoint project(Segment s,Point p){\n Vector base=s.p2-s.p1;\n double r=dot(p-s.p1,base)/norm(base);\n return s.p1+base*r;\n}\n\nPoint reflect(Segment s,Point p){\n return p+(project(s,p)-p)*2.0;\n}\n\nPoint turn(Point p,Point c,double pi){\n double q=atan2(p.y-c.y,p.x-c.x);\n q+=pi;\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\n \n return p;\n}\n//pをcを中心としてpi回転させる(1周で2π)\n//p=cのときnan\n\nstatic const int counter_clockwise=1;\nstatic const int clockwise=-1;\nstatic const int online_back=2;\nstatic const int online_front=-2;\nstatic const int on_segment=0;\n\nint ccw(Point p0,Point p1,Point p2){\n Vector a=p1-p0;\n Vector b=p2-p0;\n \n if(cross(a,b)>eps) return counter_clockwise;\n if(cross(a,b)<-eps) return clockwise;\n if(dot(a,b)<-eps) return online_back;\n if(a.norm()<b.norm()) return online_front;\n \n return on_segment;\n}\n\nbool intersect(Point p1,Point p2,Point p3,Point p4){\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\n}\n\nbool intersect(Segment s1,Segment s2){\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool overlap(Segment s1,Segment s2){\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\n if(a&1||b&1) return 0;\n if(a==2){\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\n else return 0;\n }\n if(a==-2){\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\n else return 0;\n }\n if(a==0){\n if(s1.p1==s2.p1){\n if(b!=2) return 1;\n else return 0;\n }\n else if(s1.p2==s2.p1){\n if(b!=-2) return 1;\n else return 0;\n }\n else return 1;\n }\n return 0;\n}\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\n\ntypedef Segment Line;\n\ndouble getDistance(Point a,Point b){\n return abs(a-b);\n}\n\ndouble getDistanceLP(Line l,Point p){\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\n}\n\ndouble getDistanceSP(Segment s,Point p){\n if(dot(s.p2-s.p1,p-s.p1)<0.0) return abs(p-s.p1);\n if(dot(s.p1-s.p2,p-s.p2)<0.0) return abs(p-s.p2);\n return getDistanceLP(s,p);\n}\n\ndouble getDistance(Segment s1,Segment s2){\n if(intersect(s1,s2)) return 0.0;\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\n}\n\nPoint getCrossPointS(Segment s1,Segment s2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\n Vector base=s2.p2-s2.p1;\n double d1=abs(cross(base,s1.p1-s2.p1));\n double d2=abs(cross(base,s1.p2-s2.p1));\n double t=d1/(d1+d2);\n return s1.p1+(s1.p2-s1.p1)*t;\n}//同じ時壊れます\n\nPoint getCrossPointL(Line l1,Line l2){\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\n \n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\n \n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\n}\n\nSegment ParallelSegment(Segment s,double d){\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\n v=v/abs(v);\n \n s.p1=s.p1+v*d;\n s.p2=s.p2+v*d;\n \n return s;\n}\n\nPoint naisin(Line l1,Line l2,Line l3){\n //平行でない前提\n \n Point p1=getCrossPointL(l1,l2),p2=getCrossPointL(l1,l3),p3=getCrossPointL(l2,l3);\n if(p1==p2&&p2==p3&&p3==p1) return p1;\n \n return (p1*abs(p1)+p2*abs(p2)+p3*abs(p3))/(abs(p1)+abs(p2)+abs(p3));\n}\n\n//ネットの適当を書いたのであってるか全く知りません→あってそう\n\nclass Circle{\npublic:\n Point c;\n double r;\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\n};\n\nPoint CircleCenter(Point a,Point b,Point c){\n Point u=a-b,v=a-c;\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\n \n Point res;\n if(cross(u,v)==0.0){\n res.x=1e9;\n res.y=1e9;\n \n return res;\n }\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\n \n return res;\n}\n//3点を通る円の中心を返す\n\npair<Point,Point> segCrossPpoints(Circle c,Line l){\n //assert(intersect(c,l));\n Vector pr=project(l,c.c);\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\n double base=sqrt(c.r*c.r-norm(pr-c.c));\n return make_pair(pr+e*base,pr-e*base);\n}\n\ndouble arg(Vector p){return atan2(p.y,p.x);}\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\n\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\n //assert(intersect(c1,c2));\n double d=abs(c1.c-c2.c);\n double a=acos(max(-1.0,min(1.0,(c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d))));\n double t=arg(c2.c-c1.c);\n //cout<<d<<\" \"<<a<<\" \"<<t<<endl;\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\n}\n\nvector<Line> Commontangent(Circle c1,Circle c2){\n vector<Line> res;\n Point p=c2.c-c1.c;\n \n if(abs(p)>=(c1.r+c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n if(abs(p)>=abs(c1.r-c2.r)){\n Point a,b;\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\n \n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\n if(!(a==b)){\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\n }\n }\n \n return res;\n}\n\ntypedef vector<Point> Polygon;\n\n/*\n IN 2\n ON 1\n OUT 0\n */\n\nint contains(Polygon g,Point p){\n int n=int(g.size());\n bool x=false;\n for(int i=0;i<n;i++){\n Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(a.y>b.y) swap(a,b);\n if(a.y<eps&&eps<b.y&&cross(a,b)>eps) x=!x;\n }\n return (x?2:0);\n}\n\nPolygon andrewScan(Polygon s,bool ok){\n Polygon u,l;\n sort(all(s));\n \n if(int(s.size())<3) return s;\n int n=int(s.size());\n \n u.push_back(s[0]);\n u.push_back(s[1]);\n \n l.push_back(s[n-1]);\n l.push_back(s[n-2]);\n \n if(ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n if(!ok){\n for(int i=2;i<n;i++){\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n \n for(int i=int(s.size())-3;i>=0;i--){\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n }\n \n reverse(all(l));\n \n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\n \n return l;\n}//ok==1なら辺の上も含める\n\nPolygon convex_cut(const Polygon& P, const Line& l) {\n Polygon Q;\n for(int i=0;i<si(P);i++){\n Point A=P[i],B=P[(i+1)%si(P)];\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\n }\n return Q;\n}\n\ndouble area(Point a,Point b,Point c){\n b=b-a;\n c=c-a;\n return abs(b.x*c.y-b.y*c.x)/2.0;\n}\n\ndouble area(Polygon &P){\n if(si(P)==0) return 0.0;\n double res=0;\n Point c={0.0,0.0};\n for(int i=0;i<si(P);i++){\n c=c+P[i];\n }\n c=c/si(P);\n \n for(int i=0;i<si(P);i++){\n res+=area(c,P[i],P[(i+1)%si(P)]);\n }\n \n return res;\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N,W;cin>>N>>W;\n if(N==0) break;\n vector<Point> P(N);\n vector<double> h(N);\n for(int i=0;i<N;i++) cin>>P[i].x>>P[i].y>>h[i];\n \n double left=0,right=3000;\n for(int q=0;q<100;q++){\n double mid=(left+right)/2.0;\n vector<Circle> C(N);\n for(int i=0;i<N;i++){\n C[i].c=P[i];\n if(h[i]<=mid){\n C[i].r=sqrt((h[i])*(2.0*mid-h[i]));\n }else{\n C[i].r=mid;\n }\n }\n double lim;\n if(W<=mid) lim=sqrt((W)*(2.0*mid-W));\n else lim=mid;\n \n vector<Point> p={{lim,lim},{100-lim,lim},{100-lim,100-lim},{lim,100-lim}};\n vector<Line> l(4);\n for(int i=0;i<4;i++) l[i]={p[i],p[(i+1)%4]};\n \n bool ok=false;\n for(int i=0;i<N;i++){\n for(int j=i+1;j<N;j++){\n double d=getDistance(C[i].c,C[j].c);\n if(C[i].r+C[j].r>d){\n auto ps=getCrossPoints(C[i],C[j]);\n \n //assert(abs(getDistance(C[i].c,ps.fi)-C[i].r)<1e-5);\n //cout<<getDistance(C[i].c,ps.fi)<<\" \"<<C[i].r<<endl;\n assert(d>1e-5);\n assert(C[i].r>1e-5);\n assert(C[j].r>1e-5);\n //cout<<ps.fi.x<<\" \"<<ps.fi.y<<\" \"<<ps.se.x<<\" \"<<ps.se.y<<endl;\n \n for(int t=0;t<2;t++){\n bool safe=true;\n for(int k=0;k<N;k++){\n double d2=getDistance(ps.fi,C[k].c);\n if(d2<C[k].r-eps) safe=false;\n }\n \n if(ps.fi.x<lim-eps) safe=false;\n if(ps.fi.x>100.0-lim+eps) safe=false;\n if(ps.fi.y<lim-eps) safe=false;\n if(ps.fi.y>100.0-lim+eps) safe=false;\n \n if(safe) ok=true;\n swap(ps.fi,ps.se);\n }\n }\n }\n for(int k=0;k<4;k++){\n double d=getDistanceLP(l[k],C[i].c);\n if(d<C[i].r-eps){\n auto ps=segCrossPpoints(C[i],l[k]);\n for(int t=0;t<2;t++){\n bool safe=true;\n for(int a=0;a<N;a++){\n double d2=getDistance(ps.fi,C[a].c);\n if(d2<C[a].r-eps) safe=false;\n }\n \n if(ps.fi.x<lim-eps) safe=false;\n if(ps.fi.x>100.0-lim+eps) safe=false;\n if(ps.fi.y<lim-eps) safe=false;\n if(ps.fi.y>100.0-lim+eps) safe=false;\n \n if(safe) ok=true;\n swap(ps.fi,ps.se);\n }\n }\n }\n }\n \n for(int t=0;t<4;t++){\n bool safe=true;\n for(int k=0;k<N;k++){\n double d2=getDistance(p[t],C[k].c);\n if(d2<C[k].r-eps) safe=false;\n }\n \n if(safe) ok=true;\n }\n \n if(lim>=50) ok=false;\n \n if(ok) left=mid;\n else right=mid;\n }\n \n cout<<fixed<<setprecision(25)<<left<<endl;\n }\n}","accuracy":1,"time_ms":200,"memory_kb":4124,"score_of_the_acc":-1.0193,"final_rank":17},{"submission_id":"aoj_1342_4950291","code_snippet":"#define MOD_TYPE 1\n\n#pragma region Macros\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#if 0\n#include <boost/multiprecision/cpp_int.hpp>\n#include <boost/multiprecision/cpp_dec_float.hpp>\nusing Int = boost::multiprecision::cpp_int;\nusing lld = boost::multiprecision::cpp_dec_float_100;\n#endif\n#if 0\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\nusing ll = long long int;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pld = pair<ld, ld>;\ntemplate <typename Q_type>\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\n\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\n//constexpr ll MOD = ;\nconstexpr int INF = (int)1e9 + 10;\nconstexpr ll LINF = (ll)4e18;\nconstexpr double PI = acos(-1.0);\nconstexpr double EPS = 1e-10;\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\n#define repi(i, n) REPI(i, 0, n)\n#define MP make_pair\n#define MT make_tuple\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n#define possible(n) cout << ((n) ? \"possible\" : \"impossible\") << \"\\n\"\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << \"\\n\"\n#define Yay(n) cout << ((n) ? \"Yay!\" : \":(\") << \"\\n\"\n#define all(v) v.begin(), v.end()\n#define NP(v) next_permutation(all(v))\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n\nstruct io_init\n{\n io_init()\n {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << setprecision(30) << setiosflags(ios::fixed);\n };\n} io_init;\ntemplate <typename T>\ninline bool chmin(T &a, T b)\n{\n if (a > b)\n {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ninline bool chmax(T &a, T b)\n{\n if (a < b)\n {\n a = b;\n return true;\n }\n return false;\n}\ninline ll CEIL(ll a, ll b)\n{\n return (a + b - 1) / b;\n}\ntemplate <typename A, size_t N, typename T>\ninline void Fill(A (&array)[N], const T &val)\n{\n fill((T *)array, (T *)(array + N), val);\n}\ntemplate <typename T, typename U>\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept\n{\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T, typename U>\nconstexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept\n{\n os << p.first << \" \" << p.second;\n return os;\n}\n#pragma endregion\n\nusing Real = ld;\nusing Point = complex<Real>;\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\ninline bool eq(Point a, Point b) { return fabs(b - a) < EPS; }\n\nPoint operator*(const Point &p, const Real &d)\n{\n return Point(real(p) * d, imag(p) * d);\n}\n\nistream &operator>>(istream &is, Point &p)\n{\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, Point &p)\n{\n return os << fixed << setprecision(20) << p.real() << \" \" << p.imag();\n}\n\n// 点 p を反時計回りに theta 回転\ninline Point rotate(Real theta, const Point &p)\n{\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal radian_to_degree(Real r)\n{\n return (r * 180.0 / PI);\n}\n\nReal degree_to_radian(Real d)\n{\n return (d * PI / 180.0);\n}\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(Point a, Point b, Point c)\n{\n a -= b, c -= b;\n Real alpha = atan2(a.imag(), a.real()), beta = atan2(c.imag(), c.real());\n if (alpha > beta)\n swap(alpha, beta);\n Real theta = (beta - alpha);\n return min(theta, 2 * acos(-1) - theta);\n}\n\n// a-b-c の角度（[0,2π)、a を反時計回りに回転させてcに重ねる角度）\nReal get_angle2(Point a, Point b, Point c)\n{\n a -= b, c -= b;\n Real theta = atan2(imag(c), real(c)) - atan2(imag(a), real(a));\n while (theta < 0)\n theta += PI * 2;\n while (theta > PI * 2)\n theta -= PI * 2;\n return theta;\n}\n\n// a-b-c の角度（[0,2π)、p を間に含む方）\nReal get_angle2(const Point &a, const Point &b, const Point &c, const Point &p)\n{\n if (get_angle2(a, b, p) + get_angle2(p, b, c) < PI * 2)\n return get_angle2(a, b, c);\n else\n return get_angle2(c, b, a);\n}\n\nnamespace std\n{\n bool operator<(const Point &a, const Point &b)\n {\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\n }\n} // namespace std\n\nstruct Line\n{\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n Line(Real A, Real B, Real C) // Ax + By = C\n {\n if (eq(A, 0))\n a = Point(0, C / B), b = Point(1, C / B);\n else if (eq(B, 0))\n b = Point(C / A, 0), b = Point(C / A, 1);\n else\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n\n friend ostream &operator<<(ostream &os, Line &p)\n {\n return os << p.a << \" to \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a)\n {\n return is >> a.a >> a.b;\n }\n};\n\n// Ax + By = C\ntuple<Real, Real, Real> parameter(const Line &l)\n{\n Real A = imag(l.b) - imag(l.a);\n Real B = real(l.a) - real(l.b);\n Real C = real(l.a) * A + imag(l.a) * B;\n return {A, B, C};\n}\n\nstruct Segment : Line\n{\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle\n{\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = vector<Point>;\nusing Polygon = vector<Point>;\nusing Segments = vector<Segment>;\nusing Lines = vector<Line>;\nusing Circles = vector<Circle>;\n\ninline Real cross(const Point &a, const Point &b)\n{\n return real(a) * imag(b) - imag(a) * real(b);\n}\n\ninline Real dot(const Point &a, const Point &b)\n{\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\n// 直線がx軸となす角 [0, π)\n// to do: verify\ninline Real get_angle(const Line &l)\n{\n Point p = l.a - l.b;\n if (imag(p) < 0)\n p *= -1;\n return get_angle2(Point(1, 0), Point(0, 0), p);\n}\n\n// 2直線がなす角 [0, π/2]\n// to do: verify\ninline Real get_angle(const Line &l1, const Line &l2)\n{\n Real theta = get_angle(l1) - get_angle(l2);\n if (theta < 0)\n theta += PI;\n return theta >= PI / 2.0 ? theta - PI / 2.0 : theta;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\nint ccw(const Point &a, Point b, Point c)\n{\n b = b - a, c = c - a;\n if (cross(b, c) > EPS)\n return +1; // \"COUNTER_CLOCKWISE\"\n if (cross(b, c) < -EPS)\n return -1; // \"CLOCKWISE\"\n if (dot(b, c) < 0)\n return +2; // \"ONLINE_BACK\"\n if (norm(b) < norm(c))\n return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\n\n// p, q を m : n に内分する点\ninline Point internal(const Point &p, const Point &q, Real m, Real n)\n{\n return (n * p + m * q) / (m + n);\n}\n\n// p, q を m : n に外分する点\ninline Point external(const Point &p, const Point &q, Real m, Real n)\n{\n return internal(p, q, m, -n);\n}\n\n// 垂直ベクトル\ninline Point orthvector(const Point p)\n{\n return Point(imag(p), -real(p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\ninline bool parallel(const Line &a, const Line &b)\n{\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\ninline bool orthogonal(const Line &a, const Line &b)\n{\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\ninline Point projection(const Line &l, const Point &p)\n{\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\ninline Point projection(const Segment &l, const Point &p)\n{\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\ninline Point reflection(const Line &l, const Point &p)\n{\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 点 p を通り直線 l に垂直な直線\ninline Line verticalline(const Line &l, const Point &p)\n{\n return Line(p, p + orthvector(l.a - l.b));\n}\n\n// 点 p, q の垂直二等分線\ninline Line bisector(const Point &p, const Point &q)\n{\n Line l(p, q);\n Point m = internal(p, q, 1, 1);\n return verticalline(l, m);\n}\ninline Line bisector(const Segment &sg)\n{\n return bisector(sg.a, sg.b);\n}\n\ninline bool intersect(const Line &l, const Point &p)\n{\n return abs(ccw(l.a, l.b, p)) != 1;\n}\n\ninline bool intersect(const Line &l, const Line &m)\n{\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\n}\n\ninline bool intersect(const Segment &s, const Point &p)\n{\n return ccw(s.a, s.b, p) == 0;\n}\n\ninline bool intersect(const Line &l, const Segment &s)\n{\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\n}\n\ninline Real distance(const Line &l, const Point &p);\n\ninline bool intersect(const Circle &c, const Line &l)\n{\n return distance(l, c.p) <= c.r + EPS;\n}\n\ninline bool intersect(const Circle &c, const Point &p)\n{\n return abs(abs(p - c.p) - c.r) < EPS;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nbool intersect(const Segment &s, const Segment &t)\n{\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nint intersect(const Circle &c, const Segment &l)\n{\n if (norm(projection(l, c.p) - c.p) - c.r * c.r > EPS)\n return 0;\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n if (d1 < c.r + EPS && d2 < c.r + EPS)\n return 0;\n if (d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS)\n return 1;\n const Point h = projection(l, c.p);\n if (dot(l.a - h, l.b - h) < 0)\n return 2;\n return 0;\n}\n\n// 共通接戦の本数\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(Circle c1, Circle c2)\n{\n if (c1.r < c2.r)\n swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if (c1.r + c2.r < d)\n return 4;\n if (eq(c1.r + c2.r, d))\n return 3;\n if (c1.r - c2.r < d)\n return 2;\n if (eq(c1.r - c2.r, d))\n return 1;\n return 0;\n}\n\ninline Real distance(const Point &a, const Point &b)\n{\n return abs(a - b);\n}\n\ninline Real distance(const Line &l, const Point &p)\n{\n return abs(p - projection(l, p));\n}\n\ninline Real distance(const Line &l, const Line &m)\n{\n return intersect(l, m) ? 0 : distance(l, m.a);\n}\n\ninline Real distance(const Segment &s, const Point &p)\n{\n Point r = projection(s, p);\n if (intersect(s, r))\n return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\nReal distance(const Segment &a, const Segment &b)\n{\n if (intersect(a, b))\n return 0;\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\n}\n\nReal distance(const Line &l, const Segment &s)\n{\n if (intersect(l, s))\n return 0;\n return min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m)\n{\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0))\n return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\nPoint crosspoint(const Segment &l, const Segment &m)\n{\n return crosspoint(Line(l), Line(m));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\npair<Point, Point> crosspoint(const Circle &c, const Line l)\n{\n Point pr = projection(l, c.p);\n Point e = (l.b - l.a) / abs(l.b - l.a);\n if (eq(distance(l, c.p), c.r))\n return {pr, pr};\n double base = sqrt(c.r * c.r - norm(pr - c.p));\n return {pr - e * base, pr + e * base};\n}\n\npair<Point, Point> crosspoint(const Circle &c, const Segment &l)\n{\n Line aa = Line(l.a, l.b);\n if (intersect(c, l) == 2)\n return crosspoint(c, aa);\n auto ret = crosspoint(c, aa);\n if (dot(l.a - ret.first, l.b - ret.first) < 0)\n ret.second = ret.first;\n else\n ret.first = ret.second;\n return ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2)\n{\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\nint n;\nReal w;\nvector<Point> p;\nvector<Real> h;\n\nbool ok(Point &q, Real r)\n{\n Real x = real(q), y = imag(q);\n if (r < w)\n {\n for (Real d : {x - 0, 100 - x, y - 0, 100 - y})\n {\n if (d < r)\n return false;\n }\n }\n else\n {\n for (Real d : {x - 0, 100 - x, y - 0, 100 - y})\n {\n if (d < 0)\n return false;\n d = sqrt(d * d + (r - w) * (r - w));\n if (d < r)\n return false;\n }\n }\n rep(i, n)\n {\n Real d;\n if (r < h[i])\n {\n d = distance(q, p[i]);\n }\n else\n {\n d = distance(q, p[i]);\n d = sqrt(d * d + (r - h[i]) * (r - h[i]));\n }\n if (d < r)\n return false;\n }\n return true;\n}\n\nbool check(Real r)\n{\n vector<Circle> c(n);\n rep(i, n)\n {\n Real d;\n if (r < h[i])\n {\n d = r;\n }\n else\n {\n d = r * r - (r - h[i]) * (r - h[i]);\n if (d < -EPS)\n return false;\n chmax(d, Real(0.0));\n d = sqrt(d);\n }\n d += EPS;\n c[i] = Circle(p[i], d);\n }\n Points ps;\n rep(i, n) REP(j, i + 1, n)\n {\n int res = intersect(c[i], c[j]);\n if (1 <= res and res <= 3)\n {\n auto [p1, p2] = crosspoint(c[i], c[j]);\n ps.push_back(p1);\n ps.push_back(p2);\n }\n }\n\n Line l[4];\n Real d;\n if (r < w)\n d = r;\n else\n {\n d = r * r - (r - w) * (r - w);\n if (d < -EPS)\n return false;\n chmax(d, Real(0.0));\n d = sqrt(d);\n }\n d += EPS;\n Point LD(d, d), LU(d, 100 - d), RD(100 - d, d), RU(100 - d, 100 - d);\n l[0] = Line(LU, LD);\n l[1] = Line(LD, RD);\n l[2] = Line(RD, RU);\n l[3] = Line(RU, LU);\n ps.push_back(LD);\n rep(li, 4)\n {\n rep(i, n)\n {\n if (intersect(c[i], l[li]))\n {\n auto [p1, p2] = crosspoint(c[i], l[li]);\n ps.push_back(p1);\n ps.push_back(p2);\n }\n }\n }\n\n for (auto pi : ps)\n {\n if (ok(pi, r))\n return true;\n }\n return false;\n}\n\nvoid solve()\n{\n cin >> n >> w;\n if (w == 0)\n exit(0);\n p.resize(n);\n h.resize(n);\n rep(i, n) cin >> p[i] >> h[i];\n Real lo = 0, hi = 1e5;\n rep(ti, 100)\n {\n Real mi = (lo + hi) / 2.0;\n if (check(mi))\n lo = mi;\n else\n hi = mi;\n }\n cout << hi << \"\\n\";\n}\n\nint main()\n{\n while (1)\n solve();\n}","accuracy":1,"time_ms":890,"memory_kb":3884,"score_of_the_acc":-0.8355,"final_rank":12},{"submission_id":"aoj_1342_4828612","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\nusing ll = long long;\nusing P = pair<ll, ll>;\nconst long double PI = acos(-1.0L);\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\n\nusing CP = complex<long double>;\n\nconst long double EPS = 1e-10; // 許容する誤差ε\n#define EQ(a, b) (abs((a)-(b)) < EPS) // 2つのスカラーが等しいかどうか\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag())) // 2つのベクトルが等しいかどうか\n\n// double length = abs(a); // ベクトルaの絶対値\n// double distance = abs(a-b); // 2点a,b間の距離\n// CP b = a/abs(a); // ベクトルaの単位ベクトル\n// CP n1 = a*CP(0,+1); CP n2 = a*CP(0,-1); // ベクトルaの法線ベクトル\n// CP un1 = (a*CP(0,+1)/abs(a)); CP un2 = (a*CP(0,-1)/abs(a)); // ベクトルaの単位法線ベクトル\n\n// 内積(dot product) : a・b = |a||b|cosΘ\nlong double dot(CP a, CP b) {\n return (a.real()*b.real() + a.imag()*b.imag());\n}\n\n// 外積(cross product) : a×b = |a||b|sinΘ\nlong double cross(CP a, CP b) {\n return (a.real()*b.imag() - a.imag()*b.real());\n}\n\n// 直線の表現\nstruct Segment {\n CP s, t;\n Segment(long double sx = 0.0L, long double sy = 0.0L,\n long double tx = 0.0L, long double ty = 0.0L)\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\n Segment(CP _s, CP _t) : s(_s), t(_t) {}\n}; typedef Segment Line;\n\n// 2直線の直交判定 : a⊥b ⇔ dot(a,b) = 0\nint is_orthogonal(CP a1, CP a2, CP b1, CP b2) {\n return EQ(dot(a1-a2, b1-b2), 0.0);\n}\n\n// 2直線の平行判定 : a//b ⇔ cross(a,b) = 0\nint is_parallel(CP a1, CP a2, CP b1, CP b2) {\n return EQ(cross(a1-a2, b1-b2), 0.0);\n}\n\n// 点cが直線a,b上にあるかないか\nint is_point_on_line(CP a, CP b, CP c) {\n return EQ(cross(b-a, c-a), 0.0);\n}\n\n// 点cが線分a,b上にあるかないか\nint is_point_on_lines(CP a, CP b, CP c) {\n // |a-c|+|c-b| <= |a-b|なら線分上\n return (abs(a-c)+abs(c-b) < abs(a-b)+EPS);\n}\n\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交差判定\nint is_intersected_lines(CP a1, CP a2, CP b1, CP b2) {\n if(is_parallel(a1, a2, b1, b2)) {\n // 平行なので線分の重なり判定\n return is_point_on_lines(a1, a2, b1) || is_point_on_lines(a1, a2, b2) ||\n is_point_on_lines(b1, b2, a1) || is_point_on_lines(b1, b2, a2);\n }\n return (cross(a2-a1, b1-a1)*cross(a2-a1, b2-a1) < EPS) &&\n (cross(b2-b1, a1-b1)*cross(b2-b1, a2-b1) < EPS);\n}\n\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交点計算\nCP intersection_lines(CP a1, CP a2, CP b1, CP b2) {\n CP b = b2-b1;\n long double d1 = abs(cross(b, a1-b1));\n long double d2 = abs(cross(b, a2-b1));\n long double t = d1/(d1+d2);\n return a1+(a2-a1)*t;\n}\n\n// a1,a2を通る直線とb1,b2を通る直線の交差判定\nint is_intersected_line(CP a1, CP a2, CP b1, CP b2) {\n return !EQ(cross(a1-a2, b1-b2), 0.0);\n}\n\n// a1,a2を通る直線とb1,b2を通る直線の交点計算(平行ではない前提)\nCP intersection_line(CP a1, CP a2, CP b1, CP b2) {\n CP a = a2-a1; CP b = b2-b1;\n return a1 + a*cross(b, b1-a1)/cross(b, a);\n}\n\n// 点a,bを通る直線と点cとの距離\nlong double distance_line_p(CP a, CP b, CP c) {\n return abs(cross(b-a, c-a))/abs(b-a);\n}\n\n// 点a,bを端点とする線分と点cとの距離\nlong double distance_lines_p(CP a, CP b, CP c) {\n if(dot(b-a, c-a) < EPS) return abs(c-a);\n if(dot(a-b, c-b) < EPS) return abs(c-b);\n return abs(cross(b-a, c-a))/abs(b-a);\n}\n\n// 点a1,a2を端点とする線分と点b1,b2を端点とする線分の最短距離\nlong double distance_lines_lines(CP a1, CP a2, CP b1, CP b2) {\n long double res = 1e18;\n if(is_intersected_lines(a1, a2, b1, b2)) return 0.0L;\n res = min(res, distance_lines_p(a1, a2, b1));\n res = min(res, distance_lines_p(a1, a2, b2));\n res = min(res, distance_lines_p(b1, b2, a1));\n res = min(res, distance_lines_p(b1, b2, a2));\n return res;\n}\n\n// s,tを通る直線に対する点pの射影\nCP projection(CP s, CP t, CP p) {\n if(EQV(s, t)) return s;\n CP base = t-s;\n return s + base*(dot(p-s, base)/norm(base));\n}\n\n// s,tを通る直線に対する点pの反射\nCP reflection(CP s, CP t, CP p) {\n CP tmp = projection(s, t, p) - p;\n return p + tmp*2.0L;\n}\n\n// 角度Θ回転\nCP translate(CP v, long double theta) {\n CP res = v * CP(cosl(theta), sinl(theta));\n return res;\n}\n\n// n多角形の面積計算\nlong double polygon_area(const vector<CP> &v) {\n int n = v.size();\n long double res = 0;\n for(int i = 0; i < n; ++i) {\n res += cross(v[(i+n-1)%n], v[(i+n)%n]);\n }\n return fabsl(res)/2.0L;\n}\n\n// n多角形の凸性判定\nint is_convex(const vector<CP> &v) {\n int n = v.size();\n for(int i = 0; i < n; ++i) {\n if(cross(v[(i+1)%n]-v[i], v[(i+2)%n]-v[(i+1)%n]) < -EPS) return 0;\n }\n return 1;\n}\n\n// 凸包(全ての頂点が一直線に並ぶときは例外)\nvector<CP> convex_hull(vector<CP> &v) {\n // x座標→y座標で頂点をソート\n auto lmd = [&](const CP &l, const CP &r) {\n if(l.imag() != r.imag()) return l.imag() < r.imag();\n return l.real() < r.real();\n return l.imag() < r.imag();\n };\n vector<CP> res; // 凸包を構成する頂点\n int n = v.size();\n sort(v.begin(), v.end(), lmd);\n bool flgx = true;\n for(int i = 0; i < n; ++i) {\n if(v[i].real() != v[(i+1)%n].real()) {\n flgx = false;\n break;\n }\n }\n bool flgy = true;\n for(int i = 0; i < n; ++i) {\n if(v[i].imag() != v[(i+1)%n].imag()) {\n flgy = false;\n break;\n }\n }\n if(flgx || flgy) {\n res.emplace_back(v[0]);\n res.emplace_back(v[n-1]);\n return res;\n }\n int k = 0;\n res.resize(n*2);\n // 下側凸包\n for(int i = 0; i < n; ++i) {\n while(k > 1 && cross(res[k-1]-res[k-2], v[i]-res[k-1]) < 0) {\n --k;\n }\n res[k++] = v[i];\n }\n // 上側凸包\n for(int i = n-2, t = k; i >= 0; --i) {\n while(k > t && cross(res[k-1]-res[k-2], v[i]-res[k-1]) < 0) {\n --k;\n }\n res[k++] = v[i];\n }\n res.resize(k-1);\n return res;\n}\n\n// 凸多角形の直径\nlong double convex_diameter(vector<CP> &v) {\n vector<CP> cv = convex_hull(v);\n int n = cv.size();\n if(n == 2) return abs(cv[0]-cv[1]); // 凸包が潰れている例外処理\n int i = 0, j = 0; // x軸方向に最も遠い点対\n for(int k = 0; k < n; ++k) {\n if(cv[k].real() < cv[i].real()) i = k;\n if(cv[k].real() > cv[j].real()) j = k;\n }\n long double res = 0;\n int si = i, sj = j;\n while(i != sj || j != si) { // 180度回転で終了\n res = max(res, abs(cv[i]-cv[j]));\n if(cross(cv[(i+1)%n]-cv[i], cv[(j+1)%n]-cv[j]) < 0) {\n (++i) %= n;\n }else {\n (++j) %= n;\n }\n }\n return res;\n}\n\n// 凸多角形を点s,tを通る直線で切断(左側が取得できる)\nvector<CP> convex_cut(const vector<CP> &v, const CP &s, const CP &t) {\n vector<CP> res;\n int n = v.size();\n for(int i = 0; i < n; ++i) {\n CP nows = v[i], nowt = v[(i+1)%n];\n if(cross(t-s, nows-s) >= -EPS) res.emplace_back(nows);\n if(cross(t-s, nows-s)*cross(t-s, nowt-s) < 0) {\n res.emplace_back(intersection_line(s, t, nows, nowt));\n }\n }\n return res;\n}\n\n// n多角形に対する点pの包含関係(自己交差多角形は例外)\nint contain_polygon_point(const vector<CP> &v, CP p) {\n int contain = 0, on_segment = 0;\n int n = v.size();\n for(int i = 0; i < n; ++i) {\n on_segment |= is_point_on_lines(v[i], v[(i+1)%n], p); // 辺上判定\n CP s = v[i]-p, t = v[(i+1)%n]-p;\n if(s.imag() > t.imag()) swap(s, t); // 下側を基準にする\n if(s.imag()*t.imag() <= 0 && t.imag() > 0 && cross(s, t) > 0) {\n contain = !contain; // 交差回数が奇数なら内側\n }\n }\n if(on_segment) return 1; // 辺上\n if(contain) return 2; // 内側\n return 0; // 外側\n}\n\n// 最近点対距離\nlong double closest_pair(vector<CP> &v, int l = -1, \n int r = -1, bool reqsqrt = 0) {\n if(l == r && l == -1) {\n l = 0; r = v.size(); reqsqrt = 1;\n // x座標→y座標で昇順ソート\n auto lmd = [&](const CP &l, const CP &r) {\n if(l.real() != r.real()) return l.real() < r.real();\n return l.imag() < r.imag();\n };\n sort(v.begin(), v.end(), lmd);\n }\n if(r-l < 2) return 1e18; // 2点存在しない\n if(r-l == 2) { // ちょうど2点の時\n if(v[l].imag() > v[l+1].imag()) swap(v[l], v[l+1]);\n if(reqsqrt) return abs(v[l]-v[l+1]);\n return norm(v[l]-v[l+1]);\n }\n // 2点以上に関して分割統治法\n int mid = (l+r)/2;\n long double x = v[mid].real(); // 分断する線のx座標\n // 左半分，右半分について再帰，同一領域内の最小距離resを求める\n long double res = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\n auto f = [](CP pl, CP pr) { return pl.imag() < pr.imag(); };\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, f);\n vector<CP> tmp;\n // 異なる領域の2点について最小距離res未満で探索\n for(int i = l; i < r; ++i) {\n long double dx = abs(v[i].real()-x);\n int tsize = tmp.size();\n if(dx*dx >= res) continue;\n for(int j = 0; j < tsize; ++j) {\n CP delta = v[i]-tmp[tsize-1-j];\n if(delta.imag()*delta.imag() >= res) break;\n res = min(res, norm(delta));\n }\n tmp.emplace_back(v[i]);\n }\n if(reqsqrt) res = sqrtl(res);\n return res;\n}\n\n// 円の表現\nstruct Circle {\n CP o;\n long double r;\n Circle(long double _x = 0.0L, long double _y = 0.0L,\n long double _r = 0.0L)\n : o(CP(_x, _y)), r(_r) {}\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\n}; typedef vector<CP> Polygon;\n\n// 2円の位置関係\nint is_cross_circles(Circle l, Circle r) {\n long double distlr = abs(l.o-r.o);\n if(l.r+r.r+EPS < distlr) return 4; // 交点無し外側\n if(r.r+distlr+EPS < l.r) return -2; // 交点無し内側(R in L)\n if(l.r+distlr+EPS < r.r) return 2; // 交点無し内側(L in R)\n if(abs(l.r+r.r-distlr) < EPS) return 3; // 外接\n if(abs(l.r+distlr-r.r) < EPS) return -1; // 内接(R in L)\n if(abs(r.r+distlr-l.r) < EPS) return 1; // 内接(L in R)\n return 0; // 2点で交わる\n}\n\n// 円に対する点の包含\nbool contain_point(Circle c, CP p) {\n long double dist = abs(c.o-p);\n return dist < c.r+EPS;\n}\n\n// 円と直線の交点\nvector<CP> intersection_circle_line(Circle ci, CP s, CP t) {\n vector<CP> res(2); // 1点の場合同じ座標\n res[0] = res[1] = projection(s, t, ci.o); // 2等分点の座標\n long double d = ci.r*ci.r - norm(res[0]-ci.o);\n if(d <= EPS || t == s) return res;\n CP ust = (t-s)/abs(t-s); // stの単位ベクトル\n res[0] += (ust*sqrtl(d));\n res[1] -= (ust*sqrtl(d));\n if(res[0].real() > res[1].real() ||\n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\n swap(res[0], res[1]);\n }\n return res;\n}\n\n// 2円の交点(1つは交点が存在する)\nvector<CP> intersection_circle_circle(Circle c1, Circle c2) {\n vector<CP> res(2); // 1点の場合同じ座標\n long double d = abs(c1.o-c2.o);\n long double arg = acosl((c1.r*c1.r+d*d-c2.r*c2.r)/(2.0L*c1.r*d));\n CP c1p = (c2.o-c1.o)*CP(cosl(arg), sinl(arg));\n CP uc1p = c1p/abs(c1p); // c1の中心から交点p方向への単位ベクトル\n res[0] = c1.o + c1.r*uc1p;\n res[1] = reflection(c1.o, c2.o, res[0]); // p,qの位置関係は反射\n if(res[0].real() > res[1].real() ||\n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\n swap(res[0], res[1]);\n }\n return res;\n}\n\n// 線分lrの垂直二等分線\nLine vertical_bisector(CP l, CP r) {\n Circle c1 = Circle(l, abs(l-r)), c2 = Circle(r, abs(l-r));\n vector<CP> res = intersection_circle_circle(c1, c2);\n if(cross(r-l, res[0]-l) > 0) swap(res[0], res[1]);\n return Line(res[0], res[1]);\n}\n\n// 点pを通る円の接線の接点\nvector<CP> contact_circle_point(Circle ci, CP p) {\n vector<CP> res(2);\n long double d = abs(ci.o-p);\n if(abs(d-ci.r) <= EPS) {\n res[0] = res[1] = p;\n }else if(d < ci.r) {\n res[0] = res[1] = CP(-1e18, -1e18);\n }else {\n long double arg = asinl(ci.r/d);\n CP p0 = (ci.o-p)*CP(cosl(arg), sinl(arg));\n CP up0 = p0/abs(p0);\n res[0] = p + d*cosl(arg)*up0;\n res[1] = reflection(p, ci.o, res[0]);\n if(res[0].real() > res[1].real() || \n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\n swap(res[0], res[1]);\n }\n }\n return res;\n}\n\n// 2円の共通接線\nvector<Line> tangent_circle_circle(Circle cl, Circle cr) {\n vector<Line> res;\n if(cl.r < cr.r) swap(cl, cr);\n long double g = abs(cl.o-cr.o);\n if(abs(g-0.0L) <= EPS) return res; // 内包\n CP hor = (cr.o-cl.o)/g;\n CP ver = hor*CP(cosl(PI*0.5L), sinl(PI*0.5L));\n for(int s : {-1, 1}) {\n long double h = (cl.r + (long double)s*cr.r)/g;\n if(abs(1-h*h) <= EPS) {\n // 2円が接しているときの共通接線\n res.emplace_back(cl.o + hor*cl.r, cl.o + (hor+ver)*cl.r);\n }else if(1-h*h > 0) {\n // 内側に引かれる2接線+外側に引かれる2接線\n CP nhor = hor*h, nver = ver*sqrtl(1-h*h);\n res.emplace_back(cl.o + (nhor+nver)*cl.r, \n cr.o - (nhor+nver)*(cr.r*(long double)s));\n res.emplace_back(cl.o + (nhor-nver)*cl.r, \n cr.o - (nhor-nver)*(cr.r*(long double)s));\n }\n }\n return res;\n}\n\n// 三角形の内接円\nCircle inscribed_circle(CP A, CP B, CP C) {\n if(cross(B-A, C-A) < 0) swap(B, C);\n long double a = abs(B-C), b = abs(C-A), c = abs(A-B);\n long double alpha = acosl((b*b+c*c-a*a)/(2.0L*b*c));\n long double beta = acosl((c*c+a*a-b*b)/(2.0L*c*a));\n // AとxABを通る直線とBとxBCを通る直線の交点が内心\n CP I = intersection_line(A, A+translate(B-A, alpha/2.0L), B, B+translate(C-B, beta/2.0L));\n // ABとIの最短距離が内心半径\n long double Ir = distance_lines_p(A, B, I);\n return Circle(I, Ir);\n}\n\n// 三角形の外接円\nCircle circumscribed_circle(CP A, CP B, CP C) {\n // 2つの垂直二等分線の交点\n Line AB = vertical_bisector(A, B);\n Line BC = vertical_bisector(B, C);\n CP O = intersection_line(AB.s, AB.t, BC.s, BC.t);\n long double Or = abs(A-O);\n return Circle(O, Or);\n}\n\n// 2円の共通面積\nlong double common_area(Circle cl, Circle cr) {\n if(cl.r < cr.r) swap(cl, cr);\n int num = is_cross_circles(cl, cr);\n if(num >= 3) return 0.0L;\n if(num >= 1) return PI*cr.r*cr.r;\n if(num < 0) return PI*cl.r*cl.r;\n long double d = abs(cl.o-cr.o);\n long double res = 0.0L;\n for(int i = 0; i < 2; ++i) {\n long double theta = 2.0L * acosl((d*d+cl.r*cl.r-cr.r*cr.r)/(2.0L*d*cl.r));\n res += (theta-sinl(theta))*cl.r*cl.r/2.0L;\n swap(cl, cr);\n }\n return res;\n}\n\n// 円と多角形の共通面積\nlong double common_area(Polygon p, Circle c) {\n if(p.size() < 3) return 0.0L;\n function<long double(Circle, CP, CP)> dfs = [&](Circle c, CP a, CP b) {\n CP va = c.o-a, vb = c.o-b;\n long double f = cross(va, vb), res = 0;\n if(EQ(f, 0.0)) return res;\n if(max(abs(va), abs(vb)) < c.r+EPS) return f;\n CP d(dot(va, vb), cross(va, vb));\n if(distance_lines_p(a, b, c.o) > c.r-EPS) {\n return c.r*c.r*(atan2(d.imag(), d.real()));\n }\n auto u = intersection_circle_line(c, a, b);\n if(u.empty()) return res;\n if(u.size() > 1 && dot(u[1]-u[0], a-u[0]) > 0) swap(u[0], u[1]);\n u.emplace(u.begin(), a);\n u.emplace_back(b);\n for(int i = 1; i < (int)u.size(); ++i) res += dfs(c, u[i-1], u[i]);\n return res;\n };\n long double res = 0.0L;\n for(int i = 0; i < (int)p.size(); ++i) res += dfs(c, p[i], p[(i+1)%p.size()]);\n return res/2;\n}\n\n// 3点の位置関係を判定\nint calc_clockwise(CP p0, CP p1, CP p2) {\n CP x = p1-p0, y = p2-p0;\n if(cross(x, y) > EPS) return 1; // \"COUNTER_CLOCKWISE\"\n if(cross(x, y) < -EPS) return -1; // \"CLOCKWISE\"\n if(dot(x, y) < 0) return 2; // \"ONLINE_BACK\"\n if(norm(x) < norm(y)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\" \n}\n\nint n;\nlong double w;\nstruct xyz {\n CP pos;\n long double z;\n};\n\nint main() {\n while(1) {\n cin >> n >> w;\n if(n == 0 && w == 0) break;\n vector<xyz> needles;\n for(int i = 0; i < n; ++i) {\n long double x, y, h;\n cin >> x >> y >> h;\n xyz indata;\n indata.pos = CP(x, y);\n indata.z = h;\n needles.emplace_back(indata);\n } \n\n // (0,0), (0,100), (100,0), (100,100)に囲まれている\n // 針を中心とした円の交点と4隅から半径r縮小した正方形との交点が候補になる\n long double low = 0.0L, high = 1e9;\n for(int i = 0; i < 100; ++i) {\n long double mid = (low+high)/2.0L;\n auto isOK = [&](long double R) {\n // 2分探索用のチェック\n vector<Circle> cs(n);\n for(int i = 0; i < n; ++i) {\n if(needles[i].z <= R) cs[i].r = sqrtl(2.0L*R*needles[i].z - needles[i].z*needles[i].z);\n else cs[i].r = R;\n cs[i].o = needles[i].pos;\n }\n\n long double margin = (w <= R ? sqrtl(2.0L*R*w - w*w) : R);\n if(margin >= 50.0L) return false; // 半径が50を超えることはない\n\n vector<Segment> ss;\n ss.emplace_back(Segment(CP(margin, margin), CP(100.0L-margin)));\n ss.emplace_back(Segment(CP(margin, margin), CP(margin, 100.0L-margin)));\n ss.emplace_back(Segment(CP(100.0L-margin, margin), CP(100.0L-margin, 100.0L-margin)));\n ss.emplace_back(Segment(CP(margin, 100.0L-margin), CP(100.0L-margin, 100.0L-margin)));\n\n vector<CP> ps; // 調べるべき交点\n // 小さい正方形の4隅\n ps.emplace_back(CP(margin, margin));\n ps.emplace_back(CP(margin, 100.0L-margin));\n ps.emplace_back(CP(100.0L-margin, margin));\n ps.emplace_back(CP(100.0L-margin, 100.0L-margin));\n\n // 円と正方形の交点を列挙する\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < 4; ++j) {\n vector<CP> inps = intersection_circle_line(cs[i], ss[j].s, ss[j].t);\n for(auto p : inps) ps.emplace_back(p);\n }\n }\n for(int i = 0; i < n; ++i) {\n for(int j = i+1; j < n; ++j) {\n vector<CP> inps = intersection_circle_circle(cs[i], cs[j]);\n for(auto p : inps) ps.emplace_back(p);\n }\n }\n\n bool ok = false;\n for(auto p : ps) {\n bool flg = true;\n for(int i = 0; i < n; ++i) {\n if(abs(p-cs[i].o) < cs[i].r-EPS) flg = false;\n }\n if(flg) {\n if(p.real() >= margin-EPS && p.real()-EPS <= 100.0L-margin &&\n p.imag() >= margin-EPS && p.imag()-EPS <= 100.0L-margin) {\n ok = true;\n }\n }\n }\n return ok;\n };\n if(isOK(mid)) low = mid;\n else high = mid;\n }\n\n cout << fixed << setprecision(5) << low << endl;\n }\n}","accuracy":1,"time_ms":7810,"memory_kb":3568,"score_of_the_acc":-1.3682,"final_rank":18},{"submission_id":"aoj_1342_4127956","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (1e+18) + 7;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\n//typedef vector<vector<ll>> mat;\ntypedef vector<int> vec;\n\nll mod_pow(ll a, ll n) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * a%mod;\n\t\ta = a * a%mod; n >>= 1;\n\t}\n\treturn res;\n}\n\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n%mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, int n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a*a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\n//ll inv(ll a, ll p) {\n//\treturn (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);\n//}\n//modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\nusing Point = complex<ld>;\nld dot(Point a, Point b) { return real(conj(a)*b); }\nld cross(Point a, Point b) { return imag(conj(a)*b); }\nstruct Line {\n\tPoint a, b;\n};\nstruct Circle {\n\tPoint p; ld r;\n};\n\nPoint proj(Line l, Point p) {\n\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + t * (l.a - l.b);\n}\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n\nvector<Point> is_lc(Circle c, Line l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d > c.r + eps)return res;\n\tld len = (d > c.r) ? 0.0 : sqrt(c.r*c.r - d * d);\n\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\tres.push_back(proj(l, c.p) + len * nor);\n\tres.push_back(proj(l, c.p) - len * nor);\n\treturn res;\n}\nvector<Point> is_cc(Circle c1, Circle c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\n\tld dfr = c1.r*c1.r - rc * rc;\n\tif (abs(dfr) < eps)dfr = 0.0;\n\tif (dfr < 0.0)return res;\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\nbool is_in(Circle c, Point p) {\n\tld dist = abs(c.p - p);\n\treturn dist < c.r;\n}\n\nint n;ld w;\nint x[10], y[10], h[10];\nCircle c[10];\n\nbool can(ld r) {\n\tld le;\n\tif (r < w)le = r;\n\telse {\n\t\tle = sqrt(pow(r, 2) - pow(r - w, 2));\n\t}\n\tif (le >= 50)return false;\n\trep(i, n) {\n\t\tc[i].p = { (ld)x[i],(ld)y[i] };\n\t\tif (r < h[i])c[i].r = r;\n\t\telse c[i].r = sqrt(pow(r, 2) - pow(r - h[i], 2));\n\t}\n\n\tld ri = 100 - le;\n\tPoint p[4] = { {le,le},{le,ri},{ri,le},{ri,ri} };\n\tLine l[4] = { {p[0],p[1]},{p[0],p[2]},{p[3],p[1]},{p[3],p[2]} };\n\trep(i, 4) {\n\t\tbool f = true;\n\t\trep(j, n) {\n\t\t\tif (is_in(c[j], p[i])) {\n\t\t\t\tf = false; break;\n\t\t\t}\n\t\t}\n\t\tif (f)return true;\n\t}\n\trep(i, 4) {\n\t\trep(j, n) {\n\t\t\tvector<Point> v = is_lc(c[j], l[i]);\n\t\t\trep(k, v.size()) {\n\t\t\t\t\n\t\t\t\tif (real(v[k]) < le || real(v[k])>ri)continue;\n\t\t\t\tif (imag(v[k]) < le || imag(v[k]) > ri)continue;\n\t\t\t\tbool f = true;\n\t\t\t\trep(l, n) {\n\t\t\t\t\tif (l == j)continue;\n\t\t\t\t\tif (is_in(c[l], v[k])) {\n\t\t\t\t\t\tf = false; break;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (f)return true;\n\t\t\t}\n\t\t}\n\t}\n\trep(i, n)Rep(j,i+1, n) {\n\t\tvector<Point> v = is_cc(c[i], c[j]);\n\t\trep(k, v.size()) {\n\t\t\tif (real(v[k]) < le || real(v[k])>ri)continue;\n\t\t\tif (imag(v[k]) < le || imag(v[k]) > ri)continue;\n\t\t\tbool f = true;\n\t\t\trep(l, n) {\n\t\t\t\tif (l == i || l == j)continue;\n\t\t\t\tif (is_in(c[l], v[k])) {\n\t\t\t\t\tf = false; break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (f)return true;\n\t\t}\n\t}\n\treturn false;\n}\nvoid solve() {\n\tcin >> w;\n\trep(i, n) {\n\t\tcin >> x[i] >> y[i] >> h[i];\n\t}\n\tld le = 0, ri = (w*w+2500)/(2*w);\n\trep (aa,100) {\n\t\tld mid = (le + ri) / 2;\n\t\tif (can(mid))le = mid;\n\t\telse ri = mid;\n\t}\n\tcout << le << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(5);\n\t//init();\n\t//int t; cin >> t; rep(i, t)solve();\n\twhile (cin >> n, n)solve();\n\t//solve();\n\tstop\n\t\treturn 0;\n}","accuracy":1,"time_ms":550,"memory_kb":3304,"score_of_the_acc":-0.1326,"final_rank":3},{"submission_id":"aoj_1342_4104827","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i< (n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<double,double> P;\nconst double EPS = 1e-8;\n\n//補助用演算関数を作っとく.\ndouble dist(P x,P y){\n double x1=x.first,x2=x.second,y1=y.first,y2=y.second;\n double tmp=(x1-y1)*(x1-y1)+(x2-y2)*(x2-y2);\n return sqrt(tmp);\n}\ndouble grp(double x,double y){\n //斜辺と一辺が与えられたときにもう一個の辺の長さを返す関数。\n //初めから作っておくべきであった.\n //xを斜辺とする.\n double ans = x*x-y*y;\n if(ans<0){\n cout<<\"error!\"<<endl;\n cout<<x<<' '<<y<<endl;\n //円同士の交点の演算の時にerrorが出ていた.おそらくすっぽり入ってるときか？\n //やはり円の交点のところを直したらerrorが出なかったので元凶は円.\n //円と壁のバグなしたのにまだ駄目だ。。。\n }\n return sqrt(ans);\n}\n\nint main(){\n while(true){\n int n,w;cin>>n>>w;\n if(n==0 && w==0)break;\n vector<pair<P,double>> lst(n);\n rep(i,n){\n double x,y,h;cin>>x>>y>>h;\n lst[i] = make_pair(make_pair(x,y),h);\n }\n //まずは交点を全て求める.\n //これらは全てt_midを与えられて計算する.\n //つまりjudge内で書く必要がある.\n auto judge=[&](double t_mid){\n vector<P> cross_lst;\n double w_now;\n if(w < t_mid)w_now=grp(t_mid,(t_mid-w));\n else w_now=t_mid;\n //円同士の交点を求める\n for(int i=0;i<n-1;i++){\n for(int j=i+1;j<n;j++){\n //円の全ての組み合わせを試す.\n pair<P,double> r1 = lst[i];\n pair<P,double> r2 = lst[j];\n //半径は修正.\n double r1_now;\n if(r1.second < t_mid)r1_now=grp(t_mid,(t_mid-r1.second));\n else r1_now=t_mid;\n double r2_now;\n if(r2.second < t_mid)r2_now=grp(t_mid,(t_mid-r2.second));\n else r2_now=t_mid;\n //交点を持たない場合はここでcontinue↓\n double dis = dist(r1.first,r2.first);\n //判定します.\n if(abs(r1_now-r2_now) > dis || (r1_now+r2_now) < dis)continue;\n double a = (dis*dis+r1_now*r1_now-r2_now*r2_now)/2;\n double b = dis*dis*r1_now*r1_now-a*a;\n double x1 = r2.first.first,x0 = r1.first.first,y1=r2.first.second,y0=r1.first.second;\n P tg1 = make_pair(((a*(x1-x0)+(y1-y0)*sqrt(b))/(dis*dis)+x0),((a*(y1-y0)-(x1-x0)*sqrt(b))/(dis*dis)+y0));\n P tg2 = make_pair(((a*(x1-x0)-(y1-y0)*sqrt(b))/(dis*dis)+x0),((a*(y1-y0)+(x1-x0)*sqrt(b))/(dis*dis)+y0));\n cross_lst.push_back(tg1);\n cross_lst.push_back(tg2);\n //done\n }\n }\n \n //次、壁と円の交点を求める.\n rep(i,n){\n pair<P,double> r=lst[i];\n //下の壁との交点\n double r_now;\n if(r.second < t_mid)r_now=grp(t_mid,(t_mid-r.second));\n else r_now=t_mid;\n double distwithwall = abs(r.first.second-w_now);\n if(distwithwall<=r_now){\n P tg1 = make_pair((r.first.first+grp(r_now,distwithwall)),w_now);\n P tg2 = make_pair((r.first.first-grp(r_now,distwithwall)),w_now);\n cross_lst.push_back(tg1);\n cross_lst.push_back(tg2);\n }\n //上の壁との交点\n distwithwall = abs(r.first.second-(100-w_now));\n if(distwithwall<=r_now){\n P tg1 = make_pair((r.first.first+grp(r_now,distwithwall)),100-w_now);\n P tg2 = make_pair((r.first.first-grp(r_now,distwithwall)),100-w_now);\n cross_lst.push_back(tg1);\n cross_lst.push_back(tg2);\n }\n //左の壁との交点\n distwithwall = abs(r.first.first-w_now);\n if(distwithwall<=r_now){\n P tg1 = make_pair(w_now,(r.first.second+grp(r_now,distwithwall)));\n P tg2 = make_pair(w_now,(r.first.second-grp(r_now,distwithwall)));\n cross_lst.push_back(tg1);\n cross_lst.push_back(tg2);\n }\n //右の壁との交点\n distwithwall = abs(r.first.first-(100-w_now));\n if(distwithwall<=r_now){\n P tg1 = make_pair(100-w_now,(r.first.second+grp(r_now,distwithwall)));\n P tg2 = make_pair(100-w_now,(r.first.second-grp(r_now,distwithwall)));\n cross_lst.push_back(tg1);\n cross_lst.push_back(tg2);\n }\n }\n //最後に、壁同士の交点を入れておく.\n cross_lst.push_back(make_pair(w_now,w_now));\n cross_lst.push_back(make_pair(100-w_now,w_now));\n cross_lst.push_back(make_pair(w_now,100-w_now));\n cross_lst.push_back(make_pair(100-w_now,100-w_now));\n\n //次に、交点が存在できるかチェック!!\n int cnt = 0;//ダメだった交点数.これが全部ならout.\n for(P target : cross_lst){\n //壁の内側に入っているかcheck!\n if(w_now>target.first+EPS || target.first>(100-w_now)+EPS || w_now>target.second+EPS || target.second+EPS>(100-w_now)){\n cnt++;\n continue;\n }\n //円の内部に入らないかチェック!\n rep(i,n){\n pair<P,double> r = lst[i];\n double r_now;\n if(r.second < t_mid)r_now=grp(t_mid,(t_mid-r.second));\n else r_now=t_mid;\n if(dist(r.first,target)+EPS<r_now){\n cnt++;\n break;\n }\n }\n }\n if(cnt == cross_lst.size())return false;\n return true;\n };\n //judgeが描き終わったので二分探索をする.\n double t_min = 0;//ok\n double t_max = (1e+9)+5;//絶対out\n const double D = 1e-6;\n while(t_min+D<t_max){\n double t_mid=(t_min+t_max)/2;\n if(judge(t_mid)){\n t_min = t_mid;\n }else{\n t_max = t_mid;\n }\n }\n cout<<fixed<<setprecision(6)<<t_min<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3244,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1342_9782093\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nusing T = long double;\\nconst T eps = 1e-8;\\nusing Point = complex<T>;\\nusing Poly = vector<Point>;\\n#define X real()\\n#define Y imag()\\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\\n return fabs(a - b) < eps;\\n}\\nbool cmp(const Point &a, const Point &b) {\\n auto sub = [&](Point a) {\\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\\n };\\n if (sub(a) != sub(b))\\n return sub(a) < sub(b);\\n return a.Y * b.X < a.X * b.Y;\\n}\\nstruct Line {\\n Point a, b, dir;\\n Line() {}\\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\\n Line(T A, T B, T C) {\\n if (eq(A, (T).0)) {\\n a = Point(0, C / B), b = Point(1 / C / B);\\n } else if (eq(B, (T).0)) {\\n a = Point(C / A, 0), b = Point(C / A, 1);\\n } else {\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n};\\nstruct Segment : Line {\\n Segment() {}\\n Segment(Point _a, Point _b) : Line(_a, _b) {}\\n};\\nstruct Circle {\\n Point p;\\n T r;\\n Circle() {}\\n Circle(Point _p, T _r) : p(_p), r(_r) {}\\n};\\n\\nistream &operator>>(istream &is, Point &p) {\\n T x, y;\\n is >> x >> y;\\n p = Point(x, y);\\n return is;\\n}\\nostream &operator<<(ostream &os, Point &p) {\\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\\n return os;\\n}\\nPoint unit(const Point &a) {\\n return a / abs(a);\\n}\\nT dot(const Point &a, const Point &b) {\\n return a.X * b.X + a.Y * b.Y;\\n}\\nT cross(const Point &a, const Point &b) {\\n return a.X * b.Y - a.Y * b.X;\\n}\\nPoint rot(const Point &a, const T &theta) {\\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\\n sin(theta) * a.X + cos(theta) * a.Y);\\n}\\nPoint rot90(const Point &a) {\\n return Point(-a.Y, a.X);\\n}\\nT arg(const Point &a, const Point &b, const Point &c) {\\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\\n if (cross(a - b, c - b) < 0)\\n ret = -ret;\\n return ret;\\n}\\n\\nPoint Projection(const Line &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Projection(const Segment &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Reflection(const Line &l, const Point &p) {\\n return p + (Projection(l, p) - p) * (T)2.;\\n}\\nint ccw(const Point &a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > eps)\\n return 1; // ccw\\n\\n if (cross(b, c) < -eps)\\n return -1; // cw\\n\\n if (dot(b, c) < 0)\\n return 2; // c,a,b\\n\\n if (norm(b) < norm(c))\\n return -2; // a,b,c\\n\\n return 0; // a,c,b\\n\\n}\\nbool isOrthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.b - a.a, b.b - b.a), (T).0);\\n}\\nbool isParallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), (T).0);\\n}\\nbool isIntersect(const Segment &a, const Segment &b) {\\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\\n}\\nint isIntersect(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d > a.r + b.r + eps)\\n return 4;\\n if (eq(d, a.r + b.r))\\n return 3;\\n if (eq(d, abs(a.r - b.r)))\\n return 1;\\n if (d < abs(a.r - b.r) - eps)\\n return 0;\\n return 2;\\n}\\nT Dist(const Line &a, const Point &b) {\\n Point c = Projection(a, b);\\n return abs(c - b);\\n}\\nT Dist(const Segment &a, const Point &b) {\\n if (dot(a.b - a.a, b - a.a) < eps)\\n return abs(b - a.a);\\n if (dot(a.a - a.b, b - a.b) < eps)\\n return abs(b - a.b);\\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\\n}\\nT Dist(const Segment &a, const Segment &b) {\\n if (isIntersect(a, b))\\n return (T).0;\\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\\n return res;\\n}\\nPoint Intersection(const Line &a, const Line &b) {\\n T d1 = cross(a.b - a.a, b.b - b.a);\\n T d2 = cross(a.b - a.a, a.b - b.a);\\n if (eq(d1, (T)0.) and eq(d2, (T)0.))\\n return b.a;\\n return b.a + (b.b - b.a) * (d2 / d1);\\n}\\nPoly Intersection(const Circle &a, const Line &b) {\\n Poly res;\\n T d = Dist(b, a.p);\\n if (d > a.r + eps)\\n return res;\\n Point h = Projection(b, a.p);\\n if (eq(d, a.r)) {\\n res.push_back(h);\\n return res;\\n }\\n Point e = unit(b.b - b.a);\\n T ph = sqrt(a.r * a.r - d * d);\\n res.push_back(h - e * ph);\\n res.push_back(h + e * ph);\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Segment &b) {\\n Line c(b.a, b.b);\\n Poly sub = Intersection(a, c);\\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\\n Poly res;\\n rep(i, 0, sub.size()) {\\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\\n res.push_back(sub[i]);\\n }\\n }\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Circle &b) {\\n Poly res;\\n int mode = isIntersect(a, b);\\n T d = abs(a.p - b.p);\\n if (mode == 4 or mode == 0)\\n return res;\\n if (mode == 3) {\\n T t = a.r / (a.r + b.r);\\n res.push_back(a.p + (b.p - a.p) * t);\\n return res;\\n }\\n if (mode == 1) {\\n if (b.r < a.r - eps) {\\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\\n } else {\\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\\n }\\n return res;\\n }\\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / (T)2.;\\n T rs = sqrt(a.r * a.r - rc * rc);\\n if (a.r - abs(rc) < eps)\\n rs = 0;\\n Point e = unit(b.p - a.p);\\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\\n return res;\\n}\\nPoly HalfplaneIntersection(vector<Line> &H) {\\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\\n auto outside = [&](Line &L, Point p) -> bool {\\n return cross(L.dir, p - L.a) < -eps;\\n };\\n deque<Line> deq;\\n int sz = 0;\\n rep(i, 0, SZ(H)) {\\n while (sz > 1 and\\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\\n return {};\\n }\\n if (outside(H[i], deq[sz - 1].a)) {\\n deq.pop_back();\\n sz--;\\n } else\\n continue;\\n }\\n deq.push_back(H[i]);\\n sz++;\\n }\\n\\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz < 3)\\n return {};\\n deq.push_back(deq.front());\\n Poly ret;\\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\\n return ret;\\n}\\n\\nT Area(const Poly &a) {\\n T res = 0;\\n int n = a.size();\\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\\n return fabs(res / (T)2.);\\n}\\nT Area(const Poly &a, const Circle &b) {\\n int n = a.size();\\n if (n < 3)\\n return (T).0;\\n auto rec = [&](auto self, const Circle &c, const Point &p1,\\n const Point &p2) {\\n Point va = c.p - p1, vb = c.p - p2;\\n T f = cross(va, vb), res = (T).0;\\n if (eq(f, (T).0))\\n return res;\\n if (max(abs(va), abs(vb)) < c.r + eps)\\n return f;\\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\\n return c.r * c.r * arg(vb * conj(va));\\n auto u = Intersection(c, Segment(p1, p2));\\n Poly sub;\\n sub.push_back(p1);\\n for (auto &x : u)\\n sub.push_back(x);\\n sub.push_back(p2);\\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\\n return res;\\n };\\n T res = (T).0;\\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\\n return fabs(res / (T)2.);\\n}\\nT Area(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d >= a.r + b.r - eps)\\n return (T).0;\\n if (d <= abs(a.r - b.r) + eps) {\\n T r = min(a.r, b.r);\\n return M_PI * r * r;\\n }\\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / (T)2.);\\n T res = a.r * a.r * (ath - sin(ath * 2) / (T)2.);\\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / (T)2.);\\n res += b.r * b.r * (bth - sin(bth * 2) / (T)2.);\\n return fabs(res);\\n}\\nbool isConvex(const Poly &a) {\\n int n = a.size();\\n int cur, pre, nxt;\\n rep(i, 0, n) {\\n pre = (i - 1 + n) % n;\\n nxt = (i + 1) % n;\\n cur = i;\\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\\n return 0;\\n }\\n return 1;\\n}\\nint isContained(const Poly &a,\\n const Point &b) { // 0:not contain,1:on edge,2:contain\\n\\n bool res = 0;\\n int n = a.size();\\n rep(i, 0, n) {\\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\\n if (p.Y > q.Y)\\n swap(p, q);\\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\\n res ^= 1;\\n if (eq(cross(p, q), (T).0) and dot(p, q) < eps)\\n return 1;\\n }\\n return (res ? 2 : 0);\\n}\\nPoly ConvexHull(Poly &a) {\\n sort(ALL(a), [](const Point &p, const Point &q) {\\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\\n });\\n a.erase(unique(ALL(a)), a.end());\\n int n = a.size(), k = 0;\\n Poly res(n * 2);\\n for (int i = 0; i < n; res[k++] = a[i++]) {\\n while (k >= 2 and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\\n while (k >= t and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n res.resize(k - 1);\\n return res;\\n}\\nT Diam(const Poly &a) {\\n int n = a.size();\\n int x = 0, y = 0;\\n rep(i, 1, n) {\\n if (a[i].Y > a[x].Y)\\n x = i;\\n if (a[i].Y < a[y].Y)\\n y = i;\\n }\\n T res = abs(a[x] - a[y]);\\n int i = x, j = y;\\n do {\\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\\n i = (i + 1) % n;\\n else\\n j = (j + 1) % n;\\n chmax(res, abs(a[i] - a[j]));\\n } while (i != x or j != y);\\n return res;\\n}\\nPoly Cut(const Poly &a, const Line &l) {\\n int n = a.size();\\n Poly res;\\n rep(i, 0, n) {\\n Point p = a[i], q = a[(i + 1) % n];\\n if (ccw(l.a, l.b, p) != -1)\\n res.push_back(p);\\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\\n res.push_back(Intersection(Line(p, q), l));\\n }\\n return res;\\n}\\n\\nT Closest(Poly &a) {\\n int n = a.size();\\n if (n <= 1)\\n return 0;\\n sort(ALL(a), [&](Point a, Point b) {\\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\\n });\\n Poly buf(n);\\n auto rec = [&](auto self, int lb, int rb) -> T {\\n if (rb - lb <= 1)\\n return (T)INF;\\n int mid = (lb + rb) >> 1;\\n auto x = a[mid].X;\\n T res = min(self(self, lb, mid), self(self, mid, rb));\\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\\n [&](auto p, auto q) { return p.Y < q.Y; });\\n int ptr = 0;\\n rep(i, lb, rb) {\\n if (abs(a[i].X - x) >= res)\\n continue;\\n rep(j, 0, ptr) {\\n auto sub = a[i] - buf[ptr - 1 - j];\\n if (sub.Y >= res)\\n break;\\n chmin(res, abs(sub));\\n }\\n buf[ptr++] = a[i];\\n }\\n return res;\\n };\\n return rec(rec, 0, n);\\n}\\n\\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\\n p /= (A + B + C);\\n T r = Dist(Line(a, b), p);\\n return Circle(p, r);\\n}\\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\\n Line l1((a + b) / (T)2., (a + b) / (T)2. + (b - a) * Point(0, 1));\\n Line l2((b + c) / (T)2., (b + c) / (T)2. + (c - b) * Point(0, 1));\\n Point p = Intersection(l1, l2);\\n return Circle(p, abs(p - a));\\n}\\nPoly tangent(const Point &a, const Circle &b) {\\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\\n}\\nvector<Line> tangent(const Circle &a, const Circle &b) {\\n vector<Line> res;\\n T d = abs(a.p - b.p);\\n if (eq(d, (T)0.))\\n return res;\\n Point u = unit(b.p - a.p);\\n Point v = u * Point(0, 1);\\n for (int t : {-1, 1}) {\\n T h = (a.r + b.r * t) / d;\\n if (eq(h * h, (T)1.)) {\\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\\n a.p + (h > 0 ? u : -u) * a.r + v));\\n } else if (1 > h * h) {\\n Point U = u * h, V = v * sqrt(1 - h * h);\\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\\n }\\n }\\n return res;\\n}\\n\\n/**\\n * @brief Geometry\\n */\\n\\nint main() {\\nwhile(1) {\\n const long double L = 100.0L;\\n int N;\\n long double W;\\n cin >> N >> W;\\n if (N == 0) return 0;\\n vector<Point> P(N);\\n vector<long double> H(N);\\n rep(i,0,N) {\\n long double x, y;\\n cin >> x >> y;\\n P[i] = Point(x,y);\\n cin >> H[i];\\n }\\n auto Judge = [&](long double M) -> bool {\\n vector<Circle> C(N);\\n rep(i,0,N) {\\n if (M <= H[i]) C[i] = Circle(P[i],M);\\n else C[i] = Circle(P[i],sqrt(M*H[i]*2.0L - H[i]*H[i]));\\n }\\n long double D;\\n if (M <= W) D = M;\\n else D = sqrt(M*W*2.0L - W*W);\\n if (D >= 50.0) return false;\\n vector<Segment> S(4);\\n S[0] = Segment(Point(D,D),Point(D,L-D));\\n S[1] = Segment(Point(D,D),Point(L-D,D));\\n S[2] = Segment(Point(L-D,D),Point(L-D,L-D));\\n S[3] = Segment(Point(D,L-D),Point(L-D,L-D));\\n vector<Point> Cand;\\n Cand.push_back(Point(D,D));\\n Cand.push_back(Point(L-D,D));\\n Cand.push_back(Point(D,L-D));\\n Cand.push_back(Point(L-D,L-D));\\n rep(i,0,4) {\\n rep(j,0,N) {\\n auto V = Intersection(C[j],S[i]);\\n for (auto VP : V) Cand.push_back(VP);\\n }\\n }\\n rep(i,0,N) {\\n rep(j,i+1,N) {\\n auto V = Intersection(C[i],C[j]);\\n for (auto VP : V) {\\n if (D <= VP.real() && VP.real() <= L-D && D <= VP.imag() && VP.imag() <= L-D) Cand.push_back(VP);\\n }\\n }\\n }\\n for (auto PP : Cand) {\\n bool check = true;\\n rep(i,0,N) {\\n if (abs(C[i].p-PP) < C[i].r - eps) {\\n check = false;\\n break;\\n }\\n }\\n if (check) return true;\\n }\\n return false;\\n };\\n long double OK = 0.0L, NG = 140.0;\\n rep(_,0,100) {\\n long double MID = (OK + NG) / 2;\\n if (Judge(MID)) OK = MID;\\n else NG = MID;\\n }\\n printf(\\\"%.12Lf\\\\n\\\",(OK+NG)/2.0L);\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -0.4338,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1342_8526701\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\n#define X(p) real(p)\\n#define Y(p) imag(p)\\nusing R = double;\\nusing P = complex<R>;\\nusing VP = vector<P>;\\n\\nconst R EPS = 1e-7;\\nconst R pi = acos(-1.0);\\n\\nstruct C {\\n P p;\\n R r;\\n C() {}\\n C(P p, R r) : p(p), r(r) {}\\n};\\n\\nP rot(P p, R t) {\\n return p * P(cos(t), sin(t));\\n}\\n\\nR dot(P p, P q) {\\n return X(p) * X(q) + Y(p) * Y(q);\\n}\\n\\nR dist(P p, P q) {\\n return abs(p - q);\\n}\\n\\nVP crosspoint(C c1, C c2) {\\n R d = abs(c1.p - c2.p);\\n R a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n R t = atan2(Y(c2.p) - Y(c1.p), X(c2.p) - X(c1.p));\\n VP ret;\\n if (d < max(c1.r, c2.r) - min(c1.r, c2.r) || c1.r + c2.r < d)\\n return ret;\\n P p1 = c1.p + rot(P(c1.r, 0.0), t + a);\\n P p2 = c1.p + rot(P(c1.r, 0.0), t - a);\\n ret.eb(p1), ret.eb(p2);\\n return ret;\\n}\\n\\nint main() {\\n auto calc = [](double h, double r) {\\n chmin(h, r);\\n return sqrt(r * r - (r - h) * (r - h));\\n };\\n auto cx = [](C c, R x) {\\n VP ret;\\n R d = abs(X(c.p) - x);\\n if (d > c.r)\\n return ret;\\n R h = sqrt(c.r * c.r - d * d);\\n ret.eb(x, Y(c.p) - h);\\n ret.eb(x, Y(c.p) + h);\\n return ret;\\n };\\n auto cy = [](C c, R y) {\\n VP ret;\\n R d = abs(Y(c.p) - y);\\n if (d > c.r)\\n return ret;\\n R w = sqrt(c.r * c.r - d * d);\\n ret.eb(X(c.p) - w, y);\\n ret.eb(X(c.p) + w, y);\\n return ret;\\n };\\n while (1) {\\n int n, w;\\n cin >> n >> w;\\n if (!n)\\n break;\\n vector<int> x(n), y(n), h(n);\\n rep(i, n) cin >> x[i] >> y[i] >> h[i];\\n VP pn(n);\\n rep(i, n) pn[i] = P(x[i], y[i]);\\n double ok = 0, ng = 100000;\\n rep(ti, 100) {\\n double mid = (ok + ng) / 2;\\n double dw = calc(w, mid);\\n if (dw > 50) {\\n ng = mid;\\n continue;\\n }\\n vector<R> dn(n);\\n rep(i, n) dn[i] = calc(h[i], mid);\\n VP ls{P(50, 50)};\\n rep(i, n) {\\n C ci(pn[i], calc(h[i], mid));\\n VP tmp;\\n each(p, cx(ci, dw)) tmp.eb(p);\\n each(p, cx(ci, 100 - dw)) tmp.eb(p);\\n each(p, cy(ci, dw)) tmp.eb(p);\\n each(p, cy(ci, 100 - dw)) tmp.eb(p);\\n rep(j, n) if (i != j) each(p, crosspoint(ci, C(pn[j], dn[j]))) tmp.eb(p);\\n if (empty(tmp))\\n ls.eb(pn[i] + P(mid, 0));\\n each(p, tmp) ls.eb(p);\\n }\\n bool f = false;\\n R bl = dw - EPS, br = 100 - dw + EPS;\\n each(p, ls) {\\n bool fl = (bl < min(X(p), Y(p)) && max(X(p), Y(p)) < br);\\n rep(i, n) fl &= dist(p, pn[i]) > dn[i] - EPS;\\n if (fl)\\n f = true;\\n }\\n (f ? ok : ng) = mid;\\n }\\n cout << ok << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 980,\n \"memory_kb\": 4024,\n \"score_of_the_acc\": -1.0062,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1342_7236025\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\n//vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<T> inv_perm(const vector<T>&ord){\\n vector<T>inv(ord.size());\\n for(int i=0;i<ord.size();i++)inv[ord[i]] = i;\\n return inv;\\n}\\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\nll modulo(ll n,ll d){return (n%d+d)%d;};\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n\\ntemplate <typename F>\\nclass\\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\n [[nodiscard]]\\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\nFixPoint final : private F\\n{\\npublic:\\n template <typename G>\\n explicit constexpr FixPoint(G&& g) noexcept\\n : F{std::forward<G>(g)}\\n {}\\n\\n template <typename... Args>\\n constexpr decltype(auto)\\n operator()(Args&&... args) const\\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n {\\n return F::operator()(*this, std::forward<Args>(args)...);\\n }\\n}; // class FixPoint\\n\\n\\n#if defined(__cpp_deduction_guides)\\ntemplate <typename F>\\nFixPoint(F&&)\\n -> FixPoint<std::decay_t<F>>;\\n#endif // defined(__cpp_deduction_guides)\\n\\n\\nnamespace\\n{\\n template <typename F>\\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n# if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n __attribute__((warn_unused_result))\\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\\n _Check_return_\\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n inline constexpr decltype(auto)\\n makeFixPoint(F&& f) noexcept\\n{\\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\\n}\\n} // namespace\\n\\nusing Real = long double;\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, PI = acos((Real)(-1.0));\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\\ninline bool eq(Point a, Point b) { return fabs(b - a) < EPS; }\\n\\nPoint operator*(const Point &p, const Real &d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, Point &p) {\\n return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\nPoint rotate(Real theta, const Point &p) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nnamespace std {\\n bool operator<(const Point& a, const Point& b) {\\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b): a(a), b(b) {}\\n\\n friend ostream &operator<<(ostream &os, Line &p) {\\n return os << p.a << \\\" to \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a) {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\nstruct Circle {\\n Point c;\\n Real r;\\n Circle() = default;\\n Circle(Point c, Real r): c(c), r(r) {}\\n\\n friend ostream &operator<<(ostream &os, Circle &c) {\\n return os << c.c << \\\": \\\" << c.r;\\n }\\n\\n friend istream &operator>>(istream &is, Circle &c) {\\n return is >> c.c >> c.r;\\n }\\n};\\n\\nReal cross(const Point &a, const Point &b) {\\n return real(a) * imag(b) - real(b) * imag(a);\\n}\\n\\nReal dot(const Point &a, const Point &b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if (cross(b, c) > EPS) return +1; // COUNTER_CLOCKWISE\\n if (cross(b, c) < -EPS) return -1; // CLOCKWISE\\n if (dot(b, c) < 0) return +2; // ONLINE_BACK\\n if (norm(b) < norm(c)) return -2; // ONLINE_FRONT\\n return 0; // ON_SEGMENT\\n}\\n\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\nbool intersect(const Segment &s, const Segment&t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nbool intersect(const Line &l, const Segment& s) {\\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nint intersect(const Circle &c, const Circle &d) {\\n Real dis = fabs(c.c - d.c);\\n\\n if (dis > c.r + d.r + EPS) return 4;\\n else if (eq(dis, c.r + d.r)) return 3;\\n else if (eq(dis, abs(c.r - d.r))) return 1;\\n else if (dis + min(c.r, d.r) < max(c.r, d.r) - EPS) return 0;\\n else return 2;\\n}\\n\\nbool parallel(const Line &a, const Line &b) {\\n return abs(cross(a.b - a.a, b.b - b.a)) < EPS;\\n}\\n\\nbool orthogonal(const Line &a, const Line &b) {\\n return abs(dot(a.b - a.a, b.b - b.a)) < EPS;\\n}\\n\\nPoint projection(const Line& s, const Point &p) {\\n double t = dot(p - s.a, s.b - s.a) / norm(s.b - s. a);\\n return s.a + (s.b - s.a) * t;\\n}\\n\\nPoint projection(const Segment& l, const Point &p) {\\n return projection(Line(l), p);\\n}\\n\\nPoint reflection(const Line &l, const Point &p) {\\n Point r = projection(l, p);\\n return p + (r - p) * 2;\\n}\\n\\nReal distance(const Line &l, const Point &p) {\\n Point r = projection(l, p);\\n return fabs(p - r);\\n}\\n\\nReal distance(const Segment&s, const Point &p) {\\n Point r = projection(s, p);\\n if (intersect(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\nReal distance(const Segment& a, const Segment& b) {\\n if (intersect(a, b)) return 0;\\n return min({\\n distance(a, b.a),\\n distance(a, b.b),\\n distance(b, a.a),\\n distance(b, a.b)\\n });\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\nPoint crosspoint(const Segment& l, const Segment& m) {\\n return crosspoint(Line(l), Line(m));\\n}\\n\\nLine bisector_of_angle(const Point& a, const Point& b, const Point& c) {\\n Real d_ab = fabs(a - b);\\n Real d_bc = fabs(b - c);\\n Point c_ = b + (c - b) * d_ab / d_bc;\\n\\n return Line(b, (a + c_) * 0.5);\\n}\\n\\nLine bisector(const Point& a, const Point& b) {\\n Point c = (a + b) * 0.5;\\n Point d = c + rotate(PI / 2, b - c);\\n\\n return Line(c, d);\\n}\\n\\nint intersect(const Circle &c, const Line &l) {\\n Real d = distance(l, c.c);\\n\\n if (d > c.r + EPS) return 0;\\n if (eq(d, c.r)) return 1;\\n return 2;\\n}\\n\\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\\n Real d = distance(l, c.c);\\n\\n Point p = projection(l, c.c);\\n if (intersect(c, l) == 1) return { p, p };\\n\\n Real d2 = sqrt(c.r * c.r - d * d);\\n Point v = (l.a - l.b) * (1.0 / fabs(l.a - l.b));\\n\\n return { p + d2 * v, p - d2 * v };\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n Real d = fabs(c1.c - c2.c);\\n Real x1 = (c1.r * c1.r + d * d - c2.r * c2.r) / 2 / d;\\n Real y = sqrt(c1.r * c1.r - x1 * x1);\\n\\n Point base = (c2.c * x1 + c1.c * (d - x1)) * (1.0 / d);\\n Point v = rotate(PI / 2, c1.c - base);\\n v = v / fabs(v);\\n\\n return { base + v * y, base - v * y };\\n}\\n\\npair<Point, Point> tangent(const Circle &c, const Point &p) {\\n Real d = fabs(c.c - p);\\n Real d2 = sqrt(d * d - c.r * c.r);\\n Real a = acos(d2 / d);\\n\\n\\n Point q = c.c - p;\\n q = q / fabs(q);\\n\\n// cout << d << \\\" \\\" << d2 << \\\" \\\" << a << \\\" \\\" << q << endl;\\n return {\\n p + rotate(a, q) * d2,\\n p + rotate(-a, q) * d2\\n };\\n}\\n\\nvector<Segment> common_tangent(Circle c1, Circle c2) {\\n int isect = intersect(c1, c2);\\n Real d = fabs(c1.c - c2.c);\\n Point v = (c2.c - c1.c) / d;\\n\\n vector<Segment> res;\\n\\n if (isect == 0) {\\n return {};\\n } else if (isect == 1) {\\n auto [p1, p2] = crosspoint(c1, Line(c1.c, c2.c));\\n if (eq(fabs(p2 - c2.c), c2.r)) swap(p1, p2);\\n\\n Point v = p1 + rotate(PI/2, c2.c - p1);\\n return { Segment(p1, v) };\\n } else if (isect == 2) {\\n } else if (isect == 3) {\\n auto [p1, p2] = crosspoint(c1, c2);\\n res.emplace_back(p1, rotate(PI / 2, c1.c - p1) + p1);\\n } else {\\n Real a = d * c1.r / (c1.r + c2.r);\\n Point p = c1.c + v * a;\\n\\n Real d1 = sqrt(a * a - c1.r * c1.r), d2 = sqrt(norm(p - c2.c) - c2.r * c2.r);\\n Real theta = acos(d1 / a);\\n\\n// cout << d << endl;\\n// cout << a << \\\" \\\" << d1 << \\\" \\\" << d2 << \\\" \\\" << theta << \\\": \\\" << p << endl;\\n\\n Point e = (c1.c - p) * (1.0 / fabs(c1.c - p));\\n Point e1 = rotate(theta, e), e2 = rotate(-theta, e);\\n\\n res.emplace_back(p + e1 * d1, p - e1 * d2);\\n res.emplace_back(p + e2 * d1, p - e2 * d2);\\n }\\n\\n if (eq(c1.r, c2.r)) {\\n Point e = rotate(PI / 2, v);\\n res.push_back(Segment(c1.c + e * c1.r, c2.c + e * c1.r));\\n res.push_back(Segment(c1.c - e * c1.r, c2.c - e * c1.r));\\n return res;\\n }\\n\\n if (c1.r > c2.r) swap(c1, c2);\\n\\n v = c1.c - c2.c;\\n Point p = v * (1.0 / (c2.r - c1.r)) * c2.r + c2.c;\\n\\n auto [q1, q2] = tangent(c1, p);\\n res.emplace_back(q1, crosspoint(c2, Line(p, q1)).first);\\n res.emplace_back(q2, crosspoint(c2, Line(p, q2)).first);\\n\\n return res;\\n}\\n\\nusing Polygon = vector<Point>;\\n\\nistream& operator>>(istream& is, Polygon &p) {\\n for (int i = 0; i < p.size(); i++) is >> p[i];\\n return is;\\n}\\n\\nostream& operator<<(ostream& os, Polygon &p) {\\n for (int i = 0; i < p.size(); i++) os << p[i];\\n return os;\\n}\\n\\nReal area(const Polygon& p) {\\n Real res = 0;\\n for (int i = 0; i < p.size(); i++) {\\n res += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return abs(res)/2;\\n}\\n\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(fabs(cross(a,b)) < EPS and dot(a,b) < EPS) return 1;\\n if(a.imag()>b.imag()) swap(a,b);\\n if(a.imag() < EPS and EPS < b.imag() and cross(a,b) > EPS ) {\\n// cout << a << \\\" --- \\\" << b << \\\": \\\" << cross(a, b) << endl;\\n x = !x;\\n }\\n }\\n return (x?2:0);\\n}\\n\\nPolygon convex_hull(Polygon Q) {\\n sort(ALL(Q));\\n\\n Polygon upper({Q[0]}), lower({Q[0]});\\n\\n rep(i, 1, Q.size()) {\\n while (upper.size() >= 2) {\\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\\n if (_ccw == 1) {\\n upper.pop_back();\\n } else {\\n break;\\n }\\n }\\n if (upper.size() <= 1) {\\n upper.push_back(Q[i]);\\n } else if (upper.size() > 1) {\\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\\n if (_ccw == -1 || _ccw == -2) {\\n upper.push_back(Q[i]);\\n }\\n }\\n }\\n rep(i, 1, Q.size()) {\\n while (lower.size() >= 2) {\\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\\n if (_ccw == -1) {\\n lower.pop_back();\\n } else {\\n break;\\n }\\n }\\n\\n if (lower.size() <= 1) {\\n lower.push_back(Q[i]);\\n } else if (lower.size() > 1) {\\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\\n if (_ccw == 1 || _ccw == -2) {\\n lower.push_back(Q[i]);\\n }\\n }\\n }\\n\\n Polygon ret;\\n\\n rep(i, 0, lower.size()) {\\n ret.push_back(lower[i]);\\n// cout << lower[i] << endl;\\n }\\n\\n// cout << \\\" | \\\" << endl;\\n\\n rrep(i, 0, upper.size()) {\\n if (!eq(lower[0], upper[i]) && !eq(lower.back(), upper[i]))\\n ret.push_back(upper[i]);\\n// cout << upper[i] << endl;\\n }\\n\\n int start = 0;\\n\\n// cout << ret.size() << endl;\\n rep(i, 0, ret.size()) {\\n if (ret[i].imag() < ret[start].imag() || (eq(ret[i].imag(), ret[start].imag()) && ret[i].real() < ret[start].real())) {\\n start = i;\\n }\\n }\\n\\n cout << ret.size() << endl;\\n rep(i, 0, ret.size()) {\\n auto p = ret[(i + start) % ret.size()];\\n cout << (int)p.real() << \\\" \\\" << (int)p.imag() << endl;\\n }\\n\\n return ret;\\n}\\n\\nReal closest_pair(vector<Point> &pts, int l, int r) {\\n int m = (l + r) / 2;\\n if (r - l <= 1) {\\n return INF;\\n } else if (r - l == 2) {\\n if (imag(pts[l]) > imag(pts[l + 1])) swap(pts[l], pts[l + 1]);\\n return fabs(pts[l] - pts[l + 1]);\\n }\\n\\n Real mid = pts[m].real();\\n Real d = min(closest_pair(pts, l, m), closest_pair(pts, m, r));\\n\\n inplace_merge(pts.begin() + l, pts.begin() + m, pts.begin() + r, [](const Point &a, const Point& b) {\\n return a.imag() < b.imag();\\n });\\n\\n vector<Point> ret;\\n\\n for (int i = l; i < r; i++) {\\n if (fabs(pts[i].real() - mid) >= d) continue;\\n\\n for (int j = ret.size() - 1; j >= 0; j--) {\\n if (fabs(imag(ret[j]) - imag(pts[i])) >= d) break;\\n chmin(d, fabs(ret[j] - pts[i]));\\n }\\n\\n ret.emplace_back(pts[i]);\\n }\\n\\n return d;\\n}\\n\\nint main() {\\n cout << fixed << setprecision(5);\\n\\n int n;\\n Real w;\\n while (cin >> n >> w && n != 0) {\\n vector<Point> needle(n);\\n vector<Real> h(n);\\n rep(i, 0, n) {\\n cin >> needle[i] >> h[i];\\n }\\n\\n auto check = [&](Real r) {\\n// cout << r << endl;\\n Polygon rect(4);\\n if (r <= w) {\\n rect = Polygon({\\n Point(r, r), Point(100 - r, r), Point(100 - r, 100 - r), Point(r, 100 - r)\\n });\\n } else {\\n Real d = sqrt(r * r - (r - w) * (r - w));\\n rect = Polygon({\\n Point(d, d), Point(100 - d, d), Point(100 - d, 100 - d), Point(d, 100 - d)\\n });\\n }\\n if (rect[0].real() > rect[1].real() + EPS) return false;\\n// cout << \\\"rect: \\\" << rect[0] << \\\" - \\\" << rect[2] << endl;\\n\\n vector<Circle> cirs(n);\\n rep(i, 0, n) {\\n Real d;\\n if (r <= h[i]) d = r;\\n else d = sqrt(r * r - (r - h[i]) * (r - h[i]));\\n\\n cirs[i] = Circle(needle[i], d);\\n// cout << \\\"circle: \\\" << needle[i] << \\\" \\\" << d << endl;\\n bool out = true;\\n rep(j, 0, 4) {\\n if (fabs(cirs[i].c - rect[j]) > cirs[i].r - EPS) out = false;\\n }\\n if (out) return false;\\n }\\n\\n vector<Point> cands({rect[0], rect[1], rect[2], rect[3]});\\n rep(i, 0, n) {\\n rep(j, i + 1, n) {\\n if (!intersect(cirs[i], cirs[j])) continue;\\n\\n auto [p1, p2] = crosspoint(cirs[i], cirs[j]);\\n cands.push_back(p1);\\n if (!eq(p1, p2)) cands.push_back(p2);\\n }\\n rep(j, 0, 4) {\\n Segment sg(rect[j], rect[(j + 1) % 4]);\\n if (!intersect(cirs[i], sg)) continue;\\n\\n auto [p1, p2] = crosspoint(cirs[i], sg);\\n cands.push_back(p1);\\n if (!eq(p1, p2)) cands.push_back(p2);\\n }\\n }\\n\\n for (auto &p : cands) {\\n if (!(rect[0].real() - EPS < p.real() && p.real() < real(rect[2]) + EPS&&\\n imag(rect[0]) - EPS < imag(p) && imag(p) < imag(rect[2]) + EPS)) {\\n continue;\\n }\\n\\n bool ok = true;\\n rep(i, 0, n) {\\n if (fabs(p - cirs[i].c) < cirs[i].r - EPS) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return true;\\n }\\n\\n return false;\\n };\\n\\n Real l = 1, r = (50 * 50 + w * w) / 2 / w, m;\\n rep(_, 0, 35) {\\n m = (l + r) / 2;\\n if (check(m)) l = m;\\n else r = m;\\n }\\n cout << l << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.7546,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1342_6012521\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long int;\\n//using Int=__int128;\\n#define ALL(A) A.begin(),A.end()\\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}\\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\\n//→ ↓ ← ↑ \\nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\\n//右上から時計回り\\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\\n//long double EPS = 1e-6;\\n//long double PI = acos(-1);\\n//const ll INF=(1LL<<62);\\nconst int MAX=(1<<30);\\nconstexpr ll MOD=1000000000+7;\\n//constexpr ll MOD=998244353;\\n\\n\\ninline void bin101(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n}\\n\\nusing Graph=vector<vector<int>>;\\n\\ntemplate<typename T >\\nstruct edge {\\n\\tint to;\\n\\tT cost;\\n\\tedge()=default;\\n\\tedge(int to, T cost) : to(to), cost(cost) {}\\n\\n};\\ntemplate<typename T>\\nusing WeightGraph=vector<vector<edge<T>>>;\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n\\treturn vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n\\tauto v=vmake(args...);\\n\\treturn vector<decltype(v)>(n,move(v));\\n}\\n////////////////////////////\\n// マクロや型\\n////////////////////////////\\n\\nusing DD=long double;\\n\\nconst DD EPS=1e-9;\\nconst DD INF=1e50;\\nconst DD PI=acosl(-1.0);\\n#define EQ(a,b) (abs( (a) - (b) )<EPS) //a==b\\n#define LS(a,b) ( (a)+EPS<(b) ) //a<b\\n#define GR(a,b) ( (a)>(b)+EPS ) //a>b\\n#define LE(a,b) ( (a)<(b)+EPS ) //a<=b\\n#define GE(a,b) ( (a)>(b)-EPS ) //a>=b\\n\\n#define X real()\\n#define Y imag()\\n\\n\\n//点\\nusing Point=complex<DD>;\\nistream &operator>>(istream &is, Point &p) {\\n DD x,y;\\n is>>x>>y;\\n p=Point(x,y);\\n return is;\\n}\\n\\n//点a→点bの線分\\n//aとbが等しい時、色々バグるから注意!\\nstruct Segment{\\n Point a,b;\\n Segment()=default;\\n Segment(Point a,Point b) :a(a),b(b){}\\n Segment(DD ax,DD ay,DD bx,DD by):a(ax,ay),b(bx,by){}\\n Segment(DD r,Point a) :a(a),b(a+polar((DD)1.0,r)){} \\n};\\nusing Line=Segment;\\n\\n//円\\nstruct Circle{\\n Point p;\\n DD r;\\n Circle()=default;\\n Circle(Point p,DD r):p(p),r(r){}\\n};\\n\\nusing Polygon=vector<Point>;\\n\\n////////////////////////////\\n// 基本計算\\n////////////////////////////\\n\\n//度→ラジアン\\ninline DD torad(const DD deg){return deg*PI/180;}\\n//ラジアン→度\\ninline DD todeg(const DD rad){return rad*180/PI;}\\n//内積 |a||b|cosθ\\ninline DD dot(const Point &a,const Point &b){return (conj(a)*b).X;}\\n//外積 |a||b|sinθ\\ninline DD cross(const Point &a,const Point &b){return (conj(a)*b).Y;}\\n//ベクトルpを反時計回りにtheta(ラジアン)回転\\nPoint rotate(const Point &p,const DD theta){return p*Point(cos(theta),sin(theta));}\\n\\n//余弦定理 cos(角度abc(ラジアン))を返す\\n//長さの対応に注意 ab:辺abの長さ\\n//verify:https://codeforces.com/gym/102056/problem/F\\nDD cosine_formula(const DD ab,const DD bc,const DD ca){\\n return (ab*ab+bc*bc-ca*ca)/(2*ab*bc);\\n}\\n\\ninline bool xy_sort(const Point &a,const Point &b){\\n if(a.X+EPS<b.X) return true;\\n if(EQ(a.X,b.X) && a.Y+EPS<b.Y) return true;\\n return false;\\n}\\ninline bool yx_sort(const Point &a,const Point &b){\\n if(a.Y+EPS<b.Y) return true;\\n if(EQ(a.Y,b.Y) && a.X+EPS<b.X) return true;\\n return false;\\n}\\nnamespace std{\\n inline bool operator<(const Point &a,const Point &b)noexcept{\\n return xy_sort(a,b);\\n }\\n}\\n//DDの比較関数\\n//map<DD,vector<pii>,DDcom>\\nstruct DDcom{\\n bool operator()(const DD a, const DD b) const noexcept {\\n return a+EPS<b;\\n }\\n};\\n\\n\\n////////////////////////////\\n// 平行や直交\\n////////////////////////////\\n\\nbool isOrthogonal(const Point &a,const Point &b){\\n return EQ(dot(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isOrthogonal(const Segment &s,const Segment &t){\\n return EQ(dot(s.a-s.b,t.a-t.b),0.0);\\n}\\nbool isParallel(const Point &a,const Point &b){\\n return EQ(cross(a,b),0.0);\\n}\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool isParallel(const Segment &s,const Segment &t){\\n return EQ(cross(s.a-s.b,t.a-t.b),0);\\n}\\n//線分a→bに対して点cがどの位置にあるか\\n//反時計回り:1 時計回り:-1 直線上(a,b,c:-2 a,c,b:0 c,a,b:2)\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n//線分a→bの端点にcがあるなら0と判定されるはず\\nint ccw(const Point &a,Point b,Point c){\\n if(EQ(abs(b-c),0) or EQ(abs(a-c),0)) return 0;\\n b-=a;c-=a;\\n if(cross(b,c)>EPS) return 1;\\n if(cross(b,c)<-EPS) return -1;\\n if(dot(b,c)<-EPS) return 2;\\n if(LS(norm(b),norm(c))) return -2;\\n return 0;\\n}\\n\\n////////////////////////////\\n// 射影と反射\\n////////////////////////////\\n\\n//射影\\n//直線lに点pから垂線を引いたときの交点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint project(const Point &p,const Line &l){\\n Point base=l.b-l.a;\\n DD r=dot(p-l.a,base)/norm(base);\\n return l.a+base*r;\\n}\\n//反射\\n//直線lに対して点pと対称な点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflect(const Point &p,const Line &l){\\n return p+(project(p,l)-p)*(DD)2.0;\\n}\\n//反射\\n//直線lに対して線分sと対称な線分(直線でも使える)\\n//verify:https://onlinejudge.u-aizu.ac.jp/solutions/problem/1171/review/6009447/bin101/C++17\\nSegment reflect(const Segment &s,const Line &l){\\n return Segment(reflect(s.a,l) , reflect(s.b,l));\\n}\\n\\n////////////////////////////\\n// 点との距離\\n////////////////////////////\\n\\n//点と直線の距離\\nDD DistPL(const Point &p,const Line &l){\\n return abs(cross(l.b-l.a,p-l.a))/abs(l.b-l.a);\\n}\\n//点と線分の距離\\nDD DistPS(const Point &p,const Segment &s){\\n if( dot(s.b-s.a,p-s.a)<0.0 ) return abs(p-s.a);\\n if( dot(s.a-s.b,p-s.b)<0.0 ) return abs(p-s.b);\\n return DistPL(p,s);\\n}\\n\\n////////////////////////////\\n// 線分と直線\\n////////////////////////////\\n\\n//線分a-b,c-dは交差するか?\\n//接する場合も交差すると判定\\n//接する場合は交差しないとするなら<=を<に変換\\nbool intersect(const Point &a,const Point &b,const Point &c,const Point &d){\\n return(ccw(a,b,c)*ccw(a,b,d)<=0 && ccw(c,d,a)*ccw(c,d,b)<=0);\\n}\\n//線分s,tは交差するか？\\n//接する場合も交差すると判定\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B&lang=ja\\n//接する場合は交差しないとするならintersectの<=を<に変換\\nbool intersect(const Segment &s,const Segment &t){\\n return intersect(s.a,s.b,t.a,t.b);\\n}\\n// 2直線の交点\\n// 線分の場合はintersectをしてから使う\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C&lang=ja\\nPoint crossPoint(const Line &s,const Line &t){\\n Point base=t.b-t.a;\\n DD d1=cross(base,t.a-s.a);\\n DD d2=cross(base,s.b-s.a);\\n if(EQ(d1,0) and EQ(d2,0)) return s.a; //同じ直線\\n if(EQ(d2,0)) assert(false); //交点がない\\n return s.a+d1/d2*(s.b-s.a);\\n}\\n//線分と線分の距離\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D&lang=ja\\nDD Dist(const Segment &s,const Segment &t){\\n if(intersect(s,t)) return 0.0;\\n return min(min(DistPS(t.a,s),DistPS(t.b,s)),min(DistPS(s.a,t),DistPS(s.b,t)) );\\n}\\nbool issame(const Line &l,const Line &m){\\n if (GR(abs(cross(m.a - l.a, l.b - l.a)),0) ) return false;\\n if (GR(abs(cross(m.b - l.a, l.b - l.a)),0) ) return false;\\n return true;\\n}\\n\\n////////////////////////////\\n// 円\\n////////////////////////////\\n//直線lと円Cの交点\\n//l.aにより近い方がindexが小さい\\n//veirfy:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nvector<Point> crossPointLC(const Line &l,const Circle &c){\\n vector<Point> ret;\\n if(GR(DistPL(c.p,l),c.r)) return ret; //交点がないとき、空ベクトルを返す\\n Point pr=project(c.p,l);\\n Point e=(l.b-l.a)/(abs(l.b-l.a));\\n DD base=sqrt(c.r*c.r-norm(pr-c.p));\\n ret.push_back(pr-e*base);\\n ret.push_back(pr+e*base);\\n if(EQ(DistPL(c.p,l),c.r)) ret.pop_back(); //接するとき\\n return ret;\\n}\\n//線分sと円cの交点\\n//交点がないときは空ベクトルを返す\\n//線分の端が交わる場合も交点とみなす\\n//s.aにより近い方がindexが小さい\\nvector<Point> crossPointSC(const Segment &s,const Circle &c){\\n vector<Point> ret;\\n if(DistPS(c.p,s)>c.r+EPS) return ret;\\n auto koho=crossPointLC(s,c);\\n for(auto p:koho){\\n if(ccw(s.a,s.b,p)==0 or EQ(abs(p-s.a),0) or EQ(abs(p-s.b),0)) ret.push_back(p);\\n }\\n return ret;\\n}\\n\\n//円aと円bの共通接線の数\\n//離れている:4 外接:3 交わる:2 内接:1 内包:0\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\\nint intersect(const Circle &a,const Circle &b){\\n DD d=abs(a.p-b.p);\\n if(GR(d,a.r+b.r)) return 4;\\n if(EQ(d,a.r+b.r)) return 3;\\n if(EQ(d,abs(a.r-b.r))) return 1;\\n if(LS(d,abs(a.r-b.r))) return 0;\\n return 2;\\n}\\n\\n//円aと円bの交点\\n//交点がないときは空ベクトルを返す\\n//\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nvector<Point> crossPoint(const Circle &a,const Circle &b){\\n vector<Point> ret;\\n if(GR(abs(a.p-b.p),a.r+b.r)) return ret; //離れている\\n DD d=abs(a.p-b.p);\\n //cerr<<(a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)<<endl;\\n DD s=acosl((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d)); //0~π\\n DD t=arg(b.p-a.p);\\n if(EQ(a.r+b.r,d)) ret.push_back(a.p+polar(a.r,t));\\n else ret.push_back(a.p+polar(a.r,t+s)),ret.push_back(a.p+polar(a.r,t-s));\\n return ret;\\n}\\n\\n//点pから円cに接線を引いたときの接点\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F&lang=ja\\nvector<Point> TanLine(const Point &p,const Circle &c){\\n vector<Point> ret;\\n DD d=abs(p-c.p);\\n if(LS(d,c.r)) return ret; //pがcの内部にある場合\\n if(EQ(d,c.r)){\\n ret.push_back(p);\\n return ret; //円の線上にある場合\\n } \\n return crossPoint(c,Circle(p,sqrt(d*d-c.r*c.r)));\\n}\\n\\n//円a,bの共通接線\\n//https://www.slideshare.net/kujira16/ss-35861169\\n//Line.aは円aと接線の交点\\n//(接線と円bの交点)と(接線と円aの交点)が違う場合はLine.bは(接線と円bの交点)\\n//一致する場合は円aの中心からLine.aに向かうベクトルを反時計回りに90度回転したものを\\n//Line.aに足したもの\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2201\\nvector<Line> TanLine(const Circle &a,const Circle &b){\\n DD d=abs(a.p-b.p);\\n vector<Line> ret;\\n //外接線\\n if(intersect(a,b)>=2){\\n if(EQ(a.r,b.r)){\\n Point up=polar(a.r,arg(b.p-a.p)+PI/2);\\n ret.emplace_back(a.p+up,b.p+up);\\n ret.emplace_back(a.p-up,b.p-up);\\n }else{\\n Point q=(a.p*b.r-b.p*a.r)/(b.r-a.r);\\n auto as=TanLine(q,a);\\n auto bs=TanLine(q,b);\\n assert(as.size()==2 and bs.size()==2);\\n for(int i=0;i<2;i++){\\n ret.emplace_back(as[i],bs[i]);\\n }\\n }\\n }else if(intersect(a,b)==1){ //内接する場合\\n Point dir;\\n if(a.r>b.r) dir=polar(a.r,arg(b.p-a.p));\\n else dir=polar(a.r,arg(a.p-b.p));\\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\\n }\\n //内接線\\n if(GR(abs(a.p-b.p),a.r+b.r)){ //円が離れている場合\\n Point q=a.p+(b.p-a.p)*a.r/(a.r+b.r);\\n auto as=TanLine(q,a);\\n auto bs=TanLine(q,b);\\n assert(as.size()==2 and bs.size()==2);\\n for(int i=0;i<2;i++){\\n ret.emplace_back(as[i],bs[i]);\\n }\\n }else if(EQ(d,a.r+b.r)){ //円が接している場合\\n Point dir=polar(a.r,arg(b.p-a.p));\\n ret.emplace_back(a.p+dir,a.p+dir+rotate(dir,PI/2));\\n }\\n return ret;\\n}\\n//２つの円の共通部分の面積\\n//参考: https://tjkendev.github.io/procon-library/python/geometry/circles_intersection_area.html\\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005736#1\\nDD Area(const Circle &c1,const Circle &c2){\\n DD cd=abs(c1.p-c2.p);\\n if(LE(c1.r+c2.r,cd)) return 0; //円が離れている\\n\\n if(LE(cd,abs(c1.r-c2.r))) //片方の円が他方を包んでいる\\n return min(c1.r,c2.r)*min(c1.r,c2.r)*PI;\\n\\n DD theta1=acosl(cosine_formula(c1.r,cd,c2.r));\\n DD theta2=acosl(cosine_formula(c2.r,cd,c1.r));\\n\\n return c1.r*c1.r*theta1+c2.r*c2.r*theta2-c1.r*cd*sin(theta1);\\n}\\n\\n\\n////////////////////////////\\n// 三角形\\n////////////////////////////\\n\\n//ヘロンの公式 三角形の面積を返す\\n//三角形が成立するか(平行ではないか)を忘れずに\\nDD Heron(const DD ad,const DD bd,const DD cd){\\n DD s=(ad+bd+cd)/2;\\n return sqrt(s*(s-ad)*(s-bd)*(s-cd));\\n}\\n//三角形の外接円\\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_C\\nCircle CircumscribedCircle(const Point &a,const Point &b,const Point &c){\\n Point bc=(b+c)/(DD)2.0;\\n Line aa(bc,bc+rotate(c-b,PI/2));\\n Point ab=(a+b)/(DD)2.0;\\n Line cc(ab,ab+rotate(b-a,PI/2));\\n Point p=crossPoint(aa,cc);\\n return Circle(p,abs(a-p));\\n}\\n//三角形の内接円\\n//isParallel()を使って三角形が成立するか(平行ではないか)を忘れずに\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_B\\nCircle InCircle(const Point &a,const Point &b,const Point &c){\\n Line aa(a,a+polar((DD)1.0,(arg(b-a)+arg(c-a))/(DD)2.0));\\n Line bb(b,b+polar((DD)1.0,(arg(a-b)+arg(c-b))/(DD)2.0));\\n Point p=crossPoint(aa,bb);\\n return Circle(p,DistPL(p,Line(a,b)));\\n}\\n\\n////////////////////////////\\n// 多角形\\n////////////////////////////\\n\\n//点pが多角形gに対してどの位置にあるか\\n//中:2 辺上:1 外:0\\n//凸多角形である必要ない\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\nint contains(const Point &p,const vector<Point> &g){\\n int n=(int)g.size();\\n int x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(EQ(cross(a,b),0) && dot(a,b)<EPS) return 1;\\n if(a.Y>b.Y) swap(a,b);\\n if(a.Y<EPS && EPS<b.Y && cross(a,b)>EPS) x=!x;\\n }\\n return (x?2:0);\\n}\\n//凸性判定\\n//多角形gは凸か？\\n//gは反時計回りでも時計回りでもいい\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\nbool isConvex(const vector<Point> &g){\\n int n=(int)g.size();\\n if(n<=3) return true;\\n int flag=0;\\n int t;\\n for(int i=0;i<n;i++){\\n Point a(g[(i+1)%n]-g[i]),b(g[(i+2)%n]-g[i]);\\n if(cross(a,b)>EPS) t=1;\\n else if(cross(a,b)<-EPS) t=-1;\\n else continue;\\n if(flag==-t) return false;\\n flag=t;\\n }\\n return true;\\n}\\n\\n//凸包 アンドリューのアルゴリズム\\n//O(NlogN)\\n//反時計回りの多角形を返す\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\nvector<Point> ConvexHull(vector<Point> s,const bool on_edge){\\n int j;\\n if(on_edge) j=-1;\\n else j=1;\\n int sz=(int)s.size();\\n if(sz<3) return s;\\n sort(s.begin(),s.end(),yx_sort);\\n\\n int n=0;\\n vector<Point> res(2*sz);\\n for(int i=0;i<sz;i++){\\n while(n>=2 && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\\n n--;\\n }\\n res[n]=s[i];\\n n++;\\n }\\n int t=n+1;\\n for(int i=sz-2;i>=0;i--){\\n while(n>=t && cross(res[n-1]-res[n-2],s[i]-res[n-2])<EPS*j){\\n n--;\\n }\\n res[n]=s[i];\\n n++;\\n }\\n res.resize(n-1);\\n return res;\\n}\\n\\n//多角形g(凸でなくてもいい)の符号付き面積\\n//反時計回りの多角形なら正の値を返す 時計回りなら負\\n//O(N)\\n//https://imagingsolution.net/math/calc_n_point_area/\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\nDD Area(const vector<Point> &g){\\n DD ret=0.0;\\n int n=(int)g.size();\\n for(int i=0;i<n;i++){\\n ret+=cross(g[i],g[(i+1)%n]);\\n }\\n return ret/2.0;\\n}\\n\\n//凸多角形gを直線lで切断\\n//直線の左側(向きを考慮)にできる凸多角形を返す\\n//多角形gが反時計回りならば、反時計回りで返す(時計回りなら時計回り)\\n//直線上の頂点を含む線分の交点は含めてない\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\nvector<Point> ConvexCut(const vector<Point> &g,const Line &l){\\n vector<Point> ret;\\n int gz=(int)g.size();\\n for(int i=0;i<gz;i++){\\n Point now=g[i],next=g[(i+1)%gz];\\n if(ccw(l.a,l.b,now)!=-1) ret.push_back(now);\\n if(EQ(DistPL(now,l),0) or EQ(DistPL(next,l),0)) continue;\\n if(ccw(l.a,l.b,now)*ccw(l.a,l.b,next)<0){\\n ret.push_back(crossPoint(Line(now,next),l));\\n }\\n }\\n return ret;\\n}\\n//部品\\ninline DD calc(const Point &a,const Point &b,const DD &r,const bool triangle){\\n if(triangle) return cross(a,b);\\n else return r*r*arg(b/a);\\n}\\n//部品\\nDD calcArea(const DD &r,const Point &a,const Point &b){\\n if(EQ(abs(a-b),0)) return 0;\\n bool ina=(abs(a)<r+EPS);\\n bool inb=(abs(b)<r+EPS);\\n if(ina && inb) return cross(a,b);\\n auto cr=crossPointSC(Segment(a,b),Circle(Point(0,0),r));\\n if(cr.empty()) return calc(a,b,r,false);\\n auto s=cr[0],t=cr.back();\\n return calc(s,t,r,true)+calc(a,s,r,ina)+calc(t,b,r,inb);\\n}\\n//円と多角形の共通部分の面積\\n//多角形が反時計回りならば正の値を返す\\n//凸多角形でなくても大丈夫\\n//http://drken1215.hatenablog.com/entry/2020/02/02/091000\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H&lang=ja\\nDD Area(const Circle &c,const vector<Point> &g){\\n DD ret=0.0;\\n int gz=g.size();\\n if(gz<=2) return ret;\\n for(int i=0;i<gz;i++){\\n Point a=g[i]-c.p,b=g[(i+1)%gz]-c.p;\\n ret+=calcArea(c.r,g[i]-c.p,g[(i+1)%gz]-c.p);\\n }\\n return ret/2.0;\\n}\\n\\n//点と多角形の距離\\n//点が多角形の中にあるなら0\\nDD Dist(const Point &a,const vector<Point> &b){\\n\\tif(b.size()==1) return abs(a-b[0]);\\n\\tif(contains(a,b)>=1) return 0.0L;\\n\\tDD ret=INF;\\n\\tfor(int i=0;i<b.size();i++){\\n\\t\\tchmin(ret,DistPS(a,Segment(b[i],b[(i+1)%b.size()])));\\n\\t}\\n\\treturn ret;\\n}\\n\\n//多角形と多角形の距離\\n//どちらかが内側に入っていたら0\\n//全ての線分の組み合わせの距離を求めて、その最小が答え\\n//O(size(a)*size(b))\\n//sizeが1の時は点との距離になる\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2827\\nDD Dist(const vector<Point> &a,const vector<Point> &b){\\n\\tDD ret=INF;\\n\\tif(a.size()==1) return Dist(a[0],b);\\n\\tif(b.size()==1) return Dist(b[0],a);\\n\\n\\tif(contains(a[0],b)>=1) return 0.0L;\\n\\tif(contains(b[0],a)>=1) return 0.0L;\\n\\n\\tfor(int i=0;i<a.size();i++){\\n\\t\\tfor(int j=0;j<b.size();j++){\\n\\t\\t\\tSegment sa(a[i],a[(i+1)%a.size()]);\\n\\t\\t\\tSegment sb(b[j],b[(j+1)%b.size()]);\\n\\t\\t\\tchmin(ret,Dist(sa,sb));\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n////////////////////////////\\n// 最近(遠)点間距離\\n////////////////////////////\\n//部品\\nDD RecClosetPair(const vector<Point>::iterator it,const int n){\\n if(n<=1) return INF;\\n int m=n/2;\\n DD x=it[m].X;\\n DD d=min(RecClosetPair(it,m),RecClosetPair(it+m,n-m));\\n inplace_merge(it,it+m,it+n,yx_sort);\\n vector<Point> v;\\n for(int i=0;i<n;i++){\\n if(abs(it[i].X-x)>=d) continue;\\n for(int j=0;j<v.size();j++){\\n DD dy=it[i].Y-v[(int)v.size()-1-j].Y;\\n if(dy>=d) break;\\n DD dx=it[i].X-v[(int)v.size()-1-j].X;\\n d=min(d,sqrt(dx*dx+dy*dy));\\n }\\n v.push_back(it[i]);\\n }\\n return d;\\n}\\n//最近点対の距離\\n//点が1つのときINFを返す\\n//O(NlogN)\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\nDD ClosetPair(vector<Point> g){\\n sort(g.begin(),g.end(),xy_sort);\\n return RecClosetPair(g.begin(),g.size());\\n}\\n\\n//最遠頂点間\\n//verify:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\nDD Diameter(vector<Point> g){\\n g=ConvexHull(g,1);\\n int gz=g.size();\\n int m=0,M=0;\\n for(int i=1;i<gz;i++){\\n if(g[i].Y<g[m].Y) m=i;\\n if(g[i].Y>g[M].Y) M=i;\\n }\\n DD ret=0;\\n int sm=m,sM=M;\\n while(m!=sM || M!=sm){\\n ret=max(ret,norm(g[m]-g[M]));\\n if(cross(g[(m+1)%gz]-g[m],g[(M+1)%gz]-g[M])<0) m=(m+1)%gz;\\n else M=(M+1)%gz;\\n }\\n return sqrt(ret);\\n}\\n//動的凸包\\n//辺上にある点は含めない\\n//verify:https://atcoder.jp/contests/geocon2013/tasks/geocon2013_c\\nstruct DynamicConvex{\\n\\tset<Point> up,down;\\n\\tDynamicConvex(){}\\n \\n\\tbool isContain(set<Point> &pol,Point p){\\n\\t\\tif(pol.size()==0) return false;\\n\\t\\tif(pol.size()==1){\\n\\t\\t\\tPoint q=*begin(pol);\\n\\t\\t\\treturn EQ(q.X,p.X) and GE(q.Y,p.Y);\\n\\t\\t}\\n\\t\\tassert(pol.size()>=2);\\n auto left=begin(pol);\\n auto right=(--end(pol));\\n if(LS(p.X,left->X) or GR(p.X,right->X)) return false;\\n \\n \\n auto q1=pol.upper_bound(Point(p.X,INF));\\n if(q1==end(pol)){\\n return GE(right->Y,p.Y);\\n }\\n auto q2=q1--; //q1が範囲外になるのは最初に弾いてる\\n return GE(cross(p-*q1,*q2-*q1),0.0);\\n\\t}\\n bool isContain(Point p){\\n if(not isContain(up,p)) return false;\\n if(not isContain(down,Point(p.X,-p.Y))) return false;\\n return true;\\n }\\n \\n\\tvoid add(set<Point> &pol,Point p){\\n\\t\\tif(pol.size()==0){\\n\\t\\t\\tpol.insert(p);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(pol.size()==1){\\n Point q=*begin(pol);\\n\\t\\t\\tif(EQ(q.X,p.X)){\\n pol.clear();\\n pol.insert(max(p,q));\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpol.insert(p);\\n\\t\\t\\t}\\n return;\\n\\t\\t}\\n assert(pol.size()>=2);\\n if(isContain(pol,p)) return;\\n //left\\n auto q1=pol.upper_bound(Point(p.X,INF));\\n if(q1!=begin(pol)){\\n q1--;\\n while(pol.size()>=1 and q1!=begin(pol)){\\n auto q2=q1--;\\n if(GR(cross(*q2-p,*q1-p),0)) break;\\n pol.erase(q2);\\n }\\n }\\n //right\\n q1=pol.lower_bound(Point(p.X,-INF));\\n if(q1!=end(pol)){\\n while(pol.size()>1 and q1!=--end(pol)){\\n auto q2=q1++;\\n if(GR(cross(*q1-p,*q2-p),0.0)) break;\\n pol.erase(q2);\\n }\\n }\\n pol.insert(p);\\n\\t}\\n \\n\\tvoid add(Point p){\\n\\t\\tadd(up,p);\\n\\t\\tadd(down,Point(p.X,-p.Y)); //upと同じように処理をしたいから\\n\\t}\\n};\\n\\n//垂直二等分線\\n//p-↑-q こんなかんじ\\n//voronoiで使う\\nLine bisector(const Point &p, const Point &q) {\\n Point c=(p+q)/DD(2.0);\\n Point v=rotate(q-p,PI/2);\\n v/=abs(v);\\n return Line(c-v,c+v);\\n}\\n\\n//ボロノイ図\\n//pol:全体 ps:点の集合 id:中心となる点の添字 pp:中心となる点\\n//計算量: pol.size()*ps.size()\\n//verify: https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6005648#1\\nvector<Point> voronoi(Polygon pol,const vector<Point> &ps,int id=-1,const Point pp=Point()){\\n Point p;\\n if(id!=-1) p=ps[id];\\n else p=pp;\\n for(size_t i=0;i<ps.size();i++){\\n if(i==id) continue;\\n Line l=bisector(p,ps[i]);\\n pol=ConvexCut(pol,l);\\n }\\n return pol;\\n}\\nint N,W;\\n\\nbool OK(vector<Circle> C,Point p){\\n for(auto c:C){\\n if(LS(abs(p-c.p),c.r)) return false; \\n }\\n\\n return true;\\n}\\n\\nvoid solve(){\\nwhile(true){\\n cin>>N>>W;\\n if(N==0) return;\\n vector<DD> x(N),y(N),H(N);\\n for(int i=0;i<N;i++) cin>>x[i]>>y[i]>>H[i];\\n\\n DD ok=0,ng=1e4;\\n int T=100;\\n while(T--){\\n DD mid=(ok+ng)/2;\\n\\n vector<Point> koho;\\n vector<Circle> C;\\n for(int i=0;i<N;i++){\\n DD r;\\n if(mid>H[i]) r=mid*mid-(mid-H[i])*(mid-H[i]);\\n else r=mid*mid;\\n //if(LE(r,0)) continue;\\n r=sqrtl(r);\\n C.emplace_back(Point(x[i],y[i]),r);\\n }\\n DD w;\\n if(mid>W) w=mid*mid-(mid-W)*(mid-W);\\n else w=mid*mid;\\n w=sqrtl(w);\\n vector<Segment> S;\\n\\n S.emplace_back(Point(w,w),Point(w,100-w));\\n S.emplace_back(Point(w,w),Point(100-w,w));\\n S.emplace_back(Point(100-w,100-w),Point(w,100-w));\\n S.emplace_back(Point(100-w,100-w),Point(100-w,w));\\n for(size_t i=0;i<C.size();i++){\\n for(size_t j=i+1;j<C.size();j++){\\n int s=intersect(C[i],C[j]);\\n if(s==0) continue;\\n auto x=crossPoint(C[i],C[j]);\\n for(auto y:x){\\n koho.push_back(y);\\n }\\n }\\n for(auto s:S){\\n auto v=crossPointSC(s,C[i]);\\n for(auto y:v){\\n koho.push_back(y);\\n }\\n }\\n }\\n koho.emplace_back(w,w);\\n koho.emplace_back(w,100-w);\\n koho.emplace_back(100-w,w);\\n koho.emplace_back(100-w,100-w);\\n\\n bool Ok=false;\\n for(auto y:koho){\\n if(GR(y.X,100-w)) continue;\\n if(GR(y.Y,100-w)) continue;\\n if(LS(y.X,w)) continue;\\n if(LS(y.Y,w)) continue;\\n if(OK(C,y)) Ok=true;\\n }\\n if(Ok) ok=mid;\\n else ng=mid; \\n }\\n cout<<ok<<endl;\\n}\\n}\\n\\nint main(){\\n bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1280,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.904,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1342_5792989\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.08.17 02:01:28 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region geometry\\n\\nusing Real = long double;\\nusing Point = complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\n\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nReal distance(const Line &l, const Point &p);\\n\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = min(c1.r, c2.r), r2 = max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / sqrt(g);\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// bisection of angle A-B-C\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\\nLine bisection_of_angle(const Point &a, const Point &b, const Point &c) {\\n\\tReal da = distance(a, b);\\n\\tReal dc = distance(b, c);\\n\\treturn Line(b, (a * dc + c * da) / (da + dc));\\n}\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\\nCircle incircle_of_triangle(const Point &a, const Point &b, const Point &c) {\\n\\tPoint center = crosspoint(bisection_of_angle(a, b, c), bisection_of_angle(b, c, a));\\n\\treturn Circle(center, distance(Line(a, b), center));\\n}\\nCircle incircle_of_triangle(const Polygon &p) { return incircle_of_triangle(p[0], p[1], p[2]); }\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\\nLine bisection_of_points(const Point &a, const Point &b) {\\n\\tPoint c = (a + b) * 0.5;\\n\\treturn Line(c, c + rotate(PI / 2, b - a));\\n}\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\\nCircle circumscribed_circle_of_triangle(const Point &a, const Point &b, const Point &c) {\\n\\tPoint center = crosspoint(bisection_of_points(a, b), bisection_of_points(b, c));\\n\\treturn Circle(center, distance(a, center));\\n}\\nCircle circumscribed_circle_of_triangle(const Polygon &p) { return circumscribed_circle_of_triangle(p[0], p[1], p[2]); }\\n\\n#pragma endregion\\n\\nusing R = Real;\\nR solve() {\\n\\tint n;\\n\\tcin >> n;\\n\\tif(n == 0) exit(0);\\n\\tR w;\\n\\tcin >> w;\\n\\n\\tPoints needles_place;\\n\\tV<R> needles_height;\\n\\trep(n) {\\n\\t\\tReal x, y, h;\\n\\t\\tcin >> x >> y >> h;\\n\\t\\tneedles_place.emplace_back(x, y);\\n\\t\\tneedles_height.push_back(h);\\n\\t}\\n\\n\\tauto min_dist = [&](R radius, R hieght) -> R {\\n\\t\\tif(radius < hieght) return radius;\\n\\t\\treturn R(sqrt(radius * radius - (radius - hieght) * (radius - hieght)));\\n\\t};\\n\\n\\tLines walls;\\n\\twalls.emplace_back(Point(0, 0), Point(0, 100));\\n\\twalls.emplace_back(Point(100, 100), Point(0, 100));\\n\\twalls.emplace_back(Point(0, 0), Point(100, 0));\\n\\twalls.emplace_back(Point(100, 100), Point(100, 0));\\n\\n\\tLines internal;\\n\\tCircles cs(n);\\n\\n\\tPoints crs;\\n\\n\\tauto safe = [&](const Point ¢er, const R &radius) {\\n\\t\\tif(isnan(center.real())) return false;\\n\\t\\tif(isnan(center.imag())) return false;\\n\\n\\t\\tif(compare(center.real(), 0) == -1 || compare(center.real(), 100) == 1 || compare(center.imag(), 0) == -1 ||\\n\\t\\t compare(center.imag(), 100) == 1) {\\n\\t\\t\\t// if(radius > 1. && radius < 3) debug(center, radius);\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tif(compare(min_dist(radius, needles_height[i]), distance(center, needles_place[i])) == 1) return false;\\n\\t\\t}\\n\\n\\t\\tR min_dist_wall = min_dist(radius, w);\\n\\t\\tfoa(wall, walls) {\\n\\t\\t\\tif(compare(min_dist_wall, distance(wall, center)) == 1) return false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\n\\tauto f = [&](R radius) {\\n\\t\\tinternal.clear();\\n\\t\\tcrs.clear();\\n\\t\\tR min_dist_wall = min_dist(radius, w);\\n\\t\\tinternal.emplace_back(Point(min_dist_wall, 0), Point(min_dist_wall, 100));\\n\\t\\tinternal.emplace_back(Point(100, 100 - min_dist_wall), Point(0, 100 - min_dist_wall));\\n\\t\\tinternal.emplace_back(Point(0, min_dist_wall), Point(100, min_dist_wall));\\n\\t\\tinternal.emplace_back(Point(100 - min_dist_wall, 100), Point(100 - min_dist_wall, 0));\\n\\n\\t\\trep(i, n) { cs[i] = Circle(needles_place[i], min_dist(radius, needles_height[i])); }\\n\\n\\t\\tfoa(ln, internal) {\\n\\t\\t\\tfoa(ln2, internal) {\\n\\t\\t\\t\\tif(intersect(ln, ln2)) crs.push_back(crosspoint(ln, ln2));\\n\\t\\t\\t}\\n\\n\\t\\t\\tfoa(c, cs) {\\n\\t\\t\\t\\tif(intersect(c, ln)) {\\n\\t\\t\\t\\t\\tauto ps = crosspoint(c, ln);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.first);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfoa(c, cs) {\\n\\t\\t\\tfoa(d, cs) {\\n\\t\\t\\t\\tif(intersect(c, d) > 0) {\\n\\t\\t\\t\\t\\tauto ps = crosspoint(c, d);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.first);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfoa(pt, crs) {\\n\\t\\t\\tif(isnan(pt.real())) continue;\\n\\t\\t\\tif(safe(pt, radius)) {\\n\\t\\t\\t\\tif(radius > 10000000000000.) debug(pt, radius);\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\tR ok = 0.;\\n\\tR ng = 130;\\n\\trep(30) {\\n\\t\\tR med = (ok + ng) / 2;\\n\\t\\tif(f(med)) {\\n\\t\\t\\tok = med;\\n\\t\\t} else {\\n\\t\\t\\tng = med;\\n\\t\\t}\\n\\t}\\n\\treturn ok;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\twhile(1) cout << solve() << dl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.8739,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1342_5792986\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.08.17 02:01:28 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region macros\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define popcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\n#pragma endregion\\n\\n#pragma region aliases\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nconst int inf = 1e9;\\nconst long long INF = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\nconst int mod_1000000007 = 1000000007;\\nconst int mod_998244353 = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_operation\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { std::cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { std::cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag = true) {\\n\\tif(!flag) return;\\n\\tstd::cout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\treturn (a + b - 1) / b;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(std::vector<T> &a) {\\n\\tauto vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\nnamespace viewer {\\nvoid view(const long long e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << '{';\\n\\tfor(const auto &t : v) {\\n\\t\\tstd::cerr << \\\"\\\\n\\\\t\\\";\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\",\\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\n}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n} // namespace viewer\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tviewer::view(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region geometry\\n\\nusing Real = long double;\\nusing Point = complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\n\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\nReal distance(const Line &l, const Point &p);\\n\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = min(c1.r, c2.r), r2 = max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / sqrt(g);\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// bisection of angle A-B-C\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\\nLine bisection_of_angle(const Point &a, const Point &b, const Point &c) {\\n\\tReal da = distance(a, b);\\n\\tReal dc = distance(b, c);\\n\\treturn Line(b, (a * dc + c * da) / (da + dc));\\n}\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_B/judge/5763316/C++17\\nCircle incircle_of_triangle(const Point &a, const Point &b, const Point &c) {\\n\\tPoint center = crosspoint(bisection_of_angle(a, b, c), bisection_of_angle(b, c, a));\\n\\treturn Circle(center, distance(Line(a, b), center));\\n}\\nCircle incircle_of_triangle(const Polygon &p) { return incircle_of_triangle(p[0], p[1], p[2]); }\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\\nLine bisection_of_points(const Point &a, const Point &b) {\\n\\tPoint c = (a + b) * 0.5;\\n\\treturn Line(c, c + rotate(PI / 2, b - a));\\n}\\n\\n// https://onlinejudge.u-aizu.ac.jp/status/users/Kite_kuma/submissions/1/CGL_7_C/judge/5763330/C++17\\nCircle circumscribed_circle_of_triangle(const Point &a, const Point &b, const Point &c) {\\n\\tPoint center = crosspoint(bisection_of_points(a, b), bisection_of_points(b, c));\\n\\treturn Circle(center, distance(a, center));\\n}\\nCircle circumscribed_circle_of_triangle(const Polygon &p) { return circumscribed_circle_of_triangle(p[0], p[1], p[2]); }\\n\\n#pragma endregion\\n\\nusing R = Real;\\nR solve() {\\n\\tint n;\\n\\tcin >> n;\\n\\tif(n == 0) exit(0);\\n\\tR w;\\n\\tcin >> w;\\n\\n\\tPoints needles_place;\\n\\tV<R> needles_height;\\n\\trep(n) {\\n\\t\\tReal x, y, h;\\n\\t\\tcin >> x >> y >> h;\\n\\t\\tneedles_place.emplace_back(x, y);\\n\\t\\tneedles_height.push_back(h);\\n\\t}\\n\\n\\tauto min_dist = [&](R radius, R hieght) -> R {\\n\\t\\tif(radius < hieght) return radius;\\n\\t\\treturn R(sqrt(radius * radius - (radius - hieght) * (radius - hieght)));\\n\\t};\\n\\n\\tLines walls;\\n\\twalls.emplace_back(Point(0, 0), Point(0, 100));\\n\\twalls.emplace_back(Point(100, 100), Point(0, 100));\\n\\twalls.emplace_back(Point(0, 0), Point(100, 0));\\n\\twalls.emplace_back(Point(100, 100), Point(100, 0));\\n\\n\\tLines internal;\\n\\tCircles cs(n);\\n\\n\\tPoints crs;\\n\\n\\tauto safe = [&](const Point ¢er, const R &radius) {\\n\\t\\tif(isnan(center.real())) return false;\\n\\t\\tif(isnan(center.imag())) return false;\\n\\n\\t\\tif(compare(center.real(), 0) == -1 || compare(center.real(), 100) == 1 || compare(center.imag(), 0) == -1 ||\\n\\t\\t compare(center.imag(), 100) == 1) {\\n\\t\\t\\t// if(radius > 1. && radius < 3) debug(center, radius);\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tif(compare(min_dist(radius, needles_height[i]), distance(center, needles_place[i])) == 1) return false;\\n\\t\\t}\\n\\n\\t\\tR min_dist_wall = min_dist(radius, w);\\n\\t\\tfoa(wall, walls) {\\n\\t\\t\\tif(compare(min_dist_wall, distance(wall, center)) == 1) return false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\n\\tauto f = [&](R radius) {\\n\\t\\tinternal.clear();\\n\\t\\tcrs.clear();\\n\\t\\tR min_dist_wall = min_dist(radius, w);\\n\\t\\tinternal.emplace_back(Point(min_dist_wall, 0), Point(min_dist_wall, 100));\\n\\t\\tinternal.emplace_back(Point(100, 100 - min_dist_wall), Point(0, 100 - min_dist_wall));\\n\\t\\tinternal.emplace_back(Point(0, min_dist_wall), Point(100, min_dist_wall));\\n\\t\\tinternal.emplace_back(Point(100 - min_dist_wall, 100), Point(100 - min_dist_wall, 0));\\n\\n\\t\\trep(i, n) { cs[i] = Circle(needles_place[i], min_dist(radius, needles_height[i])); }\\n\\n\\t\\tfoa(ln, internal) {\\n\\t\\t\\tfoa(ln2, internal) {\\n\\t\\t\\t\\tif(intersect(ln, ln2)) crs.push_back(crosspoint(ln, ln2));\\n\\t\\t\\t}\\n\\n\\t\\t\\tfoa(c, cs) {\\n\\t\\t\\t\\tif(intersect(c, ln)) {\\n\\t\\t\\t\\t\\tauto ps = crosspoint(c, ln);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.first);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfoa(c, cs) {\\n\\t\\t\\tfoa(d, cs) {\\n\\t\\t\\t\\tif(intersect(c, d) > 0) {\\n\\t\\t\\t\\t\\tauto ps = crosspoint(c, d);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.first);\\n\\t\\t\\t\\t\\tcrs.push_back(ps.second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfoa(pt, crs) {\\n\\t\\t\\tif(isnan(pt.real())) continue;\\n\\t\\t\\t// if(radius < 1.) debug(radius, pt);\\n\\t\\t\\tif(safe(pt, radius)) {\\n\\t\\t\\t\\tif(radius > 10000000000000.) debug(pt, radius);\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t};\\n\\n\\tR ok = 0.;\\n\\tR ng = inf;\\n\\trep(200) {\\n\\t\\tR med = (ok + ng) / 2;\\n\\t\\tif(f(med)) {\\n\\t\\t\\tok = med;\\n\\t\\t} else {\\n\\t\\t\\tng = med;\\n\\t\\t}\\n\\t}\\n\\treturn ok;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n\\tstd::cout << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\twhile(1) cout << solve() << dl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5080,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -1.4846,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1342_5332100\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 0.0000001;\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator +(point P){\\n return point(x + P.x, y + P.y);\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n point operator *(double k){\\n return point(x * k, y * k);\\n }\\n point operator /(double k){\\n return point(x / k, y / k);\\n }\\n};\\npoint rotate90(point P){\\n return point(P.y, -P.x);\\n}\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dist(point P, point Q){\\n return abs(Q - P);\\n}\\ndouble dot(point P, point Q){\\n return P.x * Q.x + P.y * Q.y;\\n}\\ndouble cross(point P, point Q){\\n return P.x * Q.y - P.y * Q.x;\\n}\\nstruct line{\\n point A, B;\\n line(){\\n }\\n line(point A, point B): A(A), B(B){\\n }\\n};\\npoint vec(line L){\\n return L.B - L.A;\\n}\\ndouble point_line_distance(point P, line L){\\n return abs(cross(P - L.A, vec(L))) / abs(vec(L));\\n}\\npoint projection(point P, line L){\\n return L.A + vec(L) / abs(vec(L)) * dot(P - L.A, vec(L)) / abs(vec(L));\\n}\\nstruct circle{\\n point C;\\n double r;\\n circle(){\\n }\\n circle(point C, double r): C(C), r(r){\\n }\\n};\\nbool point_in_circle(point P, circle C){\\n return dist(P, C.C) < C.r - EPS;\\n}\\nbool line_circle_intersects(line L, circle C){\\n return point_line_distance(C.C, L) < C.r - EPS;\\n}\\npair<point, point> line_circle_intersection(line L, circle C){\\n point P = projection(C.C, L);\\n double d = point_line_distance(C.C, L);\\n double h = sqrt(C.r * C.r - d * d);\\n point A = P + vec(L) / abs(vec(L)) * h;\\n point B = P - vec(L) / abs(vec(L)) * h;\\n return make_pair(A, B);\\n}\\nbool circle_intersects(circle C1, circle C2){\\n double d = dist(C1.C, C2.C);\\n return abs(C1.r - C2.r) + EPS < d && d < C1.r + C2.r - EPS;\\n}\\npair<point, point> circle_intersection(circle C1, circle C2){\\n double d = dist(C1.C, C2.C);\\n double d2 = (C1.r * C1.r + d * d - C2.r * C2.r) / (2 * d);\\n point M = C1.C + (C2.C - C1.C) / d * d2;\\n double h = sqrt(C1.r * C1.r - d2 * d2);\\n point D = rotate90(C2.C - C1.C);\\n point A = M + D / abs(D) * h;\\n point B = M - D / abs(D) * h;\\n return make_pair(A, B);\\n}\\nint main(){\\n while (true){\\n int n;\\n double w;\\n cin >> n >> w;\\n if (n == 0 && w == 0){\\n break;\\n }\\n vector<point> P(n);\\n vector<double> h(n);\\n for (int i = 0; i < n; i++){\\n cin >> P[i].x >> P[i].y >> h[i];\\n }\\n double tv = 0, fv = 10000;\\n for (int i = 0; i < 50; i++){\\n double r = (tv + fv) / 2;\\n double t;\\n if (r < w){\\n t = r;\\n } else {\\n t = sqrt(r * r - (r - w) * (r - w));\\n }\\n if (t > 50){\\n fv = r;\\n } else {\\n vector<line> L(4);\\n L[0] = line(point(t, t), point(t, 100 - t));\\n L[1] = line(point(100 - t, t), point(100 - t, 100 - t));\\n L[2] = line(point(t, t), point(100 - t, t));\\n L[3] = line(point(t, 100 - t), point(100 - t, 100 - t));\\n vector<circle> C(n);\\n for (int j = 0; j < n; j++){\\n if (r < h[j]){\\n C[j] = circle(P[j], r);\\n } else {\\n C[j] = circle(P[j], sqrt(r * r - (r - h[j]) * (r - h[j])));\\n }\\n }\\n vector<point> Q;\\n Q.push_back(point(t, t));\\n Q.push_back(point(t, 100 - t));\\n Q.push_back(point(100 - t, t));\\n Q.push_back(point(100 - t, 100 - t));\\n for (int j = 0; j < n; j++){\\n for (int k = 0; k < 4; k++){\\n if (line_circle_intersects(L[k], C[j])){\\n pair<point, point> I = line_circle_intersection(L[k], C[j]);\\n Q.push_back(I.first);\\n Q.push_back(I.second);\\n }\\n }\\n for (int k = j + 1; k < n; k++){\\n if (circle_intersects(C[j], C[k])){\\n pair<point, point> I = circle_intersection(C[j], C[k]);\\n Q.push_back(I.first);\\n Q.push_back(I.second);\\n }\\n }\\n }\\n int cnt = Q.size();\\n bool ok = false;\\n for (int j = 0; j < cnt; j++){\\n bool ok2 = true;\\n if (Q[j].x < t - EPS || Q[j].x > 100 - t + EPS || Q[j].y < t - EPS || Q[j].y > 100 - t + EPS){\\n ok2 = false;\\n }\\n for (int k = 0; k < n; k++){\\n if (point_in_circle(Q[j], C[k])){\\n ok2 = false;\\n }\\n }\\n if (ok2){\\n ok = true;\\n }\\n }\\n if (ok){\\n tv = r;\\n } else {\\n fv = r;\\n }\\n }\\n }\\n cout << tv << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3252,\n \"score_of_the_acc\": -0.0181,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1342_5237482\",\n \"code_snippet\": \"#include \\\"iostream\\\"\\n#include \\\"climits\\\"\\n#include \\\"list\\\"\\n#include \\\"queue\\\"\\n#include \\\"stack\\\"\\n#include \\\"set\\\"\\n#include \\\"functional\\\"\\n#include \\\"algorithm\\\"\\n#include \\\"string\\\"\\n#include \\\"map\\\"\\n#include \\\"unordered_map\\\"\\n#include \\\"unordered_set\\\"\\n#include \\\"iomanip\\\"\\n#include \\\"cmath\\\"\\n#include \\\"random\\\"\\n#include \\\"bitset\\\"\\n#include \\\"cstdio\\\"\\n#include \\\"numeric\\\"\\n#include \\\"cassert\\\"\\n#include \\\"ctime\\\"\\n\\nusing namespace std;\\n\\n//constexpr long long int MOD = 1000000007;\\n//constexpr int MOD = 1000000007;\\n//constexpr int MOD = 998244353;\\nconstexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-8;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nstruct Needle {\\n\\tlong double x, y, z;\\n\\tNeedle() {\\n\\t\\tcin >> x >> y >> z;\\n\\t}\\n\\tNeedle(long double xx, long double yy, long double zz) :x(xx), y(yy), z(zz) {\\n\\n\\t}\\n};\\n\\nstruct Point {\\n\\tlong double x, y, z;\\n\\tPoint(long double xx, long double yy, long double zz) :x(xx), y(yy), z(zz) {\\n\\n\\t}\\n};\\n\\nlong double Dist(Needle n, Point p) {\\n\\tn.z = min(n.z, p.z);\\n\\t//cout << hypot(hypot(n.x - p.x, n.y - p.y), n.z - p.z) << endl;\\n\\treturn hypot(hypot(n.x - p.x, n.y - p.y), n.z - p.z);\\n}\\n\\nvector<Point>CircleCross(Needle a,long double ar,Needle b, long double br) {\\n\\tvector<Point>ret;\\n\\tPoint dp(b.x - a.x, b.y - a.y, a.z);\\n\\tauto dis = hypot(a.x - b.x, a.y - b.y);\\n\\tif (ar + br < dis)return ret;\\n\\tif (abs(ar - br) >= dis)return ret;\\n\\tif (abs(ar + br - dis) <= EPS) {\\n\\t\\tret.push_back(Point(a.x + b.x * (ar / (ar + br)), a.y + b.y * (ar / (ar + br)), a.z));\\n\\t\\treturn ret;\\n\\t}\\n\\tif (abs(abs(ar - br) - dis) <= EPS) {\\n\\t\\tret.push_back(Point(a.x + b.x * (ar / (ar - br)), a.y + b.y * (ar / (ar - br)), a.z));\\n\\t\\treturn ret;\\n\\t}\\n\\tlong double ad;\\n\\tif (dis < 1) {\\n\\t\\tcout << dis << endl;\\n\\t}\\n\\tad = (ar*ar - br*br + dis * dis) / 2 / dis;\\n\\tPoint cp(a.x + dp.x*(ad / dis), a.y + dp.y*(ad / dis), a.z);\\n\\tif (abs(ar) < abs(ad)) {\\n\\t\\tcout << ar << \\\" \\\" << br << \\\" \\\" << dis << endl;\\n\\t\\tcout << ar << \\\" \\\" << ad << endl;\\n\\t}\\n\\tlong double amari = sqrt(ar*ar - ad * ad);\\n\\tret.push_back(Point(cp.x - dp.y*amari / dis, cp.y + dp.x*amari / dis, cp.z));\\n\\tret.push_back(Point(cp.x + dp.y*amari / dis, cp.y - dp.x*amari / dis, cp.z));\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N >> H, N) {\\n\\t\\tvector<Needle>n(N);\\n\\t\\tlong double mx = (H*H + (long double)2500) / (2 * H);\\n\\t\\tif (H >= 50) {\\n\\t\\t\\tmx = 50;\\n\\t\\t}\\n\\t\\tlong double l = 0, r = mx;\\n\\t\\tfor (int loop = 0; loop < 50; loop++) {\\n\\t\\t\\tlong double mid = (l + r) / 2;\\n\\t\\t\\tvector<Point>p;\\n\\t\\t\\t{\\n\\t\\t\\t\\tlong double d = 0;\\n\\t\\t\\t\\tif (mid <= H) {\\n\\t\\t\\t\\t\\td = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\td = sqrt(mid*H * 2 - H * H);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp.push_back(Point(d, d, mid));\\n\\t\\t\\t\\tp.push_back(Point(100 - d, d, mid));\\n\\t\\t\\t\\tp.push_back(Point(d, 100 - d, mid));\\n\\t\\t\\t\\tp.push_back(Point(100 - d, 100 - d, mid));\\n\\t\\t\\t\\tfor (auto i : n) {\\n\\t\\t\\t\\t\\tlong double r = 0;\\n\\t\\t\\t\\t\\tif (mid <= i.z) {\\n\\t\\t\\t\\t\\t\\tr = mid;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tr = sqrt(mid*i.z * 2 - i.z*i.z);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t//\\t\\tcout << mid << \\\" \\\" << d << \\\" \\\" << r << endl;\\n\\t\\t\\t\\t\\tif (i.x + r > d && i.x - r < d) {\\n\\t\\t\\t\\t\\t\\tif (abs(r) < abs(i.x - d)) {\\n\\t\\t\\t\\t\\t\\t\\tcout << \\\"aaaaaaaaaaaaaaaaaaaaaaaa\\\" << endl;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tlong double dif = sqrt(r*r - (i.x - d)*(i.x - d));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(d, i.y - dif, mid));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(d, i.y + dif, mid));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (i.x + r > 100 - d && i.x - r < 100 - d) {\\n\\t\\t\\t\\t\\t\\tif (abs(r) < abs(i.x - (100 - d))) {\\n\\t\\t\\t\\t\\t\\t\\tcout << \\\"aaaaaaaaaaaaaaaaaaaaaaaa\\\" << endl;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tlong double dif = sqrt(r*r - (i.x - (100 - d))*(i.x - (100 - d)));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(100 - d, i.y - dif, mid));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(100 - d, i.y + dif, mid));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (i.y + r > d && i.y - r < d) {\\n\\t\\t\\t\\t\\t\\tif (abs(r) < abs(i.y-d)) {\\n\\t\\t\\t\\t\\t\\t\\tcout << \\\"aaaaaaaaaaaaaaaaaaaaaaaa\\\" << endl;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tlong double dif = sqrt(r*r - (i.y - d)*(i.y - d));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(i.x - dif, d, mid));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(i.x + dif, d, mid));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (i.y + r > 100 - d && i.y - r < 100 - d) {\\n\\t\\t\\t\\t\\t\\tif (abs(r) < abs(i.y - (100 - d))) {\\n\\t\\t\\t\\t\\t\\t\\tcout << \\\"aaaaaaaaaaaaaaaaaaaaaaaa\\\" << endl;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tlong double dif = sqrt(r*r - (i.y - (100 - d))*(i.y - (100 - d)));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(i.x - dif, 100 - d, mid));\\n\\t\\t\\t\\t\\t\\tp.push_back(Point(i.x + dif, 100 - d, mid));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\t\\tfor (int j = i + 1; j < N; j++) {\\n\\t\\t\\t\\t\\t\\tauto box = CircleCross(n[i], sqrt(mid*mid - max((long double)0, (mid - n[i].z))*max((long double)0,(mid - n[i].z))), n[j], sqrt(mid*mid - max((long double)0, (mid - n[j].z))*max((long double)0, (mid - n[j].z))));\\n\\t\\t\\t\\t\\t\\tfor (auto k : box) {\\n\\t\\t\\t\\t\\t\\t\\tk.z = mid;\\n\\t\\t\\t\\t\\t\\t\\tp.push_back(k);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tlong double flag = 0;\\n\\t\\t\\tfor (auto i : p) {\\n\\t\\t\\t//\\tcout << i.x << \\\" \\\" << i.y << \\\" \\\" << i.z << \\\" \\\" << mid << endl;\\n\\t\\t\\t\\tif (i.x < 0 || i.y < 0 || i.x >= 100 || i.y >= 100)continue;\\n\\t\\t\\t\\tlong double dis = 20000;\\n\\t\\t\\t\\tn.push_back(Needle(i.x, 0, H));\\n\\t\\t\\t\\tn.push_back(Needle(i.x, 100, H));\\n\\t\\t\\t\\tn.push_back(Needle(0, i.y, H));\\n\\t\\t\\t\\tn.push_back(Needle(100, i.y, H));\\n\\t\\t\\t\\tfor (auto j : n) {\\n\\t\\t\\t\\t\\tdis = min(dis, Dist(j, i));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tn.pop_back();\\n\\t\\t\\t\\tn.pop_back();\\n\\t\\t\\t\\tn.pop_back();\\n\\t\\t\\t\\tn.pop_back();\\n\\t\\t\\t\\tflag = max(flag, dis);\\n\\t\\t\\t\\t//cout << dis << \\\" \\\" << mid << endl;\\n\\t\\t\\t\\t//if (dis >= mid - EPS) {\\n\\t\\t\\t\\t//\\tcout << i.x << \\\" \\\" << i.y << \\\" \\\" << i.z << endl;\\n\\t\\t\\t\\t//}\\n\\t\\t\\t}\\n\\t\\t//\\tcout << flag << \\\" \\\" << mid << endl;\\n\\t\\t\\tif (flag>=mid-EPS) {\\n\\t\\t\\t\\tl = mid;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tr = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << fixed << setprecision(20) << r << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.4115,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1342_5179238\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n//#ifndef ONLINE_JUDGE \\n//#define _GLIBCXX_DEBUG\\n//#endif\\n#ifdef ONLINE_JUDGE \\n#include <atcoder/all>\\n#endif\\n#include <bits/stdc++.h>\\n#include <chrono>\\n#include <random>\\n#include <math.h>\\n#include <complex>\\n \\n \\nusing namespace std;\\n#ifdef ONLINE_JUDGE \\nusing namespace atcoder;\\n#endif\\n#define rep(i,n) for (int i = 0;i < (int)(n);i++)\\nusing ll = long long;\\n#ifdef ONLINE_JUDGE \\n//using mint = modint998244353;\\n//using mint = modint;\\nusing mint = modint1000000007;\\n#endif\\nconst ll MOD=1000000007;\\n//const ll MOD=998244353;\\nconst long long INF = 1LL << 60;\\nconst double pi=acos(-1.0);\\nint dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};\\nint dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};\\n \\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\n \\nusing Real = long double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2;\\t // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 4;\\t // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2;\\t // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定 (反時計回り)\\nbool is_convex(const Polygon &p) {\\n\\tint n = (int)p.size();\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n\\tint n = (int)p.size(), k = 0;\\n\\tif(n <= 2) return p;\\n\\tsort(p.begin(), p.end()); // x -> yの順にソート\\n\\tvector<Point> ch(2 * n);\\n\\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\\n\\t\\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\\n\\t\\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n\\tbool in = false;\\n\\tfor(int i = 0; i < Q.size(); i++) {\\n\\t\\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n\\t\\tif(a.imag() > b.imag()) swap(a, b);\\n\\t\\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n\\t\\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分の重複除去\\nvoid merge_segments(vector<Segment> &segs) {\\n\\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\\n\\t\\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n\\t\\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n\\t\\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n\\t\\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n\\t}\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tfor(int j = i + 1; j < segs.size(); j++) {\\n\\t\\t\\tif(merge_if_able(segs[i], segs[j])) {\\n\\t\\t\\t\\tsegs[j--] = segs.back(), segs.pop_back();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\\n\\tvector<vector<int>> g;\\n\\tint N = (int)segs.size();\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tps.emplace_back(segs[i].a);\\n\\t\\tps.emplace_back(segs[i].b);\\n\\t\\tfor(int j = i + 1; j < N; j++) {\\n\\t\\t\\tconst Point p1 = segs[i].b - segs[i].a;\\n\\t\\t\\tconst Point p2 = segs[j].b - segs[j].a;\\n\\t\\t\\tif(eq(cross(p1, p2), 0)) continue;\\t// \\\" == 0\\\" となっていたのを訂正\\n\\t\\t\\tif(intersect(segs[i], segs[j])) {\\n\\t\\t\\t\\tps.emplace_back(crosspoint(segs[i], segs[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(begin(ps), end(ps));\\n\\tps.erase(unique(begin(ps), end(ps)), end(ps));\\t// これ誤差とか大丈夫なのか？\\n\\n\\tint M = (int)ps.size();\\n\\tg.resize(M);\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tvector<int> vec;\\n\\t\\tfor(int j = 0; j < M; j++) {\\n\\t\\t\\tif(intersect(segs[i], ps[j])) {\\n\\t\\t\\t\\tvec.emplace_back(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j = 1; j < vec.size(); j++) {\\n\\t\\t\\tg[vec[j - 1]].push_back(vec[j]);\\n\\t\\t\\tg[vec[j]].push_back(vec[j - 1]);\\n\\t\\t}\\n\\t}\\n\\treturn (g);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\nPolygon convex_cut(const Polygon &U, Line l) {\\n\\tPolygon ret;\\n\\tfor(int i = 0; i < U.size(); i++) {\\n\\t\\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\\n\\t\\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n\\t\\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n\\t\\t\\tret.push_back(crosspoint(Line(now, nxt), l));\\n\\t\\t}\\n\\t}\\n\\treturn (ret);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\n// 多角形の面積\\nReal area(const Polygon &p) {\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); ++i) {\\n\\t\\tA += cross(p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\t // 0.5倍してなくない？\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\t // 0.5倍が抜けていたので修正;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// 二等分線\\nLine bisection(Point a, Point b) {\\n\\ta = (a + b) * 0.5;\\n\\tb = rotate(PI / 2, b - a) + a;\\n\\treturn Line(a, b);\\n}\\n\\n \\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n \\n while(1) {\\n ll N,W; cin>>N>>W; if(!N&&!W) break;\\n \\n Points P(N);\\n vector<Real> H(N);\\n rep(i,N) cin>>P[i]>>H[i];\\n \\n vector<Real> R(N);\\n Real l,r,u,d;\\n \\n auto judge=[&](Real sphere){\\n rep(i,N) {\\n if(H[i]>sphere) R[i]=sphere;\\n else R[i]=sqrt(pow(sphere,2)-pow(sphere-H[i],2));\\n }\\n auto hasi=(sphere>W?sqrt(pow(sphere,2)-pow(sphere-W,2)):sphere);\\n l=hasi,r=100.0-hasi,u=hasi,d=100.0-hasi;\\n \\n auto safe=[&](Real x,Real y) {\\n if(x<l-EPS||x>r+EPS||y<u-EPS||y>d+EPS) return false;\\n rep(i,N) {\\n if(distance(P[i],Point(x,y))<R[i]-EPS) return false;\\n }\\n return true;\\n };\\n \\n auto safepoint=[&](Point p) {return safe(p.real(),p.imag());};\\n \\n if(safe(l,u)||safe(l,d)||safe(r,u)||safe(r,d)) return true;\\n \\n rep(i,N) for(int j=i+1;j<N;j++) {\\n int num=intersect(Circle(P[i],R[i]),Circle(P[j],R[j]));\\n if(num==0||num==4) continue;\\n auto [p1,p2]=crosspoint(Circle(P[i],R[i]),Circle(P[j],R[j]));\\n if(safepoint(p1)||safepoint(p2)) return true;\\n }\\n \\n Points points(4);\\n points[0]=Point(l,u);\\n points[1]=Point(l,d);\\n points[2]=Point(r,u);\\n points[3]=Point(r,d);\\n \\n Lines lines(4);\\n lines[0]=Line(points[0],points[1]);\\n lines[1]=Line(points[1],points[2]);\\n lines[2]=Line(points[2],points[3]);\\n lines[3]=Line(points[3],points[0]);\\n \\n rep(i,N) rep(j,4) {\\n if(!intersect(Circle(P[i],R[i]),lines[j])) continue;\\n auto [p1,p2]=crosspoint(Circle(P[i],R[i]),lines[j]);\\n if(safepoint(p1)||safepoint(p2)) return true;\\n }\\n \\n return false;\\n };\\n \\n Real ok=0.0;\\n Real ng=10000.0;\\n rep(_,100) {\\n Real mid=(ok+ng)/2;\\n (judge(mid)?ok:ng)=mid;\\n }\\n \\n cout<<ok<<'\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.4004,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1342_5033646\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region geometry\\n\\nusing Real = long double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2;\\t // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 4;\\t // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2;\\t // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定 (反時計回り)\\nbool is_convex(const Polygon &p) {\\n\\tint n = (int)p.size();\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n\\tint n = (int)p.size(), k = 0;\\n\\tif(n <= 2) return p;\\n\\tsort(p.begin(), p.end()); // x -> yの順にソート\\n\\tvector<Point> ch(2 * n);\\n\\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\\n\\t\\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\\n\\t\\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n\\tbool in = false;\\n\\tfor(int i = 0; i < Q.size(); i++) {\\n\\t\\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n\\t\\tif(a.imag() > b.imag()) swap(a, b);\\n\\t\\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n\\t\\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分の重複除去\\nvoid merge_segments(vector<Segment> &segs) {\\n\\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\\n\\t\\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n\\t\\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n\\t\\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n\\t\\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n\\t}\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tfor(int j = i + 1; j < segs.size(); j++) {\\n\\t\\t\\tif(merge_if_able(segs[i], segs[j])) {\\n\\t\\t\\t\\tsegs[j--] = segs.back(), segs.pop_back();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\\n\\tvector<vector<int>> g;\\n\\tint N = (int)segs.size();\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tps.emplace_back(segs[i].a);\\n\\t\\tps.emplace_back(segs[i].b);\\n\\t\\tfor(int j = i + 1; j < N; j++) {\\n\\t\\t\\tconst Point p1 = segs[i].b - segs[i].a;\\n\\t\\t\\tconst Point p2 = segs[j].b - segs[j].a;\\n\\t\\t\\tif(eq(cross(p1, p2), 0)) continue;\\t// \\\" == 0\\\" となっていたのを訂正\\n\\t\\t\\tif(intersect(segs[i], segs[j])) {\\n\\t\\t\\t\\tps.emplace_back(crosspoint(segs[i], segs[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(begin(ps), end(ps));\\n\\tps.erase(unique(begin(ps), end(ps)), end(ps));\\t// これ誤差とか大丈夫なのか？\\n\\n\\tint M = (int)ps.size();\\n\\tg.resize(M);\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tvector<int> vec;\\n\\t\\tfor(int j = 0; j < M; j++) {\\n\\t\\t\\tif(intersect(segs[i], ps[j])) {\\n\\t\\t\\t\\tvec.emplace_back(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j = 1; j < vec.size(); j++) {\\n\\t\\t\\tg[vec[j - 1]].push_back(vec[j]);\\n\\t\\t\\tg[vec[j]].push_back(vec[j - 1]);\\n\\t\\t}\\n\\t}\\n\\treturn (g);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\nPolygon convex_cut(const Polygon &U, Line l) {\\n\\tPolygon ret;\\n\\tfor(int i = 0; i < U.size(); i++) {\\n\\t\\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\\n\\t\\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n\\t\\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n\\t\\t\\tret.push_back(crosspoint(Line(now, nxt), l));\\n\\t\\t}\\n\\t}\\n\\treturn (ret);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\n// 多角形の面積\\nReal area(const Polygon &p) {\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); ++i) {\\n\\t\\tA += cross(p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\t // 0.5倍してなくない？\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\t // 0.5倍が抜けていたので修正;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// 二等分線\\nLine bisection(Point a, Point b) {\\n\\ta = (a + b) * 0.5;\\n\\tb = rotate(PI / 2, b - a) + a;\\n\\treturn Line(a, b);\\n}\\n\\n#pragma endregion\\n\\nvoid sol() {\\n\\tint n, w;\\n\\tcin >> n >> w;\\n\\tif(n + w == 0) exit(0);\\n\\n\\tPoints p(n);\\n\\tvector<Real> h(n);\\n\\tfor(int i = 0; i < n; i++) cin >> p[i] >> h[i];\\n\\n\\tvector<Real> r(n);\\n\\tReal lef, dn, up, rig;\\n\\tconst Real sz = 100.0;\\n\\n\\tauto judge = [&](Real sphere) {\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tif(h[i] > sphere) {\\n\\t\\t\\t\\tr[i] = sphere;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tReal margin = sphere;\\n\\t\\tif(sphere > w) {\\n\\t\\t\\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\\n\\t\\t}\\n\\n\\t\\tlef = margin;\\n\\t\\trig = 100 - margin;\\n\\t\\tup = 100 - margin;\\n\\t\\tdn = margin;\\n\\n\\t\\tauto safe = [&](Real x, Real y) {\\n\\t\\t\\tif(x < lef - EPS || x > rig + EPS) return false;\\n\\t\\t\\tif(y < dn - EPS || y > up + EPS) return false;\\n\\n\\t\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\n\\t\\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\\n\\n\\t\\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\tPoints square(4);\\n\\t\\tsquare[0] = Point(lef, up);\\n\\t\\tsquare[1] = Point(lef, dn);\\n\\t\\tsquare[2] = Point(rig, dn);\\n\\t\\tsquare[3] = Point(rig, up);\\n\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\t\\tif(is == 4 || is == 0) continue;\\n\\n\\t\\t\\t\\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < 4; j++) {\\n\\t\\t\\t\\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\\n\\t\\t\\t\\t\\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\\n\\t\\t\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tReal ok = 0.0;\\n\\tReal ng = 10000000000;\\n\\twhile(ng - ok > 0.00005) {\\n\\t\\tReal med = (ok + ng) / 2;\\n\\t\\tif(judge(med)) {\\n\\t\\t\\tok = med;\\n\\t\\t} else {\\n\\t\\t\\tng = med;\\n\\t\\t}\\n\\t}\\n\\tcout << ok << '\\\\n';\\n\\treturn;\\n}\\n\\nint main() {\\n\\twhile(1) sol();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3824,\n \"score_of_the_acc\": -0.6849,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1342_5033645\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region geometry\\n\\nusing Real = long double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2;\\t // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 4;\\t // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2;\\t // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定 (反時計回り)\\nbool is_convex(const Polygon &p) {\\n\\tint n = (int)p.size();\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n\\tint n = (int)p.size(), k = 0;\\n\\tif(n <= 2) return p;\\n\\tsort(p.begin(), p.end()); // x -> yの順にソート\\n\\tvector<Point> ch(2 * n);\\n\\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\\n\\t\\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\\n\\t\\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n\\tbool in = false;\\n\\tfor(int i = 0; i < Q.size(); i++) {\\n\\t\\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n\\t\\tif(a.imag() > b.imag()) swap(a, b);\\n\\t\\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n\\t\\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分の重複除去\\nvoid merge_segments(vector<Segment> &segs) {\\n\\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\\n\\t\\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n\\t\\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n\\t\\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n\\t\\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n\\t}\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tfor(int j = i + 1; j < segs.size(); j++) {\\n\\t\\t\\tif(merge_if_able(segs[i], segs[j])) {\\n\\t\\t\\t\\tsegs[j--] = segs.back(), segs.pop_back();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\\n\\tvector<vector<int>> g;\\n\\tint N = (int)segs.size();\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tps.emplace_back(segs[i].a);\\n\\t\\tps.emplace_back(segs[i].b);\\n\\t\\tfor(int j = i + 1; j < N; j++) {\\n\\t\\t\\tconst Point p1 = segs[i].b - segs[i].a;\\n\\t\\t\\tconst Point p2 = segs[j].b - segs[j].a;\\n\\t\\t\\tif(eq(cross(p1, p2), 0)) continue;\\t// \\\" == 0\\\" となっていたのを訂正\\n\\t\\t\\tif(intersect(segs[i], segs[j])) {\\n\\t\\t\\t\\tps.emplace_back(crosspoint(segs[i], segs[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(begin(ps), end(ps));\\n\\tps.erase(unique(begin(ps), end(ps)), end(ps));\\t// これ誤差とか大丈夫なのか？\\n\\n\\tint M = (int)ps.size();\\n\\tg.resize(M);\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tvector<int> vec;\\n\\t\\tfor(int j = 0; j < M; j++) {\\n\\t\\t\\tif(intersect(segs[i], ps[j])) {\\n\\t\\t\\t\\tvec.emplace_back(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j = 1; j < vec.size(); j++) {\\n\\t\\t\\tg[vec[j - 1]].push_back(vec[j]);\\n\\t\\t\\tg[vec[j]].push_back(vec[j - 1]);\\n\\t\\t}\\n\\t}\\n\\treturn (g);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\nPolygon convex_cut(const Polygon &U, Line l) {\\n\\tPolygon ret;\\n\\tfor(int i = 0; i < U.size(); i++) {\\n\\t\\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\\n\\t\\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n\\t\\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n\\t\\t\\tret.push_back(crosspoint(Line(now, nxt), l));\\n\\t\\t}\\n\\t}\\n\\treturn (ret);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\n// 多角形の面積\\nReal area(const Polygon &p) {\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); ++i) {\\n\\t\\tA += cross(p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\t // 0.5倍してなくない？\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\t // 0.5倍が抜けていたので修正;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// 二等分線\\nLine bisection(Point a, Point b) {\\n\\ta = (a + b) * 0.5;\\n\\tb = rotate(PI / 2, b - a) + a;\\n\\treturn Line(a, b);\\n}\\n\\n#pragma endregion\\n\\nusing R = Real;\\n\\nbool left_is_smaller(R left, R right) { return left < right - EPS; }\\n\\nvoid sol() {\\n\\tint n, w;\\n\\tcin >> n >> w;\\n\\tif(n + w == 0) exit(0);\\n\\n\\tPoints p(n);\\n\\tvector<Real> h(n);\\n\\tfor(int i = 0; i < n; i++) cin >> p[i] >> h[i];\\n\\n\\tvector<Real> r(n);\\n\\tReal lef, dn, up, rig;\\n\\tconst Real sz = 100.0;\\n\\n\\tauto judge = [&](Real sphere) {\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tif(h[i] > sphere) {\\n\\t\\t\\t\\tr[i] = sphere;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tR margin = sphere;\\n\\t\\tif(sphere > w) {\\n\\t\\t\\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\\n\\t\\t}\\n\\n\\t\\tlef = margin;\\n\\t\\trig = 100 - margin;\\n\\t\\tup = 100 - margin;\\n\\t\\tdn = margin;\\n\\n\\t\\tauto safe = [&](Real x, Real y) {\\n\\t\\t\\tif(x < lef - EPS || x > rig + EPS) return false;\\n\\t\\t\\tif(y < dn - EPS || y > up + EPS) return false;\\n\\n\\t\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t\\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\n\\t\\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\\n\\n\\t\\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\tPoints square(4);\\n\\t\\tsquare[0] = Point(lef, up);\\n\\t\\tsquare[1] = Point(lef, dn);\\n\\t\\tsquare[2] = Point(rig, dn);\\n\\t\\tsquare[3] = Point(rig, up);\\n\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\t\\tif(is == 4 || is == 0) continue;\\n\\n\\t\\t\\t\\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < 4; j++) {\\n\\t\\t\\t\\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\\n\\t\\t\\t\\t\\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\\n\\t\\t\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tR ok = 0.0;\\n\\tR ng = 10000000000;\\n\\twhile(ng - ok > 0.00005) {\\n\\t\\tR med = (ok + ng) / 2;\\n\\t\\tif(judge(med)) {\\n\\t\\t\\tok = med;\\n\\t\\t} else {\\n\\t\\t\\tng = med;\\n\\t\\t}\\n\\t}\\n\\tcout << ok << '\\\\n';\\n\\treturn;\\n}\\n\\nint main() {\\n\\twhile(1) sol();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3668,\n \"score_of_the_acc\": -0.5076,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1342_5032948\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2020.12.04 10:47:42 */\\n\\n// #ifdef LOCAL\\n// #define _GLIBCXX_DEBUG\\n// #endif\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region aliases\\n\\n#define rep(i, n) for(long long i = 0; i < (n); i++)\\n#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)\\n#define Rep(i, m, n) for(long long i = (m); i < (n); i++)\\n#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)\\n#define REP(i, m, n, p) for(long long i = m; i < n; i += p)\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bcnt(n) __builtin_popcountll(n)\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vb = vector<bool>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\ntemplate <class T = ll>\\nusing V = vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = priority_queue<T>;\\n\\n#pragma endregion\\n\\n#pragma region constants\\n\\nlong long const dekai = 1e18;\\nconst long double pi = acos(-1);\\nconst char dl = '\\\\n';\\nconst char sp = ' ';\\nint dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\\nint dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};\\n\\nconst int mod = 1000000007;\\n// const int mod = 998244353;\\n\\n#pragma endregion\\n\\n#pragma region basic_procedure\\n\\ntemplate <class T>\\ninline bool isin(T x, T lef, T rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool f = 1) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid No() { cout << \\\"No\\\\n\\\"; }\\nvoid YES(bool f = 1) { cout << (f ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\nvoid NO() { cout << \\\"NO\\\\n\\\"; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tcout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\nvoid err(bool flag) {\\n\\tif(!flag) return;\\n\\tcout << -1 << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(vector<T> const &v, bool tate = 0) {\\n\\tif(tate) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tcout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tcout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tcout << ' ';\\n\\t\\t}\\n\\t}\\n\\tcout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(T x) {\\n\\tcout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tcout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(vector<T> &v, T val) {\\n\\tfor(auto &a : v) a += val;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b != 0);\\n\\tT x = abs(a);\\n\\tT y = abs(b);\\n\\tT z = (x + y - 1) / y;\\n\\tif((a < 0 && b > 0) || (a > 0 && b < 0))\\n\\t\\treturn -z;\\n\\telse if(a == 0)\\n\\t\\treturn 0;\\n\\telse\\n\\t\\treturn z;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\nlong long POW(long long a, long long n) {\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a;\\n\\t\\ta = a * a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\n// a * x % mod == __gcd(a,mod)なるxを返す\\n// a が modの倍数でないことが条件\\nlong long modinv(long long a, long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tswap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tswap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\nvvll comb(100, vll(100, -1));\\nlong long com(long long n, long long k) { //普通の二項計数\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(comb[n][k] != -1) return comb[n][k];\\n\\tll res;\\n\\tif(n - k < k)\\n\\t\\tres = com(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = com(n - 1, k - 1) + com(n - 1, k);\\n\\tcomb[n][k] = res;\\n\\treturn res;\\n}\\n\\nconst int MAX = 5100000; // about 300ms, when MAX = 3*10^7 : 1900ms\\nlong long fac[MAX], finv[MAX], inv[MAX];\\n\\nvoid cominit() {\\n\\tfac[0] = fac[1] = 1;\\n\\tfinv[0] = finv[1] = 1;\\n\\tinv[1] = 1;\\n\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t}\\n}\\nlong long commod(long long n, long long k) {\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\nlong long pmod(long long n, long long k) {\\n\\tif(n < k) return 0;\\n\\tif(n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n// n個の区別しないボールを区別するk個の箱に入れる方法の総数\\nlong long hmod(long long n, long long k) {\\t// 重複組み合わせ\\n\\treturn commod(n + k - 1, n);\\n}\\n#pragma endregion\\n\\n#pragma region input\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tINPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tINPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tINPUT(__VA_ARGS__)\\n\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tcin >> a;\\n}\\ntemplate <class T>\\nvoid scan(vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\ntemplate <class T, class L>\\nvoid scan(pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n#pragma endregion\\n\\n#pragma region debug\\n\\n#pragma region output\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(int i = 0; i < (int)v.size(); i++) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << v[i];\\n\\t}\\n\\treturn os;\\n}\\n#pragma endregion\\n\\n#pragma region view\\n\\ntemplate <typename T>\\nvoid view(const T e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << \\\"(\\\";\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << \\\")\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tif(s.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &t : s) {\\n\\t\\tview(t);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tif(v.empty()) {\\n\\t\\tstd::cerr << \\\"{ }\\\";\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &e : v) {\\n\\t\\tview(e);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : vv) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &c : v) {\\n\\t\\tstd::cerr << \\\"\\\\t(\\\";\\n\\t\\tview(c.first);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t\\tview(c.second);\\n\\t\\tstd::cerr << \\\")\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &t : m) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(t.first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(t.second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\n#pragma endregion\\n\\n// when debugging : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tview(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"\\\\b\\\\b]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#define dump(x) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" \\\" << #x << \\\" : \\\"; \\\\\\n\\t\\tview(x); \\\\\\n\\t\\tstd::cerr << '\\\\n'; \\\\\\n\\t} while(0)\\n\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\n#pragma endregion\\n\\n#pragma region geometry\\n\\nusing Real = long double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2;\\t // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 4;\\t // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2;\\t // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0;\\t\\t\\t\\t\\t\\t // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定 (反時計回り)\\nbool is_convex(const Polygon &p) {\\n\\tint n = (int)p.size();\\n\\tfor(int i = 0; i < n; i++) {\\n\\t\\tif(ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\nPolygon convex_hull(Polygon &p) {\\n\\tint n = (int)p.size(), k = 0;\\n\\tif(n <= 2) return p;\\n\\tsort(p.begin(), p.end()); // x -> yの順にソート\\n\\tvector<Point> ch(2 * n);\\n\\tfor(int i = 0; i < n; ch[k++] = p[i++]) { //下半分を構成\\n\\t\\twhile(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tfor(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { //上半分を構成\\n\\t\\twhile(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n\\t}\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum { OUT, ON, IN };\\n\\nint contains(const Polygon &Q, const Point &p) {\\n\\tbool in = false;\\n\\tfor(int i = 0; i < Q.size(); i++) {\\n\\t\\tPoint a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\\n\\t\\tif(a.imag() > b.imag()) swap(a, b);\\n\\t\\tif(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\\n\\t\\tif(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\\n\\t}\\n\\treturn in ? IN : OUT;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分の重複除去\\nvoid merge_segments(vector<Segment> &segs) {\\n\\tauto merge_if_able = [](Segment &s1, const Segment &s2) {\\n\\t\\tif(abs(cross(s1.b - s1.a, s2.b - s2.a)) > EPS) return false;\\n\\t\\tif(ccw(s1.a, s2.a, s1.b) == 1 || ccw(s1.a, s2.a, s1.b) == -1) return false;\\n\\t\\tif(ccw(s1.a, s1.b, s2.a) == -2 || ccw(s2.a, s2.b, s1.a) == -2) return false;\\n\\t\\ts1 = Segment(min(s1.a, s2.a), max(s1.b, s2.b));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tif(segs[i].b < segs[i].a) swap(segs[i].a, segs[i].b);\\n\\t}\\n\\tfor(int i = 0; i < segs.size(); i++) {\\n\\t\\tfor(int j = i + 1; j < segs.size(); j++) {\\n\\t\\t\\tif(merge_if_able(segs[i], segs[j])) {\\n\\t\\t\\t\\tsegs[j--] = segs.back(), segs.pop_back();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\nvector<vector<int>> segment_arrangement(vector<Segment> &segs, vector<Point> &ps) {\\n\\tvector<vector<int>> g;\\n\\tint N = (int)segs.size();\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tps.emplace_back(segs[i].a);\\n\\t\\tps.emplace_back(segs[i].b);\\n\\t\\tfor(int j = i + 1; j < N; j++) {\\n\\t\\t\\tconst Point p1 = segs[i].b - segs[i].a;\\n\\t\\t\\tconst Point p2 = segs[j].b - segs[j].a;\\n\\t\\t\\tif(eq(cross(p1, p2), 0)) continue;\\t// \\\" == 0\\\" となっていたのを訂正\\n\\t\\t\\tif(intersect(segs[i], segs[j])) {\\n\\t\\t\\t\\tps.emplace_back(crosspoint(segs[i], segs[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(begin(ps), end(ps));\\n\\tps.erase(unique(begin(ps), end(ps)), end(ps));\\t// これ誤差とか大丈夫なのか？\\n\\n\\tint M = (int)ps.size();\\n\\tg.resize(M);\\n\\tfor(int i = 0; i < N; i++) {\\n\\t\\tvector<int> vec;\\n\\t\\tfor(int j = 0; j < M; j++) {\\n\\t\\t\\tif(intersect(segs[i], ps[j])) {\\n\\t\\t\\t\\tvec.emplace_back(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int j = 1; j < vec.size(); j++) {\\n\\t\\t\\tg[vec[j - 1]].push_back(vec[j]);\\n\\t\\t\\tg[vec[j]].push_back(vec[j - 1]);\\n\\t\\t}\\n\\t}\\n\\treturn (g);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\nPolygon convex_cut(const Polygon &U, Line l) {\\n\\tPolygon ret;\\n\\tfor(int i = 0; i < U.size(); i++) {\\n\\t\\tPoint now = U[i], nxt = U[(i + 1) % U.size()];\\n\\t\\tif(ccw(l.a, l.b, now) != -1) ret.push_back(now);\\n\\t\\tif(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n\\t\\t\\tret.push_back(crosspoint(Line(now, nxt), l));\\n\\t\\t}\\n\\t}\\n\\treturn (ret);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\n// 多角形の面積\\nReal area(const Polygon &p) {\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); ++i) {\\n\\t\\tA += cross(p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(const Polygon &p, const Circle &c) {\\n\\tif(p.size() < 3) return 0.0;\\n\\tfunction<Real(Circle, Point, Point)> cross_area = [&](const Circle &c, const Point &a, const Point &b) {\\n\\t\\tPoint va = c.p - a, vb = c.p - b;\\n\\t\\tReal f = cross(va, vb), ret = 0.0;\\n\\t\\tif(eq(f, 0.0)) return ret;\\n\\t\\tif(max(abs(va), abs(vb)) < c.r + EPS) return f;\\n\\t\\tif(distance(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\\t // 0.5倍してなくない？\\n\\t\\tauto u = crosspoint(c, Segment(a, b));\\n\\t\\tvector<Point> tot{a, u.first, u.second, b};\\n\\t\\tfor(int i = 0; i + 1 < tot.size(); i++) {\\n\\t\\t\\tret += cross_area(c, tot[i], tot[i + 1]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\tReal A = 0;\\n\\tfor(int i = 0; i < p.size(); i++) {\\n\\t\\tA += cross_area(c, p[i], p[(i + 1) % p.size()]);\\n\\t}\\n\\treturn A * 0.5;\\t // 0.5倍が抜けていたので修正;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\nReal convex_diameter(const Polygon &p) {\\n\\tint N = (int)p.size();\\n\\tint is = 0, js = 0;\\n\\tfor(int i = 1; i < N; i++) {\\n\\t\\tif(p[i].imag() > p[is].imag()) is = i;\\n\\t\\tif(p[i].imag() < p[js].imag()) js = i;\\n\\t}\\n\\tReal maxdis = norm(p[is] - p[js]);\\n\\n\\tint maxi, maxj, i, j;\\n\\ti = maxi = is;\\n\\tj = maxj = js;\\n\\tdo {\\n\\t\\tif(cross(p[(i + 1) % N] - p[i], p[(j + 1) % N] - p[j]) >= 0) {\\n\\t\\t\\tj = (j + 1) % N;\\n\\t\\t} else {\\n\\t\\t\\ti = (i + 1) % N;\\n\\t\\t}\\n\\t\\tif(norm(p[i] - p[j]) > maxdis) {\\n\\t\\t\\tmaxdis = norm(p[i] - p[j]);\\n\\t\\t\\tmaxi = i;\\n\\t\\t\\tmaxj = j;\\n\\t\\t}\\n\\t} while(i != is || j != js);\\n\\treturn sqrt(maxdis);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\nReal closest_pair(Points ps) {\\n\\tif(ps.size() <= 1) throw(0);\\n\\tsort(begin(ps), end(ps)); // xでソート\\n\\n\\tauto compare_y = [&](const Point &a, const Point &b) { return imag(a) < imag(b); };\\n\\tvector<Point> beet(ps.size());\\n\\tconst Real INF = 1e18;\\n\\n\\tfunction<Real(int, int)> rec = [&](int left, int right) {\\n\\t\\tif(right - left <= 1) return INF;\\n\\t\\tint mid = (left + right) >> 1;\\n\\t\\tauto x = real(ps[mid]);\\t // 領域内でx座標真中の点\\n\\t\\tauto ret = min(rec(left, mid), rec(mid, right));\\n\\t\\t// y座標でソートされた2つの区間をマージ\\n\\t\\tinplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\\n\\t\\tint ptr = 0;\\n\\t\\tfor(int i = left; i < right; i++) {\\n\\t\\t\\tif(abs(real(ps[i]) - x) >= ret) continue;\\n\\t\\t\\tfor(int j = 0; j < ptr; j++) {\\n\\t\\t\\t\\tauto luz = ps[i] - beet[ptr - j - 1];\\n\\t\\t\\t\\tif(imag(luz) >= ret) break;\\n\\t\\t\\t\\tret = min(ret, abs(luz));\\n\\t\\t\\t}\\n\\t\\t\\tbeet[ptr++] = ps[i];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\treturn rec(0, (int)ps.size());\\n}\\n\\n// (aからの距離):(bからの距離) = dist_a : dist_b となる点の集合(円)を返す\\nCircle Apollonius_Circle(Point a, Point b, Real dist_a, Real dist_b) {\\n\\tassert(!eq(dist_a, dist_b)); //同じ場合はbisectionで\\n\\tReal asq = dist_a * dist_a, bsq = dist_b * dist_b;\\n\\tPoint p = (a * bsq - b * asq) * (1 / (bsq - asq));\\n\\tReal r = abs(a - b) * dist_a * dist_b / abs(asq - bsq);\\n\\treturn Circle(p, r);\\n}\\n\\n// 二等分線\\nLine bisection(Point a, Point b) {\\n\\ta = (a + b) * 0.5;\\n\\tb = rotate(PI / 2, b - a) + a;\\n\\treturn Line(a, b);\\n}\\n\\n#pragma endregion\\n\\nusing R = Real;\\n\\nbool left_is_smaller(R left, R right) { return left < right - EPS; }\\n\\nvoid sol() {\\n\\tint n, w;\\n\\tcin >> n >> w;\\n\\tif(n + w == 0) exit(0);\\n\\n\\tPoints p(n);\\n\\tV<Real> h(n);\\n\\trep(i, n) cin >> p[i] >> h[i];\\n\\n\\tV<Real> r(n);\\n\\tReal lef, dn, up, rig;\\n\\tconst Real sz = 100.0;\\n\\n\\tauto judge = [&](Real sphere) {\\n\\t\\trep(i, n) {\\n\\t\\t\\tif(h[i] > sphere) {\\n\\t\\t\\t\\tr[i] = sphere;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tr[i] = sqrt(pow(sphere, 2) - pow(sphere - h[i], 2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tR margin = sphere;\\n\\t\\tif(sphere > w) {\\n\\t\\t\\tmargin = sqrt(pow(sphere, 2) - pow(sphere - w, 2));\\n\\t\\t}\\n\\n\\t\\tlef = margin;\\n\\t\\trig = 100 - margin;\\n\\t\\tup = 100 - margin;\\n\\t\\tdn = margin;\\n\\n\\t\\tauto safe = [&](Real x, Real y) {\\n\\t\\t\\tif(x < lef - EPS || x > rig + EPS) return false;\\n\\t\\t\\tif(y < dn - EPS || y > up + EPS) return false;\\n\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif(distance(p[i], Point(x, y)) < r[i] - EPS) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\n\\t\\tauto safepoint = [&](Point p) { return safe(p.real(), p.imag()); };\\n\\n\\t\\tif(safe(lef, up) || safe(lef, dn) || safe(rig, up) || safe(rig, dn)) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\tPoints square(4);\\n\\t\\tsquare[0] = Point(lef, up);\\n\\t\\tsquare[1] = Point(lef, dn);\\n\\t\\tsquare[2] = Point(rig, dn);\\n\\t\\tsquare[3] = Point(rig, up);\\n\\n\\t\\trep(i, n) Rep(j, i + 1, n) {\\n\\t\\t\\tint is = intersect(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\tif(is == 4 || is == 0) continue;\\n\\n\\t\\t\\tauto pr = crosspoint(Circle(p[i], r[i]), Circle(p[j], r[j]));\\n\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t}\\n\\n\\t\\trep(i, n) rep(j, 4) {\\n\\t\\t\\tif(intersect(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4]))) {\\n\\t\\t\\t\\tauto pr = (crosspoint(Circle(p[i], r[i]), Line(square[j], square[(j + 1) % 4])));\\n\\t\\t\\t\\tif(safepoint(pr.first) || safepoint(pr.second)) return true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tR ok = 0.0;\\n\\tR ng = 10000000000;\\n\\trep(_, 1000) {\\n\\t\\tR med = (ok + ng) / 2;\\n\\t\\tif(judge(med)) {\\n\\t\\t\\tok = med;\\n\\t\\t} else {\\n\\t\\t\\tng = med;\\n\\t\\t}\\n\\t}\\n\\tcout << ok << dl;\\n\\treturn;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\tcout << fixed << setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\twhile(1) sol();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6980,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -1.6658,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1342_5032173\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Real = double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-12, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 0; // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2; // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0; // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid solve() {\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\tif(!n) exit(0);\\n\\n\\tPoints p(n);\\n\\tvector<Real> h(n);\\n\\t//input\\n\\tfor(int i = 0; i < n; i++)\\n\\t\\tcin >> p[i] >> h[i];\\n\\n\\t//二分探索の判定関数\\n\\tauto judge = [&](Real rad) {\\n\\t\\t//確実に置けない円\\n\\t\\tCircles Cir(n);\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tif(h[i] >= rad)\\n\\t\\t\\t\\tCir[i].r = rad;\\n\\t\\t\\telse\\n\\t\\t\\t\\tCir[i].r = sqrt(h[i] * rad * 2 - h[i] * h[i]);\\n\\t\\t\\tCir[i].p = p[i];\\n\\t\\t}\\n\\n\\t\\tReal blank = (m >= rad ? rad : sqrt(m * rad * 2 - m * m));\\n\\n\\t\\tif(blank > 50) return false;\\n\\n\\t\\tPoint a = {blank, blank}, b = {blank, 100 - blank}, c = {100 - blank, 100 - blank}, d = {100 - blank, blank};\\n\\n\\t\\tSegments SEG = {Segment(a, b), Segment(b, c), Segment(c, d), Segment(d, a)};\\n\\n\\t\\tPoints candidate = {a, b, c, d};\\n\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t//円同士の交点を全列挙\\n\\t\\t\\tfor(int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tif(intersect(Cir[i], Cir[j])) {\\n\\t\\t\\t\\t\\tauto [p1, p2] = crosspoint(Cir[i], Cir[j]);\\n\\t\\t\\t\\t\\tcandidate.push_back(p1);\\n\\t\\t\\t\\t\\tcandidate.push_back(p2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//円と正方形の交点を全列挙\\n\\t\\t\\tfor(int j = 0; j < 4; j++) {\\n\\t\\t\\t\\tif(intersect(Cir[i], SEG[j])) {\\n\\t\\t\\t\\t\\tauto [p1, p2] = crosspoint(Cir[i], SEG[j]);\\n\\t\\t\\t\\t\\tcandidate.push_back(p1);\\n\\t\\t\\t\\t\\tcandidate.push_back(p2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto satisfied = [&](Point p) {\\n\\t\\t\\tfor(auto c : Cir) {\\n\\t\\t\\t\\tif(distance(p, c.p) + EPS < c.r) return false;\\n\\t\\t\\t}\\n\\t\\t\\tif(p.real() + EPS < blank) return false;\\n\\t\\t\\tif(p.imag() + EPS < blank) return false;\\n\\t\\t\\tif(p.real() - EPS > 100 - blank) return false;\\n\\t\\t\\tif(p.imag() - EPS > 100 - blank) return false;\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\n\\t\\tfor(auto &p : candidate) \\n\\t\\t\\tif(satisfied(p)) return true;\\n\\t\\t\\n\\t\\treturn false;\\n\\t};\\n\\n\\tReal ok = 0, ng = 200;\\n\\tfor(int i = 0; i < 25; i++) {\\n\\t\\tReal mid = (ok + ng) / 2;\\n\\t\\tif(judge(mid))\\n\\t\\t\\tok = mid;\\n\\t\\telse\\n\\t\\t\\tng = mid;\\n\\t}\\n\\tcout << ok << '\\\\n';\\n\\treturn;\\n}\\n\\nint main() {\\n\\tcout << fixed << setprecision(15);\\n\\twhile(1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4076,\n \"score_of_the_acc\": -0.9493,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1342_5032144\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Real = double; //時間がかかる割にdoubleと大差ない\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-12, /*1e-8はたまに落ちる*/ PI = acos(-1);\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; } //誤差無視の等式\\n\\n//実スカラー倍\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n\\n// point入力受け取り\\nistream &operator>>(istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\n// point出力\\nostream &operator<<(ostream &os, Point &p) { return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// 点 p を反時計回りに theta 回転\\nPoint rotate(Real theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r) { return (r * 180.0 / PI); }\\n\\nReal degree_to_radian(Real d) { return (d * PI / 180.0); }\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), /* もとはv(b-a)になってたので修正 */ w(c - b);\\n\\tReal alpha = atan2(v.imag(), v.real()), beta = atan2(w.imag(), w.real());\\n\\tif(alpha > beta) swap(alpha, beta);\\n\\tReal theta = (beta - alpha);\\n\\treturn min(theta, 2 * acos(-1) - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend ostream &operator<<(ostream &os, Line &p) { return os << p.a << \\\" to \\\" << p.b; }\\n\\n\\tfriend istream &operator>>(istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\n//外積\\nReal cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\n//内積\\nReal dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\"\\n\\treturn 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * 2.0; }\\n\\nbool intersect(const Line &l, const Point &p) { return abs(ccw(l.a, l.b, p)) != 1; }\\n\\nbool intersect(const Line &l, const Line &m) { return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS; }\\n\\nbool intersect(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == 0; }\\n\\nbool intersect(const Line &l, const Segment &s) { return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS; }\\n\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) { return distance(l, c.p) <= c.r + EPS; }\\n\\nbool intersect(const Circle &c, const Point &p) { return abs(abs(p - c.p) - c.r) < EPS; }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\n// 線分同士の交差判定 (端点が他方の線分上にあるならば交差とみなす)\\nbool intersect(const Segment &s, const Segment &t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l) {\\n\\tif(norm(projection(l, c.p) - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(d1 < c.r + EPS && d2 < c.r + EPS) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS) return 1;\\n\\tconst Point h = projection(l, c.p);\\n\\tif(dot(l.a - h, l.b - h) < 0) return 2;\\n\\treturn 0;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2) {\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal d = abs(c1.p - c2.p);\\n\\tif(c1.r + c2.r < d) return 0; // 外に離れている\\n\\tif(eq(c1.r + c2.r, d)) return 3; // 外接\\n\\tif(c1.r - c2.r < d) return 2; // 交差\\n\\tif(eq(c1.r - c2.r, d)) return 1; // 内接\\n\\treturn 0; // 内包\\n}\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\tif(intersect(s, r)) return abs(r - p);\\n\\treturn min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b) {\\n\\tif(intersect(a, b)) return 0;\\n\\treturn min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s)) return 0;\\n\\treturn min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tPoint e = (l.b - l.a) / abs(l.b - l.a);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tdouble base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tLine aa = Line(l.a, l.b);\\n\\tif(intersect(c, l) == 2) return crosspoint(c, aa);\\n\\tauto ret = crosspoint(c, aa);\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < 0)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // 余弦定理\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn {p1, p2};\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\npair<Point, Point> tangent(const Circle &c1, const Point &p2) { return crosspoint(c1, Circle(p2, sqrt(norm(c1.p - p2) - c1.r * c1.r))); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\nLines tangent(Circle c1, Circle c2) {\\n\\tLines ret;\\n\\tif(c1.r < c2.r) swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tPoint u = (c2.p - c1.p) / sqrt(g);\\n\\tPoint v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid solve() {\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\tif(!n) exit(0);\\n\\tPoints p(n);\\n\\tvector<Real> h(n);\\n\\tfor(int i = 0; i < n; i++)\\n\\t\\tcin >> p[i] >> h[i];\\n\\n\\tauto judge = [&](Real rad) {\\n\\t\\tCircles Cir(n);\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tif(h[i] >= rad)\\n\\t\\t\\t\\tCir[i].r = rad;\\n\\t\\t\\telse\\n\\t\\t\\t\\tCir[i].r = sqrt(h[i] * rad * 2 - h[i] * h[i]);\\n\\t\\t\\tCir[i].p = p[i];\\n\\t\\t}\\n\\n\\t\\tReal blank = (m >= rad ? rad : sqrt(m * rad * 2 - m * m));\\n\\n\\t\\tif(blank > 50) return false;\\n\\n\\t\\tPoint a = {blank, blank}, b = {blank, 100 - blank}, c = {100 - blank, 100 - blank}, d = {100 - blank, blank};\\n\\n\\t\\tSegments SEG = {Segment(a, b), Segment(b, c), Segment(c, d), Segment(d, a)};\\n\\n\\t\\tPoints candidate = {a, b, c, d};\\n\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\t//円同士の交点を全列挙\\n\\t\\t\\tfor(int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tif(intersect(Cir[i], Cir[j])) {\\n\\t\\t\\t\\t\\tauto [p1, p2] = crosspoint(Cir[i], Cir[j]);\\n\\t\\t\\t\\t\\tcandidate.push_back(p1);\\n\\t\\t\\t\\t\\tcandidate.push_back(p2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//円と正方形の交点を全列挙\\n\\t\\t\\tfor(int j = 0; j < 4; j++) {\\n\\t\\t\\t\\tif(intersect(Cir[i], SEG[j])) {\\n\\t\\t\\t\\t\\tauto [p1, p2] = crosspoint(Cir[i], SEG[j]);\\n\\t\\t\\t\\t\\tcandidate.push_back(p1);\\n\\t\\t\\t\\t\\tcandidate.push_back(p2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto satisfied = [&](Point p) {\\n\\t\\t\\tfor(auto c : Cir) {\\n\\t\\t\\t\\tif(distance(p, c.p) + EPS < c.r) return false;\\n\\t\\t\\t}\\n\\t\\t\\tif(p.real() + EPS < blank) return false;\\n\\t\\t\\tif(p.imag() + EPS < blank) return false;\\n\\t\\t\\tif(p.real() - EPS > 100 - blank) return false;\\n\\t\\t\\tif(p.imag() - EPS > 100 - blank) return false;\\n\\t\\t\\treturn true;\\n\\t\\t};\\n\\n\\t\\tfor(auto &p : candidate) {\\n\\t\\t\\tif(satisfied(p)) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tReal ok = 0, ng = 300;\\n\\tfor(int i = 0; i < 50; i++) {\\n\\t\\tReal mid = (ok + ng) / 2;\\n\\t\\tif(judge(mid))\\n\\t\\t\\tok = mid;\\n\\t\\telse\\n\\t\\t\\tng = mid;\\n\\t}\\n\\tcout << ok << '\\\\n';\\n\\treturn;\\n}\\n\\nint main() {\\n\\tcout << fixed << setprecision(15);\\n\\twhile(1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3956,\n \"score_of_the_acc\": -0.822,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1342_4964564\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\nusing namespace std;\\n#line 1 \\\"/home/kotatsugame/library/math/point.cpp\\\"\\n#define _USE_MATH_DEFINES\\n#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n#include<cmath>\\n#include<iomanip>\\nconst double EPS=1e-10;\\nbool eq(double a,double b){return abs(a-b)<EPS;}\\nstruct Point{\\n\\tdouble x,y;\\n\\tPoint(double x_=0,double y_=0):x(x_),y(y_){}\\n\\tPoint operator-()const{return Point(-x,-y);}\\n\\tPoint operator+(const Point&p)const{return Point(x+p.x,y+p.y);}\\n\\tPoint operator-(const Point&p)const{return Point(x-p.x,y-p.y);}\\n\\tPoint operator*(const double k)const{return Point(x*k,y*k);}\\n\\tPoint operator/(const double k)const{return Point(x/k,y/k);}\\n\\tbool operator<(const Point&p)const{return eq(x,p.x)?y<p.y:x<p.x;}\\n\\tbool operator==(const Point&p)const{return eq(x,p.x)&&eq(y,p.y);}\\n};\\nistream&operator>>(istream&is,Point&p){return is>>p.x>>p.y;}\\nostream&operator<<(ostream&os,const Point&p){return os<<fixed<<setprecision(9)<<p.x<<' '<<p.y;}\\nstruct Line{\\n\\tPoint p1,p2;\\n\\tLine(Point p1_=Point(),Point p2_=Point()):p1(p1_),p2(p2_){}\\n};\\nstruct Segment:Line{\\n\\tSegment(Point p1_=Point(),Point p2_=Point()):Line(p1_,p2_){}\\n};\\nstruct Circle{\\n\\tPoint o;\\n\\tdouble r;\\n\\tCircle(Point o_=Point(),double r_=0):o(o_),r(r_){}\\n};\\nusing Polygon=vector<Point>;\\n//function list begin\\nPoint vec(const Line&);\\ndouble norm(const Point&);\\ndouble norm(const Line&);\\ndouble abs(const Point&);\\ndouble abs(const Line&);\\ndouble arg(const Point&);\\ndouble arg(const Line&);\\ndouble arg(const Point&,const Point&,const Point&);//a->b->c\\nint argtype(const Point&);//(-pi,0]->0,(0,pi]->1\\nbool argless(const Point&,const Point&);//sorting points with arg\\ndouble dot(const Point&,const Point&);\\ndouble cross(const Point&,const Point&);\\nPoint polar(const double,const double);\\nPoint rotate(const Point&,const double);\\nenum{ONLINE_FRONT=-2,CLOCKWISE=-1,ON_SEGMENT=0,COUNTER_CLOCKWISE=1,ONLINE_BACK=2};\\nint ccw(const Point&,const Point&);\\nint ccw(const Point&,const Point&,const Point&);\\nint ccw(const Line&,const Point&);\\nbool orthogonal(const Point&,const Point&);\\nbool orthogonal(const Line&,const Line&);\\nbool parallel(const Point&,const Point&);\\nbool parallel(const Line&,const Line&);\\nbool intersect(const Line&,const Point&);\\nbool intersect(const Line&,const Line&);\\nbool intersect(const Segment&,const Point&);\\nbool intersect(const Segment&,const Segment&);\\nbool intersect(const Line&,const Segment&);\\nbool intersect(const Segment&,const Line&);\\nbool intersect(const Circle&,const Point&);\\nint intersect(const Circle&,const Line&);//count contacts\\nint intersect(const Circle&,const Segment&);\\nint intersect(const Circle&,const Circle&);//count common tangents\\ndouble distance(const Point&,const Point&);\\ndouble distance(const Line&,const Point&);\\ndouble distance(const Line&,const Line&);\\ndouble distance(const Segment&,const Point&);\\ndouble distance(const Segment&,const Segment&);\\ndouble distance(const Line&,const Segment&);\\ndouble distance(const Segment&,const Line&);\\ndouble distance(const Circle&,const Point&);\\ndouble distance(const Circle&,const Line&);\\ndouble distance(const Circle&,const Segment&);\\ndouble distance(const Circle&,const Circle&);\\nPoint projection(const Line&,const Point&);\\nPoint reflection(const Line&,const Point&);\\nPoint crosspoint(const Line&,const Line&);\\npair<Point,Point>crosspoint(const Circle&,const Line&);\\npair<Point,Point>crosspoint(const Circle&,const Segment&);\\npair<Point,Point>crosspoint(const Circle&,const Circle&);\\npair<Point,Point>tangent(const Circle&,const Point&);\\nvector<Line>tangent(const Circle&,const Circle&);\\nbool is_convex(const Polygon&);\\nPolygon convex_hull(Polygon,bool=false);\\nenum{OUT,ON,IN};\\nint contain(const Polygon&,const Point&);\\nint contain(const Circle&,const Point&);\\nint contain(const Circle&,const Segment&);\\nPolygon convex_cut(const Polygon&,const Line&);\\ndouble diameter(Polygon);\\ndouble area(const Polygon&);\\ndouble area(const Polygon&,const Line&);\\ndouble area(const Polygon&,const Circle&);\\n//function list end\\nPoint vec(const Line&s){return s.p2-s.p1;}\\ndouble norm(const Point&p){return p.x*p.x+p.y*p.y;}\\ndouble norm(const Line&s){return norm(vec(s));}\\ndouble abs(const Point&p){return hypot(p.x,p.y);}\\ndouble abs(const Line&s){return abs(vec(s));}\\ndouble arg(const Point&p){return atan2(p.y,p.x);}\\ndouble arg(const Line&s){return arg(vec(s));}\\ndouble arg(const Point&a,const Point&b,const Point&c){\\n\\tdouble A=arg(b-a),B=arg(c-b);\\n\\tdouble theta=abs(A-B);\\n\\treturn min(theta,2*M_PI-theta);\\n}\\nint argtype(const Point&a)\\n{\\n\\treturn a.y<-EPS?0:a.y>EPS?1:a.x<0?1:0;\\n}\\nbool argless(const Point&a,const Point&b)\\n{\\n\\tint at=argtype(a),bt=argtype(b);\\n\\treturn at!=bt?at<bt:ccw(a,b)>0;\\n}\\ndouble dot(const Point&a,const Point&b){return a.x*b.x+a.y*b.y;}\\ndouble cross(const Point&a,const Point&b){return a.x*b.y-a.y*b.x;}\\nPoint polar(const double r,const double theta){return Point(cos(theta),sin(theta))*r;}\\nPoint rotate(const Point&p,const double theta){\\n\\treturn Point(p.x*cos(theta)-p.y*sin(theta),p.x*sin(theta)+p.y*cos(theta));\\n}\\nint ccw(const Point&a,const Point&b)\\n{\\n\\treturn cross(a,b)>EPS?COUNTER_CLOCKWISE\\n\\t\\t:cross(a,b)<-EPS?CLOCKWISE\\n\\t\\t:dot(a,b)<0?ONLINE_BACK\\n\\t\\t:norm(a)<norm(b)?ONLINE_FRONT\\n\\t\\t:ON_SEGMENT;\\n}\\nint ccw(const Point&a,const Point&b,const Point&c){return ccw(b-a,c-a);}\\nint ccw(const Line&s,const Point&p){return ccw(s.p1,s.p2,p);}\\nbool orthogonal(const Point&a,const Point&b){return eq(dot(a,b),0);}\\nbool orthogonal(const Line&s,const Line&t){return orthogonal(vec(s),vec(t));}\\nbool parallel(const Point&a,const Point&b){return eq(cross(a,b),0);}\\nbool parallel(const Line&s,const Line&t){return parallel(vec(s),vec(t));}\\nbool intersect(const Line&s,const Point&p){return eq(cross(vec(s),p-s.p1),0);}\\nbool intersect(const Line&s,const Line&t){return !parallel(s,t)||intersect(s,t.p1);}\\nbool intersect(const Segment&s,const Point&p){return ccw(s,p)==ON_SEGMENT;}\\nbool intersect(const Segment&s,const Segment&t){\\n\\treturn ccw(s,t.p1)*ccw(s,t.p2)<=0&&ccw(t,s.p1)*ccw(t,s.p2)<=0;\\n}\\nbool intersect(const Line&s,const Segment&t){\\n\\treturn cross(vec(s),t.p1-s.p1)*cross(vec(s),t.p2-s.p1)<EPS;\\n}\\nbool intersect(const Segment&s,const Line&t){return intersect(t,s);}\\nbool intersect(const Circle&c,const Point&p){return eq(distance(c.o,p),c.r);}\\nint intersect(const Circle&c,const Line&s){\\n\\tdouble d=distance(s,c.o);\\n\\treturn eq(d,c.r)?1:d<c.r?2:0;\\n}\\nint intersect(const Circle&c,const Segment&s){\\n\\tPoint h=projection(s,c.o);\\n\\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\\n\\treturn distance(c.o,h)>c.r+EPS?0\\n\\t\\t:d1<c.r-EPS&&d2<c.r-EPS?0\\n\\t\\t:d1<c.r-EPS&&d2>c.r-EPS||d1>c.r-EPS&&d2<c.r-EPS?1\\n\\t\\t:intersect(s,h)?eq(distance(c.o,h),c.r)?1:2\\n\\t\\t:0;\\n}\\nint intersect(const Circle&a,const Circle&b){\\n\\tdouble d=distance(a.o,b.o);\\n\\treturn eq(d,a.r+b.r)?3:d>a.r+b.r?4:eq(d,abs(a.r-b.r))?1:d>abs(a.r-b.r)?2:0;\\n}\\ndouble distance(const Point&a,const Point&b){return abs(a-b);}\\ndouble distance(const Line&s,const Point&p){return distance(p,projection(s,p));}\\ndouble distance(const Line&s,const Line&t){return intersect(s,t)?0:distance(s,t.p1);}\\ndouble distance(const Segment&s,const Point&p){\\n\\treturn distance(p,\\n\\t\\tdot(vec(s),p-s.p1)<0?s.p1\\n\\t\\t:dot(-vec(s),p-s.p2)<0?s.p2\\n\\t\\t:projection(s,p)\\n\\t);\\n}\\ndouble distance(const Segment&s,const Segment&t){\\n\\treturn intersect(s,t)?0:min({\\n\\t\\tdistance(s,t.p1),distance(s,t.p2),\\n\\t\\tdistance(t,s.p1),distance(t,s.p2)\\n\\t});\\n}\\ndouble distance(const Line&s,const Segment&t){\\n\\treturn intersect(s,t)?0:min(distance(s,t.p1),distance(s,t.p2));\\n}\\ndouble distance(const Segment&s,const Line&t){return distance(t,s);}\\ndouble distance(const Circle&c,const Point&p){return abs(distance(c.o,p)-c.r);}\\ndouble distance(const Circle&c,const Line&s){return max(distance(s,c.o)-c.r,0.);}\\ndouble distance(const Circle&c,const Segment&s){\\n\\treturn intersect(c,s)?0\\n\\t\\t:contain(c,s)?c.r-max(distance(c.o,s.p1),distance(c.o,s.p2))\\n\\t\\t:distance(s,c.o)-c.r;\\n}\\ndouble distance(const Circle&a,const Circle&b){return max(distance(a.o,b.o)-a.r-b.r,0.);}\\nPoint projection(const Line&s,const Point&p){\\n\\treturn s.p1+vec(s)*dot(p-s.p1,vec(s))/norm(s);\\n}\\nPoint reflection(const Line&s,const Point&p){return projection(s,p)*2-p;}\\nPoint crosspoint(const Line&s,const Line&t){\\n\\tdouble d1=cross(vec(s),t.p1-s.p1);\\n\\tdouble d2=-cross(vec(s),t.p2-s.p1);\\n\\treturn t.p1+vec(t)*(d1/(d1+d2));\\n}\\npair<Point,Point>crosspoint(const Circle&c,const Line&s){\\n\\tPoint h=projection(s,c.o);\\n\\tPoint e=vec(s)/abs(s)*sqrt(c.r*c.r-norm(h-c.o));\\n\\treturn minmax(h-e,h+e);\\n}\\npair<Point,Point>crosspoint(const Circle&c,const Segment&s){\\n\\tpair<Point,Point>p=crosspoint(c,Line(s));\\n\\treturn intersect(c,s)==2?p\\n\\t\\t:intersect(s,p.first)?make_pair(p.first,p.first)\\n\\t\\t:make_pair(p.second,p.second);\\n}\\npair<Point,Point>crosspoint(const Circle&a,const Circle&b){\\n\\tdouble d=distance(a.o,b.o);\\n\\tdouble alpha=acos((a.r*a.r+d*d-b.r*b.r)/(2*a.r*d));\\n\\tdouble theta=arg(b.o-a.o);\\n\\treturn minmax(a.o+polar(a.r,theta+alpha),a.o+polar(a.r,theta-alpha));\\n}\\npair<Point,Point>tangent(const Circle&c,const Point&p){\\n\\treturn crosspoint(c,Circle(p,sqrt(norm(c.o-p)-c.r*c.r)));\\n}\\nvector<Line>tangent(const Circle&a,const Circle&b){\\n\\tvector<Line>ret;\\n\\tdouble g=distance(a.o,b.o);\\n\\tif(eq(g,0))return ret;\\n\\tPoint u=(b.o-a.o)/g;\\n\\tPoint v=rotate(u,M_PI/2);\\n\\tfor(int s:{-1,1}){\\n\\t\\tdouble h=(a.r+b.r*s)/g;\\n\\t\\tif(eq(h*h,1))ret.emplace_back(a.o+(h>0?u:-u)*a.r,a.o+(h>0?u:-u)*a.r+v);\\n\\t\\telse if(1-h*h>0){\\n\\t\\t\\tPoint U=u*h,V=v*sqrt(1-h*h);\\n\\t\\t\\tret.emplace_back(a.o+(U+V)*a.r,b.o-(U+V)*b.r*s);\\n\\t\\t\\tret.emplace_back(a.o+(U-V)*a.r,b.o-(U-V)*b.r*s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nbool is_convex(const Polygon&P){\\n\\tfor(int i=0;i<P.size();i++)\\n\\t\\tif(ccw(P[i],P[(i+1)%P.size()],P[(i+2)%P.size()])==CLOCKWISE)return false;\\n\\treturn true;\\n}\\nPolygon convex_hull(Polygon P,bool ONSEG){\\n\\tif(P.size()<=2)return P;\\n\\tsort(P.begin(),P.end());\\n\\tPolygon ret(2*P.size());\\n\\tint k=0,t;\\n\\tif(ONSEG){\\n\\t\\tfor(const Point&p:P){\\n\\t\\t\\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)==CLOCKWISE)k--;\\n\\t\\t\\tret[k++]=p;\\n\\t\\t}\\n\\t\\tt=k;\\n\\t\\tfor(int i=P.size()-2;i>=0;i--){\\n\\t\\t\\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])==CLOCKWISE)k--;\\n\\t\\t\\tret[k++]=P[i];\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tfor(const Point&p:P){\\n\\t\\t\\twhile(k>=2&&ccw(ret[k-2],ret[k-1],p)!=COUNTER_CLOCKWISE)k--;\\n\\t\\t\\tret[k++]=p;\\n\\t\\t}\\n\\t\\tt=k;\\n\\t\\tfor(int i=P.size()-2;i>=0;i--){\\n\\t\\t\\twhile(k>=t+1&&ccw(ret[k-2],ret[k-1],P[i])!=COUNTER_CLOCKWISE)k--;\\n\\t\\t\\tret[k++]=P[i];\\n\\t\\t}\\n\\t}\\n\\tret.resize(k-1);\\n\\tint mi=0;\\n\\tfor(int i=1;i<k-1;i++)\\n\\t\\tif(eq(ret[mi].y,ret[i].y)?ret[mi].x>ret[i].x:ret[mi].y>ret[i].y)mi=i;\\n\\trotate(ret.begin(),ret.begin()+mi,ret.end());\\n\\treturn ret;\\n}\\nint contain(const Polygon&P,const Point&p){\\n\\tbool in=false;\\n\\tfor(int i=0;i<P.size();i++){\\n\\t\\tSegment s(P[i],P[(i+1)%P.size()]);\\n\\t\\tif(intersect(s,p))return ON;\\n\\t\\telse{\\n\\t\\t\\tPoint a=s.p1-p,b=s.p2-p;\\n\\t\\t\\tif(a.y>b.y)swap(a,b);\\n\\t\\t\\tif(a.y<EPS&&EPS<b.y&&cross(a,b)>EPS)in=!in;\\n\\t\\t}\\n\\t}\\n\\treturn in?IN:OUT;\\n}\\nint contain(const Circle&c,const Point&p){\\n\\tdouble d=distance(c.o,p);\\n\\treturn eq(d,c.r)?ON:d<c.r?IN:OUT;\\n}\\nint contain(const Circle&c,const Segment&s){\\n\\tdouble d1=distance(c.o,s.p1),d2=distance(c.o,s.p2);\\n\\treturn d1<c.r+EPS&&d2<c.r+EPS?eq(d1,c.r)||eq(d2,c.r)?ON:IN:OUT;\\n}\\nPolygon convex_cut(const Polygon&P,const Line&s){\\n\\tPolygon ret;\\n\\tfor(int i=0;i<P.size();i++){\\n\\t\\tSegment t(P[i],P[(i+1)%P.size()]);\\n\\t\\tif(ccw(s,t.p1)!=CLOCKWISE)ret.push_back(t.p1);\\n\\t\\tif(!parallel(s,t)&&!intersect(s,t.p1)\\n\\t\\t\\t&&!intersect(s,t.p2)&&intersect(s,t))ret.push_back(crosspoint(s,t));\\n\\t}\\n\\treturn ret;\\n}\\ndouble diameter(Polygon P){\\n\\tif(!is_convex(P))P=convex_hull(P);\\n\\tint mi=0,Mi=0;\\n\\tfor(int i=1;i<P.size();i++){\\n\\t\\tif(P[i].x<P[mi].x)mi=i;\\n\\t\\tif(P[i].x>P[Mi].x)Mi=i;\\n\\t}\\n\\tdouble ret=0;\\n\\tint sm=mi,sM=Mi;\\n\\twhile(mi!=sM||Mi!=sm){\\n\\t\\tret=max(ret,norm(P[mi]-P[Mi]));\\n\\t\\tif(cross(P[(mi+1)%P.size()]-P[mi],P[(Mi+1)%P.size()]-P[Mi])<0)mi=(mi+1)%P.size();\\n\\t\\telse Mi=(Mi+1)%P.size();\\n\\t}\\n\\treturn sqrt(ret);\\n}\\ndouble area(const Polygon&P){\\n\\tdouble ret=0;\\n\\tfor(int i=0;i<P.size();i++)ret+=cross(P[i],P[(i+1)%P.size()]);\\n\\treturn ret/2;\\n}\\ndouble area(const Polygon&P,const Line&s){return area(convex_cut(P,s));}\\ndouble area(const Polygon&P,const Circle&c){\\n\\tdouble ret=0;\\n\\tfor(int i=0;i<P.size();i++)\\n\\t{\\n\\t\\tSegment s(P[i],P[(i+1)%P.size()]);\\n\\t\\tif(contain(c,s))ret+=cross(s.p1-c.o,s.p2-c.o);\\n\\t\\telse if(!intersect(c,s)){\\n\\t\\t\\tdouble a=arg(s.p2-c.o)-arg(s.p1-c.o);\\n\\t\\t\\tif(a>M_PI)a-=2*M_PI;\\n\\t\\t\\tif(a<-M_PI)a+=2*M_PI;\\n\\t\\t\\tret+=c.r*c.r*a;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tpair<Point,Point>p=crosspoint(c,s);\\n\\t\\t\\tPoint tmp[4]={s.p1,p.first,p.second,s.p2};\\n\\t\\t\\tif(intersect(c,Segment(s.p1,p.first))==2)swap(tmp[1],tmp[2]);\\n\\t\\t\\tfor(int j=0;j<3;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSegment t(tmp[j],tmp[j+1]);\\n\\t\\t\\t\\tif(contain(c,t))ret+=cross(t.p1-c.o,t.p2-c.o);\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tdouble a=arg(t.p2-c.o)-arg(t.p1-c.o);\\n\\t\\t\\t\\t\\tif(a>M_PI)a-=2*M_PI;\\n\\t\\t\\t\\t\\tif(a<-M_PI)a+=2*M_PI;\\n\\t\\t\\t\\t\\tret+=c.r*c.r*a;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret/2;\\n}\\n#line 3 \\\"a.cpp\\\"\\nint N,W;\\nPoint p[10];\\nint h[10];\\nCircle C[10];\\ndouble calc(double h,double r)\\n{\\n\\tif(h>r)return r;\\n\\telse return sqrt(2*r*h-h*h);\\n}\\nbool in(Point p,double w)\\n{\\n\\tfor(int i=0;i<N;i++)if(contain(C[i],p)==IN)return false;\\n\\treturn w-EPS<p.x&&p.x<100-w+EPS&&w-EPS<p.y&&p.y<100-w+EPS;\\n}\\nmain()\\n{\\n\\twhile(cin>>N>>W,N)\\n\\t{\\n\\t\\tfor(int i=0;i<N;i++)cin>>p[i]>>h[i];\\n\\t\\tdouble le=0,ri=1e6;\\n\\t\\tfor(int c=0;c<100;c++)\\n\\t\\t{\\n\\t\\t\\tdouble r=(le+ri)/2;\\n\\t\\t\\tdouble w=calc(W,r);\\n\\t\\t\\tfor(int i=0;i<N;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tC[i]=Circle(p[i],calc(h[i],r));\\n\\t\\t\\t}\\n\\t\\t\\tbool ok=false;\\n\\t\\t\\tfor(int i=0;i<N;i++)for(int j=i+1;j<N;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt=intersect(C[i],C[j]);\\n\\t\\t\\t\\tif(cnt==0||cnt==4)continue;\\n\\t\\t\\t\\tpair<Point,Point>tmp=crosspoint(C[i],C[j]);\\n\\t\\t\\t\\tif(in(tmp.first,w)||in(tmp.second,w))ok=true;\\n\\t\\t\\t}\\n\\t\\t\\tPoint cr[4]={Point(w,w),Point(w,100-w),Point(100-w,w),Point(100-w,100-w)};\\n\\t\\t\\tLine L[4]={Line(cr[0],cr[1]),Line(cr[0],cr[2]),Line(cr[1],cr[3]),Line(cr[2],cr[3])};\\n\\t\\t\\tfor(int i=0;i<N;i++)for(int j=0;j<4;j++)if(intersect(C[i],L[j]))\\n\\t\\t\\t{\\n\\t\\t\\t\\tpair<Point,Point>tmp=crosspoint(C[i],L[j]);\\n\\t\\t\\t\\tif(in(tmp.first,w)||in(tmp.second,w))ok=true;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<4;i++)for(int j=i+1;j<4;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(in(crosspoint(L[i],L[j]),w))ok=true;\\n\\t\\t\\t}\\n\\t\\t\\tif(ok)le=r;\\n\\t\\t\\telse ri=r;\\n\\t\\t}\\n\\t\\tcout<<fixed<<setprecision(16)<<le<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.434,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1342_4952281\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=2005;\\n//const int INF=1<<30;\\nconst ll INF=1LL<<60;\\n//幾何ライブラリ\\n\\nconst double eps=1e-8;\\nconst double pi=acos((double)-1.0L);\\n#define equals(a,b) (fabs((a)-(b))<eps)\\n\\ndouble torad(int deg) {return (double)(deg)*pi/180.0;}\\ndouble todeg(double ang) {return ang*180.0/pi;}\\n\\nclass Point{\\npublic:\\n double x,y;\\n \\n Point(double x=0,double y=0):x(x),y(y){}\\n \\n Point operator + (Point p){return Point(x+p.x,y+p.y);}\\n Point operator - (Point p){return Point(x-p.x,y-p.y);}\\n Point operator * (double a){return Point(a*x,a*y);}\\n Point operator / (double a){return Point(x/a,y/a);}\\n \\n double abs(){return sqrt(norm());}\\n double norm(){return x*x+y*y;}\\n \\n bool operator < (const Point &p)const{\\n return x+eps<p.x||(equals(x,p.x)&&y+eps<p.y);\\n }\\n \\n bool operator == (const Point &p)const{\\n return fabs(x-p.x)<eps/100000&&fabs(y-p.y)<eps/100000;\\n }\\n};\\n\\ntypedef Point Vector;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x+a.y*b.y;\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\nstruct Segment{\\n Point p1,p2;\\n};\\n\\nbool isOrthogonal(Vector a,Vector b){\\n return equals(dot(a,b),0.0);\\n}\\n\\nbool isOrthogonal(Point a1,Point a2,Point b1,Point b2){\\n return isOrthogonal(a1-a2,b1-b2);\\n}\\n\\nbool isOrthogonal(Segment s1,Segment s2){\\n return equals(dot(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Point a1,Point a2,Point b1,Point b2){\\n return isParallel(a1-a2,b1-b2);\\n}\\n\\nbool isParallel(Segment s1,Segment s2){\\n return equals(cross(s1.p2-s1.p1,s2.p2-s2.p1),0.0);\\n}\\n\\nPoint project(Segment s,Point p){\\n Vector base=s.p2-s.p1;\\n double r=dot(p-s.p1,base)/norm(base);\\n return s.p1+base*r;\\n}\\n\\nPoint reflect(Segment s,Point p){\\n return p+(project(s,p)-p)*2.0;\\n}\\n\\nPoint turn(Point p,Point c,double pi){\\n double q=atan2(p.y-c.y,p.x-c.x);\\n q+=pi;\\n p=c+Point{cos(q)*abs(p-c),sin(q)*abs(p-c)};\\n \\n return p;\\n}\\n//pをcを中心としてpi回転させる(1周で2π)\\n//p=cのときnan\\n\\nstatic const int counter_clockwise=1;\\nstatic const int clockwise=-1;\\nstatic const int online_back=2;\\nstatic const int online_front=-2;\\nstatic const int on_segment=0;\\n\\nint ccw(Point p0,Point p1,Point p2){\\n Vector a=p1-p0;\\n Vector b=p2-p0;\\n \\n if(cross(a,b)>eps) return counter_clockwise;\\n if(cross(a,b)<-eps) return clockwise;\\n if(dot(a,b)<-eps) return online_back;\\n if(a.norm()<b.norm()) return online_front;\\n \\n return on_segment;\\n}\\n\\nbool intersect(Point p1,Point p2,Point p3,Point p4){\\n return(ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0&&ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\\n}\\n\\nbool intersect(Segment s1,Segment s2){\\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool overlap(Segment s1,Segment s2){\\n int a=ccw(s1.p1,s1.p2,s2.p1),b=ccw(s1.p1,s1.p2,s2.p2);\\n if(a&1||b&1) return 0;\\n if(a==2){\\n if(b==-2||(b==0&&!(s2.p2==s1.p1))) return 1;\\n else return 0;\\n }\\n if(a==-2){\\n if(b==2||(b==0&&!(s2.p2==s1.p2))) return 1;\\n else return 0;\\n }\\n if(a==0){\\n if(s1.p1==s2.p1){\\n if(b!=2) return 1;\\n else return 0;\\n }\\n else if(s1.p2==s2.p1){\\n if(b!=-2) return 1;\\n else return 0;\\n }\\n else return 1;\\n }\\n return 0;\\n}\\n//s1とs2の共通の線分(長さ0より大きい)があるかどうか\\n\\ntypedef Segment Line;\\n\\ndouble getDistance(Point a,Point b){\\n return abs(a-b);\\n}\\n\\ndouble getDistanceLP(Line l,Point p){\\n return abs(cross(l.p2-l.p1,p-l.p1)/abs(l.p2-l.p1));\\n}\\n\\ndouble getDistanceSP(Segment s,Point p){\\n if(dot(s.p2-s.p1,p-s.p1)<0.0) return abs(p-s.p1);\\n if(dot(s.p1-s.p2,p-s.p2)<0.0) return abs(p-s.p2);\\n return getDistanceLP(s,p);\\n}\\n\\ndouble getDistance(Segment s1,Segment s2){\\n if(intersect(s1,s2)) return 0.0;\\n return min({getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2),getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2)});\\n}\\n\\nPoint getCrossPointS(Segment s1,Segment s2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\n Vector base=s2.p2-s2.p1;\\n double d1=abs(cross(base,s1.p1-s2.p1));\\n double d2=abs(cross(base,s1.p2-s2.p1));\\n double t=d1/(d1+d2);\\n return s1.p1+(s1.p2-s1.p1)*t;\\n}//同じ時壊れます\\n\\nPoint getCrossPointL(Line l1,Line l2){\\n //if(ccw(s1.p1,s1.p2,s2.p1)==0&&ccw(s1.p1,s1.p2,s2.p2)==0) return s1.p1;\\n \\n Vector v1=l1.p2-l1.p1,v2=l2.p2-l2.p1;\\n \\n return l1.p1+v1*cross(v2,l2.p1-l1.p1)/cross(v2,v1);\\n}\\n\\nSegment ParallelSegment(Segment s,double d){\\n Vector v={-(s.p2-s.p1).y,(s.p2-s.p1).x};\\n v=v/abs(v);\\n \\n s.p1=s.p1+v*d;\\n s.p2=s.p2+v*d;\\n \\n return s;\\n}\\n\\nPoint naisin(Line l1,Line l2,Line l3){\\n //平行でない前提\\n \\n Point p1=getCrossPointL(l1,l2),p2=getCrossPointL(l1,l3),p3=getCrossPointL(l2,l3);\\n if(p1==p2&&p2==p3&&p3==p1) return p1;\\n \\n return (p1*abs(p1)+p2*abs(p2)+p3*abs(p3))/(abs(p1)+abs(p2)+abs(p3));\\n}\\n\\n//ネットの適当を書いたのであってるか全く知りません→あってそう\\n\\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n Circle(Point c=Point(),double r=0.0):c(c),r(r){}\\n};\\n\\nPoint CircleCenter(Point a,Point b,Point c){\\n Point u=a-b,v=a-c;\\n double m1=(norm(a)-norm(b))/2.0,m2=(norm(a)-norm(c))/2.0;\\n \\n Point res;\\n if(cross(u,v)==0.0){\\n res.x=1e9;\\n res.y=1e9;\\n \\n return res;\\n }\\n res.x=(m1*v.y-m2*u.y)/cross(u,v);\\n res.y=(m1*v.x-m2*u.x)/cross(v,u);\\n \\n return res;\\n}\\n//3点を通る円の中心を返す\\n\\npair<Point,Point> segCrossPpoints(Circle c,Line l){\\n //assert(intersect(c,l));\\n Vector pr=project(l,c.c);\\n Vector e=(l.p2-l.p1)/abs(l.p2-l.p1);\\n double base=sqrt(c.r*c.r-norm(pr-c.c));\\n return make_pair(pr+e*base,pr-e*base);\\n}\\n\\ndouble arg(Vector p){return atan2(p.y,p.x);}\\nVector polar(double a,double r){return Point(cos(r)*a,sin(r)*a);}\\n\\npair<Point,Point> getCrossPoints(Circle c1,Circle c2){\\n //assert(intersect(c1,c2));\\n double d=abs(c1.c-c2.c);\\n double a=acos(max(-1.0,min(1.0,(c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d))));\\n double t=arg(c2.c-c1.c);\\n //cout<<d<<\\\" \\\"<<a<<\\\" \\\"<<t<<endl;\\n return make_pair(c1.c+polar(c1.r,t+a),c1.c+polar(c1.r,t-a));\\n}\\n\\nvector<Line> Commontangent(Circle c1,Circle c2){\\n vector<Line> res;\\n Point p=c2.c-c1.c;\\n \\n if(abs(p)>=(c1.r+c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r+c2.r)+p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r+c2.r)-p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r+c2.r)-p.y*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r+c2.r)+p.x*sqrt(norm(p)-(c1.r+c2.r)*(c1.r+c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n if(abs(p)>=abs(c1.r-c2.r)){\\n Point a,b;\\n a.x=c1.r*(p.x*(c1.r-c2.r)+p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n a.y=c1.r*(p.y*(c1.r-c2.r)-p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n b.x=c1.r*(p.x*(c1.r-c2.r)-p.y*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n b.y=c1.r*(p.y*(c1.r-c2.r)+p.x*sqrt(norm(p)-(c1.r-c2.r)*(c1.r-c2.r)))/norm(p);\\n \\n res.push_back(Line{a+c1.c,a+c1.c+Point{-a.y,a.x}});\\n if(!(a==b)){\\n res.push_back(Line{b+c1.c,b+c1.c+Point{-b.y,b.x}});\\n }\\n }\\n \\n return res;\\n}\\n\\ntypedef vector<Point> Polygon;\\n\\n/*\\n IN 2\\n ON 1\\n OUT 0\\n */\\n\\nint contains(Polygon g,Point p){\\n int n=int(g.size());\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(a.y>b.y) swap(a,b);\\n if(a.y<eps&&eps<b.y&&cross(a,b)>eps) x=!x;\\n }\\n return (x?2:0);\\n}\\n\\nPolygon andrewScan(Polygon s,bool ok){\\n Polygon u,l;\\n sort(all(s));\\n \\n if(int(s.size())<3) return s;\\n int n=int(s.size());\\n \\n u.push_back(s[0]);\\n u.push_back(s[1]);\\n \\n l.push_back(s[n-1]);\\n l.push_back(s[n-2]);\\n \\n if(ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])==counter_clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])==counter_clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n if(!ok){\\n for(int i=2;i<n;i++){\\n for(int j=int(u.size());j>=2&&ccw(u[j-2],u[j-1],s[i])!=clockwise;j--){\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n \\n for(int i=int(s.size())-3;i>=0;i--){\\n for(int j=int(l.size());j>=2&&ccw(l[j-2],l[j-1],s[i])!=clockwise;j--){\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n }\\n \\n reverse(all(l));\\n \\n for(int i=int(u.size())-2;i>=1;i--) l.push_back(u[i]);\\n \\n return l;\\n}//ok==1なら辺の上も含める\\n\\nPolygon convex_cut(const Polygon& P, const Line& l) {\\n Polygon Q;\\n for(int i=0;i<si(P);i++){\\n Point A=P[i],B=P[(i+1)%si(P)];\\n if(ccw(l.p1,l.p2,A)!=-1)Q.push_back(A);\\n if(ccw(l.p1,l.p2,A)*ccw(l.p1,l.p2,B)<0) Q.push_back(getCrossPointL(Line{A,B},l));\\n }\\n return Q;\\n}\\n\\ndouble area(Point a,Point b,Point c){\\n b=b-a;\\n c=c-a;\\n return abs(b.x*c.y-b.y*c.x)/2.0;\\n}\\n\\ndouble area(Polygon &P){\\n if(si(P)==0) return 0.0;\\n double res=0;\\n Point c={0.0,0.0};\\n for(int i=0;i<si(P);i++){\\n c=c+P[i];\\n }\\n c=c/si(P);\\n \\n for(int i=0;i<si(P);i++){\\n res+=area(c,P[i],P[(i+1)%si(P)]);\\n }\\n \\n return res;\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N,W;cin>>N>>W;\\n if(N==0) break;\\n vector<Point> P(N);\\n vector<double> h(N);\\n for(int i=0;i<N;i++) cin>>P[i].x>>P[i].y>>h[i];\\n \\n double left=0,right=3000;\\n for(int q=0;q<100;q++){\\n double mid=(left+right)/2.0;\\n vector<Circle> C(N);\\n for(int i=0;i<N;i++){\\n C[i].c=P[i];\\n if(h[i]<=mid){\\n C[i].r=sqrt((h[i])*(2.0*mid-h[i]));\\n }else{\\n C[i].r=mid;\\n }\\n }\\n double lim;\\n if(W<=mid) lim=sqrt((W)*(2.0*mid-W));\\n else lim=mid;\\n \\n vector<Point> p={{lim,lim},{100-lim,lim},{100-lim,100-lim},{lim,100-lim}};\\n vector<Line> l(4);\\n for(int i=0;i<4;i++) l[i]={p[i],p[(i+1)%4]};\\n \\n bool ok=false;\\n for(int i=0;i<N;i++){\\n for(int j=i+1;j<N;j++){\\n double d=getDistance(C[i].c,C[j].c);\\n if(C[i].r+C[j].r>d){\\n auto ps=getCrossPoints(C[i],C[j]);\\n \\n //assert(abs(getDistance(C[i].c,ps.fi)-C[i].r)<1e-5);\\n //cout<<getDistance(C[i].c,ps.fi)<<\\\" \\\"<<C[i].r<<endl;\\n assert(d>1e-5);\\n assert(C[i].r>1e-5);\\n assert(C[j].r>1e-5);\\n //cout<<ps.fi.x<<\\\" \\\"<<ps.fi.y<<\\\" \\\"<<ps.se.x<<\\\" \\\"<<ps.se.y<<endl;\\n \\n for(int t=0;t<2;t++){\\n bool safe=true;\\n for(int k=0;k<N;k++){\\n double d2=getDistance(ps.fi,C[k].c);\\n if(d2<C[k].r-eps) safe=false;\\n }\\n \\n if(ps.fi.x<lim-eps) safe=false;\\n if(ps.fi.x>100.0-lim+eps) safe=false;\\n if(ps.fi.y<lim-eps) safe=false;\\n if(ps.fi.y>100.0-lim+eps) safe=false;\\n \\n if(safe) ok=true;\\n swap(ps.fi,ps.se);\\n }\\n }\\n }\\n for(int k=0;k<4;k++){\\n double d=getDistanceLP(l[k],C[i].c);\\n if(d<C[i].r-eps){\\n auto ps=segCrossPpoints(C[i],l[k]);\\n for(int t=0;t<2;t++){\\n bool safe=true;\\n for(int a=0;a<N;a++){\\n double d2=getDistance(ps.fi,C[a].c);\\n if(d2<C[a].r-eps) safe=false;\\n }\\n \\n if(ps.fi.x<lim-eps) safe=false;\\n if(ps.fi.x>100.0-lim+eps) safe=false;\\n if(ps.fi.y<lim-eps) safe=false;\\n if(ps.fi.y>100.0-lim+eps) safe=false;\\n \\n if(safe) ok=true;\\n swap(ps.fi,ps.se);\\n }\\n }\\n }\\n }\\n \\n for(int t=0;t<4;t++){\\n bool safe=true;\\n for(int k=0;k<N;k++){\\n double d2=getDistance(p[t],C[k].c);\\n if(d2<C[k].r-eps) safe=false;\\n }\\n \\n if(safe) ok=true;\\n }\\n \\n if(lim>=50) ok=false;\\n \\n if(ok) left=mid;\\n else right=mid;\\n }\\n \\n cout<<fixed<<setprecision(25)<<left<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 4124,\n \"score_of_the_acc\": -1.0193,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1342_4950291\",\n \"code_snippet\": \"#define MOD_TYPE 1\\n\\n#pragma region Macros\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#if 0\\n#include <boost/multiprecision/cpp_int.hpp>\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\nusing Int = boost::multiprecision::cpp_int;\\nusing lld = boost::multiprecision::cpp_dec_float_100;\\n#endif\\n#if 0\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\nusing ll = long long int;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pld = pair<ld, ld>;\\ntemplate <typename Q_type>\\nusing smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;\\n\\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\\n//constexpr ll MOD = ;\\nconstexpr int INF = (int)1e9 + 10;\\nconstexpr ll LINF = (ll)4e18;\\nconstexpr double PI = acos(-1.0);\\nconstexpr double EPS = 1e-10;\\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\\n\\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\\n#define repi(i, n) REPI(i, 0, n)\\n#define MP make_pair\\n#define MT make_tuple\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define possible(n) cout << ((n) ? \\\"possible\\\" : \\\"impossible\\\") << \\\"\\\\n\\\"\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << \\\"\\\\n\\\"\\n#define Yay(n) cout << ((n) ? \\\"Yay!\\\" : \\\":(\\\") << \\\"\\\\n\\\"\\n#define all(v) v.begin(), v.end()\\n#define NP(v) next_permutation(all(v))\\n#define dbg(x) cerr << #x << \\\":\\\" << x << \\\"\\\\n\\\";\\n\\nstruct io_init\\n{\\n io_init()\\n {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << setprecision(30) << setiosflags(ios::fixed);\\n };\\n} io_init;\\ntemplate <typename T>\\ninline bool chmin(T &a, T b)\\n{\\n if (a > b)\\n {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ninline bool chmax(T &a, T b)\\n{\\n if (a < b)\\n {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ninline ll CEIL(ll a, ll b)\\n{\\n return (a + b - 1) / b;\\n}\\ntemplate <typename A, size_t N, typename T>\\ninline void Fill(A (&array)[N], const T &val)\\n{\\n fill((T *)array, (T *)(array + N), val);\\n}\\ntemplate <typename T, typename U>\\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept\\n{\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nconstexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept\\n{\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n#pragma endregion\\n\\nusing Real = ld;\\nusing Point = complex<Real>;\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\\ninline bool eq(Point a, Point b) { return fabs(b - a) < EPS; }\\n\\nPoint operator*(const Point &p, const Real &d)\\n{\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\nistream &operator>>(istream &is, Point &p)\\n{\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, Point &p)\\n{\\n return os << fixed << setprecision(20) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\n// 点 p を反時計回りに theta 回転\\ninline Point rotate(Real theta, const Point &p)\\n{\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nReal radian_to_degree(Real r)\\n{\\n return (r * 180.0 / PI);\\n}\\n\\nReal degree_to_radian(Real d)\\n{\\n return (d * PI / 180.0);\\n}\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(Point a, Point b, Point c)\\n{\\n a -= b, c -= b;\\n Real alpha = atan2(a.imag(), a.real()), beta = atan2(c.imag(), c.real());\\n if (alpha > beta)\\n swap(alpha, beta);\\n Real theta = (beta - alpha);\\n return min(theta, 2 * acos(-1) - theta);\\n}\\n\\n// a-b-c の角度（[0,2π)、a を反時計回りに回転させてcに重ねる角度）\\nReal get_angle2(Point a, Point b, Point c)\\n{\\n a -= b, c -= b;\\n Real theta = atan2(imag(c), real(c)) - atan2(imag(a), real(a));\\n while (theta < 0)\\n theta += PI * 2;\\n while (theta > PI * 2)\\n theta -= PI * 2;\\n return theta;\\n}\\n\\n// a-b-c の角度（[0,2π)、p を間に含む方）\\nReal get_angle2(const Point &a, const Point &b, const Point &c, const Point &p)\\n{\\n if (get_angle2(a, b, p) + get_angle2(p, b, c) < PI * 2)\\n return get_angle2(a, b, c);\\n else\\n return get_angle2(c, b, a);\\n}\\n\\nnamespace std\\n{\\n bool operator<(const Point &a, const Point &b)\\n {\\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n} // namespace std\\n\\nstruct Line\\n{\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n Line(Real A, Real B, Real C) // Ax + By = C\\n {\\n if (eq(A, 0))\\n a = Point(0, C / B), b = Point(1, C / B);\\n else if (eq(B, 0))\\n b = Point(C / A, 0), b = Point(C / A, 1);\\n else\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n\\n friend ostream &operator<<(ostream &os, Line &p)\\n {\\n return os << p.a << \\\" to \\\" << p.b;\\n }\\n\\n friend istream &operator>>(istream &is, Line &a)\\n {\\n return is >> a.a >> a.b;\\n }\\n};\\n\\n// Ax + By = C\\ntuple<Real, Real, Real> parameter(const Line &l)\\n{\\n Real A = imag(l.b) - imag(l.a);\\n Real B = real(l.a) - real(l.b);\\n Real C = real(l.a) * A + imag(l.a) * B;\\n return {A, B, C};\\n}\\n\\nstruct Segment : Line\\n{\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle\\n{\\n Point p;\\n Real r;\\n Circle() = default;\\n Circle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = vector<Point>;\\nusing Polygon = vector<Point>;\\nusing Segments = vector<Segment>;\\nusing Lines = vector<Line>;\\nusing Circles = vector<Circle>;\\n\\ninline Real cross(const Point &a, const Point &b)\\n{\\n return real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\ninline Real dot(const Point &a, const Point &b)\\n{\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\n// 直線がx軸となす角 [0, π)\\n// to do: verify\\ninline Real get_angle(const Line &l)\\n{\\n Point p = l.a - l.b;\\n if (imag(p) < 0)\\n p *= -1;\\n return get_angle2(Point(1, 0), Point(0, 0), p);\\n}\\n\\n// 2直線がなす角 [0, π/2]\\n// to do: verify\\ninline Real get_angle(const Line &l1, const Line &l2)\\n{\\n Real theta = get_angle(l1) - get_angle(l2);\\n if (theta < 0)\\n theta += PI;\\n return theta >= PI / 2.0 ? theta - PI / 2.0 : theta;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\nint ccw(const Point &a, Point b, Point c)\\n{\\n b = b - a, c = c - a;\\n if (cross(b, c) > EPS)\\n return +1; // \\\"COUNTER_CLOCKWISE\\\"\\n if (cross(b, c) < -EPS)\\n return -1; // \\\"CLOCKWISE\\\"\\n if (dot(b, c) < 0)\\n return +2; // \\\"ONLINE_BACK\\\"\\n if (norm(b) < norm(c))\\n return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\n\\n// p, q を m : n に内分する点\\ninline Point internal(const Point &p, const Point &q, Real m, Real n)\\n{\\n return (n * p + m * q) / (m + n);\\n}\\n\\n// p, q を m : n に外分する点\\ninline Point external(const Point &p, const Point &q, Real m, Real n)\\n{\\n return internal(p, q, m, -n);\\n}\\n\\n// 垂直ベクトル\\ninline Point orthvector(const Point p)\\n{\\n return Point(imag(p), -real(p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\ninline bool parallel(const Line &a, const Line &b)\\n{\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\ninline bool orthogonal(const Line &a, const Line &b)\\n{\\n return eq(dot(a.a - a.b, b.a - b.b), 0.0);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\ninline Point projection(const Line &l, const Point &p)\\n{\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\ninline Point projection(const Segment &l, const Point &p)\\n{\\n double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\ninline Point reflection(const Line &l, const Point &p)\\n{\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n\\n// 点 p を通り直線 l に垂直な直線\\ninline Line verticalline(const Line &l, const Point &p)\\n{\\n return Line(p, p + orthvector(l.a - l.b));\\n}\\n\\n// 点 p, q の垂直二等分線\\ninline Line bisector(const Point &p, const Point &q)\\n{\\n Line l(p, q);\\n Point m = internal(p, q, 1, 1);\\n return verticalline(l, m);\\n}\\ninline Line bisector(const Segment &sg)\\n{\\n return bisector(sg.a, sg.b);\\n}\\n\\ninline bool intersect(const Line &l, const Point &p)\\n{\\n return abs(ccw(l.a, l.b, p)) != 1;\\n}\\n\\ninline bool intersect(const Line &l, const Line &m)\\n{\\n return abs(cross(l.b - l.a, m.b - m.a)) > EPS || abs(cross(l.b - l.a, m.b - l.a)) < EPS;\\n}\\n\\ninline bool intersect(const Segment &s, const Point &p)\\n{\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\ninline bool intersect(const Line &l, const Segment &s)\\n{\\n return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < EPS;\\n}\\n\\ninline Real distance(const Line &l, const Point &p);\\n\\ninline bool intersect(const Circle &c, const Line &l)\\n{\\n return distance(l, c.p) <= c.r + EPS;\\n}\\n\\ninline bool intersect(const Circle &c, const Point &p)\\n{\\n return abs(abs(p - c.p) - c.r) < EPS;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nbool intersect(const Segment &s, const Segment &t)\\n{\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nint intersect(const Circle &c, const Segment &l)\\n{\\n if (norm(projection(l, c.p) - c.p) - c.r * c.r > EPS)\\n return 0;\\n auto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n if (d1 < c.r + EPS && d2 < c.r + EPS)\\n return 0;\\n if (d1 < c.r - EPS && d2 > c.r + EPS || d1 > c.r + EPS && d2 < c.r - EPS)\\n return 1;\\n const Point h = projection(l, c.p);\\n if (dot(l.a - h, l.b - h) < 0)\\n return 2;\\n return 0;\\n}\\n\\n// 共通接戦の本数\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(Circle c1, Circle c2)\\n{\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n Real d = abs(c1.p - c2.p);\\n if (c1.r + c2.r < d)\\n return 4;\\n if (eq(c1.r + c2.r, d))\\n return 3;\\n if (c1.r - c2.r < d)\\n return 2;\\n if (eq(c1.r - c2.r, d))\\n return 1;\\n return 0;\\n}\\n\\ninline Real distance(const Point &a, const Point &b)\\n{\\n return abs(a - b);\\n}\\n\\ninline Real distance(const Line &l, const Point &p)\\n{\\n return abs(p - projection(l, p));\\n}\\n\\ninline Real distance(const Line &l, const Line &m)\\n{\\n return intersect(l, m) ? 0 : distance(l, m.a);\\n}\\n\\ninline Real distance(const Segment &s, const Point &p)\\n{\\n Point r = projection(s, p);\\n if (intersect(s, r))\\n return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_D\\nReal distance(const Segment &a, const Segment &b)\\n{\\n if (intersect(a, b))\\n return 0;\\n return min({distance(a, b.a), distance(a, b.b), distance(b, a.a), distance(b, a.b)});\\n}\\n\\nReal distance(const Line &l, const Segment &s)\\n{\\n if (intersect(l, s))\\n return 0;\\n return min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m)\\n{\\n Real A = cross(l.b - l.a, m.b - m.a);\\n Real B = cross(l.b - l.a, l.b - m.a);\\n if (eq(abs(A), 0.0) && eq(abs(B), 0.0))\\n return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_C\\nPoint crosspoint(const Segment &l, const Segment &m)\\n{\\n return crosspoint(Line(l), Line(m));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\npair<Point, Point> crosspoint(const Circle &c, const Line l)\\n{\\n Point pr = projection(l, c.p);\\n Point e = (l.b - l.a) / abs(l.b - l.a);\\n if (eq(distance(l, c.p), c.r))\\n return {pr, pr};\\n double base = sqrt(c.r * c.r - norm(pr - c.p));\\n return {pr - e * base, pr + e * base};\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c, const Segment &l)\\n{\\n Line aa = Line(l.a, l.b);\\n if (intersect(c, l) == 2)\\n return crosspoint(c, aa);\\n auto ret = crosspoint(c, aa);\\n if (dot(l.a - ret.first, l.b - ret.first) < 0)\\n ret.second = ret.first;\\n else\\n ret.first = ret.second;\\n return ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2)\\n{\\n Real d = abs(c1.p - c2.p);\\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n return {p1, p2};\\n}\\n\\nint n;\\nReal w;\\nvector<Point> p;\\nvector<Real> h;\\n\\nbool ok(Point &q, Real r)\\n{\\n Real x = real(q), y = imag(q);\\n if (r < w)\\n {\\n for (Real d : {x - 0, 100 - x, y - 0, 100 - y})\\n {\\n if (d < r)\\n return false;\\n }\\n }\\n else\\n {\\n for (Real d : {x - 0, 100 - x, y - 0, 100 - y})\\n {\\n if (d < 0)\\n return false;\\n d = sqrt(d * d + (r - w) * (r - w));\\n if (d < r)\\n return false;\\n }\\n }\\n rep(i, n)\\n {\\n Real d;\\n if (r < h[i])\\n {\\n d = distance(q, p[i]);\\n }\\n else\\n {\\n d = distance(q, p[i]);\\n d = sqrt(d * d + (r - h[i]) * (r - h[i]));\\n }\\n if (d < r)\\n return false;\\n }\\n return true;\\n}\\n\\nbool check(Real r)\\n{\\n vector<Circle> c(n);\\n rep(i, n)\\n {\\n Real d;\\n if (r < h[i])\\n {\\n d = r;\\n }\\n else\\n {\\n d = r * r - (r - h[i]) * (r - h[i]);\\n if (d < -EPS)\\n return false;\\n chmax(d, Real(0.0));\\n d = sqrt(d);\\n }\\n d += EPS;\\n c[i] = Circle(p[i], d);\\n }\\n Points ps;\\n rep(i, n) REP(j, i + 1, n)\\n {\\n int res = intersect(c[i], c[j]);\\n if (1 <= res and res <= 3)\\n {\\n auto [p1, p2] = crosspoint(c[i], c[j]);\\n ps.push_back(p1);\\n ps.push_back(p2);\\n }\\n }\\n\\n Line l[4];\\n Real d;\\n if (r < w)\\n d = r;\\n else\\n {\\n d = r * r - (r - w) * (r - w);\\n if (d < -EPS)\\n return false;\\n chmax(d, Real(0.0));\\n d = sqrt(d);\\n }\\n d += EPS;\\n Point LD(d, d), LU(d, 100 - d), RD(100 - d, d), RU(100 - d, 100 - d);\\n l[0] = Line(LU, LD);\\n l[1] = Line(LD, RD);\\n l[2] = Line(RD, RU);\\n l[3] = Line(RU, LU);\\n ps.push_back(LD);\\n rep(li, 4)\\n {\\n rep(i, n)\\n {\\n if (intersect(c[i], l[li]))\\n {\\n auto [p1, p2] = crosspoint(c[i], l[li]);\\n ps.push_back(p1);\\n ps.push_back(p2);\\n }\\n }\\n }\\n\\n for (auto pi : ps)\\n {\\n if (ok(pi, r))\\n return true;\\n }\\n return false;\\n}\\n\\nvoid solve()\\n{\\n cin >> n >> w;\\n if (w == 0)\\n exit(0);\\n p.resize(n);\\n h.resize(n);\\n rep(i, n) cin >> p[i] >> h[i];\\n Real lo = 0, hi = 1e5;\\n rep(ti, 100)\\n {\\n Real mi = (lo + hi) / 2.0;\\n if (check(mi))\\n lo = mi;\\n else\\n hi = mi;\\n }\\n cout << hi << \\\"\\\\n\\\";\\n}\\n\\nint main()\\n{\\n while (1)\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.8355,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1342_4828612\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\nconst long double PI = acos(-1.0L);\\nll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }\\nll LCM(ll a, ll b) { return a/GCD(a, b)*b; }\\n\\nusing CP = complex<long double>;\\n\\nconst long double EPS = 1e-10; // 許容する誤差ε\\n#define EQ(a, b) (abs((a)-(b)) < EPS) // 2つのスカラーが等しいかどうか\\n#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag())) // 2つのベクトルが等しいかどうか\\n\\n// double length = abs(a); // ベクトルaの絶対値\\n// double distance = abs(a-b); // 2点a,b間の距離\\n// CP b = a/abs(a); // ベクトルaの単位ベクトル\\n// CP n1 = a*CP(0,+1); CP n2 = a*CP(0,-1); // ベクトルaの法線ベクトル\\n// CP un1 = (a*CP(0,+1)/abs(a)); CP un2 = (a*CP(0,-1)/abs(a)); // ベクトルaの単位法線ベクトル\\n\\n// 内積(dot product) : a・b = |a||b|cosΘ\\nlong double dot(CP a, CP b) {\\n return (a.real()*b.real() + a.imag()*b.imag());\\n}\\n\\n// 外積(cross product) : a×b = |a||b|sinΘ\\nlong double cross(CP a, CP b) {\\n return (a.real()*b.imag() - a.imag()*b.real());\\n}\\n\\n// 直線の表現\\nstruct Segment {\\n CP s, t;\\n Segment(long double sx = 0.0L, long double sy = 0.0L,\\n long double tx = 0.0L, long double ty = 0.0L)\\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\\n Segment(CP _s, CP _t) : s(_s), t(_t) {}\\n}; typedef Segment Line;\\n\\n// 2直線の直交判定 : a⊥b ⇔ dot(a,b) = 0\\nint is_orthogonal(CP a1, CP a2, CP b1, CP b2) {\\n return EQ(dot(a1-a2, b1-b2), 0.0);\\n}\\n\\n// 2直線の平行判定 : a//b ⇔ cross(a,b) = 0\\nint is_parallel(CP a1, CP a2, CP b1, CP b2) {\\n return EQ(cross(a1-a2, b1-b2), 0.0);\\n}\\n\\n// 点cが直線a,b上にあるかないか\\nint is_point_on_line(CP a, CP b, CP c) {\\n return EQ(cross(b-a, c-a), 0.0);\\n}\\n\\n// 点cが線分a,b上にあるかないか\\nint is_point_on_lines(CP a, CP b, CP c) {\\n // |a-c|+|c-b| <= |a-b|なら線分上\\n return (abs(a-c)+abs(c-b) < abs(a-b)+EPS);\\n}\\n\\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交差判定\\nint is_intersected_lines(CP a1, CP a2, CP b1, CP b2) {\\n if(is_parallel(a1, a2, b1, b2)) {\\n // 平行なので線分の重なり判定\\n return is_point_on_lines(a1, a2, b1) || is_point_on_lines(a1, a2, b2) ||\\n is_point_on_lines(b1, b2, a1) || is_point_on_lines(b1, b2, a2);\\n }\\n return (cross(a2-a1, b1-a1)*cross(a2-a1, b2-a1) < EPS) &&\\n (cross(b2-b1, a1-b1)*cross(b2-b1, a2-b1) < EPS);\\n}\\n\\n// a1,a2を端点とする線分とb1,b2を端点とする線分の交点計算\\nCP intersection_lines(CP a1, CP a2, CP b1, CP b2) {\\n CP b = b2-b1;\\n long double d1 = abs(cross(b, a1-b1));\\n long double d2 = abs(cross(b, a2-b1));\\n long double t = d1/(d1+d2);\\n return a1+(a2-a1)*t;\\n}\\n\\n// a1,a2を通る直線とb1,b2を通る直線の交差判定\\nint is_intersected_line(CP a1, CP a2, CP b1, CP b2) {\\n return !EQ(cross(a1-a2, b1-b2), 0.0);\\n}\\n\\n// a1,a2を通る直線とb1,b2を通る直線の交点計算(平行ではない前提)\\nCP intersection_line(CP a1, CP a2, CP b1, CP b2) {\\n CP a = a2-a1; CP b = b2-b1;\\n return a1 + a*cross(b, b1-a1)/cross(b, a);\\n}\\n\\n// 点a,bを通る直線と点cとの距離\\nlong double distance_line_p(CP a, CP b, CP c) {\\n return abs(cross(b-a, c-a))/abs(b-a);\\n}\\n\\n// 点a,bを端点とする線分と点cとの距離\\nlong double distance_lines_p(CP a, CP b, CP c) {\\n if(dot(b-a, c-a) < EPS) return abs(c-a);\\n if(dot(a-b, c-b) < EPS) return abs(c-b);\\n return abs(cross(b-a, c-a))/abs(b-a);\\n}\\n\\n// 点a1,a2を端点とする線分と点b1,b2を端点とする線分の最短距離\\nlong double distance_lines_lines(CP a1, CP a2, CP b1, CP b2) {\\n long double res = 1e18;\\n if(is_intersected_lines(a1, a2, b1, b2)) return 0.0L;\\n res = min(res, distance_lines_p(a1, a2, b1));\\n res = min(res, distance_lines_p(a1, a2, b2));\\n res = min(res, distance_lines_p(b1, b2, a1));\\n res = min(res, distance_lines_p(b1, b2, a2));\\n return res;\\n}\\n\\n// s,tを通る直線に対する点pの射影\\nCP projection(CP s, CP t, CP p) {\\n if(EQV(s, t)) return s;\\n CP base = t-s;\\n return s + base*(dot(p-s, base)/norm(base));\\n}\\n\\n// s,tを通る直線に対する点pの反射\\nCP reflection(CP s, CP t, CP p) {\\n CP tmp = projection(s, t, p) - p;\\n return p + tmp*2.0L;\\n}\\n\\n// 角度Θ回転\\nCP translate(CP v, long double theta) {\\n CP res = v * CP(cosl(theta), sinl(theta));\\n return res;\\n}\\n\\n// n多角形の面積計算\\nlong double polygon_area(const vector<CP> &v) {\\n int n = v.size();\\n long double res = 0;\\n for(int i = 0; i < n; ++i) {\\n res += cross(v[(i+n-1)%n], v[(i+n)%n]);\\n }\\n return fabsl(res)/2.0L;\\n}\\n\\n// n多角形の凸性判定\\nint is_convex(const vector<CP> &v) {\\n int n = v.size();\\n for(int i = 0; i < n; ++i) {\\n if(cross(v[(i+1)%n]-v[i], v[(i+2)%n]-v[(i+1)%n]) < -EPS) return 0;\\n }\\n return 1;\\n}\\n\\n// 凸包(全ての頂点が一直線に並ぶときは例外)\\nvector<CP> convex_hull(vector<CP> &v) {\\n // x座標→y座標で頂点をソート\\n auto lmd = [&](const CP &l, const CP &r) {\\n if(l.imag() != r.imag()) return l.imag() < r.imag();\\n return l.real() < r.real();\\n return l.imag() < r.imag();\\n };\\n vector<CP> res; // 凸包を構成する頂点\\n int n = v.size();\\n sort(v.begin(), v.end(), lmd);\\n bool flgx = true;\\n for(int i = 0; i < n; ++i) {\\n if(v[i].real() != v[(i+1)%n].real()) {\\n flgx = false;\\n break;\\n }\\n }\\n bool flgy = true;\\n for(int i = 0; i < n; ++i) {\\n if(v[i].imag() != v[(i+1)%n].imag()) {\\n flgy = false;\\n break;\\n }\\n }\\n if(flgx || flgy) {\\n res.emplace_back(v[0]);\\n res.emplace_back(v[n-1]);\\n return res;\\n }\\n int k = 0;\\n res.resize(n*2);\\n // 下側凸包\\n for(int i = 0; i < n; ++i) {\\n while(k > 1 && cross(res[k-1]-res[k-2], v[i]-res[k-1]) < 0) {\\n --k;\\n }\\n res[k++] = v[i];\\n }\\n // 上側凸包\\n for(int i = n-2, t = k; i >= 0; --i) {\\n while(k > t && cross(res[k-1]-res[k-2], v[i]-res[k-1]) < 0) {\\n --k;\\n }\\n res[k++] = v[i];\\n }\\n res.resize(k-1);\\n return res;\\n}\\n\\n// 凸多角形の直径\\nlong double convex_diameter(vector<CP> &v) {\\n vector<CP> cv = convex_hull(v);\\n int n = cv.size();\\n if(n == 2) return abs(cv[0]-cv[1]); // 凸包が潰れている例外処理\\n int i = 0, j = 0; // x軸方向に最も遠い点対\\n for(int k = 0; k < n; ++k) {\\n if(cv[k].real() < cv[i].real()) i = k;\\n if(cv[k].real() > cv[j].real()) j = k;\\n }\\n long double res = 0;\\n int si = i, sj = j;\\n while(i != sj || j != si) { // 180度回転で終了\\n res = max(res, abs(cv[i]-cv[j]));\\n if(cross(cv[(i+1)%n]-cv[i], cv[(j+1)%n]-cv[j]) < 0) {\\n (++i) %= n;\\n }else {\\n (++j) %= n;\\n }\\n }\\n return res;\\n}\\n\\n// 凸多角形を点s,tを通る直線で切断(左側が取得できる)\\nvector<CP> convex_cut(const vector<CP> &v, const CP &s, const CP &t) {\\n vector<CP> res;\\n int n = v.size();\\n for(int i = 0; i < n; ++i) {\\n CP nows = v[i], nowt = v[(i+1)%n];\\n if(cross(t-s, nows-s) >= -EPS) res.emplace_back(nows);\\n if(cross(t-s, nows-s)*cross(t-s, nowt-s) < 0) {\\n res.emplace_back(intersection_line(s, t, nows, nowt));\\n }\\n }\\n return res;\\n}\\n\\n// n多角形に対する点pの包含関係(自己交差多角形は例外)\\nint contain_polygon_point(const vector<CP> &v, CP p) {\\n int contain = 0, on_segment = 0;\\n int n = v.size();\\n for(int i = 0; i < n; ++i) {\\n on_segment |= is_point_on_lines(v[i], v[(i+1)%n], p); // 辺上判定\\n CP s = v[i]-p, t = v[(i+1)%n]-p;\\n if(s.imag() > t.imag()) swap(s, t); // 下側を基準にする\\n if(s.imag()*t.imag() <= 0 && t.imag() > 0 && cross(s, t) > 0) {\\n contain = !contain; // 交差回数が奇数なら内側\\n }\\n }\\n if(on_segment) return 1; // 辺上\\n if(contain) return 2; // 内側\\n return 0; // 外側\\n}\\n\\n// 最近点対距離\\nlong double closest_pair(vector<CP> &v, int l = -1, \\n int r = -1, bool reqsqrt = 0) {\\n if(l == r && l == -1) {\\n l = 0; r = v.size(); reqsqrt = 1;\\n // x座標→y座標で昇順ソート\\n auto lmd = [&](const CP &l, const CP &r) {\\n if(l.real() != r.real()) return l.real() < r.real();\\n return l.imag() < r.imag();\\n };\\n sort(v.begin(), v.end(), lmd);\\n }\\n if(r-l < 2) return 1e18; // 2点存在しない\\n if(r-l == 2) { // ちょうど2点の時\\n if(v[l].imag() > v[l+1].imag()) swap(v[l], v[l+1]);\\n if(reqsqrt) return abs(v[l]-v[l+1]);\\n return norm(v[l]-v[l+1]);\\n }\\n // 2点以上に関して分割統治法\\n int mid = (l+r)/2;\\n long double x = v[mid].real(); // 分断する線のx座標\\n // 左半分，右半分について再帰，同一領域内の最小距離resを求める\\n long double res = min(closest_pair(v, l, mid), closest_pair(v, mid, r));\\n auto f = [](CP pl, CP pr) { return pl.imag() < pr.imag(); };\\n inplace_merge(v.begin()+l, v.begin()+mid, v.begin()+r, f);\\n vector<CP> tmp;\\n // 異なる領域の2点について最小距離res未満で探索\\n for(int i = l; i < r; ++i) {\\n long double dx = abs(v[i].real()-x);\\n int tsize = tmp.size();\\n if(dx*dx >= res) continue;\\n for(int j = 0; j < tsize; ++j) {\\n CP delta = v[i]-tmp[tsize-1-j];\\n if(delta.imag()*delta.imag() >= res) break;\\n res = min(res, norm(delta));\\n }\\n tmp.emplace_back(v[i]);\\n }\\n if(reqsqrt) res = sqrtl(res);\\n return res;\\n}\\n\\n// 円の表現\\nstruct Circle {\\n CP o;\\n long double r;\\n Circle(long double _x = 0.0L, long double _y = 0.0L,\\n long double _r = 0.0L)\\n : o(CP(_x, _y)), r(_r) {}\\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\\n}; typedef vector<CP> Polygon;\\n\\n// 2円の位置関係\\nint is_cross_circles(Circle l, Circle r) {\\n long double distlr = abs(l.o-r.o);\\n if(l.r+r.r+EPS < distlr) return 4; // 交点無し外側\\n if(r.r+distlr+EPS < l.r) return -2; // 交点無し内側(R in L)\\n if(l.r+distlr+EPS < r.r) return 2; // 交点無し内側(L in R)\\n if(abs(l.r+r.r-distlr) < EPS) return 3; // 外接\\n if(abs(l.r+distlr-r.r) < EPS) return -1; // 内接(R in L)\\n if(abs(r.r+distlr-l.r) < EPS) return 1; // 内接(L in R)\\n return 0; // 2点で交わる\\n}\\n\\n// 円に対する点の包含\\nbool contain_point(Circle c, CP p) {\\n long double dist = abs(c.o-p);\\n return dist < c.r+EPS;\\n}\\n\\n// 円と直線の交点\\nvector<CP> intersection_circle_line(Circle ci, CP s, CP t) {\\n vector<CP> res(2); // 1点の場合同じ座標\\n res[0] = res[1] = projection(s, t, ci.o); // 2等分点の座標\\n long double d = ci.r*ci.r - norm(res[0]-ci.o);\\n if(d <= EPS || t == s) return res;\\n CP ust = (t-s)/abs(t-s); // stの単位ベクトル\\n res[0] += (ust*sqrtl(d));\\n res[1] -= (ust*sqrtl(d));\\n if(res[0].real() > res[1].real() ||\\n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\\n swap(res[0], res[1]);\\n }\\n return res;\\n}\\n\\n// 2円の交点(1つは交点が存在する)\\nvector<CP> intersection_circle_circle(Circle c1, Circle c2) {\\n vector<CP> res(2); // 1点の場合同じ座標\\n long double d = abs(c1.o-c2.o);\\n long double arg = acosl((c1.r*c1.r+d*d-c2.r*c2.r)/(2.0L*c1.r*d));\\n CP c1p = (c2.o-c1.o)*CP(cosl(arg), sinl(arg));\\n CP uc1p = c1p/abs(c1p); // c1の中心から交点p方向への単位ベクトル\\n res[0] = c1.o + c1.r*uc1p;\\n res[1] = reflection(c1.o, c2.o, res[0]); // p,qの位置関係は反射\\n if(res[0].real() > res[1].real() ||\\n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\\n swap(res[0], res[1]);\\n }\\n return res;\\n}\\n\\n// 線分lrの垂直二等分線\\nLine vertical_bisector(CP l, CP r) {\\n Circle c1 = Circle(l, abs(l-r)), c2 = Circle(r, abs(l-r));\\n vector<CP> res = intersection_circle_circle(c1, c2);\\n if(cross(r-l, res[0]-l) > 0) swap(res[0], res[1]);\\n return Line(res[0], res[1]);\\n}\\n\\n// 点pを通る円の接線の接点\\nvector<CP> contact_circle_point(Circle ci, CP p) {\\n vector<CP> res(2);\\n long double d = abs(ci.o-p);\\n if(abs(d-ci.r) <= EPS) {\\n res[0] = res[1] = p;\\n }else if(d < ci.r) {\\n res[0] = res[1] = CP(-1e18, -1e18);\\n }else {\\n long double arg = asinl(ci.r/d);\\n CP p0 = (ci.o-p)*CP(cosl(arg), sinl(arg));\\n CP up0 = p0/abs(p0);\\n res[0] = p + d*cosl(arg)*up0;\\n res[1] = reflection(p, ci.o, res[0]);\\n if(res[0].real() > res[1].real() || \\n (res[0].real() == res[1].real() && res[0].imag() > res[1].imag())) {\\n swap(res[0], res[1]);\\n }\\n }\\n return res;\\n}\\n\\n// 2円の共通接線\\nvector<Line> tangent_circle_circle(Circle cl, Circle cr) {\\n vector<Line> res;\\n if(cl.r < cr.r) swap(cl, cr);\\n long double g = abs(cl.o-cr.o);\\n if(abs(g-0.0L) <= EPS) return res; // 内包\\n CP hor = (cr.o-cl.o)/g;\\n CP ver = hor*CP(cosl(PI*0.5L), sinl(PI*0.5L));\\n for(int s : {-1, 1}) {\\n long double h = (cl.r + (long double)s*cr.r)/g;\\n if(abs(1-h*h) <= EPS) {\\n // 2円が接しているときの共通接線\\n res.emplace_back(cl.o + hor*cl.r, cl.o + (hor+ver)*cl.r);\\n }else if(1-h*h > 0) {\\n // 内側に引かれる2接線+外側に引かれる2接線\\n CP nhor = hor*h, nver = ver*sqrtl(1-h*h);\\n res.emplace_back(cl.o + (nhor+nver)*cl.r, \\n cr.o - (nhor+nver)*(cr.r*(long double)s));\\n res.emplace_back(cl.o + (nhor-nver)*cl.r, \\n cr.o - (nhor-nver)*(cr.r*(long double)s));\\n }\\n }\\n return res;\\n}\\n\\n// 三角形の内接円\\nCircle inscribed_circle(CP A, CP B, CP C) {\\n if(cross(B-A, C-A) < 0) swap(B, C);\\n long double a = abs(B-C), b = abs(C-A), c = abs(A-B);\\n long double alpha = acosl((b*b+c*c-a*a)/(2.0L*b*c));\\n long double beta = acosl((c*c+a*a-b*b)/(2.0L*c*a));\\n // AとxABを通る直線とBとxBCを通る直線の交点が内心\\n CP I = intersection_line(A, A+translate(B-A, alpha/2.0L), B, B+translate(C-B, beta/2.0L));\\n // ABとIの最短距離が内心半径\\n long double Ir = distance_lines_p(A, B, I);\\n return Circle(I, Ir);\\n}\\n\\n// 三角形の外接円\\nCircle circumscribed_circle(CP A, CP B, CP C) {\\n // 2つの垂直二等分線の交点\\n Line AB = vertical_bisector(A, B);\\n Line BC = vertical_bisector(B, C);\\n CP O = intersection_line(AB.s, AB.t, BC.s, BC.t);\\n long double Or = abs(A-O);\\n return Circle(O, Or);\\n}\\n\\n// 2円の共通面積\\nlong double common_area(Circle cl, Circle cr) {\\n if(cl.r < cr.r) swap(cl, cr);\\n int num = is_cross_circles(cl, cr);\\n if(num >= 3) return 0.0L;\\n if(num >= 1) return PI*cr.r*cr.r;\\n if(num < 0) return PI*cl.r*cl.r;\\n long double d = abs(cl.o-cr.o);\\n long double res = 0.0L;\\n for(int i = 0; i < 2; ++i) {\\n long double theta = 2.0L * acosl((d*d+cl.r*cl.r-cr.r*cr.r)/(2.0L*d*cl.r));\\n res += (theta-sinl(theta))*cl.r*cl.r/2.0L;\\n swap(cl, cr);\\n }\\n return res;\\n}\\n\\n// 円と多角形の共通面積\\nlong double common_area(Polygon p, Circle c) {\\n if(p.size() < 3) return 0.0L;\\n function<long double(Circle, CP, CP)> dfs = [&](Circle c, CP a, CP b) {\\n CP va = c.o-a, vb = c.o-b;\\n long double f = cross(va, vb), res = 0;\\n if(EQ(f, 0.0)) return res;\\n if(max(abs(va), abs(vb)) < c.r+EPS) return f;\\n CP d(dot(va, vb), cross(va, vb));\\n if(distance_lines_p(a, b, c.o) > c.r-EPS) {\\n return c.r*c.r*(atan2(d.imag(), d.real()));\\n }\\n auto u = intersection_circle_line(c, a, b);\\n if(u.empty()) return res;\\n if(u.size() > 1 && dot(u[1]-u[0], a-u[0]) > 0) swap(u[0], u[1]);\\n u.emplace(u.begin(), a);\\n u.emplace_back(b);\\n for(int i = 1; i < (int)u.size(); ++i) res += dfs(c, u[i-1], u[i]);\\n return res;\\n };\\n long double res = 0.0L;\\n for(int i = 0; i < (int)p.size(); ++i) res += dfs(c, p[i], p[(i+1)%p.size()]);\\n return res/2;\\n}\\n\\n// 3点の位置関係を判定\\nint calc_clockwise(CP p0, CP p1, CP p2) {\\n CP x = p1-p0, y = p2-p0;\\n if(cross(x, y) > EPS) return 1; // \\\"COUNTER_CLOCKWISE\\\"\\n if(cross(x, y) < -EPS) return -1; // \\\"CLOCKWISE\\\"\\n if(dot(x, y) < 0) return 2; // \\\"ONLINE_BACK\\\"\\n if(norm(x) < norm(y)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\" \\n}\\n\\nint n;\\nlong double w;\\nstruct xyz {\\n CP pos;\\n long double z;\\n};\\n\\nint main() {\\n while(1) {\\n cin >> n >> w;\\n if(n == 0 && w == 0) break;\\n vector<xyz> needles;\\n for(int i = 0; i < n; ++i) {\\n long double x, y, h;\\n cin >> x >> y >> h;\\n xyz indata;\\n indata.pos = CP(x, y);\\n indata.z = h;\\n needles.emplace_back(indata);\\n } \\n\\n // (0,0), (0,100), (100,0), (100,100)に囲まれている\\n // 針を中心とした円の交点と4隅から半径r縮小した正方形との交点が候補になる\\n long double low = 0.0L, high = 1e9;\\n for(int i = 0; i < 100; ++i) {\\n long double mid = (low+high)/2.0L;\\n auto isOK = [&](long double R) {\\n // 2分探索用のチェック\\n vector<Circle> cs(n);\\n for(int i = 0; i < n; ++i) {\\n if(needles[i].z <= R) cs[i].r = sqrtl(2.0L*R*needles[i].z - needles[i].z*needles[i].z);\\n else cs[i].r = R;\\n cs[i].o = needles[i].pos;\\n }\\n\\n long double margin = (w <= R ? sqrtl(2.0L*R*w - w*w) : R);\\n if(margin >= 50.0L) return false; // 半径が50を超えることはない\\n\\n vector<Segment> ss;\\n ss.emplace_back(Segment(CP(margin, margin), CP(100.0L-margin)));\\n ss.emplace_back(Segment(CP(margin, margin), CP(margin, 100.0L-margin)));\\n ss.emplace_back(Segment(CP(100.0L-margin, margin), CP(100.0L-margin, 100.0L-margin)));\\n ss.emplace_back(Segment(CP(margin, 100.0L-margin), CP(100.0L-margin, 100.0L-margin)));\\n\\n vector<CP> ps; // 調べるべき交点\\n // 小さい正方形の4隅\\n ps.emplace_back(CP(margin, margin));\\n ps.emplace_back(CP(margin, 100.0L-margin));\\n ps.emplace_back(CP(100.0L-margin, margin));\\n ps.emplace_back(CP(100.0L-margin, 100.0L-margin));\\n\\n // 円と正方形の交点を列挙する\\n for(int i = 0; i < n; ++i) {\\n for(int j = 0; j < 4; ++j) {\\n vector<CP> inps = intersection_circle_line(cs[i], ss[j].s, ss[j].t);\\n for(auto p : inps) ps.emplace_back(p);\\n }\\n }\\n for(int i = 0; i < n; ++i) {\\n for(int j = i+1; j < n; ++j) {\\n vector<CP> inps = intersection_circle_circle(cs[i], cs[j]);\\n for(auto p : inps) ps.emplace_back(p);\\n }\\n }\\n\\n bool ok = false;\\n for(auto p : ps) {\\n bool flg = true;\\n for(int i = 0; i < n; ++i) {\\n if(abs(p-cs[i].o) < cs[i].r-EPS) flg = false;\\n }\\n if(flg) {\\n if(p.real() >= margin-EPS && p.real()-EPS <= 100.0L-margin &&\\n p.imag() >= margin-EPS && p.imag()-EPS <= 100.0L-margin) {\\n ok = true;\\n }\\n }\\n }\\n return ok;\\n };\\n if(isOK(mid)) low = mid;\\n else high = mid;\\n }\\n\\n cout << fixed << setprecision(5) << low << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7810,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -1.3682,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1342_4127956\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (1e+18) + 7;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\n//typedef vector<vector<ll>> mat;\\ntypedef vector<int> vec;\\n\\nll mod_pow(ll a, ll n) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * a%mod;\\n\\t\\ta = a * a%mod; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n%mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, int n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a*a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\n//ll inv(ll a, ll p) {\\n//\\treturn (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);\\n//}\\n//modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\nusing Point = complex<ld>;\\nld dot(Point a, Point b) { return real(conj(a)*b); }\\nld cross(Point a, Point b) { return imag(conj(a)*b); }\\nstruct Line {\\n\\tPoint a, b;\\n};\\nstruct Circle {\\n\\tPoint p; ld r;\\n};\\n\\nPoint proj(Line l, Point p) {\\n\\tld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + t * (l.a - l.b);\\n}\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\nvector<Point> is_lc(Circle c, Line l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d > c.r + eps)return res;\\n\\tld len = (d > c.r) ? 0.0 : sqrt(c.r*c.r - d * d);\\n\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\tres.push_back(proj(l, c.p) + len * nor);\\n\\tres.push_back(proj(l, c.p) - len * nor);\\n\\treturn res;\\n}\\nvector<Point> is_cc(Circle c1, Circle c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d*d + c1.r*c1.r - c2.r*c2.r) / (2 * d);\\n\\tld dfr = c1.r*c1.r - rc * rc;\\n\\tif (abs(dfr) < eps)dfr = 0.0;\\n\\tif (dfr < 0.0)return res;\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0)res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\nbool is_in(Circle c, Point p) {\\n\\tld dist = abs(c.p - p);\\n\\treturn dist < c.r;\\n}\\n\\nint n;ld w;\\nint x[10], y[10], h[10];\\nCircle c[10];\\n\\nbool can(ld r) {\\n\\tld le;\\n\\tif (r < w)le = r;\\n\\telse {\\n\\t\\tle = sqrt(pow(r, 2) - pow(r - w, 2));\\n\\t}\\n\\tif (le >= 50)return false;\\n\\trep(i, n) {\\n\\t\\tc[i].p = { (ld)x[i],(ld)y[i] };\\n\\t\\tif (r < h[i])c[i].r = r;\\n\\t\\telse c[i].r = sqrt(pow(r, 2) - pow(r - h[i], 2));\\n\\t}\\n\\n\\tld ri = 100 - le;\\n\\tPoint p[4] = { {le,le},{le,ri},{ri,le},{ri,ri} };\\n\\tLine l[4] = { {p[0],p[1]},{p[0],p[2]},{p[3],p[1]},{p[3],p[2]} };\\n\\trep(i, 4) {\\n\\t\\tbool f = true;\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (is_in(c[j], p[i])) {\\n\\t\\t\\t\\tf = false; break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (f)return true;\\n\\t}\\n\\trep(i, 4) {\\n\\t\\trep(j, n) {\\n\\t\\t\\tvector<Point> v = is_lc(c[j], l[i]);\\n\\t\\t\\trep(k, v.size()) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (real(v[k]) < le || real(v[k])>ri)continue;\\n\\t\\t\\t\\tif (imag(v[k]) < le || imag(v[k]) > ri)continue;\\n\\t\\t\\t\\tbool f = true;\\n\\t\\t\\t\\trep(l, n) {\\n\\t\\t\\t\\t\\tif (l == j)continue;\\n\\t\\t\\t\\t\\tif (is_in(c[l], v[k])) {\\n\\t\\t\\t\\t\\t\\tf = false; break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (f)return true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\trep(i, n)Rep(j,i+1, n) {\\n\\t\\tvector<Point> v = is_cc(c[i], c[j]);\\n\\t\\trep(k, v.size()) {\\n\\t\\t\\tif (real(v[k]) < le || real(v[k])>ri)continue;\\n\\t\\t\\tif (imag(v[k]) < le || imag(v[k]) > ri)continue;\\n\\t\\t\\tbool f = true;\\n\\t\\t\\trep(l, n) {\\n\\t\\t\\t\\tif (l == i || l == j)continue;\\n\\t\\t\\t\\tif (is_in(c[l], v[k])) {\\n\\t\\t\\t\\t\\tf = false; break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (f)return true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\nvoid solve() {\\n\\tcin >> w;\\n\\trep(i, n) {\\n\\t\\tcin >> x[i] >> y[i] >> h[i];\\n\\t}\\n\\tld le = 0, ri = (w*w+2500)/(2*w);\\n\\trep (aa,100) {\\n\\t\\tld mid = (le + ri) / 2;\\n\\t\\tif (can(mid))le = mid;\\n\\t\\telse ri = mid;\\n\\t}\\n\\tcout << le << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(5);\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\twhile (cin >> n, n)solve();\\n\\t//solve();\\n\\tstop\\n\\t\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.1326,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1342_4104827\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i< (n);i++)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<double,double> P;\\nconst double EPS = 1e-8;\\n\\n//補助用演算関数を作っとく.\\ndouble dist(P x,P y){\\n double x1=x.first,x2=x.second,y1=y.first,y2=y.second;\\n double tmp=(x1-y1)*(x1-y1)+(x2-y2)*(x2-y2);\\n return sqrt(tmp);\\n}\\ndouble grp(double x,double y){\\n //斜辺と一辺が与えられたときにもう一個の辺の長さを返す関数。\\n //初めから作っておくべきであった.\\n //xを斜辺とする.\\n double ans = x*x-y*y;\\n if(ans<0){\\n cout<<\\\"error!\\\"<<endl;\\n cout<<x<<' '<<y<<endl;\\n //円同士の交点の演算の時にerrorが出ていた.おそらくすっぽり入ってるときか？\\n //やはり円の交点のところを直したらerrorが出なかったので元凶は円.\\n //円と壁のバグなしたのにまだ駄目だ。。。\\n }\\n return sqrt(ans);\\n}\\n\\nint main(){\\n while(true){\\n int n,w;cin>>n>>w;\\n if(n==0 && w==0)break;\\n vector<pair<P,double>> lst(n);\\n rep(i,n){\\n double x,y,h;cin>>x>>y>>h;\\n lst[i] = make_pair(make_pair(x,y),h);\\n }\\n //まずは交点を全て求める.\\n //これらは全てt_midを与えられて計算する.\\n //つまりjudge内で書く必要がある.\\n auto judge=[&](double t_mid){\\n vector<P> cross_lst;\\n double w_now;\\n if(w < t_mid)w_now=grp(t_mid,(t_mid-w));\\n else w_now=t_mid;\\n //円同士の交点を求める\\n for(int i=0;i<n-1;i++){\\n for(int j=i+1;j<n;j++){\\n //円の全ての組み合わせを試す.\\n pair<P,double> r1 = lst[i];\\n pair<P,double> r2 = lst[j];\\n //半径は修正.\\n double r1_now;\\n if(r1.second < t_mid)r1_now=grp(t_mid,(t_mid-r1.second));\\n else r1_now=t_mid;\\n double r2_now;\\n if(r2.second < t_mid)r2_now=grp(t_mid,(t_mid-r2.second));\\n else r2_now=t_mid;\\n //交点を持たない場合はここでcontinue↓\\n double dis = dist(r1.first,r2.first);\\n //判定します.\\n if(abs(r1_now-r2_now) > dis || (r1_now+r2_now) < dis)continue;\\n double a = (dis*dis+r1_now*r1_now-r2_now*r2_now)/2;\\n double b = dis*dis*r1_now*r1_now-a*a;\\n double x1 = r2.first.first,x0 = r1.first.first,y1=r2.first.second,y0=r1.first.second;\\n P tg1 = make_pair(((a*(x1-x0)+(y1-y0)*sqrt(b))/(dis*dis)+x0),((a*(y1-y0)-(x1-x0)*sqrt(b))/(dis*dis)+y0));\\n P tg2 = make_pair(((a*(x1-x0)-(y1-y0)*sqrt(b))/(dis*dis)+x0),((a*(y1-y0)+(x1-x0)*sqrt(b))/(dis*dis)+y0));\\n cross_lst.push_back(tg1);\\n cross_lst.push_back(tg2);\\n //done\\n }\\n }\\n \\n //次、壁と円の交点を求める.\\n rep(i,n){\\n pair<P,double> r=lst[i];\\n //下の壁との交点\\n double r_now;\\n if(r.second < t_mid)r_now=grp(t_mid,(t_mid-r.second));\\n else r_now=t_mid;\\n double distwithwall = abs(r.first.second-w_now);\\n if(distwithwall<=r_now){\\n P tg1 = make_pair((r.first.first+grp(r_now,distwithwall)),w_now);\\n P tg2 = make_pair((r.first.first-grp(r_now,distwithwall)),w_now);\\n cross_lst.push_back(tg1);\\n cross_lst.push_back(tg2);\\n }\\n //上の壁との交点\\n distwithwall = abs(r.first.second-(100-w_now));\\n if(distwithwall<=r_now){\\n P tg1 = make_pair((r.first.first+grp(r_now,distwithwall)),100-w_now);\\n P tg2 = make_pair((r.first.first-grp(r_now,distwithwall)),100-w_now);\\n cross_lst.push_back(tg1);\\n cross_lst.push_back(tg2);\\n }\\n //左の壁との交点\\n distwithwall = abs(r.first.first-w_now);\\n if(distwithwall<=r_now){\\n P tg1 = make_pair(w_now,(r.first.second+grp(r_now,distwithwall)));\\n P tg2 = make_pair(w_now,(r.first.second-grp(r_now,distwithwall)));\\n cross_lst.push_back(tg1);\\n cross_lst.push_back(tg2);\\n }\\n //右の壁との交点\\n distwithwall = abs(r.first.first-(100-w_now));\\n if(distwithwall<=r_now){\\n P tg1 = make_pair(100-w_now,(r.first.second+grp(r_now,distwithwall)));\\n P tg2 = make_pair(100-w_now,(r.first.second-grp(r_now,distwithwall)));\\n cross_lst.push_back(tg1);\\n cross_lst.push_back(tg2);\\n }\\n }\\n //最後に、壁同士の交点を入れておく.\\n cross_lst.push_back(make_pair(w_now,w_now));\\n cross_lst.push_back(make_pair(100-w_now,w_now));\\n cross_lst.push_back(make_pair(w_now,100-w_now));\\n cross_lst.push_back(make_pair(100-w_now,100-w_now));\\n\\n //次に、交点が存在できるかチェック!!\\n int cnt = 0;//ダメだった交点数.これが全部ならout.\\n for(P target : cross_lst){\\n //壁の内側に入っているかcheck!\\n if(w_now>target.first+EPS || target.first>(100-w_now)+EPS || w_now>target.second+EPS || target.second+EPS>(100-w_now)){\\n cnt++;\\n continue;\\n }\\n //円の内部に入らないかチェック!\\n rep(i,n){\\n pair<P,double> r = lst[i];\\n double r_now;\\n if(r.second < t_mid)r_now=grp(t_mid,(t_mid-r.second));\\n else r_now=t_mid;\\n if(dist(r.first,target)+EPS<r_now){\\n cnt++;\\n break;\\n }\\n }\\n }\\n if(cnt == cross_lst.size())return false;\\n return true;\\n };\\n //judgeが描き終わったので二分探索をする.\\n double t_min = 0;//ok\\n double t_max = (1e+9)+5;//絶対out\\n const double D = 1e-6;\\n while(t_min+D<t_max){\\n double t_mid=(t_min+t_max)/2;\\n if(judge(t_mid)){\\n t_min = t_mid;\\n }else{\\n t_max = t_mid;\\n }\\n }\\n cout<<fixed<<setprecision(6)<<t_min<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3244,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":795,"cells":{"group_id":{"kind":"string","value":"aoj_1345_cpp"},"problem_description":{"kind":"string","value":"Problem A:\nBit String Reordering\nYou have to reorder a given bit string as specified. The only operation allowed is swapping adjacent bit pairs. Please write a program that calculates the minimum number of swaps required.\nThe initial bit string is simply represented by a sequence of bits, while the target is specified by a\nrun-length code\n. The run-length code of a bit string is a sequence of the lengths of maximal consecutive sequences of zeros or ones in the bit string. For example, the run-length code of \"011100\" is \"1 3 2\". Note that there are two different bit strings with the same run-length code, one starting with zero and the other starting with one. The target is either of these two.\nIn Sample Input 1, bit string \"100101\" should be reordered so that its run-length code is \"1 3 2\", which means either \"100011\" or \"011100\". At least four swaps are required to obtain \"011100\". On the other hand, only one swap is required to make \"100011\". Thus, in this example, 1 is the answer.\nInput\nThe input consists of a single test case. The test case is formatted as follows.\n$N$ $M$\n$b_1$ $b_2$ . . . $b_N$\n$p_1$ $p_2$ . . . $p_M$\nThe first line contains two integers $N$ ($1 \\leq N \\leq 15$) and $M$ ($1 \\leq M \\leq N$). The second line\nspecifies the initial bit string by $N$ integers. Each integer $b_i$ is either 0 or 1. The third line contains the run-length code, consisting of $M$ integers. Integers $p_1$ through $p_M$ represent the lengths of consecutive sequences of zeros or ones in the bit string, from left to right. Here, $1 \\leq p_j$ for $1 \\leq j \\leq M$ and $\\sum^{M}_{j=1} p_j = N$ hold. It is guaranteed that the initial bit string can be reordered into a bit string with its run-length code $p_1, . . . , p_M$.\nOutput\nOutput the minimum number of swaps required\nSample Input 1\n6 3\n1 0 0 1 0 1\n1 3 2\nSample Output 1\n1\nSample Input 2\n7 2\n1 1 1 0 0 0 0\n4 3\nSample Output 2\n12\nSample Input 3\n15 14\n1 0 1 0 1 0 1 0 1 0 1 0 1 0 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 2\nSample Output 3\n7\nSample Input 4\n1 1\n0\n1\nSample Output 4\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1345_10500246","code_snippet":"#include <iostream>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <ranges>\n#include <map>\nnamespace ranges = std::ranges;\nint N, M;\nstd::vector<int> rle(std::vector<int> a) {\n std::vector<int> res;\n for (int i = 0, j = 0 ; i < N ; i = j) {\n while (j < N and a[i] == a[j]) j++;\n res.push_back(j - i);\n }\n return res;\n}\nint main() {\n std::cin >> N >> M;\n std::vector<int> B(N), P(M);\n for (int i = 0 ; i < N ; i++) std::cin >> B[i];\n for (int i = 0 ; i < M ; i++) std::cin >> P[i];\n std::map<std::vector<int>, int> dist1, dist2;\n std::vector<std::vector<int>> que;\n dist1[B] = 0;\n que.push_back(B);\n for (int t = 0 ; t < std::ssize(que) ; t++) {\n std::vector<int> v = std::move(que[t]);\n const auto d = dist1[v];\n dist2.try_emplace(rle(v), d);\n for (int i = 0 ; i + 1 < N ; i++) {\n std::swap(v[i], v[i + 1]);\n if (!dist1.contains(v)) {\n dist1[v] = d + 1;\n que.push_back(v);\n }\n std::swap(v[i], v[i + 1]);\n }\n }\n std::cout << dist2[P] << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":5632,"score_of_the_acc":-0.2419,"final_rank":16},{"submission_id":"aoj_1345_6785382","code_snippet":"#pragma region template\n#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\n#ifdef __LOCAL\n #include <debug>\n#else\n #define debug(...) void(0)\n#endif\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) v.begin(),v.end()\n\ntemplate<typename T>\nistream& operator>>(istream&is,vector<T>&v){\n for(T&p:v)is>>p;\n return is;\n}\ntemplate<typename T>\nostream& operator<<(ostream&os,const vector<T>&v){\n if(&os==&cerr)os<<\"[\";\n for(int i=0;i<v.size();i++){\n os<<v[i];\n if(i+1<v.size())os<<(&os==&cerr?\",\":\" \");\n }\n if(&os==&cerr)os<<\"]\";\n return os;\n}\n#pragma endregion template\n\nmap<vector<int>,int> mp;\n\nint main(){\n int n,m;cin>>n>>m;\n vector<int> b(n);cin>>b;\n mp[b]=0;\n queue<vector<int>> que;\n que.push(b);\n while(que.size()){\n auto ve=que.front();que.pop();\n REP(i,n-1){\n if(ve[i]==ve[i+1])continue;\n auto cpy=ve;\n swap(cpy[i],cpy[i+1]);\n if(mp.count(cpy))continue;\n mp[cpy]=mp[ve]+1;\n que.push(cpy);\n }\n }\n\n //debug(mp);\n\n vector<int> v(m);cin>>v;\n int ans=1e9;\n for(const auto&[key,val]:mp){\n vector<int> w;\n int cnt=1;\n for(int i=1;i<n;i++){\n if(key[i]!=key[i-1]){\n w.push_back(cnt);\n cnt=0;\n }\n cnt++;\n }\n w.push_back(cnt);\n if(v==w)ans=min(ans,val);\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4444,"score_of_the_acc":-0.1754,"final_rank":11},{"submission_id":"aoj_1345_4429101","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define SZ(x) (int)(x.size())\n#define REP(i, n) for(int i=0;i<(n);++i)\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\n#define RREP(i, n) for(int i=(int)(n)-1;i>=0;--i)\n#define RFOR(i, a, b) for(int i=(int)(b)-1;i>=(a);--i)\n#define ALL(a) a.begin(),a.end()\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n#define DEBUG(x) cerr<<#x<<\" = \"<<(x)<<\" (L\"<<__LINE__<<\")\"<< endl;\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing P = pair<int, int>;\nconst double eps = 1e-8;\nconst ll MOD = 1000000007;\nconst int INF = INT_MAX / 2;\nconst ll LINF = LLONG_MAX / 2;\ntemplate <typename T1, typename T2>\nbool chmax(T1 &a, const T2 &b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate <typename T1, typename T2>\nbool chmin(T1 &a, const T2 &b) {\n if (a > b) { a = b; return true; }\n return false;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n os << \"[\";\n REP(i, SZ(v)) {\n if (i) os << \", \";\n os << v[i];\n }\n return os << \"]\";\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const map<T1, T2> &mp) {\n os << \"{\";\n int a = 0;\n for (auto &tp : mp) {\n if (a) os << \", \";\n a = 1;\n os << tp;\n }\n return os << \"}\";\n}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\n os << p.first << \":\" << p.second;\n return os;\n}\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n int N, M; cin >> N >> M;\n string b;\n vi p(M);\n REP(i, N) {\n char c; cin >> c; b += c;\n }\n REP(i, M) cin >> p[i];\n\n string g1, g2;\n REP(k, M) {\n REP(i, p[k]) {\n g1 += k & 1 ? '0' : '1';\n g2 += k & 1 ? '1' : '0';\n }\n }\n\n using Pi = pair<int,string>;\n priority_queue<Pi, vector<Pi>, greater<Pi>> que;\n map<string,int> dist;\n\n int ans = -1;\n\n que.emplace(0, b); dist[b] = 0;\n while (!que.empty()) {\n string s;\n int cost;\n tie(cost, s) = que.top(); que.pop();\n if (s == g1 or s == g2) {\n ans = cost;\n break;\n }\n\n REP(i, N-1) {\n string tmp = s;\n swap(tmp[i], tmp[i+1]);\n if (dist.count(tmp) == 0 or dist[tmp] > cost + 1) {\n dist[tmp] = cost + 1;\n que.emplace(cost + 1, tmp);\n }\n }\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3880,"score_of_the_acc":-0.1724,"final_rank":10},{"submission_id":"aoj_1345_3272588","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n//幅優先探索\n\nint main(){\n int n, m; cin >> n >> m;\n vector<bool> b(n);\n for(int i = 0; i < n; i++){\n int in; cin >> in;\n b[i] = (bool)in;\n }\n vector<int> p(m);\n for(int i = 0; i < m; i++) cin >> p[i];\n vector<bool> g1;\n vector<bool> g2;\n for(int i = 0; i < m; i++){\n if(i % 2 == 0){\n for(int j = 0; j < p[i]; j++){\n g1.push_back(false);\n g2.push_back(true);\n }\n }else{\n for(int j = 0; j < p[i]; j++){\n g1.push_back(true);\n g2.push_back(false);\n }\n }\n }\n\n set<vector<bool> > used;\n queue<pair<vector<bool>, int> > q;\n q.push({b, 0});\n used.insert(b);\n \n while(!q.empty()){\n\n vector<bool> vec = q.front().first;\n int cost = q.front().second;\n q.pop();\n \n if(vec == g1 || vec == g2){\n cout << cost << endl;\n break;\n }\n\n for(int i = 0; i < n - 1; i++){\n vector<bool> nxt = vec;\n swap(nxt[i], nxt[i + 1]);\n if(used.find(nxt) == used.end()){\n used.insert(nxt);\n q.push({nxt, cost + 1});\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3860,"score_of_the_acc":-0.1998,"final_rank":13},{"submission_id":"aoj_1345_3097601","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef pair<int, int> P;\nconst int INF = 1e9;\n\nint N, M;\nvector<int> p;\n\nsigned main() {\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n cin >> N >> M;\n\n int bit = 0;\n for ( int i = 0; i < N; i++ ) {\n int b;\n cin >> b;\n bit |= (b<<i); \n }\n\n p = vector<int>(M);\n for ( int i = 0; i < M; i++ ) {\n cin >> p[i]; \n }\n\n vector<bool> used(1<<N, false);\n priority_queue<P, vector<P>, greater<P> > Q;\n Q.push({0, bit});\n\n while ( !Q.empty() ) {\n P e = Q.top(); Q.pop();\n int c = e.first, b = e.second; \n\n vector<int> q;\n int cnt = 1;\n bool pre = b&1; \n for ( int i = 1; i < N; i++ ) {\n if ( pre != (bool)(b&(1<<i)) ) {\n\tq.emplace_back(cnt);\n\tpre = !pre;\n\tcnt = 1; \n } else {\n\tcnt++; \n }\n }\n q.emplace_back(cnt);\n\n if ( q == p ) {\n cout << c << endl;\n return 0;\n }\n\n if ( used[b] ) continue;\n used[b] = true;\n\n for ( int i = 0; i < N-1; i++ ) {\n int nxt = b;\n nxt &= ~(1<<i);\n nxt &= ~(1<<(i+1));\n if ( b & (1<<i) ) nxt |= (1<<(i+1));\n if ( b & (1<<(i+1)) ) nxt |= (1<<i);\n Q.push(P(c+1, nxt)); \n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3340,"score_of_the_acc":-0.1421,"final_rank":7},{"submission_id":"aoj_1345_2496816","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n\n#define REP(i,a,b) for(int i=int(a);i<int(b);i++)\n\nusing namespace std;\n\ntypedef long long int lli;\n\nint bitSwap(int num, int p) {\n int t = (num >> p) & 1;\n num -= (t << p);\n int e = (num >> (p + 1)) & 1;\n num -= (e << (p + 1));\n return num + (t << (p + 1)) + (e << p);\n}\n\nint main () {\n int n, m;\n cin >> n >> m;\n int num = 0;\n REP (i, 0, n) {\n int bit;\n cin >> bit;\n num = (num << 1) + bit;\n }\n int s0 = 0, s1 = 0;\n REP (i, 0, m) {\n int p;\n cin >> p;\n REP (j, 0, p) {\n s0 = (s0 << 1) + (i % 2);\n s1 = (s1 << 1) + !(i % 2);\n }\n }\n int size = 1 << n;\n const int inf = 1 << 30;\n vector<int> dp(size, inf);\n dp[s0] = dp[s1] = 0;\n bool run = true;\n while (run) {\n run = false;\n REP (i, 0, size) {\n if (dp[i] == inf) continue;\n REP (j, 0, n - 1) {\n int t = bitSwap(i, j);\n if (dp[t] > dp[i] + 1) {\n dp[t] = dp[i] + 1;\n run = true;\n }\n }\n }\n }\n cout << dp[num] << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3220,"score_of_the_acc":-0.1925,"final_rank":12},{"submission_id":"aoj_1345_2026288","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n\nsigned main() {\n\tint n, m; cin >> n >> m;\n\tvector<bool> bs(n);\n\trep(i, n) {\n\t\tint x; cin >> x;\n\t\tbs[i] = x;\n\t}\n\tvector<bool> a(n), b(n);\n\tint tb = 0;\n\tint idx = 0;\n\trep(i, m) {\n\t\tint p; cin >> p;\n\t\trep(j, p) {\n\t\t\ta[idx] = tb;\n\t\t\tb[idx] = !tb;\n\t\t\tidx++;\n\t\t}\n\t\ttb = !tb;\n\t}\n\tint mb = 1 << 15;\n\t\n\tusing P = pair<vector<bool>, int>;\n\tunordered_map<vector<bool>, int> visited;\n\tqueue<P> que;\n\tque.push(P(bs, 0));\n\tvisited[bs] = 0;\n\tint ans = -1;\n\t\n\twhile (!que.empty()) {\n\t\tP p = que.front(); que.pop();\n\t\tauto& pb = p.first;\n\t\tauto& pc = p.second;\n\t\tif (pb == a || pb == b) {\n\t\t\tans = pc;\n\t\t\tbreak;\n\t\t}\n\t\trep(i, n - 1) {\n\t\t\tvector<bool> next = pb;\n\t\t\tswap(next[i], next[i + 1]);\n\t\t\tint nc = pc + 1;\n\t\t\tif (visited.count(next)) continue;\n\t\t\tvisited[next] = nc;\n\t\t\tque.emplace(next, nc);\n\t\t}\n\t}\n\tcout << ans << endl;\n\t\n\t\n}","accuracy":1,"time_ms":10,"memory_kb":3768,"score_of_the_acc":-0.1375,"final_rank":6},{"submission_id":"aoj_1345_1856191","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\n\n#define rep(i,n) for (int i=0;i<(n);i++)\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\n#define all(a) (a).begin(),(a).end()\n\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef tuple<int, int, int> TUPLE;\ntypedef vector<int> V;\ntypedef vector<V> VV;\ntypedef vector<VV> VVV;\n\nint bfs(V &start, V &run) {\n int N = start.size();\n int M = run.size();\n\n map<V, int> d;\n\tqueue<V> que;\n que.push(start);\n d[start] = 0;\n\n V g1;\n int bit = 0;\n for (auto x : run) {\n rep(k, x) g1.emplace_back(bit);\n bit ^= 1;\n }\n\n V g2 = g1;\n rep(i, N) g2[i] ^= 1;\n\n while (!que.empty()) {\n auto now = que.front(); que.pop();\n if (now == g1 || now == g2) {\n return d[now];\n }\n\n rep(i, N - 1) {\n V nxt(now);\n swap(nxt[i], nxt[i + 1]);\n if (d.count(nxt) == 0) {\n que.push(nxt);\n d[nxt] = d[now] + 1;\n }\n }\n\n }\n\n}\n\nsigned main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n int N, M;\n cin >> N >> M;\n V start(N);\n rep(i, N) cin >> start[i];\n V run(M);\n rep(i, M) cin >> run[i];\n\n cout << bfs(start, run) << endl;\n\n}","accuracy":1,"time_ms":20,"memory_kb":4552,"score_of_the_acc":-0.21,"final_rank":15},{"submission_id":"aoj_1345_1839174","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <map>\n#include <queue>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\ntypedef pair<string, int> P;\n\nvoid solve()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tbool used[10000];\n\tmemset(used, 0, sizeof(used));\n\tint N, M;\n\tcin >> N >> M;\n\tstring goal;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tchar c;\n\t\tcin >> c;\n\t\tgoal += c;\n\t}\n\tstring p;\n\tstring start[2];\n\tbool flag = false;\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tint c;\n\t\tcin >> c;\n\t\tfor (int j = 0; j < c; ++j)\n\t\t{\n\t\t\tif (flag)\n\t\t\t{\n\t\t\t\tstart[0] += '0';\n\t\t\t\tstart[1] += '1';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstart[0] += '1';\n\t\t\t\tstart[1] += '0';\n\t\t\t}\n\t\t}\n\t\tflag = !flag;\n\t}\n\tif (start[0] == goal || start[1] == goal)\n\t{\n\t\tcout << 0 << endl;\n\t\treturn;\n\t}\n\n\tqueue<P> que;\n\tque.push(P(start[0], 0));\n\tque.push(P(start[1], 0));\n\tset<string> found;\n\tfound.insert(start[0]);\n\tfound.insert(start[1]);\n\twhile (!que.empty())\n\t{\n\t\tP digit = que.front();\n\t\tque.pop();\n\t\tfor (int i = 1; i < digit.first.size(); ++i)\n\t\t{\n\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t\tif (found.find(digit.first) != found.end())\n\t\t\t{\n\t\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (digit.first == goal)\n\t\t\t{\n\t\t\t\tcout << digit.second + 1 << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tque.push(P(digit.first, digit.second + 1));\n\t\t\tfound.insert(digit.first);\n\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t}\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}","accuracy":1,"time_ms":30,"memory_kb":2464,"score_of_the_acc":-0.1216,"final_rank":5},{"submission_id":"aoj_1345_1839170","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <map>\n#include <queue>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\ntypedef pair<string, int> P;\n\nvoid solve()\n{\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tbool used[10000];\n\tmemset(used, 0, sizeof(used));\n\tint N, M;\n\tcin >> N >> M;\n\tstring goal;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tchar c;\n\t\tcin >> c;\n\t\tgoal += c;\n\t}\n\tstring p;\n\tstring start[2];\n\tbool flag = false;\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tint c;\n\t\tcin >> c;\n\t\tfor (int j = 0; j < c; ++j)\n\t\t{\n\t\t\tif (flag)\n\t\t\t{\n\t\t\t\tstart[0] += '0';\n\t\t\t\tstart[1] += '1';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstart[0] += '1';\n\t\t\t\tstart[1] += '0';\n\t\t\t}\n\t\t}\n\t\tflag = !flag;\n\t}\n\n\tqueue<P> que;\n\tque.push(P(start[0], 0));\n\tque.push(P(start[1], 0));\n\tset<string> found;\n\tfound.insert(start[0]);\n\tfound.insert(start[1]);\n\twhile (!que.empty())\n\t{\n\t\tP digit = que.front();\n\t\tque.pop();\n\t\tfor (int i = 1; i < digit.first.size(); ++i)\n\t\t{\n\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t\tif (found.find(digit.first) != found.end())\n\t\t\t{\n\t\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (digit.first == goal)\n\t\t\t{\n\t\t\t\tcout << digit.second + 1 << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tque.push(P(digit.first, digit.second + 1));\n\t\t\tfound.insert(digit.first);\n\t\t\tswap(digit.first[i - 1], digit.first[i]);\n\t\t}\n\t}\n}\n\nint main()\n{\n\tsolve();\n\treturn(0);\n}","accuracy":0.09,"time_ms":20,"memory_kb":2180,"score_of_the_acc":-0.0772,"final_rank":19},{"submission_id":"aoj_1345_1837330","code_snippet":"#include<iostream>\n#include<math.h>\n#include<queue>\n#include<map>\nusing namespace std;\ntypedef pair<int,int> i_i;\n#define mp(a,b) make_pair(a,b)\nint main(){\n int n,m;\n cin >> n >> m;\n int step[1<<15];\n int inf = 1<<10;\n fill(step,step+(1<<15),inf);\n int i,j,k,c=0,b=0;\n int in=0;\n int o1=0,o2=0;\n for(i=0;i<n;i++) {\n cin >> k;\n b+=k;\n in=in<<1;\n in+=k;\n }\n /*\n for(i=n-1;i>=0;i--) cout << ((in>>i&1) ? 1:0);\n cout << endl;\n */\n //step[in]=0;\n for(i=0;i<m;i++) {\n cin >> k;\n o1=o1<<k;\n o2=o2<<k;\n if(i%2==0) {\n b+=k;\n o1+=pow(2,k)-1;\n }else{\n o2+=pow(2,k)-1;\n }\n }\n /*\n for(i=0;i<n;i++) cout << ((o1>>i&1) ? 1:0);\n cout << endl;\n for(i=0;i<n;i++) cout << ((o2>>i&1) ? 1:0);\n cout << endl;\n */\n\n queue<i_i> q;\n i_i x;\n x.first=in;x.second=0;\n q.push(x);\n while(step[o1]==inf&&step[o2]==inf&&!q.empty()){\n x=q.front();\n q.pop();\n /*\n for(i=n-1;i>=0;i--) cout << ((x.first>>i&1) ? 1:0);\n cout << endl;\n */\n if(step[x.first]>x.second){\n step[x.first]=x.second;\n for(i=n-1;i>0;i--){\n\tif((x.first>>i&1)==(x.first>>(i-1)&1)) continue;\n\tif((x.first>>i&1))\n\t q.push(mp(x.first-pow(2,i)+pow(2,i-1),x.second+1));\n\telse\n\t q.push(mp(x.first+pow(2,i)-pow(2,i-1),x.second+1));\n }\n }\n }\n \n \n cout << min(step[o1],step[o2]) << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1440,"score_of_the_acc":-0.0072,"final_rank":1},{"submission_id":"aoj_1345_1721834","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <iomanip>\n#include <assert.h>\n#include <array>\n#include <cstdio>\n#include <cstring>\n#include <random>\n#include <functional>\n#include <numeric>\n#include <bitset>\n\nusing namespace std;\n\nstruct before_main{before_main(){cin.tie(0); ios::sync_with_stdio(false);}} before_main;\n\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\n#define rep(i,n) REP(i,0,n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\n\ntypedef long long ll;\nint const inf = 1<<29;\n\nint main() {\n\n int N, M; cin >> N >> M;\n vector<int> b(N);\n rep(i, N) cin >> b[i];\n vector<int> tb1, tb2;\n int flag = 0;\n rep(i, M) {\n int p; cin >> p;\n rep(j, p) {\n tb1.push_back(flag);\n tb2.push_back(flag^1);\n }\n flag ^= 1;\n }\n set<vector<int>> st = {b};\n queue<pair<vector<int>, int>> q;\n q.emplace(b, 0);\n\n auto check_run_length = [&](vector<int>& v) {\n return v == tb1 || v == tb2;\n };\n\n while(!q.empty()) {\n vector<int> p; int cost; tie(p, cost) = q.front(); q.pop();\n if(check_run_length(p)) { cout << cost << endl; return 0; }\n rep(i, N-1) {\n swap(p[i], p[i+1]);\n if(!st.count(p)) {\n q.emplace(p, cost + 1);\n st.insert(p);\n }\n swap(p[i], p[i+1]);\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4064,"score_of_the_acc":-0.1541,"final_rank":9},{"submission_id":"aoj_1345_1630433","code_snippet":"#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nint x[65536];\n\nint inversions(int p, int n, int q, int r) {\n\tint x3[15], y[15], z;\n\tmemset(x, 127, sizeof(x));\n\tx[p] = 0;\n\tfor (int i = 0; i < n * n; i++){\n\t\tfor (int j = 0; j < (1 << n); j++) {\n\t\t\tif (x[j] < 1000) {\n\t\t\t\tfor (int k = 0; k < n; k++) {\n\t\t\t\t\tx3[k] = (j / (1 << k)) % 2;\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < n - 1; k++) {\n\t\t\t\t\tz = 0;\n\t\t\t\t\tif (x3[k] + x3[k + 1] == 1) {\n\t\t\t\t\t\tfor (int l = 0; l < n; l++) {\n\t\t\t\t\t\t\ty[l] = x3[l];\n\t\t\t\t\t\t}\n\t\t\t\t\t\ty[k] = x3[k + 1];\n\t\t\t\t\t\ty[k + 1] = x3[k];\n\t\t\t\t\t\tfor (int l = 0; l < n; l++) {\n\t\t\t\t\t\t\tz += y[l] * (1 << l);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tx[z] = min(x[z], x[j] + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn min(x[q], x[r]);\n}\n\nint n, m, a, s;\nint x1[15], x2[15], cnt, r1, r2;\n\nint main() {\n\tcin >> n >> m;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a; s += (1 << i) * a;\n\t}\n\tfor (int i = 0; i < m; i++) {\n\t\tcin >> a;\n\t\tfor (int j = 0; j < a; j++) {\n\t\t\tx1[j + cnt] = i % 2;\n\t\t\tx2[j + cnt] = (i + 1) % 2;\n\t\t}\n\t\tcnt += a;\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tr1 += x1[i] * (1 << i);\n\t\tr2 += x2[i] * (1 << i);\n\t}\n\tcout << inversions(s, n, r1, r2) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":1428,"score_of_the_acc":-1.0065,"final_rank":18},{"submission_id":"aoj_1345_1630409","code_snippet":"#include <map>\n#include <queue>\n#include <string>\n#include <vector>\n#include <utility>\n#include <iostream>\n#include <algorithm>\n\n#define INF (1 << 29)\n\nusing namespace std;\n\nint BFS(string S, string T) // S --> T\n{\n\tmap<string, int> D; D[S] = 1;\n\n\tqueue<pair<string, int> > que; que.push(make_pair(S, 1));\n\n\tif (S == T) { return 0; }\n\n\twhile (!que.empty())\n\t{\n\t\tstring S2 = que.front().first;\n\n\t\tint dist = que.front().second; que.pop();\n\n\t\tfor (int i = 0; i < T.size() - 1; i++)\n\t\t{\n\t\t\tstring S3 = S2;\n\n\t\t\tswap(S3[i], S3[i + 1]);\n\n\t\t\tif (S3 == T) { return dist; }\n\n\t\t\tif (D[S3] == 0)\n\t\t\t{\n\t\t\t\tD[S3] = dist + 1;\n\n\t\t\t\tque.push(make_pair(S3, dist + 1));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn INF;\n}\n\nint main()\n{\n\tint N, M;\n\n\tcin >> N >> M;\n\n\tvector<int> B(N); for (int i = 0; i < N; i++) { cin >> B[i]; }\n\tvector<int> R(M); for (int i = 0; i < M; i++) { cin >> R[i]; }\n\n\tstring S, T1, T2;\n\n\tfor (int i = 0; i < N; i++) { S += B[i] + 48; }\n\n\tfor (int i = 0; i < M; i++)\n\t{\n\t\tfor (int j = 0; j < R[i]; j++) \n\t\t{\n\t\t\tT1 += i % 2 + 48;\n\t\t\tT2 += (i + 1) % 2 + 48;\n\t\t}\n\t}\n\n\tint res1 = BFS(S, T1);\n\tint res2 = BFS(S, T2);\n\n\tcout << min(res1, res2) << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3876,"score_of_the_acc":-0.2007,"final_rank":14},{"submission_id":"aoj_1345_1595066","code_snippet":"#include<stdio.h>\n#include <iostream>\n#include <math.h>\n#include <numeric>\n#include <vector>\n#include <map>\n#include <functional>\n#include <stdio.h>\n#include <array>\n#include <algorithm>\n#include <string>\n#include <assert.h>\n#include <stdio.h>\n#include <queue>\n#include<iomanip>\n#include<bitset>\n#include<stack>\nusing namespace std;\n\n//7:10\n//\n//#define REP(i,n) for(int i=0;i<(int)n;++i)\n//#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n//#define ALL(c) (c).begin(), (c).end()\n//\n//typedef int Weight;\n//struct Edge {\n//\tint src, dst;\n//\tWeight weight;\n//\tEdge(int src, int dst, Weight weight) :\n//\t\tsrc(src), dst(dst), weight(weight) { }\n//};\n//bool operator < (const Edge &e, const Edge &f) {\n//\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\n//\te.src != f.src ? e.src < f.src : e.dst < f.dst;\n//}\n//typedef vector<Edge> Edges;\n//typedef vector<Edges> Graph;\n//\n//typedef vector<Weight> Array;\n//typedef vector<Array> Matrix;\n//\n//#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\n//Weight maximumFlow(const Graph &g, int s, int t) {\n//\tint n = g.size();\n//\tMatrix flow(n, Array(n)), capacity(n, Array(n));\n//\tREP(u, n) for (auto e = g[u].begin(); e != g[u].end();++e)capacity[e->src][e->dst] += e->weight;\n//\n//\tWeight total = 0;\n//\twhile (1) {\n//\t\tqueue<int> Q; Q.push(s);\n//\t\tvector<int> prev(n, -1); prev[s] = s;\n//\t\twhile (!Q.empty() && prev[t] < 0) {\n//\t\t\tint u = Q.front(); Q.pop();\n//\t\t\tfor (auto e = g[u].begin(); e != g[u].end(); ++e) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > 0) {\n//\t\t\t\tprev[e->dst] = u;\n//\t\t\t\tQ.push(e->dst);\n//\t\t\t}\n//\t\t}\n//\t\tif (prev[t] < 0) return total; // prev[x] == -1 <=> t-side\n//\t\tWeight inc = 999999999;\n//\t\tfor (int j = t; prev[j] != j; j = prev[j])\n//\t\t\tinc = min(inc, RESIDUE(prev[j], j));\n//\t\tfor (int j = t; prev[j] != j; j = prev[j])\n//\t\t\tflow[prev[j]][j] += inc, flow[j][prev[j]] -= inc;\n//\t\ttotal += inc;\n//\t}\n//\treturn total;\n//}\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst int mod = 1000000007;\n\nstruct Mod {\n\tlong long int num;\n\tMod() : num(0) { ; }\n\tMod(long long int n) : num((n % mod + mod) % mod) { ; }\n\toperator long long int() { return num; }\n};\n\nMod operator+(Mod a, Mod b) { return Mod((a.num + b.num) % mod); }\nMod operator-(Mod a, Mod b) { return Mod((mod + a.num - b.num) % mod); }\nMod operator*(Mod a, Mod b) { return Mod(((long long)a.num * b.num) % mod); }\nMod operator+=(Mod &a, Mod b) { return a = a + b; }\nMod operator-=(Mod &a, Mod b) { return a = a - b; }\nMod operator*=(Mod &a, Mod b) { return a = a * b; }\nMod operator^(Mod a, int n) {\n\tif (n == 0) return Mod(1);\n\tMod res = (a * a) ^ (n / 2);\n\tif (n % 2) res = res * a;\n\treturn res;\n}\nMod inv(Mod a) { return a ^ (mod - 2); }\nMod operator/(Mod a, Mod b) { return a * inv(b); }\n\n#define MAX_N 1024000\n\nMod fact[MAX_N], factinv[MAX_N];\nvoid init() {\n\tfact[0] = Mod(1); factinv[0] = 1;\n\tREP(i, MAX_N - 1) {\n\t\tfact[i + 1] = fact[i] * Mod(i + 1);\n\t\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\n\t}\n}\nMod comb(int a, int b) {\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\nlong long int memo[20];//nけた\n\nlong long int powint(long long int a, int b){\n\tif (b == 0)return 1;\n\tif (b == 1)return a;\n\telse{\n\t\tlong long int ans = 1;\n\t\tlong long int c = powint(a, b / 2);\n\t\tans *= c*c;\n\t\tans *= (b % 2) ? a : 1;\n\t\treturn ans;\n\t}\n\n}\n\n\nint backnum[100000][20];\n\nstruct Node{\n\tNode(int aid):children(),ancs(){\n\t\tid=(aid);\n\t\tfor (int i = 0; i < 20; ++i){\n\t\t\tancs[i] = -1;\n\t\t}\n\t}\n\tint id;\n\tvector<int>children;\n\tarray<int, 20>ancs;\n};\n\nint main()\n{\n\tint N,M;\n\tcin >> N >> M;\n\tbitset<15>Moto;\n\tfor (int i = 0; i < N; ++i){\n\t\tint a;\n\t\tcin >> a;\n\t\tMoto[i]=a;\n\t}\n\tvector<int>k;\n\t\n\tfor (int i = 0; i < M; ++i){\n\t\tint a;\n\t\tcin >> a;\n\t\tk.emplace_back(a);\n\t}\n\tint ans = 9999;\n\t{\n\t\tint a = 1;\n\t\tbitset<15> Next1;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < k.size(); ++i){\n\t\t\tfor (int j = 0; j < k[i]; ++j){\n\t\t\t\tNext1[count++] = a;\n\t\t\t\t\n\t\t\t}\n\t\t\tif (a)a = 0;\n\t\t\telse a = 1;\n\t\t}\n\t\tif (Moto.count() != Next1.count()){\n\t\t\t\n\t\t}\n\t\telse{\n\t\t\tvector<int>oneplace;\n\t\t\tvector<int>oneplace2;\n\t\t\tfor (int i = 0; i < N; ++i){\n\t\t\t\tif (Moto[i])oneplace.push_back(i);\n\t\t\t\tif (Next1[i])oneplace2.push_back(i);\n\t\t\t}\n\t\t\tif (!oneplace.size()){\n\t\t\t\tans = 0;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint kotae = 0;\n\t\t\t\tint mit = oneplace[0];\n\t\t\t\tint nit = oneplace2[0];\n\t\t\t\tkotae += abs(mit - nit);\n\t\t\t\tfor (int i = 1; i < oneplace.size(); ++i){\n\t\t\t\t\tkotae += abs(oneplace[i] - oneplace2[i]);\n\t\t\t\t}\n\t\t\t\tans = min(ans, kotae);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tint a =0;\n\t\tbitset<15> Next1;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < k.size(); ++i){\n\t\t\tfor (int j = 0; j < k[i]; ++j){\n\t\t\t\tNext1[count++] = a;\n\n\t\t\t}\n\t\t\tif (a)a = 0;\n\t\t\telse a = 1;\n\t\t}\n\t\tif (Moto.count() != Next1.count()){\n\n\t\t}\n\t\telse{\n\t\t\tvector<int>oneplace;\n\t\t\tvector<int>oneplace2;\n\t\t\tfor (int i = 0; i < N; ++i){\n\t\t\t\tif (Moto[i])oneplace.push_back(i);\n\t\t\t\tif (Next1[i])oneplace2.push_back(i);\n\t\t\t}\n\t\t\tif (!oneplace.size()){\n\t\t\t\tans = 0;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tint kotae = 0;\n\t\t\t\tint mit = oneplace[0];\n\t\t\t\tint nit = oneplace2[0];\n\t\t\t\tkotae += abs(mit - nit);\n\t\t\t\tfor (int i = 1; i < oneplace.size(); ++i){\n\t\t\t\t\tkotae += abs(oneplace[i] - oneplace2[i]);\n\t\t\t\t}\n\t\t\t\tans = min(ans, kotae);\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":19172,"score_of_the_acc":-1,"final_rank":17},{"submission_id":"aoj_1345_1593230","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define LOG(...) fprintf(stderr,__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort(ALL(c))\n#define RSORT(c) sort(RALL(c))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\n#define INF 10000\n\nint main() {\n int n, m;\n cin >> n >> m;\n int start = 0;\n REP(i, n) {\n char c;\n cin >> c;\n start <<= 1;\n start |= (c == '1' ? 1 : 0);\n }\n int goal = 0;\n int t = 0;\n REP(i, m) {\n int bits;\n cin >> bits;\n REP(j, bits) {\n goal <<= 1;\n goal |= t & 1;\n }\n t = ~t;\n }\n int goal2 = ~goal & ((1 << n)-1);\n// cout << bitset<15>(start) << endl;\n// cout << bitset<15>(goal) << endl;\n// cout << bitset<15>(~goal & ((1 << n)-1)) << endl;\n\n vvi dp(2, vi(1 << n, INF));\n dp[0][start] = 0;\n while (1) {\n dp[1] = dp[0];\n REP(step, 1 << n) {\n if (dp[0][step] == INF) continue;\n REP(i, n-1) {\n int has_next = (step >> i) & 3;\n if (has_next != 0 && has_next != 3) {\n int next = step;\n if (next & (1 << i)) {\n next &= ~(1 << i);\n } else {\n next |= (1 << i);\n }\n if (next & (1 << (i+1))) {\n next &= ~(1 << (i+1));\n } else {\n next |= (1 << (i+1));\n }\n// cout << bitset<15>(next) << endl;\n dp[1][next] = min(dp[1][next], dp[0][step]+1);\n }\n }\n }\n dp[0] = dp[1];\n\n if (min(dp[0][goal], dp[0][goal2]) != INF) {\n cout << min(dp[0][goal], dp[0][goal2]) << endl;\n break;\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3352,"score_of_the_acc":-0.1428,"final_rank":8},{"submission_id":"aoj_1345_1593187","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <functional>\n\nusing namespace std;\n\n#define LOG(...) printf(__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n#define RSORT(c) sort((c).rbegin(),(c).rend())\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\nstruct st{\nint bit;\nint count;\n};\nint main() {\nint n,m;\n\tcin>>n>>m;\n\tint bit=0;\n\tREP(i,n){\n\tint shift;\n\tcin >> shift;\n\tbit |= shift << (n - i-1);\n\t}\n\tvector<int> ans(m);\n\tREP(i,m){\n\t\tcin>>ans[i];\n\t}\n\tint bit_ans=0;\n\tint bit_ans2;\n\tREP(i,m){\n\t\tREP(j, ans[i]){\n\t\t\tbit_ans <<=1;\n\t\t\tif (i % 2 == 0){\n\t\t\tbit_ans|=1;\n\t\t\t}\n\t\t\t\n\t}\n\t}\n\tbit_ans2=bit_ans^((1<<n)-1);\n\tint count=0;\n\tset<int> dp;\n\tdp.insert(bit);\n\tqueue<st> P;\n\tP.push({bit,0});\n\twhile (!P.empty()){\n\t\tst p = P.front(); P.pop();\n\t\tif (p.bit == bit_ans || p.bit == bit_ans2){\n\t\tcount=p.count;\n\t\tbreak;\n\t\t}\n\t\tREP(i,n-1){\n\t\t\tif ((p.bit | 1 << i) != (p.bit | 1 << (i + 1))){\n\t\t\t\tint bitc = p.bit^3<<i;\n\t\t\t\tif (dp.find(bitc) == dp.end()){\n\t\t\t\t\tdp.insert(bitc);\n\t\t\t\t\tP.push({ bitc, p.count + 1 });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<count<<endl;\n}","accuracy":0.04,"time_ms":10,"memory_kb":3808,"score_of_the_acc":-0.1398,"final_rank":20},{"submission_id":"aoj_1345_1515205","code_snippet":"#include <iostream>\n#include <string>\n#include <queue>\n#include <utility>\n#include <algorithm>\n#include <set>\nusing namespace std;\n\nconst int INF = (1 << 29);\ntypedef pair<string ,int> psi;\n\nint main(void) {\n\n int N, M; cin >> N >> M;\n string b = \"\";\n for (int i = 0; i < N; i++) {\n int t; cin >> t;\n b += t+'0';\n }\n string t1 = \"\", t2 = \"\";\n for (int i = 0; i < M; i++) {\n int p; cin >> p;\n for (int j = 0; j < p; j++) {\n if (i%2) {\n t1 += '0';\n t2 += '1';\n } else {\n t1 += '1';\n t2 += '0';\n }\n }\n }\n\n int ans1 = INF;\n if (count(t1.begin(), t1.end(), '0') == count(b.begin(), b.end(), '0')) {\n queue<psi> q1;\n set<string> used;\n q1.push(psi(t1,0));\n used.insert(t1);\n while (!q1.empty()) {\n psi s = q1.front(); q1.pop();\n if (s.first == b) {\n ans1 = s.second;\n break;\n }\n\n for (int i = 0; i < N-1; i++) {\n string tmp = s.first;\n swap(tmp[i], tmp[i+1]);\n if (used.find(tmp) == used.end()) {\n q1.push(psi(tmp, s.second+1));\n used.insert(tmp);\n }\n }\n }\n }\n\n int ans2 = INF;\n if (count(t2.begin(), t2.end(), '0') == count(b.begin(), b.end(), '0')) {\n queue<psi> q2;\n set<string> used;\n q2.push(psi(t2, 0));\n used.insert(t2);\n while (!q2.empty()) {\n psi s = q2.front(); q2.pop();\n if (s.first == b) {\n ans2 = s.second;\n break;\n }\n\n for (int i = 0; i < N-1; i++) {\n string tmp = s.first;\n swap(tmp[i], tmp[i+1]);\n if (used.find(tmp) == used.end()) {\n q2.push(psi(tmp, s.second+1));\n used.insert(tmp);\n }\n }\n }\n }\n\n cout << min(ans1, ans2) << endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1844,"score_of_the_acc":-0.0584,"final_rank":4},{"submission_id":"aoj_1345_1464836","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <bitset>\n\nusing namespace std;\n\nstruct state{\n\tvector< int > bits;\n\tint depth;\n};\n\nvector< int > count_bits( vector< int > *b ) {\n\tvector< int > v;\n\tint cnt = 0;\n\tfor( int i = 0; i < b ->size(); i++ ) {\n\t\tcnt ++;\n\t\tif( i < b -> size() - 1 && b -> at( i ) != b -> at( i + 1 ) ) {\n\t\t\tv.push_back( cnt );\n\t\t\tcnt = 0;\n\t\t}\n\t}\n\tv.push_back( cnt );\n\treturn v;\n}\n\nbool isEqual( vector< int > *v, vector< int > *w ) {\n\tif( v->size() != w->size() ) return false;\n\tfor( int i = 0; i < v->size(); i++ ) {\n\t\tif( v->at(i) != w->at(i) ) return false;\n\t}\n\treturn true;\n}\n\nvoid swap_bits( vector< int > *b, int pos ) {\n\tint c = b -> at( pos );\n\tb -> at( pos ) = b -> at( pos + 1 );\n\tb -> at( pos + 1 ) = c;\n\treturn;\n}\n\nint main(void){\n\n\tint N, M;\n\tcin >> N >> M;\n\tstate start;\n\tstart.bits = vector< int >( N, 0 );\n\tstart.depth = 0;\n\tvector< int > p( M, 0 );\n\tvector< bool > visited( 1 << N, false );\n\n\tfor( int i = 0; i < N; i++ )\n\t\tcin >> start.bits[i];\n\tfor( int i = 0; i < M; i++ )\n\t\tcin >> p[i];\n\n\tqueue< state > q;\n\tq.push( start );\n\n\twhile( !q.empty() ) {\n\t\t\n\t\tstate cs = q.front();\n\t\tq.pop();\n\t\tvector< int > v = count_bits( &cs.bits );\n\t\tif( isEqual( &v, &p ) ) { \n\t\t\tcout << cs.depth << endl;\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tfor( int i = 0; i < N - 1; i++ ) {\n\t\t\tstate newstate;\n\t\t\tfor( int j = 0; j < N; j++ )\n\t\t\t\tnewstate.bits.push_back( cs.bits[j] );\n\n\t\t\tint n = 0;\n\t\t\tswap_bits( &newstate.bits, i );\n\n\t\t\tfor( int j = 0; j < N; j++ ) {\n\t\t\t\tif( newstate.bits[j] ) n |= ( 1 << j );\n\t\t\t}\n\n\t\t\tif( visited[ n ] ) continue;\n\t\t\tvisited[n] = true;\n\n\t\t\tnewstate.depth = cs.depth + 1;\n\t\t\t\n\t\t\tq.push( newstate );\n\t\t}\n\n\n\t}\n\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1312,"score_of_the_acc":-0.0286,"final_rank":2},{"submission_id":"aoj_1345_1445824","code_snippet":"#include <iostream>\n#include <map>\n#include <cstring>\n#include <cassert>\n#include <vector>\n#include <queue>\nusing namespace std;\n\ntemplate<class T>\nostream& operator<<(ostream& os, const vector<T>& vs) {\n if (vs.empty()) return os << \"[]\";\n os << \"[\" << vs[0];\n for (int i = 1; i < vs.size(); i++) os << \" \" << vs[i];\n return os << \"]\";\n}\n\nint N, M;\nvector<int> S;\nvector<int> T;\nvoid input() {\n cin >> N >> M;\n S.clear(); S.resize(N);\n for (int i = 0; i < N; i++) {\n cin >> S[i];\n }\n T.clear(); T.resize(M);\n for (int i = 0; i < M; i++) {\n cin >> T[i];\n }\n}\n\nvector<int> A, B;\nvoid init() {\n A.clear(); B.clear();\n int x = 0;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < T[i]; j++) {\n A.push_back(x);\n }\n x = !x;\n }\n x = 1;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < T[i]; j++) {\n B.push_back(x);\n }\n x = !x;\n }\n}\n\nconst int MAX_N = 15;\n\nstruct State {\n vector<int> bit;\n int t;\n State(vector<int> bit, int t) : bit(bit), t(t) {}\n};\n\nvoid solve() {\n init();\n map< vector<int>, bool > used;\n queue<State> Q;\n used[S] = true;\n Q.push(State(S, 0));\n while (!Q.empty()) {\n State cur = Q.front(); Q.pop();\n if (cur.bit == A || cur.bit == B) {\n cout << cur.t << endl;\n break;\n }\n for (int i = 0; i < N - 1; i++) {\n vector<int> nbit = cur.bit;\n if (nbit[i] == nbit[i + 1]) continue;\n swap(nbit[i], nbit[i + 1]);\n if (used[nbit]) continue;\n used[nbit] = true;\n Q.push(State(nbit, cur.t + 1));\n }\n }\n}\n\nint main() {\n input(); solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":2256,"score_of_the_acc":-0.0529,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1345_10500246\",\n \"code_snippet\": \"#include <iostream>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <ranges>\\n#include <map>\\nnamespace ranges = std::ranges;\\nint N, M;\\nstd::vector<int> rle(std::vector<int> a) {\\n std::vector<int> res;\\n for (int i = 0, j = 0 ; i < N ; i = j) {\\n while (j < N and a[i] == a[j]) j++;\\n res.push_back(j - i);\\n }\\n return res;\\n}\\nint main() {\\n std::cin >> N >> M;\\n std::vector<int> B(N), P(M);\\n for (int i = 0 ; i < N ; i++) std::cin >> B[i];\\n for (int i = 0 ; i < M ; i++) std::cin >> P[i];\\n std::map<std::vector<int>, int> dist1, dist2;\\n std::vector<std::vector<int>> que;\\n dist1[B] = 0;\\n que.push_back(B);\\n for (int t = 0 ; t < std::ssize(que) ; t++) {\\n std::vector<int> v = std::move(que[t]);\\n const auto d = dist1[v];\\n dist2.try_emplace(rle(v), d);\\n for (int i = 0 ; i + 1 < N ; i++) {\\n std::swap(v[i], v[i + 1]);\\n if (!dist1.contains(v)) {\\n dist1[v] = d + 1;\\n que.push_back(v);\\n }\\n std::swap(v[i], v[i + 1]);\\n }\\n }\\n std::cout << dist2[P] << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5632,\n \"score_of_the_acc\": -0.2419,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1345_6785382\",\n \"code_snippet\": \"#pragma region template\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef __LOCAL\\n #include <debug>\\n#else\\n #define debug(...) void(0)\\n#endif\\n\\n#define REP(i,n) for(int i=0;i<(n);i++)\\n#define ALL(v) v.begin(),v.end()\\n\\ntemplate<typename T>\\nistream& operator>>(istream&is,vector<T>&v){\\n for(T&p:v)is>>p;\\n return is;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream&os,const vector<T>&v){\\n if(&os==&cerr)os<<\\\"[\\\";\\n for(int i=0;i<v.size();i++){\\n os<<v[i];\\n if(i+1<v.size())os<<(&os==&cerr?\\\",\\\":\\\" \\\");\\n }\\n if(&os==&cerr)os<<\\\"]\\\";\\n return os;\\n}\\n#pragma endregion template\\n\\nmap<vector<int>,int> mp;\\n\\nint main(){\\n int n,m;cin>>n>>m;\\n vector<int> b(n);cin>>b;\\n mp[b]=0;\\n queue<vector<int>> que;\\n que.push(b);\\n while(que.size()){\\n auto ve=que.front();que.pop();\\n REP(i,n-1){\\n if(ve[i]==ve[i+1])continue;\\n auto cpy=ve;\\n swap(cpy[i],cpy[i+1]);\\n if(mp.count(cpy))continue;\\n mp[cpy]=mp[ve]+1;\\n que.push(cpy);\\n }\\n }\\n\\n //debug(mp);\\n\\n vector<int> v(m);cin>>v;\\n int ans=1e9;\\n for(const auto&[key,val]:mp){\\n vector<int> w;\\n int cnt=1;\\n for(int i=1;i<n;i++){\\n if(key[i]!=key[i-1]){\\n w.push_back(cnt);\\n cnt=0;\\n }\\n cnt++;\\n }\\n w.push_back(cnt);\\n if(v==w)ans=min(ans,val);\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4444,\n \"score_of_the_acc\": -0.1754,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1345_4429101\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define SZ(x) (int)(x.size())\\n#define REP(i, n) for(int i=0;i<(n);++i)\\n#define FOR(i, a, b) for(int i=(a);i<(b);++i)\\n#define RREP(i, n) for(int i=(int)(n)-1;i>=0;--i)\\n#define RFOR(i, a, b) for(int i=(int)(b)-1;i>=(a);--i)\\n#define ALL(a) a.begin(),a.end()\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n#define DEBUG(x) cerr<<#x<<\\\" = \\\"<<(x)<<\\\" (L\\\"<<__LINE__<<\\\")\\\"<< endl;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing P = pair<int, int>;\\nconst double eps = 1e-8;\\nconst ll MOD = 1000000007;\\nconst int INF = INT_MAX / 2;\\nconst ll LINF = LLONG_MAX / 2;\\ntemplate <typename T1, typename T2>\\nbool chmax(T1 &a, const T2 &b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate <typename T1, typename T2>\\nbool chmin(T1 &a, const T2 &b) {\\n if (a > b) { a = b; return true; }\\n return false;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n os << \\\"[\\\";\\n REP(i, SZ(v)) {\\n if (i) os << \\\", \\\";\\n os << v[i];\\n }\\n return os << \\\"]\\\";\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const map<T1, T2> &mp) {\\n os << \\\"{\\\";\\n int a = 0;\\n for (auto &tp : mp) {\\n if (a) os << \\\", \\\";\\n a = 1;\\n os << tp;\\n }\\n return os << \\\"}\\\";\\n}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) {\\n os << p.first << \\\":\\\" << p.second;\\n return os;\\n}\\n\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n int N, M; cin >> N >> M;\\n string b;\\n vi p(M);\\n REP(i, N) {\\n char c; cin >> c; b += c;\\n }\\n REP(i, M) cin >> p[i];\\n\\n string g1, g2;\\n REP(k, M) {\\n REP(i, p[k]) {\\n g1 += k & 1 ? '0' : '1';\\n g2 += k & 1 ? '1' : '0';\\n }\\n }\\n\\n using Pi = pair<int,string>;\\n priority_queue<Pi, vector<Pi>, greater<Pi>> que;\\n map<string,int> dist;\\n\\n int ans = -1;\\n\\n que.emplace(0, b); dist[b] = 0;\\n while (!que.empty()) {\\n string s;\\n int cost;\\n tie(cost, s) = que.top(); que.pop();\\n if (s == g1 or s == g2) {\\n ans = cost;\\n break;\\n }\\n\\n REP(i, N-1) {\\n string tmp = s;\\n swap(tmp[i], tmp[i+1]);\\n if (dist.count(tmp) == 0 or dist[tmp] > cost + 1) {\\n dist[tmp] = cost + 1;\\n que.emplace(cost + 1, tmp);\\n }\\n }\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.1724,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1345_3272588\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n//幅優先探索\\n\\nint main(){\\n int n, m; cin >> n >> m;\\n vector<bool> b(n);\\n for(int i = 0; i < n; i++){\\n int in; cin >> in;\\n b[i] = (bool)in;\\n }\\n vector<int> p(m);\\n for(int i = 0; i < m; i++) cin >> p[i];\\n vector<bool> g1;\\n vector<bool> g2;\\n for(int i = 0; i < m; i++){\\n if(i % 2 == 0){\\n for(int j = 0; j < p[i]; j++){\\n g1.push_back(false);\\n g2.push_back(true);\\n }\\n }else{\\n for(int j = 0; j < p[i]; j++){\\n g1.push_back(true);\\n g2.push_back(false);\\n }\\n }\\n }\\n\\n set<vector<bool> > used;\\n queue<pair<vector<bool>, int> > q;\\n q.push({b, 0});\\n used.insert(b);\\n \\n while(!q.empty()){\\n\\n vector<bool> vec = q.front().first;\\n int cost = q.front().second;\\n q.pop();\\n \\n if(vec == g1 || vec == g2){\\n cout << cost << endl;\\n break;\\n }\\n\\n for(int i = 0; i < n - 1; i++){\\n vector<bool> nxt = vec;\\n swap(nxt[i], nxt[i + 1]);\\n if(used.find(nxt) == used.end()){\\n used.insert(nxt);\\n q.push({nxt, cost + 1});\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -0.1998,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1345_3097601\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef pair<int, int> P;\\nconst int INF = 1e9;\\n\\nint N, M;\\nvector<int> p;\\n\\nsigned main() {\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n cin >> N >> M;\\n\\n int bit = 0;\\n for ( int i = 0; i < N; i++ ) {\\n int b;\\n cin >> b;\\n bit |= (b<<i); \\n }\\n\\n p = vector<int>(M);\\n for ( int i = 0; i < M; i++ ) {\\n cin >> p[i]; \\n }\\n\\n vector<bool> used(1<<N, false);\\n priority_queue<P, vector<P>, greater<P> > Q;\\n Q.push({0, bit});\\n\\n while ( !Q.empty() ) {\\n P e = Q.top(); Q.pop();\\n int c = e.first, b = e.second; \\n\\n vector<int> q;\\n int cnt = 1;\\n bool pre = b&1; \\n for ( int i = 1; i < N; i++ ) {\\n if ( pre != (bool)(b&(1<<i)) ) {\\n\\tq.emplace_back(cnt);\\n\\tpre = !pre;\\n\\tcnt = 1; \\n } else {\\n\\tcnt++; \\n }\\n }\\n q.emplace_back(cnt);\\n\\n if ( q == p ) {\\n cout << c << endl;\\n return 0;\\n }\\n\\n if ( used[b] ) continue;\\n used[b] = true;\\n\\n for ( int i = 0; i < N-1; i++ ) {\\n int nxt = b;\\n nxt &= ~(1<<i);\\n nxt &= ~(1<<(i+1));\\n if ( b & (1<<i) ) nxt |= (1<<(i+1));\\n if ( b & (1<<(i+1)) ) nxt |= (1<<i);\\n Q.push(P(c+1, nxt)); \\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.1421,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1345_2496816\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\n#define REP(i,a,b) for(int i=int(a);i<int(b);i++)\\n\\nusing namespace std;\\n\\ntypedef long long int lli;\\n\\nint bitSwap(int num, int p) {\\n int t = (num >> p) & 1;\\n num -= (t << p);\\n int e = (num >> (p + 1)) & 1;\\n num -= (e << (p + 1));\\n return num + (t << (p + 1)) + (e << p);\\n}\\n\\nint main () {\\n int n, m;\\n cin >> n >> m;\\n int num = 0;\\n REP (i, 0, n) {\\n int bit;\\n cin >> bit;\\n num = (num << 1) + bit;\\n }\\n int s0 = 0, s1 = 0;\\n REP (i, 0, m) {\\n int p;\\n cin >> p;\\n REP (j, 0, p) {\\n s0 = (s0 << 1) + (i % 2);\\n s1 = (s1 << 1) + !(i % 2);\\n }\\n }\\n int size = 1 << n;\\n const int inf = 1 << 30;\\n vector<int> dp(size, inf);\\n dp[s0] = dp[s1] = 0;\\n bool run = true;\\n while (run) {\\n run = false;\\n REP (i, 0, size) {\\n if (dp[i] == inf) continue;\\n REP (j, 0, n - 1) {\\n int t = bitSwap(i, j);\\n if (dp[t] > dp[i] + 1) {\\n dp[t] = dp[i] + 1;\\n run = true;\\n }\\n }\\n }\\n }\\n cout << dp[num] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.1925,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1345_2026288\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n\\nsigned main() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<bool> bs(n);\\n\\trep(i, n) {\\n\\t\\tint x; cin >> x;\\n\\t\\tbs[i] = x;\\n\\t}\\n\\tvector<bool> a(n), b(n);\\n\\tint tb = 0;\\n\\tint idx = 0;\\n\\trep(i, m) {\\n\\t\\tint p; cin >> p;\\n\\t\\trep(j, p) {\\n\\t\\t\\ta[idx] = tb;\\n\\t\\t\\tb[idx] = !tb;\\n\\t\\t\\tidx++;\\n\\t\\t}\\n\\t\\ttb = !tb;\\n\\t}\\n\\tint mb = 1 << 15;\\n\\t\\n\\tusing P = pair<vector<bool>, int>;\\n\\tunordered_map<vector<bool>, int> visited;\\n\\tqueue<P> que;\\n\\tque.push(P(bs, 0));\\n\\tvisited[bs] = 0;\\n\\tint ans = -1;\\n\\t\\n\\twhile (!que.empty()) {\\n\\t\\tP p = que.front(); que.pop();\\n\\t\\tauto& pb = p.first;\\n\\t\\tauto& pc = p.second;\\n\\t\\tif (pb == a || pb == b) {\\n\\t\\t\\tans = pc;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\trep(i, n - 1) {\\n\\t\\t\\tvector<bool> next = pb;\\n\\t\\t\\tswap(next[i], next[i + 1]);\\n\\t\\t\\tint nc = pc + 1;\\n\\t\\t\\tif (visited.count(next)) continue;\\n\\t\\t\\tvisited[next] = nc;\\n\\t\\t\\tque.emplace(next, nc);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\t\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -0.1375,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1345_1856191\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define int long long // <-----!!!!!!!!!!!!!!!!!!!\\n\\n#define rep(i,n) for (int i=0;i<(n);i++)\\n#define rep2(i,a,b) for (int i=(a);i<(b);i++)\\n#define rrep(i,n) for (int i=(n)-1;i>=0;i--)\\n#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)\\n#define all(a) (a).begin(),(a).end()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef tuple<int, int, int> TUPLE;\\ntypedef vector<int> V;\\ntypedef vector<V> VV;\\ntypedef vector<VV> VVV;\\n\\nint bfs(V &start, V &run) {\\n int N = start.size();\\n int M = run.size();\\n\\n map<V, int> d;\\n\\tqueue<V> que;\\n que.push(start);\\n d[start] = 0;\\n\\n V g1;\\n int bit = 0;\\n for (auto x : run) {\\n rep(k, x) g1.emplace_back(bit);\\n bit ^= 1;\\n }\\n\\n V g2 = g1;\\n rep(i, N) g2[i] ^= 1;\\n\\n while (!que.empty()) {\\n auto now = que.front(); que.pop();\\n if (now == g1 || now == g2) {\\n return d[now];\\n }\\n\\n rep(i, N - 1) {\\n V nxt(now);\\n swap(nxt[i], nxt[i + 1]);\\n if (d.count(nxt) == 0) {\\n que.push(nxt);\\n d[nxt] = d[now] + 1;\\n }\\n }\\n\\n }\\n\\n}\\n\\nsigned main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n\\n int N, M;\\n cin >> N >> M;\\n V start(N);\\n rep(i, N) cin >> start[i];\\n V run(M);\\n rep(i, M) cin >> run[i];\\n\\n cout << bfs(start, run) << endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4552,\n \"score_of_the_acc\": -0.21,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1345_1839174\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <cstring>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n\\nusing namespace std;\\ntypedef pair<string, int> P;\\n\\nvoid solve()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tbool used[10000];\\n\\tmemset(used, 0, sizeof(used));\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tstring goal;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tchar c;\\n\\t\\tcin >> c;\\n\\t\\tgoal += c;\\n\\t}\\n\\tstring p;\\n\\tstring start[2];\\n\\tbool flag = false;\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tint c;\\n\\t\\tcin >> c;\\n\\t\\tfor (int j = 0; j < c; ++j)\\n\\t\\t{\\n\\t\\t\\tif (flag)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstart[0] += '0';\\n\\t\\t\\t\\tstart[1] += '1';\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tstart[0] += '1';\\n\\t\\t\\t\\tstart[1] += '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tflag = !flag;\\n\\t}\\n\\tif (start[0] == goal || start[1] == goal)\\n\\t{\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn;\\n\\t}\\n\\n\\tqueue<P> que;\\n\\tque.push(P(start[0], 0));\\n\\tque.push(P(start[1], 0));\\n\\tset<string> found;\\n\\tfound.insert(start[0]);\\n\\tfound.insert(start[1]);\\n\\twhile (!que.empty())\\n\\t{\\n\\t\\tP digit = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor (int i = 1; i < digit.first.size(); ++i)\\n\\t\\t{\\n\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t\\tif (found.find(digit.first) != found.end())\\n\\t\\t\\t{\\n\\t\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (digit.first == goal)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << digit.second + 1 << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tque.push(P(digit.first, digit.second + 1));\\n\\t\\t\\tfound.insert(digit.first);\\n\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t}\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tsolve();\\n\\treturn(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2464,\n \"score_of_the_acc\": -0.1216,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1345_1839170\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <cstring>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n\\nusing namespace std;\\ntypedef pair<string, int> P;\\n\\nvoid solve()\\n{\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tbool used[10000];\\n\\tmemset(used, 0, sizeof(used));\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tstring goal;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tchar c;\\n\\t\\tcin >> c;\\n\\t\\tgoal += c;\\n\\t}\\n\\tstring p;\\n\\tstring start[2];\\n\\tbool flag = false;\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tint c;\\n\\t\\tcin >> c;\\n\\t\\tfor (int j = 0; j < c; ++j)\\n\\t\\t{\\n\\t\\t\\tif (flag)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstart[0] += '0';\\n\\t\\t\\t\\tstart[1] += '1';\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tstart[0] += '1';\\n\\t\\t\\t\\tstart[1] += '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tflag = !flag;\\n\\t}\\n\\n\\tqueue<P> que;\\n\\tque.push(P(start[0], 0));\\n\\tque.push(P(start[1], 0));\\n\\tset<string> found;\\n\\tfound.insert(start[0]);\\n\\tfound.insert(start[1]);\\n\\twhile (!que.empty())\\n\\t{\\n\\t\\tP digit = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor (int i = 1; i < digit.first.size(); ++i)\\n\\t\\t{\\n\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t\\tif (found.find(digit.first) != found.end())\\n\\t\\t\\t{\\n\\t\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (digit.first == goal)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << digit.second + 1 << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tque.push(P(digit.first, digit.second + 1));\\n\\t\\t\\tfound.insert(digit.first);\\n\\t\\t\\tswap(digit.first[i - 1], digit.first[i]);\\n\\t\\t}\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tsolve();\\n\\treturn(0);\\n}\",\n \"accuracy\": 0.09,\n \"time_ms\": 20,\n \"memory_kb\": 2180,\n \"score_of_the_acc\": -0.0772,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1345_1837330\",\n \"code_snippet\": \"#include<iostream>\\n#include<math.h>\\n#include<queue>\\n#include<map>\\nusing namespace std;\\ntypedef pair<int,int> i_i;\\n#define mp(a,b) make_pair(a,b)\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int step[1<<15];\\n int inf = 1<<10;\\n fill(step,step+(1<<15),inf);\\n int i,j,k,c=0,b=0;\\n int in=0;\\n int o1=0,o2=0;\\n for(i=0;i<n;i++) {\\n cin >> k;\\n b+=k;\\n in=in<<1;\\n in+=k;\\n }\\n /*\\n for(i=n-1;i>=0;i--) cout << ((in>>i&1) ? 1:0);\\n cout << endl;\\n */\\n //step[in]=0;\\n for(i=0;i<m;i++) {\\n cin >> k;\\n o1=o1<<k;\\n o2=o2<<k;\\n if(i%2==0) {\\n b+=k;\\n o1+=pow(2,k)-1;\\n }else{\\n o2+=pow(2,k)-1;\\n }\\n }\\n /*\\n for(i=0;i<n;i++) cout << ((o1>>i&1) ? 1:0);\\n cout << endl;\\n for(i=0;i<n;i++) cout << ((o2>>i&1) ? 1:0);\\n cout << endl;\\n */\\n\\n queue<i_i> q;\\n i_i x;\\n x.first=in;x.second=0;\\n q.push(x);\\n while(step[o1]==inf&&step[o2]==inf&&!q.empty()){\\n x=q.front();\\n q.pop();\\n /*\\n for(i=n-1;i>=0;i--) cout << ((x.first>>i&1) ? 1:0);\\n cout << endl;\\n */\\n if(step[x.first]>x.second){\\n step[x.first]=x.second;\\n for(i=n-1;i>0;i--){\\n\\tif((x.first>>i&1)==(x.first>>(i-1)&1)) continue;\\n\\tif((x.first>>i&1))\\n\\t q.push(mp(x.first-pow(2,i)+pow(2,i-1),x.second+1));\\n\\telse\\n\\t q.push(mp(x.first+pow(2,i)-pow(2,i-1),x.second+1));\\n }\\n }\\n }\\n \\n \\n cout << min(step[o1],step[o2]) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1440,\n \"score_of_the_acc\": -0.0072,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1345_1721834\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <queue>\\n#include <deque>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <iomanip>\\n#include <assert.h>\\n#include <array>\\n#include <cstdio>\\n#include <cstring>\\n#include <random>\\n#include <functional>\\n#include <numeric>\\n#include <bitset>\\n\\nusing namespace std;\\n\\nstruct before_main{before_main(){cin.tie(0); ios::sync_with_stdio(false);}} before_main;\\n\\n#define REP(i,a,b) for(int i=a;i<(int)b;i++)\\n#define rep(i,n) REP(i,0,n)\\n#define all(c) (c).begin(), (c).end()\\n#define zero(a) memset(a, 0, sizeof a)\\n#define minus(a) memset(a, -1, sizeof a)\\ntemplate<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }\\ntemplate<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }\\n\\ntypedef long long ll;\\nint const inf = 1<<29;\\n\\nint main() {\\n\\n int N, M; cin >> N >> M;\\n vector<int> b(N);\\n rep(i, N) cin >> b[i];\\n vector<int> tb1, tb2;\\n int flag = 0;\\n rep(i, M) {\\n int p; cin >> p;\\n rep(j, p) {\\n tb1.push_back(flag);\\n tb2.push_back(flag^1);\\n }\\n flag ^= 1;\\n }\\n set<vector<int>> st = {b};\\n queue<pair<vector<int>, int>> q;\\n q.emplace(b, 0);\\n\\n auto check_run_length = [&](vector<int>& v) {\\n return v == tb1 || v == tb2;\\n };\\n\\n while(!q.empty()) {\\n vector<int> p; int cost; tie(p, cost) = q.front(); q.pop();\\n if(check_run_length(p)) { cout << cost << endl; return 0; }\\n rep(i, N-1) {\\n swap(p[i], p[i+1]);\\n if(!st.count(p)) {\\n q.emplace(p, cost + 1);\\n st.insert(p);\\n }\\n swap(p[i], p[i+1]);\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4064,\n \"score_of_the_acc\": -0.1541,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1345_1630433\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstring>\\n#include<algorithm>\\nusing namespace std;\\n\\nint x[65536];\\n\\nint inversions(int p, int n, int q, int r) {\\n\\tint x3[15], y[15], z;\\n\\tmemset(x, 127, sizeof(x));\\n\\tx[p] = 0;\\n\\tfor (int i = 0; i < n * n; i++){\\n\\t\\tfor (int j = 0; j < (1 << n); j++) {\\n\\t\\t\\tif (x[j] < 1000) {\\n\\t\\t\\t\\tfor (int k = 0; k < n; k++) {\\n\\t\\t\\t\\t\\tx3[k] = (j / (1 << k)) % 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int k = 0; k < n - 1; k++) {\\n\\t\\t\\t\\t\\tz = 0;\\n\\t\\t\\t\\t\\tif (x3[k] + x3[k + 1] == 1) {\\n\\t\\t\\t\\t\\t\\tfor (int l = 0; l < n; l++) {\\n\\t\\t\\t\\t\\t\\t\\ty[l] = x3[l];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\ty[k] = x3[k + 1];\\n\\t\\t\\t\\t\\t\\ty[k + 1] = x3[k];\\n\\t\\t\\t\\t\\t\\tfor (int l = 0; l < n; l++) {\\n\\t\\t\\t\\t\\t\\t\\tz += y[l] * (1 << l);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tx[z] = min(x[z], x[j] + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn min(x[q], x[r]);\\n}\\n\\nint n, m, a, s;\\nint x1[15], x2[15], cnt, r1, r2;\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> a; s += (1 << i) * a;\\n\\t}\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tcin >> a;\\n\\t\\tfor (int j = 0; j < a; j++) {\\n\\t\\t\\tx1[j + cnt] = i % 2;\\n\\t\\t\\tx2[j + cnt] = (i + 1) % 2;\\n\\t\\t}\\n\\t\\tcnt += a;\\n\\t}\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tr1 += x1[i] * (1 << i);\\n\\t\\tr2 += x2[i] * (1 << i);\\n\\t}\\n\\tcout << inversions(s, n, r1, r2) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 1428,\n \"score_of_the_acc\": -1.0065,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1345_1630409\",\n \"code_snippet\": \"#include <map>\\n#include <queue>\\n#include <string>\\n#include <vector>\\n#include <utility>\\n#include <iostream>\\n#include <algorithm>\\n\\n#define INF (1 << 29)\\n\\nusing namespace std;\\n\\nint BFS(string S, string T) // S --> T\\n{\\n\\tmap<string, int> D; D[S] = 1;\\n\\n\\tqueue<pair<string, int> > que; que.push(make_pair(S, 1));\\n\\n\\tif (S == T) { return 0; }\\n\\n\\twhile (!que.empty())\\n\\t{\\n\\t\\tstring S2 = que.front().first;\\n\\n\\t\\tint dist = que.front().second; que.pop();\\n\\n\\t\\tfor (int i = 0; i < T.size() - 1; i++)\\n\\t\\t{\\n\\t\\t\\tstring S3 = S2;\\n\\n\\t\\t\\tswap(S3[i], S3[i + 1]);\\n\\n\\t\\t\\tif (S3 == T) { return dist; }\\n\\n\\t\\t\\tif (D[S3] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tD[S3] = dist + 1;\\n\\n\\t\\t\\t\\tque.push(make_pair(S3, dist + 1));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn INF;\\n}\\n\\nint main()\\n{\\n\\tint N, M;\\n\\n\\tcin >> N >> M;\\n\\n\\tvector<int> B(N); for (int i = 0; i < N; i++) { cin >> B[i]; }\\n\\tvector<int> R(M); for (int i = 0; i < M; i++) { cin >> R[i]; }\\n\\n\\tstring S, T1, T2;\\n\\n\\tfor (int i = 0; i < N; i++) { S += B[i] + 48; }\\n\\n\\tfor (int i = 0; i < M; i++)\\n\\t{\\n\\t\\tfor (int j = 0; j < R[i]; j++) \\n\\t\\t{\\n\\t\\t\\tT1 += i % 2 + 48;\\n\\t\\t\\tT2 += (i + 1) % 2 + 48;\\n\\t\\t}\\n\\t}\\n\\n\\tint res1 = BFS(S, T1);\\n\\tint res2 = BFS(S, T2);\\n\\n\\tcout << min(res1, res2) << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.2007,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1345_1595066\",\n \"code_snippet\": \"#include<stdio.h>\\n#include <iostream>\\n#include <math.h>\\n#include <numeric>\\n#include <vector>\\n#include <map>\\n#include <functional>\\n#include <stdio.h>\\n#include <array>\\n#include <algorithm>\\n#include <string>\\n#include <assert.h>\\n#include <stdio.h>\\n#include <queue>\\n#include<iomanip>\\n#include<bitset>\\n#include<stack>\\nusing namespace std;\\n\\n//7:10\\n//\\n//#define REP(i,n) for(int i=0;i<(int)n;++i)\\n//#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n//#define ALL(c) (c).begin(), (c).end()\\n//\\n//typedef int Weight;\\n//struct Edge {\\n//\\tint src, dst;\\n//\\tWeight weight;\\n//\\tEdge(int src, int dst, Weight weight) :\\n//\\t\\tsrc(src), dst(dst), weight(weight) { }\\n//};\\n//bool operator < (const Edge &e, const Edge &f) {\\n//\\treturn e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!\\n//\\te.src != f.src ? e.src < f.src : e.dst < f.dst;\\n//}\\n//typedef vector<Edge> Edges;\\n//typedef vector<Edges> Graph;\\n//\\n//typedef vector<Weight> Array;\\n//typedef vector<Array> Matrix;\\n//\\n//#define RESIDUE(s,t) (capacity[s][t]-flow[s][t])\\n//Weight maximumFlow(const Graph &g, int s, int t) {\\n//\\tint n = g.size();\\n//\\tMatrix flow(n, Array(n)), capacity(n, Array(n));\\n//\\tREP(u, n) for (auto e = g[u].begin(); e != g[u].end();++e)capacity[e->src][e->dst] += e->weight;\\n//\\n//\\tWeight total = 0;\\n//\\twhile (1) {\\n//\\t\\tqueue<int> Q; Q.push(s);\\n//\\t\\tvector<int> prev(n, -1); prev[s] = s;\\n//\\t\\twhile (!Q.empty() && prev[t] < 0) {\\n//\\t\\t\\tint u = Q.front(); Q.pop();\\n//\\t\\t\\tfor (auto e = g[u].begin(); e != g[u].end(); ++e) if (prev[e->dst] < 0 && RESIDUE(u, e->dst) > 0) {\\n//\\t\\t\\t\\tprev[e->dst] = u;\\n//\\t\\t\\t\\tQ.push(e->dst);\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t\\tif (prev[t] < 0) return total; // prev[x] == -1 <=> t-side\\n//\\t\\tWeight inc = 999999999;\\n//\\t\\tfor (int j = t; prev[j] != j; j = prev[j])\\n//\\t\\t\\tinc = min(inc, RESIDUE(prev[j], j));\\n//\\t\\tfor (int j = t; prev[j] != j; j = prev[j])\\n//\\t\\t\\tflow[prev[j]][j] += inc, flow[j][prev[j]] -= inc;\\n//\\t\\ttotal += inc;\\n//\\t}\\n//\\treturn total;\\n//}\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst int mod = 1000000007;\\n\\nstruct Mod {\\n\\tlong long int num;\\n\\tMod() : num(0) { ; }\\n\\tMod(long long int n) : num((n % mod + mod) % mod) { ; }\\n\\toperator long long int() { return num; }\\n};\\n\\nMod operator+(Mod a, Mod b) { return Mod((a.num + b.num) % mod); }\\nMod operator-(Mod a, Mod b) { return Mod((mod + a.num - b.num) % mod); }\\nMod operator*(Mod a, Mod b) { return Mod(((long long)a.num * b.num) % mod); }\\nMod operator+=(Mod &a, Mod b) { return a = a + b; }\\nMod operator-=(Mod &a, Mod b) { return a = a - b; }\\nMod operator*=(Mod &a, Mod b) { return a = a * b; }\\nMod operator^(Mod a, int n) {\\n\\tif (n == 0) return Mod(1);\\n\\tMod res = (a * a) ^ (n / 2);\\n\\tif (n % 2) res = res * a;\\n\\treturn res;\\n}\\nMod inv(Mod a) { return a ^ (mod - 2); }\\nMod operator/(Mod a, Mod b) { return a * inv(b); }\\n\\n#define MAX_N 1024000\\n\\nMod fact[MAX_N], factinv[MAX_N];\\nvoid init() {\\n\\tfact[0] = Mod(1); factinv[0] = 1;\\n\\tREP(i, MAX_N - 1) {\\n\\t\\tfact[i + 1] = fact[i] * Mod(i + 1);\\n\\t\\tfactinv[i + 1] = factinv[i] / Mod(i + 1);\\n\\t}\\n}\\nMod comb(int a, int b) {\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\nlong long int memo[20];//nけた\\n\\nlong long int powint(long long int a, int b){\\n\\tif (b == 0)return 1;\\n\\tif (b == 1)return a;\\n\\telse{\\n\\t\\tlong long int ans = 1;\\n\\t\\tlong long int c = powint(a, b / 2);\\n\\t\\tans *= c*c;\\n\\t\\tans *= (b % 2) ? a : 1;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n\\nint backnum[100000][20];\\n\\nstruct Node{\\n\\tNode(int aid):children(),ancs(){\\n\\t\\tid=(aid);\\n\\t\\tfor (int i = 0; i < 20; ++i){\\n\\t\\t\\tancs[i] = -1;\\n\\t\\t}\\n\\t}\\n\\tint id;\\n\\tvector<int>children;\\n\\tarray<int, 20>ancs;\\n};\\n\\nint main()\\n{\\n\\tint N,M;\\n\\tcin >> N >> M;\\n\\tbitset<15>Moto;\\n\\tfor (int i = 0; i < N; ++i){\\n\\t\\tint a;\\n\\t\\tcin >> a;\\n\\t\\tMoto[i]=a;\\n\\t}\\n\\tvector<int>k;\\n\\t\\n\\tfor (int i = 0; i < M; ++i){\\n\\t\\tint a;\\n\\t\\tcin >> a;\\n\\t\\tk.emplace_back(a);\\n\\t}\\n\\tint ans = 9999;\\n\\t{\\n\\t\\tint a = 1;\\n\\t\\tbitset<15> Next1;\\n\\t\\tint count = 0;\\n\\t\\tfor (int i = 0; i < k.size(); ++i){\\n\\t\\t\\tfor (int j = 0; j < k[i]; ++j){\\n\\t\\t\\t\\tNext1[count++] = a;\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif (a)a = 0;\\n\\t\\t\\telse a = 1;\\n\\t\\t}\\n\\t\\tif (Moto.count() != Next1.count()){\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tvector<int>oneplace;\\n\\t\\t\\tvector<int>oneplace2;\\n\\t\\t\\tfor (int i = 0; i < N; ++i){\\n\\t\\t\\t\\tif (Moto[i])oneplace.push_back(i);\\n\\t\\t\\t\\tif (Next1[i])oneplace2.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tif (!oneplace.size()){\\n\\t\\t\\t\\tans = 0;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tint kotae = 0;\\n\\t\\t\\t\\tint mit = oneplace[0];\\n\\t\\t\\t\\tint nit = oneplace2[0];\\n\\t\\t\\t\\tkotae += abs(mit - nit);\\n\\t\\t\\t\\tfor (int i = 1; i < oneplace.size(); ++i){\\n\\t\\t\\t\\t\\tkotae += abs(oneplace[i] - oneplace2[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tans = min(ans, kotae);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tint a =0;\\n\\t\\tbitset<15> Next1;\\n\\t\\tint count = 0;\\n\\t\\tfor (int i = 0; i < k.size(); ++i){\\n\\t\\t\\tfor (int j = 0; j < k[i]; ++j){\\n\\t\\t\\t\\tNext1[count++] = a;\\n\\n\\t\\t\\t}\\n\\t\\t\\tif (a)a = 0;\\n\\t\\t\\telse a = 1;\\n\\t\\t}\\n\\t\\tif (Moto.count() != Next1.count()){\\n\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tvector<int>oneplace;\\n\\t\\t\\tvector<int>oneplace2;\\n\\t\\t\\tfor (int i = 0; i < N; ++i){\\n\\t\\t\\t\\tif (Moto[i])oneplace.push_back(i);\\n\\t\\t\\t\\tif (Next1[i])oneplace2.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\tif (!oneplace.size()){\\n\\t\\t\\t\\tans = 0;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tint kotae = 0;\\n\\t\\t\\t\\tint mit = oneplace[0];\\n\\t\\t\\t\\tint nit = oneplace2[0];\\n\\t\\t\\t\\tkotae += abs(mit - nit);\\n\\t\\t\\t\\tfor (int i = 1; i < oneplace.size(); ++i){\\n\\t\\t\\t\\t\\tkotae += abs(oneplace[i] - oneplace2[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tans = min(ans, kotae);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 19172,\n \"score_of_the_acc\": -1,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1345_1593230\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define LOG(...) fprintf(stderr,__VA_ARGS__)\\n//#define LOG(...)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(),(a).rend()\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort(ALL(c))\\n#define RSORT(c) sort(RALL(c))\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<bool> vb;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<vb> vvb;\\ntypedef vector<vi> vvi;\\ntypedef vector<vll> vvll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\n#define INF 10000\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n int start = 0;\\n REP(i, n) {\\n char c;\\n cin >> c;\\n start <<= 1;\\n start |= (c == '1' ? 1 : 0);\\n }\\n int goal = 0;\\n int t = 0;\\n REP(i, m) {\\n int bits;\\n cin >> bits;\\n REP(j, bits) {\\n goal <<= 1;\\n goal |= t & 1;\\n }\\n t = ~t;\\n }\\n int goal2 = ~goal & ((1 << n)-1);\\n// cout << bitset<15>(start) << endl;\\n// cout << bitset<15>(goal) << endl;\\n// cout << bitset<15>(~goal & ((1 << n)-1)) << endl;\\n\\n vvi dp(2, vi(1 << n, INF));\\n dp[0][start] = 0;\\n while (1) {\\n dp[1] = dp[0];\\n REP(step, 1 << n) {\\n if (dp[0][step] == INF) continue;\\n REP(i, n-1) {\\n int has_next = (step >> i) & 3;\\n if (has_next != 0 && has_next != 3) {\\n int next = step;\\n if (next & (1 << i)) {\\n next &= ~(1 << i);\\n } else {\\n next |= (1 << i);\\n }\\n if (next & (1 << (i+1))) {\\n next &= ~(1 << (i+1));\\n } else {\\n next |= (1 << (i+1));\\n }\\n// cout << bitset<15>(next) << endl;\\n dp[1][next] = min(dp[1][next], dp[0][step]+1);\\n }\\n }\\n }\\n dp[0] = dp[1];\\n\\n if (min(dp[0][goal], dp[0][goal2]) != INF) {\\n cout << min(dp[0][goal], dp[0][goal2]) << endl;\\n break;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.1428,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1345_1593187\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <climits>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <fstream>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <cassert>\\n#include <functional>\\n\\nusing namespace std;\\n\\n#define LOG(...) printf(__VA_ARGS__)\\n//#define LOG(...)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(),(a).rend()\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define RSORT(c) sort((c).rbegin(),(c).rend())\\n#define CLR(a) memset((a), 0 ,sizeof(a))\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<bool> vb;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<vb> vvb;\\ntypedef vector<vi> vvi;\\ntypedef vector<vll> vvll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\\nstruct st{\\nint bit;\\nint count;\\n};\\nint main() {\\nint n,m;\\n\\tcin>>n>>m;\\n\\tint bit=0;\\n\\tREP(i,n){\\n\\tint shift;\\n\\tcin >> shift;\\n\\tbit |= shift << (n - i-1);\\n\\t}\\n\\tvector<int> ans(m);\\n\\tREP(i,m){\\n\\t\\tcin>>ans[i];\\n\\t}\\n\\tint bit_ans=0;\\n\\tint bit_ans2;\\n\\tREP(i,m){\\n\\t\\tREP(j, ans[i]){\\n\\t\\t\\tbit_ans <<=1;\\n\\t\\t\\tif (i % 2 == 0){\\n\\t\\t\\tbit_ans|=1;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t}\\n\\t}\\n\\tbit_ans2=bit_ans^((1<<n)-1);\\n\\tint count=0;\\n\\tset<int> dp;\\n\\tdp.insert(bit);\\n\\tqueue<st> P;\\n\\tP.push({bit,0});\\n\\twhile (!P.empty()){\\n\\t\\tst p = P.front(); P.pop();\\n\\t\\tif (p.bit == bit_ans || p.bit == bit_ans2){\\n\\t\\tcount=p.count;\\n\\t\\tbreak;\\n\\t\\t}\\n\\t\\tREP(i,n-1){\\n\\t\\t\\tif ((p.bit | 1 << i) != (p.bit | 1 << (i + 1))){\\n\\t\\t\\t\\tint bitc = p.bit^3<<i;\\n\\t\\t\\t\\tif (dp.find(bitc) == dp.end()){\\n\\t\\t\\t\\t\\tdp.insert(bitc);\\n\\t\\t\\t\\t\\tP.push({ bitc, p.count + 1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<count<<endl;\\n}\",\n \"accuracy\": 0.04,\n \"time_ms\": 10,\n \"memory_kb\": 3808,\n \"score_of_the_acc\": -0.1398,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1345_1515205\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <queue>\\n#include <utility>\\n#include <algorithm>\\n#include <set>\\nusing namespace std;\\n\\nconst int INF = (1 << 29);\\ntypedef pair<string ,int> psi;\\n\\nint main(void) {\\n\\n int N, M; cin >> N >> M;\\n string b = \\\"\\\";\\n for (int i = 0; i < N; i++) {\\n int t; cin >> t;\\n b += t+'0';\\n }\\n string t1 = \\\"\\\", t2 = \\\"\\\";\\n for (int i = 0; i < M; i++) {\\n int p; cin >> p;\\n for (int j = 0; j < p; j++) {\\n if (i%2) {\\n t1 += '0';\\n t2 += '1';\\n } else {\\n t1 += '1';\\n t2 += '0';\\n }\\n }\\n }\\n\\n int ans1 = INF;\\n if (count(t1.begin(), t1.end(), '0') == count(b.begin(), b.end(), '0')) {\\n queue<psi> q1;\\n set<string> used;\\n q1.push(psi(t1,0));\\n used.insert(t1);\\n while (!q1.empty()) {\\n psi s = q1.front(); q1.pop();\\n if (s.first == b) {\\n ans1 = s.second;\\n break;\\n }\\n\\n for (int i = 0; i < N-1; i++) {\\n string tmp = s.first;\\n swap(tmp[i], tmp[i+1]);\\n if (used.find(tmp) == used.end()) {\\n q1.push(psi(tmp, s.second+1));\\n used.insert(tmp);\\n }\\n }\\n }\\n }\\n\\n int ans2 = INF;\\n if (count(t2.begin(), t2.end(), '0') == count(b.begin(), b.end(), '0')) {\\n queue<psi> q2;\\n set<string> used;\\n q2.push(psi(t2, 0));\\n used.insert(t2);\\n while (!q2.empty()) {\\n psi s = q2.front(); q2.pop();\\n if (s.first == b) {\\n ans2 = s.second;\\n break;\\n }\\n\\n for (int i = 0; i < N-1; i++) {\\n string tmp = s.first;\\n swap(tmp[i], tmp[i+1]);\\n if (used.find(tmp) == used.end()) {\\n q2.push(psi(tmp, s.second+1));\\n used.insert(tmp);\\n }\\n }\\n }\\n }\\n\\n cout << min(ans1, ans2) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1844,\n \"score_of_the_acc\": -0.0584,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1345_1464836\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <queue>\\n#include <bitset>\\n\\nusing namespace std;\\n\\nstruct state{\\n\\tvector< int > bits;\\n\\tint depth;\\n};\\n\\nvector< int > count_bits( vector< int > *b ) {\\n\\tvector< int > v;\\n\\tint cnt = 0;\\n\\tfor( int i = 0; i < b ->size(); i++ ) {\\n\\t\\tcnt ++;\\n\\t\\tif( i < b -> size() - 1 && b -> at( i ) != b -> at( i + 1 ) ) {\\n\\t\\t\\tv.push_back( cnt );\\n\\t\\t\\tcnt = 0;\\n\\t\\t}\\n\\t}\\n\\tv.push_back( cnt );\\n\\treturn v;\\n}\\n\\nbool isEqual( vector< int > *v, vector< int > *w ) {\\n\\tif( v->size() != w->size() ) return false;\\n\\tfor( int i = 0; i < v->size(); i++ ) {\\n\\t\\tif( v->at(i) != w->at(i) ) return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid swap_bits( vector< int > *b, int pos ) {\\n\\tint c = b -> at( pos );\\n\\tb -> at( pos ) = b -> at( pos + 1 );\\n\\tb -> at( pos + 1 ) = c;\\n\\treturn;\\n}\\n\\nint main(void){\\n\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tstate start;\\n\\tstart.bits = vector< int >( N, 0 );\\n\\tstart.depth = 0;\\n\\tvector< int > p( M, 0 );\\n\\tvector< bool > visited( 1 << N, false );\\n\\n\\tfor( int i = 0; i < N; i++ )\\n\\t\\tcin >> start.bits[i];\\n\\tfor( int i = 0; i < M; i++ )\\n\\t\\tcin >> p[i];\\n\\n\\tqueue< state > q;\\n\\tq.push( start );\\n\\n\\twhile( !q.empty() ) {\\n\\t\\t\\n\\t\\tstate cs = q.front();\\n\\t\\tq.pop();\\n\\t\\tvector< int > v = count_bits( &cs.bits );\\n\\t\\tif( isEqual( &v, &p ) ) { \\n\\t\\t\\tcout << cs.depth << endl;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor( int i = 0; i < N - 1; i++ ) {\\n\\t\\t\\tstate newstate;\\n\\t\\t\\tfor( int j = 0; j < N; j++ )\\n\\t\\t\\t\\tnewstate.bits.push_back( cs.bits[j] );\\n\\n\\t\\t\\tint n = 0;\\n\\t\\t\\tswap_bits( &newstate.bits, i );\\n\\n\\t\\t\\tfor( int j = 0; j < N; j++ ) {\\n\\t\\t\\t\\tif( newstate.bits[j] ) n |= ( 1 << j );\\n\\t\\t\\t}\\n\\n\\t\\t\\tif( visited[ n ] ) continue;\\n\\t\\t\\tvisited[n] = true;\\n\\n\\t\\t\\tnewstate.depth = cs.depth + 1;\\n\\t\\t\\t\\n\\t\\t\\tq.push( newstate );\\n\\t\\t}\\n\\n\\n\\t}\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1312,\n \"score_of_the_acc\": -0.0286,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1345_1445824\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <cstring>\\n#include <cassert>\\n#include <vector>\\n#include <queue>\\nusing namespace std;\\n\\ntemplate<class T>\\nostream& operator<<(ostream& os, const vector<T>& vs) {\\n if (vs.empty()) return os << \\\"[]\\\";\\n os << \\\"[\\\" << vs[0];\\n for (int i = 1; i < vs.size(); i++) os << \\\" \\\" << vs[i];\\n return os << \\\"]\\\";\\n}\\n\\nint N, M;\\nvector<int> S;\\nvector<int> T;\\nvoid input() {\\n cin >> N >> M;\\n S.clear(); S.resize(N);\\n for (int i = 0; i < N; i++) {\\n cin >> S[i];\\n }\\n T.clear(); T.resize(M);\\n for (int i = 0; i < M; i++) {\\n cin >> T[i];\\n }\\n}\\n\\nvector<int> A, B;\\nvoid init() {\\n A.clear(); B.clear();\\n int x = 0;\\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j < T[i]; j++) {\\n A.push_back(x);\\n }\\n x = !x;\\n }\\n x = 1;\\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j < T[i]; j++) {\\n B.push_back(x);\\n }\\n x = !x;\\n }\\n}\\n\\nconst int MAX_N = 15;\\n\\nstruct State {\\n vector<int> bit;\\n int t;\\n State(vector<int> bit, int t) : bit(bit), t(t) {}\\n};\\n\\nvoid solve() {\\n init();\\n map< vector<int>, bool > used;\\n queue<State> Q;\\n used[S] = true;\\n Q.push(State(S, 0));\\n while (!Q.empty()) {\\n State cur = Q.front(); Q.pop();\\n if (cur.bit == A || cur.bit == B) {\\n cout << cur.t << endl;\\n break;\\n }\\n for (int i = 0; i < N - 1; i++) {\\n vector<int> nbit = cur.bit;\\n if (nbit[i] == nbit[i + 1]) continue;\\n swap(nbit[i], nbit[i + 1]);\\n if (used[nbit]) continue;\\n used[nbit] = true;\\n Q.push(State(nbit, cur.t + 1));\\n }\\n }\\n}\\n\\nint main() {\\n input(); solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2256,\n \"score_of_the_acc\": -0.0529,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":796,"cells":{"group_id":{"kind":"string","value":"aoj_1341_cpp"},"problem_description":{"kind":"string","value":"Problem G:\nLongest Chain\nLet us compare two triples\na = (x\na\n, y\na\n, z\na\n)\nand\nb = (x\nb\n, y\nb\n, z\nb\n)\nby a partial order ∠ defined as follows.\na\n∠\nb\n⇔\nx\na\n<\nx\nb\nand\ny\na\n<\ny\nb\nand\nz\na\n<\nz\nb\nYour mission is to find, in the given set of triples, the longest ascending series\na\n1\n∠\na\n2\n∠ ... ∠\na\nk\n.\nInput\nThe input is a sequence of datasets, each specifying a set of triples formatted as follows.\nm\nn\nA\nB\nx\n1\ny\n1\nz\n1\nx\n2\ny\n2\nz\n2\n...\nx\nm\ny\nm\nz\nm\nHere,\nm\n,\nn\n,\nA\nand\nB\nin the first line, and all of\nx\ni\n,\ny\ni\nand\nz\ni\n(\ni\n= 1, . . . ,\nm\n) in the following lines are non-negative integers.\nEach dataset specifies a set of\nm + n\ntriples. The triples\np\n1\nthrough\np\nm\nare explicitly specified in the dataset, the\ni\n-th triple\np\ni\nbeing (\nx\ni\n, y\ni\n, z\ni\n)\n. The remaining\nn\ntriples are specified by parameters\nA\nand\nB\ngiven to the following generator routine.\nint a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\nRepeated 3\nn\ncalls of\nr()\ndefined as above yield values of\nx\nm+1\n,\ny\nm+1\n,\nz\nm+1\n,\nx\nm+2\n,\ny\nm+2\n,\nz\nm+2\n, ...,\nx\nm+n\n,\ny\nm+n\n, and\nz\nm+n\n, in this order.\nYou can assume that 1 ≤\nm + n\n≤ 3 × 10\n5\n, 1 ≤\nA,B\n≤ 2\n16\n, and 0 ≤\nx\nk\n, y\nk\n, z\nk\n< 10\n6\nfor 1 ≤\nk\n≤\nm + n\n.\nThe input ends with a line containing four zeros. The total of\nm + n\nfor all the datasets does not exceed 2 × 10\n6\n.\nOutput\nFor each dataset, output the length of the longest ascending series of triples in the specified set. If\np\ni\n1\n∠\np\ni\n2\n∠ ... ∠\np\ni\nk\nis the longest, the answer should be\nk\n.\nSample Input\n6 0 1 1\n0 0 0\n0 2 2\n1 1 1\n2 0 2\n2 2 0\n2 2 2\n5 0 1 1\n0 0 0\n1 1 1\n2 2 2\n3 3 3\n4 4 4\n10 0 1 1\n3 0 0\n2 1 0\n2 0 1\n1 2 0\n1 1 1\n1 0 2\n0 3 0\n0 2 1\n0 1 2\n0 0 3\n0 10 1 1\n0 0 0 0\nOutput for the Sample Input\n3\n5\n1\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1341_10853188","code_snippet":"#include<map>\n#include<set>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define MAXN 300010\nint A, B, C = ~(1<<31), M = (1<<16)-1;\nint myRand() {\n A = 36969 * (A & M) + (A >> 16);\n B = 18000 * (B & M) + (B >> 16);\n return (C & ((A << 16) + B)) % 1000000;\n}\nint N, zn, z[MAXN], f[MAXN], max[MAXN];\nstruct V {\n\tint x, y, z;\n\tbool operator < (const V &t) const {\n\t\tif(x != t.x) {\n\t\t\treturn x < t.x;\n\t\t}\n\t\treturn y > t.y;\n\t}\n}v[MAXN];\nstruct T {\n\tint id, x, y, z;\n\tbool operator < (const T &t) const {\n\t\tif(y != t.y) {\n\t\t\treturn y < t.y;\n\t\t}\n\t\tif(x != t.x) {\n\t\t\treturn x > t.x;\n\t\t}\n\t\treturn z > t.z;\n\t}\n}t[MAXN];\nint query(int x) {\n\tint ans = 0;\n\tfor(int i = x; i > 0; i -= i & -i) {\n\t\tans = std::max(ans, max[i]);\n\t}\n\treturn ans;\n}\nvoid update(int x, int v) {\n\tfor(int i = x; i <= zn; i += i & -i) {\n\t\tmax[i] = std::max(max[i], v);\n\t}\n}\nvoid clear(int x) {\n\tfor(int i = x; i <= zn; i += i & -i) {\n\t\tmax[i] = 0;\n\t}\n}\nvoid cdq(int x, int y) {\n\tif(x == y) {\n\t\treturn ;\n\t}\n\tint mid = (x + y) >> 1;\n\tcdq(x, mid);\n\tfor(int i = x; i <= y; i ++) {\n\t\tt[i].id = i;\n\t\tt[i].x = v[i].x, t[i].y = v[i].y, t[i].z = v[i].z;\n\t}\n\tstd::sort(t + x, t + y + 1);\n\tfor(int i = x; i <= y; i ++) {\n\t\tif(t[i].id <= mid) {\n\t\t\tupdate(t[i].z, f[t[i].id]);\n\t\t} else {\n\t\t\tf[t[i].id] = std::max(f[t[i].id], query(t[i].z - 1) + 1);\n\t\t}\n\t}\n\tfor(int i = x; i <= y; i ++) {\n\t\tif(t[i].id <= mid) {\n\t\t\tclear(t[i].z);\n\t\t}\n\t}\n\tcdq(mid + 1, y);\n}\nint main() {\n\t//freopen(\"test.in\", \"rb\", stdin);\n\tint m;\n\twhile(scanf(\"%d%d%d%d\", &N, &m, &A, &B), N + m > 0) {\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tscanf(\"%d%d%d\", &v[i].x, &v[i].y, &v[i].z);\n\t\t}\n\t\tfor(int i = 0; i < m; i ++) {\n\t\t\tv[N].x = myRand();\n\t\t\tv[N].y = myRand();\n\t\t\tv[N].z = myRand();\n\t\t\t++ N;\n\t\t}\n\t\tstd::sort(v, v + N);\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tz[i] = v[i].z;\n\t\t}\n\t\tstd::sort(z, z + N);\n\t\tzn = std::unique(z, z + N) - z;\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tv[i].z = std::lower_bound(z, z + zn, v[i].z) - z + 1;\n\t\t}\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tf[i] = 1;\n\t\t}\n\t\tcdq(0, N - 1);\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tans = std::max(ans, f[i]);\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1710,"memory_kb":14748,"score_of_the_acc":-0.147,"final_rank":9},{"submission_id":"aoj_1341_9277865","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i, a, b) for(ll i = a; i < b; i++)\n#define all(x) (x).begin(), (x).end()\n\nstruct FenwickTree {\n int n;\n vector<int> data;\n FenwickTree() = default;\n FenwickTree(int n) : n(n), data(n+1) {}\n\n int fold(int i) const {\n int ret = 0;\n for(;i>0;i-=i&-i) ret=max(ret,data[i]);\n return ret;\n }\n void update(int i, int x) {\n for(++i; i<=n; i+=i&-i) data[i]=max(data[i],x);\n }\n\n};\n\nstruct SegTree2D {\n int size;\n vector<int> xs;\n vector<vector<int>> ys;\n vector<FenwickTree> seg;\n\n int getx(int x) const {\n return lower_bound(all(xs), x)-xs.begin();\n }\n int gety(int k, int y) const {\n return lower_bound(all(ys[k]), y) - ys[k].begin();\n }\n\n SegTree2D(const vector<pair<int,int>>& pts){\n for (auto[x,y]:pts){\n xs.push_back(x);\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), xs.end());\n\n const int n =xs.size();\n size=1;\n while(size < n)size<<=1;\n ys.resize(2*size);\n seg.resize(2*size);\n\n for (auto[x,y]:pts){\n ys[size+getx(x)].push_back(y);\n }\n\n for(int i=size+n-1; i>0;--i){\n if (i>=size){\n sort(all(ys[i]));\n }else{\n merge(all(ys[2*i]), all(ys[2*i+1]), back_inserter(ys[i]));\n }\n ys[i].erase(unique(all(ys[i])), ys[i].end());\n }\n rep(i,1,size+n){\n seg[i]=FenwickTree(ys[i].size());\n }\n }\n\n void update(int x, int y, int val){\n int kx=getx(x);\n kx +=size;\n int ky=gety(kx,y);\n seg[kx].update(ky,val);\n while(kx>>=1){\n ky=gety(kx,y);\n // int kl=gety(2*kx,y), kr=gety(2*kx+1,y);\n // int vl=kl < ys[2*kx].size()&&ys[2*kx][kl]==y ? seg[2*kx][kl] : 0;\n // int vr=kr < ys[2*kx+1].size()&&ys[2*kx+1][kr]==y ? seg[2*kx+1][kr] : 0;\n seg[kx].update(ky, val);\n }\n }\n\n int fold(int tx, int ty) const {\n int ret = 0;\n for (int l = size, r=size+getx(tx); l < r; l >>= 1, r>>=1) {\n if (r&1){\n --r;\n ret = max(ret, seg[r].fold(gety(r, ty)));\n }\n }\n return ret;\n }\n\n};\n\nint main() {\n const int M = 1e6+10;\n vector<vector<pair<int,int>>> pts(M);\n\n while (true) {\n int n, m, A, B;\n cin >> m >> n >> A >> B;\n if (m + n == 0) break;\n\n int a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\n\n auto r = [&]() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n };\n\n vector<int> xs;\n vector<pair<int,int>> yz;\n\n rep(i,0,m){\n int x,y,z;\n cin>>x>>y>>z;\n pts[x].push_back({y, z});\n yz.push_back({y,z});\n xs.push_back(x);\n }\n\n rep(_,0,n){\n int x=r();\n int y=r();\n int z=r();\n pts[x].push_back({y,z});\n yz.push_back({y,z});\n xs.push_back(x);\n }\n\n sort(all(xs));\n xs.erase(unique(all(xs)), xs.end());\n\n SegTree2D seg(yz);\n\n int ans = 0;\n\n for(auto x:xs){\n vector<int> res;\n for(auto [y,z]:pts[x]){\n res.push_back(seg.fold(y,z)+1);\n ans=max(ans,res.back());\n }\n int k=0;\n for(auto[y,z]:pts[x]){\n seg.update(y,z,res[k++]);\n }\n pts[x].clear();\n }\n\n cout << ans << \"\\n\";\n cout << flush;\n }\n}","accuracy":1,"time_ms":5370,"memory_kb":168640,"score_of_the_acc":-1.6695,"final_rank":20},{"submission_id":"aoj_1341_8996636","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint solve(int m, int n, int A, int B) {\n vector<int> x(m), y(m), z(m);\n for(int i : rep(m)) x[i] = in(), y[i] = in(), z[i] = in();\n {\n int a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1;\n auto r = [&]() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n };\n for(int i : rep(n)) {\n x.push_back(r());\n y.push_back(r());\n z.push_back(r());\n }\n n = m + n;\n }\n\n vector<map<int,int>> dp; // lis\n for(int i : sort_idx(iota(n), [&](int i, int j) {\n if(z[i] != z[j]) return z[i] < z[j];\n if(x[i] != x[j]) return x[i] > x[j];\n return y[i] > y[j];\n })) {\n const int len = dp.size();\n int p = 1 + bin_search(-1, len, [&](int p) {\n // exist? * < (x, y)\n auto it = dp[p].lower_bound(x[i]);\n return it != dp[p].begin() and prev(it)->second < y[i];\n });\n\n // insert (x, y) to dp[p]\n if(p == len) {\n dp.push_back({{x[i], y[i]}});\n } else {\n // erase * >= (x, y)\n auto it = dp[p].lower_bound(x[i]);\n while(it != dp[p].end() and it->second >= y[i]) it = dp[p].erase(it);\n if(not(it != dp[p].begin() and prev(it)->second <= y[i])) dp[p].insert({x[i], y[i]});\n }\n }\n return dp.size();\n}\n\nint main() {\n while(true) {\n int m = in(), n = in(), A = in(), B = in();\n if(make_tuple(m, n, A, B) == make_tuple(0, 0, 0, 0)) return 0;\n print(solve(m, n, A, B));\n }\n}","accuracy":1,"time_ms":780,"memory_kb":15696,"score_of_the_acc":-0.0201,"final_rank":4},{"submission_id":"aoj_1341_8526024","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define TT template <typename T>\n#define MM << ' ' <<\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <typename T>\nT f(T x, T y) {\n return max(x, y);\n}\n\ntemplate <typename T>\nstruct BIT {\n int n;\n vector<T> a;\n\n BIT(vector<T> v) : n(sz(v)) {\n a.assign(n + 1, 0);\n copy(all(v), begin(a) + 1);\n for (int i = 2; i <= n; i <<= 1) {\n for (int j = i; j <= n; j += i) a[j] = f(a[j], a[j - i / 2]);\n }\n }\n\n BIT(int n, T x) : BIT(vector<T>(n, x)) {}\n\n void add(int i, T x) {\n for (i++; i <= n; i += (i & -i)) a[i] = f(a[i], x);\n }\n\n T sum(int i) {\n T ret = 0;\n for (; i > 0; i -= (i & -i)) ret = f(ret, a[i]);\n return ret;\n }\n};\n\ntemplate <typename T, typename C>\nstruct BIT2D {\n int n;\n vector<C> xs;\n vector<pair<C, C>> allPoints;\n vector<vector<C>> ys;\n vector<BIT<T>> bits;\n\n BIT2D() {}\n\n void insert(C x, C y) {\n xs.eb(x);\n allPoints.eb(x, y);\n }\n\n void build() {\n rearrange(xs);\n n = sz(xs);\n ys.resize(n + 1);\n for (auto [x, y] : allPoints) {\n int i = lb(xs, x);\n for (i++; i <= n; i += (i & -i)) ys[i].eb(y);\n }\n rep(i, n + 1) {\n rearrange(ys[i]);\n bits.eb(sz(ys[i]), 0);\n }\n }\n\n void add(C x, C y, T a) {\n int i = lb(xs, x);\n for (i++; i <= n; i += (i & -i)) {\n int j = lb(ys[i], y);\n bits[i].add(j, a);\n }\n }\n\n T sum(C x, C y) {\n int i = lb(xs, x);\n T ret = 0;\n for (; i > 0; i -= (i & -i)) {\n int j = lb(ys[i], y);\n ret = f(ret, bits[i].sum(j));\n }\n return ret;\n }\n};\n\nusing ull = unsigned long long;\n\nvoid solve() {\n int M, N;\n int A, B;\n cin >> M >> N >> A >> B;\n\n if (N == 0 && M == 0) exit(0);\n\n vector<int> x(M), y(M), z(M);\n rep(i, M) cin >> x[i] >> y[i] >> z[i];\n\n int a = A, b = B;\n auto rand = [&]() {\n int C = ~(1 << 31), M = (1 << 16) - 1;\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n };\n\n rep(i, 3 * N) {\n int t = rand();\n (i % 3 == 0 ? x : i % 3 == 1 ? y : z).eb(t);\n }\n\n N += M;\n\n // rep(i, N) cout << x[i] MM y[i] MM z[i] << '\\n';\n\n const int MAX = 1000000;\n\n BIT2D<int, int> bit;\n vector<vector<int>> ids(MAX);\n\n rep(i, N) {\n ids[z[i]].eb(i);\n bit.insert(x[i], y[i]);\n }\n bit.build();\n\n vector<int> dp(N, -inf);\n\n rep(i, MAX) {\n each(e, ids[i]) {\n dp[e] = bit.sum(x[e], y[e]) + 1; //\n }\n each(e, ids[i]) {\n bit.add(x[e], y[e], dp[e]); //\n }\n }\n\n cout << *max_element(all(dp)) << '\\n';\n}\n\nint main() {\n while (true) solve(); //\n}","accuracy":1,"time_ms":4100,"memory_kb":109136,"score_of_the_acc":-1.1016,"final_rank":16},{"submission_id":"aoj_1341_8280278","code_snippet":"#include <iostream>\n#include <tuple>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nclass RangeMax {\npublic:\n\tint size_ = 1;\n\tvector<int> dat;\n\n\tvoid init(int sz) {\n\t\twhile (size_ <= sz) size_ *= 2;\n\t\tdat.resize(size_ * 2, -1000000);\n\t}\n\n\tvoid update(int pos, int x) {\n\t\tpos += size_;\n\t\tdat[pos] = x;\n\t\twhile (pos >= 2) {\n\t\t\tpos >>= 1;\n\t\t\tdat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);\n\t\t}\n\t}\n\n\tint query_(int l, int r, int a, int b, int u) {\n\t\tif (l <= a && b <= r) return dat[u];\n\t\tif (r <= a || b <= l) return -(1 << 30);\n\t\tint v1 = query_(l, r, a, (a + b) / 2, u * 2);\n\t\tint v2 = query_(l, r, (a + b) / 2, b, u * 2 + 1);\n\t\treturn max(v1, v2);\n\t}\n\n\tint query(int l, int r) {\n\t\treturn query_(l, r, 0, size_, 1);\n\t}\n};\n\n// 誤読で 20 分溶かした．\nint M, N, A, B;\nint X[300009], Y[300009], Z[300009];\nint Bar[300009];\nint dp[300009];\nvector<int> LX, LY, LZ;\nRangeMax W;\n\nvoid Generate() {\n\tint a = A, b = B, C = ~(1 << 31), MM = (1 << 16) - 1;\n\tfor (int i = 0; i < 3 * N; i++) {\n\t\ta = 36969 * (a & MM) + (a >> 16);\n\t\tb = 18000 * (b & MM) + (b >> 16);\n\t\tint val = (C & ((a << 16) + b)) % 1000000;\n\t\tif (i % 3 == 0) X[M + i / 3] = val;\n\t\tif (i % 3 == 1) Y[M + i / 3] = val;\n\t\tif (i % 3 == 2) Z[M + i / 3] = val;\n\t}\n}\n\nvoid dfs(int cl, int cr) {\n\tif (cr - cl == 1) return;\n\tint cm = (cl + cr) / 2;\n\tint pl = Bar[cl];\n\tint pm = Bar[cm];\n\tint pr = Bar[cr];\n\n\t// Recursion 1\n\tdfs(cl, cm);\n\n\t// Initialize\n\tvector<pair<int, int>> List;\n\tfor (int i = pl; i < pm; i++) List.push_back(make_pair(Y[i], i));\n\tfor (int i = pm; i < pr; i++) List.push_back(make_pair(Y[i], -i));\n\tsort(List.begin(), List.end());\n\n\t// Main Query\n\tfor (int i = 0; i < List.size(); i++) {\n\t\tint idx = abs(List[i].second);\n\t\tif (idx < pm) {\n\t\t\tW.update(Z[idx], max(W.dat[Z[idx] + W.size_], dp[idx]));\n\t\t}\n\t\tif (idx >= pm) {\n\t\t\tdp[idx] = max(dp[idx], W.query(0, Z[idx]) + 1);\n\t\t}\n\t}\n\n\t// Reset\n\tfor (int i = 0; i < List.size(); i++) {\n\t\tint idx = abs(List[i].second);\n\t\tif (idx < pm) W.update(Z[idx], -1000000);\n\t}\n\n\t// Recursion 2\n\tdfs(cm, cr);\n}\n\nint Solve() {\n\t// Step 1. Compression\n\tLX.clear();\n\tLY.clear();\n\tLZ.clear();\n\tfor (int i = 0; i < M + N; i++) LX.push_back(X[i]);\n\tfor (int i = 0; i < M + N; i++) LY.push_back(Y[i]);\n\tfor (int i = 0; i < M + N; i++) LZ.push_back(Z[i]);\n\tsort(LX.begin(), LX.end()); LX.erase(unique(LX.begin(), LX.end()), LX.end());\n\tsort(LY.begin(), LY.end()); LY.erase(unique(LY.begin(), LY.end()), LY.end());\n\tsort(LZ.begin(), LZ.end()); LZ.erase(unique(LZ.begin(), LZ.end()), LZ.end());\n\tfor (int i = 0; i < M + N; i++) X[i] = lower_bound(LX.begin(), LX.end(), X[i]) - LX.begin();\n\tfor (int i = 0; i < M + N; i++) Y[i] = lower_bound(LY.begin(), LY.end(), Y[i]) - LY.begin();\n\tfor (int i = 0; i < M + N; i++) Z[i] = lower_bound(LZ.begin(), LZ.end(), Z[i]) - LZ.begin();\n\tW.init(LZ.size() + 2);\n\n\t// Step 2. Sorting\n\tvector<tuple<int, int, int>> tup;\n\tfor (int i = 0; i < M + N; i++) tup.push_back(make_tuple(X[i], Y[i], Z[i]));\n\tsort(tup.begin(), tup.end());\n\tfor (int i = 0; i < M + N; i++) {\n\t\tX[i] = get<0>(tup[i]);\n\t\tY[i] = get<1>(tup[i]);\n\t\tZ[i] = get<2>(tup[i]);\n\t}\n\tfor (int i = 0; i <= LX.size(); i++) Bar[i] = 0;\n\tfor (int i = 0; i < M + N; i++) Bar[X[i] + 1] += 1;\n\tfor (int i = 1; i <= LX.size(); i++) Bar[i] += Bar[i - 1];\n\n\t// Step 3. Divide and Conquer\n\tfor (int i = 0; i < M + N; i++) dp[i] = 1;\n\tdfs(0, LX.size());\n\tint maxn = 0;\n\tfor (int i = 0; i < M + N; i++) maxn = max(maxn, dp[i]);\n\treturn maxn;\n}\n\nint main() {\n\twhile (true) {\n\t\tcin >> M >> N >> A >> B;\n\t\tif (M + N + A + B == 0) break;\n\t\tfor (int i = 0; i < M; i++) cin >> X[i] >> Y[i] >> Z[i];\n\t\tGenerate();\n\t\tcout << Solve() << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3630,"memory_kb":28636,"score_of_the_acc":-0.5118,"final_rank":11},{"submission_id":"aoj_1341_7254860","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-12;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define dump_list2D(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n////using mint = modint1000000007;\n//using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\n//【狭義単調な点列】\n/*\n* Monotonous_points<T>(bool y_greater = true, T inf = max(T)/2) : O(1)\n*\t空で初期化する．x 座標は狭義単調増加で，y 座標は y_greater=true[false] なら狭義単調増加[減少]とする．\n* \n* void insert(T x, T y) : ならし O(log n)\n*\t点 (x, y) を挿入し，それにより単調性に違反する点は全て削除する．\n*\n* bool find_LL(T x, T y, bool strict = true) : O(log n)\n*\tx' < x かつ y' < y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\n*\n* bool find_LG(T x, T y, bool strict = true) : O(log n)\n*\tx' < x かつ y' > y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\n*\n* bool find_GL(T x, T y, bool strict = true) : O(log n)\n*\tx' > x かつ y' < y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\n* \n* bool find_GG(T x, T y, bool strict = true) : O(log n)\n*\tx' > x かつ y' > y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\n* \n* pTT lower_bound(T x) : O(log n)\n*\tx' >= x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\n* \n* pTT upper_bound(T x) : O(log n)\n*\tx' > x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\n* \n* pTT lower_bound_rev(T x) : O(log n)\n*\tx' <= x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\n* \n* pTT upper_bound_rev(T x) : O(log n)\n*\tx' < x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\n*/\ntemplate <class T>\nstruct Monotonous_points {\n\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\n\n\tbool y_greater;\n\tT inf;\n\n\t// x, y 両座標ともに狭義単調増加な点列\n\tmap<T, T> x_to_y;\n\n\t// 空で初期化\n\tMonotonous_points(bool y_greater = true, T inf_ = -1) : y_greater(y_greater) {\n\t\tinf = (inf_ == -1 ? numeric_limits<T>::max() / 2 : inf_);\n\n\t\t// 番兵を挿入しておく．\n\t\tif (y_greater) { x_to_y[-inf] = -inf; x_to_y[inf] = inf; }\n\t\telse { x_to_y[-inf] = inf; x_to_y[inf] = -inf; }\n\t}\n\n\t// 点 (x, y) を挿入し，単調性に違反する点は全て削除する．\n\tvoid insert(T x, T y) {\n\t\t// verify : https://atcoder.jp/contests/abc283/tasks/abc283_f\n\n\t\t// x <= x' なる最小の x' を指すイテレータを得る．\n\t\tauto it = x_to_y.lower_bound(x);\n\n\t\t// x' から昇順に，y' <= y[ y' >= y ] である限り要素を削除する．\n\t\tif (y_greater) {\n\t\t\twhile (true) {\n\t\t\t\tif (it->second > y) break;\n\t\t\t\tit = x_to_y.erase(it);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\twhile (true) {\n\t\t\t\tif (it->second < y) break;\n\t\t\t\tit = x_to_y.erase(it);\n\t\t\t}\n\t\t}\n\n\t\t// x' から降順に，y' >= y[ y' <= y ] である限り要素を削除する．\n\t\tif (y_greater) {\n\t\t\twhile (true) {\n\t\t\t\tit = prev(it);\n\t\t\t\tif (it->second < y) break;\n\t\t\t\tit = x_to_y.erase(it);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\twhile (true) {\n\t\t\t\tit = prev(it);\n\t\t\t\tif (it->second > y) break;\n\t\t\t\tit = x_to_y.erase(it);\n\t\t\t}\n\t\t}\n\n\t\t// 点 (x, y) を挿入する．\n\t\tx_to_y[x] = y;\n\t}\n\n\t// x' < x かつ y' < y なる点が存在するかを返す（strict=false なら等号も許す）\n\tbool find_LL(T x, T y, bool strict = true) {\n\t\tif (strict) {\n\t\t\tT y2 = prev(x_to_y.lower_bound(x))->second;\n\t\t\treturn y2 != -inf && y2 < y;\n\t\t}\n\t\telse {\n\t\t\tT y2 = prev(x_to_y.upper_bound(x))->second;\n\t\t\treturn y2 != -inf && y2 <= y;\n\t\t}\n\t}\n\n\t// x' < x かつ y' > y なる点が存在するかを返す（strict=false なら等号も許す）\n\tbool find_LG(T x, T y, bool strict = true) {\n\t\tif (strict) {\n\t\t\tT y2 = prev(x_to_y.lower_bound(x))->second;\n\t\t\treturn y2 != inf && y2 > y;\n\t\t}\n\t\telse {\n\t\t\tT y2 = prev(x_to_y.upper_bound(x))->second;\n\t\t\treturn y2 != inf && y2 >= y;\n\t\t}\n\t}\n\n\t// x' > x かつ y' < y なる点が存在するかを返す（strict=false なら等号も許す）\n\tbool find_GL(T x, T y, bool strict = true) {\n\t\tif (strict) {\n\t\t\tT y2 = x_to_y.upper_bound(x)->second;\n\t\t\treturn y2 != -inf && y2 < y;\n\t\t}\n\t\telse {\n\t\t\tT y2 = x_to_y.lower_bound(x)->second;\n\t\t\treturn y2 != -inf && y2 <= y;\n\t\t}\n\t}\n\n\t// x' > x かつ y' > y なる点が存在するかを返す（strict=false なら等号も許す）\n\tbool find_GG(T x, T y, bool strict = true) {\n\t\tif (strict) {\n\t\t\tT y2 = x_to_y.upper_bound(x)->second;\n\t\t\treturn y2 != inf && y2 > y;\n\t\t}\n\t\telse {\n\t\t\tT y2 = x_to_y.lower_bound(x)->second;\n\t\t\treturn y2 != inf && y2 >= y;\n\t\t}\n\t}\n\n\t// x' >= x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\n\tpair<T, T> lower_bound(T x) {\n\t\treturn *x_to_y.lower_bound(x);\n\t}\n\n\t// x' > x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\n\tpair<T, T> upper_bound(T x) {\n\t\treturn *x_to_y.upper_bound(x);\n\t}\n\n\t// x' <= x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\n\tpair<T, T> lower_bound_rev(T x) {\n\t\treturn *prev(x_to_y.upper_bound(x));\n\t}\n\n\t// x' < x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\n\tpair<T, T> upper_bound_rev(T x) {\n\t\treturn *prev(x_to_y.lower_bound(x));\n\t}\n\n#ifdef _MSC_VER\n\tfriend ostream& operator<<(ostream& os, const Monotonous_points& mp) {\n\t\trepe(p, mp.x_to_y) if (abs(p.first) != mp.inf) os << p << \" \";\n\t\treturn os;\n\t}\n#endif\n}; \n\n\n//【めぐる式二分探索】O(log|ok - ng|)\n/*\n* 条件 okQ() を満たす要素 ok と満たさない要素 ng との境界を二分探索する．\n* 境界に隣り合うような条件を満たす要素（ok 側）の位置を返す．\n*/\ntemplate <typename T>\nT meguru_search(T ok, T ng, function<bool(T)>& okQ) {\n\t// 参考 : https://twitter.com/meguru_comp/status/697008509376835584\n\t// verify : https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_4_D\n\n\t// 境界が決定するまで\n\twhile (abs(ok - ng) > 1) {\n\t\t// 区間の中間\n\t\tT mid = (ok + ng) / 2;\n\n\t\t// 中間が OK かどうかに応じて区間を縮小する．\n\t\tif (okQ(mid)) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn ok;\n\n\t/* okQ の定義の雛形\n\tusing T = ll;\n\tfunction<bool(T)> okQ = [&](T x) {\n\t\treturn true || false;\n\t};\n\t*/\n}\n\n\n//【最長増加部分列（二次元）】O(n (log n)^2)\n/*\n* 数列 a[0..n), b[0..n) について，添字の増加列 t_0 < ... < t_(k-1) で，\n*\t\t∀i∈[0..k-1), a[t_i] < a[t_(i+1)] かつ b[t_i] < b[t_(i+1)]\n* を満たすものの長さ k の最大値を返す．\n*\n* 利用：【狭義単調な点列】，【めぐる式二分探索】\n*/\ntemplate <class T>\nint longest_increasing_subsequence_2D(const vector<T>& a, const vector<T>& b) {\n\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\n\t// verify : https://onlinejudge.u-aizu.ac.jp/problems/1341\n\n\tint n = sz(a);\n\n\t// ps[j] : その要素を末尾にもつ長さ j の増加部分列が存在するような点（ps[0] は使わない）\n\tvector<Monotonous_points<T>> ps(1);\n\n\trep(i, n) {\n\t\t// j : (a[i], b[i]) を末尾に持つ増加部分列の最大長\n\t\tfunction<bool(int)> okQ = [&](int j) { return ps[j].find_LL(a[i], b[i]); };\n\t\tint j = meguru_search(0, sz(ps), okQ) + 1;\n\n\t\t// 点 (a[i], b[i]) を挿入する．\n\t\tif (j >= sz(ps)) ps.push_back(Monotonous_points<T>(false));\n\t\tif (!ps[j].find_LL(a[i], b[i], false)) ps[j].insert(a[i], b[i]);\n\n\t\tdump(i); dump(ps);\n\t}\n\n\treturn sz(ps) - 1;\n}\n\n\nint a, b, C = ~(1 << 31), M = (1 << 16) - 1;\nint r() {\n\ta = 36969 * (a & M) + (a >> 16);\n\tb = 18000 * (b & M) + (b >> 16);\n\treturn (C & ((a << 16) + b)) % 1000000;\n}\n\n\nint solve(int N, vi x, vi y, vi z) {\n\tvector<tuple<int, int, int>> xyz(N);\n\trep(i, N) xyz[i] = { -x[i], y[i], z[i] };\n\tsort(all(xyz), greater<tuple<int, int, int>>());\n\n\trep(i, N) tie(x[i], y[i], z[i]) = xyz[i];\n\tdump(y); dump(z);\n\n\treturn longest_increasing_subsequence_2D(y, z);\n}\n\n\n//【最長パス】O(|V| + |E|)\n/*\n* DAG g の頂点 s からの最長パスの長さを len[s] に格納し len を返す．\n*/\nvi longest_path(const Graph& g) {\n\t// verify : https://atcoder.jp/contests/dp/tasks/dp_g\n\n\tint n = sz(g);\n\n\t// len[s] : 頂点 s からの最長パスの長さ\n\tvi len(n);\n\tvb seen(n);\n\n\tfunction<int(int)> dfs = [&](int s) {\n\t\tif (seen[s]) return len[s];\n\t\tseen[s] = true;\n\t\tlen[s] = 0;\n\n\t\t// s → t と進む場合\n\t\trepe(t, g[s]) chmax(len[s], dfs(t) + 1);\n\n\t\treturn len[s];\n\t};\n\n\t// 各頂点 s についての情報を計算する．\n\trep(s, n) if (!seen[s]) dfs(s);\n\n\treturn len;\n}\n\n\nint naive(int N, vi x, vi y, vi z) {\n\tGraph g(N);\n\n\trep(i, N) rep(j, N) {\n\t\tif (x[i] < x[j] && y[i] < y[j] && z[i] < z[j]) {\n\t\t\tg[i].push_back(j);\n\t\t}\n\t}\n\n\tauto len = longest_path(g);\n\n\treturn *max_element(all(len)) + 1;\n}\n\n\nvoid bug_find() {\n#ifdef _MSC_VER\n\t// 合わない入力例を見つける．\n\n\tmt19937_64 mt;\n\tmt.seed((int)time(NULL));\n\tuniform_int_distribution<ll> rnd(0LL, 1LL << 62);\n\n\tmute_dump = true;\n\n\trep(hoge, 1000) {\n\t\tint n = 50;\n\t\tvi x(n), y(n), z(n);\n\t\trep(i, n) {\n\t\t\tx[i] = rnd(mt) % 10;\n\t\t\ty[i] = rnd(mt) % 10;\n\t\t\tz[i] = rnd(mt) % 10;\n\t\t}\n\n\t\tauto res_naive = naive(n, x, y, z);\n\t\tauto res_solve = solve(n, x, y, z);\n\n\t\tif (res_naive != res_solve) {\n\t\t\tcout << \"----------error!----------\" << endl;\n\t\t\tcout << \"input:\" << endl;\n\t\t\tcout << x << endl;\n\t\t\tcout << y << endl;\n\t\t\tcout << z << endl;\n\t\t\tcout << \"results:\" << endl;\n\t\t\tcout << res_naive << endl;\n\t\t\tcout << res_solve << endl;\n\t\t\tcout << \"--------------------------\" << endl;\n\t\t}\n\t}\n\n\tmute_dump = false;\n\texit(0);\n#endif\n}\n/*\n----------error!----------\ninput:\n0 2 8 3 6\n4 2 2 0 0\n2 0 2 0 9\nresults:\n2\n1\n--------------------------\n*/\n\n\nint main() {\n\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tbug_find();\n\n\twhile (1) {\n\t\tint m, n;\n\t\tcin >> m >> n >> a >> b;\n\t\tdump(m, n, a, b);\n\n\t\tif (m == 0 && n == 0) return 0;\n\n\t\tvi x(m + n), y(m + n), z(m + n);\n\t\trep(i, m) cin >> x[i] >> y[i] >> z[i];\n\t\trep(i, n) { x[m + i] = r(); y[m + i] = r(); z[m + i] = r(); }\n\n\t\tdump(naive(m + n, x, y, z));\n\t\tcout << solve(m + n, x, y, z) << endl;\n\t}\n}","accuracy":1,"time_ms":850,"memory_kb":25092,"score_of_the_acc":-0.0911,"final_rank":7},{"submission_id":"aoj_1341_7244624","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-12;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define dump_list2D(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n////using mint = modint1000000007;\n//using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\n//【めぐる式二分探索】O(log|ok - ng|)\n/*\n* 条件 okQ() を満たす要素 ok と満たさない要素 ng との境界を二分探索する．\n* 境界に隣り合うような条件を満たす要素（ok 側）の位置を返す．\n*/\ntemplate <typename T>\nT meguru_search(T ok, T ng, function<bool(T)>& okQ) {\n\t// 参考 : https://twitter.com/meguru_comp/status/697008509376835584\n\t// verify : https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_4_D\n\n\t// 境界が決定するまで\n\twhile (abs(ok - ng) > 1) {\n\t\t// 区間の中間\n\t\tT mid = (ok + ng) / 2;\n\n\t\t// 中間が OK かどうかに応じて区間を縮小する．\n\t\tif (okQ(mid)) ok = mid;\n\t\telse ng = mid;\n\t}\n\treturn ok;\n\n\t/* okQ の定義の雛形\n\tusing T = ll;\n\tfunction<bool(T)> okQ = [&](T x) {\n\t\treturn true || false;\n\t};\n\t*/\n}\n\n\n//【狭義単調な点列】\n/*\n* Monotonous_points<T>() : O(1)\n*\t空で初期化する．\n* \n* void insert(T x, T y) : ならし O(log n)\n*\t点 (x, y) を挿入し，x <= x' かつ y <= y' なる点 (x', y') は全て削除する．\n* \n* bool find(T x, T y) : O(log n)\n*\tx' < x かつ y' < y なる点が存在するかを返す．\n*/\ntemplate <class T>\nclass Monotonous_points {\n\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\n\n\t// x 座標狭義昇順に保持した点のリスト（y 座標は狭義降順）\n\tmap<T, T> x_to_y;\n\npublic:\n\t// 空で初期化\n\tMonotonous_points() {}\n\n\t// 点 (x, y) を挿入し，x <= x' かつ y <= y' なる点 (x', y') は全て削除する．\n\tvoid insert(T x, T y) {\n\t\t// x <= x' なる最小の x' を指すイテレータを得る．\n\t\tauto it = x_to_y.lower_bound(x);\n\n\t\t// x' から昇順に，y <= y' である限り要素を削除する．\n\t\twhile (it != x_to_y.end()) {\n\t\t\tif (it->second < y) break;\n\n\t\t\tit = x_to_y.erase(it);\n\t\t}\n\n\t\t// 点 (x, y) を挿入する．\n\t\tif (it == x_to_y.end() || it->first != x) x_to_y[x] = y;\n\t}\n\n\t// x' < x かつ y' < y なる点が存在するかを返す．\n\tbool find(T x, T y) {\n\t\t// x <= x' なる最小の x' を指すイテレータを得る．\n\t\tauto it = x_to_y.lower_bound(x);\n\n\t\t// その直前の要素が条件を満たさないなら他の要素もだめ．\n\t\treturn it != x_to_y.begin() && prev(it)->second < y;\n\t}\n\n#ifdef _MSC_VER\n\tfriend ostream& operator<<(ostream& os, const Monotonous_points& mp) {\n\t\trepe(p, mp.x_to_y) os << p << \" \";\n\t\treturn os;\n\t}\n#endif\n};\n\n\n//【最長増加部分列（二次元）】O(n (log n)^2)\n/*\n* 数列 a[0..n), b[0..n) について，添字の増加列 t_0 < ... < t_(k-1) で，\n*\t\t∀i∈[0..k-1), a[t_i] < a[t_(i+1)] かつ b[t_i] < b[t_(i+1)]\n* を満たすものの長さ k の最大値を返す．\n* \n* 利用：【狭義単調な点列】，【めぐる式二分探索】\n*/\ntemplate <class T>\nint longest_increasing_subsequence_2D(const vector<T>& a, const vector<T>& b) {\n\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\n\n\tint n = sz(a);\n\n\t// ps[j] : その要素を末尾にもつ長さ j の増加部分列が存在するような点（ps[0] は使わない）\n\tvector<Monotonous_points<T>> ps(1);\n\n\trep(i, n) {\n\t\t// j : (a[i], b[i]) を末尾に持つ増加部分列の最大長\n\t\tfunction<bool(int)> okQ = [&](int j) { return ps[j].find(a[i], b[i]); };\n\t\tint j = meguru_search(0, sz(ps), okQ) + 1;\n\n\t\t// 点 (a[i], b[i]) を挿入する．\n\t\tif (j >= sz(ps)) ps.push_back(Monotonous_points<T>());\n\t\tps[j].insert(a[i], b[i]);\n\n\t\tdump(i); dump(ps);\n\t}\n\n\treturn sz(ps) - 1;\n}\n\n\nint a, b, C = ~(1 << 31), M = (1 << 16) - 1;\nint r() {\n\ta = 36969 * (a & M) + (a >> 16);\n\tb = 18000 * (b & M) + (b >> 16);\n\treturn (C & ((a << 16) + b)) % 1000000;\n}\n\n\nint solve(int N, vi x, vi y, vi z) {\n\tvector<tuple<int, int, int>> xyz(N);\n\trep(i, N) xyz[i] = { -x[i], y[i], z[i] };\n\tsort(all(xyz), greater<tuple<int, int, int>>());\n\n\trep(i, N) tie(x[i], y[i], z[i]) = xyz[i];\n\tdump(y); dump(z);\n\n\treturn longest_increasing_subsequence_2D(y, z);\n}\n\n\n//【最長パス】O(|V| + |E|)\n/*\n* DAG g の頂点 s からの最長パスの長さを len[s] に格納し len を返す．\n*/\nvi longest_path(const Graph& g) {\n\t// verify : https://atcoder.jp/contests/dp/tasks/dp_g\n\n\tint n = sz(g);\n\n\t// len[s] : 頂点 s からの最長パスの長さ\n\tvi len(n);\n\tvb seen(n);\n\n\tfunction<int(int)> dfs = [&](int s) {\n\t\tif (seen[s]) return len[s];\n\t\tseen[s] = true;\n\t\tlen[s] = 0;\n\n\t\t// s → t と進む場合\n\t\trepe(t, g[s]) chmax(len[s], dfs(t) + 1);\n\n\t\treturn len[s];\n\t};\n\n\t// 各頂点 s についての情報を計算する．\n\trep(s, n) if (!seen[s]) dfs(s);\n\n\treturn len;\n}\n\n\nint naive(int N, vi x, vi y, vi z) {\n\tGraph g(N);\n\n\trep(i, N) rep(j, N) {\n\t\tif (x[i] < x[j] && y[i] < y[j] && z[i] < z[j]) {\n\t\t\tg[i].push_back(j);\n\t\t}\n\t}\n\n\tauto len = longest_path(g);\n\n\treturn *max_element(all(len)) + 1;\n}\n\n\nvoid bug_find() {\n#ifdef _MSC_VER\n\t// 合わない入力例を見つける．\n\n\tmt19937_64 mt;\n\tmt.seed((int)time(NULL));\n\tuniform_int_distribution<ll> rnd(0LL, 1LL << 62);\n\n\tmute_dump = true;\n\n\trep(hoge, 1000) {\n\t\tint n = 50;\n\t\tvi x(n), y(n), z(n);\n\t\trep(i, n) {\n\t\t\tx[i] = rnd(mt) % 10;\n\t\t\ty[i] = rnd(mt) % 10;\n\t\t\tz[i] = rnd(mt) % 10;\n\t\t}\n\n\t\tauto res_naive = naive(n, x, y, z);\n\t\tauto res_solve = solve(n, x, y, z);\n\n\t\tif (res_naive != res_solve) {\n\t\t\tcout << \"----------error!----------\" << endl;\n\t\t\tcout << \"input:\" << endl;\n\t\t\tcout << x << endl;\n\t\t\tcout << y << endl;\n\t\t\tcout << z << endl;\n\t\t\tcout << \"results:\" << endl;\n\t\t\tcout << res_naive << endl;\n\t\t\tcout << res_solve << endl;\n\t\t\tcout << \"--------------------------\" << endl;\n\t\t}\n\t}\n\n\tmute_dump = false;\n\texit(0);\n#endif\n}\n/*\n----------error!----------\ninput:\n0 2 8 3 6\n4 2 2 0 0\n2 0 2 0 9\nresults:\n2\n1\n--------------------------\n*/\n\n\nint main() {\n\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tbug_find();\n\n\twhile (1) {\n\t\tint m, n;\n\t\tcin >> m >> n >> a >> b;\n\t\tdump(m, n, a, b);\n\n\t\tif (m == 0 && n == 0) return 0;\n\n\t\tvi x(m + n), y(m + n), z(m + n);\n\t\trep(i, m) cin >> x[i] >> y[i] >> z[i];\n\t\trep(i, n) { x[m + i] = r(); y[m + i] = r(); z[m + i] = r(); }\n\n\t\tdump(naive(m + n, x, y, z));\n\t\tcout << solve(m + n, x, y, z) << endl;\n\t}\n}","accuracy":1,"time_ms":720,"memory_kb":19752,"score_of_the_acc":-0.0379,"final_rank":5},{"submission_id":"aoj_1341_7244186","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing namespace std::chrono;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n#define REP(i, n) for(int i = 0;i < (n);i++)\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\nconst int mod=1000000007;\nconst llint inf=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-10;\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\n\ntemplate<class T> using V=vector<T>;\ntemplate<class T> using VV=vector<V<T>>;\ntemplate<class T>struct Fenwick{\n\tint n;\n\tV<T> seg;\n\tFenwick(int _n=0):n(_n),seg(n+1){}\n\tvoid add(int i,int x){\n\t\ti++;\n\t\twhile(i<=n){\n\t\t\tchmax(seg[i],x);\n\t\t\ti+=i&-i;\n\t\t}\n\t}\n\tT max(int i){\n\t\tT s=0;\n\t\twhile(i>0){\n\t\t\tchmax(s,seg[i]);\n\t\t\ti-=i&-i;\n\t\t}\n\t\treturn s;\n\t}\n};\n\ntemplate<class D,class I>struct Fenwick2D{\n\tusing P=pair<I,I>;\n\tV<P>points;\n\tVV<I>ys;\n\tV<Fenwick<D>>fws;\n\tint lg,sz;\n\tFenwick2D(V<P> _points):points(_points){\n\t\tSO(points);\n\t\tpoints.erase(unique(points.begin(),points.end()),points.end());\n\t\tint n=int(points.size());\n\t\tlg=1;\n\t\twhile((1<<lg)<n){lg++;}\n\t\tsz=1<<lg;\n\t\tys=VV<I>(2*sz);\n\t\tfor(int i=0;i<n;i++){\n\t\t\tys[sz+i].pub(points[i].sec);\n\t\t}\n\t\tfor(int i=sz-1;i>=1;i--){\n\t\t\tys[i]=V<I>(ys[i+i].size()+ys[i+i+1].size());\n\t\t\tmerge(ys[i+i].begin(),ys[i+i].end(),ys[i+i+1].begin(),ys[i+i+1].end(),ys[i].begin());\n\t\t}\n\t\tfws=V<Fenwick<D>>(sz+sz);\n\t\tfor(int i=1;i<2*sz;i++){\n\t\t\tfws[i]=Fenwick<D>(int(ys[i].size()));\n\t\t}\n\t}\n\tvoid add(P p,D x){\n\t\tint k=LBI(points,p);\n\t\tk+=sz;\n\t\twhile(k){\n\t\t\tint yid=LBI(ys[k],p.sec);\n\t\t\tfws[k].add(yid,x);\n\t\t\tk>>=1;\n\t\t}\n\t}\n\tD getmax(int a,int b,I up,int l,int r,int k){\n\t\tif(b<=l||r<=a){return 0;}\n\t\tif(a<=l&&r<=b){\n\t\t\tint uid=LBI(ys[k],up);\n\t\t\treturn fws[k].max(uid);\n\t\t}\n\t\tint mid=(l+r)/2;\n\t\treturn max(getmax(a,b,up,l,mid,2*k),getmax(a,b,up,mid,r,2*k+1));\n\t}\n\tD getmax(P up){\n\t\tint b=LBI(points,mp(up.fir,-mod));\n\t\treturn getmax(0,b,up.sec,0,sz,1);\n\t}\n};\nint a, b , C = ~(1<<31), M = (1<<16)-1;\nint rrr() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\nint main(void){\n\twhile(-1){\n\t\tint m,n,A,B,i;cin>>m>>n>>A>>B;\n\t\tif(m+n==0){return 0;}\n\t\tvector<tuple<int,int,int>>xyz(n+m);\n\t\ta=A;b=B;\n\t\tfor(i=0;i<m;i++){\n\t\t\tint x,y,z;cin>>x>>y>>z;\n\t\t\txyz[i]=mt(x,-y,-z);\n\t\t}\n\t\tfor(i=0;i<n;i++){\n\t\t\tint x,y,z;x=rrr();y=rrr();z=rrr();\n\t\t\txyz[m+i]=mt(x,-y,-z);\n\t\t}\n\t\tSO(xyz);\n\t\tvector<pair<int,int>>yz(n+m);\n\t\tfor(i=0;i<n+m;i++){\n\t\t\tyz[i]=mp(-get<1>(xyz[i]),-get<2>(xyz[i]));\n\t\t}\n\t\tFenwick2D<int,int> segki(yz);\n\t\tint ans=0;\n\t\tfor(i=0;i<n+m;i++){\n\t\t\tint kaz=segki.getmax(yz[i])+1;\n\t\t\tchmax(ans,kaz);\n\t\t\t\n\t\t\tsegki.add(yz[i],kaz);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":5600,"memory_kb":160288,"score_of_the_acc":-1.6482,"final_rank":19},{"submission_id":"aoj_1341_6813635","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n scan(head);\n IN(tail...);\n}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\n return res;\n}\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n scan(a), scan(b), scan(c);\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nint a, b, C, M;\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\n\nint main() {\n rep(1000) {\n INT(m, n, A, B);\n if(!n and !m) exit(0);\n if(m + n > 1000) dump(m, n, A, B);\n VEC3(int, x, y, z, m);\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\n\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\n\n n += m;\n\n auto id = iota(n);\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\n\n vector<map<int, int>> dp;\n fore(i, id) {\n int k = bin_search(-1, si(dp), [&](int k) {\n auto it = dp[k].lower_bound(x[i]);\n return it != begin(dp[k]) and prev(it)->se < y[i];\n });\n if(k + 1 < si(dp)) {\n auto &s = dp[k + 1];\n auto it = s.lower_bound(x[i]);\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\n if(it != begin(s) and prev(it)->se <= y[i])\n continue;\n else\n s.emplace_hint(it, x[i], y[i]);\n } else {\n dp.eb(map<int, int>{{x[i], y[i]}});\n }\n // dump(dp);\n }\n\n OUT(si(dp));\n }\n}","accuracy":1,"time_ms":710,"memory_kb":14580,"score_of_the_acc":-0.0029,"final_rank":2},{"submission_id":"aoj_1341_6813634","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n scan(head);\n IN(tail...);\n}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\n return res;\n}\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n scan(a), scan(b), scan(c);\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nint a, b, C, M;\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\n\nint main() {\n rep(1000) {\n INT(m, n, A, B);\n if(!n and !m) exit(0);\n if(m + n > 1000) dump(m, n, A, B);\n VEC3(int, x, y, z, m);\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\n\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\n\n n += m;\n\n auto id = iota(n);\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\n\n vector<set<pii>> dp;\n fore(i, id) {\n int k = bin_search(-1, si(dp), [&](int k) {\n auto it = dp[k].lower_bound(pii(x[i] - 1, y[i]));\n return it != begin(dp[k]) and prev(it)->se < y[i];\n });\n if(k + 1 < si(dp)) {\n auto &s = dp[k + 1];\n auto it = s.lower_bound(pii(x[i], y[i]));\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\n if(it != begin(s) and prev(it)->se <= y[i])\n continue;\n else\n s.emplace_hint(it, x[i], y[i]);\n } else {\n dp.eb(set<pii>());\n dp.back().emplace(x[i], y[i]);\n }\n // dump(dp);\n }\n\n OUT(si(dp));\n }\n}","accuracy":1,"time_ms":690,"memory_kb":14792,"score_of_the_acc":-0.0014,"final_rank":1},{"submission_id":"aoj_1341_6813633","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\n#define INT(...) \\\n int __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define LL(...) \\\n ll __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define STR(...) \\\n string __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define DBL(...) \\\n double __VA_ARGS__; \\\n IN(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\n scan(head);\n IN(tail...);\n}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\n return res;\n}\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\n\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return res;\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n scan(a), scan(b), scan(c);\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nint a, b, C, M;\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\n\nint main() {\n rep(1000) {\n INT(m, n, A, B);\n if(!n and !m) exit(0);\n if(m + n > 1000) dump(m, n, A, B);\n VEC3(int, x, y, z, m);\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\n\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\n\n n += m;\n\n auto id = iota(n);\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\n\n vector<set<pii>> dp;\n fore(i, id) {\n int k = bin_search(-1, si(dp), [&](int k) {\n auto it = dp[k].lower_bound(pii(x[i] - 1, y[i]));\n return it != begin(dp[k]) and prev(it)->se < y[i];\n });\n if(k + 1 < si(dp)) {\n auto &s = dp[k + 1];\n auto it = s.lower_bound(pii(x[i], y[i]));\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\n if(it != begin(s) and prev(it)->se <= y[i])\n continue;\n else\n s.emplace(x[i], y[i]);\n } else {\n dp.eb(set<pii>());\n dp.back().emplace(x[i], y[i]);\n }\n // dump(dp);\n }\n\n OUT(si(dp));\n }\n}","accuracy":1,"time_ms":730,"memory_kb":15076,"score_of_the_acc":-0.0089,"final_rank":3},{"submission_id":"aoj_1341_6674108","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n using type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n using type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[value % 10];\n value /= 10;\n } while (value != 0);\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n __int128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n if (s[0] == '-') ret = -ret;\n return ret;\n}\n__uint128_t parse_u128(std::string& s) {\n __uint128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n std::string s;\n in >> s;\n v = parse_i128(s);\n return in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n std::string s;\n in >> s;\n v = parse_u128(s);\n return in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n (std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n std::string res;\n if (bit_num >= 0) {\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n } else {\n for (; val; val >>= 1) res += '0' + (val & 1);\n std::reverse(res.begin(), res.end());\n }\n return res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n std::vector<T> res;\n for (; val; val /= base) res.push_back(val % base);\n if (res.empty()) res.push_back(T{ 0 });\n return res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n auto res = digits_low_to_high(val, base);\n std::reverse(res.begin(), res.end());\n return res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n std::ostringstream ss;\n for (auto it = v.begin(); it != v.end();) {\n ss << *it;\n if (++it != v.end()) ss << sep;\n }\n ss << end;\n return ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_{};\n\n// ! code from here\n\n#include <algorithm>\n#include <cassert>\n#include <tuple>\n\n#include <vector>\n#include <map>\n#include <unordered_map>\n\nnamespace suisen {\n template <typename T>\n struct FenwickTree {\n int n;\n vector<T> data;\n\n FenwickTree() : FenwickTree(0) {}\n FenwickTree(int n) : n(n), data(n, 0) {}\n int size() {\n return n;\n }\n void chmax(int i, T v) {\n for (++i; i <= n; i += (i & -i)) ::chmax(data[i - 1], v);\n }\n T max(int r) {\n T s = 0;\n for (; r; r -= r & -r) ::chmax(s, data[r - 1]);\n return s;\n }\n };\n} // namespace suisen\n\nnamespace suisen {\n template <typename T>\n struct FenwickTree2DSparse {\n FenwickTree2DSparse() {}\n explicit FenwickTree2DSparse(int x_num) : n(x_num + 1), data(n), points(), pos_x(), pos_y(n) {}\n\n void add_point(int x, int y) {\n built = false;\n pos_x.push_back(x);\n points.emplace_back(x, y);\n }\n\n void build() {\n static constexpr int inf = std::numeric_limits<int>::max();\n built = true;\n pos_x.push_back(inf);\n std::sort(pos_x.begin(), pos_x.end());\n pos_x.erase(std::unique(pos_x.begin(), pos_x.end()), pos_x.end());\n assert(int(pos_x.size()) <= n);\n for (const auto& [x, y] : points) for (int k = comp_x(x) + 1; k <= n; k += k & -k) {\n pos_y[k - 1].push_back(y);\n }\n for (int k = 0; k < n; ++k) {\n pos_y[k].push_back(inf);\n std::sort(pos_y[k].begin(), pos_y[k].end());\n pos_y[k].erase(std::unique(pos_y[k].begin(), pos_y[k].end()), pos_y[k].end());\n data[k] = FenwickTree<T>(pos_y[k].size());\n }\n }\n\n void chmax(int x, int y, const T& val) {\n for (int k = comp_x(x) + 1; k <= n; k += k & -k) {\n data[k - 1].chmax(comp_y(k - 1, y), val);\n }\n }\n T max(int r, int u) {\n T res = 0;\n for (r = comp_x(r); r; r -= r & -r) ::chmax(res, data[r - 1].max(comp_y(r - 1, u)));\n return res;\n }\n\n private:\n int n, m;\n std::vector<FenwickTree<T>> data;\n std::vector<std::pair<int, int>> points;\n std::vector<int> pos_x;\n std::vector<std::vector<int>> pos_y;\n bool built = true;\n\n int comp_x(int x) const {\n return std::lower_bound(pos_x.begin(), pos_x.end(), x) - pos_x.begin();\n }\n int comp_y(int k, int y) const {\n return std::lower_bound(pos_y[k].begin(), pos_y[k].end(), y) - pos_y[k].begin();\n }\n };\n} // namespace suisen\n\nint main() {\n while (true) {\n input(int, m, n);\n input(int, A, B);\n if (m == 0 and n == 0 and A == 0 and B == 0) break;\n n += m;\n int C = ~(1 << 31), M = (1 << 16) - 1;\n auto r = [&]() -> int {\n A = 36969 * (A & M) + (A >> 16);\n B = 18000 * (B & M) + (B >> 16);\n return (C & ((A << 16) + B)) % 1000000;\n };\n\n vector<int> x(n), y(n), z(n);\n rep(i, n) {\n if (i < m) {\n read(x[i], y[i], z[i]);\n } else {\n x[i] = r();\n y[i] = r();\n z[i] = r();\n }\n }\n\n FenwickTree2DSparse<int> ft(n);\n rep(i, n) ft.add_point(y[i], z[i]);\n ft.build();\n\n vector<int> p(n);\n iota(all(p), 0);\n sort(all(p), [&](int i, int j) {\n if (x[i] != x[j]) return x[i] < x[j];\n if (y[i] != y[j]) return y[i] > y[j];\n return z[i] > z[j];\n }\n );\n\n for (int i : p) {\n ft.chmax(y[i], z[i], ft.max(y[i], z[i]) + 1);\n }\n\n print(ft.max(numeric_limits<int>::max(), numeric_limits<int>::max()));\n }\n\n return 0;\n}","accuracy":1,"time_ms":3940,"memory_kb":75080,"score_of_the_acc":-0.8577,"final_rank":15},{"submission_id":"aoj_1341_6365882","code_snippet":"#include <bits/stdc++.h>\n// #define int long long\n#define ff first\n#define ss second\n#define ll long long\n#define ld long double\n#define pb push_back\n#define eb emplace_back\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define ti tuple<int, int, int>\n#define vi vector<int>\n#define vl vector<ll>\n#define vii vector<pii>\n#define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\n#define endl '\\n'\n#define teto(a, b) (((a)+(b)-1)/(b))\n#define all(x) x.begin(), x.end()\n#define forn(i, n) for(int i = 0; i < (int)n; i++)\n#define forne(i, a, b) for(int i = a; i <= b; i++)\n#define dbg(msg, var) cerr << msg << \" \" << var << endl;\n\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"avx,avx2,fma\")\n\nusing namespace std;\n\nconst int MAX = 2e5+10;\nconst ll MOD = 998244353;\nconst int INF = 0x3f3f3f3f;\nconst ll LLINF = 0x3f3f3f3f3f3f3f3f;\nconst ld EPS = 1e-10;\nconst ld PI = acos(-1);\n\n// End Template //\n\nint a, b, C = ~(1<<31), M = (1<<16)-1;\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\n\nstruct Segtree{\n vi t;\n int n;\n\n Segtree(int n){\n this->n = n;\n t.assign(2*n, 0);\n }\n\n int merge(int a, int b){\n return max(a, b);\n }\n\n void build(){\n for(int i=n-1;i>0;i--)\n t[i] = merge(t[i<<1], t[i<<1|1]);\n }\n\n int query(int l, int r){\n int resl = -INF, resr = -INF;\n for(l+=n, r+=n+1; l<r; l>>=1, r>>=1){\n if(l&1) resl = merge(resl, t[l++]);\n if(r&1) resr = merge(t[--r], resr);\n }\n return merge(resl, resr);\n }\n\n void update(int p, int value){\n p+=n;\n for(t[p]=max(t[p], value); p >>= 1;)\n t[p] = merge(t[p<<1], t[p<<1|1]);\n }\n};\n\nstruct point{\n int x, y, z, id;\n bool left;\n point(int x=0, int y=0, int z=0): x(x), y(y), z(z){\n left = false;\n }\n bool operator<(point &o){\n if(x != o.x) return x < o.x;\n if(y != o.y) return y > o.y;\n return z < o.z;\n }\n};\n\n\nvoid cdq(int l, int r, vector<point> &a, vi &dp){\n if(l==r) return;\n\n int mid = (l+r) / 2;\n\n cdq(l, mid, a, dp);\n\n // compress z\n set<int> uz; map<int, int> idz;\n for(int i=l;i<=r;i++) uz.insert(a[i].z);\n int id = 0;\n for(auto z: uz) idz[z] = id++;\n\n vector<point> tmp;\n for(int i=l;i<=r;i++){\n tmp.pb(a[i]);\n tmp.back().x = 0;\n tmp.back().z = idz[tmp.back().z];\n if(i<=mid)\n tmp.back().left = true;\n }\n\n Segtree st(id);\n\n sort(tmp.rbegin(), tmp.rend());\n\n for(auto t: tmp){\n // cout << \"tmp = \" << t.x << \" \" << t.y << \" \" << t.z << \" \" << t.left << endl;\n if(t.left){\n st.update(t.z, dp[t.id]);\n }else{\n // cout << \"ok\\n\";\n dp[t.id] = max(dp[t.id], st.query(0, t.z-1)+1);\n }\n }\n\n cdq(mid+1, r, a, dp);\n}\n\n\nint32_t main()\n{sws;\n\n ll m, n;\n while(cin >> m >> n >> a >> b){\n if(m==0 and n==0 and a==0 and b==0) break;\n\n vector<point> vet(n+m);\n for(int i=0;i<m;i++){\n cin >> vet[i].x >> vet[i].y >> vet[i].z;\n }\n for(int i=m;i<n+m;i++){\n vet[i].x = r();\n vet[i].y = r();\n vet[i].z = r();\n }\n\n sort(vet.begin(), vet.end());\n\n for(int i=0;i<n+m;i++)\n vet[i].id = i;\n\n vi dp(n+m, 1);\n\n cdq(0, n+m-1, vet, dp);\n\n int ans = 0;\n for(int i=0;i<n+m;i++)\n ans = max(ans, dp[i]);\n\n\n // for(int i=0;i<n+m;i++)\n // cout << dp[i] << \" \";\n // cout << endl;\n\n cout << ans << endl;\n \n }\n\n return 0;\n}\n\n// overflow\n// check border cases\n// check limits (when initializing the answer too)\n// check variables names, mod missing\n// using set as multiset\n// remember to permute the positions\n// equal points/collinear points\n\n// no ideas?\n// try bb, dp\n// invert the problem (calculate total - wrong)\n// transform it in a graph somehow\n// naive/brute\n// when u find a dead end, read the statment again,\n// to see if u understood the problem right.","accuracy":1,"time_ms":7680,"memory_kb":82460,"score_of_the_acc":-1.4406,"final_rank":17},{"submission_id":"aoj_1341_6260185","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define _ ios_base::sync_with_stdio(0);cin.tie(0);\n#define endl '\\n'\n\ntypedef long long ll;\n\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3f;\n\ntypedef tuple<int, int, int> T;\n\nconst int MAX = 3e5 + 10;\nconst int MAX2 = 1e6 + 10;\n\nint seg[2*MAX2];\nint N = MAX2;\n\nint query(int a, int b) {\n\tint ret = 0;\n\tfor(a += N, b += N; a <= b; ++a /= 2, --b /= 2) {\n\t\tif (a % 2 == 1) ret = max(ret, seg[a]);\n\t\tif (b % 2 == 0) ret = max(ret, seg[b]);\n\t}\n\treturn ret;\n}\n\nvoid update(int p, int x) {\n\tp += N;\n\tif (x == 0) seg[p] = 0;\n\telse seg[p] = max(seg[p], x);\n\twhile (p /= 2) seg[p] = max(seg[2*p], seg[2*p+1]);\n}\n\nvoid lis2d(vector<vector<tuple<int, int, int>>>& v, vector<int>& dp, int l, int r) {\n\tif (l == r) {\n\t\tfor (int i = 0; i < v[l].size(); i++) {\n\t\t\tint ii = get<2>(v[l][i]);\n\t\t\tdp[ii] = max(dp[ii], 1);\n\t\t}\n\t\treturn;\n\t}\n\t\n\tint m = (l+r)/2;\n\tlis2d(v, dp, l, m);\n\t\n\tvector<tuple<int, int, int>> vv[2];\n\tfor (int i = l; i <= r; i++) for (int j = 0; j < v[i].size(); j++)\n\t\tvv[i > m].push_back(v[i][j]);\n\tsort(vv[0].begin(), vv[0].end());\n\tsort(vv[1].begin(), vv[1].end());\n\t\n\tint mini = INF, i = 0;\n\tfor (auto it : vv[1]) {\n\t\tint y, z, id;\n\t\ttie(y, z, id) = it;\n\t\twhile (i < vv[0].size() and get<0>(vv[0][i]) < y) {\n\t\t\tint y2, z2, id2;\n\t\t\ttie(y2, z2, id2) = vv[0][i];\n\t\t\tmini = min(mini, z2);\n\t\t\tupdate(z2, dp[id2]);\t\n\t\t\ti++;\n\t\t}\n\t\tint q = query(0, z-1);\n\t\tdp[id] = max(dp[id], q + 1);\n\t}\n\n\tfor (i = 0; i < vv[0].size(); i++) {\n\t\tint y, z, id;\n\t\ttie(y, z, id) = vv[0][i];\n\t\tupdate(z, 0);\n\t}\n\tlis2d(v, dp, m+1, r);\n}\n\nvector<int> solve(vector<tuple<int, int, int>> v) {\n\tint n = v.size();\n\tvector<tuple<int, int, int, int>> vv;\n\tfor (int i = 0; i < n; i++) {\n\t\tint x, y, z;\n\t\ttie(x, y, z) = v[i];\n\t\tvv.emplace_back(x, y, z, i);\n\t}\n\tsort(vv.begin(), vv.end());\n\n\tvector<vector<tuple<int, int, int>>> V;\n\tfor (int i = 0; i < n; i++) {\n\t\tint j = i;\n\t\tV.emplace_back();\n\t\twhile (j < n and get<0>(vv[j]) == get<0>(vv[i])) {\n\t\t\tint x, y, z, id;\n\t\t\ttie(x, y, z, id) = vv[j++];\n\t\t\tV.back().emplace_back(y, z, id);\n\t\t}\n\t\ti = j-1;\n\t}\n\tvector<int> dp(n);\n\tlis2d(V, dp, 0, V.size()-1);\n\treturn dp;\n}\n\nint main() { _\n\tint m, n, A, B;\n\twhile (cin >> m >> n >> A >> B) {\n\t\tif (n == 0 and m == 0 and A == 0 and B == 0) return 0;\n\t\t\n\t\tvector<tuple<int, int, int>> v;\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x, y, z; cin >> x >> y >> z;\n\t\t\tv.emplace_back(x, y, z);\n\t\t}\n\n\t\t{\n\t\t\tint a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\n\t\t\tfor (int i = 0; i < n; i++) {\n\t\t\t\tvector<int> w;\n\t\t\t\tfor (int j = 0; j < 3; j++) {\n\t\t\t\t\ta = 36969 * (a & M) + (a >> 16);\n\t\t\t\t\tb = 18000 * (b & M) + (b >> 16);\n\t\t\t\t\tw.push_back((C & ((a << 16) + b)) % 1000000);\n\t\t\t\t}\t\t\n\t\t\t\tv.emplace_back(w[0], w[1], w[2]);\n\t\t\t}\n\t\t}\n\n\t\tauto dp = solve(v);\n\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n+m; i++) ans = max(ans, dp[i]);\n\t\tcout << ans << endl;\n\t}\n\texit(0);\n}","accuracy":1,"time_ms":3000,"memory_kb":51064,"score_of_the_acc":-0.5673,"final_rank":13},{"submission_id":"aoj_1341_6259434","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define _ ios_base::sync_with_stdio(0);cin.tie(0);\n#define endl '\\n'\n\ntypedef long long ll;\n\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3f;\n\ntypedef tuple<int, int, int> T;\n\nconst int MAX = 3e5 + 10;\nconst int MAX2 = 1e6 + 10;\n\nvector<vector<T>> V;\nint dp[MAX];\n\nint seg[2*MAX2];\nint N = MAX2;\n\nint query(int a, int b) {\n\tint ret = 0;\n\tfor(a += N, b += N; a <= b; ++a /= 2, --b /= 2) {\n\t\tif (a % 2 == 1) ret = max(ret, seg[a]);\n\t\tif (b % 2 == 0) ret = max(ret, seg[b]);\n\t}\n\treturn ret;\n}\n\nvoid update(int p, int x) {\n\tp += N;\n\tif (x == 0) seg[p] = 0;\n\telse seg[p] = max(seg[p], x);\n\twhile (p /= 2) seg[p] = max(seg[2*p], seg[2*p+1]);\n}\n\nvoid lis2d(int l, int r) {\n\tif (l == r) {\n\t\tfor (int i = 0; i<V[l].size(); i++) {\n\t\t\tint ii = get<2>(V[l][i]);\n\t\t\tdp[ii] = max(dp[ii], 1);\n\t\t}\n\t\treturn;\n\t}\n\t\n\tint m = (l+r)/2;\n\tlis2d(l, m);\n\t\n\tvector<T> v1, v2;\n\tfor (int i = l; i <= r; i++) for (int j = 0; j < V[i].size(); j++) { \n\t\tif (i <= m) v1.push_back(V[i][j]);\n\t\telse v2.push_back(V[i][j]);\n\t}\n\tsort(v1.begin(), v1.end());\n\tsort(v2.begin(), v2.end());\n\t\n\tint mini = INF;\n\n\tint i = 0;\n\tfor (auto it : v2) {\n\t\tint y, z, id;\n\t\ttie(y, z, id) = it;\n\t\twhile (i < v1.size() and get<0>(v1[i]) < y) {\n\t\t\tint y2, z2, id2;\n\t\t\ttie(y2, z2, id2) = v1[i];\n\t\t\tmini = min(mini, z2);\n\t\t\tupdate(z2, dp[id2]);\t\n\t\t\ti++;\n\t\t}\n\t\tint q = query(0, z-1);\n\t\tdp[id] = max(dp[id], q + 1);\n\t}\n\n\tfor (i = 0; i<v1.size(); i++) {\n\t\tint y, z, id;\n\t\ttie(y, z, id) = v1[i];\n\t\tupdate(z, 0);\n\t}\n\tlis2d(m+1, r);\n}\n\nint main() { _\n\tint m, n, A, B;\n\twhile (cin >> m >> n >> A >> B) {\n\t\tif (n == 0 and m == 0 and A == 0 and B == 0) return 0;\n\t\t\n\t\tfor (int i = 0; i<n+m; i++) dp[i] = 0;\n\t\tV.clear();\n\t\tvector<T> v;\n\n\t\tfor (int i = 0; i<m; i++) {\n\t\t\tint x, y, z; cin >> x >> y >> z;\n\t\t\tv.emplace_back(x, y, z);\n\t\t}\n\n\t\t{\n\t\t\tint a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\n\t\t\tfor (int i = 0; i<n; i++) {\n\t\t\t\tvector<int> w;\n\t\t\t\tfor (int j = 0; j<3; j++) {\n\t\t\t\t\ta = 36969 * (a & M) + (a >> 16);\n\t\t\t\t\tb = 18000 * (b & M) + (b >> 16);\n\t\t\t\t\tw.push_back((C & ((a << 16) + b)) % 1000000);\n\t\t\t\t}\t\t\n\t\t\t\tv.emplace_back(w[0], w[1], w[2]);\n\t\t\t}\n\t\t}\n\n\t\tsort(v.begin(), v.end());\n\n\t\tfor (int i = 0; i < n+m; i++) {\n\t\t\tint j = i;\n\t\t\tV.emplace_back();\n\t\t\twhile (j < n+m and get<0>(v[j]) == get<0>(v[i])) {\n\t\t\t\tV.back().emplace_back(get<1>(v[j]), get<2>(v[j]), j);\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ti = j-1;\n\t\t}\n\t\n\t\tlis2d(0, V.size()-1);\n\t\tint ans = 0;\n\t\tfor (int i = 0; i<n+m; i++) ans = max(ans, dp[i]);\n\t\tcout << ans << endl;\n\t}\n\texit(0);\n}","accuracy":1,"time_ms":2890,"memory_kb":40876,"score_of_the_acc":-0.4854,"final_rank":10},{"submission_id":"aoj_1341_6252224","code_snippet":"#include<bits/stdc++.h>\nusing namespace::std;\n\n// Currently: WA :v\n\nconst int C = ~(1 << 31);\nconst int M = (1 << 16) - 1;\nconst int N = 300000 + 5;\n\nint n;\nint m;\nint a;\nint b;\nint A;\nint B;\nint len;\nint memo[N];\nset<pair<int, int>> ft[N];\n\nint r(){\n\ta = 36969 * (a & M) + (a >> 16);\n\tb = 18000 * (b & M) + (b >> 16);\n\treturn (C & ((a << 16) + b)) % 1000000;\n}\n\nvoid compress(vector<int> &v){\n\tvector<int> values(v.begin(), v.end());\n\tsort(values.begin(), values.end());\n\tvalues.erase(unique(values.begin(), values.end()), values.end());\n\tfor(int i = 0; i < v.size(); i++){\n\t\tv[i] = lower_bound(values.begin(), values.end(), v[i]) - values.begin();\n\t}\n}\n\nint get(int at, int val){\n\tif(ft[at].empty() or (*ft[at].begin()).first > val) return 0;\n\tset<pair<int, int>>::iterator it = ft[at].lower_bound(make_pair(val, -1));\n\tif(it == ft[at].end() or (*it).first > val) it--;\n\treturn (*it).second;\n}\n\t\nint query(int y, int z){\n\ty++; z++;\n\tint res = 0;\n\tfor(int j = y; j > 0; j &= j - 1){\n\t\tres = max(res, get(j, z));\n\t}\n\treturn res;\n}\n\nvoid insert(int at, int pos, int val){\n\tif(ft[at].empty()){\n\t\tft[at].emplace(make_pair(pos, val));\n\t\treturn;\n\t}\n\tset<pair<int, int>>::iterator it = ft[at].lower_bound(make_pair(pos, -1));\n\n\tif(it != ft[at].end() and (*it).first == pos and (*it).second >= val) return;\n\tset<pair<int, int>>::iterator leq = it;\n\tif(leq != ft[at].begin()) leq--;\n\tif((*leq).first < pos and (*leq).second >= val) return;\n\tvector<pair<int, int>> to_remove;\n\twhile(it != ft[at].end() and (*it).second <= val){\n\t\tto_remove.emplace_back(*it);\n\t\tit++;\n\t}\n\tfor(auto e : to_remove) ft[at].erase(e);\n\tft[at].emplace(make_pair(pos, val));\n}\n\nvoid update(int y, int z, int val){\n\ty++; z++;\n\tfor(int j = y; j <= len; j += (-j) & j){\n\t\tinsert(j, z, val);\n\t}\n}\n\nint solve(vector<int> &x, vector<int> &y, vector<int> &z){\n\tvector<int> p(len);\n\tiota(p.begin(), p.end(), 0);\n\tsort(p.begin(), p.end(), [&] (int i, int j){\n\t\tif(x[i] != x[j]) return x[i] < x[j];\n\t\tif(y[i] != y[j]) return y[i] < y[j];\n\t\tif(z[i] != z[j]) return z[i] < z[j];\n\t\treturn false;\n\t});\n\tint ans = 0;\n\tint l = 0, r = 0;\n\twhile(l < len){\n\t\twhile(r < len and x[p[l]] == x[p[r]]) r++;\n\t\tfor(int i = l; i < r; i++){\n\t\t\tint at = p[i];\n\t\t\tmemo[i] = 1 + query(y[at] - 1, z[at] - 1);\n\t\t\tif(ans < memo[i]) ans = memo[i];\n\t\t}\n\t\tfor(int i = l; i < r; i++){\n\t\t\tint at = p[i];\n\t\t\tupdate(y[at], z[at], memo[i]);\n\t\t}\n\t\tl = r;\n\t}\n\treturn ans;\n}\n\nvoid clear(){\n\tfor(int i = 0; i <= len; i++){\n\t\tft[i].clear();\n\t}\n}\n\nint main(){\n\twhile(scanf(\"%d %d %d %d\", &m, &n, &a, &b) == 4 and m + n){\n\t\tlen = n + m;\n\t\tvector<int> x(len), y(len), z(len);\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tscanf(\"%d %d %d\", &x[i], &y[i], &z[i]);\n\t\t}\n\t\tfor(int i = m; i < len; i++){\n\t\t\tx[i] = r();\n\t\t\ty[i] = r();\n\t\t\tz[i] = r();\n\t\t}\n\t\tcompress(x); compress(y); compress(z);\n\t\tprintf(\"%d\\n\", solve(x, y, z));\n\t\tclear();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3730,"memory_kb":66916,"score_of_the_acc":-0.7746,"final_rank":14},{"submission_id":"aoj_1341_6044530","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=1000000007,MAX=1005,INF=1<<29;\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n while(1){\n int N,nn,A,B;cin>>N>>nn>>A>>B;\n if(N+nn==0) break;\n vector<vector<int>> S(N);\n for(int i=0;i<N;i++){\n S[i].resize(3);\n for(int j=0;j<3;j++) cin>>S[i][j];\n }\n int a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\n for(int i=0;i<nn;i++){\n S.push_back({});\n for(int j=0;j<3;j++){\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n S.back().push_back((C & ((a << 16) + b)) % 1000000);\n }\n }\n \n sort(all(S),[](auto a,auto b){\n if(a[0]==b[0]){\n if(a[1]==b[1]) return a[2]>b[2];\n else return a[1]>b[1];\n }else{\n return a[0]<b[0];\n }\n });\n \n N=si(S);\n vector<set<pair<int,int>>> SE(N+1);\n for(int i=0;i<=N;i++){\n if(i) SE[i].insert(mp(-INF,INF));\n else SE[i].insert(mp(-INF,-INF+1));\n SE[i].insert(mp(INF,-INF));\n }\n for(int i=0;i<N;i++){\n int left=0,right=i+1;\n pair<int,int> x=mp(S[i][1],S[i][2]);\n while(right-left>1){\n int mid=(left+right)/2;\n auto it=SE[mid].lower_bound(mp(x.fi,-INF));\n it--;\n if((*it).se<x.se) left=mid;\n else right=mid;\n }\n int mid=right;\n auto it=SE[mid].lower_bound(x);\n it--;\n bool f=((*it).se>x.se);\n it++;\n while(it!=SE[mid].end()){\n if((*it).se>=x.se){\n it=SE[mid].erase(it);\n }else{\n break;\n }\n }\n if(f) SE[mid].insert(x);\n }\n \n int ans=-1;\n for(int i=0;i<=N;i++){\n for(auto a:SE[i]){\n if(abs(a.fi)<INF) ans=i;\n }\n }\n cout<<ans<<\"\\n\";\n }\n}","accuracy":1,"time_ms":1940,"memory_kb":67864,"score_of_the_acc":-0.5247,"final_rank":12},{"submission_id":"aoj_1341_3904383","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\nusing ll = long long;\n\nint a,b;\n// const int C = ~(1<<31);\nconst int C = (1<<30) + ((1<<30) - 1);\nconst int M = (1<<16)-1;\nint r() {\n\ta = 36969 * (a & M) + (a >> 16);\n\tb = 18000 * (b & M) + (b >> 16);\n\treturn (C & ((a << 16) + b)) % 1000000;\n}\n\nusing pii = pair<int,int>;\n\npair<int,pii> points[325252];\n\nint main(){\n\twhile(true){\n\t\tint n,m;\n\t\tscanf(\"%d%d%d%d\",&n,&m,&a,&b);\n\t\tif(n+m+a+b==0)break;\n\t\tREP(i,n){\n\t\t\tint x,y,z;\n\t\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\t\tx++; y++; z++;\n\t\t\tpoints[i] = make_pair(x,pii(y,z));\n\t\t}\n\t\tREP(i,m){\n\t\t\tint x = r();\n\t\t\tint y = r();\n\t\t\tint z = r();\n\t\t\tx++; y++; z++;\n\t\t\tpoints[i+n] = make_pair(x,pii(y,z));\n\t\t}\n\t\tn += m;\n\t\tsort(points, points+n, [&](pair<int,pii> a, pair<int,pii> b){\n\t\t\tif(a.first != b.first)return a.first < b.first;\n\t\t\treturn a.second > b.second;\n\t\t});\n\t\tconst int N = 1000025;\n\t\tstd::unordered_map<int,std::map<int,int>> bit;\n\t\tauto add = [&](int y, int z, int v){\n\t\t\tfor(; y<N; y+=y&-y){\n\t\t\t\t// add to y\n\t\t\t\tif(bit.count(y)==0){\n\t\t\t\t\tbit[y] = std::map<int,int>();\n\t\t\t\t\tbit[y][-1] = -252521;\n\t\t\t\t}\n\t\t\t\tstd::map<int,int> &mp = bit[y];\n\t\t\t\tauto it = mp.upper_bound(z); it--;\n\t\t\t\tif(it->second >= v)continue;\n\t\t\t\tmp[z] = v;\n\t\t\t\tit = mp.upper_bound(z);\n\t\t\t\twhile(it != mp.end() && it->second <= v){\n\t\t\t\t\tmp.erase(it++);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tauto query = [&](int y, int z){\n\t\t\tint ans = 0;\n\t\t\tfor(; y>0; y-=y&-y){\n\t\t\t\t// get from y\n\t\t\t\tif(bit.count(y)==0)continue;\n\t\t\t\tstd::map<int,int> &mp = bit[y];\n\t\t\t\tauto it = mp.upper_bound(z); it--;\n\t\t\t\tans = max(ans, it->second);\n\t\t\t}\n\t\t\treturn ans;\n\t\t};\n\t\tint ans = 0;\n\t\tREP(i,n){\n\t\t\tint x = points[i].first;\n\t\t\tint y = points[i].second.first;\n\t\t\tint z = points[i].second.second;\n\t\t\tint v = query(y-1, z-1) + 1;\n\t\t\tans = max(ans, v);\n\t\t\tadd(y,z,v);\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":7480,"memory_kb":110408,"score_of_the_acc":-1.5934,"final_rank":18},{"submission_id":"aoj_1341_3743531","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <climits>\n#include <iomanip>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <tuple>\n#include <iostream>\n#include <deque>\n#include <array>\n#include <set>\n#include <functional>\n#include <memory>\n#include <stack>\n\nstruct Point3 {\n\tint x, y, z;\n};\nstruct Point2 {\n\tint x, y;\n\tbool operator<(const Point2 other) const { return x < other.x; }\n};\nclass NonChainablePoints {\n\tstd::set<Point2> set;\npublic:\n\tNonChainablePoints() {};\n\tbool can_chain(const Point2& point) const {\n\t\tauto hint = set.lower_bound(point);\n\t\treturn hint != set.begin() && (--hint)->y < point.y;\n\t}\n\tvoid insert(const Point2& point) {\n\t\tauto hint = set.lower_bound(point);\n\t\tif (hint == set.end() || hint->x != point.x || hint->y >= point.y) {\n\t\t\twhile (hint != set.end() && hint->y >= point.y) hint = set.erase(hint);\n\t\t\tset.insert(point);\n\t\t}\n\t}\n\tbool is_empty() const { return set.empty(); }\n\tbool is_not_empty() const { return !is_empty(); }\n};\nint r(int& a, int& b) {\n\tconstexpr int C = ~(1 << 31);\n\tconstexpr int M = (1 << 16) - 1;\n\ta = 36969 * (a & M) + (a >> 16);\n\tb = 18000 * (b & M) + (b >> 16);\n\treturn (C & ((a << 16) + b)) % 1000000;\n}\nvoid append_points(std::vector<Point3>& points, int a, int b, const int n) {\n\tfor (auto i = 0; i < n; ++i) {\n\t\tPoint3 p;\n\t\tp.x = r(a, b);\n\t\tp.y = r(a, b);\n\t\tp.z = r(a, b);\n\t\tpoints.push_back(p);\n\t}\n}\nint solve(const int m, const int n, const int a, const int b) {\n\tstd::vector<Point3> points(m);\n\tfor (auto& p : points) std::cin >> p.x >> p.y >> p.z;\n\tappend_points(points, a, b, n);\n\tstd::sort(points.begin(), points.end(), [](const Point3& a, const Point3& b) {return (a.z == b.z) ? a.x > b.x : a.z < b.z; });\n\tstd::vector<NonChainablePoints> sets(m + n);\n\tfor (const auto point : points) {\n\t\tconst Point2 p{ point.x, point.y };\n\t\tauto left = 0;\n\t\tauto right = sets.size();\n\t\twhile (left < right) {\n\t\t\tauto mid = (left + right) / 2;\n\t\t\tif (sets[mid].can_chain(p)) left = mid + 1;\n\t\t\telse right = mid;\n\t\t}\n\t\tsets[right].insert(p);\n\t}\n\tfor (auto i = 0; i < sets.size(); ++i) {\n\t\tif (sets[i].is_empty()) return i;\n\t}\n\treturn sets.size();\n}\nint main() {\n\tstd::vector<int>result;\n\twhile (true) {\n\t\tint m, n, a, b;\n\t\tstd::cin >> m >> n >> a >> b;\n\t\tif (m == 0 && n == 0) break;\n\t\tresult.push_back(solve(m, n, a, b));\n\t}\n\tfor (const auto r : result) std::cout << r << '\\n';\n}","accuracy":1,"time_ms":960,"memory_kb":26876,"score_of_the_acc":-0.1184,"final_rank":8},{"submission_id":"aoj_1341_3659947","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint a, b;\nconstexpr int C = ~(1 << 31);\nconstexpr int M = (1 << 16) - 1;\n\nint r() {\n a = 36969 * (a & M) + (a >> 16);\n b = 18000 * (b & M) + (b >> 16);\n return (C & ((a << 16) + b)) % 1000000;\n}\n\nstruct point {\n int y, z;\n\n point(int y_, int z_) : y(y_), z(z_) {}\n bool operator<(point const& p) const {\n return y < p.y;\n }\n};\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(0);\n\n int m, n;\n while(cin >> m >> n >> a >> b, n + m) {\n vector<tuple<int, int, int>> ps(n + m);\n for(int i = 0; i < m; ++i) {\n int x, y, z; cin >> x >> y >> z;\n ps[i] = make_tuple(x, -y, -z);\n }\n for(int i = m; i < n + m; ++i) {\n const int x = r(), y = r(), z = r();\n ps[i] = make_tuple(x, -y, -z);\n }\n sort(begin(ps), end(ps));\n vector<point> ps2;\n for(int i = 0; i < n + m; ++i) {\n ps2.emplace_back(-get<1>(ps[i]), -get<2>(ps[i]));\n }\n\n int ans = 0;\n vector<set<point>> dp(n + m + 1);\n dp[0].emplace(0, 0);\n for(auto const& p : ps2) {\n auto check = [&] (int i) {\n auto it = dp[i].lower_bound(p);\n if(it == dp[i].begin()) return false;\n it = prev(it);\n return p.y > it->y && p.z > it->z;\n };\n int lb = 0, ub = n + m;\n while(ub - lb > 1) {\n const int mid = (ub + lb) >> 1;\n (check(mid) ? lb : ub) = mid;\n }\n auto it = dp[ub].lower_bound(p);\n while(it != dp[ub].end() && it->z >= p.z) {\n it = dp[ub].erase(it);\n }\n if(it == dp[ub].begin() || prev(it)->z > p.z) {\n dp[ub].insert(p);\n }\n ans = max(ans, ub);\n }\n\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":750,"memory_kb":27212,"score_of_the_acc":-0.0906,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1341_10853188\",\n \"code_snippet\": \"#include<map>\\n#include<set>\\n#include<queue>\\n#include<cctype>\\n#include<cstdio>\\n#include<vector>\\n#include<cstdlib>\\n#include<cstring>\\n#include<algorithm>\\ntypedef long long LL;\\n#define MAXN 300010\\nint A, B, C = ~(1<<31), M = (1<<16)-1;\\nint myRand() {\\n A = 36969 * (A & M) + (A >> 16);\\n B = 18000 * (B & M) + (B >> 16);\\n return (C & ((A << 16) + B)) % 1000000;\\n}\\nint N, zn, z[MAXN], f[MAXN], max[MAXN];\\nstruct V {\\n\\tint x, y, z;\\n\\tbool operator < (const V &t) const {\\n\\t\\tif(x != t.x) {\\n\\t\\t\\treturn x < t.x;\\n\\t\\t}\\n\\t\\treturn y > t.y;\\n\\t}\\n}v[MAXN];\\nstruct T {\\n\\tint id, x, y, z;\\n\\tbool operator < (const T &t) const {\\n\\t\\tif(y != t.y) {\\n\\t\\t\\treturn y < t.y;\\n\\t\\t}\\n\\t\\tif(x != t.x) {\\n\\t\\t\\treturn x > t.x;\\n\\t\\t}\\n\\t\\treturn z > t.z;\\n\\t}\\n}t[MAXN];\\nint query(int x) {\\n\\tint ans = 0;\\n\\tfor(int i = x; i > 0; i -= i & -i) {\\n\\t\\tans = std::max(ans, max[i]);\\n\\t}\\n\\treturn ans;\\n}\\nvoid update(int x, int v) {\\n\\tfor(int i = x; i <= zn; i += i & -i) {\\n\\t\\tmax[i] = std::max(max[i], v);\\n\\t}\\n}\\nvoid clear(int x) {\\n\\tfor(int i = x; i <= zn; i += i & -i) {\\n\\t\\tmax[i] = 0;\\n\\t}\\n}\\nvoid cdq(int x, int y) {\\n\\tif(x == y) {\\n\\t\\treturn ;\\n\\t}\\n\\tint mid = (x + y) >> 1;\\n\\tcdq(x, mid);\\n\\tfor(int i = x; i <= y; i ++) {\\n\\t\\tt[i].id = i;\\n\\t\\tt[i].x = v[i].x, t[i].y = v[i].y, t[i].z = v[i].z;\\n\\t}\\n\\tstd::sort(t + x, t + y + 1);\\n\\tfor(int i = x; i <= y; i ++) {\\n\\t\\tif(t[i].id <= mid) {\\n\\t\\t\\tupdate(t[i].z, f[t[i].id]);\\n\\t\\t} else {\\n\\t\\t\\tf[t[i].id] = std::max(f[t[i].id], query(t[i].z - 1) + 1);\\n\\t\\t}\\n\\t}\\n\\tfor(int i = x; i <= y; i ++) {\\n\\t\\tif(t[i].id <= mid) {\\n\\t\\t\\tclear(t[i].z);\\n\\t\\t}\\n\\t}\\n\\tcdq(mid + 1, y);\\n}\\nint main() {\\n\\t//freopen(\\\"test.in\\\", \\\"rb\\\", stdin);\\n\\tint m;\\n\\twhile(scanf(\\\"%d%d%d%d\\\", &N, &m, &A, &B), N + m > 0) {\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tscanf(\\\"%d%d%d\\\", &v[i].x, &v[i].y, &v[i].z);\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < m; i ++) {\\n\\t\\t\\tv[N].x = myRand();\\n\\t\\t\\tv[N].y = myRand();\\n\\t\\t\\tv[N].z = myRand();\\n\\t\\t\\t++ N;\\n\\t\\t}\\n\\t\\tstd::sort(v, v + N);\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tz[i] = v[i].z;\\n\\t\\t}\\n\\t\\tstd::sort(z, z + N);\\n\\t\\tzn = std::unique(z, z + N) - z;\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tv[i].z = std::lower_bound(z, z + zn, v[i].z) - z + 1;\\n\\t\\t}\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tf[i] = 1;\\n\\t\\t}\\n\\t\\tcdq(0, N - 1);\\n\\t\\tint ans = 0;\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tans = std::max(ans, f[i]);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1710,\n \"memory_kb\": 14748,\n \"score_of_the_acc\": -0.147,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1341_9277865\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i, a, b) for(ll i = a; i < b; i++)\\n#define all(x) (x).begin(), (x).end()\\n\\nstruct FenwickTree {\\n int n;\\n vector<int> data;\\n FenwickTree() = default;\\n FenwickTree(int n) : n(n), data(n+1) {}\\n\\n int fold(int i) const {\\n int ret = 0;\\n for(;i>0;i-=i&-i) ret=max(ret,data[i]);\\n return ret;\\n }\\n void update(int i, int x) {\\n for(++i; i<=n; i+=i&-i) data[i]=max(data[i],x);\\n }\\n\\n};\\n\\nstruct SegTree2D {\\n int size;\\n vector<int> xs;\\n vector<vector<int>> ys;\\n vector<FenwickTree> seg;\\n\\n int getx(int x) const {\\n return lower_bound(all(xs), x)-xs.begin();\\n }\\n int gety(int k, int y) const {\\n return lower_bound(all(ys[k]), y) - ys[k].begin();\\n }\\n\\n SegTree2D(const vector<pair<int,int>>& pts){\\n for (auto[x,y]:pts){\\n xs.push_back(x);\\n }\\n sort(all(xs));\\n xs.erase(unique(all(xs)), xs.end());\\n\\n const int n =xs.size();\\n size=1;\\n while(size < n)size<<=1;\\n ys.resize(2*size);\\n seg.resize(2*size);\\n\\n for (auto[x,y]:pts){\\n ys[size+getx(x)].push_back(y);\\n }\\n\\n for(int i=size+n-1; i>0;--i){\\n if (i>=size){\\n sort(all(ys[i]));\\n }else{\\n merge(all(ys[2*i]), all(ys[2*i+1]), back_inserter(ys[i]));\\n }\\n ys[i].erase(unique(all(ys[i])), ys[i].end());\\n }\\n rep(i,1,size+n){\\n seg[i]=FenwickTree(ys[i].size());\\n }\\n }\\n\\n void update(int x, int y, int val){\\n int kx=getx(x);\\n kx +=size;\\n int ky=gety(kx,y);\\n seg[kx].update(ky,val);\\n while(kx>>=1){\\n ky=gety(kx,y);\\n // int kl=gety(2*kx,y), kr=gety(2*kx+1,y);\\n // int vl=kl < ys[2*kx].size()&&ys[2*kx][kl]==y ? seg[2*kx][kl] : 0;\\n // int vr=kr < ys[2*kx+1].size()&&ys[2*kx+1][kr]==y ? seg[2*kx+1][kr] : 0;\\n seg[kx].update(ky, val);\\n }\\n }\\n\\n int fold(int tx, int ty) const {\\n int ret = 0;\\n for (int l = size, r=size+getx(tx); l < r; l >>= 1, r>>=1) {\\n if (r&1){\\n --r;\\n ret = max(ret, seg[r].fold(gety(r, ty)));\\n }\\n }\\n return ret;\\n }\\n\\n};\\n\\nint main() {\\n const int M = 1e6+10;\\n vector<vector<pair<int,int>>> pts(M);\\n\\n while (true) {\\n int n, m, A, B;\\n cin >> m >> n >> A >> B;\\n if (m + n == 0) break;\\n\\n int a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\\n\\n auto r = [&]() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n };\\n\\n vector<int> xs;\\n vector<pair<int,int>> yz;\\n\\n rep(i,0,m){\\n int x,y,z;\\n cin>>x>>y>>z;\\n pts[x].push_back({y, z});\\n yz.push_back({y,z});\\n xs.push_back(x);\\n }\\n\\n rep(_,0,n){\\n int x=r();\\n int y=r();\\n int z=r();\\n pts[x].push_back({y,z});\\n yz.push_back({y,z});\\n xs.push_back(x);\\n }\\n\\n sort(all(xs));\\n xs.erase(unique(all(xs)), xs.end());\\n\\n SegTree2D seg(yz);\\n\\n int ans = 0;\\n\\n for(auto x:xs){\\n vector<int> res;\\n for(auto [y,z]:pts[x]){\\n res.push_back(seg.fold(y,z)+1);\\n ans=max(ans,res.back());\\n }\\n int k=0;\\n for(auto[y,z]:pts[x]){\\n seg.update(y,z,res[k++]);\\n }\\n pts[x].clear();\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n cout << flush;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5370,\n \"memory_kb\": 168640,\n \"score_of_the_acc\": -1.6695,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1341_8996636\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint solve(int m, int n, int A, int B) {\\n vector<int> x(m), y(m), z(m);\\n for(int i : rep(m)) x[i] = in(), y[i] = in(), z[i] = in();\\n {\\n int a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1;\\n auto r = [&]() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n };\\n for(int i : rep(n)) {\\n x.push_back(r());\\n y.push_back(r());\\n z.push_back(r());\\n }\\n n = m + n;\\n }\\n\\n vector<map<int,int>> dp; // lis\\n for(int i : sort_idx(iota(n), [&](int i, int j) {\\n if(z[i] != z[j]) return z[i] < z[j];\\n if(x[i] != x[j]) return x[i] > x[j];\\n return y[i] > y[j];\\n })) {\\n const int len = dp.size();\\n int p = 1 + bin_search(-1, len, [&](int p) {\\n // exist? * < (x, y)\\n auto it = dp[p].lower_bound(x[i]);\\n return it != dp[p].begin() and prev(it)->second < y[i];\\n });\\n\\n // insert (x, y) to dp[p]\\n if(p == len) {\\n dp.push_back({{x[i], y[i]}});\\n } else {\\n // erase * >= (x, y)\\n auto it = dp[p].lower_bound(x[i]);\\n while(it != dp[p].end() and it->second >= y[i]) it = dp[p].erase(it);\\n if(not(it != dp[p].begin() and prev(it)->second <= y[i])) dp[p].insert({x[i], y[i]});\\n }\\n }\\n return dp.size();\\n}\\n\\nint main() {\\n while(true) {\\n int m = in(), n = in(), A = in(), B = in();\\n if(make_tuple(m, n, A, B) == make_tuple(0, 0, 0, 0)) return 0;\\n print(solve(m, n, A, B));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 15696,\n \"score_of_the_acc\": -0.0201,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1341_8526024\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define TT template <typename T>\\n#define MM << ' ' <<\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\ntemplate <typename T>\\nT f(T x, T y) {\\n return max(x, y);\\n}\\n\\ntemplate <typename T>\\nstruct BIT {\\n int n;\\n vector<T> a;\\n\\n BIT(vector<T> v) : n(sz(v)) {\\n a.assign(n + 1, 0);\\n copy(all(v), begin(a) + 1);\\n for (int i = 2; i <= n; i <<= 1) {\\n for (int j = i; j <= n; j += i) a[j] = f(a[j], a[j - i / 2]);\\n }\\n }\\n\\n BIT(int n, T x) : BIT(vector<T>(n, x)) {}\\n\\n void add(int i, T x) {\\n for (i++; i <= n; i += (i & -i)) a[i] = f(a[i], x);\\n }\\n\\n T sum(int i) {\\n T ret = 0;\\n for (; i > 0; i -= (i & -i)) ret = f(ret, a[i]);\\n return ret;\\n }\\n};\\n\\ntemplate <typename T, typename C>\\nstruct BIT2D {\\n int n;\\n vector<C> xs;\\n vector<pair<C, C>> allPoints;\\n vector<vector<C>> ys;\\n vector<BIT<T>> bits;\\n\\n BIT2D() {}\\n\\n void insert(C x, C y) {\\n xs.eb(x);\\n allPoints.eb(x, y);\\n }\\n\\n void build() {\\n rearrange(xs);\\n n = sz(xs);\\n ys.resize(n + 1);\\n for (auto [x, y] : allPoints) {\\n int i = lb(xs, x);\\n for (i++; i <= n; i += (i & -i)) ys[i].eb(y);\\n }\\n rep(i, n + 1) {\\n rearrange(ys[i]);\\n bits.eb(sz(ys[i]), 0);\\n }\\n }\\n\\n void add(C x, C y, T a) {\\n int i = lb(xs, x);\\n for (i++; i <= n; i += (i & -i)) {\\n int j = lb(ys[i], y);\\n bits[i].add(j, a);\\n }\\n }\\n\\n T sum(C x, C y) {\\n int i = lb(xs, x);\\n T ret = 0;\\n for (; i > 0; i -= (i & -i)) {\\n int j = lb(ys[i], y);\\n ret = f(ret, bits[i].sum(j));\\n }\\n return ret;\\n }\\n};\\n\\nusing ull = unsigned long long;\\n\\nvoid solve() {\\n int M, N;\\n int A, B;\\n cin >> M >> N >> A >> B;\\n\\n if (N == 0 && M == 0) exit(0);\\n\\n vector<int> x(M), y(M), z(M);\\n rep(i, M) cin >> x[i] >> y[i] >> z[i];\\n\\n int a = A, b = B;\\n auto rand = [&]() {\\n int C = ~(1 << 31), M = (1 << 16) - 1;\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n };\\n\\n rep(i, 3 * N) {\\n int t = rand();\\n (i % 3 == 0 ? x : i % 3 == 1 ? y : z).eb(t);\\n }\\n\\n N += M;\\n\\n // rep(i, N) cout << x[i] MM y[i] MM z[i] << '\\\\n';\\n\\n const int MAX = 1000000;\\n\\n BIT2D<int, int> bit;\\n vector<vector<int>> ids(MAX);\\n\\n rep(i, N) {\\n ids[z[i]].eb(i);\\n bit.insert(x[i], y[i]);\\n }\\n bit.build();\\n\\n vector<int> dp(N, -inf);\\n\\n rep(i, MAX) {\\n each(e, ids[i]) {\\n dp[e] = bit.sum(x[e], y[e]) + 1; //\\n }\\n each(e, ids[i]) {\\n bit.add(x[e], y[e], dp[e]); //\\n }\\n }\\n\\n cout << *max_element(all(dp)) << '\\\\n';\\n}\\n\\nint main() {\\n while (true) solve(); //\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4100,\n \"memory_kb\": 109136,\n \"score_of_the_acc\": -1.1016,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1341_8280278\",\n \"code_snippet\": \"#include <iostream>\\n#include <tuple>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nclass RangeMax {\\npublic:\\n\\tint size_ = 1;\\n\\tvector<int> dat;\\n\\n\\tvoid init(int sz) {\\n\\t\\twhile (size_ <= sz) size_ *= 2;\\n\\t\\tdat.resize(size_ * 2, -1000000);\\n\\t}\\n\\n\\tvoid update(int pos, int x) {\\n\\t\\tpos += size_;\\n\\t\\tdat[pos] = x;\\n\\t\\twhile (pos >= 2) {\\n\\t\\t\\tpos >>= 1;\\n\\t\\t\\tdat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tint query_(int l, int r, int a, int b, int u) {\\n\\t\\tif (l <= a && b <= r) return dat[u];\\n\\t\\tif (r <= a || b <= l) return -(1 << 30);\\n\\t\\tint v1 = query_(l, r, a, (a + b) / 2, u * 2);\\n\\t\\tint v2 = query_(l, r, (a + b) / 2, b, u * 2 + 1);\\n\\t\\treturn max(v1, v2);\\n\\t}\\n\\n\\tint query(int l, int r) {\\n\\t\\treturn query_(l, r, 0, size_, 1);\\n\\t}\\n};\\n\\n// 誤読で 20 分溶かした．\\nint M, N, A, B;\\nint X[300009], Y[300009], Z[300009];\\nint Bar[300009];\\nint dp[300009];\\nvector<int> LX, LY, LZ;\\nRangeMax W;\\n\\nvoid Generate() {\\n\\tint a = A, b = B, C = ~(1 << 31), MM = (1 << 16) - 1;\\n\\tfor (int i = 0; i < 3 * N; i++) {\\n\\t\\ta = 36969 * (a & MM) + (a >> 16);\\n\\t\\tb = 18000 * (b & MM) + (b >> 16);\\n\\t\\tint val = (C & ((a << 16) + b)) % 1000000;\\n\\t\\tif (i % 3 == 0) X[M + i / 3] = val;\\n\\t\\tif (i % 3 == 1) Y[M + i / 3] = val;\\n\\t\\tif (i % 3 == 2) Z[M + i / 3] = val;\\n\\t}\\n}\\n\\nvoid dfs(int cl, int cr) {\\n\\tif (cr - cl == 1) return;\\n\\tint cm = (cl + cr) / 2;\\n\\tint pl = Bar[cl];\\n\\tint pm = Bar[cm];\\n\\tint pr = Bar[cr];\\n\\n\\t// Recursion 1\\n\\tdfs(cl, cm);\\n\\n\\t// Initialize\\n\\tvector<pair<int, int>> List;\\n\\tfor (int i = pl; i < pm; i++) List.push_back(make_pair(Y[i], i));\\n\\tfor (int i = pm; i < pr; i++) List.push_back(make_pair(Y[i], -i));\\n\\tsort(List.begin(), List.end());\\n\\n\\t// Main Query\\n\\tfor (int i = 0; i < List.size(); i++) {\\n\\t\\tint idx = abs(List[i].second);\\n\\t\\tif (idx < pm) {\\n\\t\\t\\tW.update(Z[idx], max(W.dat[Z[idx] + W.size_], dp[idx]));\\n\\t\\t}\\n\\t\\tif (idx >= pm) {\\n\\t\\t\\tdp[idx] = max(dp[idx], W.query(0, Z[idx]) + 1);\\n\\t\\t}\\n\\t}\\n\\n\\t// Reset\\n\\tfor (int i = 0; i < List.size(); i++) {\\n\\t\\tint idx = abs(List[i].second);\\n\\t\\tif (idx < pm) W.update(Z[idx], -1000000);\\n\\t}\\n\\n\\t// Recursion 2\\n\\tdfs(cm, cr);\\n}\\n\\nint Solve() {\\n\\t// Step 1. Compression\\n\\tLX.clear();\\n\\tLY.clear();\\n\\tLZ.clear();\\n\\tfor (int i = 0; i < M + N; i++) LX.push_back(X[i]);\\n\\tfor (int i = 0; i < M + N; i++) LY.push_back(Y[i]);\\n\\tfor (int i = 0; i < M + N; i++) LZ.push_back(Z[i]);\\n\\tsort(LX.begin(), LX.end()); LX.erase(unique(LX.begin(), LX.end()), LX.end());\\n\\tsort(LY.begin(), LY.end()); LY.erase(unique(LY.begin(), LY.end()), LY.end());\\n\\tsort(LZ.begin(), LZ.end()); LZ.erase(unique(LZ.begin(), LZ.end()), LZ.end());\\n\\tfor (int i = 0; i < M + N; i++) X[i] = lower_bound(LX.begin(), LX.end(), X[i]) - LX.begin();\\n\\tfor (int i = 0; i < M + N; i++) Y[i] = lower_bound(LY.begin(), LY.end(), Y[i]) - LY.begin();\\n\\tfor (int i = 0; i < M + N; i++) Z[i] = lower_bound(LZ.begin(), LZ.end(), Z[i]) - LZ.begin();\\n\\tW.init(LZ.size() + 2);\\n\\n\\t// Step 2. Sorting\\n\\tvector<tuple<int, int, int>> tup;\\n\\tfor (int i = 0; i < M + N; i++) tup.push_back(make_tuple(X[i], Y[i], Z[i]));\\n\\tsort(tup.begin(), tup.end());\\n\\tfor (int i = 0; i < M + N; i++) {\\n\\t\\tX[i] = get<0>(tup[i]);\\n\\t\\tY[i] = get<1>(tup[i]);\\n\\t\\tZ[i] = get<2>(tup[i]);\\n\\t}\\n\\tfor (int i = 0; i <= LX.size(); i++) Bar[i] = 0;\\n\\tfor (int i = 0; i < M + N; i++) Bar[X[i] + 1] += 1;\\n\\tfor (int i = 1; i <= LX.size(); i++) Bar[i] += Bar[i - 1];\\n\\n\\t// Step 3. Divide and Conquer\\n\\tfor (int i = 0; i < M + N; i++) dp[i] = 1;\\n\\tdfs(0, LX.size());\\n\\tint maxn = 0;\\n\\tfor (int i = 0; i < M + N; i++) maxn = max(maxn, dp[i]);\\n\\treturn maxn;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> M >> N >> A >> B;\\n\\t\\tif (M + N + A + B == 0) break;\\n\\t\\tfor (int i = 0; i < M; i++) cin >> X[i] >> Y[i] >> Z[i];\\n\\t\\tGenerate();\\n\\t\\tcout << Solve() << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3630,\n \"memory_kb\": 28636,\n \"score_of_the_acc\": -0.5118,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1341_7254860\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nconst vi DY = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\\ndouble EPS = 1e-12;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n// 手元環境（Visual Studio）\\n#ifdef _MSC_VER\\n#include \\\"local.hpp\\\"\\n// 提出用（gcc）\\n#else\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define gcd __gcd\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_list(v)\\n#define dump_list2D(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#define Assert(b) { if (!(b)) while (1) cout << \\\"OLE\\\"; }\\n#endif\\n\\n#endif // 折りたたみ用\\n\\n\\n////--------------AtCoder 専用--------------\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//\\n////using mint = modint1000000007;\\n//using mint = modint998244353;\\n////using mint = modint; // mint::set_mod(m);\\n//\\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\\n////----------------------------------------\\n\\n\\n//【狭義単調な点列】\\n/*\\n* Monotonous_points<T>(bool y_greater = true, T inf = max(T)/2) : O(1)\\n*\\t空で初期化する．x 座標は狭義単調増加で，y 座標は y_greater=true[false] なら狭義単調増加[減少]とする．\\n* \\n* void insert(T x, T y) : ならし O(log n)\\n*\\t点 (x, y) を挿入し，それにより単調性に違反する点は全て削除する．\\n*\\n* bool find_LL(T x, T y, bool strict = true) : O(log n)\\n*\\tx' < x かつ y' < y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\\n*\\n* bool find_LG(T x, T y, bool strict = true) : O(log n)\\n*\\tx' < x かつ y' > y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\\n*\\n* bool find_GL(T x, T y, bool strict = true) : O(log n)\\n*\\tx' > x かつ y' < y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\\n* \\n* bool find_GG(T x, T y, bool strict = true) : O(log n)\\n*\\tx' > x かつ y' > y なる点 (x', y') が存在するかを返す（strict=false なら等号も許す）\\n* \\n* pTT lower_bound(T x) : O(log n)\\n*\\tx' >= x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\\n* \\n* pTT upper_bound(T x) : O(log n)\\n*\\tx' > x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\\n* \\n* pTT lower_bound_rev(T x) : O(log n)\\n*\\tx' <= x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\\n* \\n* pTT upper_bound_rev(T x) : O(log n)\\n*\\tx' < x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\\n*/\\ntemplate <class T>\\nstruct Monotonous_points {\\n\\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\\n\\n\\tbool y_greater;\\n\\tT inf;\\n\\n\\t// x, y 両座標ともに狭義単調増加な点列\\n\\tmap<T, T> x_to_y;\\n\\n\\t// 空で初期化\\n\\tMonotonous_points(bool y_greater = true, T inf_ = -1) : y_greater(y_greater) {\\n\\t\\tinf = (inf_ == -1 ? numeric_limits<T>::max() / 2 : inf_);\\n\\n\\t\\t// 番兵を挿入しておく．\\n\\t\\tif (y_greater) { x_to_y[-inf] = -inf; x_to_y[inf] = inf; }\\n\\t\\telse { x_to_y[-inf] = inf; x_to_y[inf] = -inf; }\\n\\t}\\n\\n\\t// 点 (x, y) を挿入し，単調性に違反する点は全て削除する．\\n\\tvoid insert(T x, T y) {\\n\\t\\t// verify : https://atcoder.jp/contests/abc283/tasks/abc283_f\\n\\n\\t\\t// x <= x' なる最小の x' を指すイテレータを得る．\\n\\t\\tauto it = x_to_y.lower_bound(x);\\n\\n\\t\\t// x' から昇順に，y' <= y[ y' >= y ] である限り要素を削除する．\\n\\t\\tif (y_greater) {\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tif (it->second > y) break;\\n\\t\\t\\t\\tit = x_to_y.erase(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tif (it->second < y) break;\\n\\t\\t\\t\\tit = x_to_y.erase(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// x' から降順に，y' >= y[ y' <= y ] である限り要素を削除する．\\n\\t\\tif (y_greater) {\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tit = prev(it);\\n\\t\\t\\t\\tif (it->second < y) break;\\n\\t\\t\\t\\tit = x_to_y.erase(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\twhile (true) {\\n\\t\\t\\t\\tit = prev(it);\\n\\t\\t\\t\\tif (it->second > y) break;\\n\\t\\t\\t\\tit = x_to_y.erase(it);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// 点 (x, y) を挿入する．\\n\\t\\tx_to_y[x] = y;\\n\\t}\\n\\n\\t// x' < x かつ y' < y なる点が存在するかを返す（strict=false なら等号も許す）\\n\\tbool find_LL(T x, T y, bool strict = true) {\\n\\t\\tif (strict) {\\n\\t\\t\\tT y2 = prev(x_to_y.lower_bound(x))->second;\\n\\t\\t\\treturn y2 != -inf && y2 < y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tT y2 = prev(x_to_y.upper_bound(x))->second;\\n\\t\\t\\treturn y2 != -inf && y2 <= y;\\n\\t\\t}\\n\\t}\\n\\n\\t// x' < x かつ y' > y なる点が存在するかを返す（strict=false なら等号も許す）\\n\\tbool find_LG(T x, T y, bool strict = true) {\\n\\t\\tif (strict) {\\n\\t\\t\\tT y2 = prev(x_to_y.lower_bound(x))->second;\\n\\t\\t\\treturn y2 != inf && y2 > y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tT y2 = prev(x_to_y.upper_bound(x))->second;\\n\\t\\t\\treturn y2 != inf && y2 >= y;\\n\\t\\t}\\n\\t}\\n\\n\\t// x' > x かつ y' < y なる点が存在するかを返す（strict=false なら等号も許す）\\n\\tbool find_GL(T x, T y, bool strict = true) {\\n\\t\\tif (strict) {\\n\\t\\t\\tT y2 = x_to_y.upper_bound(x)->second;\\n\\t\\t\\treturn y2 != -inf && y2 < y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tT y2 = x_to_y.lower_bound(x)->second;\\n\\t\\t\\treturn y2 != -inf && y2 <= y;\\n\\t\\t}\\n\\t}\\n\\n\\t// x' > x かつ y' > y なる点が存在するかを返す（strict=false なら等号も許す）\\n\\tbool find_GG(T x, T y, bool strict = true) {\\n\\t\\tif (strict) {\\n\\t\\t\\tT y2 = x_to_y.upper_bound(x)->second;\\n\\t\\t\\treturn y2 != inf && y2 > y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tT y2 = x_to_y.lower_bound(x)->second;\\n\\t\\t\\treturn y2 != inf && y2 >= y;\\n\\t\\t}\\n\\t}\\n\\n\\t// x' >= x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\\n\\tpair<T, T> lower_bound(T x) {\\n\\t\\treturn *x_to_y.lower_bound(x);\\n\\t}\\n\\n\\t// x' > x なる x 座標が最小の点 (x', y') を返す（なければ (inf, inf[ninf])）\\n\\tpair<T, T> upper_bound(T x) {\\n\\t\\treturn *x_to_y.upper_bound(x);\\n\\t}\\n\\n\\t// x' <= x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\\n\\tpair<T, T> lower_bound_rev(T x) {\\n\\t\\treturn *prev(x_to_y.upper_bound(x));\\n\\t}\\n\\n\\t// x' < x なる x 座標が最大の点 (x', y') を返す（なければ (ninf, ninf[inf])）\\n\\tpair<T, T> upper_bound_rev(T x) {\\n\\t\\treturn *prev(x_to_y.lower_bound(x));\\n\\t}\\n\\n#ifdef _MSC_VER\\n\\tfriend ostream& operator<<(ostream& os, const Monotonous_points& mp) {\\n\\t\\trepe(p, mp.x_to_y) if (abs(p.first) != mp.inf) os << p << \\\" \\\";\\n\\t\\treturn os;\\n\\t}\\n#endif\\n}; \\n\\n\\n//【めぐる式二分探索】O(log|ok - ng|)\\n/*\\n* 条件 okQ() を満たす要素 ok と満たさない要素 ng との境界を二分探索する．\\n* 境界に隣り合うような条件を満たす要素（ok 側）の位置を返す．\\n*/\\ntemplate <typename T>\\nT meguru_search(T ok, T ng, function<bool(T)>& okQ) {\\n\\t// 参考 : https://twitter.com/meguru_comp/status/697008509376835584\\n\\t// verify : https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_4_D\\n\\n\\t// 境界が決定するまで\\n\\twhile (abs(ok - ng) > 1) {\\n\\t\\t// 区間の中間\\n\\t\\tT mid = (ok + ng) / 2;\\n\\n\\t\\t// 中間が OK かどうかに応じて区間を縮小する．\\n\\t\\tif (okQ(mid)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\treturn ok;\\n\\n\\t/* okQ の定義の雛形\\n\\tusing T = ll;\\n\\tfunction<bool(T)> okQ = [&](T x) {\\n\\t\\treturn true || false;\\n\\t};\\n\\t*/\\n}\\n\\n\\n//【最長増加部分列（二次元）】O(n (log n)^2)\\n/*\\n* 数列 a[0..n), b[0..n) について，添字の増加列 t_0 < ... < t_(k-1) で，\\n*\\t\\t∀i∈[0..k-1), a[t_i] < a[t_(i+1)] かつ b[t_i] < b[t_(i+1)]\\n* を満たすものの長さ k の最大値を返す．\\n*\\n* 利用：【狭義単調な点列】，【めぐる式二分探索】\\n*/\\ntemplate <class T>\\nint longest_increasing_subsequence_2D(const vector<T>& a, const vector<T>& b) {\\n\\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\\n\\t// verify : https://onlinejudge.u-aizu.ac.jp/problems/1341\\n\\n\\tint n = sz(a);\\n\\n\\t// ps[j] : その要素を末尾にもつ長さ j の増加部分列が存在するような点（ps[0] は使わない）\\n\\tvector<Monotonous_points<T>> ps(1);\\n\\n\\trep(i, n) {\\n\\t\\t// j : (a[i], b[i]) を末尾に持つ増加部分列の最大長\\n\\t\\tfunction<bool(int)> okQ = [&](int j) { return ps[j].find_LL(a[i], b[i]); };\\n\\t\\tint j = meguru_search(0, sz(ps), okQ) + 1;\\n\\n\\t\\t// 点 (a[i], b[i]) を挿入する．\\n\\t\\tif (j >= sz(ps)) ps.push_back(Monotonous_points<T>(false));\\n\\t\\tif (!ps[j].find_LL(a[i], b[i], false)) ps[j].insert(a[i], b[i]);\\n\\n\\t\\tdump(i); dump(ps);\\n\\t}\\n\\n\\treturn sz(ps) - 1;\\n}\\n\\n\\nint a, b, C = ~(1 << 31), M = (1 << 16) - 1;\\nint r() {\\n\\ta = 36969 * (a & M) + (a >> 16);\\n\\tb = 18000 * (b & M) + (b >> 16);\\n\\treturn (C & ((a << 16) + b)) % 1000000;\\n}\\n\\n\\nint solve(int N, vi x, vi y, vi z) {\\n\\tvector<tuple<int, int, int>> xyz(N);\\n\\trep(i, N) xyz[i] = { -x[i], y[i], z[i] };\\n\\tsort(all(xyz), greater<tuple<int, int, int>>());\\n\\n\\trep(i, N) tie(x[i], y[i], z[i]) = xyz[i];\\n\\tdump(y); dump(z);\\n\\n\\treturn longest_increasing_subsequence_2D(y, z);\\n}\\n\\n\\n//【最長パス】O(|V| + |E|)\\n/*\\n* DAG g の頂点 s からの最長パスの長さを len[s] に格納し len を返す．\\n*/\\nvi longest_path(const Graph& g) {\\n\\t// verify : https://atcoder.jp/contests/dp/tasks/dp_g\\n\\n\\tint n = sz(g);\\n\\n\\t// len[s] : 頂点 s からの最長パスの長さ\\n\\tvi len(n);\\n\\tvb seen(n);\\n\\n\\tfunction<int(int)> dfs = [&](int s) {\\n\\t\\tif (seen[s]) return len[s];\\n\\t\\tseen[s] = true;\\n\\t\\tlen[s] = 0;\\n\\n\\t\\t// s → t と進む場合\\n\\t\\trepe(t, g[s]) chmax(len[s], dfs(t) + 1);\\n\\n\\t\\treturn len[s];\\n\\t};\\n\\n\\t// 各頂点 s についての情報を計算する．\\n\\trep(s, n) if (!seen[s]) dfs(s);\\n\\n\\treturn len;\\n}\\n\\n\\nint naive(int N, vi x, vi y, vi z) {\\n\\tGraph g(N);\\n\\n\\trep(i, N) rep(j, N) {\\n\\t\\tif (x[i] < x[j] && y[i] < y[j] && z[i] < z[j]) {\\n\\t\\t\\tg[i].push_back(j);\\n\\t\\t}\\n\\t}\\n\\n\\tauto len = longest_path(g);\\n\\n\\treturn *max_element(all(len)) + 1;\\n}\\n\\n\\nvoid bug_find() {\\n#ifdef _MSC_VER\\n\\t// 合わない入力例を見つける．\\n\\n\\tmt19937_64 mt;\\n\\tmt.seed((int)time(NULL));\\n\\tuniform_int_distribution<ll> rnd(0LL, 1LL << 62);\\n\\n\\tmute_dump = true;\\n\\n\\trep(hoge, 1000) {\\n\\t\\tint n = 50;\\n\\t\\tvi x(n), y(n), z(n);\\n\\t\\trep(i, n) {\\n\\t\\t\\tx[i] = rnd(mt) % 10;\\n\\t\\t\\ty[i] = rnd(mt) % 10;\\n\\t\\t\\tz[i] = rnd(mt) % 10;\\n\\t\\t}\\n\\n\\t\\tauto res_naive = naive(n, x, y, z);\\n\\t\\tauto res_solve = solve(n, x, y, z);\\n\\n\\t\\tif (res_naive != res_solve) {\\n\\t\\t\\tcout << \\\"----------error!----------\\\" << endl;\\n\\t\\t\\tcout << \\\"input:\\\" << endl;\\n\\t\\t\\tcout << x << endl;\\n\\t\\t\\tcout << y << endl;\\n\\t\\t\\tcout << z << endl;\\n\\t\\t\\tcout << \\\"results:\\\" << endl;\\n\\t\\t\\tcout << res_naive << endl;\\n\\t\\t\\tcout << res_solve << endl;\\n\\t\\t\\tcout << \\\"--------------------------\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\n\\tmute_dump = false;\\n\\texit(0);\\n#endif\\n}\\n/*\\n----------error!----------\\ninput:\\n0 2 8 3 6\\n4 2 2 0 0\\n2 0 2 0 9\\nresults:\\n2\\n1\\n--------------------------\\n*/\\n\\n\\nint main() {\\n\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tbug_find();\\n\\n\\twhile (1) {\\n\\t\\tint m, n;\\n\\t\\tcin >> m >> n >> a >> b;\\n\\t\\tdump(m, n, a, b);\\n\\n\\t\\tif (m == 0 && n == 0) return 0;\\n\\n\\t\\tvi x(m + n), y(m + n), z(m + n);\\n\\t\\trep(i, m) cin >> x[i] >> y[i] >> z[i];\\n\\t\\trep(i, n) { x[m + i] = r(); y[m + i] = r(); z[m + i] = r(); }\\n\\n\\t\\tdump(naive(m + n, x, y, z));\\n\\t\\tcout << solve(m + n, x, y, z) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 25092,\n \"score_of_the_acc\": -0.0911,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1341_7244624\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nconst vi DY = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\\ndouble EPS = 1e-12;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n// 手元環境（Visual Studio）\\n#ifdef _MSC_VER\\n#include \\\"local.hpp\\\"\\n// 提出用（gcc）\\n#else\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define gcd __gcd\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_list(v)\\n#define dump_list2D(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#define Assert(b) { if (!(b)) while (1) cout << \\\"OLE\\\"; }\\n#endif\\n\\n#endif // 折りたたみ用\\n\\n\\n////--------------AtCoder 専用--------------\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//\\n////using mint = modint1000000007;\\n//using mint = modint998244353;\\n////using mint = modint; // mint::set_mod(m);\\n//\\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\\n////----------------------------------------\\n\\n\\n//【めぐる式二分探索】O(log|ok - ng|)\\n/*\\n* 条件 okQ() を満たす要素 ok と満たさない要素 ng との境界を二分探索する．\\n* 境界に隣り合うような条件を満たす要素（ok 側）の位置を返す．\\n*/\\ntemplate <typename T>\\nT meguru_search(T ok, T ng, function<bool(T)>& okQ) {\\n\\t// 参考 : https://twitter.com/meguru_comp/status/697008509376835584\\n\\t// verify : https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_4_D\\n\\n\\t// 境界が決定するまで\\n\\twhile (abs(ok - ng) > 1) {\\n\\t\\t// 区間の中間\\n\\t\\tT mid = (ok + ng) / 2;\\n\\n\\t\\t// 中間が OK かどうかに応じて区間を縮小する．\\n\\t\\tif (okQ(mid)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\treturn ok;\\n\\n\\t/* okQ の定義の雛形\\n\\tusing T = ll;\\n\\tfunction<bool(T)> okQ = [&](T x) {\\n\\t\\treturn true || false;\\n\\t};\\n\\t*/\\n}\\n\\n\\n//【狭義単調な点列】\\n/*\\n* Monotonous_points<T>() : O(1)\\n*\\t空で初期化する．\\n* \\n* void insert(T x, T y) : ならし O(log n)\\n*\\t点 (x, y) を挿入し，x <= x' かつ y <= y' なる点 (x', y') は全て削除する．\\n* \\n* bool find(T x, T y) : O(log n)\\n*\\tx' < x かつ y' < y なる点が存在するかを返す．\\n*/\\ntemplate <class T>\\nclass Monotonous_points {\\n\\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\\n\\n\\t// x 座標狭義昇順に保持した点のリスト（y 座標は狭義降順）\\n\\tmap<T, T> x_to_y;\\n\\npublic:\\n\\t// 空で初期化\\n\\tMonotonous_points() {}\\n\\n\\t// 点 (x, y) を挿入し，x <= x' かつ y <= y' なる点 (x', y') は全て削除する．\\n\\tvoid insert(T x, T y) {\\n\\t\\t// x <= x' なる最小の x' を指すイテレータを得る．\\n\\t\\tauto it = x_to_y.lower_bound(x);\\n\\n\\t\\t// x' から昇順に，y <= y' である限り要素を削除する．\\n\\t\\twhile (it != x_to_y.end()) {\\n\\t\\t\\tif (it->second < y) break;\\n\\n\\t\\t\\tit = x_to_y.erase(it);\\n\\t\\t}\\n\\n\\t\\t// 点 (x, y) を挿入する．\\n\\t\\tif (it == x_to_y.end() || it->first != x) x_to_y[x] = y;\\n\\t}\\n\\n\\t// x' < x かつ y' < y なる点が存在するかを返す．\\n\\tbool find(T x, T y) {\\n\\t\\t// x <= x' なる最小の x' を指すイテレータを得る．\\n\\t\\tauto it = x_to_y.lower_bound(x);\\n\\n\\t\\t// その直前の要素が条件を満たさないなら他の要素もだめ．\\n\\t\\treturn it != x_to_y.begin() && prev(it)->second < y;\\n\\t}\\n\\n#ifdef _MSC_VER\\n\\tfriend ostream& operator<<(ostream& os, const Monotonous_points& mp) {\\n\\t\\trepe(p, mp.x_to_y) os << p << \\\" \\\";\\n\\t\\treturn os;\\n\\t}\\n#endif\\n};\\n\\n\\n//【最長増加部分列（二次元）】O(n (log n)^2)\\n/*\\n* 数列 a[0..n), b[0..n) について，添字の増加列 t_0 < ... < t_(k-1) で，\\n*\\t\\t∀i∈[0..k-1), a[t_i] < a[t_(i+1)] かつ b[t_i] < b[t_(i+1)]\\n* を満たすものの長さ k の最大値を返す．\\n* \\n* 利用：【狭義単調な点列】，【めぐる式二分探索】\\n*/\\ntemplate <class T>\\nint longest_increasing_subsequence_2D(const vector<T>& a, const vector<T>& b) {\\n\\t// 参考 : https://topcoder-g-hatena-ne-jp.jag-icpc.org/skyaozora/20141216.html\\n\\n\\tint n = sz(a);\\n\\n\\t// ps[j] : その要素を末尾にもつ長さ j の増加部分列が存在するような点（ps[0] は使わない）\\n\\tvector<Monotonous_points<T>> ps(1);\\n\\n\\trep(i, n) {\\n\\t\\t// j : (a[i], b[i]) を末尾に持つ増加部分列の最大長\\n\\t\\tfunction<bool(int)> okQ = [&](int j) { return ps[j].find(a[i], b[i]); };\\n\\t\\tint j = meguru_search(0, sz(ps), okQ) + 1;\\n\\n\\t\\t// 点 (a[i], b[i]) を挿入する．\\n\\t\\tif (j >= sz(ps)) ps.push_back(Monotonous_points<T>());\\n\\t\\tps[j].insert(a[i], b[i]);\\n\\n\\t\\tdump(i); dump(ps);\\n\\t}\\n\\n\\treturn sz(ps) - 1;\\n}\\n\\n\\nint a, b, C = ~(1 << 31), M = (1 << 16) - 1;\\nint r() {\\n\\ta = 36969 * (a & M) + (a >> 16);\\n\\tb = 18000 * (b & M) + (b >> 16);\\n\\treturn (C & ((a << 16) + b)) % 1000000;\\n}\\n\\n\\nint solve(int N, vi x, vi y, vi z) {\\n\\tvector<tuple<int, int, int>> xyz(N);\\n\\trep(i, N) xyz[i] = { -x[i], y[i], z[i] };\\n\\tsort(all(xyz), greater<tuple<int, int, int>>());\\n\\n\\trep(i, N) tie(x[i], y[i], z[i]) = xyz[i];\\n\\tdump(y); dump(z);\\n\\n\\treturn longest_increasing_subsequence_2D(y, z);\\n}\\n\\n\\n//【最長パス】O(|V| + |E|)\\n/*\\n* DAG g の頂点 s からの最長パスの長さを len[s] に格納し len を返す．\\n*/\\nvi longest_path(const Graph& g) {\\n\\t// verify : https://atcoder.jp/contests/dp/tasks/dp_g\\n\\n\\tint n = sz(g);\\n\\n\\t// len[s] : 頂点 s からの最長パスの長さ\\n\\tvi len(n);\\n\\tvb seen(n);\\n\\n\\tfunction<int(int)> dfs = [&](int s) {\\n\\t\\tif (seen[s]) return len[s];\\n\\t\\tseen[s] = true;\\n\\t\\tlen[s] = 0;\\n\\n\\t\\t// s → t と進む場合\\n\\t\\trepe(t, g[s]) chmax(len[s], dfs(t) + 1);\\n\\n\\t\\treturn len[s];\\n\\t};\\n\\n\\t// 各頂点 s についての情報を計算する．\\n\\trep(s, n) if (!seen[s]) dfs(s);\\n\\n\\treturn len;\\n}\\n\\n\\nint naive(int N, vi x, vi y, vi z) {\\n\\tGraph g(N);\\n\\n\\trep(i, N) rep(j, N) {\\n\\t\\tif (x[i] < x[j] && y[i] < y[j] && z[i] < z[j]) {\\n\\t\\t\\tg[i].push_back(j);\\n\\t\\t}\\n\\t}\\n\\n\\tauto len = longest_path(g);\\n\\n\\treturn *max_element(all(len)) + 1;\\n}\\n\\n\\nvoid bug_find() {\\n#ifdef _MSC_VER\\n\\t// 合わない入力例を見つける．\\n\\n\\tmt19937_64 mt;\\n\\tmt.seed((int)time(NULL));\\n\\tuniform_int_distribution<ll> rnd(0LL, 1LL << 62);\\n\\n\\tmute_dump = true;\\n\\n\\trep(hoge, 1000) {\\n\\t\\tint n = 50;\\n\\t\\tvi x(n), y(n), z(n);\\n\\t\\trep(i, n) {\\n\\t\\t\\tx[i] = rnd(mt) % 10;\\n\\t\\t\\ty[i] = rnd(mt) % 10;\\n\\t\\t\\tz[i] = rnd(mt) % 10;\\n\\t\\t}\\n\\n\\t\\tauto res_naive = naive(n, x, y, z);\\n\\t\\tauto res_solve = solve(n, x, y, z);\\n\\n\\t\\tif (res_naive != res_solve) {\\n\\t\\t\\tcout << \\\"----------error!----------\\\" << endl;\\n\\t\\t\\tcout << \\\"input:\\\" << endl;\\n\\t\\t\\tcout << x << endl;\\n\\t\\t\\tcout << y << endl;\\n\\t\\t\\tcout << z << endl;\\n\\t\\t\\tcout << \\\"results:\\\" << endl;\\n\\t\\t\\tcout << res_naive << endl;\\n\\t\\t\\tcout << res_solve << endl;\\n\\t\\t\\tcout << \\\"--------------------------\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\n\\tmute_dump = false;\\n\\texit(0);\\n#endif\\n}\\n/*\\n----------error!----------\\ninput:\\n0 2 8 3 6\\n4 2 2 0 0\\n2 0 2 0 9\\nresults:\\n2\\n1\\n--------------------------\\n*/\\n\\n\\nint main() {\\n\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tbug_find();\\n\\n\\twhile (1) {\\n\\t\\tint m, n;\\n\\t\\tcin >> m >> n >> a >> b;\\n\\t\\tdump(m, n, a, b);\\n\\n\\t\\tif (m == 0 && n == 0) return 0;\\n\\n\\t\\tvi x(m + n), y(m + n), z(m + n);\\n\\t\\trep(i, m) cin >> x[i] >> y[i] >> z[i];\\n\\t\\trep(i, n) { x[m + i] = r(); y[m + i] = r(); z[m + i] = r(); }\\n\\n\\t\\tdump(naive(m + n, x, y, z));\\n\\t\\tcout << solve(m + n, x, y, z) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 19752,\n \"score_of_the_acc\": -0.0379,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1341_7244186\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing namespace std::chrono;\\ntypedef long long int llint;\\ntypedef long double lldo;\\n#define mp make_pair\\n#define mt make_tuple\\n#define pub push_back\\n#define puf push_front\\n#define pob pop_back\\n#define pof pop_front\\n#define fir first\\n#define sec second\\n#define res resize\\n#define ins insert\\n#define era erase\\n#define REP(i, n) for(int i = 0;i < (n);i++)\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst int mod=1000000007;\\nconst llint inf=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-10;\\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\ntemplate<class T> using V=vector<T>;\\ntemplate<class T> using VV=vector<V<T>>;\\ntemplate<class T>struct Fenwick{\\n\\tint n;\\n\\tV<T> seg;\\n\\tFenwick(int _n=0):n(_n),seg(n+1){}\\n\\tvoid add(int i,int x){\\n\\t\\ti++;\\n\\t\\twhile(i<=n){\\n\\t\\t\\tchmax(seg[i],x);\\n\\t\\t\\ti+=i&-i;\\n\\t\\t}\\n\\t}\\n\\tT max(int i){\\n\\t\\tT s=0;\\n\\t\\twhile(i>0){\\n\\t\\t\\tchmax(s,seg[i]);\\n\\t\\t\\ti-=i&-i;\\n\\t\\t}\\n\\t\\treturn s;\\n\\t}\\n};\\n\\ntemplate<class D,class I>struct Fenwick2D{\\n\\tusing P=pair<I,I>;\\n\\tV<P>points;\\n\\tVV<I>ys;\\n\\tV<Fenwick<D>>fws;\\n\\tint lg,sz;\\n\\tFenwick2D(V<P> _points):points(_points){\\n\\t\\tSO(points);\\n\\t\\tpoints.erase(unique(points.begin(),points.end()),points.end());\\n\\t\\tint n=int(points.size());\\n\\t\\tlg=1;\\n\\t\\twhile((1<<lg)<n){lg++;}\\n\\t\\tsz=1<<lg;\\n\\t\\tys=VV<I>(2*sz);\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tys[sz+i].pub(points[i].sec);\\n\\t\\t}\\n\\t\\tfor(int i=sz-1;i>=1;i--){\\n\\t\\t\\tys[i]=V<I>(ys[i+i].size()+ys[i+i+1].size());\\n\\t\\t\\tmerge(ys[i+i].begin(),ys[i+i].end(),ys[i+i+1].begin(),ys[i+i+1].end(),ys[i].begin());\\n\\t\\t}\\n\\t\\tfws=V<Fenwick<D>>(sz+sz);\\n\\t\\tfor(int i=1;i<2*sz;i++){\\n\\t\\t\\tfws[i]=Fenwick<D>(int(ys[i].size()));\\n\\t\\t}\\n\\t}\\n\\tvoid add(P p,D x){\\n\\t\\tint k=LBI(points,p);\\n\\t\\tk+=sz;\\n\\t\\twhile(k){\\n\\t\\t\\tint yid=LBI(ys[k],p.sec);\\n\\t\\t\\tfws[k].add(yid,x);\\n\\t\\t\\tk>>=1;\\n\\t\\t}\\n\\t}\\n\\tD getmax(int a,int b,I up,int l,int r,int k){\\n\\t\\tif(b<=l||r<=a){return 0;}\\n\\t\\tif(a<=l&&r<=b){\\n\\t\\t\\tint uid=LBI(ys[k],up);\\n\\t\\t\\treturn fws[k].max(uid);\\n\\t\\t}\\n\\t\\tint mid=(l+r)/2;\\n\\t\\treturn max(getmax(a,b,up,l,mid,2*k),getmax(a,b,up,mid,r,2*k+1));\\n\\t}\\n\\tD getmax(P up){\\n\\t\\tint b=LBI(points,mp(up.fir,-mod));\\n\\t\\treturn getmax(0,b,up.sec,0,sz,1);\\n\\t}\\n};\\nint a, b , C = ~(1<<31), M = (1<<16)-1;\\nint rrr() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\nint main(void){\\n\\twhile(-1){\\n\\t\\tint m,n,A,B,i;cin>>m>>n>>A>>B;\\n\\t\\tif(m+n==0){return 0;}\\n\\t\\tvector<tuple<int,int,int>>xyz(n+m);\\n\\t\\ta=A;b=B;\\n\\t\\tfor(i=0;i<m;i++){\\n\\t\\t\\tint x,y,z;cin>>x>>y>>z;\\n\\t\\t\\txyz[i]=mt(x,-y,-z);\\n\\t\\t}\\n\\t\\tfor(i=0;i<n;i++){\\n\\t\\t\\tint x,y,z;x=rrr();y=rrr();z=rrr();\\n\\t\\t\\txyz[m+i]=mt(x,-y,-z);\\n\\t\\t}\\n\\t\\tSO(xyz);\\n\\t\\tvector<pair<int,int>>yz(n+m);\\n\\t\\tfor(i=0;i<n+m;i++){\\n\\t\\t\\tyz[i]=mp(-get<1>(xyz[i]),-get<2>(xyz[i]));\\n\\t\\t}\\n\\t\\tFenwick2D<int,int> segki(yz);\\n\\t\\tint ans=0;\\n\\t\\tfor(i=0;i<n+m;i++){\\n\\t\\t\\tint kaz=segki.getmax(yz[i])+1;\\n\\t\\t\\tchmax(ans,kaz);\\n\\t\\t\\t\\n\\t\\t\\tsegki.add(yz[i],kaz);\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5600,\n \"memory_kb\": 160288,\n \"score_of_the_acc\": -1.6482,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1341_6813635\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n scan(a), scan(b), scan(c);\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nint a, b, C, M;\\nint r() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nint main() {\\n rep(1000) {\\n INT(m, n, A, B);\\n if(!n and !m) exit(0);\\n if(m + n > 1000) dump(m, n, A, B);\\n VEC3(int, x, y, z, m);\\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\\n\\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\\n\\n n += m;\\n\\n auto id = iota(n);\\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\\n\\n vector<map<int, int>> dp;\\n fore(i, id) {\\n int k = bin_search(-1, si(dp), [&](int k) {\\n auto it = dp[k].lower_bound(x[i]);\\n return it != begin(dp[k]) and prev(it)->se < y[i];\\n });\\n if(k + 1 < si(dp)) {\\n auto &s = dp[k + 1];\\n auto it = s.lower_bound(x[i]);\\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\\n if(it != begin(s) and prev(it)->se <= y[i])\\n continue;\\n else\\n s.emplace_hint(it, x[i], y[i]);\\n } else {\\n dp.eb(map<int, int>{{x[i], y[i]}});\\n }\\n // dump(dp);\\n }\\n\\n OUT(si(dp));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 14580,\n \"score_of_the_acc\": -0.0029,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1341_6813634\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n scan(a), scan(b), scan(c);\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nint a, b, C, M;\\nint r() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nint main() {\\n rep(1000) {\\n INT(m, n, A, B);\\n if(!n and !m) exit(0);\\n if(m + n > 1000) dump(m, n, A, B);\\n VEC3(int, x, y, z, m);\\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\\n\\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\\n\\n n += m;\\n\\n auto id = iota(n);\\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\\n\\n vector<set<pii>> dp;\\n fore(i, id) {\\n int k = bin_search(-1, si(dp), [&](int k) {\\n auto it = dp[k].lower_bound(pii(x[i] - 1, y[i]));\\n return it != begin(dp[k]) and prev(it)->se < y[i];\\n });\\n if(k + 1 < si(dp)) {\\n auto &s = dp[k + 1];\\n auto it = s.lower_bound(pii(x[i], y[i]));\\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\\n if(it != begin(s) and prev(it)->se <= y[i])\\n continue;\\n else\\n s.emplace_hint(it, x[i], y[i]);\\n } else {\\n dp.eb(set<pii>());\\n dp.back().emplace(x[i], y[i]);\\n }\\n // dump(dp);\\n }\\n\\n OUT(si(dp));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 14792,\n \"score_of_the_acc\": -0.0014,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1341_6813633\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define LL(...) \\\\\\n ll __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define DBL(...) \\\\\\n double __VA_ARGS__; \\\\\\n IN(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\nint scan() { return getchar(); }\\nvoid scan(int &a) { cin >> a; }\\nvoid scan(long long &a) { cin >> a; }\\nvoid scan(char &a) { cin >> a; }\\nvoid scan(double &a) { cin >> a; }\\nvoid scan(string &a) { cin >> a; }\\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\\ntemplate <class T> void scan(vector<T> &);\\ntemplate <class T> void scan(vector<T> &a) {\\n for(auto &i : a) scan(i);\\n}\\ntemplate <class T> void scan(T &a) { cin >> a; }\\nvoid IN() {}\\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &...tail) {\\n scan(head);\\n IN(tail...);\\n}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\ntemplate <class T> T POW(T x, int n) {\\n T res = 1;\\n for(; n; n >>= 1, x *= x)\\n if(n & 1) res *= x;\\n return res;\\n}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\n return res;\\n}\\nvector<pll> factor(ll x) {\\n vector<pll> ans;\\n for(ll i = 2; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.push_back({i, 1});\\n while((x /= i) % i == 0) ans.back().second++;\\n }\\n if(x != 1) ans.push_back({x, 1});\\n return ans;\\n}\\ntemplate <class T> vector<T> divisor(T x) {\\n vector<T> ans;\\n for(T i = 1; i * i <= x; i++)\\n if(x % i == 0) {\\n ans.pb(i);\\n if(i * i != x) ans.pb(x / i);\\n }\\n return ans;\\n}\\ntemplate <typename T> void zip(vector<T> &x) {\\n vector<T> y = x;\\n UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\n\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return res;\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n scan(a), scan(b), scan(c);\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nint a, b, C, M;\\nint r() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nint main() {\\n rep(1000) {\\n INT(m, n, A, B);\\n if(!n and !m) exit(0);\\n if(m + n > 1000) dump(m, n, A, B);\\n VEC3(int, x, y, z, m);\\n { a = A, b = B, C = ~(1 << 31), M = (1 << 16) - 1; }\\n\\n rep(n) { x.eb(r()), y.eb(r()), z.eb(r()); }\\n\\n n += m;\\n\\n auto id = iota(n);\\n sort(all(id), [&](int i, int j) { return z[i] != z[j] ? z[i] < z[j] : x[i] != x[j] ? x[i] > x[j] : y[i] > y[j]; });\\n\\n vector<set<pii>> dp;\\n fore(i, id) {\\n int k = bin_search(-1, si(dp), [&](int k) {\\n auto it = dp[k].lower_bound(pii(x[i] - 1, y[i]));\\n return it != begin(dp[k]) and prev(it)->se < y[i];\\n });\\n if(k + 1 < si(dp)) {\\n auto &s = dp[k + 1];\\n auto it = s.lower_bound(pii(x[i], y[i]));\\n while(it != end(s) and it->se >= y[i]) { it = s.erase(it); }\\n if(it != begin(s) and prev(it)->se <= y[i])\\n continue;\\n else\\n s.emplace(x[i], y[i]);\\n } else {\\n dp.eb(set<pii>());\\n dp.back().emplace(x[i], y[i]);\\n }\\n // dump(dp);\\n }\\n\\n OUT(si(dp));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 15076,\n \"score_of_the_acc\": -0.0089,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1341_6674108\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n using type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n using type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[value % 10];\\n value /= 10;\\n } while (value != 0);\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n __int128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n if (s[0] == '-') ret = -ret;\\n return ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n __uint128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_i128(s);\\n return in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_u128(s);\\n return in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n (std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n std::string res;\\n if (bit_num >= 0) {\\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n } else {\\n for (; val; val >>= 1) res += '0' + (val & 1);\\n std::reverse(res.begin(), res.end());\\n }\\n return res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n std::vector<T> res;\\n for (; val; val /= base) res.push_back(val % base);\\n if (res.empty()) res.push_back(T{ 0 });\\n return res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n auto res = digits_low_to_high(val, base);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n std::ostringstream ss;\\n for (auto it = v.begin(); it != v.end();) {\\n ss << *it;\\n if (++it != v.end()) ss << sep;\\n }\\n ss << end;\\n return ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_{};\\n\\n// ! code from here\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <tuple>\\n\\n#include <vector>\\n#include <map>\\n#include <unordered_map>\\n\\nnamespace suisen {\\n template <typename T>\\n struct FenwickTree {\\n int n;\\n vector<T> data;\\n\\n FenwickTree() : FenwickTree(0) {}\\n FenwickTree(int n) : n(n), data(n, 0) {}\\n int size() {\\n return n;\\n }\\n void chmax(int i, T v) {\\n for (++i; i <= n; i += (i & -i)) ::chmax(data[i - 1], v);\\n }\\n T max(int r) {\\n T s = 0;\\n for (; r; r -= r & -r) ::chmax(s, data[r - 1]);\\n return s;\\n }\\n };\\n} // namespace suisen\\n\\nnamespace suisen {\\n template <typename T>\\n struct FenwickTree2DSparse {\\n FenwickTree2DSparse() {}\\n explicit FenwickTree2DSparse(int x_num) : n(x_num + 1), data(n), points(), pos_x(), pos_y(n) {}\\n\\n void add_point(int x, int y) {\\n built = false;\\n pos_x.push_back(x);\\n points.emplace_back(x, y);\\n }\\n\\n void build() {\\n static constexpr int inf = std::numeric_limits<int>::max();\\n built = true;\\n pos_x.push_back(inf);\\n std::sort(pos_x.begin(), pos_x.end());\\n pos_x.erase(std::unique(pos_x.begin(), pos_x.end()), pos_x.end());\\n assert(int(pos_x.size()) <= n);\\n for (const auto& [x, y] : points) for (int k = comp_x(x) + 1; k <= n; k += k & -k) {\\n pos_y[k - 1].push_back(y);\\n }\\n for (int k = 0; k < n; ++k) {\\n pos_y[k].push_back(inf);\\n std::sort(pos_y[k].begin(), pos_y[k].end());\\n pos_y[k].erase(std::unique(pos_y[k].begin(), pos_y[k].end()), pos_y[k].end());\\n data[k] = FenwickTree<T>(pos_y[k].size());\\n }\\n }\\n\\n void chmax(int x, int y, const T& val) {\\n for (int k = comp_x(x) + 1; k <= n; k += k & -k) {\\n data[k - 1].chmax(comp_y(k - 1, y), val);\\n }\\n }\\n T max(int r, int u) {\\n T res = 0;\\n for (r = comp_x(r); r; r -= r & -r) ::chmax(res, data[r - 1].max(comp_y(r - 1, u)));\\n return res;\\n }\\n\\n private:\\n int n, m;\\n std::vector<FenwickTree<T>> data;\\n std::vector<std::pair<int, int>> points;\\n std::vector<int> pos_x;\\n std::vector<std::vector<int>> pos_y;\\n bool built = true;\\n\\n int comp_x(int x) const {\\n return std::lower_bound(pos_x.begin(), pos_x.end(), x) - pos_x.begin();\\n }\\n int comp_y(int k, int y) const {\\n return std::lower_bound(pos_y[k].begin(), pos_y[k].end(), y) - pos_y[k].begin();\\n }\\n };\\n} // namespace suisen\\n\\nint main() {\\n while (true) {\\n input(int, m, n);\\n input(int, A, B);\\n if (m == 0 and n == 0 and A == 0 and B == 0) break;\\n n += m;\\n int C = ~(1 << 31), M = (1 << 16) - 1;\\n auto r = [&]() -> int {\\n A = 36969 * (A & M) + (A >> 16);\\n B = 18000 * (B & M) + (B >> 16);\\n return (C & ((A << 16) + B)) % 1000000;\\n };\\n\\n vector<int> x(n), y(n), z(n);\\n rep(i, n) {\\n if (i < m) {\\n read(x[i], y[i], z[i]);\\n } else {\\n x[i] = r();\\n y[i] = r();\\n z[i] = r();\\n }\\n }\\n\\n FenwickTree2DSparse<int> ft(n);\\n rep(i, n) ft.add_point(y[i], z[i]);\\n ft.build();\\n\\n vector<int> p(n);\\n iota(all(p), 0);\\n sort(all(p), [&](int i, int j) {\\n if (x[i] != x[j]) return x[i] < x[j];\\n if (y[i] != y[j]) return y[i] > y[j];\\n return z[i] > z[j];\\n }\\n );\\n\\n for (int i : p) {\\n ft.chmax(y[i], z[i], ft.max(y[i], z[i]) + 1);\\n }\\n\\n print(ft.max(numeric_limits<int>::max(), numeric_limits<int>::max()));\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3940,\n \"memory_kb\": 75080,\n \"score_of_the_acc\": -0.8577,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1341_6365882\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #define int long long\\n#define ff first\\n#define ss second\\n#define ll long long\\n#define ld long double\\n#define pb push_back\\n#define eb emplace_back\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define ti tuple<int, int, int>\\n#define vi vector<int>\\n#define vl vector<ll>\\n#define vii vector<pii>\\n#define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);\\n#define endl '\\\\n'\\n#define teto(a, b) (((a)+(b)-1)/(b))\\n#define all(x) x.begin(), x.end()\\n#define forn(i, n) for(int i = 0; i < (int)n; i++)\\n#define forne(i, a, b) for(int i = a; i <= b; i++)\\n#define dbg(msg, var) cerr << msg << \\\" \\\" << var << endl;\\n\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"avx,avx2,fma\\\")\\n\\nusing namespace std;\\n\\nconst int MAX = 2e5+10;\\nconst ll MOD = 998244353;\\nconst int INF = 0x3f3f3f3f;\\nconst ll LLINF = 0x3f3f3f3f3f3f3f3f;\\nconst ld EPS = 1e-10;\\nconst ld PI = acos(-1);\\n\\n// End Template //\\n\\nint a, b, C = ~(1<<31), M = (1<<16)-1;\\nint r() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nstruct Segtree{\\n vi t;\\n int n;\\n\\n Segtree(int n){\\n this->n = n;\\n t.assign(2*n, 0);\\n }\\n\\n int merge(int a, int b){\\n return max(a, b);\\n }\\n\\n void build(){\\n for(int i=n-1;i>0;i--)\\n t[i] = merge(t[i<<1], t[i<<1|1]);\\n }\\n\\n int query(int l, int r){\\n int resl = -INF, resr = -INF;\\n for(l+=n, r+=n+1; l<r; l>>=1, r>>=1){\\n if(l&1) resl = merge(resl, t[l++]);\\n if(r&1) resr = merge(t[--r], resr);\\n }\\n return merge(resl, resr);\\n }\\n\\n void update(int p, int value){\\n p+=n;\\n for(t[p]=max(t[p], value); p >>= 1;)\\n t[p] = merge(t[p<<1], t[p<<1|1]);\\n }\\n};\\n\\nstruct point{\\n int x, y, z, id;\\n bool left;\\n point(int x=0, int y=0, int z=0): x(x), y(y), z(z){\\n left = false;\\n }\\n bool operator<(point &o){\\n if(x != o.x) return x < o.x;\\n if(y != o.y) return y > o.y;\\n return z < o.z;\\n }\\n};\\n\\n\\nvoid cdq(int l, int r, vector<point> &a, vi &dp){\\n if(l==r) return;\\n\\n int mid = (l+r) / 2;\\n\\n cdq(l, mid, a, dp);\\n\\n // compress z\\n set<int> uz; map<int, int> idz;\\n for(int i=l;i<=r;i++) uz.insert(a[i].z);\\n int id = 0;\\n for(auto z: uz) idz[z] = id++;\\n\\n vector<point> tmp;\\n for(int i=l;i<=r;i++){\\n tmp.pb(a[i]);\\n tmp.back().x = 0;\\n tmp.back().z = idz[tmp.back().z];\\n if(i<=mid)\\n tmp.back().left = true;\\n }\\n\\n Segtree st(id);\\n\\n sort(tmp.rbegin(), tmp.rend());\\n\\n for(auto t: tmp){\\n // cout << \\\"tmp = \\\" << t.x << \\\" \\\" << t.y << \\\" \\\" << t.z << \\\" \\\" << t.left << endl;\\n if(t.left){\\n st.update(t.z, dp[t.id]);\\n }else{\\n // cout << \\\"ok\\\\n\\\";\\n dp[t.id] = max(dp[t.id], st.query(0, t.z-1)+1);\\n }\\n }\\n\\n cdq(mid+1, r, a, dp);\\n}\\n\\n\\nint32_t main()\\n{sws;\\n\\n ll m, n;\\n while(cin >> m >> n >> a >> b){\\n if(m==0 and n==0 and a==0 and b==0) break;\\n\\n vector<point> vet(n+m);\\n for(int i=0;i<m;i++){\\n cin >> vet[i].x >> vet[i].y >> vet[i].z;\\n }\\n for(int i=m;i<n+m;i++){\\n vet[i].x = r();\\n vet[i].y = r();\\n vet[i].z = r();\\n }\\n\\n sort(vet.begin(), vet.end());\\n\\n for(int i=0;i<n+m;i++)\\n vet[i].id = i;\\n\\n vi dp(n+m, 1);\\n\\n cdq(0, n+m-1, vet, dp);\\n\\n int ans = 0;\\n for(int i=0;i<n+m;i++)\\n ans = max(ans, dp[i]);\\n\\n\\n // for(int i=0;i<n+m;i++)\\n // cout << dp[i] << \\\" \\\";\\n // cout << endl;\\n\\n cout << ans << endl;\\n \\n }\\n\\n return 0;\\n}\\n\\n// overflow\\n// check border cases\\n// check limits (when initializing the answer too)\\n// check variables names, mod missing\\n// using set as multiset\\n// remember to permute the positions\\n// equal points/collinear points\\n\\n// no ideas?\\n// try bb, dp\\n// invert the problem (calculate total - wrong)\\n// transform it in a graph somehow\\n// naive/brute\\n// when u find a dead end, read the statment again,\\n// to see if u understood the problem right.\",\n \"accuracy\": 1,\n \"time_ms\": 7680,\n \"memory_kb\": 82460,\n \"score_of_the_acc\": -1.4406,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1341_6260185\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define _ ios_base::sync_with_stdio(0);cin.tie(0);\\n#define endl '\\\\n'\\n\\ntypedef long long ll;\\n\\nconst int INF = 0x3f3f3f3f;\\nconst ll LINF = 0x3f3f3f3f3f3f3f3f;\\n\\ntypedef tuple<int, int, int> T;\\n\\nconst int MAX = 3e5 + 10;\\nconst int MAX2 = 1e6 + 10;\\n\\nint seg[2*MAX2];\\nint N = MAX2;\\n\\nint query(int a, int b) {\\n\\tint ret = 0;\\n\\tfor(a += N, b += N; a <= b; ++a /= 2, --b /= 2) {\\n\\t\\tif (a % 2 == 1) ret = max(ret, seg[a]);\\n\\t\\tif (b % 2 == 0) ret = max(ret, seg[b]);\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid update(int p, int x) {\\n\\tp += N;\\n\\tif (x == 0) seg[p] = 0;\\n\\telse seg[p] = max(seg[p], x);\\n\\twhile (p /= 2) seg[p] = max(seg[2*p], seg[2*p+1]);\\n}\\n\\nvoid lis2d(vector<vector<tuple<int, int, int>>>& v, vector<int>& dp, int l, int r) {\\n\\tif (l == r) {\\n\\t\\tfor (int i = 0; i < v[l].size(); i++) {\\n\\t\\t\\tint ii = get<2>(v[l][i]);\\n\\t\\t\\tdp[ii] = max(dp[ii], 1);\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tint m = (l+r)/2;\\n\\tlis2d(v, dp, l, m);\\n\\t\\n\\tvector<tuple<int, int, int>> vv[2];\\n\\tfor (int i = l; i <= r; i++) for (int j = 0; j < v[i].size(); j++)\\n\\t\\tvv[i > m].push_back(v[i][j]);\\n\\tsort(vv[0].begin(), vv[0].end());\\n\\tsort(vv[1].begin(), vv[1].end());\\n\\t\\n\\tint mini = INF, i = 0;\\n\\tfor (auto it : vv[1]) {\\n\\t\\tint y, z, id;\\n\\t\\ttie(y, z, id) = it;\\n\\t\\twhile (i < vv[0].size() and get<0>(vv[0][i]) < y) {\\n\\t\\t\\tint y2, z2, id2;\\n\\t\\t\\ttie(y2, z2, id2) = vv[0][i];\\n\\t\\t\\tmini = min(mini, z2);\\n\\t\\t\\tupdate(z2, dp[id2]);\\t\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\tint q = query(0, z-1);\\n\\t\\tdp[id] = max(dp[id], q + 1);\\n\\t}\\n\\n\\tfor (i = 0; i < vv[0].size(); i++) {\\n\\t\\tint y, z, id;\\n\\t\\ttie(y, z, id) = vv[0][i];\\n\\t\\tupdate(z, 0);\\n\\t}\\n\\tlis2d(v, dp, m+1, r);\\n}\\n\\nvector<int> solve(vector<tuple<int, int, int>> v) {\\n\\tint n = v.size();\\n\\tvector<tuple<int, int, int, int>> vv;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tint x, y, z;\\n\\t\\ttie(x, y, z) = v[i];\\n\\t\\tvv.emplace_back(x, y, z, i);\\n\\t}\\n\\tsort(vv.begin(), vv.end());\\n\\n\\tvector<vector<tuple<int, int, int>>> V;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tint j = i;\\n\\t\\tV.emplace_back();\\n\\t\\twhile (j < n and get<0>(vv[j]) == get<0>(vv[i])) {\\n\\t\\t\\tint x, y, z, id;\\n\\t\\t\\ttie(x, y, z, id) = vv[j++];\\n\\t\\t\\tV.back().emplace_back(y, z, id);\\n\\t\\t}\\n\\t\\ti = j-1;\\n\\t}\\n\\tvector<int> dp(n);\\n\\tlis2d(V, dp, 0, V.size()-1);\\n\\treturn dp;\\n}\\n\\nint main() { _\\n\\tint m, n, A, B;\\n\\twhile (cin >> m >> n >> A >> B) {\\n\\t\\tif (n == 0 and m == 0 and A == 0 and B == 0) return 0;\\n\\t\\t\\n\\t\\tvector<tuple<int, int, int>> v;\\n\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tint x, y, z; cin >> x >> y >> z;\\n\\t\\t\\tv.emplace_back(x, y, z);\\n\\t\\t}\\n\\n\\t\\t{\\n\\t\\t\\tint a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\\n\\t\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\t\\tvector<int> w;\\n\\t\\t\\t\\tfor (int j = 0; j < 3; j++) {\\n\\t\\t\\t\\t\\ta = 36969 * (a & M) + (a >> 16);\\n\\t\\t\\t\\t\\tb = 18000 * (b & M) + (b >> 16);\\n\\t\\t\\t\\t\\tw.push_back((C & ((a << 16) + b)) % 1000000);\\n\\t\\t\\t\\t}\\t\\t\\n\\t\\t\\t\\tv.emplace_back(w[0], w[1], w[2]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tauto dp = solve(v);\\n\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 0; i < n+m; i++) ans = max(ans, dp[i]);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\texit(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3000,\n \"memory_kb\": 51064,\n \"score_of_the_acc\": -0.5673,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1341_6259434\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define _ ios_base::sync_with_stdio(0);cin.tie(0);\\n#define endl '\\\\n'\\n\\ntypedef long long ll;\\n\\nconst int INF = 0x3f3f3f3f;\\nconst ll LINF = 0x3f3f3f3f3f3f3f3f;\\n\\ntypedef tuple<int, int, int> T;\\n\\nconst int MAX = 3e5 + 10;\\nconst int MAX2 = 1e6 + 10;\\n\\nvector<vector<T>> V;\\nint dp[MAX];\\n\\nint seg[2*MAX2];\\nint N = MAX2;\\n\\nint query(int a, int b) {\\n\\tint ret = 0;\\n\\tfor(a += N, b += N; a <= b; ++a /= 2, --b /= 2) {\\n\\t\\tif (a % 2 == 1) ret = max(ret, seg[a]);\\n\\t\\tif (b % 2 == 0) ret = max(ret, seg[b]);\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid update(int p, int x) {\\n\\tp += N;\\n\\tif (x == 0) seg[p] = 0;\\n\\telse seg[p] = max(seg[p], x);\\n\\twhile (p /= 2) seg[p] = max(seg[2*p], seg[2*p+1]);\\n}\\n\\nvoid lis2d(int l, int r) {\\n\\tif (l == r) {\\n\\t\\tfor (int i = 0; i<V[l].size(); i++) {\\n\\t\\t\\tint ii = get<2>(V[l][i]);\\n\\t\\t\\tdp[ii] = max(dp[ii], 1);\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tint m = (l+r)/2;\\n\\tlis2d(l, m);\\n\\t\\n\\tvector<T> v1, v2;\\n\\tfor (int i = l; i <= r; i++) for (int j = 0; j < V[i].size(); j++) { \\n\\t\\tif (i <= m) v1.push_back(V[i][j]);\\n\\t\\telse v2.push_back(V[i][j]);\\n\\t}\\n\\tsort(v1.begin(), v1.end());\\n\\tsort(v2.begin(), v2.end());\\n\\t\\n\\tint mini = INF;\\n\\n\\tint i = 0;\\n\\tfor (auto it : v2) {\\n\\t\\tint y, z, id;\\n\\t\\ttie(y, z, id) = it;\\n\\t\\twhile (i < v1.size() and get<0>(v1[i]) < y) {\\n\\t\\t\\tint y2, z2, id2;\\n\\t\\t\\ttie(y2, z2, id2) = v1[i];\\n\\t\\t\\tmini = min(mini, z2);\\n\\t\\t\\tupdate(z2, dp[id2]);\\t\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\tint q = query(0, z-1);\\n\\t\\tdp[id] = max(dp[id], q + 1);\\n\\t}\\n\\n\\tfor (i = 0; i<v1.size(); i++) {\\n\\t\\tint y, z, id;\\n\\t\\ttie(y, z, id) = v1[i];\\n\\t\\tupdate(z, 0);\\n\\t}\\n\\tlis2d(m+1, r);\\n}\\n\\nint main() { _\\n\\tint m, n, A, B;\\n\\twhile (cin >> m >> n >> A >> B) {\\n\\t\\tif (n == 0 and m == 0 and A == 0 and B == 0) return 0;\\n\\t\\t\\n\\t\\tfor (int i = 0; i<n+m; i++) dp[i] = 0;\\n\\t\\tV.clear();\\n\\t\\tvector<T> v;\\n\\n\\t\\tfor (int i = 0; i<m; i++) {\\n\\t\\t\\tint x, y, z; cin >> x >> y >> z;\\n\\t\\t\\tv.emplace_back(x, y, z);\\n\\t\\t}\\n\\n\\t\\t{\\n\\t\\t\\tint a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\\n\\t\\t\\tfor (int i = 0; i<n; i++) {\\n\\t\\t\\t\\tvector<int> w;\\n\\t\\t\\t\\tfor (int j = 0; j<3; j++) {\\n\\t\\t\\t\\t\\ta = 36969 * (a & M) + (a >> 16);\\n\\t\\t\\t\\t\\tb = 18000 * (b & M) + (b >> 16);\\n\\t\\t\\t\\t\\tw.push_back((C & ((a << 16) + b)) % 1000000);\\n\\t\\t\\t\\t}\\t\\t\\n\\t\\t\\t\\tv.emplace_back(w[0], w[1], w[2]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tsort(v.begin(), v.end());\\n\\n\\t\\tfor (int i = 0; i < n+m; i++) {\\n\\t\\t\\tint j = i;\\n\\t\\t\\tV.emplace_back();\\n\\t\\t\\twhile (j < n+m and get<0>(v[j]) == get<0>(v[i])) {\\n\\t\\t\\t\\tV.back().emplace_back(get<1>(v[j]), get<2>(v[j]), j);\\n\\t\\t\\t\\tj++;\\n\\t\\t\\t}\\n\\t\\t\\ti = j-1;\\n\\t\\t}\\n\\t\\n\\t\\tlis2d(0, V.size()-1);\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 0; i<n+m; i++) ans = max(ans, dp[i]);\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\texit(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2890,\n \"memory_kb\": 40876,\n \"score_of_the_acc\": -0.4854,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1341_6252224\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace::std;\\n\\n// Currently: WA :v\\n\\nconst int C = ~(1 << 31);\\nconst int M = (1 << 16) - 1;\\nconst int N = 300000 + 5;\\n\\nint n;\\nint m;\\nint a;\\nint b;\\nint A;\\nint B;\\nint len;\\nint memo[N];\\nset<pair<int, int>> ft[N];\\n\\nint r(){\\n\\ta = 36969 * (a & M) + (a >> 16);\\n\\tb = 18000 * (b & M) + (b >> 16);\\n\\treturn (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nvoid compress(vector<int> &v){\\n\\tvector<int> values(v.begin(), v.end());\\n\\tsort(values.begin(), values.end());\\n\\tvalues.erase(unique(values.begin(), values.end()), values.end());\\n\\tfor(int i = 0; i < v.size(); i++){\\n\\t\\tv[i] = lower_bound(values.begin(), values.end(), v[i]) - values.begin();\\n\\t}\\n}\\n\\nint get(int at, int val){\\n\\tif(ft[at].empty() or (*ft[at].begin()).first > val) return 0;\\n\\tset<pair<int, int>>::iterator it = ft[at].lower_bound(make_pair(val, -1));\\n\\tif(it == ft[at].end() or (*it).first > val) it--;\\n\\treturn (*it).second;\\n}\\n\\t\\nint query(int y, int z){\\n\\ty++; z++;\\n\\tint res = 0;\\n\\tfor(int j = y; j > 0; j &= j - 1){\\n\\t\\tres = max(res, get(j, z));\\n\\t}\\n\\treturn res;\\n}\\n\\nvoid insert(int at, int pos, int val){\\n\\tif(ft[at].empty()){\\n\\t\\tft[at].emplace(make_pair(pos, val));\\n\\t\\treturn;\\n\\t}\\n\\tset<pair<int, int>>::iterator it = ft[at].lower_bound(make_pair(pos, -1));\\n\\n\\tif(it != ft[at].end() and (*it).first == pos and (*it).second >= val) return;\\n\\tset<pair<int, int>>::iterator leq = it;\\n\\tif(leq != ft[at].begin()) leq--;\\n\\tif((*leq).first < pos and (*leq).second >= val) return;\\n\\tvector<pair<int, int>> to_remove;\\n\\twhile(it != ft[at].end() and (*it).second <= val){\\n\\t\\tto_remove.emplace_back(*it);\\n\\t\\tit++;\\n\\t}\\n\\tfor(auto e : to_remove) ft[at].erase(e);\\n\\tft[at].emplace(make_pair(pos, val));\\n}\\n\\nvoid update(int y, int z, int val){\\n\\ty++; z++;\\n\\tfor(int j = y; j <= len; j += (-j) & j){\\n\\t\\tinsert(j, z, val);\\n\\t}\\n}\\n\\nint solve(vector<int> &x, vector<int> &y, vector<int> &z){\\n\\tvector<int> p(len);\\n\\tiota(p.begin(), p.end(), 0);\\n\\tsort(p.begin(), p.end(), [&] (int i, int j){\\n\\t\\tif(x[i] != x[j]) return x[i] < x[j];\\n\\t\\tif(y[i] != y[j]) return y[i] < y[j];\\n\\t\\tif(z[i] != z[j]) return z[i] < z[j];\\n\\t\\treturn false;\\n\\t});\\n\\tint ans = 0;\\n\\tint l = 0, r = 0;\\n\\twhile(l < len){\\n\\t\\twhile(r < len and x[p[l]] == x[p[r]]) r++;\\n\\t\\tfor(int i = l; i < r; i++){\\n\\t\\t\\tint at = p[i];\\n\\t\\t\\tmemo[i] = 1 + query(y[at] - 1, z[at] - 1);\\n\\t\\t\\tif(ans < memo[i]) ans = memo[i];\\n\\t\\t}\\n\\t\\tfor(int i = l; i < r; i++){\\n\\t\\t\\tint at = p[i];\\n\\t\\t\\tupdate(y[at], z[at], memo[i]);\\n\\t\\t}\\n\\t\\tl = r;\\n\\t}\\n\\treturn ans;\\n}\\n\\nvoid clear(){\\n\\tfor(int i = 0; i <= len; i++){\\n\\t\\tft[i].clear();\\n\\t}\\n}\\n\\nint main(){\\n\\twhile(scanf(\\\"%d %d %d %d\\\", &m, &n, &a, &b) == 4 and m + n){\\n\\t\\tlen = n + m;\\n\\t\\tvector<int> x(len), y(len), z(len);\\n\\t\\tfor(int i = 0; i < m; i++){\\n\\t\\t\\tscanf(\\\"%d %d %d\\\", &x[i], &y[i], &z[i]);\\n\\t\\t}\\n\\t\\tfor(int i = m; i < len; i++){\\n\\t\\t\\tx[i] = r();\\n\\t\\t\\ty[i] = r();\\n\\t\\t\\tz[i] = r();\\n\\t\\t}\\n\\t\\tcompress(x); compress(y); compress(z);\\n\\t\\tprintf(\\\"%d\\\\n\\\", solve(x, y, z));\\n\\t\\tclear();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3730,\n \"memory_kb\": 66916,\n \"score_of_the_acc\": -0.7746,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1341_6044530\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=1000000007,MAX=1005,INF=1<<29;\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n while(1){\\n int N,nn,A,B;cin>>N>>nn>>A>>B;\\n if(N+nn==0) break;\\n vector<vector<int>> S(N);\\n for(int i=0;i<N;i++){\\n S[i].resize(3);\\n for(int j=0;j<3;j++) cin>>S[i][j];\\n }\\n int a = A, b = B, C = ~(1<<31), M = (1<<16)-1;\\n for(int i=0;i<nn;i++){\\n S.push_back({});\\n for(int j=0;j<3;j++){\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n S.back().push_back((C & ((a << 16) + b)) % 1000000);\\n }\\n }\\n \\n sort(all(S),[](auto a,auto b){\\n if(a[0]==b[0]){\\n if(a[1]==b[1]) return a[2]>b[2];\\n else return a[1]>b[1];\\n }else{\\n return a[0]<b[0];\\n }\\n });\\n \\n N=si(S);\\n vector<set<pair<int,int>>> SE(N+1);\\n for(int i=0;i<=N;i++){\\n if(i) SE[i].insert(mp(-INF,INF));\\n else SE[i].insert(mp(-INF,-INF+1));\\n SE[i].insert(mp(INF,-INF));\\n }\\n for(int i=0;i<N;i++){\\n int left=0,right=i+1;\\n pair<int,int> x=mp(S[i][1],S[i][2]);\\n while(right-left>1){\\n int mid=(left+right)/2;\\n auto it=SE[mid].lower_bound(mp(x.fi,-INF));\\n it--;\\n if((*it).se<x.se) left=mid;\\n else right=mid;\\n }\\n int mid=right;\\n auto it=SE[mid].lower_bound(x);\\n it--;\\n bool f=((*it).se>x.se);\\n it++;\\n while(it!=SE[mid].end()){\\n if((*it).se>=x.se){\\n it=SE[mid].erase(it);\\n }else{\\n break;\\n }\\n }\\n if(f) SE[mid].insert(x);\\n }\\n \\n int ans=-1;\\n for(int i=0;i<=N;i++){\\n for(auto a:SE[i]){\\n if(abs(a.fi)<INF) ans=i;\\n }\\n }\\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1940,\n \"memory_kb\": 67864,\n \"score_of_the_acc\": -0.5247,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1341_3904383\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\nusing ll = long long;\\n\\nint a,b;\\n// const int C = ~(1<<31);\\nconst int C = (1<<30) + ((1<<30) - 1);\\nconst int M = (1<<16)-1;\\nint r() {\\n\\ta = 36969 * (a & M) + (a >> 16);\\n\\tb = 18000 * (b & M) + (b >> 16);\\n\\treturn (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nusing pii = pair<int,int>;\\n\\npair<int,pii> points[325252];\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tint n,m;\\n\\t\\tscanf(\\\"%d%d%d%d\\\",&n,&m,&a,&b);\\n\\t\\tif(n+m+a+b==0)break;\\n\\t\\tREP(i,n){\\n\\t\\t\\tint x,y,z;\\n\\t\\t\\tscanf(\\\"%d%d%d\\\",&x,&y,&z);\\n\\t\\t\\tx++; y++; z++;\\n\\t\\t\\tpoints[i] = make_pair(x,pii(y,z));\\n\\t\\t}\\n\\t\\tREP(i,m){\\n\\t\\t\\tint x = r();\\n\\t\\t\\tint y = r();\\n\\t\\t\\tint z = r();\\n\\t\\t\\tx++; y++; z++;\\n\\t\\t\\tpoints[i+n] = make_pair(x,pii(y,z));\\n\\t\\t}\\n\\t\\tn += m;\\n\\t\\tsort(points, points+n, [&](pair<int,pii> a, pair<int,pii> b){\\n\\t\\t\\tif(a.first != b.first)return a.first < b.first;\\n\\t\\t\\treturn a.second > b.second;\\n\\t\\t});\\n\\t\\tconst int N = 1000025;\\n\\t\\tstd::unordered_map<int,std::map<int,int>> bit;\\n\\t\\tauto add = [&](int y, int z, int v){\\n\\t\\t\\tfor(; y<N; y+=y&-y){\\n\\t\\t\\t\\t// add to y\\n\\t\\t\\t\\tif(bit.count(y)==0){\\n\\t\\t\\t\\t\\tbit[y] = std::map<int,int>();\\n\\t\\t\\t\\t\\tbit[y][-1] = -252521;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstd::map<int,int> &mp = bit[y];\\n\\t\\t\\t\\tauto it = mp.upper_bound(z); it--;\\n\\t\\t\\t\\tif(it->second >= v)continue;\\n\\t\\t\\t\\tmp[z] = v;\\n\\t\\t\\t\\tit = mp.upper_bound(z);\\n\\t\\t\\t\\twhile(it != mp.end() && it->second <= v){\\n\\t\\t\\t\\t\\tmp.erase(it++);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tauto query = [&](int y, int z){\\n\\t\\t\\tint ans = 0;\\n\\t\\t\\tfor(; y>0; y-=y&-y){\\n\\t\\t\\t\\t// get from y\\n\\t\\t\\t\\tif(bit.count(y)==0)continue;\\n\\t\\t\\t\\tstd::map<int,int> &mp = bit[y];\\n\\t\\t\\t\\tauto it = mp.upper_bound(z); it--;\\n\\t\\t\\t\\tans = max(ans, it->second);\\n\\t\\t\\t}\\n\\t\\t\\treturn ans;\\n\\t\\t};\\n\\t\\tint ans = 0;\\n\\t\\tREP(i,n){\\n\\t\\t\\tint x = points[i].first;\\n\\t\\t\\tint y = points[i].second.first;\\n\\t\\t\\tint z = points[i].second.second;\\n\\t\\t\\tint v = query(y-1, z-1) + 1;\\n\\t\\t\\tans = max(ans, v);\\n\\t\\t\\tadd(y,z,v);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7480,\n \"memory_kb\": 110408,\n \"score_of_the_acc\": -1.5934,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1341_3743531\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <string>\\n#include <climits>\\n#include <iomanip>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <tuple>\\n#include <iostream>\\n#include <deque>\\n#include <array>\\n#include <set>\\n#include <functional>\\n#include <memory>\\n#include <stack>\\n\\nstruct Point3 {\\n\\tint x, y, z;\\n};\\nstruct Point2 {\\n\\tint x, y;\\n\\tbool operator<(const Point2 other) const { return x < other.x; }\\n};\\nclass NonChainablePoints {\\n\\tstd::set<Point2> set;\\npublic:\\n\\tNonChainablePoints() {};\\n\\tbool can_chain(const Point2& point) const {\\n\\t\\tauto hint = set.lower_bound(point);\\n\\t\\treturn hint != set.begin() && (--hint)->y < point.y;\\n\\t}\\n\\tvoid insert(const Point2& point) {\\n\\t\\tauto hint = set.lower_bound(point);\\n\\t\\tif (hint == set.end() || hint->x != point.x || hint->y >= point.y) {\\n\\t\\t\\twhile (hint != set.end() && hint->y >= point.y) hint = set.erase(hint);\\n\\t\\t\\tset.insert(point);\\n\\t\\t}\\n\\t}\\n\\tbool is_empty() const { return set.empty(); }\\n\\tbool is_not_empty() const { return !is_empty(); }\\n};\\nint r(int& a, int& b) {\\n\\tconstexpr int C = ~(1 << 31);\\n\\tconstexpr int M = (1 << 16) - 1;\\n\\ta = 36969 * (a & M) + (a >> 16);\\n\\tb = 18000 * (b & M) + (b >> 16);\\n\\treturn (C & ((a << 16) + b)) % 1000000;\\n}\\nvoid append_points(std::vector<Point3>& points, int a, int b, const int n) {\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tPoint3 p;\\n\\t\\tp.x = r(a, b);\\n\\t\\tp.y = r(a, b);\\n\\t\\tp.z = r(a, b);\\n\\t\\tpoints.push_back(p);\\n\\t}\\n}\\nint solve(const int m, const int n, const int a, const int b) {\\n\\tstd::vector<Point3> points(m);\\n\\tfor (auto& p : points) std::cin >> p.x >> p.y >> p.z;\\n\\tappend_points(points, a, b, n);\\n\\tstd::sort(points.begin(), points.end(), [](const Point3& a, const Point3& b) {return (a.z == b.z) ? a.x > b.x : a.z < b.z; });\\n\\tstd::vector<NonChainablePoints> sets(m + n);\\n\\tfor (const auto point : points) {\\n\\t\\tconst Point2 p{ point.x, point.y };\\n\\t\\tauto left = 0;\\n\\t\\tauto right = sets.size();\\n\\t\\twhile (left < right) {\\n\\t\\t\\tauto mid = (left + right) / 2;\\n\\t\\t\\tif (sets[mid].can_chain(p)) left = mid + 1;\\n\\t\\t\\telse right = mid;\\n\\t\\t}\\n\\t\\tsets[right].insert(p);\\n\\t}\\n\\tfor (auto i = 0; i < sets.size(); ++i) {\\n\\t\\tif (sets[i].is_empty()) return i;\\n\\t}\\n\\treturn sets.size();\\n}\\nint main() {\\n\\tstd::vector<int>result;\\n\\twhile (true) {\\n\\t\\tint m, n, a, b;\\n\\t\\tstd::cin >> m >> n >> a >> b;\\n\\t\\tif (m == 0 && n == 0) break;\\n\\t\\tresult.push_back(solve(m, n, a, b));\\n\\t}\\n\\tfor (const auto r : result) std::cout << r << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 26876,\n \"score_of_the_acc\": -0.1184,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1341_3659947\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint a, b;\\nconstexpr int C = ~(1 << 31);\\nconstexpr int M = (1 << 16) - 1;\\n\\nint r() {\\n a = 36969 * (a & M) + (a >> 16);\\n b = 18000 * (b & M) + (b >> 16);\\n return (C & ((a << 16) + b)) % 1000000;\\n}\\n\\nstruct point {\\n int y, z;\\n\\n point(int y_, int z_) : y(y_), z(z_) {}\\n bool operator<(point const& p) const {\\n return y < p.y;\\n }\\n};\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(0);\\n\\n int m, n;\\n while(cin >> m >> n >> a >> b, n + m) {\\n vector<tuple<int, int, int>> ps(n + m);\\n for(int i = 0; i < m; ++i) {\\n int x, y, z; cin >> x >> y >> z;\\n ps[i] = make_tuple(x, -y, -z);\\n }\\n for(int i = m; i < n + m; ++i) {\\n const int x = r(), y = r(), z = r();\\n ps[i] = make_tuple(x, -y, -z);\\n }\\n sort(begin(ps), end(ps));\\n vector<point> ps2;\\n for(int i = 0; i < n + m; ++i) {\\n ps2.emplace_back(-get<1>(ps[i]), -get<2>(ps[i]));\\n }\\n\\n int ans = 0;\\n vector<set<point>> dp(n + m + 1);\\n dp[0].emplace(0, 0);\\n for(auto const& p : ps2) {\\n auto check = [&] (int i) {\\n auto it = dp[i].lower_bound(p);\\n if(it == dp[i].begin()) return false;\\n it = prev(it);\\n return p.y > it->y && p.z > it->z;\\n };\\n int lb = 0, ub = n + m;\\n while(ub - lb > 1) {\\n const int mid = (ub + lb) >> 1;\\n (check(mid) ? lb : ub) = mid;\\n }\\n auto it = dp[ub].lower_bound(p);\\n while(it != dp[ub].end() && it->z >= p.z) {\\n it = dp[ub].erase(it);\\n }\\n if(it == dp[ub].begin() || prev(it)->z > p.z) {\\n dp[ub].insert(p);\\n }\\n ans = max(ans, ub);\\n }\\n\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 27212,\n \"score_of_the_acc\": -0.0906,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":797,"cells":{"group_id":{"kind":"string","value":"aoj_1343_cpp"},"problem_description":{"kind":"string","value":"Problem I:\nHidden Tree\nConsider a binary tree whose leaves are assigned integer weights. Such a tree is called\nbalanced\nif, for every non-leaf node, the sum of the weights in its left subtree is equal to that in the right subtree. For instance, the tree in the following figure is balanced.\nFigure I.1. A balanced tree\nA balanced tree is said to be hidden in a sequence\nA\n, if the integers obtained by listing the weights of all leaves of the tree from left to right form a subsequence of\nA\n. Here, a subsequence is a sequence that can be derived by deleting zero or more elements from the original sequence without changing the order of the remaining elements.\nFor instance, the balanced tree in the figure above is hidden in the sequence 3 4 1 3 1 2 4 4 6, because 4 1 1 2 4 4 is a subsequence of it.\nNow, your task is to find, in a given sequence of integers, the balanced tree with the largest number of leaves hidden in it. In fact, the tree shown in Figure I.1 has the largest number of leaves among the balanced trees hidden in the sequence mentioned above.\nInput\nThe input consists of multiple datasets. Each dataset represents a sequence\nA\nof integers in the format\nN\nA\n1\nA\n2\n. . .\nA\nN\nwhere 1 ≤\nN\n≤ 1000 and 1 ≤\nA\ni\n≤ 500 for 1 ≤\ni\n≤\nN\n.\nN\nis the length of the input sequence, and\nA\ni\nis the\ni\n-th element of the sequence.\nThe input ends with a line consisting of a single zero. The number of datasets does not exceed 50.\nOutput\nFor each dataset, find the balanced tree with the largest number of leaves among those hidden in\nA\n, and output, in a line, the number of its leaves.\nSample Input\n9\n3 4 1 3 1 2 4 4 6\n4\n3 12 6 3\n10\n10 9 8 7 6 5 4 3 2 1\n11\n10 9 8 7 6 5 4 3 2 1 1\n8\n1 1 1 1 1 1 1 1\n0\nOutput for the Sample Input\n6\n2\n1\n5\n8"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1343_10853732","code_snippet":"#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define MAXN 1010\nconst int mt = 131072;\nint a[MAXN], b[MAXN], len[MAXN], f[mt + 10], N, M;\nint process() {\n\tmemset(f, -1, sizeof(f));\n\tf[0] = 0;\n\tfor(int i = 0; i < N; i ++) {\n\t\tint l = len[i];\n\t\tif(l > 0) {\n\t\t\tfor(int j = mt; j > 0; j -= l) {\n\t\t\t\tif(f[j - l] > -1 && f[j - l] + 1 > f[j]) {\n\t\t\t\t\tf[j] = f[j - l] + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor(int i = mt; i > 0; i >>= 1) {\n\t\tif(f[i] != -1) {\n\t\t\tans = std::max(ans, f[i]);\n\t\t}\n\t}\n\treturn ans;\n}\nint main() {\n\t//freopen(\"test.in\", \"rb\", stdin);\n\twhile(scanf(\"%d\", &N), N) {\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tscanf(\"%d\", &a[i]);\n\t\t\tb[i] = a[i];\n\t\t}\n\t\tstd::sort(b, b + N);\n\t\tM = std::unique(b, b + N) - b;\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < M; i ++) {\n\t\t\tint v = b[i];\n\t\t\tfor(int j = 0; j < N; j ++) {\n\t\t\t\tlen[j] = 0;\n\t\t\t\tint x = a[j];\n\t\t\t\tif(x % v == 0) {\n\t\t\t\t\tx /= v;\n\t\t\t\t\tint l = 1;\n\t\t\t\t\twhile((x & 1) == 0) {\n\t\t\t\t\t\tx >>= 1, l <<= 1;\n\t\t\t\t\t}\n\t\t\t\t\tif(x == 1) {\n\t\t\t\t\t\tlen[j] = l;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = std::max(ans, process());\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":3390,"memory_kb":3512,"score_of_the_acc":-0.4723,"final_rank":10},{"submission_id":"aoj_1343_10352657","code_snippet":"#ifndef LOCAL\n#pragma GCC optimize (\"Ofast\")\n#pragma GCC optimize (\"unroll-loops\")\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\nbool dbg=false;\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#define si(x) int(x.size())\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\ntemplate<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\nusing vvi=vc<vc<int>>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\n#define mp make_pair\n#define mt make_tuple\n#define one(x) memset(x,-1,sizeof(x))\n#define zero(x) memset(x,0,sizeof(x))\n#ifdef LOCAL\nvoid dmpr(ostream&os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" \";\n\tdmpr(os,args...);\n}\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\n#else\n#define dmp2(...) void(0)\n#endif\n\nusing uint=unsigned;\nusing ull=unsigned long long;\n\ntemplate<class t,size_t n>\nostream& operator<<(ostream&os,const array<t,n>&a){\n\treturn os<<vc<t>(all(a));\n}\n\nll rand_int(ll l, ll r) { //[l, r]\n\t//#ifdef LOCAL\n\tstatic mt19937_64 gen;\n\t/*#else\n\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n\t#endif*/\n\treturn uniform_int_distribution<ll>(l, r)(gen);\n}\n\nll rand_int(ll k){ //[0,k)\n\treturn rand_int(0,k-1);\n}\nstring rand_string(int n,char lw,char up){\n\tstring s(n,'?');\n\trep(i,n)s[i]=rand_int(lw,up);\n\treturn s;\n}\n\nint current_run_id,run_batch_size=1000;\nint calc_random_limit(){\n\treturn current_run_id/run_batch_size+1;\n}\ntemplate<class t>\nvoid generate_single(t&a){\n\ta=rand_int(1,calc_random_limit());\n}\nvoid generate_single(string&a){\n\tint n;generate_single(n);\n\ta=rand_string(n,'a','b');\n}\ntemplate<class t,class u>\nvoid generate_single(pair<t,u>&a){\n\tgenerate_single(a.a);\n\tgenerate_single(a.b);\n}\n//https://trap.jp/post/1224/\ntemplate<class... Args>\nvoid input(Args&... a){\n\tif(dbg){\n\t\t(generate_single(a),...);\n\t}else{\n\t\t#ifdef USE_FAST_IO\n\t\tsc.read(a...);\n\t\t#else\n\t\t(cin >> ... >> a);\n\t\t#endif\n\t}\n}\n#define INT(...) int __VA_ARGS__;input(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;input(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;input(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;input(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;input(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;input(__VA_ARGS__)\n#define overload3(a,b,c,d,...) d\n#define VI2(name,size) vi name(size);rep(i_##name,size)input(name[i_##name]);\n#define VI3(name,size,offset) vi name(size);rep(i_##name,size)input(name[i_##name]),name[i_##name]+=offset;\n#define VI(...) overload3(__VA_ARGS__,VI3,VI2)(__VA_ARGS__)\n#define VPI(name,size) vc<pi> name(size);rep(i_##name,size)input(name[i_##name].a,name[i_##name].b);\n#define VVI(name,sizeN,sizeM) vvi name(sizeN,vi(sizeM));\\\nrep(i_##name,sizeN)rep(j_##name,sizeM)input(name[i_##name][j_##name]);\n#define VS(name,size) vc<string> name(size);rep(i_##name,size)input(name[i_##name]);\n#define VMI(name,size) vc<mint> name(size);rep(i_##name,size){INT(tmp_##name);name[i_##name]=tmp_##name;};\n\n#define overload5(a,b,c,d,e,f,...) f\n#define VVC4(type,name,sizeN,sizeM) vvc<type> name(sizeN,vc<type>(sizeM));\n#define VVC5(type,name,sizeN,sizeM,ini) vvc<type> name(sizeN,vc<type>(sizeM,ini));\n#define VVC(...) overload5(__VA_ARGS__,VVC5,VVC4)(__VA_ARGS__)\n\ntemplate<class T>\nT vvvc(T v){\n\treturn v;\n}\n\ntemplate<class T,class...Args>\nauto vvvc(int n,T v,Args...args){\n\treturn vector(n,vvvc(v,args...));\n}\n\ntemplate<int i,class T>\nvoid print_tuple(ostream&,const T&){\n}\n\ntemplate<int i,class T,class H,class ...Args>\nvoid print_tuple(ostream&os,const T&t){\n\tif(i)os<<\",\";\n\tos<<get<i>(t);\n\tprint_tuple<i+1,T,Args...>(os,t);\n}\n\ntemplate<class ...Args>\nostream& operator<<(ostream&os,const tuple<Args...>&t){\n\tos<<\"{\";\n\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\n\treturn os<<\"}\";\n}\n\nvoid printsuc(int suc){\n\t#ifdef USE_FAST_IO\n\t\tif(suc==1)pr.write('\\n');\n\t\tif(suc==2)pr.write(' ');\n\t#else\n\t\tif(suc==1){\n\t\t\tif(dbg)cout<<endl;\n\t\t\telse{\n\t\t\t\t#ifdef LOCAL\n\t\t\t\tcout<<endl;\n\t\t\t\t#else\n\t\t\t\tcout<<\"\\n\";\n\t\t\t\t#endif\n\t\t\t}\n\t\t}\n\t\tif(suc==2)\n\t\t\tcout<<\" \";\n\t#endif\n}\n\ntemplate<class t>\nvoid print_single(t x,int suc=1){\n\t#ifdef USE_FAST_IO\n\tpr.write(x);\n\t#else\n\tcout<<x;\n\t#endif\n\tprintsuc(suc);\n}\n\ntemplate<class t,class u>\nvoid print_single(const pair<t,u>&p,int suc=1){\n\tprint_single(p.a,2);\n\tprint_single(p.b,suc);\n}\n\ntemplate<class T>\nvoid print_single(const vector<T>&v,int suc=1){\n\trep(i,v.size())\n\t\tprint_single(v[i],i==int(v.size())-1?3:2);\n\tprintsuc(suc);\n}\n\ntemplate<class T,size_t N>\nvoid print_single(const array<T,N>&v,int suc=1){\n\trep(i,N)\n\t\tprint_single(v[i],i==int(N)-1?3:2);\n\tprintsuc(suc);\n}\n\ntemplate<class T>\nvoid print(const T&t){\n\tprint_single(t);\n}\n\ntemplate<class T,class ...Args>\nvoid print(const T&t,const Args&...args){\n\tprint_single(t,2);\n\tprint(args...);\n}\n\ntemplate<class T>\nvoid printvv(const vvc<T>&vs){\n\tfor(const auto&row:vs)print(row);\n}\n\nstring readString(){\n\tstring s;\n\tcin>>s;\n\treturn s;\n}\n\ntemplate<class T>\nT sq(const T& t){\n\treturn t*t;\n}\n\nvoid YES(bool ex=true){\n\tcout<<\"YES\\n\";\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid NO(bool ex=true){\n\tcout<<\"NO\\n\";\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid Yes(bool ex=true){\n\tcout<<\"Yes\\n\";\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid No(bool ex=true){\n\tcout<<\"No\\n\";\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\n//#define CAPITAL\n/*\nvoid yes(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"YES\"<<\"\\n\";\n\t#else\n\tcout<<\"Yes\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid no(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"NO\"<<\"\\n\";\n\t#else\n\tcout<<\"No\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}*/\nvoid possible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"POSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Possible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\nvoid impossible(bool ex=true){\n\t#ifdef CAPITAL\n\tcout<<\"IMPOSSIBLE\"<<\"\\n\";\n\t#else\n\tcout<<\"Impossible\"<<\"\\n\";\n\t#endif\n\tif(ex)exit(0);\n\t#ifdef LOCAL\n\tcout.flush();\n\t#endif\n}\n\nconstexpr ll ten(int n){\n\treturn n==0?1:ten(n-1)*10;\n}\n\nconst ll infLL=LLONG_MAX/3;\n\n#ifdef int\nconst int inf=infLL;\n#else\nconst int inf=INT_MAX/2-100;\n#endif\n\nint topbit(signed t){\n\treturn t==0?-1:31-__builtin_clz(t);\n}\nint topbit(ll t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint topbit(ull t){\n\treturn t==0?-1:63-__builtin_clzll(t);\n}\nint botbit(signed a){\n\treturn a==0?32:__builtin_ctz(a);\n}\nint botbit(ll a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint botbit(ull a){\n\treturn a==0?64:__builtin_ctzll(a);\n}\nint popcount(signed t){\n\treturn __builtin_popcount(t);\n}\nint popcount(ll t){\n\treturn __builtin_popcountll(t);\n}\nint popcount(ull t){\n\treturn __builtin_popcountll(t);\n}\nint bitparity(ll t){\n\treturn __builtin_parityll(t);\n}\nbool ispow2(int i){\n\treturn i&&(i&-i)==i;\n}\nll mask(int i){\n\treturn (ll(1)<<i)-1;\n}\null umask(int i){\n\treturn (ull(1)<<i)-1;\n}\nll minp2(ll n){\n\tif(n<=1)return 1;\n\telse return ll(1)<<(topbit(n-1)+1);\n}\n\nbool inc(int a,int b,int c){\n\treturn a<=b&&b<=c;\n}\n\ntemplate<class S> void mkuni(S&v){\n\tsort(all(v));\n\tv.erase(unique(all(v)),v.ed);\n}\n\ntemplate<class t> bool isuni(vc<t> v){\n\tint s=si(v);\n\tmkuni(v);\n\treturn si(v)==s;\n}\n\nbool isperm(const vi&p){\n\tint n=si(p);\n\tvc<bool> used(n);\n\tfor(auto v:p){\n\t\tif(!inc(0,v,n-1))return false;\n\t\tif(used[v])return false;\n\t\tused[v]=true;\n\t}\n\treturn true;\n}\n\ntemplate<class t>\nvoid myshuffle(vc<t>&a){\n\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\n}\n\ntemplate<class S,class u>\nint lwb(const S&v,const u&a){\n\treturn lower_bound(all(v),a)-v.bg;\n}\ntemplate<class t,class u>\nbool bis(const vc<t>&v,const u&a){\n\treturn binary_search(all(v),a);\n}\n\n//VERIFY: yosupo\n//KUPC2017J\n//AOJDSL1A\n//without rank\nstruct unionfind{\n\tvi p,s;\n\tint c;\n\tunionfind(int n):p(n,-1),s(n,1),c(n){}\n\tvoid clear(){\n\t\tfill(all(p),-1);\n\t\tfill(all(s),1);\n\t\tc=si(p);\n\t}\n\tint find(int a){\n\t\treturn p[a]==-1?a:(p[a]=find(p[a]));\n\t}\n\t//set b to a child of a\n\tbool unite(int a,int b){\n\t\ta=find(a);\n\t\tb=find(b);\n\t\tif(a==b)return false;\n\t\tp[b]=a;\n\t\ts[a]+=s[b];\n\t\tc--;\n\t\treturn true;\n\t}\n\tbool same(int a,int b){\n\t\treturn find(a)==find(b);\n\t}\n\tint sz(int a){\n\t\treturn s[find(a)];\n\t}\n};\n\nvvc<int> readGraph(int n,int m){\n\tvvc<int> g(n);\n\trep(i,m){\n\t\tint a,b;\n\t\tcin>>a>>b;\n\t\t//sc.read(a,b);\n\t\ta--;b--;\n\t\tg[a].pb(b);\n\t\tg[b].pb(a);\n\t}\n\treturn g;\n}\n\nvvc<int> initUG(int n,const vc<pi>&es){\n\tvvc<int> g(n);\n\tfor(auto [a,b]:es){\n\t\tg[a].pb(b);\n\t\tg[b].pb(a);\n\t}\n\treturn g;\n}\n\nvvc<int> rand_tree(int n){\n\tvvc<int> t(n);\n\tunionfind uf(n);\n\twhile(uf.c>1){\n\t\tint a=rand_int(n);\n\t\tint b=rand_int(n);\n\t\tif(uf.unite(a,b)){\n\t\t\tt[a].pb(b);\n\t\t\tt[b].pb(a);\n\t\t}\n\t}\n\treturn t;\n}\n\nvvc<int> readTree(int n){\n\tif(dbg){\n\t\treturn rand_tree(n);\n\t}else{\n\t\treturn readGraph(n,n-1);\n\t}\n}\n\nvi readRooted(int n){\n\tassert(!dbg);\n\tvi par(n,-1);\n\trng(i,1,n){\n\t\tinput(par[i]);\n\t\tpar[i]--;\n\t\tassert(inc(0,par[i],i-1));\n\t}\n\treturn par;\n}\n\nvoid printTree(const vvc<int> t){\n\tint n=si(t);\n\tint degsum=0;\n\trep(i,n)degsum+=si(t[i]);\n\tif(degsum==n-1){\n\t\t//directed\n\t\trep(i,si(t))for(auto j:t[i]){\n\t\t\tprint(i+1,j+1);\n\t\t}\n\t}else if(degsum==2*(n-1)){\n\t\t//undirected\n\t\trep(i,si(t))for(auto j:t[i])if(i<j){\n\t\t\tprint(i+1,j+1);\n\t\t}\n\t}else{\n\t\tassert(false);\n\t}\n}\n\ntemplate<class t>\nvc<t> presum(const vc<t>&a){\n\tvc<t> s(si(a)+1);\n\trep(i,si(a))s[i+1]=s[i]+a[i];\n\treturn s;\n}\nvc<ll> presum(const vi&a){\n\tvc<ll> s(si(a)+1);\n\trep(i,si(a))s[i+1]=s[i]+a[i];\n\treturn s;\n}\n//BIT で数列を管理するときに使う (CF850C)\ntemplate<class t>\nvc<t> predif(vc<t> a){\n\tgnr(i,1,si(a))a[i]-=a[i-1];\n\treturn a;\n}\ntemplate<class t>\nvvc<ll> imos(const vvc<t>&a){\n\tint n=si(a),m=si(a[0]);\n\tvvc<ll> b(n+1,vc<ll>(m+1));\n\trep(i,n)rep(j,m)\n\t\tb[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];\n\treturn b;\n}\n\n//verify してないや\nvoid transvvc(int&n,int&m){\n\tswap(n,m);\n}\ntemplate<class t,class... Args>\nvoid transvvc(int&n,int&m,vvc<t>&a,Args&...args){\n\tassert(si(a)==n);\n\tvvc<t> b(m,vi(n));\n\trep(i,n){\n\t\tassert(si(a[i])==m);\n\t\trep(j,m)b[j][i]=a[i][j];\n\t}\n\ta.swap(b);\n\ttransvvc(n,m,args...);\n}\n//CF854E\nvoid rotvvc(int&n,int&m){\n\tswap(n,m);\n}\ntemplate<class t,class... Args>\nvoid rotvvc(int&n,int&m,vvc<t>&a,Args&...args){\n\tassert(si(a)==n);\n\tvvc<t> b(m,vi(n));\n\trep(i,n){\n\t\tassert(si(a[i])==m);\n\t\trep(j,m)b[m-1-j][i]=a[i][j];\n\t}\n\ta.swap(b);\n\trotvvc(n,m,args...);\n}\n\n//ソートして i 番目が idx[i]\n//CF850C\ntemplate<class t>\nvi sortidx(const vc<t>&a){\n\tint n=si(a);\n\tvi idx(n);iota(all(idx),0);\n\tsort(all(idx),[&](int i,int j){return a[i]<a[j];});\n\treturn idx;\n}\n//vs[i]=a[idx[i]]\n//例えば sortidx で得た idx を使えば単にソート列になって返ってくる\n//CF850C\ntemplate<class t>\nvc<t> a_idx(const vc<t>&a,const vi&idx){\n\tint n=si(a);\n\tassert(si(idx)==n);\n\tvc<t> vs(n);\n\trep(i,n)vs[i]=a[idx[i]];\n\treturn vs;\n}\n//CF850C\nvi invperm(const vi&p){\n\tint n=si(p);\n\tvi q(n);\n\trep(i,n)q[p[i]]=i;\n\treturn q;\n}\n\ntemplate<class t,class s=t>\ns SUM(const vc<t>&a){\n\treturn accumulate(all(a),s(0));\n}\ntemplate<class t,size_t K,class s=t>\ns SUM(const array<t,K>&a){\n\treturn accumulate(all(a),s(0));\n}\n\ntemplate<class t>\nt MAX(const vc<t>&a){\n\treturn *max_element(all(a));\n}\n\ntemplate<class t>\npair<t,int> MAXi(const vc<t>&a){\n\tauto itr=max_element(all(a));\n\treturn mp(*itr,itr-a.bg);\n}\n\ntemplate<class A>\nauto MIN(const A&a){\n\treturn *min_element(all(a));\n}\n\ntemplate<class t>\npair<t,int> MINi(const vc<t>&a){\n\tauto itr=min_element(all(a));\n\treturn mp(*itr,itr-a.bg);\n}\n\nvi vid(int n){\n\tvi res(n);iota(all(res),0);\n\treturn res;\n}\n\ntemplate<class S>\nvoid soin(S&s){\n\tsort(all(s));\n}\n\ntemplate<class S,class F>\nvoid soin(S&s,F&&f){\n\tsort(all(s),forward<F>(f));\n}\n\ntemplate<class S>\nS soout(S s){\n\tsoin(s);\n\treturn s;\n}\n\ntemplate<class S>\nvoid rein(S&s){\n\treverse(all(s));\n}\n\ntemplate<class S>\nS reout(S s){\n\trein(s);\n\treturn s;\n}\n\ntemplate<class t,class u>\npair<t,u>&operator+=(pair<t,u>&a,pair<t,u> b){\n\ta.a+=b.a;a.b+=b.b;return a;}\ntemplate<class t,class u>\npair<t,u>&operator-=(pair<t,u>&a,pair<t,u> b){\n\ta.a-=b.a;a.b-=b.b;return a;}\ntemplate<class t,class u>\npair<t,u> operator+(pair<t,u> a,pair<t,u> b){return mp(a.a+b.a,a.b+b.b);}\ntemplate<class t,class u>\npair<t,u> operator-(pair<t,u> a,pair<t,u> b){return mp(a.a-b.a,a.b-b.b);}\ntemplate<class t,class u,class v>\npair<t,u>&operator*=(pair<t,u>&a,v b){\n\ta.a*=b;a.b*=b;return a;}\ntemplate<class t,class u,class v>\npair<t,u> operator*(pair<t,u> a,v b){return a*=b;}\ntemplate<class t,class u>\npair<t,u> operator-(pair<t,u> a){return mp(-a.a,-a.b);}\nnamespace std{\ntemplate<class t,class u>\nistream&operator>>(istream&is,pair<t,u>&a){\n\treturn is>>a.a>>a.b;\n}\n}\n\ntemplate<class t,size_t n>\narray<t,n>&operator+=(array<t,n>&a,const array<t,n>&b){\n\trep(i,n)a[i]+=b[i];\n\treturn a;\n}\ntemplate<class t,size_t n>\narray<t,n>&operator-=(array<t,n>&a,const array<t,n>&b){\n\trep(i,n)a[i]-=b[i];\n\treturn a;\n}\ntemplate<class t,size_t n,class v>\narray<t,n>&operator*=(array<t,n>&a,v b){\n\trep(i,n)a[i]*=b;\n\treturn a;\n}\ntemplate<class t,size_t n>\narray<t,n> operator+(array<t,n> a,const array<t,n>&b){return a+=b;}\ntemplate<class t,size_t n>\narray<t,n> operator-(array<t,n> a,const array<t,n>&b){return a-=b;}\ntemplate<class t,size_t n,class v>\narray<t,n> operator*(array<t,n> a,v b){return a*=b;}\n\ntemplate<class t>\nt gpp(vc<t>&vs){\n\tassert(si(vs));\n\tt res=move(vs.back());\n\tvs.pop_back();\n\treturn res;\n}\n\ntemplate<class t,class u>\nvoid pb(vc<t>&a,const vc<u>&b){\n\ta.insert(a.ed,all(b));\n}\n\ntemplate<class t,class...Args>\nvc<t> cat(vc<t> a,Args&&...b){\n\t(pb(a,forward<Args>(b)),...);\n\treturn a;\n}\n\ntemplate<class t,class u>\nvc<t>& operator+=(vc<t>&a,u x){\n\tfor(auto&v:a)v+=x;\n\treturn a;\n}\n\ntemplate<class t,class u>\nvc<t> operator+(vc<t> a,u x){\n\treturn a+=x;\n}\n\ntemplate<class t>\nvc<t>& operator+=(vc<t>&a,const vc<t>&b){\n\ta.resize(max(si(a),si(b)));\n\trep(i,si(b))a[i]+=b[i];\n\treturn a;\n}\n\ntemplate<class t>\nvc<t> operator+(const vc<t>&a,const vc<t>&b){\n\tvc<t> c(max(si(a),si(b)));\n\trep(i,si(a))c[i]+=a[i];\n\trep(i,si(b))c[i]+=b[i];\n\treturn c;\n}\n\ntemplate<class t,class u>\nvc<t>& operator-=(vc<t>&a,u x){\n\tfor(auto&v:a)v-=x;\n\treturn a;\n}\ntemplate<class t,class u>\nvc<t> operator-(vc<t> a,u x){\n\treturn a-=x;\n}\ntemplate<class t>\nvc<t>& operator-=(vc<t>&a,const vc<t>&b){\n\ta.resize(max(si(a),si(b)));\n\trep(i,si(b))a[i]-=b[i];\n\treturn a;\n}\n/*\ntemplate<class t>\nvc<t> operator-(const vc<t>&a,const vc<t>&b){\n\tvc<t> c(max(si(a),si(b)));\n\trep(i,si(a))c[i]+=a[i];\n\trep(i,si(b))c[i]-=b[i];\n\treturn c;\n}\n*/\ntemplate<class t,class u>\nvc<t>& operator*=(vc<t>&a,u x){\n\tfor(auto&v:a)v*=x;\n\treturn a;\n}\ntemplate<class t,class u>\nvc<t> operator*(vc<t> a,u x){\n\treturn a*=x;\n}\n\ntemplate<class t,class u>\nvc<t>& operator/=(vc<t>&a,u x){\n\tfor(auto&v:a)v/=x;\n\treturn a;\n}\ntemplate<class t,class u>\nvc<t> operator/(vc<t> a,u x){\n\treturn a/=x;\n}\n\ntemplate<class t>\nvc<t>& operator<<=(vc<t>&a,int k){\n\tassert(k>=0);\n\ta.insert(a.bg,k,t(0));\n\treturn a;\n}\ntemplate<class t>\nvc<t> operator<<(vc<t> a,int k){\n\treturn a<<=k;\n}\n\ntemplate<class t>\nvc<t>& operator>>=(vc<t>&a,int k){\n\tif(si(a)<=k)a.clear();\n\telse a.erase(a.bg,a.bg+k);\n\treturn a;\n}\ntemplate<class t>\nvc<t> operator>>(vc<t> a,int k){\n\treturn a>>=k;\n}\n\n//消した要素の個数を返してくれる\n//not verified\ntemplate<class t,class u>\nint remval(vc<t>&a,const u&v){\n\tauto itr=remove(all(a),v);\n\tint res=a.ed-itr;\n\ta.erase(itr,a.ed);\n\treturn res;\n}\n//消した要素の個数を返してくれる\n//UCUP 2-8-F\ntemplate<class t,class F>\nint remif(vc<t>&a,F f){\n\tauto itr=remove_if(all(a),f);\n\tint res=a.ed-itr;\n\ta.erase(itr,a.ed);\n\treturn res;\n}\ntemplate<class t>\nvoid rempos(vc<t>&a,int i){\n\tassert(inc(0,i,si(a)-1));\n\ta.erase(a.bg+i);\n}\n\ntemplate<class VS,class u>\nvoid fila(VS&vs,const u&a){\n\tfill(all(vs),a);\n}\n\ntemplate<class t,class u>\nint findid(const vc<t>&vs,const u&a){\n\tauto itr=find(all(vs),a);\n\tif(itr==vs.ed)return -1;\n\telse return itr-vs.bg;\n}\n\ntemplate<class t>\nvoid rtt(vc<t>&vs,int i){\n\trotate(vs.bg,vs.bg+i,vs.ed);\n}\n\n//Multiuni2023-8 C\n//f(lw)=false,...,f(n-1)=false,f(n)=true,...,f(up)=true,\n//のときに n を返す\ntemplate<class F>\nint find_min_true(int lw,int up,F f){\n\twhile(up-lw>1){\n\t\tconst int mid=(lw+up)/2;\n\t\tif(f(mid))up=mid;\n\t\telse lw=mid;\n\t}\n\treturn up;\n}\n//f(lw)=true,f(up)=false\ntemplate<class F>\nint find_max_true(int lw,int up,F f){\n\twhile(up-lw>1){\n\t\tconst int mid=(lw+up)/2;\n\t\tif(f(mid))lw=mid;\n\t\telse up=mid;\n\t}\n\treturn lw;\n}\n\ntemplate<class t> using pqmin=priority_queue<t,vc<t>,greater<t>>;\ntemplate<class t> using pqmax=priority_queue<t>;\nusing T=tuple<int,int,int>;\n\nint sub(vi a){\n\tint n=si(a);\n\tint s=0;\n\trep(i,n)s+=1<<a[i];\n\tvi dp(s+1,-inf);\n\tdp[0]=0;\n\trep(i,n){\n\t\tper(v,s+1)if(dp[v]>=0){\n\t\t\tif((v&mask(a[i]))==0){\n\t\t\t\tchmax(dp[v+(1<<a[i])],dp[v]+1);\n\t\t\t}\n\t\t}\n\t}\n\tint res=0;\n\trng(v,1,s+1)if(ispow2(v))chmax(res,dp[v]);\n\treturn res;\n}\n\nvoid slv(){\n\tINT(n);\n\tif(n==0)exit(0);\n\tVI(a,n);\n\tmap<int,vi> buf;\n\trep(i,n){\n\t\tint t=botbit(a[i]);\n\t\tbuf[a[i]>>t].pb(t);\n\t}\n\tint ans=0;\n\tfor(auto [key,val]:buf)\n\t\tchmax(ans,sub(val));\n\tprint(ans);\n}\n\nsigned main(signed argc,char*argv[]){\n\tif(argc>1&&strcmp(argv[1],\"D\")==0)dbg=true;\n\t\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\t\n\tif(dbg){\n\t\twhile(1){\n\t\t\tif(current_run_id%run_batch_size==0){\n\t\t\t\tcerr<<\"Current Run \"<<current_run_id<<endl;\n\t\t\t}\n\t\t\tslv();\n\t\t\tcurrent_run_id++;\n\t\t}\n\t}else{\n\t\t//INT(t);rep(_,t)\n\t\twhile(1)slv();\n\t}\n}","accuracy":1,"time_ms":710,"memory_kb":4440,"score_of_the_acc":-0.308,"final_rank":9},{"submission_id":"aoj_1343_9988682","code_snippet":"// GYM102014I Hidden Tree\n#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <cstring>\n#define ll long long\n#define rep(i, s, t) for(int i=s; i<=t; ++i)\n#define debug(x) cerr<<#x<<\":\"<<x<<endl;\nconst int N=1005, M=1000010, inf=0x3f3f3f3f;\nusing namespace std;\nchar buf[1<<23], *p1=buf, *p2=buf;\n#define gc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\ninline int read()\n{\n int x=0, f=1; char c=gc();\n while(c<'0' || c>'9') c=='-' && (f=-1), c=gc();\n while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0', c=gc();\n return x*f;\n}\n\nint n, a[N], b[N], res;\ninline void upd(int &x, int y) {x=x>y?x:y;}\nvector<int> vec[N];\nint f[M], sum;\nvoid solve(vector<int> &a)\n{\n memset(f, -0x3f, sizeof f); f[0]=0;\n sum=0;\n for(int x:a)\n {\n sum+=x;\n // for(int s=sum; s>=x; s--)\n // {\n // int lo=s&-s;\n // if(!s || lo>=x) upd(f[s], f[s-x]+1);\n // }\n for(int s=sum/x*x; s>=x; s-=x)\n upd(f[s], f[s-x]+1);\n }\n for(int s=1; s<=sum; s<<=1) upd(res, f[s]);\n}\n\nvoid solve()\n{\n res=0;\n rep(i, 1, 500) vec[i].clear();\n rep(i, 1, n) a[i]=read(), b[i]=1;\n rep(i, 1, n)\n {\n while(!(a[i]&1)) b[i]<<=1, a[i]>>=1;\n vec[a[i]].push_back(b[i]);\n }\n rep(i, 1, 500) if(vec[i].size()) solve(vec[i]);\n printf(\"%d\\n\", res);\n}\n\nint main()\n{\n#ifdef Jerrywang\n freopen(\"E:/OI/in.txt\", \"r\", stdin); ios::sync_with_stdio(0);\n#endif\n while(n=read(), n) solve();\n\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":7552,"score_of_the_acc":-0.9985,"final_rank":16},{"submission_id":"aoj_1343_9988655","code_snippet":"// GYM102014I Hidden Tree\n#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <cstring>\n#define ll long long\n#define rep(i, s, t) for(int i=s; i<=t; ++i)\n#define debug(x) cerr<<#x<<\":\"<<x<<endl;\nconst int N=1005, M=1000010, inf=0x3f3f3f3f;\nusing namespace std;\nchar buf[1<<23], *p1=buf, *p2=buf;\n#define gc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\ninline int read()\n{\n int x=0, f=1; char c=gc();\n while(c<'0' || c>'9') c=='-' && (f=-1), c=gc();\n while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0', c=gc();\n return x*f;\n}\n\nint n, a[N], b[N], res;\ninline void upd(int &x, int y) {x=x>y?x:y;}\nvector<int> vec[N];\nint f[M], sum;\nvoid solve(vector<int> &a)\n{\n memset(f, -0x3f, sizeof f); f[0]=0;\n sum=0;\n for(int x:a)\n {\n sum+=x;\n for(int s=sum; s>=x; s--)\n {\n int lo=s&-s;\n if(!s || lo>=x) upd(f[s], f[s-x]+1);\n }\n }\n for(int s=1; s<=sum; s<<=1) upd(res, f[s]);\n}\n\nvoid solve()\n{\n res=0;\n rep(i, 1, 500) vec[i].clear();\n rep(i, 1, n) a[i]=read(), b[i]=1;\n rep(i, 1, n)\n {\n while(!(a[i]&1)) b[i]<<=1, a[i]>>=1;\n vec[a[i]].push_back(b[i]);\n }\n rep(i, 1, 500) if(vec[i].size()) solve(vec[i]);\n printf(\"%d\\n\", res);\n}\n\nint main()\n{\n#ifdef Jerrywang\n freopen(\"E:/OI/in.txt\", \"r\", stdin); ios::sync_with_stdio(0);\n#endif\n while(n=read(), n) solve();\n\n return 0;\n}","accuracy":1,"time_ms":610,"memory_kb":7612,"score_of_the_acc":-1.0671,"final_rank":18},{"submission_id":"aoj_1343_9628315","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n\nvoid solve(int n) {\n if (!n) exit(0);\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n int ans = 0, sum = accumulate(a.begin(), a.end(), 0);\n for (int mul = 1; mul < 500; mul += 2) {\n int w = 1;\n while (w * mul <= sum) w *= 2;\n vector<int> dp(w + 1, 0);\n for (int i = 0; i < n; i++) {\n if (a[i] % mul) continue;\n int x = a[i] / mul;\n if (x != (x & -x)) continue;\n for (int j = w - x; j > 0; j -= x) {\n if (dp[j]) dp[j + x] = max(dp[j + x], dp[j] + 1);\n }\n dp[x] = max(dp[x], 1);\n }\n for (int i = 1; i < w; i *= 2) {\n ans = max(ans, dp[i]);\n }\n }\n cout << ans << \"\\n\";\n}\n\n// Make bold hypotheses and verify carefully\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n int n;\n while (cin >> n) {\n solve(n);\n };\n}","accuracy":1,"time_ms":460,"memory_kb":6024,"score_of_the_acc":-0.6579,"final_rank":12},{"submission_id":"aoj_1343_9278055","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i, a, b) for(ll i = a; i < b; i++)\n#define all(x) (x).begin(), (x).end()\n\ntemplate<typename T>\nvoid print(const vector<T>& a){\n for(auto x:a)cout<<x<<\" \";\n cout<<endl;\n}\n\nint dp[1<<18];\n\nint solve(const vector<int>& a) {\n const int n = a.size();\n memset(dp, -1, sizeof(dp));\n dp[0]=0;\n rep(i,0,n){\n for(int S=(1<<18)-1; S>=0; --S){\n if(dp[S]!=-1 && (S&((1<<a[i])-1)) == 0){\n int nS = S+(1<<a[i]);\n dp[nS] = max(dp[nS], dp[S] + 1);\n }\n }\n }\n int ans = 0;\n rep(k,0,18) ans = max(ans, dp[1<<k]);\n return ans;\n}\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n vector<int> a(n);\n for (auto& x : a) cin >> x;\n\n vector<vector<int>> as(500);\n rep(i,0,n){\n int k=0;\n while (a[i] % 2 == 0) {\n a[i]/=2;\n ++k;\n }\n as[a[i]].push_back(k);\n }\n\n int ans = 0;\n rep(a,0,500)if(!as[a].empty()){\n ans = max(ans, solve(as[a]));\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":7010,"memory_kb":4496,"score_of_the_acc":-1.24,"final_rank":19},{"submission_id":"aoj_1343_8693986","code_snippet":"#include<bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); ++i)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<int> vi;\ntypedef pair<int, int> pii;\ntypedef pair<ll, int> pli;\ntypedef pair<ll, ll> pll;\ntypedef array<int, 3> ai3;\nconst int inf = 0x3f3f3f3f;\nconst int Mod = 998244353;\nconst int inv2 = (Mod+1) / 2;\nint sign(int a){ return (a&1) ? (Mod-1) : 1; }\nvoid uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }\nvoid usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }\nvoid umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }\nint add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }\nint sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }\nint mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }\nint qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }\nconst int fN = 10010;\nint fact[fN], invfact[fN], inv[fN];\nvoid initfact(int n){\n\tfact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);\n\tinvfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);\n\tfor(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);\n}\nint binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }\nconst double pi = acos(-1);\nvoid chmax(int &a, int b){ (b>a) ? (a=b) : 0; }\nvoid chmin(int &a, int b){ (b<a) ? (a=b) : 0; }\n\nconst int lmt = 18;\nint calc(vi &a){\n\tif(a.empty()) return 0;\n\t//cout << \"{\"; rep(i, (int)a.size()){ cout << a[i] << \" \"; } cout << \"}\\n\";\n\tstatic int dp[262626];\n\tfill(dp, dp + (1<<lmt), -inf);\n\tdp[0] = 0;\n\trep(i, (int)a.size()){\n\t\tfor(int x = (1<<lmt) - 1; x >= 0; --x){\n\t\t\tif(dp[x] >= 0 && !(x & ((1<<a[i]) - 1)))\n\t\t\t\tchmax(dp[x + (1<<a[i])], dp[x] + 1);\n\t\t}\n\t}\n\tint ret = 0;\n\trep(i, lmt) chmax(ret, dp[1<<i]);\n\treturn ret;\n}\n\nint n, a[1010];\n\nvi v[555];\nvoid solve(){\n\trep(i, n) cin >> a[i];\n\trep(i, 505) v[i].clear();\n\trep(i, n){\n\t\tint p = a[i], c = 0;\n\t\tfor(; p % 2 == 0; p >>= 1, ++c);\n\t\tv[p].push_back(c);\n\t}\n\tint ans = 0;\n\tfor(int i = 1; i <= 502; ++i)\n\t\tchmax(ans, calc(v[i]));\n\tcout << ans << \"\\n\";\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile(cin >> n && n)\n\t\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":4860,"memory_kb":4432,"score_of_the_acc":-0.911,"final_rank":14},{"submission_id":"aoj_1343_8334951","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nconst int inf = (1 << 30) - 1;\n\nint main() {\n while (true) {\n int N;\n cin >> N;\n\n if (N == 0) break;\n\n vector<int> a(N);\n rep(i, N) cin >> a[i];\n\n vector<int> b(N, 0);\n rep(i, N) {\n while (a[i] % 2 == 0) {\n a[i] /= 2;\n b[i]++;\n }\n }\n\n auto solve = [&](vector<int> c) {\n int sum = 0;\n each(e, c) sum += 1 << e;\n int K = 1;\n while (K * 2 <= sum) K *= 2;\n\n vector<int> p(K + 1, inf);\n rep2(i, 1, K + 1) p[i] = __builtin_ctz(i);\n\n vector<int> dp(K + 1, -inf);\n dp[0] = 0;\n each(e, c) {\n per(i, K - (1 << e) + 1) {\n if (p[i] >= e) {\n chmax(dp[i + (1 << e)], dp[i] + 1); //\n }\n }\n }\n\n int ret = 0;\n for (int i = 1; i <= K; i <<= 1) {\n chmax(ret, dp[i]); //\n }\n\n // print(c), print(dp);\n // cout << sum MM K MM ret << '\\n';\n return ret;\n };\n\n int ans = 0;\n\n rep(i, 501) {\n vector<int> c;\n rep(j, N) {\n if (a[j] == i) c.eb(b[j]);\n }\n if (!empty(c)) chmax(ans, solve(c));\n }\n\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":520,"memory_kb":4148,"score_of_the_acc":-0.2091,"final_rank":7},{"submission_id":"aoj_1343_7244378","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nusing namespace std::chrono;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n#define REP(i, n) for(int i = 0;i < (n);i++)\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\nconst int mod=1000000007;\nconst llint inf=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-10;\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\ntemplate<class T>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\n\n\nint main(void){\n\tstatic int dp[132000]={};\n\tfor(int i=0;i<132000;i++){dp[i]=-mod;}\n\t//131072\n\twhile(-1){\n\t\tint n,i,j;cin>>n;\n\t\tif(n==0){return 0;}\n\t\tvector<int>A(n);\n\t\tfor(i=0;i<n;i++){cin>>A[i];}\n\t\tint ans=0;\n\t\tfor(int k=1;k<=499;k++){\n\t\t\tint sum=0;\n\t\t\tdp[0]=0;\n\t\t\tfor(i=0;i<n;i++){\n\t\t\t\tif(A[i]%k){continue;}\n\t\t\t\tint B=A[i]/k;\n\t\t\t\tif(B&(B-1)){continue;}\n\t\t\t\tfor(j=sum/B*B;j>=0;j-=B){\n\t\t\t\t\tchmax(dp[j+B],dp[j]+1);\n\t\t\t\t}\n\t\t\t\tsum+=B;\n\t\t\t\tchmin(sum,131072);\n\t\t\t}\n\t\t\tfor(i=1;i<=131072;i*=2){\n\t\t\t\tchmax(ans,dp[i]);\n\t\t\t}\n\t\t\tfor(i=0;i<=sum;i++){dp[i]=-mod;}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":270,"memory_kb":3884,"score_of_the_acc":-0.1082,"final_rank":2},{"submission_id":"aoj_1343_7120069","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<28;\n\nint dp[1<<18];\nint mi[1<<18];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n for(int j=0;j<(1<<18);j++){\n for(int k=0;k<18;k++){\n if(j&(1<<k)){\n mi[j]=k;\n break;\n }\n }\n dp[j]=-INF;\n }\n mi[0]=INF;\n \n while(1){\n int N;cin>>N;\n if(N==0) break;\n vector<int> A(N);\n for(int i=0;i<N;i++) cin>>A[i];\n \n int ans=0;\n \n for(int x=1;x<=500;x+=2){\n vector<int> use;\n int sum=0;\n for(int i=0;i<N;i++){\n if(A[i]%x==0){\n int z=A[i]/x;\n for(int j=0;j<10;j++){\n if((1<<j)==z){\n use.push_back(j);\n sum+=z;\n }\n }\n }\n }\n \n if(si(use)==0) continue;\n \n for(int j=0;j<=sum;j++) dp[j]=-INF;\n dp[0]=0;\n \n for(int i=0;i<si(use);i++){\n int x=use[i];\n int z=sum/(1<<x);\n for(int k=z;k>=0;k--){\n int j=(k<<x);\n if(dp[j]<0) continue;\n if(mi[j]>=x){\n chmax(dp[j+(1<<x)],dp[j]+1);\n }\n }\n }\n \n for(int k=0;k<18;k++){\n if((1<<k)<=sum) chmax(ans,dp[(1<<k)]);\n }\n }\n \n cout<<ans<<\"\\n\";\n }\n}","accuracy":1,"time_ms":500,"memory_kb":5440,"score_of_the_acc":-0.5213,"final_rank":11},{"submission_id":"aoj_1343_7120059","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<28;\n\nint dp[1<<18];\nint mi[1<<18];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n for(int j=0;j<(1<<18);j++){\n for(int k=0;k<18;k++){\n if(j&(1<<k)){\n mi[j]=k;\n break;\n }\n }\n }\n mi[0]=INF;\n \n while(1){\n int N;cin>>N;\n if(N==0) break;\n vector<int> A(N);\n for(int i=0;i<N;i++) cin>>A[i];\n \n int ans=0;\n \n for(int x=1;x<=500;x+=2){\n vector<int> use;\n for(int i=0;i<N;i++){\n if(A[i]%x==0){\n int z=A[i]/x;\n for(int j=0;j<10;j++){\n if((1<<j)==z) use.push_back(j);\n }\n }\n }\n \n if(si(use)==0) continue;\n \n for(int j=0;j<(1<<18);j++) dp[j]=-INF;\n dp[0]=0;\n \n for(int i=0;i<si(use);i++){\n int x=use[i];\n int z=(1<<18)/(1<<x);\n for(int k=z-1;k>=0;k--){\n int j=(k<<x);\n if(dp[j]<0) continue;\n if(mi[j]>=x){\n chmax(dp[j+(1<<x)],dp[j]+1);\n }\n }\n //謎枝刈り\n }\n \n for(int k=0;k<18;k++){\n chmax(ans,dp[(1<<k)]);\n }\n }\n \n cout<<ans<<\"\\n\";\n }\n}","accuracy":1,"time_ms":3030,"memory_kb":5448,"score_of_the_acc":-0.892,"final_rank":13},{"submission_id":"aoj_1343_7120033","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<28;\n\nint dp[2][1<<18];\nint mi[1<<18];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n for(int j=0;j<(1<<18);j++){\n for(int k=0;k<18;k++){\n if(j&(1<<k)){\n mi[j]=k;\n break;\n }\n }\n }\n mi[0]=INF;\n \n while(1){\n int N;cin>>N;\n if(N==0) break;\n vector<int> A(N);\n for(int i=0;i<N;i++) cin>>A[i];\n \n int ans=0;\n \n for(int x=1;x<=500;x+=2){\n vector<int> use;\n for(int i=0;i<N;i++){\n if(A[i]%x==0){\n int z=A[i]/x;\n for(int j=0;j<10;j++){\n if((1<<j)==z) use.push_back(j);\n }\n }\n }\n \n if(si(use)==0) continue;\n \n for(int i=0;i<2;i++) for(int j=0;j<(1<<18);j++) dp[i][j]=-INF;\n dp[0][0]=0;\n \n for(int i=0;i<si(use);i++){\n int s=i&1,t=s^1;\n int x=use[i];\n for(int j=0;j<(1<<18);j++){\n if(dp[s][j]<0) continue;\n if(mi[j]>=x){\n chmax(dp[t][j+(1<<x)],dp[s][j]+1);\n }\n chmax(dp[t][j],dp[s][j]);\n dp[s][j]=-INF;\n }\n }\n \n for(int k=0;k<18;k++){\n chmax(ans,dp[si(use)&1][(1<<k)]);\n }\n }\n \n cout<<ans<<\"\\n\";\n }\n}","accuracy":1,"time_ms":5270,"memory_kb":6464,"score_of_the_acc":-1.4664,"final_rank":20},{"submission_id":"aoj_1343_7118679","code_snippet":"#line 1 \"a.cpp\"\n// cSpell:disable\n/*\tauthor: Kite_kuma\n\tcreated: 2022.11.22 13:14:29 */\n\n#line 2 \"SPJ-Library/template/kuma.hpp\"\n\n#line 2 \"SPJ-Library/template/basic_func.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool flag = true) { std::cout << (flag ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool flag = true) { std::cout << (flag ? \"YES\" : \"NO\") << '\\n'; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(const T &x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(const Head &H, const Tail &... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T value) {\n\tfor(auto &a : v) a += value;\n\treturn;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\n// ceil(a / b);\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b);\n\tif(b < 0) {\n\t\ta *= -1;\n\t\tb *= -1;\n\t}\n\treturn least_upper_multiple(a, b) / b;\n}\n\nlong long pow_ll(long long a, long long n) {\n\tassert(n >= 0LL);\n\tif(n == 0) return 1LL;\n\tif(a == 0) return 0LL;\n\tif(a == 1) return 1LL;\n\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\n\tlong long res = 1;\n\twhile(n > 1LL) {\n\t\tif(n & 1LL) res *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn res * a;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, const long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(const std::vector<T> &a) {\n\tstd::vector<T> vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(const auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n#line 1 \"SPJ-Library/template/header.hpp\"\n#include <bits/stdc++.h>\n#line 2 \"SPJ-Library/template/io.hpp\"\n\n#line 4 \"SPJ-Library/template/io.hpp\"\n\n#line 8 \"SPJ-Library/template/debug.hpp\"\n\n#line 3 \"SPJ-Library/template/constants.hpp\"\n\nconstexpr int inf = 1000'000'000;\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\nconstexpr int mod_1000000007 = 1000000007;\nconstexpr int mod_998244353 = 998244353;\nconst long double pi = acosl(-1.);\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n#line 10 \"SPJ-Library/template/debug.hpp\"\n\nnamespace viewer {\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\n\nvoid view(const long long &e);\n\nvoid view(const int &e);\n\ntemplate <typename T>\nvoid view(const T &e);\n\ntemplate <typename T>\nvoid view(const std::set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v);\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v);\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv);\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m);\n\ntemplate <typename container_type>\nvoid view_container(const container_type &c, bool vertically = false) {\n\ttypename container_type::const_iterator begin = c.begin();\n\tconst typename container_type::const_iterator end = c.end();\n\tif(vertically) {\n\t\tstd::cerr << \"{\\n\";\n\t\twhile(begin != end) {\n\t\t\tstd::cerr << '\\t';\n\t\t\tview(*(begin++));\n\t\t\tif(begin != end) std::cerr << ',';\n\t\t\tstd::cerr << '\\n';\n\t\t}\n\t\tstd::cerr << '}';\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\twhile(begin != end) {\n\t\tview(*(begin++));\n\t\tif(begin != end) std::cerr << ',';\n\t\tstd::cerr << ' ';\n\t}\n\tstd::cerr << '}';\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << '(';\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << ')';\n}\n\nvoid view(const long long &e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int &e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T &e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tview_container(vv, true);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(it->first);\n\t\tstd::cerr << \"] : \";\n\t\tview(it->second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tview_map_container(m);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tview_map_container(m);\n}\n\n} // namespace viewer\n\n// when compiling : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename T>\nvoid debug_out(const T &x) {\n\tviewer::view(x);\n}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(const Head &H, const Tail &... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\n#line 2 \"SPJ-Library/template/scanner.hpp\"\n\n#line 6 \"SPJ-Library/template/scanner.hpp\"\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#line 7 \"SPJ-Library/template/io.hpp\"\n\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << ' ' << p.second;\n\treturn os;\n}\n\nstruct fast_io {\n\tfast_io() {\n\t\tstd::ios::sync_with_stdio(false);\n\t\tstd::cin.tie(nullptr);\n\t\tstd::cout << std::fixed << std::setprecision(15);\n\t\tsrand((unsigned)time(NULL));\n\t}\n} fast_io_;\n#line 2 \"SPJ-Library/template/macros.hpp\"\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define pcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n#line 7 \"SPJ-Library/template/kuma.hpp\"\n\nusing namespace std;\n#line 6 \"a.cpp\"\nconstexpr int val_max = 512;\nint maxval(vector<int> a) {\n\tconst int n = int(a.size());\n\tif(n == 0) return 0;\n\tdebug(a);\n\tconst int smax = accumulate(all(a), 10);\n\tvector<int> dp(smax, -inf);\n\tdp[0] = 0;\n\tfoa(v, a) {\n\t\tauto tmp = dp;\n\t\tfor(int from = 0; from + v < smax; from += v) {\n\t\t\tif(dp[from] < 0) continue;\n\t\t\tif(from == 0) {\n\t\t\t\tdebug(from + v, from);\n\t\t\t\tdebug(dp[from + v], dp[from]);\n\t\t\t}\n\t\t\tchmax(tmp[from + v], dp[from] + 1);\n\t\t}\n\t\tswap(tmp, dp);\n\t\tdebug(v);\n\t\trep(j, smax) {\n\t\t\tif(dp[j] > 0) {\n\t\t\t\tdebug(j, dp[j]);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor(int i = 1; i < smax; i <<= 1) {\n\t\tchmax(ans, dp[i]);\n\t}\n\tdebug(dp);\n\tdebug(ans);\n\treturn ans;\n}\nint solve(int n) {\n\tvector<int> a(n);\n\tfoa(t, a) cin >> t;\n\tvector<vector<int>> dived(val_max);\n\tfoa(value, a) {\n\t\tint mult = 1;\n\t\twhile(value % 2 == 0) {\n\t\t\tvalue /= 2;\n\t\t\tmult *= 2;\n\t\t}\n\t\tdived[value].push_back(mult);\n\t}\n\tint ans = 0;\n\tfor(auto row : dived) {\n\t\tchmax(ans, maxval(row));\n\t}\n\treturn ans;\n}\nint main() {\n\tint n;\n\twhile(cin >> n && n) {\n\t\tcout << solve(n) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":410,"memory_kb":4164,"score_of_the_acc":-0.1969,"final_rank":6},{"submission_id":"aoj_1343_6556285","code_snippet":"#include<iostream>\n#include<vector>\n#define rep(i,a,b) for(int i = (a); i <= (b); i++)\n#define per(i,b,a) for(int i = (b); i >= (a); i--)\n#define N 1010\n#define M 260000\nusing namespace std;\n\nint a[N], dp[M], sum[N], n;\nvector<int> p[N];\n\nint main(){\n ios::sync_with_stdio(false);\n while(cin>>n && n){\n rep(i,1,n){\n cin>>a[i];\n int tmp = a[i];\n while(tmp%2 == 0) tmp /= 2;\n p[tmp].push_back(a[i]/tmp), sum[tmp] += a[i]/tmp;\n }\n\n int ans = 0;\n rep(o,1,500) if(p[o].size()){\n int m = p[o].size();\n rep(i,0,sum[o]) dp[i] = -1;\n dp[0] = 0;\n rep(i,1,m){\n int k = p[o][i-1];\n for(int j = sum[o]/k*k; j >= 0; j -= k) if(~dp[j])\n dp[j+k] = max(dp[j+k], dp[j]+1);\n }\n rep(k,0,17) if((1<<k) <= sum[o]) ans = max(ans, dp[1<<k]);\n }\n cout<<ans<<endl;\n\n rep(i,0,500) p[i].clear(), sum[i] = 0;\n }\n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":3692,"score_of_the_acc":-0.0818,"final_rank":1},{"submission_id":"aoj_1343_5801160","code_snippet":"/*学习古代文章，诗词\n醉翁亭记 北宋·欧阳修\n\n环滁皆山也。其西南诸峰，林壑尤美。望之蔚然而深秀者，琅琊也。山行六七里，渐闻水声潺潺，而泻出于两峰之间者，让泉也。峰回路转，有亭翼然临于泉上者，醉翁亭也。作亭者谁？山之僧曰智仙也。名之者谁？太守自谓也。太守与客来饮于此，饮少辄醉，而年又最高，故自号曰醉翁也。醉翁之意不在酒，在乎山水之间也。山水之乐，得之心而寓之酒也。\n\n若夫日出而林霏开，云归而岩穴暝，晦明变化者，山间之朝暮也。野芳发而幽香，佳木秀而繁阴，风霜高洁，水落而石出者，山间之四时也。朝而往，暮而归，四时之景不同，而乐亦无穷也。\n\n至于负者歌于途，行者休于树，前者呼，后者应，伛偻提携，往来而不绝者，滁人游也。临谿而渔，谿深而鱼肥；酿泉为酒，泉香而酒洌；山肴野蔌，杂然而前陈者，太守宴也。宴酣之乐，非丝非竹，射者中，弈者胜，觥筹交错，起坐而喧哗者，众宾欢也；苍颜白发，颓然乎其间者，太守醉也。\n\n已而夕阳在山，人影散乱，太守归而宾客从也。树林阴翳，鸣声上下，游人去而禽鸟乐也。然而禽鸟知山林之乐，而不知人之乐；人知从太守游而乐，而不知太守之乐其乐也。醉能同其乐，醒能述以文者，太守也。太守谓谁？庐陵欧阳修也。\n\n岳阳楼记 北宋·范仲淹\n\n庆历四年春，滕子京谪守巴陵郡。越明年，政通人和，百废具兴，乃重修岳阳楼，增其旧制，刻唐贤今人诗赋于其上；属予作文以记之。\n\n予观夫巴陵胜状，在洞庭一湖。衔远山，吞长江，浩浩汤汤，横无际涯；朝晖夕阴，气象万千；此则岳阳楼之大观也，前人之述备矣。然则北通巫峡，南极潇湘，迁客骚人，多会于此，览物之情，得无异乎？\n\n若夫霪雨霏霏，连月不开；阴风怒号，浊浪排空；日星隐曜，山岳潜形；商旅不行，樯倾楫摧；薄暮冥冥，虎啸猿啼。登斯楼也，则有去国怀乡，忧谗畏讥，满目萧然，感极而悲者矣。\n\n至若春和景明，波澜不惊，上下天光，一碧万顷；沙鸥翔集，锦鳞游泳，岸芷汀兰，郁郁青青。而或长烟一空，皓月千里，浮光跃金，静影沉璧，渔歌互答，此乐何极。登斯楼也，则有心旷神怡，宠辱皆忘，把酒临风，其喜洋洋者矣。\n\n嗟夫！予尝求古仁人之心，或异二者之为，何哉？不以物喜，不以己悲。居庙堂之高，则忧其民；处江湖之远，则忧其君。是进亦忧，退亦忧；然则何时而乐耶？其必曰：“先天下之忧而忧，后天下之乐而乐”欤！噫！微斯人，吾谁与归？\n\n马说 唐·韩愈\n\n世有伯乐，然后有千里马。千里马常有，而伯乐不常有。故虽有名马，祗辱于奴隶人之手，骈死于槽枥之间，不以千里称也。\n\n马之千里者，一食或尽粟一石。食马者不知其能千里而食也。是马也，虽有千里之能，食不饱，力不足，才美不外见，且欲与常马等不可得，安求其能千里也？\n\n策之不以其道，食之不能尽其材，鸣之而不能通其意，执策而临之，曰：“天下无马！”呜呼！其真无马邪？其真不知马也！\n*/\n//Generated at 2021-08-18 21:36:06 UTC+8\n//Created by Alphagocc\n#ifndef TYPE_HPP\n#define TYPE_HPP\n#include <type_traits>\n#ifndef __cpp_lib_void_t\nnamespace std\n{\ntemplate <typename...> using void_t = void;\n}\n#endif\ntemplate <typename T, typename _ = void> struct is_container : std::false_type\n{};\ntemplate <typename... Ts> struct is_container_helper\n{};\ntemplate <typename T>\nstruct is_container<T,\n typename std::conditional<false,\n is_container_helper<decltype(std::declval<T>().size()),\n decltype(std::declval<T>().begin()),\n decltype(std::declval<T>().end()),\n decltype(std::declval<T>().cbegin()),\n decltype(std::declval<T>().cend())>,\n void>::type> : public std::true_type\n{};\n#endif\n#include <bits/stdc++.h>\n#define FORCE_INLINE __inline__ __attribute__((always_inline))\nclass IO\n{\n static const int bufSize = 1 << 18;\n\n char inBuf[bufSize], outBuf[bufSize];\n char *ip1 = inBuf, *ip2 = inBuf;\n int goodReadBit = 1, op1 = -1, op2 = bufSize - 1;\n FORCE_INLINE int gc()\n {\n return ip1 == ip2\n && (ip2 = (ip1 = inBuf) + fread(inBuf, 1, bufSize, stdin),\n ip1 == ip2)\n ? (goodReadBit = 0, EOF)\n : *ip1++;\n }\n template <typename T> FORCE_INLINE void __RI(T &x)\n {\n int ch = gc(), neg = 1;\n x = 0;\n for (; !(isdigit(ch) || ch == '-' || ch == EOF); ch = gc()) {}\n if (ch == EOF) return;\n if (ch == '-') neg = -1, ch = gc();\n for (; isdigit(ch); ch = gc()) x = x * 10 + (ch - 48) * neg;\n }\n template <typename T> FORCE_INLINE void __RC(T &x)\n {\n int ch;\n while (isspace(ch = gc())) {}\n if (ch == EOF) return;\n x = ch;\n }\n FORCE_INLINE void __RS(std::string &x)\n {\n char ch;\n x.clear();\n for (ch = gc(); isspace(ch); ch = gc()) {}\n if (ch == EOF) return;\n for (; !isspace(ch) && ch != EOF; ch = gc()) x.push_back(ch);\n }\n\npublic:\n FORCE_INLINE IO &R(char &x) { return __RC(x), (*this); }\n FORCE_INLINE IO &R(unsigned char &x) { return __RC(x), (*this); }\n FORCE_INLINE IO &R(std::string &x) { return __RS(x), (*this); }\n template <typename T1, typename T2> FORCE_INLINE IO &R(std::pair<T1, T2> &x)\n {\n return R(x.first), R(x.second), (*this);\n }\n template <typename T, typename... Args> FORCE_INLINE IO &RA(T *a, int n)\n {\n for (int i = 0; i < n; ++i) R(a[i]);\n return (*this);\n }\n template <typename T, typename... Args>\n FORCE_INLINE IO &R(T &x, Args &...args)\n {\n return R(x), R(args...), (*this);\n }\n template <typename T, typename... Args>\n FORCE_INLINE IO &RA(T *a, int n, Args... args)\n {\n for (int i = 0; i < n; ++i) RA(a[i], args...);\n return (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<std::is_integral<T>::value, IO>::type &\n R(T &x)\n {\n return __RI(x), (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<is_container<T>::value, IO>::type &R(\n T &x)\n {\n for (auto &i : x) R(i);\n return (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<\n std::is_void<std::void_t<decltype(std::declval<T>().read())>>::value,\n IO>::type &\n R(T &x)\n {\n return x.read(), (*this);\n }\n\nprivate:\n char space = ' ';\n FORCE_INLINE void pc(const char &x)\n {\n if (op1 == op2) flush();\n outBuf[++op1] = x;\n }\n template <typename T> FORCE_INLINE void __WI(T x)\n {\n static char buf[sizeof(T) * 16 / 5];\n static int len = -1;\n if (x >= 0) {\n do {\n buf[++len] = x % 10 + 48, x /= 10;\n } while (x);\n } else {\n pc('-');\n do {\n buf[++len] = -(x % 10) + 48, x /= 10;\n } while (x);\n }\n while (len >= 0) { pc(buf[len]), --len; }\n }\n\npublic:\n FORCE_INLINE void flush() { fwrite(outBuf, 1, op1 + 1, stdout), op1 = -1; }\n FORCE_INLINE IO &W(const char &x) { return pc(x), (*this); }\n FORCE_INLINE IO &W(const char *x)\n {\n while (*x != '\\0') pc(*(x++));\n return (*this);\n }\n FORCE_INLINE IO &W(const std::string &x) { return W(x.c_str()), (*this); }\n template <typename T1, typename T2>\n FORCE_INLINE IO &W(const std::pair<T1, T2> &x)\n {\n WS(x.first);\n W(x.second);\n return (*this);\n }\n FORCE_INLINE IO &WL() { return W('\\n'), (*this); }\n template <typename T> FORCE_INLINE IO &WL(const T &x)\n {\n return W(x), W('\\n'), (*this);\n }\n FORCE_INLINE IO &WS() { return W(space), (*this); }\n template <typename T> FORCE_INLINE IO &WS(const T &x)\n {\n return W(x), W(space), (*this);\n }\n template <typename T> FORCE_INLINE IO &WA(T *a, int n)\n {\n for (int i = 0; i < n; i++) WS(a[i]);\n WL();\n return (*this);\n }\n template <typename T, typename... Args>\n FORCE_INLINE IO &W(const T &x, const Args &...args)\n {\n W(x), W(space), W(args...);\n return (*this);\n }\n template <typename T, typename... Args>\n FORCE_INLINE IO &WS(const T &x, const Args &...args)\n {\n return W(x), W(space), W(args...), W(space), (*this);\n }\n template <typename... Args> FORCE_INLINE IO &WL(const Args &...args)\n {\n return W(args...), W('\\n'), (*this);\n }\n template <typename T, typename... Args>\n FORCE_INLINE IO &WA(T *a, int n, Args... args)\n {\n for (int i = 0; i < n; i++) WA(a[i], args...);\n return (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<std::is_integral<T>::value, IO>::type &\n W(const T &x)\n {\n return __WI(x), (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<is_container<T>::value, IO>::type &W(\n const T &x)\n {\n\n for (auto &i : x) WS(i);\n WL();\n return (*this);\n }\n template <typename T>\n FORCE_INLINE typename std::enable_if<\n std::is_void<std::void_t<decltype(std::declval<T>().write())>>::value,\n IO>::type &\n W(const T &x)\n {\n return x.write(), (*this);\n }\n template <typename T> FORCE_INLINE IO &operator>>(T &x)\n {\n R(x);\n return (*this);\n }\n template <typename T> FORCE_INLINE IO &operator<<(const T &x)\n {\n W(x);\n return (*this);\n }\n int good() { return goodReadBit; }\n IO() {}\n ~IO() { flush(); }\n} io;\n#undef FORCE_INLINE\n\n#ifndef UTIL_HPP\n#define UTIL_HPP\n#include <bits/stdc++.h>\n#define var auto\n#define ALL(x) x.begin(), x.end()\nconst std::int32_t INF = 0x3f3f3f3f;\nconst std::int64_t INFL = 0x3f3f3f3f3f3f3f3f;\n#define If(x, y, z) ((x) ? (y) : (z))\n#endif\nusing namespace std;\nint f(const vector<int> &a)\n{\n vector<int> dp(accumulate(ALL(a), 0) + 1, -1);\n // io.WL(a);\n int sum = 0;\n dp[0] = 0;\n for (auto i : a) {\n for (int j = sum & -i; j >= 0; j -= i) {\n if (dp[j] != -1) dp[j + i] = max(dp[j + i], dp[j] + 1);\n }\n sum += i;\n }\n int ans = 1;\n for (int i = 1; i < dp.size(); i <<= 1) ans = max(ans, dp[i]);\n return ans;\n}\nint main()\n{\n int n;\n while (1) {\n io >> n;\n if (n == 0) break;\n vector<int> a(n);\n io >> a;\n int ans = 1;\n map<int, vector<int>> v;\n for (auto i : a) { v[i / (i & -i)].push_back(i & -i); }\n for (auto [ignore, x] : v) {\n int k = 1;\n do {\n ans = max(ans, f(x));\n x.erase(\n remove_if(ALL(x), [&](int i) { return i <= k; }), x.end());\n k <<= 1;\n } while (!x.empty());\n }\n io.WL(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":3984,"score_of_the_acc":-0.1268,"final_rank":4},{"submission_id":"aoj_1343_5798469","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define SZ(x) ((int)(x).size())\n#define rep(i, a) for (int i = 0; i < (a); ++i)\n#define repi(i, a) for (int i = 1; i <= (a); ++i)\ntypedef long long ll;\nconst int Inf = 0x3f3f3f3f;\n\nint N;\nint a[1005];\nvector<int> ss[505];\nint dp[500005];\n\nint get(vector<int> &v) {\n\tint sm = accumulate(v.begin(), v.end(), 0);\n\tmemset(dp, -1, sizeof(int) * (sm + 1));\n\tdp[0] = 0;\n\tint nsm = 0;\n\trep(i, SZ(v)) {\n\t\tint val = v[i]; nsm += val;\n\t\tfor (int j = nsm / val * val; j >= val; j -= val) if (~dp[j - val]) dp[j] = max(dp[j], dp[j - val] + 1);\n\t}\n\tint ans = 0;\n\tfor (int i = 1; i <= sm; i <<= 1) ans = max(ans, dp[i]);\n\treturn ans;\n}\n\nvoid solve() {\n\trepi(i, 500) ss[i].clear();\n\trepi(i, N) {\n\t\tscanf(\"%d\", a + i);\n\t\tint x = a[i];\n\t\twhile (!(x & 1)) x >>= 1;\n\t\tss[x].push_back(a[i] / x);\n\t}\n\tint ans = 0;\n\trepi(i, 500) ans = max(ans, get(ss[i]));\n\tprintf(\"%d\\n\", ans);\n}\n\nint main() {\n\twhile (scanf(\"%d\", &N) && N) solve();\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":4020,"score_of_the_acc":-0.1239,"final_rank":3},{"submission_id":"aoj_1343_5797917","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint Tc,n,a[1003];\nvector<int>arr[503];\nint f[500003],len,fs[500003];\nint solve(vector<int>v){\n\tmemset(f,-1,sizeof(f));\n\tf[0]=0,len=0;\n\tfor(int i=0;i<v.size();i++){\n\t\tint x=v[i];\n\t\tint nlen=len;\n\t\tfor(int j=len;~j;j--)if(~f[j]&&(j==0||fs[j]>=x)){\n\t\t\tf[j+(1<<x)]=max(f[j+(1<<x)],f[j]+1);\n\t\t\tnlen=max(nlen,j+(1<<x));\n\t\t}\n\t\tlen=nlen;\n\t}\n\tint ans=0;\n\tfor(int i=0;i<19;i++)ans=max(ans,f[1<<i]);\n\treturn ans;\n}\nint main(){\n\tfor(int i=1;i<500003;i++)fs[i]=__builtin_ffs(i)-1;\n\twhile(~scanf(\"%d\",&n)){\n\t\tif(n==0)break;\n\t\tfor(int i=1;i<503;i++)arr[i].clear();\n\t\tfor(int i=0;i<n;i++){\n\t\t\tint x;scanf(\"%d\",&x);\n\t\t\tint cnt=0;\n\t\t\twhile(x%2==0)cnt++,x/=2;\n\t\t\tarr[x].push_back(cnt);\n\t\t}\n\t\tint ans=1;\n\t\tfor(int i=1;i<503;i++)if(!arr[i].empty()){\n\t\t\tint tmp=solve(arr[i]);\n\t\t\tans=max(ans,tmp);\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}","accuracy":1,"time_ms":630,"memory_kb":7264,"score_of_the_acc":-0.9851,"final_rank":15},{"submission_id":"aoj_1343_5286922","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T>void debug(T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge() = default;\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v,w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n while(1){\n ll n;cin>>n;\n if(n==0)break;\n vector<ll>a(n);\n rep(i,0,n)cin>>a[i];\n ll sz=505;\n vector<vector<ll>>va(sz);\n rep(i,0,n){\n ll div=1;\n while(a[i]%div==0){\n va[a[i]/div].PB(div);\n div*=2;\n }\n }\n ll ret=0;\n for(auto &v:va){\n ll sum=0;\n for(auto z:v)sum+=z;\n vector<ll>dp(sum+1,-INF);\n dp[0]=0;\n for(auto z:v){\n for(ll k=(sum-z)/z*z;k>=0;k-=z){\n chmax(dp[k+z],dp[k]+1);\n }\n }\n for(ll i=1;i<=sum;i*=2)chmax(ret,dp[i]);\n }\n cout<<ret<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":4444,"score_of_the_acc":-0.2623,"final_rank":8},{"submission_id":"aoj_1343_4705369","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <string>\n#include <ctime>\n#include <vector>\n#include <cmath>\n#include <queue>\n#include <map>\n#include <set>\n#include <stack>\n#include <algorithm>\n//#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long LL;\n\nconst int SZ = 1005,SZ0 = 256005;\n\nint n,a[SZ],dp[SZ0];\nbool bas[SZ];bool vis[SZ];\nint sl,B[SZ],sum[SZ];\n\ntemplate<typename Type>inline void read(Type &xx){\n Type f = 1;char ch;xx = 0;\n for(ch = getchar();ch < '0' || ch > '9';ch = getchar()) if(ch == '-') f = -1;\n for(;ch >= '0' && ch <= '9';ch = getchar()) xx = xx * 10 + ch - '0';\n xx *= f;\n}\n\nint DP(){\n for(int i = 1;i <= sl;i++) sum[i] = sum[i - 1] + B[i];\n dp[0] = 0;\n for(int i = 1;i <= sl;i++){\n int mn = B[i];\n for(int j = sum[i] / mn * mn;j >= (mn << 1);j -= mn)\n dp[j] = max(dp[j],dp[j - mn] + 1);\n dp[mn] = max(dp[mn],1);\n }\n int ans = 0;\n for(int i = 1;i <= sum[sl];i <<= 1) ans = max(ans,dp[i]);\n memset(dp,0x8f,sizeof dp);\n return ans;\n}\n\nbool is_least(int idx){\n if(vis[a[idx]]) return false;\n vis[a[idx]] = true;\n for(int j = 1;j <= n;++j)\n if(a[idx] % a[j] == 0 && bas[a[idx] / a[j]] && a[idx] > a[j])\n return false;\n return true;\n}\n\nint main(int argc, char** argv) {\n for(int i = 1;i < SZ;i <<= 1) bas[i] = true;\n while(scanf(\"%d\",&n) != EOF && n){\n memset(dp,0x8f,sizeof dp);memset(vis,0,sizeof vis);\n for(int i = 1;i <= n;i++) read(a[i]);\n int ans = 0;\n for(int i = 1;i <= n;++i){\n if(!is_least(i)) continue;\n sl = 0;\n for(int j = 1;j <= n;++j)\n if(a[j] % a[i] == 0 && bas[a[j] / a[i]])\n B[++sl] = a[j] / a[i];\n ans = max(ans,DP());\n }\n printf(\"%d\\n\",ans);\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":4228,"score_of_the_acc":-0.195,"final_rank":5},{"submission_id":"aoj_1343_4145126","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\nconst ll INF = (1e+18) + 7;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-6;\nconst ld pi = acos(-1.0);\n//typedef vector<vector<ll>> mat;\ntypedef vector<int> vec;\n\nll mod_pow(ll a, ll n) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * a%mod;\n\t\ta = a * a%mod; n >>= 1;\n\t}\n\treturn res;\n}\n\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n%mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, int n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a*a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\n//const int max_n = 1 << 22;\n//modint fact[max_n], factinv[max_n];\n//void init_f() {\n//\tfact[0] = modint(1);\n//\tfor (int i = 0; i < max_n - 1; i++) {\n//\t\tfact[i + 1] = fact[i] * modint(i + 1);\n//\t}\n//\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n//\tfor (int i = max_n - 2; i >= 0; i--) {\n//\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n//\t}\n//}\n//modint comb(int a, int b) {\n//\tif (a < 0 || b < 0 || a < b)return 0;\n//\treturn fact[a] * factinv[b] * factinv[a - b];\n//}\n\nvector<int> b[501];\nint n;\n\nvoid normalize(vector<P> &v) {\n\tvector<P> res;\n\tsort(all(v), greater<P>());\n\tfor (P p : v) {\n\t\tif (res.size() && p.second <= res.back().second)continue;\n\t\tres.push_back(p);\n\t}\n\tswap(v, res);\n}\nvoid solve() {\n\trep1(i, 500)b[i].clear();\n\tvector<int> a(n);\n\trep(i, n) {\n\t\tcin >> a[i];\n\t\tint cop = a[i];\n\t\tint tmp = 0;\n\t\twhile (cop % 2 == 0) {\n\t\t\tcop /= 2; tmp++;\n\t\t}\n\t\tb[cop].push_back(tmp);\n\t}\n\tint ans = 0;\n\trep1(i, 500) {\n\t\tif (b[i].empty())continue;\n\t\tvector<int> dp((1 << 18)+1,-mod);\n\t\tdp[0] = 0;\n\t\tfor (int t : b[i]) {\n\t\t\tper(j, (1 << (18 - t))) {\n\t\t\t\tint tj = j << t;\n\t\t\t\tint nj = tj + (1 << t);\n\t\t\t\tdp[nj] = max(dp[nj], dp[tj] + 1);\n\t\t\t}\n\t\t}\n\t\trep(j, 19) {\n\t\t\tans = max(ans, dp[1 << j]);\n\t\t}\n\t}\n\n\tcout << ans << endl;\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\t//cout << fixed << setprecision(12);\n\t//init_f();\n\t//int t; cin >> t; rep(i, t)solve();\n\twhile(cin>>n,n)solve();\n\tstop\n\t\treturn 0;\n}","accuracy":1,"time_ms":6200,"memory_kb":4224,"score_of_the_acc":-1.0556,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_1343_10853732\",\n \"code_snippet\": \"#include<map>\\n#include<set>\\n#include<cmath>\\n#include<queue>\\n#include<cctype>\\n#include<cstdio>\\n#include<vector>\\n#include<cstdlib>\\n#include<cstring>\\n#include<algorithm>\\ntypedef long long LL;\\n#define MAXN 1010\\nconst int mt = 131072;\\nint a[MAXN], b[MAXN], len[MAXN], f[mt + 10], N, M;\\nint process() {\\n\\tmemset(f, -1, sizeof(f));\\n\\tf[0] = 0;\\n\\tfor(int i = 0; i < N; i ++) {\\n\\t\\tint l = len[i];\\n\\t\\tif(l > 0) {\\n\\t\\t\\tfor(int j = mt; j > 0; j -= l) {\\n\\t\\t\\t\\tif(f[j - l] > -1 && f[j - l] + 1 > f[j]) {\\n\\t\\t\\t\\t\\tf[j] = f[j - l] + 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tfor(int i = mt; i > 0; i >>= 1) {\\n\\t\\tif(f[i] != -1) {\\n\\t\\t\\tans = std::max(ans, f[i]);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\nint main() {\\n\\t//freopen(\\\"test.in\\\", \\\"rb\\\", stdin);\\n\\twhile(scanf(\\\"%d\\\", &N), N) {\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &a[i]);\\n\\t\\t\\tb[i] = a[i];\\n\\t\\t}\\n\\t\\tstd::sort(b, b + N);\\n\\t\\tM = std::unique(b, b + N) - b;\\n\\t\\tint ans = 0;\\n\\t\\tfor(int i = 0; i < M; i ++) {\\n\\t\\t\\tint v = b[i];\\n\\t\\t\\tfor(int j = 0; j < N; j ++) {\\n\\t\\t\\t\\tlen[j] = 0;\\n\\t\\t\\t\\tint x = a[j];\\n\\t\\t\\t\\tif(x % v == 0) {\\n\\t\\t\\t\\t\\tx /= v;\\n\\t\\t\\t\\t\\tint l = 1;\\n\\t\\t\\t\\t\\twhile((x & 1) == 0) {\\n\\t\\t\\t\\t\\t\\tx >>= 1, l <<= 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(x == 1) {\\n\\t\\t\\t\\t\\t\\tlen[j] = l;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans = std::max(ans, process());\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3390,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.4723,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1343_10352657\",\n \"code_snippet\": \"#ifndef LOCAL\\n#pragma GCC optimize (\\\"Ofast\\\")\\n#pragma GCC optimize (\\\"unroll-loops\\\")\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\nbool dbg=false;\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#define si(x) int(x.size())\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\\ntemplate<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\nusing vvi=vc<vc<int>>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\n#define mp make_pair\\n#define mt make_tuple\\n#define one(x) memset(x,-1,sizeof(x))\\n#define zero(x) memset(x,0,sizeof(x))\\n#ifdef LOCAL\\nvoid dmpr(ostream&os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" \\\";\\n\\tdmpr(os,args...);\\n}\\n#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)\\n#else\\n#define dmp2(...) void(0)\\n#endif\\n\\nusing uint=unsigned;\\nusing ull=unsigned long long;\\n\\ntemplate<class t,size_t n>\\nostream& operator<<(ostream&os,const array<t,n>&a){\\n\\treturn os<<vc<t>(all(a));\\n}\\n\\nll rand_int(ll l, ll r) { //[l, r]\\n\\t//#ifdef LOCAL\\n\\tstatic mt19937_64 gen;\\n\\t/*#else\\n\\tstatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n\\t#endif*/\\n\\treturn uniform_int_distribution<ll>(l, r)(gen);\\n}\\n\\nll rand_int(ll k){ //[0,k)\\n\\treturn rand_int(0,k-1);\\n}\\nstring rand_string(int n,char lw,char up){\\n\\tstring s(n,'?');\\n\\trep(i,n)s[i]=rand_int(lw,up);\\n\\treturn s;\\n}\\n\\nint current_run_id,run_batch_size=1000;\\nint calc_random_limit(){\\n\\treturn current_run_id/run_batch_size+1;\\n}\\ntemplate<class t>\\nvoid generate_single(t&a){\\n\\ta=rand_int(1,calc_random_limit());\\n}\\nvoid generate_single(string&a){\\n\\tint n;generate_single(n);\\n\\ta=rand_string(n,'a','b');\\n}\\ntemplate<class t,class u>\\nvoid generate_single(pair<t,u>&a){\\n\\tgenerate_single(a.a);\\n\\tgenerate_single(a.b);\\n}\\n//https://trap.jp/post/1224/\\ntemplate<class... Args>\\nvoid input(Args&... a){\\n\\tif(dbg){\\n\\t\\t(generate_single(a),...);\\n\\t}else{\\n\\t\\t#ifdef USE_FAST_IO\\n\\t\\tsc.read(a...);\\n\\t\\t#else\\n\\t\\t(cin >> ... >> a);\\n\\t\\t#endif\\n\\t}\\n}\\n#define INT(...) int __VA_ARGS__;input(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;input(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;input(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;input(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;input(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;input(__VA_ARGS__)\\n#define overload3(a,b,c,d,...) d\\n#define VI2(name,size) vi name(size);rep(i_##name,size)input(name[i_##name]);\\n#define VI3(name,size,offset) vi name(size);rep(i_##name,size)input(name[i_##name]),name[i_##name]+=offset;\\n#define VI(...) overload3(__VA_ARGS__,VI3,VI2)(__VA_ARGS__)\\n#define VPI(name,size) vc<pi> name(size);rep(i_##name,size)input(name[i_##name].a,name[i_##name].b);\\n#define VVI(name,sizeN,sizeM) vvi name(sizeN,vi(sizeM));\\\\\\nrep(i_##name,sizeN)rep(j_##name,sizeM)input(name[i_##name][j_##name]);\\n#define VS(name,size) vc<string> name(size);rep(i_##name,size)input(name[i_##name]);\\n#define VMI(name,size) vc<mint> name(size);rep(i_##name,size){INT(tmp_##name);name[i_##name]=tmp_##name;};\\n\\n#define overload5(a,b,c,d,e,f,...) f\\n#define VVC4(type,name,sizeN,sizeM) vvc<type> name(sizeN,vc<type>(sizeM));\\n#define VVC5(type,name,sizeN,sizeM,ini) vvc<type> name(sizeN,vc<type>(sizeM,ini));\\n#define VVC(...) overload5(__VA_ARGS__,VVC5,VVC4)(__VA_ARGS__)\\n\\ntemplate<class T>\\nT vvvc(T v){\\n\\treturn v;\\n}\\n\\ntemplate<class T,class...Args>\\nauto vvvc(int n,T v,Args...args){\\n\\treturn vector(n,vvvc(v,args...));\\n}\\n\\ntemplate<int i,class T>\\nvoid print_tuple(ostream&,const T&){\\n}\\n\\ntemplate<int i,class T,class H,class ...Args>\\nvoid print_tuple(ostream&os,const T&t){\\n\\tif(i)os<<\\\",\\\";\\n\\tos<<get<i>(t);\\n\\tprint_tuple<i+1,T,Args...>(os,t);\\n}\\n\\ntemplate<class ...Args>\\nostream& operator<<(ostream&os,const tuple<Args...>&t){\\n\\tos<<\\\"{\\\";\\n\\tprint_tuple<0,tuple<Args...>,Args...>(os,t);\\n\\treturn os<<\\\"}\\\";\\n}\\n\\nvoid printsuc(int suc){\\n\\t#ifdef USE_FAST_IO\\n\\t\\tif(suc==1)pr.write('\\\\n');\\n\\t\\tif(suc==2)pr.write(' ');\\n\\t#else\\n\\t\\tif(suc==1){\\n\\t\\t\\tif(dbg)cout<<endl;\\n\\t\\t\\telse{\\n\\t\\t\\t\\t#ifdef LOCAL\\n\\t\\t\\t\\tcout<<endl;\\n\\t\\t\\t\\t#else\\n\\t\\t\\t\\tcout<<\\\"\\\\n\\\";\\n\\t\\t\\t\\t#endif\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(suc==2)\\n\\t\\t\\tcout<<\\\" \\\";\\n\\t#endif\\n}\\n\\ntemplate<class t>\\nvoid print_single(t x,int suc=1){\\n\\t#ifdef USE_FAST_IO\\n\\tpr.write(x);\\n\\t#else\\n\\tcout<<x;\\n\\t#endif\\n\\tprintsuc(suc);\\n}\\n\\ntemplate<class t,class u>\\nvoid print_single(const pair<t,u>&p,int suc=1){\\n\\tprint_single(p.a,2);\\n\\tprint_single(p.b,suc);\\n}\\n\\ntemplate<class T>\\nvoid print_single(const vector<T>&v,int suc=1){\\n\\trep(i,v.size())\\n\\t\\tprint_single(v[i],i==int(v.size())-1?3:2);\\n\\tprintsuc(suc);\\n}\\n\\ntemplate<class T,size_t N>\\nvoid print_single(const array<T,N>&v,int suc=1){\\n\\trep(i,N)\\n\\t\\tprint_single(v[i],i==int(N)-1?3:2);\\n\\tprintsuc(suc);\\n}\\n\\ntemplate<class T>\\nvoid print(const T&t){\\n\\tprint_single(t);\\n}\\n\\ntemplate<class T,class ...Args>\\nvoid print(const T&t,const Args&...args){\\n\\tprint_single(t,2);\\n\\tprint(args...);\\n}\\n\\ntemplate<class T>\\nvoid printvv(const vvc<T>&vs){\\n\\tfor(const auto&row:vs)print(row);\\n}\\n\\nstring readString(){\\n\\tstring s;\\n\\tcin>>s;\\n\\treturn s;\\n}\\n\\ntemplate<class T>\\nT sq(const T& t){\\n\\treturn t*t;\\n}\\n\\nvoid YES(bool ex=true){\\n\\tcout<<\\\"YES\\\\n\\\";\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid NO(bool ex=true){\\n\\tcout<<\\\"NO\\\\n\\\";\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid Yes(bool ex=true){\\n\\tcout<<\\\"Yes\\\\n\\\";\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid No(bool ex=true){\\n\\tcout<<\\\"No\\\\n\\\";\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\n//#define CAPITAL\\n/*\\nvoid yes(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid no(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}*/\\nvoid possible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"POSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Possible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\nvoid impossible(bool ex=true){\\n\\t#ifdef CAPITAL\\n\\tcout<<\\\"IMPOSSIBLE\\\"<<\\\"\\\\n\\\";\\n\\t#else\\n\\tcout<<\\\"Impossible\\\"<<\\\"\\\\n\\\";\\n\\t#endif\\n\\tif(ex)exit(0);\\n\\t#ifdef LOCAL\\n\\tcout.flush();\\n\\t#endif\\n}\\n\\nconstexpr ll ten(int n){\\n\\treturn n==0?1:ten(n-1)*10;\\n}\\n\\nconst ll infLL=LLONG_MAX/3;\\n\\n#ifdef int\\nconst int inf=infLL;\\n#else\\nconst int inf=INT_MAX/2-100;\\n#endif\\n\\nint topbit(signed t){\\n\\treturn t==0?-1:31-__builtin_clz(t);\\n}\\nint topbit(ll t){\\n\\treturn t==0?-1:63-__builtin_clzll(t);\\n}\\nint topbit(ull t){\\n\\treturn t==0?-1:63-__builtin_clzll(t);\\n}\\nint botbit(signed a){\\n\\treturn a==0?32:__builtin_ctz(a);\\n}\\nint botbit(ll a){\\n\\treturn a==0?64:__builtin_ctzll(a);\\n}\\nint botbit(ull a){\\n\\treturn a==0?64:__builtin_ctzll(a);\\n}\\nint popcount(signed t){\\n\\treturn __builtin_popcount(t);\\n}\\nint popcount(ll t){\\n\\treturn __builtin_popcountll(t);\\n}\\nint popcount(ull t){\\n\\treturn __builtin_popcountll(t);\\n}\\nint bitparity(ll t){\\n\\treturn __builtin_parityll(t);\\n}\\nbool ispow2(int i){\\n\\treturn i&&(i&-i)==i;\\n}\\nll mask(int i){\\n\\treturn (ll(1)<<i)-1;\\n}\\null umask(int i){\\n\\treturn (ull(1)<<i)-1;\\n}\\nll minp2(ll n){\\n\\tif(n<=1)return 1;\\n\\telse return ll(1)<<(topbit(n-1)+1);\\n}\\n\\nbool inc(int a,int b,int c){\\n\\treturn a<=b&&b<=c;\\n}\\n\\ntemplate<class S> void mkuni(S&v){\\n\\tsort(all(v));\\n\\tv.erase(unique(all(v)),v.ed);\\n}\\n\\ntemplate<class t> bool isuni(vc<t> v){\\n\\tint s=si(v);\\n\\tmkuni(v);\\n\\treturn si(v)==s;\\n}\\n\\nbool isperm(const vi&p){\\n\\tint n=si(p);\\n\\tvc<bool> used(n);\\n\\tfor(auto v:p){\\n\\t\\tif(!inc(0,v,n-1))return false;\\n\\t\\tif(used[v])return false;\\n\\t\\tused[v]=true;\\n\\t}\\n\\treturn true;\\n}\\n\\ntemplate<class t>\\nvoid myshuffle(vc<t>&a){\\n\\trep(i,si(a))swap(a[i],a[rand_int(0,i)]);\\n}\\n\\ntemplate<class S,class u>\\nint lwb(const S&v,const u&a){\\n\\treturn lower_bound(all(v),a)-v.bg;\\n}\\ntemplate<class t,class u>\\nbool bis(const vc<t>&v,const u&a){\\n\\treturn binary_search(all(v),a);\\n}\\n\\n//VERIFY: yosupo\\n//KUPC2017J\\n//AOJDSL1A\\n//without rank\\nstruct unionfind{\\n\\tvi p,s;\\n\\tint c;\\n\\tunionfind(int n):p(n,-1),s(n,1),c(n){}\\n\\tvoid clear(){\\n\\t\\tfill(all(p),-1);\\n\\t\\tfill(all(s),1);\\n\\t\\tc=si(p);\\n\\t}\\n\\tint find(int a){\\n\\t\\treturn p[a]==-1?a:(p[a]=find(p[a]));\\n\\t}\\n\\t//set b to a child of a\\n\\tbool unite(int a,int b){\\n\\t\\ta=find(a);\\n\\t\\tb=find(b);\\n\\t\\tif(a==b)return false;\\n\\t\\tp[b]=a;\\n\\t\\ts[a]+=s[b];\\n\\t\\tc--;\\n\\t\\treturn true;\\n\\t}\\n\\tbool same(int a,int b){\\n\\t\\treturn find(a)==find(b);\\n\\t}\\n\\tint sz(int a){\\n\\t\\treturn s[find(a)];\\n\\t}\\n};\\n\\nvvc<int> readGraph(int n,int m){\\n\\tvvc<int> g(n);\\n\\trep(i,m){\\n\\t\\tint a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\t//sc.read(a,b);\\n\\t\\ta--;b--;\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nvvc<int> initUG(int n,const vc<pi>&es){\\n\\tvvc<int> g(n);\\n\\tfor(auto [a,b]:es){\\n\\t\\tg[a].pb(b);\\n\\t\\tg[b].pb(a);\\n\\t}\\n\\treturn g;\\n}\\n\\nvvc<int> rand_tree(int n){\\n\\tvvc<int> t(n);\\n\\tunionfind uf(n);\\n\\twhile(uf.c>1){\\n\\t\\tint a=rand_int(n);\\n\\t\\tint b=rand_int(n);\\n\\t\\tif(uf.unite(a,b)){\\n\\t\\t\\tt[a].pb(b);\\n\\t\\t\\tt[b].pb(a);\\n\\t\\t}\\n\\t}\\n\\treturn t;\\n}\\n\\nvvc<int> readTree(int n){\\n\\tif(dbg){\\n\\t\\treturn rand_tree(n);\\n\\t}else{\\n\\t\\treturn readGraph(n,n-1);\\n\\t}\\n}\\n\\nvi readRooted(int n){\\n\\tassert(!dbg);\\n\\tvi par(n,-1);\\n\\trng(i,1,n){\\n\\t\\tinput(par[i]);\\n\\t\\tpar[i]--;\\n\\t\\tassert(inc(0,par[i],i-1));\\n\\t}\\n\\treturn par;\\n}\\n\\nvoid printTree(const vvc<int> t){\\n\\tint n=si(t);\\n\\tint degsum=0;\\n\\trep(i,n)degsum+=si(t[i]);\\n\\tif(degsum==n-1){\\n\\t\\t//directed\\n\\t\\trep(i,si(t))for(auto j:t[i]){\\n\\t\\t\\tprint(i+1,j+1);\\n\\t\\t}\\n\\t}else if(degsum==2*(n-1)){\\n\\t\\t//undirected\\n\\t\\trep(i,si(t))for(auto j:t[i])if(i<j){\\n\\t\\t\\tprint(i+1,j+1);\\n\\t\\t}\\n\\t}else{\\n\\t\\tassert(false);\\n\\t}\\n}\\n\\ntemplate<class t>\\nvc<t> presum(const vc<t>&a){\\n\\tvc<t> s(si(a)+1);\\n\\trep(i,si(a))s[i+1]=s[i]+a[i];\\n\\treturn s;\\n}\\nvc<ll> presum(const vi&a){\\n\\tvc<ll> s(si(a)+1);\\n\\trep(i,si(a))s[i+1]=s[i]+a[i];\\n\\treturn s;\\n}\\n//BIT で数列を管理するときに使う (CF850C)\\ntemplate<class t>\\nvc<t> predif(vc<t> a){\\n\\tgnr(i,1,si(a))a[i]-=a[i-1];\\n\\treturn a;\\n}\\ntemplate<class t>\\nvvc<ll> imos(const vvc<t>&a){\\n\\tint n=si(a),m=si(a[0]);\\n\\tvvc<ll> b(n+1,vc<ll>(m+1));\\n\\trep(i,n)rep(j,m)\\n\\t\\tb[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];\\n\\treturn b;\\n}\\n\\n//verify してないや\\nvoid transvvc(int&n,int&m){\\n\\tswap(n,m);\\n}\\ntemplate<class t,class... Args>\\nvoid transvvc(int&n,int&m,vvc<t>&a,Args&...args){\\n\\tassert(si(a)==n);\\n\\tvvc<t> b(m,vi(n));\\n\\trep(i,n){\\n\\t\\tassert(si(a[i])==m);\\n\\t\\trep(j,m)b[j][i]=a[i][j];\\n\\t}\\n\\ta.swap(b);\\n\\ttransvvc(n,m,args...);\\n}\\n//CF854E\\nvoid rotvvc(int&n,int&m){\\n\\tswap(n,m);\\n}\\ntemplate<class t,class... Args>\\nvoid rotvvc(int&n,int&m,vvc<t>&a,Args&...args){\\n\\tassert(si(a)==n);\\n\\tvvc<t> b(m,vi(n));\\n\\trep(i,n){\\n\\t\\tassert(si(a[i])==m);\\n\\t\\trep(j,m)b[m-1-j][i]=a[i][j];\\n\\t}\\n\\ta.swap(b);\\n\\trotvvc(n,m,args...);\\n}\\n\\n//ソートして i 番目が idx[i]\\n//CF850C\\ntemplate<class t>\\nvi sortidx(const vc<t>&a){\\n\\tint n=si(a);\\n\\tvi idx(n);iota(all(idx),0);\\n\\tsort(all(idx),[&](int i,int j){return a[i]<a[j];});\\n\\treturn idx;\\n}\\n//vs[i]=a[idx[i]]\\n//例えば sortidx で得た idx を使えば単にソート列になって返ってくる\\n//CF850C\\ntemplate<class t>\\nvc<t> a_idx(const vc<t>&a,const vi&idx){\\n\\tint n=si(a);\\n\\tassert(si(idx)==n);\\n\\tvc<t> vs(n);\\n\\trep(i,n)vs[i]=a[idx[i]];\\n\\treturn vs;\\n}\\n//CF850C\\nvi invperm(const vi&p){\\n\\tint n=si(p);\\n\\tvi q(n);\\n\\trep(i,n)q[p[i]]=i;\\n\\treturn q;\\n}\\n\\ntemplate<class t,class s=t>\\ns SUM(const vc<t>&a){\\n\\treturn accumulate(all(a),s(0));\\n}\\ntemplate<class t,size_t K,class s=t>\\ns SUM(const array<t,K>&a){\\n\\treturn accumulate(all(a),s(0));\\n}\\n\\ntemplate<class t>\\nt MAX(const vc<t>&a){\\n\\treturn *max_element(all(a));\\n}\\n\\ntemplate<class t>\\npair<t,int> MAXi(const vc<t>&a){\\n\\tauto itr=max_element(all(a));\\n\\treturn mp(*itr,itr-a.bg);\\n}\\n\\ntemplate<class A>\\nauto MIN(const A&a){\\n\\treturn *min_element(all(a));\\n}\\n\\ntemplate<class t>\\npair<t,int> MINi(const vc<t>&a){\\n\\tauto itr=min_element(all(a));\\n\\treturn mp(*itr,itr-a.bg);\\n}\\n\\nvi vid(int n){\\n\\tvi res(n);iota(all(res),0);\\n\\treturn res;\\n}\\n\\ntemplate<class S>\\nvoid soin(S&s){\\n\\tsort(all(s));\\n}\\n\\ntemplate<class S,class F>\\nvoid soin(S&s,F&&f){\\n\\tsort(all(s),forward<F>(f));\\n}\\n\\ntemplate<class S>\\nS soout(S s){\\n\\tsoin(s);\\n\\treturn s;\\n}\\n\\ntemplate<class S>\\nvoid rein(S&s){\\n\\treverse(all(s));\\n}\\n\\ntemplate<class S>\\nS reout(S s){\\n\\trein(s);\\n\\treturn s;\\n}\\n\\ntemplate<class t,class u>\\npair<t,u>&operator+=(pair<t,u>&a,pair<t,u> b){\\n\\ta.a+=b.a;a.b+=b.b;return a;}\\ntemplate<class t,class u>\\npair<t,u>&operator-=(pair<t,u>&a,pair<t,u> b){\\n\\ta.a-=b.a;a.b-=b.b;return a;}\\ntemplate<class t,class u>\\npair<t,u> operator+(pair<t,u> a,pair<t,u> b){return mp(a.a+b.a,a.b+b.b);}\\ntemplate<class t,class u>\\npair<t,u> operator-(pair<t,u> a,pair<t,u> b){return mp(a.a-b.a,a.b-b.b);}\\ntemplate<class t,class u,class v>\\npair<t,u>&operator*=(pair<t,u>&a,v b){\\n\\ta.a*=b;a.b*=b;return a;}\\ntemplate<class t,class u,class v>\\npair<t,u> operator*(pair<t,u> a,v b){return a*=b;}\\ntemplate<class t,class u>\\npair<t,u> operator-(pair<t,u> a){return mp(-a.a,-a.b);}\\nnamespace std{\\ntemplate<class t,class u>\\nistream&operator>>(istream&is,pair<t,u>&a){\\n\\treturn is>>a.a>>a.b;\\n}\\n}\\n\\ntemplate<class t,size_t n>\\narray<t,n>&operator+=(array<t,n>&a,const array<t,n>&b){\\n\\trep(i,n)a[i]+=b[i];\\n\\treturn a;\\n}\\ntemplate<class t,size_t n>\\narray<t,n>&operator-=(array<t,n>&a,const array<t,n>&b){\\n\\trep(i,n)a[i]-=b[i];\\n\\treturn a;\\n}\\ntemplate<class t,size_t n,class v>\\narray<t,n>&operator*=(array<t,n>&a,v b){\\n\\trep(i,n)a[i]*=b;\\n\\treturn a;\\n}\\ntemplate<class t,size_t n>\\narray<t,n> operator+(array<t,n> a,const array<t,n>&b){return a+=b;}\\ntemplate<class t,size_t n>\\narray<t,n> operator-(array<t,n> a,const array<t,n>&b){return a-=b;}\\ntemplate<class t,size_t n,class v>\\narray<t,n> operator*(array<t,n> a,v b){return a*=b;}\\n\\ntemplate<class t>\\nt gpp(vc<t>&vs){\\n\\tassert(si(vs));\\n\\tt res=move(vs.back());\\n\\tvs.pop_back();\\n\\treturn res;\\n}\\n\\ntemplate<class t,class u>\\nvoid pb(vc<t>&a,const vc<u>&b){\\n\\ta.insert(a.ed,all(b));\\n}\\n\\ntemplate<class t,class...Args>\\nvc<t> cat(vc<t> a,Args&&...b){\\n\\t(pb(a,forward<Args>(b)),...);\\n\\treturn a;\\n}\\n\\ntemplate<class t,class u>\\nvc<t>& operator+=(vc<t>&a,u x){\\n\\tfor(auto&v:a)v+=x;\\n\\treturn a;\\n}\\n\\ntemplate<class t,class u>\\nvc<t> operator+(vc<t> a,u x){\\n\\treturn a+=x;\\n}\\n\\ntemplate<class t>\\nvc<t>& operator+=(vc<t>&a,const vc<t>&b){\\n\\ta.resize(max(si(a),si(b)));\\n\\trep(i,si(b))a[i]+=b[i];\\n\\treturn a;\\n}\\n\\ntemplate<class t>\\nvc<t> operator+(const vc<t>&a,const vc<t>&b){\\n\\tvc<t> c(max(si(a),si(b)));\\n\\trep(i,si(a))c[i]+=a[i];\\n\\trep(i,si(b))c[i]+=b[i];\\n\\treturn c;\\n}\\n\\ntemplate<class t,class u>\\nvc<t>& operator-=(vc<t>&a,u x){\\n\\tfor(auto&v:a)v-=x;\\n\\treturn a;\\n}\\ntemplate<class t,class u>\\nvc<t> operator-(vc<t> a,u x){\\n\\treturn a-=x;\\n}\\ntemplate<class t>\\nvc<t>& operator-=(vc<t>&a,const vc<t>&b){\\n\\ta.resize(max(si(a),si(b)));\\n\\trep(i,si(b))a[i]-=b[i];\\n\\treturn a;\\n}\\n/*\\ntemplate<class t>\\nvc<t> operator-(const vc<t>&a,const vc<t>&b){\\n\\tvc<t> c(max(si(a),si(b)));\\n\\trep(i,si(a))c[i]+=a[i];\\n\\trep(i,si(b))c[i]-=b[i];\\n\\treturn c;\\n}\\n*/\\ntemplate<class t,class u>\\nvc<t>& operator*=(vc<t>&a,u x){\\n\\tfor(auto&v:a)v*=x;\\n\\treturn a;\\n}\\ntemplate<class t,class u>\\nvc<t> operator*(vc<t> a,u x){\\n\\treturn a*=x;\\n}\\n\\ntemplate<class t,class u>\\nvc<t>& operator/=(vc<t>&a,u x){\\n\\tfor(auto&v:a)v/=x;\\n\\treturn a;\\n}\\ntemplate<class t,class u>\\nvc<t> operator/(vc<t> a,u x){\\n\\treturn a/=x;\\n}\\n\\ntemplate<class t>\\nvc<t>& operator<<=(vc<t>&a,int k){\\n\\tassert(k>=0);\\n\\ta.insert(a.bg,k,t(0));\\n\\treturn a;\\n}\\ntemplate<class t>\\nvc<t> operator<<(vc<t> a,int k){\\n\\treturn a<<=k;\\n}\\n\\ntemplate<class t>\\nvc<t>& operator>>=(vc<t>&a,int k){\\n\\tif(si(a)<=k)a.clear();\\n\\telse a.erase(a.bg,a.bg+k);\\n\\treturn a;\\n}\\ntemplate<class t>\\nvc<t> operator>>(vc<t> a,int k){\\n\\treturn a>>=k;\\n}\\n\\n//消した要素の個数を返してくれる\\n//not verified\\ntemplate<class t,class u>\\nint remval(vc<t>&a,const u&v){\\n\\tauto itr=remove(all(a),v);\\n\\tint res=a.ed-itr;\\n\\ta.erase(itr,a.ed);\\n\\treturn res;\\n}\\n//消した要素の個数を返してくれる\\n//UCUP 2-8-F\\ntemplate<class t,class F>\\nint remif(vc<t>&a,F f){\\n\\tauto itr=remove_if(all(a),f);\\n\\tint res=a.ed-itr;\\n\\ta.erase(itr,a.ed);\\n\\treturn res;\\n}\\ntemplate<class t>\\nvoid rempos(vc<t>&a,int i){\\n\\tassert(inc(0,i,si(a)-1));\\n\\ta.erase(a.bg+i);\\n}\\n\\ntemplate<class VS,class u>\\nvoid fila(VS&vs,const u&a){\\n\\tfill(all(vs),a);\\n}\\n\\ntemplate<class t,class u>\\nint findid(const vc<t>&vs,const u&a){\\n\\tauto itr=find(all(vs),a);\\n\\tif(itr==vs.ed)return -1;\\n\\telse return itr-vs.bg;\\n}\\n\\ntemplate<class t>\\nvoid rtt(vc<t>&vs,int i){\\n\\trotate(vs.bg,vs.bg+i,vs.ed);\\n}\\n\\n//Multiuni2023-8 C\\n//f(lw)=false,...,f(n-1)=false,f(n)=true,...,f(up)=true,\\n//のときに n を返す\\ntemplate<class F>\\nint find_min_true(int lw,int up,F f){\\n\\twhile(up-lw>1){\\n\\t\\tconst int mid=(lw+up)/2;\\n\\t\\tif(f(mid))up=mid;\\n\\t\\telse lw=mid;\\n\\t}\\n\\treturn up;\\n}\\n//f(lw)=true,f(up)=false\\ntemplate<class F>\\nint find_max_true(int lw,int up,F f){\\n\\twhile(up-lw>1){\\n\\t\\tconst int mid=(lw+up)/2;\\n\\t\\tif(f(mid))lw=mid;\\n\\t\\telse up=mid;\\n\\t}\\n\\treturn lw;\\n}\\n\\ntemplate<class t> using pqmin=priority_queue<t,vc<t>,greater<t>>;\\ntemplate<class t> using pqmax=priority_queue<t>;\\nusing T=tuple<int,int,int>;\\n\\nint sub(vi a){\\n\\tint n=si(a);\\n\\tint s=0;\\n\\trep(i,n)s+=1<<a[i];\\n\\tvi dp(s+1,-inf);\\n\\tdp[0]=0;\\n\\trep(i,n){\\n\\t\\tper(v,s+1)if(dp[v]>=0){\\n\\t\\t\\tif((v&mask(a[i]))==0){\\n\\t\\t\\t\\tchmax(dp[v+(1<<a[i])],dp[v]+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint res=0;\\n\\trng(v,1,s+1)if(ispow2(v))chmax(res,dp[v]);\\n\\treturn res;\\n}\\n\\nvoid slv(){\\n\\tINT(n);\\n\\tif(n==0)exit(0);\\n\\tVI(a,n);\\n\\tmap<int,vi> buf;\\n\\trep(i,n){\\n\\t\\tint t=botbit(a[i]);\\n\\t\\tbuf[a[i]>>t].pb(t);\\n\\t}\\n\\tint ans=0;\\n\\tfor(auto [key,val]:buf)\\n\\t\\tchmax(ans,sub(val));\\n\\tprint(ans);\\n}\\n\\nsigned main(signed argc,char*argv[]){\\n\\tif(argc>1&&strcmp(argv[1],\\\"D\\\")==0)dbg=true;\\n\\t\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tif(dbg){\\n\\t\\twhile(1){\\n\\t\\t\\tif(current_run_id%run_batch_size==0){\\n\\t\\t\\t\\tcerr<<\\\"Current Run \\\"<<current_run_id<<endl;\\n\\t\\t\\t}\\n\\t\\t\\tslv();\\n\\t\\t\\tcurrent_run_id++;\\n\\t\\t}\\n\\t}else{\\n\\t\\t//INT(t);rep(_,t)\\n\\t\\twhile(1)slv();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 4440,\n \"score_of_the_acc\": -0.308,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1343_9988682\",\n \"code_snippet\": \"// GYM102014I Hidden Tree\\n#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <cstring>\\n#define ll long long\\n#define rep(i, s, t) for(int i=s; i<=t; ++i)\\n#define debug(x) cerr<<#x<<\\\":\\\"<<x<<endl;\\nconst int N=1005, M=1000010, inf=0x3f3f3f3f;\\nusing namespace std;\\nchar buf[1<<23], *p1=buf, *p2=buf;\\n#define gc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\\ninline int read()\\n{\\n int x=0, f=1; char c=gc();\\n while(c<'0' || c>'9') c=='-' && (f=-1), c=gc();\\n while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0', c=gc();\\n return x*f;\\n}\\n\\nint n, a[N], b[N], res;\\ninline void upd(int &x, int y) {x=x>y?x:y;}\\nvector<int> vec[N];\\nint f[M], sum;\\nvoid solve(vector<int> &a)\\n{\\n memset(f, -0x3f, sizeof f); f[0]=0;\\n sum=0;\\n for(int x:a)\\n {\\n sum+=x;\\n // for(int s=sum; s>=x; s--)\\n // {\\n // int lo=s&-s;\\n // if(!s || lo>=x) upd(f[s], f[s-x]+1);\\n // }\\n for(int s=sum/x*x; s>=x; s-=x)\\n upd(f[s], f[s-x]+1);\\n }\\n for(int s=1; s<=sum; s<<=1) upd(res, f[s]);\\n}\\n\\nvoid solve()\\n{\\n res=0;\\n rep(i, 1, 500) vec[i].clear();\\n rep(i, 1, n) a[i]=read(), b[i]=1;\\n rep(i, 1, n)\\n {\\n while(!(a[i]&1)) b[i]<<=1, a[i]>>=1;\\n vec[a[i]].push_back(b[i]);\\n }\\n rep(i, 1, 500) if(vec[i].size()) solve(vec[i]);\\n printf(\\\"%d\\\\n\\\", res);\\n}\\n\\nint main()\\n{\\n#ifdef Jerrywang\\n freopen(\\\"E:/OI/in.txt\\\", \\\"r\\\", stdin); ios::sync_with_stdio(0);\\n#endif\\n while(n=read(), n) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 7552,\n \"score_of_the_acc\": -0.9985,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1343_9988655\",\n \"code_snippet\": \"// GYM102014I Hidden Tree\\n#include <cstdio>\\n#include <iostream>\\n#include <vector>\\n#include <cstring>\\n#define ll long long\\n#define rep(i, s, t) for(int i=s; i<=t; ++i)\\n#define debug(x) cerr<<#x<<\\\":\\\"<<x<<endl;\\nconst int N=1005, M=1000010, inf=0x3f3f3f3f;\\nusing namespace std;\\nchar buf[1<<23], *p1=buf, *p2=buf;\\n#define gc() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)\\ninline int read()\\n{\\n int x=0, f=1; char c=gc();\\n while(c<'0' || c>'9') c=='-' && (f=-1), c=gc();\\n while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0', c=gc();\\n return x*f;\\n}\\n\\nint n, a[N], b[N], res;\\ninline void upd(int &x, int y) {x=x>y?x:y;}\\nvector<int> vec[N];\\nint f[M], sum;\\nvoid solve(vector<int> &a)\\n{\\n memset(f, -0x3f, sizeof f); f[0]=0;\\n sum=0;\\n for(int x:a)\\n {\\n sum+=x;\\n for(int s=sum; s>=x; s--)\\n {\\n int lo=s&-s;\\n if(!s || lo>=x) upd(f[s], f[s-x]+1);\\n }\\n }\\n for(int s=1; s<=sum; s<<=1) upd(res, f[s]);\\n}\\n\\nvoid solve()\\n{\\n res=0;\\n rep(i, 1, 500) vec[i].clear();\\n rep(i, 1, n) a[i]=read(), b[i]=1;\\n rep(i, 1, n)\\n {\\n while(!(a[i]&1)) b[i]<<=1, a[i]>>=1;\\n vec[a[i]].push_back(b[i]);\\n }\\n rep(i, 1, 500) if(vec[i].size()) solve(vec[i]);\\n printf(\\\"%d\\\\n\\\", res);\\n}\\n\\nint main()\\n{\\n#ifdef Jerrywang\\n freopen(\\\"E:/OI/in.txt\\\", \\\"r\\\", stdin); ios::sync_with_stdio(0);\\n#endif\\n while(n=read(), n) solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 7612,\n \"score_of_the_acc\": -1.0671,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1343_9628315\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i64 = int64_t;\\nusing u64 = uint64_t;\\n\\nvoid solve(int n) {\\n if (!n) exit(0);\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int ans = 0, sum = accumulate(a.begin(), a.end(), 0);\\n for (int mul = 1; mul < 500; mul += 2) {\\n int w = 1;\\n while (w * mul <= sum) w *= 2;\\n vector<int> dp(w + 1, 0);\\n for (int i = 0; i < n; i++) {\\n if (a[i] % mul) continue;\\n int x = a[i] / mul;\\n if (x != (x & -x)) continue;\\n for (int j = w - x; j > 0; j -= x) {\\n if (dp[j]) dp[j + x] = max(dp[j + x], dp[j] + 1);\\n }\\n dp[x] = max(dp[x], 1);\\n }\\n for (int i = 1; i < w; i *= 2) {\\n ans = max(ans, dp[i]);\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\n// Make bold hypotheses and verify carefully\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n int n;\\n while (cin >> n) {\\n solve(n);\\n };\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 6024,\n \"score_of_the_acc\": -0.6579,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1343_9278055\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i, a, b) for(ll i = a; i < b; i++)\\n#define all(x) (x).begin(), (x).end()\\n\\ntemplate<typename T>\\nvoid print(const vector<T>& a){\\n for(auto x:a)cout<<x<<\\\" \\\";\\n cout<<endl;\\n}\\n\\nint dp[1<<18];\\n\\nint solve(const vector<int>& a) {\\n const int n = a.size();\\n memset(dp, -1, sizeof(dp));\\n dp[0]=0;\\n rep(i,0,n){\\n for(int S=(1<<18)-1; S>=0; --S){\\n if(dp[S]!=-1 && (S&((1<<a[i])-1)) == 0){\\n int nS = S+(1<<a[i]);\\n dp[nS] = max(dp[nS], dp[S] + 1);\\n }\\n }\\n }\\n int ans = 0;\\n rep(k,0,18) ans = max(ans, dp[1<<k]);\\n return ans;\\n}\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n if (n == 0) break;\\n vector<int> a(n);\\n for (auto& x : a) cin >> x;\\n\\n vector<vector<int>> as(500);\\n rep(i,0,n){\\n int k=0;\\n while (a[i] % 2 == 0) {\\n a[i]/=2;\\n ++k;\\n }\\n as[a[i]].push_back(k);\\n }\\n\\n int ans = 0;\\n rep(a,0,500)if(!as[a].empty()){\\n ans = max(ans, solve(as[a]));\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7010,\n \"memory_kb\": 4496,\n \"score_of_the_acc\": -1.24,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1343_8693986\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i, n) for(int i = 0; i < (n); ++i)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<int> vi;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, int> pli;\\ntypedef pair<ll, ll> pll;\\ntypedef array<int, 3> ai3;\\nconst int inf = 0x3f3f3f3f;\\nconst int Mod = 998244353;\\nconst int inv2 = (Mod+1) / 2;\\nint sign(int a){ return (a&1) ? (Mod-1) : 1; }\\nvoid uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }\\nvoid usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }\\nvoid umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }\\nint add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }\\nint sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }\\nint mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }\\nint qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }\\nconst int fN = 10010;\\nint fact[fN], invfact[fN], inv[fN];\\nvoid initfact(int n){\\n\\tfact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);\\n\\tinvfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);\\n\\tfor(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);\\n}\\nint binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }\\nconst double pi = acos(-1);\\nvoid chmax(int &a, int b){ (b>a) ? (a=b) : 0; }\\nvoid chmin(int &a, int b){ (b<a) ? (a=b) : 0; }\\n\\nconst int lmt = 18;\\nint calc(vi &a){\\n\\tif(a.empty()) return 0;\\n\\t//cout << \\\"{\\\"; rep(i, (int)a.size()){ cout << a[i] << \\\" \\\"; } cout << \\\"}\\\\n\\\";\\n\\tstatic int dp[262626];\\n\\tfill(dp, dp + (1<<lmt), -inf);\\n\\tdp[0] = 0;\\n\\trep(i, (int)a.size()){\\n\\t\\tfor(int x = (1<<lmt) - 1; x >= 0; --x){\\n\\t\\t\\tif(dp[x] >= 0 && !(x & ((1<<a[i]) - 1)))\\n\\t\\t\\t\\tchmax(dp[x + (1<<a[i])], dp[x] + 1);\\n\\t\\t}\\n\\t}\\n\\tint ret = 0;\\n\\trep(i, lmt) chmax(ret, dp[1<<i]);\\n\\treturn ret;\\n}\\n\\nint n, a[1010];\\n\\nvi v[555];\\nvoid solve(){\\n\\trep(i, n) cin >> a[i];\\n\\trep(i, 505) v[i].clear();\\n\\trep(i, n){\\n\\t\\tint p = a[i], c = 0;\\n\\t\\tfor(; p % 2 == 0; p >>= 1, ++c);\\n\\t\\tv[p].push_back(c);\\n\\t}\\n\\tint ans = 0;\\n\\tfor(int i = 1; i <= 502; ++i)\\n\\t\\tchmax(ans, calc(v[i]));\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile(cin >> n && n)\\n\\t\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4860,\n \"memory_kb\": 4432,\n \"score_of_the_acc\": -0.911,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1343_8334951\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nconst int inf = (1 << 30) - 1;\\n\\nint main() {\\n while (true) {\\n int N;\\n cin >> N;\\n\\n if (N == 0) break;\\n\\n vector<int> a(N);\\n rep(i, N) cin >> a[i];\\n\\n vector<int> b(N, 0);\\n rep(i, N) {\\n while (a[i] % 2 == 0) {\\n a[i] /= 2;\\n b[i]++;\\n }\\n }\\n\\n auto solve = [&](vector<int> c) {\\n int sum = 0;\\n each(e, c) sum += 1 << e;\\n int K = 1;\\n while (K * 2 <= sum) K *= 2;\\n\\n vector<int> p(K + 1, inf);\\n rep2(i, 1, K + 1) p[i] = __builtin_ctz(i);\\n\\n vector<int> dp(K + 1, -inf);\\n dp[0] = 0;\\n each(e, c) {\\n per(i, K - (1 << e) + 1) {\\n if (p[i] >= e) {\\n chmax(dp[i + (1 << e)], dp[i] + 1); //\\n }\\n }\\n }\\n\\n int ret = 0;\\n for (int i = 1; i <= K; i <<= 1) {\\n chmax(ret, dp[i]); //\\n }\\n\\n // print(c), print(dp);\\n // cout << sum MM K MM ret << '\\\\n';\\n return ret;\\n };\\n\\n int ans = 0;\\n\\n rep(i, 501) {\\n vector<int> c;\\n rep(j, N) {\\n if (a[j] == i) c.eb(b[j]);\\n }\\n if (!empty(c)) chmax(ans, solve(c));\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 4148,\n \"score_of_the_acc\": -0.2091,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1343_7244378\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nusing namespace std::chrono;\\ntypedef long long int llint;\\ntypedef long double lldo;\\n#define mp make_pair\\n#define mt make_tuple\\n#define pub push_back\\n#define puf push_front\\n#define pob pop_back\\n#define pof pop_front\\n#define fir first\\n#define sec second\\n#define res resize\\n#define ins insert\\n#define era erase\\n#define REP(i, n) for(int i = 0;i < (n);i++)\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst int mod=1000000007;\\nconst llint inf=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-10;\\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}\\nllint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}\\nllint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}\\ntemplate<class T> void SO(T& ve){sort(ve.begin(),ve.end());}\\ntemplate<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}\\ntemplate<class T>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\n\\nint main(void){\\n\\tstatic int dp[132000]={};\\n\\tfor(int i=0;i<132000;i++){dp[i]=-mod;}\\n\\t//131072\\n\\twhile(-1){\\n\\t\\tint n,i,j;cin>>n;\\n\\t\\tif(n==0){return 0;}\\n\\t\\tvector<int>A(n);\\n\\t\\tfor(i=0;i<n;i++){cin>>A[i];}\\n\\t\\tint ans=0;\\n\\t\\tfor(int k=1;k<=499;k++){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\tdp[0]=0;\\n\\t\\t\\tfor(i=0;i<n;i++){\\n\\t\\t\\t\\tif(A[i]%k){continue;}\\n\\t\\t\\t\\tint B=A[i]/k;\\n\\t\\t\\t\\tif(B&(B-1)){continue;}\\n\\t\\t\\t\\tfor(j=sum/B*B;j>=0;j-=B){\\n\\t\\t\\t\\t\\tchmax(dp[j+B],dp[j]+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsum+=B;\\n\\t\\t\\t\\tchmin(sum,131072);\\n\\t\\t\\t}\\n\\t\\t\\tfor(i=1;i<=131072;i*=2){\\n\\t\\t\\t\\tchmax(ans,dp[i]);\\n\\t\\t\\t}\\n\\t\\t\\tfor(i=0;i<=sum;i++){dp[i]=-mod;}\\n\\t\\t}\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.1082,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1343_7120069\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<28;\\n\\nint dp[1<<18];\\nint mi[1<<18];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n for(int j=0;j<(1<<18);j++){\\n for(int k=0;k<18;k++){\\n if(j&(1<<k)){\\n mi[j]=k;\\n break;\\n }\\n }\\n dp[j]=-INF;\\n }\\n mi[0]=INF;\\n \\n while(1){\\n int N;cin>>N;\\n if(N==0) break;\\n vector<int> A(N);\\n for(int i=0;i<N;i++) cin>>A[i];\\n \\n int ans=0;\\n \\n for(int x=1;x<=500;x+=2){\\n vector<int> use;\\n int sum=0;\\n for(int i=0;i<N;i++){\\n if(A[i]%x==0){\\n int z=A[i]/x;\\n for(int j=0;j<10;j++){\\n if((1<<j)==z){\\n use.push_back(j);\\n sum+=z;\\n }\\n }\\n }\\n }\\n \\n if(si(use)==0) continue;\\n \\n for(int j=0;j<=sum;j++) dp[j]=-INF;\\n dp[0]=0;\\n \\n for(int i=0;i<si(use);i++){\\n int x=use[i];\\n int z=sum/(1<<x);\\n for(int k=z;k>=0;k--){\\n int j=(k<<x);\\n if(dp[j]<0) continue;\\n if(mi[j]>=x){\\n chmax(dp[j+(1<<x)],dp[j]+1);\\n }\\n }\\n }\\n \\n for(int k=0;k<18;k++){\\n if((1<<k)<=sum) chmax(ans,dp[(1<<k)]);\\n }\\n }\\n \\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 5440,\n \"score_of_the_acc\": -0.5213,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1343_7120059\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<28;\\n\\nint dp[1<<18];\\nint mi[1<<18];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n for(int j=0;j<(1<<18);j++){\\n for(int k=0;k<18;k++){\\n if(j&(1<<k)){\\n mi[j]=k;\\n break;\\n }\\n }\\n }\\n mi[0]=INF;\\n \\n while(1){\\n int N;cin>>N;\\n if(N==0) break;\\n vector<int> A(N);\\n for(int i=0;i<N;i++) cin>>A[i];\\n \\n int ans=0;\\n \\n for(int x=1;x<=500;x+=2){\\n vector<int> use;\\n for(int i=0;i<N;i++){\\n if(A[i]%x==0){\\n int z=A[i]/x;\\n for(int j=0;j<10;j++){\\n if((1<<j)==z) use.push_back(j);\\n }\\n }\\n }\\n \\n if(si(use)==0) continue;\\n \\n for(int j=0;j<(1<<18);j++) dp[j]=-INF;\\n dp[0]=0;\\n \\n for(int i=0;i<si(use);i++){\\n int x=use[i];\\n int z=(1<<18)/(1<<x);\\n for(int k=z-1;k>=0;k--){\\n int j=(k<<x);\\n if(dp[j]<0) continue;\\n if(mi[j]>=x){\\n chmax(dp[j+(1<<x)],dp[j]+1);\\n }\\n }\\n //謎枝刈り\\n }\\n \\n for(int k=0;k<18;k++){\\n chmax(ans,dp[(1<<k)]);\\n }\\n }\\n \\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3030,\n \"memory_kb\": 5448,\n \"score_of_the_acc\": -0.892,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1343_7120033\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<28;\\n\\nint dp[2][1<<18];\\nint mi[1<<18];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n for(int j=0;j<(1<<18);j++){\\n for(int k=0;k<18;k++){\\n if(j&(1<<k)){\\n mi[j]=k;\\n break;\\n }\\n }\\n }\\n mi[0]=INF;\\n \\n while(1){\\n int N;cin>>N;\\n if(N==0) break;\\n vector<int> A(N);\\n for(int i=0;i<N;i++) cin>>A[i];\\n \\n int ans=0;\\n \\n for(int x=1;x<=500;x+=2){\\n vector<int> use;\\n for(int i=0;i<N;i++){\\n if(A[i]%x==0){\\n int z=A[i]/x;\\n for(int j=0;j<10;j++){\\n if((1<<j)==z) use.push_back(j);\\n }\\n }\\n }\\n \\n if(si(use)==0) continue;\\n \\n for(int i=0;i<2;i++) for(int j=0;j<(1<<18);j++) dp[i][j]=-INF;\\n dp[0][0]=0;\\n \\n for(int i=0;i<si(use);i++){\\n int s=i&1,t=s^1;\\n int x=use[i];\\n for(int j=0;j<(1<<18);j++){\\n if(dp[s][j]<0) continue;\\n if(mi[j]>=x){\\n chmax(dp[t][j+(1<<x)],dp[s][j]+1);\\n }\\n chmax(dp[t][j],dp[s][j]);\\n dp[s][j]=-INF;\\n }\\n }\\n \\n for(int k=0;k<18;k++){\\n chmax(ans,dp[si(use)&1][(1<<k)]);\\n }\\n }\\n \\n cout<<ans<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5270,\n \"memory_kb\": 6464,\n \"score_of_the_acc\": -1.4664,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1343_7118679\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n// cSpell:disable\\n/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.11.22 13:14:29 */\\n\\n#line 2 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\n#line 2 \\\"SPJ-Library/template/basic_func.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <vector>\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool flag = true) { std::cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool flag = true) { std::cout << (flag ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(const T &x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(const Head &H, const Tail &... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T value) {\\n\\tfor(auto &a : v) a += value;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\n// ceil(a / b);\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b);\\n\\tif(b < 0) {\\n\\t\\ta *= -1;\\n\\t\\tb *= -1;\\n\\t}\\n\\treturn least_upper_multiple(a, b) / b;\\n}\\n\\nlong long pow_ll(long long a, long long n) {\\n\\tassert(n >= 0LL);\\n\\tif(n == 0) return 1LL;\\n\\tif(a == 0) return 0LL;\\n\\tif(a == 1) return 1LL;\\n\\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\\n\\tlong long res = 1;\\n\\twhile(n > 1LL) {\\n\\t\\tif(n & 1LL) res *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res * a;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, const long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(const std::vector<T> &a) {\\n\\tstd::vector<T> vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(const auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n#line 1 \\\"SPJ-Library/template/header.hpp\\\"\\n#include <bits/stdc++.h>\\n#line 2 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 4 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 8 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\n#line 3 \\\"SPJ-Library/template/constants.hpp\\\"\\n\\nconstexpr int inf = 1000'000'000;\\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\\nconstexpr int mod_1000000007 = 1000000007;\\nconstexpr int mod_998244353 = 998244353;\\nconst long double pi = acosl(-1.);\\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n#line 10 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\nnamespace viewer {\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\\n\\nvoid view(const long long &e);\\n\\nvoid view(const int &e);\\n\\ntemplate <typename T>\\nvoid view(const T &e);\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v);\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m);\\n\\ntemplate <typename container_type>\\nvoid view_container(const container_type &c, bool vertically = false) {\\n\\ttypename container_type::const_iterator begin = c.begin();\\n\\tconst typename container_type::const_iterator end = c.end();\\n\\tif(vertically) {\\n\\t\\tstd::cerr << \\\"{\\\\n\\\";\\n\\t\\twhile(begin != end) {\\n\\t\\t\\tstd::cerr << '\\\\t';\\n\\t\\t\\tview(*(begin++));\\n\\t\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\t\\tstd::cerr << '\\\\n';\\n\\t\\t}\\n\\t\\tstd::cerr << '}';\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\twhile(begin != end) {\\n\\t\\tview(*(begin++));\\n\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\tstd::cerr << ' ';\\n\\t}\\n\\tstd::cerr << '}';\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << '(';\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << ')';\\n}\\n\\nvoid view(const long long &e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int &e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T &e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tview_container(vv, true);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(it->first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(it->second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\n} // namespace viewer\\n\\n// when compiling : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename T>\\nvoid debug_out(const T &x) {\\n\\tviewer::view(x);\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(const Head &H, const Tail &... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n#line 2 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\n#line 6 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#line 7 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << ' ' << p.second;\\n\\treturn os;\\n}\\n\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::cout << std::fixed << std::setprecision(15);\\n\\t\\tsrand((unsigned)time(NULL));\\n\\t}\\n} fast_io_;\\n#line 2 \\\"SPJ-Library/template/macros.hpp\\\"\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define pcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n#line 7 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\nusing namespace std;\\n#line 6 \\\"a.cpp\\\"\\nconstexpr int val_max = 512;\\nint maxval(vector<int> a) {\\n\\tconst int n = int(a.size());\\n\\tif(n == 0) return 0;\\n\\tdebug(a);\\n\\tconst int smax = accumulate(all(a), 10);\\n\\tvector<int> dp(smax, -inf);\\n\\tdp[0] = 0;\\n\\tfoa(v, a) {\\n\\t\\tauto tmp = dp;\\n\\t\\tfor(int from = 0; from + v < smax; from += v) {\\n\\t\\t\\tif(dp[from] < 0) continue;\\n\\t\\t\\tif(from == 0) {\\n\\t\\t\\t\\tdebug(from + v, from);\\n\\t\\t\\t\\tdebug(dp[from + v], dp[from]);\\n\\t\\t\\t}\\n\\t\\t\\tchmax(tmp[from + v], dp[from] + 1);\\n\\t\\t}\\n\\t\\tswap(tmp, dp);\\n\\t\\tdebug(v);\\n\\t\\trep(j, smax) {\\n\\t\\t\\tif(dp[j] > 0) {\\n\\t\\t\\t\\tdebug(j, dp[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\tfor(int i = 1; i < smax; i <<= 1) {\\n\\t\\tchmax(ans, dp[i]);\\n\\t}\\n\\tdebug(dp);\\n\\tdebug(ans);\\n\\treturn ans;\\n}\\nint solve(int n) {\\n\\tvector<int> a(n);\\n\\tfoa(t, a) cin >> t;\\n\\tvector<vector<int>> dived(val_max);\\n\\tfoa(value, a) {\\n\\t\\tint mult = 1;\\n\\t\\twhile(value % 2 == 0) {\\n\\t\\t\\tvalue /= 2;\\n\\t\\t\\tmult *= 2;\\n\\t\\t}\\n\\t\\tdived[value].push_back(mult);\\n\\t}\\n\\tint ans = 0;\\n\\tfor(auto row : dived) {\\n\\t\\tchmax(ans, maxval(row));\\n\\t}\\n\\treturn ans;\\n}\\nint main() {\\n\\tint n;\\n\\twhile(cin >> n && n) {\\n\\t\\tcout << solve(n) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 4164,\n \"score_of_the_acc\": -0.1969,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1343_6556285\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#define rep(i,a,b) for(int i = (a); i <= (b); i++)\\n#define per(i,b,a) for(int i = (b); i >= (a); i--)\\n#define N 1010\\n#define M 260000\\nusing namespace std;\\n\\nint a[N], dp[M], sum[N], n;\\nvector<int> p[N];\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n while(cin>>n && n){\\n rep(i,1,n){\\n cin>>a[i];\\n int tmp = a[i];\\n while(tmp%2 == 0) tmp /= 2;\\n p[tmp].push_back(a[i]/tmp), sum[tmp] += a[i]/tmp;\\n }\\n\\n int ans = 0;\\n rep(o,1,500) if(p[o].size()){\\n int m = p[o].size();\\n rep(i,0,sum[o]) dp[i] = -1;\\n dp[0] = 0;\\n rep(i,1,m){\\n int k = p[o][i-1];\\n for(int j = sum[o]/k*k; j >= 0; j -= k) if(~dp[j])\\n dp[j+k] = max(dp[j+k], dp[j]+1);\\n }\\n rep(k,0,17) if((1<<k) <= sum[o]) ans = max(ans, dp[1<<k]);\\n }\\n cout<<ans<<endl;\\n\\n rep(i,0,500) p[i].clear(), sum[i] = 0;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.0818,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1343_5801160\",\n \"code_snippet\": \"/*学习古代文章，诗词\\n醉翁亭记 北宋·欧阳修\\n\\n环滁皆山也。其西南诸峰，林壑尤美。望之蔚然而深秀者，琅琊也。山行六七里，渐闻水声潺潺，而泻出于两峰之间者，让泉也。峰回路转，有亭翼然临于泉上者，醉翁亭也。作亭者谁？山之僧曰智仙也。名之者谁？太守自谓也。太守与客来饮于此，饮少辄醉，而年又最高，故自号曰醉翁也。醉翁之意不在酒，在乎山水之间也。山水之乐，得之心而寓之酒也。\\n\\n若夫日出而林霏开，云归而岩穴暝，晦明变化者，山间之朝暮也。野芳发而幽香，佳木秀而繁阴，风霜高洁，水落而石出者，山间之四时也。朝而往，暮而归，四时之景不同，而乐亦无穷也。\\n\\n至于负者歌于途，行者休于树，前者呼，后者应，伛偻提携，往来而不绝者，滁人游也。临谿而渔，谿深而鱼肥；酿泉为酒，泉香而酒洌；山肴野蔌，杂然而前陈者，太守宴也。宴酣之乐，非丝非竹，射者中，弈者胜，觥筹交错，起坐而喧哗者，众宾欢也；苍颜白发，颓然乎其间者，太守醉也。\\n\\n已而夕阳在山，人影散乱，太守归而宾客从也。树林阴翳，鸣声上下，游人去而禽鸟乐也。然而禽鸟知山林之乐，而不知人之乐；人知从太守游而乐，而不知太守之乐其乐也。醉能同其乐，醒能述以文者，太守也。太守谓谁？庐陵欧阳修也。\\n\\n岳阳楼记 北宋·范仲淹\\n\\n庆历四年春，滕子京谪守巴陵郡。越明年，政通人和，百废具兴，乃重修岳阳楼，增其旧制，刻唐贤今人诗赋于其上；属予作文以记之。\\n\\n予观夫巴陵胜状，在洞庭一湖。衔远山，吞长江，浩浩汤汤，横无际涯；朝晖夕阴，气象万千；此则岳阳楼之大观也，前人之述备矣。然则北通巫峡，南极潇湘，迁客骚人，多会于此，览物之情，得无异乎？\\n\\n若夫霪雨霏霏，连月不开；阴风怒号，浊浪排空；日星隐曜，山岳潜形；商旅不行，樯倾楫摧；薄暮冥冥，虎啸猿啼。登斯楼也，则有去国怀乡，忧谗畏讥，满目萧然，感极而悲者矣。\\n\\n至若春和景明，波澜不惊，上下天光，一碧万顷；沙鸥翔集，锦鳞游泳，岸芷汀兰，郁郁青青。而或长烟一空，皓月千里，浮光跃金，静影沉璧，渔歌互答，此乐何极。登斯楼也，则有心旷神怡，宠辱皆忘，把酒临风，其喜洋洋者矣。\\n\\n嗟夫！予尝求古仁人之心，或异二者之为，何哉？不以物喜，不以己悲。居庙堂之高，则忧其民；处江湖之远，则忧其君。是进亦忧，退亦忧；然则何时而乐耶？其必曰：“先天下之忧而忧，后天下之乐而乐”欤！噫！微斯人，吾谁与归？\\n\\n马说 唐·韩愈\\n\\n世有伯乐，然后有千里马。千里马常有，而伯乐不常有。故虽有名马，祗辱于奴隶人之手，骈死于槽枥之间，不以千里称也。\\n\\n马之千里者，一食或尽粟一石。食马者不知其能千里而食也。是马也，虽有千里之能，食不饱，力不足，才美不外见，且欲与常马等不可得，安求其能千里也？\\n\\n策之不以其道，食之不能尽其材，鸣之而不能通其意，执策而临之，曰：“天下无马！”呜呼！其真无马邪？其真不知马也！\\n*/\\n//Generated at 2021-08-18 21:36:06 UTC+8\\n//Created by Alphagocc\\n#ifndef TYPE_HPP\\n#define TYPE_HPP\\n#include <type_traits>\\n#ifndef __cpp_lib_void_t\\nnamespace std\\n{\\ntemplate <typename...> using void_t = void;\\n}\\n#endif\\ntemplate <typename T, typename _ = void> struct is_container : std::false_type\\n{};\\ntemplate <typename... Ts> struct is_container_helper\\n{};\\ntemplate <typename T>\\nstruct is_container<T,\\n typename std::conditional<false,\\n is_container_helper<decltype(std::declval<T>().size()),\\n decltype(std::declval<T>().begin()),\\n decltype(std::declval<T>().end()),\\n decltype(std::declval<T>().cbegin()),\\n decltype(std::declval<T>().cend())>,\\n void>::type> : public std::true_type\\n{};\\n#endif\\n#include <bits/stdc++.h>\\n#define FORCE_INLINE __inline__ __attribute__((always_inline))\\nclass IO\\n{\\n static const int bufSize = 1 << 18;\\n\\n char inBuf[bufSize], outBuf[bufSize];\\n char *ip1 = inBuf, *ip2 = inBuf;\\n int goodReadBit = 1, op1 = -1, op2 = bufSize - 1;\\n FORCE_INLINE int gc()\\n {\\n return ip1 == ip2\\n && (ip2 = (ip1 = inBuf) + fread(inBuf, 1, bufSize, stdin),\\n ip1 == ip2)\\n ? (goodReadBit = 0, EOF)\\n : *ip1++;\\n }\\n template <typename T> FORCE_INLINE void __RI(T &x)\\n {\\n int ch = gc(), neg = 1;\\n x = 0;\\n for (; !(isdigit(ch) || ch == '-' || ch == EOF); ch = gc()) {}\\n if (ch == EOF) return;\\n if (ch == '-') neg = -1, ch = gc();\\n for (; isdigit(ch); ch = gc()) x = x * 10 + (ch - 48) * neg;\\n }\\n template <typename T> FORCE_INLINE void __RC(T &x)\\n {\\n int ch;\\n while (isspace(ch = gc())) {}\\n if (ch == EOF) return;\\n x = ch;\\n }\\n FORCE_INLINE void __RS(std::string &x)\\n {\\n char ch;\\n x.clear();\\n for (ch = gc(); isspace(ch); ch = gc()) {}\\n if (ch == EOF) return;\\n for (; !isspace(ch) && ch != EOF; ch = gc()) x.push_back(ch);\\n }\\n\\npublic:\\n FORCE_INLINE IO &R(char &x) { return __RC(x), (*this); }\\n FORCE_INLINE IO &R(unsigned char &x) { return __RC(x), (*this); }\\n FORCE_INLINE IO &R(std::string &x) { return __RS(x), (*this); }\\n template <typename T1, typename T2> FORCE_INLINE IO &R(std::pair<T1, T2> &x)\\n {\\n return R(x.first), R(x.second), (*this);\\n }\\n template <typename T, typename... Args> FORCE_INLINE IO &RA(T *a, int n)\\n {\\n for (int i = 0; i < n; ++i) R(a[i]);\\n return (*this);\\n }\\n template <typename T, typename... Args>\\n FORCE_INLINE IO &R(T &x, Args &...args)\\n {\\n return R(x), R(args...), (*this);\\n }\\n template <typename T, typename... Args>\\n FORCE_INLINE IO &RA(T *a, int n, Args... args)\\n {\\n for (int i = 0; i < n; ++i) RA(a[i], args...);\\n return (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<std::is_integral<T>::value, IO>::type &\\n R(T &x)\\n {\\n return __RI(x), (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<is_container<T>::value, IO>::type &R(\\n T &x)\\n {\\n for (auto &i : x) R(i);\\n return (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<\\n std::is_void<std::void_t<decltype(std::declval<T>().read())>>::value,\\n IO>::type &\\n R(T &x)\\n {\\n return x.read(), (*this);\\n }\\n\\nprivate:\\n char space = ' ';\\n FORCE_INLINE void pc(const char &x)\\n {\\n if (op1 == op2) flush();\\n outBuf[++op1] = x;\\n }\\n template <typename T> FORCE_INLINE void __WI(T x)\\n {\\n static char buf[sizeof(T) * 16 / 5];\\n static int len = -1;\\n if (x >= 0) {\\n do {\\n buf[++len] = x % 10 + 48, x /= 10;\\n } while (x);\\n } else {\\n pc('-');\\n do {\\n buf[++len] = -(x % 10) + 48, x /= 10;\\n } while (x);\\n }\\n while (len >= 0) { pc(buf[len]), --len; }\\n }\\n\\npublic:\\n FORCE_INLINE void flush() { fwrite(outBuf, 1, op1 + 1, stdout), op1 = -1; }\\n FORCE_INLINE IO &W(const char &x) { return pc(x), (*this); }\\n FORCE_INLINE IO &W(const char *x)\\n {\\n while (*x != '\\\\0') pc(*(x++));\\n return (*this);\\n }\\n FORCE_INLINE IO &W(const std::string &x) { return W(x.c_str()), (*this); }\\n template <typename T1, typename T2>\\n FORCE_INLINE IO &W(const std::pair<T1, T2> &x)\\n {\\n WS(x.first);\\n W(x.second);\\n return (*this);\\n }\\n FORCE_INLINE IO &WL() { return W('\\\\n'), (*this); }\\n template <typename T> FORCE_INLINE IO &WL(const T &x)\\n {\\n return W(x), W('\\\\n'), (*this);\\n }\\n FORCE_INLINE IO &WS() { return W(space), (*this); }\\n template <typename T> FORCE_INLINE IO &WS(const T &x)\\n {\\n return W(x), W(space), (*this);\\n }\\n template <typename T> FORCE_INLINE IO &WA(T *a, int n)\\n {\\n for (int i = 0; i < n; i++) WS(a[i]);\\n WL();\\n return (*this);\\n }\\n template <typename T, typename... Args>\\n FORCE_INLINE IO &W(const T &x, const Args &...args)\\n {\\n W(x), W(space), W(args...);\\n return (*this);\\n }\\n template <typename T, typename... Args>\\n FORCE_INLINE IO &WS(const T &x, const Args &...args)\\n {\\n return W(x), W(space), W(args...), W(space), (*this);\\n }\\n template <typename... Args> FORCE_INLINE IO &WL(const Args &...args)\\n {\\n return W(args...), W('\\\\n'), (*this);\\n }\\n template <typename T, typename... Args>\\n FORCE_INLINE IO &WA(T *a, int n, Args... args)\\n {\\n for (int i = 0; i < n; i++) WA(a[i], args...);\\n return (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<std::is_integral<T>::value, IO>::type &\\n W(const T &x)\\n {\\n return __WI(x), (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<is_container<T>::value, IO>::type &W(\\n const T &x)\\n {\\n\\n for (auto &i : x) WS(i);\\n WL();\\n return (*this);\\n }\\n template <typename T>\\n FORCE_INLINE typename std::enable_if<\\n std::is_void<std::void_t<decltype(std::declval<T>().write())>>::value,\\n IO>::type &\\n W(const T &x)\\n {\\n return x.write(), (*this);\\n }\\n template <typename T> FORCE_INLINE IO &operator>>(T &x)\\n {\\n R(x);\\n return (*this);\\n }\\n template <typename T> FORCE_INLINE IO &operator<<(const T &x)\\n {\\n W(x);\\n return (*this);\\n }\\n int good() { return goodReadBit; }\\n IO() {}\\n ~IO() { flush(); }\\n} io;\\n#undef FORCE_INLINE\\n\\n#ifndef UTIL_HPP\\n#define UTIL_HPP\\n#include <bits/stdc++.h>\\n#define var auto\\n#define ALL(x) x.begin(), x.end()\\nconst std::int32_t INF = 0x3f3f3f3f;\\nconst std::int64_t INFL = 0x3f3f3f3f3f3f3f3f;\\n#define If(x, y, z) ((x) ? (y) : (z))\\n#endif\\nusing namespace std;\\nint f(const vector<int> &a)\\n{\\n vector<int> dp(accumulate(ALL(a), 0) + 1, -1);\\n // io.WL(a);\\n int sum = 0;\\n dp[0] = 0;\\n for (auto i : a) {\\n for (int j = sum & -i; j >= 0; j -= i) {\\n if (dp[j] != -1) dp[j + i] = max(dp[j + i], dp[j] + 1);\\n }\\n sum += i;\\n }\\n int ans = 1;\\n for (int i = 1; i < dp.size(); i <<= 1) ans = max(ans, dp[i]);\\n return ans;\\n}\\nint main()\\n{\\n int n;\\n while (1) {\\n io >> n;\\n if (n == 0) break;\\n vector<int> a(n);\\n io >> a;\\n int ans = 1;\\n map<int, vector<int>> v;\\n for (auto i : a) { v[i / (i & -i)].push_back(i & -i); }\\n for (auto [ignore, x] : v) {\\n int k = 1;\\n do {\\n ans = max(ans, f(x));\\n x.erase(\\n remove_if(ALL(x), [&](int i) { return i <= k; }), x.end());\\n k <<= 1;\\n } while (!x.empty());\\n }\\n io.WL(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3984,\n \"score_of_the_acc\": -0.1268,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1343_5798469\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define SZ(x) ((int)(x).size())\\n#define rep(i, a) for (int i = 0; i < (a); ++i)\\n#define repi(i, a) for (int i = 1; i <= (a); ++i)\\ntypedef long long ll;\\nconst int Inf = 0x3f3f3f3f;\\n\\nint N;\\nint a[1005];\\nvector<int> ss[505];\\nint dp[500005];\\n\\nint get(vector<int> &v) {\\n\\tint sm = accumulate(v.begin(), v.end(), 0);\\n\\tmemset(dp, -1, sizeof(int) * (sm + 1));\\n\\tdp[0] = 0;\\n\\tint nsm = 0;\\n\\trep(i, SZ(v)) {\\n\\t\\tint val = v[i]; nsm += val;\\n\\t\\tfor (int j = nsm / val * val; j >= val; j -= val) if (~dp[j - val]) dp[j] = max(dp[j], dp[j - val] + 1);\\n\\t}\\n\\tint ans = 0;\\n\\tfor (int i = 1; i <= sm; i <<= 1) ans = max(ans, dp[i]);\\n\\treturn ans;\\n}\\n\\nvoid solve() {\\n\\trepi(i, 500) ss[i].clear();\\n\\trepi(i, N) {\\n\\t\\tscanf(\\\"%d\\\", a + i);\\n\\t\\tint x = a[i];\\n\\t\\twhile (!(x & 1)) x >>= 1;\\n\\t\\tss[x].push_back(a[i] / x);\\n\\t}\\n\\tint ans = 0;\\n\\trepi(i, 500) ans = max(ans, get(ss[i]));\\n\\tprintf(\\\"%d\\\\n\\\", ans);\\n}\\n\\nint main() {\\n\\twhile (scanf(\\\"%d\\\", &N) && N) solve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 4020,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1343_5797917\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint Tc,n,a[1003];\\nvector<int>arr[503];\\nint f[500003],len,fs[500003];\\nint solve(vector<int>v){\\n\\tmemset(f,-1,sizeof(f));\\n\\tf[0]=0,len=0;\\n\\tfor(int i=0;i<v.size();i++){\\n\\t\\tint x=v[i];\\n\\t\\tint nlen=len;\\n\\t\\tfor(int j=len;~j;j--)if(~f[j]&&(j==0||fs[j]>=x)){\\n\\t\\t\\tf[j+(1<<x)]=max(f[j+(1<<x)],f[j]+1);\\n\\t\\t\\tnlen=max(nlen,j+(1<<x));\\n\\t\\t}\\n\\t\\tlen=nlen;\\n\\t}\\n\\tint ans=0;\\n\\tfor(int i=0;i<19;i++)ans=max(ans,f[1<<i]);\\n\\treturn ans;\\n}\\nint main(){\\n\\tfor(int i=1;i<500003;i++)fs[i]=__builtin_ffs(i)-1;\\n\\twhile(~scanf(\\\"%d\\\",&n)){\\n\\t\\tif(n==0)break;\\n\\t\\tfor(int i=1;i<503;i++)arr[i].clear();\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tint x;scanf(\\\"%d\\\",&x);\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\twhile(x%2==0)cnt++,x/=2;\\n\\t\\t\\tarr[x].push_back(cnt);\\n\\t\\t}\\n\\t\\tint ans=1;\\n\\t\\tfor(int i=1;i<503;i++)if(!arr[i].empty()){\\n\\t\\t\\tint tmp=solve(arr[i]);\\n\\t\\t\\tans=max(ans,tmp);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 7264,\n \"score_of_the_acc\": -0.9851,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1343_5286922\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T>void debug(T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge() = default;\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v,w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n while(1){\\n ll n;cin>>n;\\n if(n==0)break;\\n vector<ll>a(n);\\n rep(i,0,n)cin>>a[i];\\n ll sz=505;\\n vector<vector<ll>>va(sz);\\n rep(i,0,n){\\n ll div=1;\\n while(a[i]%div==0){\\n va[a[i]/div].PB(div);\\n div*=2;\\n }\\n }\\n ll ret=0;\\n for(auto &v:va){\\n ll sum=0;\\n for(auto z:v)sum+=z;\\n vector<ll>dp(sum+1,-INF);\\n dp[0]=0;\\n for(auto z:v){\\n for(ll k=(sum-z)/z*z;k>=0;k-=z){\\n chmax(dp[k+z],dp[k]+1);\\n }\\n }\\n for(ll i=1;i<=sum;i*=2)chmax(ret,dp[i]);\\n }\\n cout<<ret<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 4444,\n \"score_of_the_acc\": -0.2623,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1343_4705369\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <string>\\n#include <ctime>\\n#include <vector>\\n#include <cmath>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <algorithm>\\n//#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long LL;\\n\\nconst int SZ = 1005,SZ0 = 256005;\\n\\nint n,a[SZ],dp[SZ0];\\nbool bas[SZ];bool vis[SZ];\\nint sl,B[SZ],sum[SZ];\\n\\ntemplate<typename Type>inline void read(Type &xx){\\n Type f = 1;char ch;xx = 0;\\n for(ch = getchar();ch < '0' || ch > '9';ch = getchar()) if(ch == '-') f = -1;\\n for(;ch >= '0' && ch <= '9';ch = getchar()) xx = xx * 10 + ch - '0';\\n xx *= f;\\n}\\n\\nint DP(){\\n for(int i = 1;i <= sl;i++) sum[i] = sum[i - 1] + B[i];\\n dp[0] = 0;\\n for(int i = 1;i <= sl;i++){\\n int mn = B[i];\\n for(int j = sum[i] / mn * mn;j >= (mn << 1);j -= mn)\\n dp[j] = max(dp[j],dp[j - mn] + 1);\\n dp[mn] = max(dp[mn],1);\\n }\\n int ans = 0;\\n for(int i = 1;i <= sum[sl];i <<= 1) ans = max(ans,dp[i]);\\n memset(dp,0x8f,sizeof dp);\\n return ans;\\n}\\n\\nbool is_least(int idx){\\n if(vis[a[idx]]) return false;\\n vis[a[idx]] = true;\\n for(int j = 1;j <= n;++j)\\n if(a[idx] % a[j] == 0 && bas[a[idx] / a[j]] && a[idx] > a[j])\\n return false;\\n return true;\\n}\\n\\nint main(int argc, char** argv) {\\n for(int i = 1;i < SZ;i <<= 1) bas[i] = true;\\n while(scanf(\\\"%d\\\",&n) != EOF && n){\\n memset(dp,0x8f,sizeof dp);memset(vis,0,sizeof vis);\\n for(int i = 1;i <= n;i++) read(a[i]);\\n int ans = 0;\\n for(int i = 1;i <= n;++i){\\n if(!is_least(i)) continue;\\n sl = 0;\\n for(int j = 1;j <= n;++j)\\n if(a[j] % a[i] == 0 && bas[a[j] / a[i]])\\n B[++sl] = a[j] / a[i];\\n ans = max(ans,DP());\\n }\\n printf(\\\"%d\\\\n\\\",ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 4228,\n \"score_of_the_acc\": -0.195,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1343_4145126\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\nconst ll INF = (1e+18) + 7;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-6;\\nconst ld pi = acos(-1.0);\\n//typedef vector<vector<ll>> mat;\\ntypedef vector<int> vec;\\n\\nll mod_pow(ll a, ll n) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * a%mod;\\n\\t\\ta = a * a%mod; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\n\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n%mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, int n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a*a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\n//const int max_n = 1 << 22;\\n//modint fact[max_n], factinv[max_n];\\n//void init_f() {\\n//\\tfact[0] = modint(1);\\n//\\tfor (int i = 0; i < max_n - 1; i++) {\\n//\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n//\\t}\\n//\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n//\\tfor (int i = max_n - 2; i >= 0; i--) {\\n//\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n//\\t}\\n//}\\n//modint comb(int a, int b) {\\n//\\tif (a < 0 || b < 0 || a < b)return 0;\\n//\\treturn fact[a] * factinv[b] * factinv[a - b];\\n//}\\n\\nvector<int> b[501];\\nint n;\\n\\nvoid normalize(vector<P> &v) {\\n\\tvector<P> res;\\n\\tsort(all(v), greater<P>());\\n\\tfor (P p : v) {\\n\\t\\tif (res.size() && p.second <= res.back().second)continue;\\n\\t\\tres.push_back(p);\\n\\t}\\n\\tswap(v, res);\\n}\\nvoid solve() {\\n\\trep1(i, 500)b[i].clear();\\n\\tvector<int> a(n);\\n\\trep(i, n) {\\n\\t\\tcin >> a[i];\\n\\t\\tint cop = a[i];\\n\\t\\tint tmp = 0;\\n\\t\\twhile (cop % 2 == 0) {\\n\\t\\t\\tcop /= 2; tmp++;\\n\\t\\t}\\n\\t\\tb[cop].push_back(tmp);\\n\\t}\\n\\tint ans = 0;\\n\\trep1(i, 500) {\\n\\t\\tif (b[i].empty())continue;\\n\\t\\tvector<int> dp((1 << 18)+1,-mod);\\n\\t\\tdp[0] = 0;\\n\\t\\tfor (int t : b[i]) {\\n\\t\\t\\tper(j, (1 << (18 - t))) {\\n\\t\\t\\t\\tint tj = j << t;\\n\\t\\t\\t\\tint nj = tj + (1 << t);\\n\\t\\t\\t\\tdp[nj] = max(dp[nj], dp[tj] + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(j, 19) {\\n\\t\\t\\tans = max(ans, dp[1 << j]);\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ans << endl;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\t//cout << fixed << setprecision(12);\\n\\t//init_f();\\n\\t//int t; cin >> t; rep(i, t)solve();\\n\\twhile(cin>>n,n)solve();\\n\\tstop\\n\\t\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6200,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -1.0556,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":798,"cells":{"group_id":{"kind":"string","value":"aoj_1348_cpp"},"problem_description":{"kind":"string","value":"Problem D:\nSpace Golf\nYou surely have never heard of this new planet surface exploration scheme, as it is being carried out in a project with utmost secrecy. The scheme is expected to cut costs of conventional rovertype mobile explorers considerably, using projected-type equipment nicknamed \"observation bullets\".\nBullets do not have any active mobile abilities of their own, which is the main reason of their cost-efficiency. Each of the bullets, after being shot out on a launcher given its initial velocity, makes a parabolic trajectory until it touches down. It bounces on the surface and makes another parabolic trajectory. This will be repeated virtually infinitely.\nWe want each of the bullets to bounce precisely at the respective spot of interest on the planet surface, adjusting its initial velocity. A variety of sensors in the bullet can gather valuable data at this instant of bounce, and send them to the observation base. Although this may sound like a conventional target shooting practice, there are several issues that make the problem more difficult.\nThere may be some obstacles between the launcher and the target spot. The obstacles stand upright and are very thin that we can ignore their widths. Once the bullet touches any of the obstacles, we cannot be sure of its trajectory thereafter. So we have to plan launches to avoid these obstacles.\nLaunching the bullet almost vertically in a speed high enough, we can easily make it hit the target without touching any of the obstacles, but giving a high initial speed is energyconsuming. Energy is extremely precious in space exploration, and the initial speed of the bullet should be minimized. Making the bullet bounce a number of times may make the bullet reach the target with lower initial speed.\nThe bullet should bounce, however, no more than a given number of times. Although the body of the bullet is made strong enough, some of the sensors inside may not stand repetitive shocks. The allowed numbers of bounces vary on the type of the observation bullets.\nYou are summoned engineering assistance to this project to author a smart program that tells the minimum required initial speed of the bullet to accomplish the mission.\nFigure D.1 gives a sketch of a situation, roughly corresponding to the situation of the Sample\nInput 4 given below.\nFigure D.1. A sample situation\nYou can assume the following.\nThe atmosphere of the planet is so thin that atmospheric resistance can be ignored.\nThe planet is large enough so that its surface can be approximated to be a completely flat plane.\nThe gravity acceleration can be approximated to be constant up to the highest points a bullet can reach.\nThese mean that the bullets fly along a perfect parabolic trajectory.\nYou can also assume the following.\nThe surface of the planet and the bullets are made so hard that bounces can be approximated as elastic collisions. In other words, loss of kinetic energy on bounces can be ignored. As we can also ignore the atmospheric resist\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1348_4963406","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}\n#define bitUP(x,a) ((x>>a)&1)\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\nlong double eps = 1e-6;\nlong double pi = acos(-1);\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n return vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n auto v=vmake(args...);\n return vector<decltype(v)>(n,move(v));\n}\n\n\n\nsigned main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n using DD=long double;\n int d,n,b;\n cin>>d>>n>>b;\n b++;\n int p[11],h[11];\n for(int i=0;i<n;i++){\n cin>>p[i]>>h[i];\n }\n DD ret=1e120;\n for(int num_bound=1;num_bound<=b;num_bound++){\n DD per_d=(double)d/num_bound;\n DD ok=1000000,ng=0; //ok=??\n int N=10000;\n while(N--){\n DD mid=(ok+ng)/2;\n DD time=2*mid/1.0L;\n DD vx=per_d/time;\n bool broken=false;\n for(int i=0;i<n;i++){\n DD d=fmod(p[i],per_d);\n DD y=-1*(1.0L/(2*vx*vx))*d*d+mid/vx*d;\n if(y<h[i]) broken=true;\n }\n if(not broken) ok=mid;\n else ng=mid;\n }\n /*double time=2*ok/1.0L;\n double vx=per_d/time;\n cerr<<vx<<\" \"<<ok<<endl;\n if(vx>ok) ok=sqrt(per_d/2),vx=ok;\n cerr<<num_bound<<\" \"<<sqrt(vx*vx+ok*ok)<<endl;*/\n ok=max(ok,sqrt(per_d/2));\n DD vx=per_d/(ok*2);\n chmin(ret,sqrt(vx*vx+ok*ok));\n }\n cout<<ret<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3632,"score_of_the_acc":-1,"final_rank":7},{"submission_id":"aoj_1348_2640401","code_snippet":"#include<bits/stdc++.h>\n#define double long double\n#define N 10\nusing namespace std;\ntypedef pair<bool,double> P;\n\nconst double EPS = 1e-12;\n\ndouble d, n, b, p[N], h[N];\n\nP check(double s, double A, int cnt){\n \n double l = 0, r = 1000000000;\n \n while(l+EPS<r){\n \n double m = (l + r) / 2.0;\n double vx = m * cos(s);\n double vy = m * sin(s);\n double x = vx * 2 * vy;\n \n if(x<A) l=m;\n else r=m;\n\n }\n \n double vx = l * cos(s);\n double vy = l * sin(s);\n \n bool res = true;\n \n double x=0;\n \n for(int i=0;i<=cnt;i++){\n \n for(int j=0;j<n;j++)\n \n if(x-EPS<p[j]&&p[j]<x+A+EPS){\n\t\n\tif(abs(p[j]-x)<EPS||abs(p[j]-x)<EPS) res=false;\n\t\n\tdouble X=abs(p[j]-x);\n\t\n\tif(-X*X/(2*vx*vx)+X*vy/vx<=h[j]+EPS) res=false;\n }\n \n x+=A;\n }\n \n return P(res, l);\n}\n\ndouble sim(int cnt){\n \n double A=1.0*d/(cnt+1);\n \n double l = M_PI/4.0, r = M_PI/2.0;\n \n while(l+EPS<r){\n \n double m = (l + r) / 2.0;\n \n if(!check(m,A,cnt).first) l = m;\n else r=m;\n }\n \n return check(l,A,cnt).second;\n}\n\nint main(){\n \n cin>>d>>n>>b;\n\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\n \n double ans=(1e9);\n \n for(int i=0;i<=b;i++) ans=min(ans, sim(i));\n \n printf(\"%.8Lf\\n\", ans);\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3604,"score_of_the_acc":-0.9882,"final_rank":6},{"submission_id":"aoj_1348_2608914","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define double long double\n#define N 20\nusing namespace std;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nconst double g = 1.0;\nint p[N],h[N];\n\ndouble calcX(double radian,double v){\n double vix = v * cos(radian);\n double viy = v * sin(radian);\n double t = 2 * viy / g;\n return vix * t;\n}\n\ndouble calcV(double x,int n,int b,double radian){\n double L = 0, R = 1e10, cnt = 100;\n while(cnt--){\n double M = (L+R)/2;\n if(calcX(radian,M) > x) R = M;\n else L = M;\n }\n \n double v = L,pos = 0;\n for(int i=0;i<b;i++, pos += x){\n for(int j=0;j<n;j++){\n if(!(pos <= p[j] && p[j] <= pos+x)) continue;\n double vix = v * cos(radian);\n double viy = v * sin(radian);\n double t = (p[j] - pos)/vix;\n double y = -(g*t/2 - viy) * t;\n if(y-h[j]+EPS < 0) return INF;\n }\n }\n return v; \n}\n\ndouble solve(double x,int n,int b){\n double L = PI/4,R = PI/2,cnt = 100;\n while(cnt--){\n double M = (L+R)/2;\n if(calcV(x,n,b,M) < INF) R = M; \n else L = M;\n }\n return calcV(x,n,b,R);\n}\n\nsigned main(){\n int D,n,B;\n cin>>D>>n>>B;\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\n double ans = INF;\n for(int i=1;i<=B+1;i++) Min(ans,solve(1.0*D/i,n,i));\n printf(\"%.5Lf\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3512,"score_of_the_acc":-0.9637,"final_rank":4},{"submission_id":"aoj_1348_2608907","code_snippet":"#include <bits/stdc++.h>\n#define int long long\n#define double long double\n#define N 20\nusing namespace std;\nconst int INF = 1LL<<55;\nconst int mod = (1e9)+7;\nconst double EPS = 1e-8;\nconst double PI = 6.0 * asin(0.5);\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\nconst double g = 1.0;\nint p[N],h[N];\n\n\ndouble calcX(double radian,double v){\n double vix = v * cos(radian);\n double viy = v * sin(radian);\n double t = 2 * viy / g;\n return vix * t;\n}\n\ndouble calcV(double x,int n,int b,double radian){\n double L = 0, R = 1e10, cnt = 100;\n while(cnt--){\n double M = (L+R)/2;\n if(calcX(radian,M) > x) R = M;\n else L = M;\n }\n \n double v = L,pos = 0;\n for(int i=0;i<b;i++, pos += x){\n for(int j=0;j<n;j++){\n //if(pos == p[j] || p[j] == pos+x) return INF;\n if(!(pos <= p[j] && p[j] <= pos+x)) continue;\n double vix = v * cos(radian);\n double viy = v * sin(radian);\n double t = (p[j] - pos)/vix;\n double y = -(g*t/2 - viy) * t;\n if(y-h[j]+EPS < 0) return INF;\n }\n }\n return v; \n}\n\ndouble solve(double x,int n,int b){\n\n double L = PI/4,R = PI/2,cnt = 100;\n while(cnt--){\n double M = (L+R)/2;\n if(calcV(x,n,b,M) < INF) R = M; \n else L = M;\n }\n return calcV(x,n,b,R);\n}\n\n\nsigned main(){\n int D,n,B;\n cin>>D>>n>>B;\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\n double ans = INF;\n for(int i=1;i<=B+1;i++) Min(ans,solve(1.0*D/i,n,i));\n printf(\"%.5Lf\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3512,"score_of_the_acc":-0.9782,"final_rank":5},{"submission_id":"aoj_1348_1841924","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-5;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n long double h_max=0;\n rep(i,0,n){\n cin >> p[i] >> h[i];\n h_max=max(h_max,h[i]);\n }\n\n int loop_num=1e7*6;\n long double ans=infll;\n long double lb=sqrtl(2*h_max)-eps,ub=d*log10l(d);\n rep(i,0,loop_num+1){\n long double vy=lb+(long double)i/loop_num*(ub-lb);\n if(ans<=vy*vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx*vx) break;\n long double tmp=vx*vx+vy*vy;\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << sqrtl(ans) << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.16666666666666666,"time_ms":660,"memory_kb":3424,"score_of_the_acc":-1.854,"final_rank":9},{"submission_id":"aoj_1348_1841920","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n long double h_max=0;\n rep(i,0,n){\n cin >> p[i] >> h[i];\n h_max=max(h_max,h[i]);\n }\n\n int loop_num=1e7*4;\n long double ans=infll;\n long double lb=sqrtl(2*h_max),ub=d*log10l(d);\n rep(i,0,loop_num+1){\n long double vy=lb+(long double)i/loop_num*(ub-lb);\n if(ans<=vy*vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx*vx) break;\n long double tmp=vx*vx+vy*vy;\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << sqrtl(ans) << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.16666666666666666,"time_ms":440,"memory_kb":3424,"score_of_the_acc":-1.5352,"final_rank":8},{"submission_id":"aoj_1348_1841917","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n long double h_max=0;\n rep(i,0,n){\n cin >> p[i] >> h[i];\n h_max=max(h_max,h[i]);\n }\n\n int loop_num=1e7*4;\n long double ans=infll;\n long double lb=sqrtl(2*h_max),ub=d*4;\n rep(i,0,loop_num+1){\n long double vy=lb+(long double)i/loop_num*(ub-lb);\n if(ans<=vy*vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx*vx) break;\n long double tmp=vx*vx+vy*vy;\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << sqrtl(ans) << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.027777777777777776,"time_ms":240,"memory_kb":3268,"score_of_the_acc":-1.1794,"final_rank":11},{"submission_id":"aoj_1348_1841911","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n long double h_max=0;\n rep(i,0,n){\n cin >> p[i] >> h[i];\n h_max=max(h_max,h[i]);\n }\n\n int loop_num=1e7;\n long double ans=infll;\n long double lb=sqrtl(2*h_max),ub=d;\n rep(i,0,loop_num+1){\n long double vy=lb+(long double)i/loop_num*(ub-lb);\n if(ans<=vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx) break;\n long double tmp=sqrtl(vx*vx+vy*vy);\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.05555555555555555,"time_ms":560,"memory_kb":3268,"score_of_the_acc":-1.6431,"final_rank":10},{"submission_id":"aoj_1348_1841910","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n long double h_max=0;\n rep(i,0,n){\n cin >> p[i] >> h[i];\n h_max=max(h_max,h[i]);\n }\n\n int loop_num=1e7*2;\n long double ans=infll;\n rep(i,1,loop_num+1){\n long double vy=(long double)i/loop_num*2*d;\n if(ans<=vy) break;\n if(vy/2*vy<h_max) continue;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx) break;\n long double tmp=sqrtl(vx*vx+vy*vy);\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.027777777777777776,"time_ms":300,"memory_kb":3304,"score_of_the_acc":-1.2815,"final_rank":12},{"submission_id":"aoj_1348_1841905","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n rep(i,0,n) cin >> p[i] >> h[i];\n\n int loop_num=1e7*3.5;\n long double ans=infll;\n rep(i,1,loop_num+1){\n long double vy=(long double)i/loop_num*10*d;\n if(ans<=vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx) break;\n long double tmp=sqrtl(vx*vx+vy*vy);\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.027777777777777776,"time_ms":650,"memory_kb":3284,"score_of_the_acc":-1.7803,"final_rank":13},{"submission_id":"aoj_1348_1841903","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define debug(x) #x << \"=\" << (x)\n\n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define show(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define show(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\ntemplate<typename T> using vec=std::vector<T>;\n\nconst int inf=1<<30;\nconst long long int infll=1LL<<62;\nconst double eps=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n os << \"[\";\n for (const auto &v : vec) {\n \tos << v << \",\";\n }\n os << \"]\";\n return os;\n}\n\nvoid solve(){\n int d,n,b;\n cin >> d >> n >> b;\n vector<long double> p(n),h(n);\n rep(i,0,n) cin >> p[i] >> h[i];\n\n int loop_num=1e7*3;\n long double ans=infll;\n rep(i,1,loop_num+1){\n long double vy=(long double)i/loop_num*8*d;\n if(ans<=vy) break;\n for(int j=b+1; j>=1; --j){\n long double vx=(long double)d/2/vy/j;\n if(ans<=vx) break;\n long double tmp=sqrtl(vx*vx+vy*vy);\n if(ans<=tmp) continue;\n bool ok=true;\n rep(k,0,n){\n int l=p[k]/(2*vx*vy);\n long double t=(long double)p[k]/vx-2*vy*l;\n if((long double)-t*t/2+vy*t>=h[k]) continue;\n ok=false;\n break;\n }\n if(ok) ans=min(ans,tmp);\n }\n }\n cout << ans << endl;\n}\n\nint main(){\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(10);\n solve();\n return 0;\n}","accuracy":0.027777777777777776,"time_ms":700,"memory_kb":3256,"score_of_the_acc":-1.8409,"final_rank":14},{"submission_id":"aoj_1348_1301745","code_snippet":"// Template {{{\n#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nusing namespace std;\ntypedef long long LL;\n\n#ifdef LOCAL\n#include \"contest.h\"\n#else\n#define dump(x) \n#endif\n\nclass range {\n struct Iterator {\n int val, inc;\n int operator*() {return val;}\n bool operator!=(Iterator& rhs) {return val < rhs.val;}\n void operator++() {val += inc;}\n };\n Iterator i, n;\n public:\n range(int e) : i({0, 1}), n({e, 1}) {}\n range(int b, int e) : i({b, 1}), n({e, 1}) {}\n range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}\n Iterator& begin() {return i;}\n Iterator& end() {return n;}\n};\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\ninline bool valid(int x, int w) { return 0 <= x && x < w; }\n\nvoid iostream_init() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.setf(ios::fixed);\n cout.precision(12);\n}\n//}}}\n\nint main(){\n iostream_init();\n int N, B;\n double D;\n while(cin >> D >> N >> B) {\n vector<double> P(N);\n vector<double> H(N);\n REP(i, N) cin >> P[i] >> H[i];\n\n double ans = 1e16;\n\n for(int b = 0; b <= B; b++) {\n double p = D / (b+1);\n double lb = M_PI / 4;\n double ub = M_PI / 2;\n double v = 0;\n REP(_, 60) {\n double th = (lb+ub) / 2;\n double vx = sqrt(p / 2.0 / tan(th));\n\n v = vx/cos(th); // update\n\n bool ok = true;\n REP(i, N) {\n double x = P[i] - int(P[i] / p) * p;\n double y = -(0.5/vx/vx)*x*x + tan(th)*x;\n if(y < H[i]) ok = false;\n }\n if(ok) {\n ub = th;\n } else {\n lb = th;\n }\n }\n\n ans = min(ans, v);\n }\n cout << ans << endl;\n }\n\n return 0;\n}\n\n/* vim:set foldmethod=marker: */","accuracy":1,"time_ms":40,"memory_kb":1404,"score_of_the_acc":-0.101,"final_rank":3},{"submission_id":"aoj_1348_1144005","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\n#define DEBUG(x) cerr << #x << \" = \" << x << endl\n\ntypedef long double D;\n\nstruct Node {\n D p;\n D h;\n};\n\nconst D EPS = 1e-10;\n\nint sig(D a, D b) {\n if(a < b - EPS) return -1;\n if(a > b + EPS) return +1;\n return 0;\n}\n\nbool check(D th, D speed, D start, D end, const vector<Node> &objs) {\n D vx = speed * cos(th);\n D vy = speed * sin(th);\n bool ok = true;\n for(int i = 0; i < (int)objs.size(); ++i) {\n if(sig(start, objs[i].p) <= 0 && sig(objs[i].p, end) <= 0) {\n D x = objs[i].p - start;\n D y = -(x*x/(2*vx*vx)) + vy*x/vx;\n if(sig(y, objs[i].h) < 0) {\n ok = false;\n }\n }\n }\n return ok;\n}\n\nD speed(D th, D len) {\n return sqrt(len / (sin(2*th)));\n}\n\nvoid test(D th, D len, D pos) {\n D sp = speed(th, len);\n D vx = sp * cos(th);\n D vy = sp * sin(th);\n D y = -(pos*pos/(2*vx*vx)) + (vy/vx)*pos;\n DEBUG(y);\n}\n\nint main() {\n D distance;\n int N, B;\n cin >> distance >> N >> B;\n vector<Node> objs(N);\n for(int i = 0; i < N; ++i) {\n cin >> objs[i].p >> objs[i].h;\n }\n B++;\n D ans = 1e20;\n for(int b = 1; b <= B; ++b) {\n for(int i = 0; i < b; ++i) {\n D start = distance / b * i;\n D end = distance / b * (i + 1);\n D len = abs(end - start);\n D estm;\n // DEBUG(start);\n // DEBUG(end);\n // DEBUG(len);\n // DEBUG(speed(M_PI/4, len));\n // D vx = speed(M_PI/4, len)*cos(M_PI/4);\n // D vy = speed(M_PI/4, len)*sin(M_PI/4);\n // DEBUG(-(len*len/(2*vx*vx))+(vy/vx)*len);\n // DEBUG(\"false\");\n D lb = M_PI/4, ub = M_PI/2;\n for(int t = 0; t < 300; ++t) {\n D mid = (lb + ub) / 2;\n if(check(mid, speed(mid, len), start, end, objs)) {\n ub = mid;\n }\n else {\n lb = mid;\n }\n }\n estm = ub;\n D estm_sp = speed(estm, len);\n bool ok = true;\n for(int j = 0; j < b; ++j) {\n D start2 = distance / b * j;\n D end2 = distance / b * (j + 1);\n if(check(estm, estm_sp, start2, end2, objs) == false) {\n ok = false;\n }\n }\n if(ok) {\n ans = min(ans, estm_sp);\n }\n }\n }\n cout.setf(ios::fixed); cout.precision(10);\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":1308,"score_of_the_acc":-0.0169,"final_rank":2},{"submission_id":"aoj_1348_1101727","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n#include <sstream>\n#include <cstring>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <numeric>\n#include <cctype>\n#include <tuple>\n#include <array>\n#include <climits>\n#include <bitset>\n#include <cassert>\n#include <ctime>\n#include <list>\n#include <complex>\n#ifdef _MSC_VER\n#include <agents.h>\n#endif\n\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\n#define rep(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define REV(v) v.rbegin(), v.rend()\n#define MEMSET(v, s) memset(v, s, sizeof(v))\n#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())\n#define MP make_pair\n#define MT make_tuple\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\nconst double EPS = 1e-9;\n\nbool check(double x, double y, double vx, double vy){\n\tdouble yy = -1 / 2. / vx / vx*x*x + vy / vx*x;\n\treturn y < yy + EPS;\n}\n\nint main(){\n\tint d, n, b;\n\tcin >> d >> n >> b;\n\n\tvector<int> p(n), h(n);\n\trep(i, n) cin >> p[i] >> h[i];\n\n\tdouble ans = 1e100;\n\tFOR(i, 1, b + 2){\n\t\tdouble len = (double)d / i;\n\n\t\tdouble lb = 0, ub = sqrt(len / 2);\n\t\trep(j, 10000){\n\t\t\tdouble mid = (lb + ub) / 2;\n\t\t\tbool ok = true;\n\t\t\trep(k, n){\n\t\t\t\tdouble pp = p[k];\n\t\t\t\twhile (pp > len - EPS) pp -= len;\n\t\t\t\tok &= check(pp, h[k], mid, len / 2 / mid);\n\t\t\t}\n\t\t\tif (ok) lb = mid;\n\t\t\telse ub = mid;\n\t\t}\n\t\tif (lb < EPS) continue;\n\t\tdouble vx = lb, vy = len / 2 / vx;\n\t\tans = min(ans, sqrt(vx*vx+vy*vy));\n\t}\n\tcout.setf(ios::fixed);\n\tcout.precision(10);\n\tcout << ans << endl;\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1268,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1348_4963406\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\ntypedef long long ll;\\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}\\n#define bitUP(x,a) ((x>>a)&1)\\nint dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};\\nlong double eps = 1e-6;\\nlong double pi = acos(-1);\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n return vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n auto v=vmake(args...);\\n return vector<decltype(v)>(n,move(v));\\n}\\n\\n\\n\\nsigned main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n using DD=long double;\\n int d,n,b;\\n cin>>d>>n>>b;\\n b++;\\n int p[11],h[11];\\n for(int i=0;i<n;i++){\\n cin>>p[i]>>h[i];\\n }\\n DD ret=1e120;\\n for(int num_bound=1;num_bound<=b;num_bound++){\\n DD per_d=(double)d/num_bound;\\n DD ok=1000000,ng=0; //ok=??\\n int N=10000;\\n while(N--){\\n DD mid=(ok+ng)/2;\\n DD time=2*mid/1.0L;\\n DD vx=per_d/time;\\n bool broken=false;\\n for(int i=0;i<n;i++){\\n DD d=fmod(p[i],per_d);\\n DD y=-1*(1.0L/(2*vx*vx))*d*d+mid/vx*d;\\n if(y<h[i]) broken=true;\\n }\\n if(not broken) ok=mid;\\n else ng=mid;\\n }\\n /*double time=2*ok/1.0L;\\n double vx=per_d/time;\\n cerr<<vx<<\\\" \\\"<<ok<<endl;\\n if(vx>ok) ok=sqrt(per_d/2),vx=ok;\\n cerr<<num_bound<<\\\" \\\"<<sqrt(vx*vx+ok*ok)<<endl;*/\\n ok=max(ok,sqrt(per_d/2));\\n DD vx=per_d/(ok*2);\\n chmin(ret,sqrt(vx*vx+ok*ok));\\n }\\n cout<<ret<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -1,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1348_2640401\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define double long double\\n#define N 10\\nusing namespace std;\\ntypedef pair<bool,double> P;\\n\\nconst double EPS = 1e-12;\\n\\ndouble d, n, b, p[N], h[N];\\n\\nP check(double s, double A, int cnt){\\n \\n double l = 0, r = 1000000000;\\n \\n while(l+EPS<r){\\n \\n double m = (l + r) / 2.0;\\n double vx = m * cos(s);\\n double vy = m * sin(s);\\n double x = vx * 2 * vy;\\n \\n if(x<A) l=m;\\n else r=m;\\n\\n }\\n \\n double vx = l * cos(s);\\n double vy = l * sin(s);\\n \\n bool res = true;\\n \\n double x=0;\\n \\n for(int i=0;i<=cnt;i++){\\n \\n for(int j=0;j<n;j++)\\n \\n if(x-EPS<p[j]&&p[j]<x+A+EPS){\\n\\t\\n\\tif(abs(p[j]-x)<EPS||abs(p[j]-x)<EPS) res=false;\\n\\t\\n\\tdouble X=abs(p[j]-x);\\n\\t\\n\\tif(-X*X/(2*vx*vx)+X*vy/vx<=h[j]+EPS) res=false;\\n }\\n \\n x+=A;\\n }\\n \\n return P(res, l);\\n}\\n\\ndouble sim(int cnt){\\n \\n double A=1.0*d/(cnt+1);\\n \\n double l = M_PI/4.0, r = M_PI/2.0;\\n \\n while(l+EPS<r){\\n \\n double m = (l + r) / 2.0;\\n \\n if(!check(m,A,cnt).first) l = m;\\n else r=m;\\n }\\n \\n return check(l,A,cnt).second;\\n}\\n\\nint main(){\\n \\n cin>>d>>n>>b;\\n\\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\\n \\n double ans=(1e9);\\n \\n for(int i=0;i<=b;i++) ans=min(ans, sim(i));\\n \\n printf(\\\"%.8Lf\\\\n\\\", ans);\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.9882,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1348_2608914\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define double long double\\n#define N 20\\nusing namespace std;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nconst double g = 1.0;\\nint p[N],h[N];\\n\\ndouble calcX(double radian,double v){\\n double vix = v * cos(radian);\\n double viy = v * sin(radian);\\n double t = 2 * viy / g;\\n return vix * t;\\n}\\n\\ndouble calcV(double x,int n,int b,double radian){\\n double L = 0, R = 1e10, cnt = 100;\\n while(cnt--){\\n double M = (L+R)/2;\\n if(calcX(radian,M) > x) R = M;\\n else L = M;\\n }\\n \\n double v = L,pos = 0;\\n for(int i=0;i<b;i++, pos += x){\\n for(int j=0;j<n;j++){\\n if(!(pos <= p[j] && p[j] <= pos+x)) continue;\\n double vix = v * cos(radian);\\n double viy = v * sin(radian);\\n double t = (p[j] - pos)/vix;\\n double y = -(g*t/2 - viy) * t;\\n if(y-h[j]+EPS < 0) return INF;\\n }\\n }\\n return v; \\n}\\n\\ndouble solve(double x,int n,int b){\\n double L = PI/4,R = PI/2,cnt = 100;\\n while(cnt--){\\n double M = (L+R)/2;\\n if(calcV(x,n,b,M) < INF) R = M; \\n else L = M;\\n }\\n return calcV(x,n,b,R);\\n}\\n\\nsigned main(){\\n int D,n,B;\\n cin>>D>>n>>B;\\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\\n double ans = INF;\\n for(int i=1;i<=B+1;i++) Min(ans,solve(1.0*D/i,n,i));\\n printf(\\\"%.5Lf\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.9637,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1348_2608907\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define int long long\\n#define double long double\\n#define N 20\\nusing namespace std;\\nconst int INF = 1LL<<55;\\nconst int mod = (1e9)+7;\\nconst double EPS = 1e-8;\\nconst double PI = 6.0 * asin(0.5);\\ntemplate<class T> T Max(T &a,T b){return a=max(a,b);}\\ntemplate<class T> T Min(T &a,T b){return a=min(a,b);}\\nconst double g = 1.0;\\nint p[N],h[N];\\n\\n\\ndouble calcX(double radian,double v){\\n double vix = v * cos(radian);\\n double viy = v * sin(radian);\\n double t = 2 * viy / g;\\n return vix * t;\\n}\\n\\ndouble calcV(double x,int n,int b,double radian){\\n double L = 0, R = 1e10, cnt = 100;\\n while(cnt--){\\n double M = (L+R)/2;\\n if(calcX(radian,M) > x) R = M;\\n else L = M;\\n }\\n \\n double v = L,pos = 0;\\n for(int i=0;i<b;i++, pos += x){\\n for(int j=0;j<n;j++){\\n //if(pos == p[j] || p[j] == pos+x) return INF;\\n if(!(pos <= p[j] && p[j] <= pos+x)) continue;\\n double vix = v * cos(radian);\\n double viy = v * sin(radian);\\n double t = (p[j] - pos)/vix;\\n double y = -(g*t/2 - viy) * t;\\n if(y-h[j]+EPS < 0) return INF;\\n }\\n }\\n return v; \\n}\\n\\ndouble solve(double x,int n,int b){\\n\\n double L = PI/4,R = PI/2,cnt = 100;\\n while(cnt--){\\n double M = (L+R)/2;\\n if(calcV(x,n,b,M) < INF) R = M; \\n else L = M;\\n }\\n return calcV(x,n,b,R);\\n}\\n\\n\\nsigned main(){\\n int D,n,B;\\n cin>>D>>n>>B;\\n for(int i=0;i<n;i++) cin>>p[i]>>h[i];\\n double ans = INF;\\n for(int i=1;i<=B+1;i++) Min(ans,solve(1.0*D/i,n,i));\\n printf(\\\"%.5Lf\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.9782,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1348_1841924\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-5;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n long double h_max=0;\\n rep(i,0,n){\\n cin >> p[i] >> h[i];\\n h_max=max(h_max,h[i]);\\n }\\n\\n int loop_num=1e7*6;\\n long double ans=infll;\\n long double lb=sqrtl(2*h_max)-eps,ub=d*log10l(d);\\n rep(i,0,loop_num+1){\\n long double vy=lb+(long double)i/loop_num*(ub-lb);\\n if(ans<=vy*vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx*vx) break;\\n long double tmp=vx*vx+vy*vy;\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << sqrtl(ans) << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 660,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1.854,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1348_1841920\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n long double h_max=0;\\n rep(i,0,n){\\n cin >> p[i] >> h[i];\\n h_max=max(h_max,h[i]);\\n }\\n\\n int loop_num=1e7*4;\\n long double ans=infll;\\n long double lb=sqrtl(2*h_max),ub=d*log10l(d);\\n rep(i,0,loop_num+1){\\n long double vy=lb+(long double)i/loop_num*(ub-lb);\\n if(ans<=vy*vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx*vx) break;\\n long double tmp=vx*vx+vy*vy;\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << sqrtl(ans) << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 440,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -1.5352,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1348_1841917\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n long double h_max=0;\\n rep(i,0,n){\\n cin >> p[i] >> h[i];\\n h_max=max(h_max,h[i]);\\n }\\n\\n int loop_num=1e7*4;\\n long double ans=infll;\\n long double lb=sqrtl(2*h_max),ub=d*4;\\n rep(i,0,loop_num+1){\\n long double vy=lb+(long double)i/loop_num*(ub-lb);\\n if(ans<=vy*vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx*vx) break;\\n long double tmp=vx*vx+vy*vy;\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << sqrtl(ans) << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 240,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -1.1794,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1348_1841911\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n long double h_max=0;\\n rep(i,0,n){\\n cin >> p[i] >> h[i];\\n h_max=max(h_max,h[i]);\\n }\\n\\n int loop_num=1e7;\\n long double ans=infll;\\n long double lb=sqrtl(2*h_max),ub=d;\\n rep(i,0,loop_num+1){\\n long double vy=lb+(long double)i/loop_num*(ub-lb);\\n if(ans<=vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx) break;\\n long double tmp=sqrtl(vx*vx+vy*vy);\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.05555555555555555,\n \"time_ms\": 560,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -1.6431,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1348_1841910\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n long double h_max=0;\\n rep(i,0,n){\\n cin >> p[i] >> h[i];\\n h_max=max(h_max,h[i]);\\n }\\n\\n int loop_num=1e7*2;\\n long double ans=infll;\\n rep(i,1,loop_num+1){\\n long double vy=(long double)i/loop_num*2*d;\\n if(ans<=vy) break;\\n if(vy/2*vy<h_max) continue;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx) break;\\n long double tmp=sqrtl(vx*vx+vy*vy);\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 300,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -1.2815,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1348_1841905\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n rep(i,0,n) cin >> p[i] >> h[i];\\n\\n int loop_num=1e7*3.5;\\n long double ans=infll;\\n rep(i,1,loop_num+1){\\n long double vy=(long double)i/loop_num*10*d;\\n if(ans<=vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx) break;\\n long double tmp=sqrtl(vx*vx+vy*vy);\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 650,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.7803,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1348_1841903\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define debug(x) #x << \\\"=\\\" << (x)\\n\\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define show(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define show(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\ntemplate<typename T> using vec=std::vector<T>;\\n\\nconst int inf=1<<30;\\nconst long long int infll=1LL<<62;\\nconst double eps=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n os << \\\"[\\\";\\n for (const auto &v : vec) {\\n \\tos << v << \\\",\\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\nvoid solve(){\\n int d,n,b;\\n cin >> d >> n >> b;\\n vector<long double> p(n),h(n);\\n rep(i,0,n) cin >> p[i] >> h[i];\\n\\n int loop_num=1e7*3;\\n long double ans=infll;\\n rep(i,1,loop_num+1){\\n long double vy=(long double)i/loop_num*8*d;\\n if(ans<=vy) break;\\n for(int j=b+1; j>=1; --j){\\n long double vx=(long double)d/2/vy/j;\\n if(ans<=vx) break;\\n long double tmp=sqrtl(vx*vx+vy*vy);\\n if(ans<=tmp) continue;\\n bool ok=true;\\n rep(k,0,n){\\n int l=p[k]/(2*vx*vy);\\n long double t=(long double)p[k]/vx-2*vy*l;\\n if((long double)-t*t/2+vy*t>=h[k]) continue;\\n ok=false;\\n break;\\n }\\n if(ok) ans=min(ans,tmp);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(false);\\n cout.setf(ios::fixed);\\n cout.precision(10);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 700,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -1.8409,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1348_1301745\",\n \"code_snippet\": \"// Template {{{\\n#include <bits/stdc++.h>\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nusing namespace std;\\ntypedef long long LL;\\n\\n#ifdef LOCAL\\n#include \\\"contest.h\\\"\\n#else\\n#define dump(x) \\n#endif\\n\\nclass range {\\n struct Iterator {\\n int val, inc;\\n int operator*() {return val;}\\n bool operator!=(Iterator& rhs) {return val < rhs.val;}\\n void operator++() {val += inc;}\\n };\\n Iterator i, n;\\n public:\\n range(int e) : i({0, 1}), n({e, 1}) {}\\n range(int b, int e) : i({b, 1}), n({e, 1}) {}\\n range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}\\n Iterator& begin() {return i;}\\n Iterator& end() {return n;}\\n};\\n\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\ninline bool valid(int x, int w) { return 0 <= x && x < w; }\\n\\nvoid iostream_init() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout.setf(ios::fixed);\\n cout.precision(12);\\n}\\n//}}}\\n\\nint main(){\\n iostream_init();\\n int N, B;\\n double D;\\n while(cin >> D >> N >> B) {\\n vector<double> P(N);\\n vector<double> H(N);\\n REP(i, N) cin >> P[i] >> H[i];\\n\\n double ans = 1e16;\\n\\n for(int b = 0; b <= B; b++) {\\n double p = D / (b+1);\\n double lb = M_PI / 4;\\n double ub = M_PI / 2;\\n double v = 0;\\n REP(_, 60) {\\n double th = (lb+ub) / 2;\\n double vx = sqrt(p / 2.0 / tan(th));\\n\\n v = vx/cos(th); // update\\n\\n bool ok = true;\\n REP(i, N) {\\n double x = P[i] - int(P[i] / p) * p;\\n double y = -(0.5/vx/vx)*x*x + tan(th)*x;\\n if(y < H[i]) ok = false;\\n }\\n if(ok) {\\n ub = th;\\n } else {\\n lb = th;\\n }\\n }\\n\\n ans = min(ans, v);\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\\n\\n/* vim:set foldmethod=marker: */\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1404,\n \"score_of_the_acc\": -0.101,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1348_1144005\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\n#define DEBUG(x) cerr << #x << \\\" = \\\" << x << endl\\n\\ntypedef long double D;\\n\\nstruct Node {\\n D p;\\n D h;\\n};\\n\\nconst D EPS = 1e-10;\\n\\nint sig(D a, D b) {\\n if(a < b - EPS) return -1;\\n if(a > b + EPS) return +1;\\n return 0;\\n}\\n\\nbool check(D th, D speed, D start, D end, const vector<Node> &objs) {\\n D vx = speed * cos(th);\\n D vy = speed * sin(th);\\n bool ok = true;\\n for(int i = 0; i < (int)objs.size(); ++i) {\\n if(sig(start, objs[i].p) <= 0 && sig(objs[i].p, end) <= 0) {\\n D x = objs[i].p - start;\\n D y = -(x*x/(2*vx*vx)) + vy*x/vx;\\n if(sig(y, objs[i].h) < 0) {\\n ok = false;\\n }\\n }\\n }\\n return ok;\\n}\\n\\nD speed(D th, D len) {\\n return sqrt(len / (sin(2*th)));\\n}\\n\\nvoid test(D th, D len, D pos) {\\n D sp = speed(th, len);\\n D vx = sp * cos(th);\\n D vy = sp * sin(th);\\n D y = -(pos*pos/(2*vx*vx)) + (vy/vx)*pos;\\n DEBUG(y);\\n}\\n\\nint main() {\\n D distance;\\n int N, B;\\n cin >> distance >> N >> B;\\n vector<Node> objs(N);\\n for(int i = 0; i < N; ++i) {\\n cin >> objs[i].p >> objs[i].h;\\n }\\n B++;\\n D ans = 1e20;\\n for(int b = 1; b <= B; ++b) {\\n for(int i = 0; i < b; ++i) {\\n D start = distance / b * i;\\n D end = distance / b * (i + 1);\\n D len = abs(end - start);\\n D estm;\\n // DEBUG(start);\\n // DEBUG(end);\\n // DEBUG(len);\\n // DEBUG(speed(M_PI/4, len));\\n // D vx = speed(M_PI/4, len)*cos(M_PI/4);\\n // D vy = speed(M_PI/4, len)*sin(M_PI/4);\\n // DEBUG(-(len*len/(2*vx*vx))+(vy/vx)*len);\\n // DEBUG(\\\"false\\\");\\n D lb = M_PI/4, ub = M_PI/2;\\n for(int t = 0; t < 300; ++t) {\\n D mid = (lb + ub) / 2;\\n if(check(mid, speed(mid, len), start, end, objs)) {\\n ub = mid;\\n }\\n else {\\n lb = mid;\\n }\\n }\\n estm = ub;\\n D estm_sp = speed(estm, len);\\n bool ok = true;\\n for(int j = 0; j < b; ++j) {\\n D start2 = distance / b * j;\\n D end2 = distance / b * (j + 1);\\n if(check(estm, estm_sp, start2, end2, objs) == false) {\\n ok = false;\\n }\\n }\\n if(ok) {\\n ans = min(ans, estm_sp);\\n }\\n }\\n }\\n cout.setf(ios::fixed); cout.precision(10);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1308,\n \"score_of_the_acc\": -0.0169,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1348_1101727\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n#include <sstream>\\n#include <cstring>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <numeric>\\n#include <cctype>\\n#include <tuple>\\n#include <array>\\n#include <climits>\\n#include <bitset>\\n#include <cassert>\\n#include <ctime>\\n#include <list>\\n#include <complex>\\n#ifdef _MSC_VER\\n#include <agents.h>\\n#endif\\n\\n#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)\\n#define rep(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define REV(v) v.rbegin(), v.rend()\\n#define MEMSET(v, s) memset(v, s, sizeof(v))\\n#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())\\n#define MP make_pair\\n#define MT make_tuple\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\n\\nconst double EPS = 1e-9;\\n\\nbool check(double x, double y, double vx, double vy){\\n\\tdouble yy = -1 / 2. / vx / vx*x*x + vy / vx*x;\\n\\treturn y < yy + EPS;\\n}\\n\\nint main(){\\n\\tint d, n, b;\\n\\tcin >> d >> n >> b;\\n\\n\\tvector<int> p(n), h(n);\\n\\trep(i, n) cin >> p[i] >> h[i];\\n\\n\\tdouble ans = 1e100;\\n\\tFOR(i, 1, b + 2){\\n\\t\\tdouble len = (double)d / i;\\n\\n\\t\\tdouble lb = 0, ub = sqrt(len / 2);\\n\\t\\trep(j, 10000){\\n\\t\\t\\tdouble mid = (lb + ub) / 2;\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\trep(k, n){\\n\\t\\t\\t\\tdouble pp = p[k];\\n\\t\\t\\t\\twhile (pp > len - EPS) pp -= len;\\n\\t\\t\\t\\tok &= check(pp, h[k], mid, len / 2 / mid);\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) lb = mid;\\n\\t\\t\\telse ub = mid;\\n\\t\\t}\\n\\t\\tif (lb < EPS) continue;\\n\\t\\tdouble vx = lb, vy = len / 2 / vx;\\n\\t\\tans = min(ans, sqrt(vx*vx+vy*vy));\\n\\t}\\n\\tcout.setf(ios::fixed);\\n\\tcout.precision(10);\\n\\tcout << ans << endl;\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1268,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":799,"cells":{"group_id":{"kind":"string","value":"aoj_1349_cpp"},"problem_description":{"kind":"string","value":"Problem E:\nAutomotive Navigation\nThe International Commission for Perfect Cars (ICPC) has constructed a city scale test course for advanced driver assistance systems. Your company, namely the Automotive Control Machines (ACM), is appointed by ICPC to make test runs on the course.\nThe test course consists of streets, each running straight either east-west or north-south. No streets of the test course have dead ends, that is, at each end of a street, it meets another one. There are no grade separated streets either, and so if a pair of orthogonal streets run through the same geographical location, they always meet at a crossing or a junction, where a car can turn from one to the other. No U-turns are allowed on the test course and a car never moves outside of the streets.\nOops! You have just received an error report telling that the GPS (Global Positioning System) unit of a car running on the test course was broken and the driver got lost. Fortunately, however, the odometer and the electronic compass of the car are still alive.\nYou are requested to write a program to estimate the current location of the car from available information. You have the car's location just before its GPS unit was broken. Also, you can remotely measure the running distance and the direction of the car once every time unit. The measured direction of the car is one of north, east, south, and west. If you measure the direction of the car while it is making a turn, the measurement result can be the direction either before or after the turn. You can assume that the width of each street is zero.\nThe car's direction when the GPS unit was broken is not known. You should consider every possible direction consistent with the street on which the car was running at that time.\nInput\nThe input consists of a single test case. The first line contains four integers $n$, $x_0$, $y_0$, $t$, which are the number of streets ($4 \\leq n \\leq 50$), $x$- and $y$-coordinates of the car at time zero, when the GPS unit was broken, and the current time ($1 \\leq t \\leq 100$), respectively. $(x_0, y_0)$ is of course on some street. This is followed by $n$ lines, each containing four integers $x_s$, $y_s$, $x_e$, $y_e$ describing a street from $(x_s, y_s)$ to $(x_e, y_e)$ where $(x_s, y_s) \\ne (x_e, y_e)$. Since each street runs either east-west or north-south, $x_s = x_e$ or $y_s = y_e$ is also satisfied. You can assume that no two parallel streets overlap or meet. In this coordinate system, the $x$- and $y$-axes point east and north, respectively. Each input coordinate is non-negative and at most 50. Each of the remaining $t$ lines contains an integer $d_i$ ($1 \\leq d_i \\leq 10$), specifying the measured running distance from time $i − 1$ to $i$, and a letter $c_i$, denoting the measured direction of the car at time $i$ and being either\nN\nfor north,\nE\nfor east,\nW\nfor west, or\nS\nfor south.\nOutput\nOutput all the possible current locations of the car that are consistent with the measurements. If they are\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1349_10848168","code_snippet":"#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\nbool go[55][55][4];\nbool f[55][55][1010][4];\nstruct HN {\n\tint x, y, s, d;\n\tHN() {}\n\tHN(int x, int y, int s, int d): x(x), y(y), s(s), d(d) {}\n};\nint N, SX, SY, T, S;\nstruct P {\n\tint x, y;\n\tP() {}\n\tP(int x, int y): x(x), y(y) {}\n\tbool operator < (const P &t) const {\n\t\tif(x != t.x) {\n\t\t\treturn x < t.x;\n\t\t}\n\t\treturn y < t.y;\n\t}\n};\nchar ch[256];\nint dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};\nint dir[1010];\nbool check(int s, int d) {\n\tif(dir[s] == -1) {\n\t\treturn true;\n\t}\n\treturn dir[s] == d;\n}\nvoid process() {\n\tmemset(f, 0, sizeof(f));\n\tstd::queue<HN> q;\n\tfor(int i = 0; i < 4; i ++) {\n\t\tif(go[SX][SY][i]) {\n\t\t\tf[SX][SY][0][i] = true;\n\t\t\tq.push(HN(SX, SY, 0, i));\n\t\t}\n\t}\n\twhile(!q.empty()) {\n\t\tHN hn = q.front();\n\t\tq.pop();\n\t\tint x = hn.x, y = hn.y, s = hn.s, d = hn.d;\n\t\tif(s >= S) {\n\t\t\tcontinue;\n\t\t}\n\t\tint nx = x + dx[d], ny = y + dy[d], ns = s + 1;\n\t\tfor(int i = -1; i <= 1; i ++) {\n\t\t\tint nd = (d + i + 4) % 4;\n\t\t\tif(go[nx][ny][nd] && (check(ns, d) || check(ns, nd)) && !f[nx][ny][ns][nd]) {\n\t\t\t\tf[nx][ny][ns][nd] = true;\n\t\t\t\tq.push(HN(nx, ny, ns, nd));\n\t\t\t}\n\t\t}\n\t}\n\n\tstd::vector<P> ans;\n\tfor(int i = 0; i <= 50; i ++) {\n\t\tfor(int j = 0; j <= 50; j ++) {\n\t\t\tbool ok = false;\n\t\t\tfor(int k = 0; k < 4; k ++) {\n\t\t\t\tif(f[i][j][S][k]) {\n\t\t\t\t\tok = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ok) {\n\t\t\t\tans.push_back(P(i, j));\n\t\t\t}\n\t\t}\n\t}\n\tstd::sort(ans.begin(), ans.end());\n\tint n = ans.size();\n\tfor(int i = 0; i < n; i ++) {\n\t\tprintf(\"%d %d\\n\", ans[i].x, ans[i].y);\n\t}\n}\nint main() {\n\t//freopen(\"test.in\", \"rb\", stdin);\n\tch['N'] = 0, ch['W'] = 1, ch['S'] = 2, ch['E'] = 3;\n\twhile(scanf(\"%d%d%d%d\", &N, &SX, &SY, &T) == 4) {\n\t\tmemset(go, 0, sizeof(go));\n\t\tint x1, y1, x2, y2;\n\t\tfor(int i = 0; i < N; i ++) {\n\t\t\tscanf(\"%d%d%d%d\", &x1, &y1, &x2, &y2);\n\t\t\tif(x1 == x2) {\n\t\t\t\tif(y1 > y2) {\n\t\t\t\t\tstd::swap(y1, y2);\n\t\t\t\t}\n\t\t\t\tfor(int i = y1; i <= y2; i ++) {\n\t\t\t\t\tif(i != y1) {\n\t\t\t\t\t\tgo[x1][i][2] = true;\n\t\t\t\t\t}\n\t\t\t\t\tif(i != y2) {\n\t\t\t\t\t\tgo[x1][i][0] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif(x1 > x2) {\n\t\t\t\t\tstd::swap(x1, x2);\n\t\t\t\t}\n\t\t\t\tfor(int i = x1; i <= x2; i ++) {\n\t\t\t\t\tif(i != x1) {\n\t\t\t\t\t\tgo[i][y1][1] = true;\n\t\t\t\t\t}\n\t\t\t\t\tif(i != x2) {\n\t\t\t\t\t\tgo[i][y1][3] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(dir, -1, sizeof(dir));\n\t\tS = 0;\n\t\tint d;\n\t\tchar s[5];\n\t\tfor(int i = 0; i < T; i ++) {\n\t\t\tscanf(\"%d%s\", &d, s);\n\t\t\tS += d;\n\t\t\tdir[S] = ch[(int)s[0]];\n\t\t}\n\t\tprocess();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":14968,"score_of_the_acc":-0.3353,"final_rank":16},{"submission_id":"aoj_1349_10826894","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n#define NUM 51\n\nenum DIR{\n\tNorth,\n\tEast,\n\tSouth,\n\tWest,\n};\n\nint diff_x[4] = {0,1,0,-1},diff_y[4] = {1,0,-1,0};\nbool can_move[NUM][NUM][4],dp[2][NUM][NUM][4];\nint table[128];\nDIR dir_array[4] = {North,East,South,West};\n\nint N;\n\nbool rangeCheck(int x,int y){\n\n\tif(x >= 0 && x < NUM && y >= 0 && y < NUM)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nint main(){\n\n\ttable['N'] = 0;\n\ttable['E'] = 1;\n\ttable['S'] = 2;\n\ttable['W'] = 3;\n\n\tint start_x,start_y,T;\n\tscanf(\"%d %d %d %d\",&N,&start_x,&start_y,&T);\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tfor(int p = 0; p < 4; p++)can_move[i][k][p] = false;\n\t\t}\n\t}\n\n\t//移動可能情報の作成\n\tint x1,y1,x2,y2;\n\tfor(int loop = 0; loop < N; loop++){\n\n\t\tscanf(\"%d %d %d %d\",&x1,&y1,&x2,&y2);\n\n\t\tif(x1 == x2){ //縦の移動\n\n\t\t\tfor(int y = min(y1,y2); y < max(y1,y2); y++){\n\t\t\t\tcan_move[x1][y][North] = true;\n\t\t\t\tcan_move[x1][y+1][South] = true;\n\t\t\t}\n\n\t\t}else{ //横の移動\n\n\t\t\tfor(int x = min(x1,x2); x < max(x1,x2); x++){\n\t\t\t\tcan_move[x][y1][East] = true;\n\t\t\t\tcan_move[x+1][y1][West] = true;\n\t\t\t}\n\t\t}\n\t}\n\n\tint CURRENT = 0,NEXT = 1;\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tfor(int p = 0; p < 4; p++){\n\t\t\t\tdp[CURRENT][i][k][p] = false; //dp[CURRENT/NEXT][x][y][dir] = true/false\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < 4; i++)dp[CURRENT][start_x][start_y][i] = true;\n\n\tint dist,next_x,next_y;\n\tchar buf[2];\n\n\tDIR dir;\n\n\tfor(int loop = 0; loop < T; loop++){\n\n\t\tscanf(\"%d %s\",&dist,buf);\n\t\tdir = dir_array[table[buf[0]]];\n\n\t\tfor(int count = 0; count < dist; count++){ //合計でdist移動する\n\n\t\t\t//dp[NEXT]の初期化\n\t\t\tfor(int i = 0; i < NUM; i++){\n\t\t\t\tfor(int k = 0; k < NUM; k++){\n\t\t\t\t\tfor(int p = 0; p < 4; p++){\n\t\t\t\t\t\tdp[NEXT][i][k][p] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t//dp[CURRENT]を走査\n\t\t\tfor(int i = 0; i < NUM; i++){ //xのループ\n\t\t\t\tfor(int k = 0; k < NUM; k++){ //yのループ\n\t\t\t\t\tfor(int p = 0; p < 4; p++){ //今向いている方向\n\t\t\t\t\t\tif(!dp[CURRENT][i][k][p])continue;\n\n\t\t\t\t\t\tfor(int a = 0; a < 4; a++){ //進んだ後に向く方向\n\t\t\t\t\t\t\tif(abs(p-a) == 2)continue; //Uターン禁止\n\n\t\t\t\t\t\t\tnext_x = i+diff_x[p]; //今向いている向きに進む\n\t\t\t\t\t\t\tnext_y = k+diff_y[p];\n\n\t\t\t\t\t\t\tif(rangeCheck(next_x,next_y) == false || can_move[i][k][p] == false\n\t\t\t\t\t\t\t\t\t|| can_move[next_x][next_y][a] == false)continue; //範囲外または行けないならSKIP\n\n\t\t\t\t\t\t\tif(count < dist-1){\n\n\t\t\t\t\t\t\t\tdp[NEXT][next_x][next_y][a] = true;\n\n\t\t\t\t\t\t\t}else{ //count == dist-1:向きを考慮する!!\n\n\t\t\t\t\t\t\t\tif(dir_array[p] == dir || dir_array[a] == dir){\n\t\t\t\t\t\t\t\t\tdp[NEXT][next_x][next_y][a] = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tswap(CURRENT,NEXT);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tfor(int k = 0; k < NUM; k++){\n\t\t\tfor(int a = 0; a < 4; a++){\n\t\t\t\tif(dp[CURRENT][i][k][a]){\n\t\t\t\t\tprintf(\"%d %d\\n\",i,k);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3592,"score_of_the_acc":-0.0123,"final_rank":2},{"submission_id":"aoj_1349_10480164","code_snippet":"// AOJ #1349 Automotive Navigation\n// 2025.5.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint g[52][52];\nbool dp[1001][52][52][4];\nint meas[1001];\n\nconst int dx[4] = {0, 1, -1, 0};\nconst int dy[4] = {1, 0, 0, -1};\n\nint dir_id(char c){\n if(c=='N') return 0;\n if(c=='E') return 1;\n if(c=='W') return 2;\n if(c=='S') return 3;\n return -1;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n, sx, sy, t;\n cin >> n >> sx >> sy >> t;\n\n for(int i=0;i<n;i++){\n int x1,y1,x2,y2;\n cin >> x1 >> y1 >> x2 >> y2;\n if(x1==x2){\n if(y1>y2) swap(y1,y2);\n for(int y=y1;y<y2;y++){\n g[x1][y] |= 1<<0;\n g[x1][y+1] |= 1<<3;\n }\n } else {\n if(x1>x2) swap(x1,x2);\n for(int x=x1;x<x2;x++){\n g[x][y1] |= 1<<1;\n g[x+1][y1] |= 1<<2;\n }\n }\n }\n\n int sumd = 0;\n for(int i=0;i<=1000;i++) meas[i] = -1;\n\n for(int i=0;i<t;i++){\n int d; char buf[5];\n cin >> d >> buf;\n sumd += d;\n meas[sumd] = dir_id(buf[0]);\n }\n\n for(int d=0;d<4;d++) dp[0][sx][sy][d] = true;\n\n for(int s=0; s<sumd; s++){\n for(int x=0; x<=50; x++){\n for(int y=0; y<=50; y++){\n for(int l=0; l<4; l++){\n if(!dp[s][x][y][l]) continue;\n int mv = meas[s];\n for(int p=0; p<4; p++){\n if(!(g[x][y] & (1<<p))) continue;\n if(l + p == 3) continue;\n if(mv != -1 && p!=mv && l!=mv) continue;\n int nx = x + dx[p], ny = y + dy[p];\n if(nx<0||nx>50||ny<0||ny>50) continue;\n dp[s+1][nx][ny][p] = true;\n }\n }\n }\n }\n }\n\n int final_mv = meas[sumd];\n set<pair<int,int>> ans;\n for(int x=0;x<=50;x++){\n for(int y=0;y<=50;y++){\n bool ok=false;\n for(int k=0;k<4;k++){\n if(!dp[sumd][x][y][k]) continue;\n if(k == final_mv){ ok=true; break; }\n if(k + final_mv != 3 && (g[x][y] & (1<<final_mv))){ ok=true; break; }\n }\n if(ok) ans.emplace(x,y);\n }\n }\n for(auto &p: ans) cout << p.first << \" \" << p.second << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":11188,"score_of_the_acc":-0.228,"final_rank":13},{"submission_id":"aoj_1349_10002993","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nconst int mx=60;\nconst int dmx=1010;\nint Convert(int x,int y){return x*mx+y;}\nconst string str=\"NESW\";\nconst int dx[]={0,1,0,-1};\nconst int dy[]={1,0,-1,0};\nbool seen[mx][mx][4][dmx];\n\nint main(){\n\tint N,sx,sy,T;\n\tcin>>N>>sx>>sy>>T;\n\tsx+=2,sy+=2;\n\n\tvector<vector<int>>G(mx*mx);\n\twhile(N--){\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\ta+=2,b+=2,c+=2,d+=2;\n\t\tif(a==c){\n\t\t\tfor(int i=min(b,d);i<max(b,d);i++){\n\t\t\t\tG[Convert(a,i)].push_back(Convert(a,i+1));\n\t\t\t\tG[Convert(a,i+1)].push_back(Convert(a,i));\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int i=min(a,c);i<max(a,c);i++){\n\t\t\t\tG[Convert(i,b)].push_back(Convert(i+1,b));\n\t\t\t\tG[Convert(i+1,b)].push_back(Convert(i,b));\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int>info(dmx,-1);\n\tint goald=0,sum=0;\n\tfor(int i=0;i<T;i++){\n\t\tint d;char c;cin>>d>>c;\n\t\tsum+=d;\n\t\tgoald=sum;\n\t\tinfo[sum]=str.find(c);\n\t}\n\n\t//x,y,px,py,dir,dist\n\tusing tup=tuple<int,int,int,int>;\n\tqueue<tup> que;\n\tque.push({sx,sy,-1,0});\n\n\tset<pair<int,int>>ans;\n\n\twhile(!que.empty()){\n\t\tauto[x,y,dir,dist]=que.front();que.pop();\n\n\t\tif(dist>goald)break;\n\n\n\t\tfor(int d=0;d<4;d++){\n\t\t\tint nx=x+dx[d],ny=y+dy[d];\n\t\t\tif(count(G[Convert(x,y)].begin(),G[Convert(x,y)].end(),Convert(nx,ny))==0)continue;\n\t\t\tif(seen[nx][ny][d][dist+1])continue;\n\t\t\tif(dir!=-1&&(dir+4-d)%4==2)continue;\n\t\t\tif(info[dist]!=-1&&info[dist]!=dir&&info[dist]!=d)continue;\n\n\t\t\tseen[nx][ny][d][dist+1]=true;\n\t\t\tif(dist==goald&&(info[dist]==dir||info[dist]==d)){\n\t\t\t\tans.insert({x-2,y-2});\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tque.push({nx,ny,d,dist+1});\n\t\t}\n\t}\n\n\tfor(auto[x,y]:ans)cout<<x<<' '<<y<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":14268,"score_of_the_acc":-0.3176,"final_rank":15},{"submission_id":"aoj_1349_10002974","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nconst int mx=60;\nconst int dmx=1010;\nint Convert(int x,int y){return x*mx+y;}\nconst string str=\"NESW\";\nconst int dx[]={0,1,0,-1};\nconst int dy[]={1,0,-1,0};\nbool seen[mx][mx][4][dmx];\n\nint main(){\n\tint N,sx,sy,T;\n\tcin>>N>>sx>>sy>>T;\n\tsx+=2,sy+=2;\n\n\tvector<vector<int>>G(mx*mx);\n\twhile(N--){\n\t\tint a,b,c,d;\n\t\tcin>>a>>b>>c>>d;\n\t\ta+=2,b+=2,c+=2,d+=2;\n\t\tif(a==c){\n\t\t\tfor(int i=min(b,d);i<max(b,d);i++){\n\t\t\t\tG[Convert(a,i)].push_back(Convert(a,i+1));\n\t\t\t\tG[Convert(a,i+1)].push_back(Convert(a,i));\n\t\t\t}\n\t\t}else{\n\t\t\tfor(int i=min(a,c);i<max(a,c);i++){\n\t\t\t\tG[Convert(i,b)].push_back(Convert(i+1,b));\n\t\t\t\tG[Convert(i+1,b)].push_back(Convert(i,b));\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<int>info(dmx,-1);\n\tint goald=0,sum=0;\n\tfor(int i=0;i<T;i++){\n\t\tint d;char c;cin>>d>>c;\n\t\tsum+=d;\n\t\tgoald=sum;\n\t\tinfo[sum]=str.find(c);\n\t}\n\n\t//x,y,px,py,dir,dist\n\tusing tup=tuple<int,int,int,int>;\n\tvector<tup> que;\n\tque.push_back({sx,sy,-1,0});\n\n\tset<pair<int,int>>ans;\n\n\t//while(!que.empty()){\n\tfor(int t=0;t<(int)que.size();t++){\n\t\tauto[x,y,dir,dist]=que[t];\n\n\t\tif(dist>goald)continue;\n\n\n\t\tfor(int d=0;d<4;d++){\n\t\t\tint nx=x+dx[d],ny=y+dy[d];\n\t\t\tif(count(G[Convert(x,y)].begin(),G[Convert(x,y)].end(),Convert(nx,ny))==0)continue;\n\t\t\tif(seen[nx][ny][d][dist+1])continue;\n\t\t\tif(dir!=-1&&(dir+4-d)%4==2)continue;\n\t\t\tif(info[dist]!=-1&&info[dist]!=dir&&info[dist]!=d)continue;\n\n\t\t\tif(dist==goald&&(info[dist]==dir||info[dist]==d)){\n\t\t\t\tans.insert({x-2,y-2});\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tque.push_back({nx,ny,d,dist+1});\n\t\t}\n\t}\n\n\tfor(auto[x,y]:ans)cout<<x<<' '<<y<<endl;\n}","accuracy":0.03571428571428571,"time_ms":20,"memory_kb":36200,"score_of_the_acc":-0.9405,"final_rank":20},{"submission_id":"aoj_1349_9808763","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\nusing i64 = long long;\nusing f64 = long double;\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n \n int n, x0, y0, t; cin >> n >> x0 >> y0 >> t;\n const int M = 51;\n auto h = [&](int x, int y) { return x * M + y; };\n vector to(M * M, vector(4, int(-1)));\n rep(_, n) {\n int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;\n if(sx == ex) {\n const int x = sx;\n if(sy > ey) swap(sy, ey);\n srep(y, sy, ey) {\n const int u = h(x, y), v = h(x, y + 1);\n to[u][0] = v;\n to[v][2] = u;\n }\n } else {\n const int y = sy;\n if(sx > ex) swap(sx, ex);\n srep(x, sx, ex) {\n const int u = h(x, y), v = h(x + 1, y);\n to[u][1] = v;\n to[v][3] = u;\n }\n }\n }\n\n vector<int> dir = {-1};\n rep(_, t) {\n int d; char c; cin >> d >> c;\n rep(i, d-1) dir.push_back(-1);\n if(c == 'N') dir.push_back(0);\n if(c == 'E') dir.push_back(1);\n if(c == 'S') dir.push_back(2);\n if(c == 'W') dir.push_back(3);\n }\n const int LAST = dir.back();\n dir.pop_back();\n\n vector dp(M * M, vector(4, int(0)));\n dp[h(x0, y0)] = vector(4, int(1));\n for(int cons : dir) {\n vector nt(M * M, vector(4, int(0)));\n rep(i, M * M) rep(d, 4) if(dp[i][d]) {\n rep(nd, 4) {\n if(abs(d - nd) == 2) continue;\n if(cons != -1 and d != cons and nd != cons) continue;\n const int ni = to[i][nd];\n if(ni == -1) continue;\n nt[ni][nd] = 1;\n }\n }\n dp = move(nt);\n }\n\n vector<pair<int, int>> ans;\n rep(i, M * M) {\n bool ok = [&] {\n rep(d, 4) {\n if(abs(d - LAST) == 2) continue;\n if(dp[i][d]) {\n if(d == LAST) return true;\n if(to[i][LAST] != -1) return true;\n }\n }\n return false;\n }();\n if(ok) ans.push_back({i / M, i % M});\n }\n sort(ans.begin(), ans.end());\n for(auto [x, y] : ans) cout << x << \" \" << y << \"\\n\";\n}","accuracy":1,"time_ms":50,"memory_kb":3900,"score_of_the_acc":-0.0297,"final_rank":5},{"submission_id":"aoj_1349_8493021","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\n#define each(e, x) for(auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template<typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\n\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\n\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n int n, x0, y0, t;\n cin >> n >> x0 >> y0 >> t;\n x0 *= 2, y0 *= 2;\n int h = 101, w = 101;\n vector<vector<bool>> road(h, vector<bool>(w, false));\n rep(i, n) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n x1 *= 2, y1 *= 2, x2 *= 2, y2 *= 2;\n if (x1 == x2) {\n rep2(y, min(y1, y2), max(y1, y2) + 1) road[y][x1] = true;\n }\n else {\n rep2(x, min(x1, x2), max(x1, x2) + 1) road[y2][x] = true;\n }\n }\n vector<int> d(t);\n vector<char> dirs(t);\n rep(i, t) cin >> d[i] >> dirs[i], d[i] *= 2;\n int sd = accumulate(all(d), 0);\n vector<char> dl(sd + 1, '.');\n int ns = 0;\n rep(i, t) ns += d[i], dl[ns] = dirs[i];\n string dc = \"ENWS\";\n int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n vector f(h, vector(w, vector(4, 0)));\n queue<pair<pii, int>> que;\n auto check = [&](int ny, int nx, int dir) ->bool {\n int ney = ny + dy[dir], nex = nx + dx[dir];\n if (ney < 0 || h <= ney || nex < 0 || w <= nex)\n return false;\n return road[ney][nex];\n };\n rep(dir, 4) if (check(y0, x0, dir)) f[y0][x0][dir] = 1, que.emplace(pair(y0, x0), dir);\n rep(nt, sd) {\n queue<pair<pii, int>> nque;\n vector nf(h, vector(w, vector(4, 0)));\n while (sz(que)) {\n auto [yx, ndir] = que.front();\n que.pop();\n auto [ny, nx] = yx;\n if (nt == sd)\n continue;\n int ney = ny + dy[ndir], nex = nx + dx[ndir];\n rep(dd, 4) {\n if (dd == 2)\n continue;\n int dir = (ndir + dd) % 4;\n if (!check(ney, nex, dir) || (dl[nt + 1] != '.' && dl[nt + 1] != dc[dir] && dl[nt + 1] != dc[ndir]))\n continue;\n if (!nf[ney][nex][dir])\n nf[ney][nex][dir] = 1, nque.emplace(pair(ney, nex), dir);\n }\n }\n swap(f, nf);\n swap(que, nque);\n }\n rep(x, w) rep(y, h) {\n rep(dir, 4) {\n if (f[y][x][dir]) {\n cout << x / 2 << ' ' << y / 2 << endl;\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":420,"memory_kb":4604,"score_of_the_acc":-0.1298,"final_rank":11},{"submission_id":"aoj_1349_7235414","code_snippet":"#include <iostream>\nusing namespace std;\n\n// Input\nint N, SX, SY, T;\nint AX[1009], AY[1009], BX[1009], BY[1009];\nint D[1009]; char C[1009];\nint Total_Time, Direction[1009];\n\n// Dynamic Programming\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0};\nbool Road[1009][1009];\nbool dp[1009][109][109][4];\n\nbool check(int ax, int ay) {\n\tif (ax < 0 || ay < 0 || ax > 100 || ay > 100) return false;\n\treturn Road[ax][ay];\n}\n\nvoid Transition(int tm, int cx, int cy, int dir) {\n\tint dir0 = (dir + 0) % 4;\n\tint dir1 = (dir + 1) % 4;\n\tint dir3 = (dir + 3) % 4;\n\tcx += dx[dir];\n\tcy += dy[dir];\n\t\n\t// Pattern 1: No turn\n\tif (check(cx * 2 + dx[dir0], cy * 2 + dy[dir0]) == true) {\n\t\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0) {\n\t\t\tdp[tm+1][cx][cy][dir0] = true;\n\t\t}\n\t}\n\t\n\t// Pattern 2: Left Turn\n\tif (check(cx * 2 + dx[dir3], cy * 2 + dy[dir3]) == true) {\n\t\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0 || Direction[tm+1] == dir3) {\n\t\t\tdp[tm+1][cx][cy][dir3] = true;\n\t\t}\n\t}\n\t\n\t// Pattern 3: Right Turn\n\tif (check(cx * 2 + dx[dir1], cy * 2 + dy[dir1]) == true) {\n\t\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0 || Direction[tm+1] == dir1) {\n\t\t\tdp[tm+1][cx][cy][dir1] = true;\n\t\t}\n\t}\n}\n\nint main() {\n\t// Input\n\tcin >> N >> SX >> SY >> T;\n\tfor (int i = 1; i <= N; i++) {\n\t\tcin >> AX[i] >> AY[i] >> BX[i] >> BY[i];\n\t\tif (AX[i] > BX[i]) swap(AX[i], BX[i]);\n\t\tif (AY[i] > BY[i]) swap(AY[i], BY[i]);\n\t\tfor (int j = AX[i] * 2; j <= BX[i] * 2; j++) {\n\t\t\tfor (int k = AY[i] * 2; k <= BY[i] * 2; k++) Road[j][k] = true;\n\t\t}\n\t}\n\tfor (int i = 0; i <= 1000; i++) Direction[i] = -1;\n\tfor (int i = 0; i < T; i++) {\n\t\tcin >> D[i] >> C[i];\n\t\tTotal_Time += D[i];\n\t\tif (C[i] == 'N') Direction[Total_Time] = 0;\n\t\tif (C[i] == 'E') Direction[Total_Time] = 1;\n\t\tif (C[i] == 'S') Direction[Total_Time] = 2;\n\t\tif (C[i] == 'W') Direction[Total_Time] = 3;\n\t}\n\t\n\t// Dynamic Programming\n\tif (check(SX * 2 + dx[0], SY * 2 + dy[0]) == true) dp[0][SX][SY][0] = true;\n\tif (check(SX * 2 + dx[1], SY * 2 + dy[1]) == true) dp[0][SX][SY][1] = true;\n\tif (check(SX * 2 + dx[2], SY * 2 + dy[2]) == true) dp[0][SX][SY][2] = true;\n\tif (check(SX * 2 + dx[3], SY * 2 + dy[3]) == true) dp[0][SX][SY][3] = true;\n\tfor (int i = 0; i < Total_Time; i++) {\n\t\tfor (int j = 0; j <= 50; j++) {\n\t\t\tfor (int k = 0; k <= 50; k++) {\n\t\t\t\tfor (int l = 0; l < 4; l++) {\n\t\t\t\t\tif (dp[i][j][k][l] == false) continue;\n\t\t\t\t\t// cout << i << \" \" << j << \" \" << k << \" \" << l << endl;\n\t\t\t\t\tTransition(i, j, k, l);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t// Output\n\tfor (int i = 0; i <= 50; i++) {\n\t\tfor (int j = 0; j <= 50; j++) {\n\t\t\tbool flag = false;\n\t\t\tfor (int k = 0; k < 4; k++) {\n\t\t\t\tif (dp[Total_Time][i][j][k] == true) flag = true;\n\t\t\t}\n\t\t\tif (flag == true) cout << i << \" \" << j << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":38372,"score_of_the_acc":-1,"final_rank":17},{"submission_id":"aoj_1349_6740595","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n using type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n using type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[value % 10];\n value /= 10;\n } while (value != 0);\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n __int128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n if (s[0] == '-') ret = -ret;\n return ret;\n}\n__uint128_t parse_u128(std::string& s) {\n __uint128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n std::string s;\n in >> s;\n v = parse_i128(s);\n return in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n std::string s;\n in >> s;\n v = parse_u128(s);\n return in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n (std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n std::string res;\n if (bit_num >= 0) {\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n } else {\n for (; val; val >>= 1) res += '0' + (val & 1);\n std::reverse(res.begin(), res.end());\n }\n return res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n std::vector<T> res;\n for (; val; val /= base) res.push_back(val % base);\n if (res.empty()) res.push_back(T{ 0 });\n return res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n auto res = digits_low_to_high(val, base);\n std::reverse(res.begin(), res.end());\n return res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n std::ostringstream ss;\n for (auto it = v.begin(); it != v.end();) {\n ss << *it;\n if (++it != v.end()) ss << sep;\n }\n ss << end;\n return ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_{};\n\n// ! code from here\n\nconstexpr int K = 50;\n\nconstexpr int dx[4]{ 1, 0, -1, 0 };\nconstexpr int dy[4]{ 0, 1, 0, -1 };\nconstexpr int E = 0, N = 1, W = 2, S = 3;\n\nint main() {\n array<int, 256> ch_to_d{};\n ch_to_d['E'] = E;\n ch_to_d['N'] = N;\n ch_to_d['W'] = W;\n ch_to_d['S'] = S;\n\n input(int, n, x0, y0, t);\n\n vector h(K, vector<int8_t>(K + 1, false));\n vector v(K + 1, vector<int8_t>(K, false));\n\n loop(n) {\n input(int, x1, y1, x2, y2);\n\n if (x1 == x2) {\n if (y1 > y2) swap(y1, y2);\n rep(y, y1, y2) {\n v[x1][y] = true;\n }\n } else if (y1 == y2) {\n if (x1 > x2) swap(x1, x2);\n rep(x, x1, x2) {\n h[x][y1] = true;\n }\n }\n }\n\n auto try_succ = [&](int x, int y, int d) -> optional<pair<int, int>> {\n if (d == E) {\n if (x == K or not h[x][y]) return std::nullopt;\n return pair{ x + 1, y };\n } else if (d == W) {\n if (x == 0 or not h[x - 1][y]) return std::nullopt;\n return pair{ x - 1, y };\n } else if (d == N) {\n if (y == K or not v[x][y]) return std::nullopt;\n return pair{ x, y + 1 };\n } else {\n if (y == 0 or not v[x][y - 1]) return std::nullopt;\n return pair{ x, y - 1 };\n }\n };\n\n vector<tuple<int, int, int>> st;\n st.emplace_back(x0, y0, 0b1111);\n\n loop(t) {\n input(int, dist);\n input(char, dir_ch);\n const int dir = ch_to_d[dir_ch];\n\n rep(cur_dist, dist - 1) {\n vector<tuple<int, int, int>> nst;\n for (auto [x, y, pd] : st) {\n rep(d, 4) if (kth_bit(pd, d)) {\n auto nxy = try_succ(x, y, d);\n if (not nxy.has_value()) continue;\n auto [nx, ny] = *nxy;\n nst.emplace_back(nx, ny, 0b1111 & ~(1 << (d ^ 2)));\n }\n }\n sort_unique_erase(nst);\n nst.swap(st);\n }\n\n vector<tuple<int, int, int>> nst;\n for (auto [x, y, pd] : st) {\n rep(d, 4) if (kth_bit(pd, d)) {\n auto nxy = try_succ(x, y, d);\n if (not nxy.has_value()) continue;\n auto [nx, ny] = *nxy;\n nst.emplace_back(nx, ny, (d == dir ? 0b1111 : 1 << dir) & ~(1 << (d ^ 2)));\n }\n }\n sort_unique_erase(nst);\n nst.swap(st);\n }\n\n vector<pair<int, int>> ans;\n for (auto [x, y, pd] : st) {\n rep(d, 4) if (kth_bit(pd, d)) {\n auto nxy = try_succ(x, y, d);\n if (not nxy.has_value()) continue;\n ans.emplace_back(x, y);\n }\n }\n sort_unique_erase(ans);\n\n print_all(ans, \"\\n\");\n\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3600,"score_of_the_acc":-0.032,"final_rank":6},{"submission_id":"aoj_1349_6667840","code_snippet":"#line 1 \"c.cpp\"\n/*\tauthor: Kite_kuma\n\tcreated: 2022.05.30 15:48:54 */\n\n#line 2 \"SPJ-Library/template/kuma.hpp\"\n\n#line 2 \"SPJ-Library/template/basic_func.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\ntemplate <class T0, class T1, class T2>\ninline bool in_range(T0 x, T1 lef, T2 rig) {\n\treturn ((lef <= x) && (x < rig));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n\tif(a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n\tif(a < b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid Yes(bool flag = true) { std::cout << (flag ? \"Yes\" : \"No\") << '\\n'; }\nvoid YES(bool flag = true) { std::cout << (flag ? \"YES\" : \"NO\") << '\\n'; }\n\ntemplate <class T>\nvoid drop(T answer) {\n\tstd::cout << answer << '\\n';\n\texit(0);\n}\n\ntemplate <class T>\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\n\tif(vertically) {\n\t\tfor(auto const &a : v) {\n\t\t\tstd::cout << a << '\\n';\n\t\t}\n\t\treturn;\n\t}\n\tfor(auto it = v.begin(); it != v.end(); it++) {\n\t\tstd::cout << (*it);\n\t\tif(it != v.end() - 1) {\n\t\t\tstd::cout << ' ';\n\t\t}\n\t}\n\tstd::cout << '\\n';\n\treturn;\n}\n\ninline void print() { std::cout << '\\n'; }\ntemplate <class T>\ninline void print(const T &x) {\n\tstd::cout << x << '\\n';\n\treturn;\n}\ntemplate <typename Head, typename... Tail>\nvoid print(const Head &H, const Tail &... T) {\n\tstd::cout << H << \" \";\n\tprint(T...);\n}\n\ntemplate <class T>\nvoid add(std::vector<T> &v, T value) {\n\tfor(auto &a : v) a += value;\n\treturn;\n}\n\ntemplate <class T>\nT greatest_lower_multiple(T x, T d) {\n\tif(d == 0) return 0;\n\tif(d < 0) d *= -1;\n\tT y = x % d;\n\tif(y < 0) y += d;\n\treturn x - y;\n}\n\ntemplate <class T>\nT least_upper_multiple(T x, T d) {\n\treturn -greatest_lower_multiple(-x, d);\n}\n\n// ceil(a / b);\ntemplate <class T>\nT dup(T a, T b) {\n\tassert(b);\n\tif(b < 0) {\n\t\ta *= -1;\n\t\tb *= -1;\n\t}\n\treturn least_upper_multiple(a, b) / b;\n}\n\nlong long pow_ll(long long a, long long n) {\n\tassert(n >= 0LL);\n\tif(n == 0) return 1LL;\n\tif(a == 0) return 0LL;\n\tif(a == 1) return 1LL;\n\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\n\tlong long res = 1;\n\twhile(n > 1LL) {\n\t\tif(n & 1LL) res *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn res * a;\n}\n\nlong long modpow(long long a, long long n, long long mod) {\t // a^n mod\n\tassert(n >= 0 && mod);\n\tif(mod == 1) return 0LL;\n\tlong long res = 1;\n\ta %= mod;\n\twhile(n > 0) {\n\t\tif(n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res < 0 ? res + mod : res;\n}\n\n// return x which satisfies a * x % mod == gcd(a, mod)\n// not (mod | a)\nlong long modinv(long long a, const long long mod) {\n\tlong long b = mod, u = 1, v = 0;\n\twhile(b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b;\n\t\tstd::swap(a, b);\n\t\tu -= t * v;\n\t\tstd::swap(u, v);\n\t}\n\tu %= mod;\n\tif(u < 0) u += mod;\n\treturn u;\n}\n\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) {\n\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\n}\ntemplate <class T>\nvoid unq_sort(std::vector<T> &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nstd::vector<int> press(const std::vector<T> &a) {\n\tstd::vector<T> vec = a;\n\tunq_sort(vec);\n\tstd::vector<int> ret;\n\tfor(const auto &v : a) ret.push_back(lb(vec, v));\n\treturn ret;\n}\n#line 1 \"SPJ-Library/template/header.hpp\"\n#include <bits/stdc++.h>\n#line 2 \"SPJ-Library/template/io.hpp\"\n\n#line 4 \"SPJ-Library/template/io.hpp\"\n\n#line 8 \"SPJ-Library/template/debug.hpp\"\n\n#line 3 \"SPJ-Library/template/constants.hpp\"\n\nconstexpr int inf = 1000'000'000;\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\nconstexpr int mod_1000000007 = 1000000007;\nconstexpr int mod_998244353 = 998244353;\nconst long double pi = acosl(-1.);\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n#line 10 \"SPJ-Library/template/debug.hpp\"\n\nnamespace viewer {\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\n\nvoid view(const long long &e);\n\nvoid view(const int &e);\n\ntemplate <typename T>\nvoid view(const T &e);\n\ntemplate <typename T>\nvoid view(const std::set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s);\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s);\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v);\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v);\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv);\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v);\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m);\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m);\n\ntemplate <typename container_type>\nvoid view_container(const container_type &c, bool vertically = false) {\n\ttypename container_type::const_iterator begin = c.begin();\n\tconst typename container_type::const_iterator end = c.end();\n\tif(vertically) {\n\t\tstd::cerr << \"{\\n\";\n\t\twhile(begin != end) {\n\t\t\tstd::cerr << '\\t';\n\t\t\tview(*(begin++));\n\t\t\tif(begin != end) std::cerr << ',';\n\t\t\tstd::cerr << '\\n';\n\t\t}\n\t\tstd::cerr << '}';\n\t\treturn;\n\t}\n\tstd::cerr << \"{ \";\n\twhile(begin != end) {\n\t\tview(*(begin++));\n\t\tif(begin != end) std::cerr << ',';\n\t\tstd::cerr << ' ';\n\t}\n\tstd::cerr << '}';\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::pair<T, U> &p) {\n\tstd::cerr << '(';\n\tview(p.first);\n\tstd::cerr << \", \";\n\tview(p.second);\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::tuple<T0, T1, T2> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << ')';\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\n\tstd::cerr << '(';\n\tview(std::get<0>(p));\n\tstd::cerr << \", \";\n\tview(std::get<1>(p));\n\tstd::cerr << \", \";\n\tview(std::get<2>(p));\n\tstd::cerr << \", \";\n\tview(std::get<3>(p));\n\tstd::cerr << ')';\n}\n\nvoid view(const long long &e) {\n\tif(e == INF)\n\t\tstd::cerr << \"INF\";\n\telse if(e == -INF)\n\t\tstd::cerr << \"-INF\";\n\telse\n\t\tstd::cerr << e;\n}\n\nvoid view(const int &e) {\n\tif(e == inf)\n\t\tstd::cerr << \"inf\";\n\telse if(e == -inf)\n\t\tstd::cerr << \"-inf\";\n\telse\n\t\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const T &e) {\n\tstd::cerr << e;\n}\n\ntemplate <typename T>\nvoid view(const std::set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_set<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::unordered_multiset<T> &s) {\n\tview_container(s);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<T> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T, std::size_t ary_size>\nvoid view(const std::array<T, ary_size> &v) {\n\tview_container(v);\n}\n\ntemplate <typename T>\nvoid view(const std::vector<std::vector<T>> &vv) {\n\tview_container(vv, true);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::vector<std::pair<T, U>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\n\tview_container(v, true);\n}\n\ntemplate <typename map_type>\nvoid view_map_container(const map_type &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\n\t\tstd::cerr << \"\\t[\";\n\t\tview(it->first);\n\t\tstd::cerr << \"] : \";\n\t\tview(it->second);\n\t\tstd::cerr << '\\n';\n\t}\n\tstd::cerr << \"}\";\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::map<T, U> &m) {\n\tview_map_container(m);\n}\n\ntemplate <typename T, typename U>\nvoid view(const std::unordered_map<T, U> &m) {\n\tview_map_container(m);\n}\n\n} // namespace viewer\n\n// when compiling : g++ foo.cpp -DLOCAL\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename T>\nvoid debug_out(const T &x) {\n\tviewer::view(x);\n}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(const Head &H, const Tail &... T) {\n\tviewer::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"]\\n\"; \\\n\t} while(0)\n#else\n#define debug(...) (void(0))\n#endif\n#line 2 \"SPJ-Library/template/scanner.hpp\"\n\n#line 6 \"SPJ-Library/template/scanner.hpp\"\n\nnamespace scanner {\ntemplate <class T>\nvoid scan(T &a) {\n\tstd::cin >> a;\n}\n\ntemplate <class T, class L>\nvoid scan(std::pair<T, L> &p) {\n\tscan(p.first);\n\tscan(p.second);\n}\n\ntemplate <class T0, class T1, class T2>\nvoid scan(std::tuple<T0, T1, T2> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tp = std::make_tuple(t0, t1, t2);\n}\n\ntemplate <class T0, class T1, class T2, class T3>\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\n\tT0 t0;\n\tT1 t1;\n\tT2 t2;\n\tT3 t3;\n\tscan(t0);\n\tscan(t1);\n\tscan(t2);\n\tscan(t3);\n\tp = std::make_tuple(t0, t1, t2, t3);\n}\n\ntemplate <class T>\nvoid scan(std::vector<T> &a) {\n\tfor(auto &i : a) scan(i);\n}\n\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#line 7 \"SPJ-Library/template/io.hpp\"\n\n#define VEC(type, name, size) \\\n\tvector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tvector<vector<type>> name(h, vector<type>(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstring __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DBL(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define TPL3(type0, type1, type2, name) \\\n\tstd::tuple<type0, type1, type2> name; \\\n\tscanner::INPUT(name);\n#define TPL4(type0, type1, type2, type3, name) \\\n\tstd::tuple<type0, type1, type2, type3> name; \\\n\tscanner::INPUT(name);\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\n\tos << p.first << ' ' << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\n\tfor(typename std::vector<T>::const_iterator it = v.begin(); it != v.end(); it++) {\n\t\tif(it != v.begin()) std::cerr << ' ';\n\t\tos << *it;\n\t}\n\treturn os;\n}\n\nstruct fast_io {\n\tfast_io() {\n\t\tstd::ios::sync_with_stdio(false);\n\t\tstd::cin.tie(nullptr);\n\t\tstd::cout << std::fixed << std::setprecision(15);\n\t\tsrand((unsigned)time(NULL));\n\t}\n} fast_io_;\n#line 2 \"SPJ-Library/template/macros.hpp\"\n\n#define foa(s, v) for(auto &s : v)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define pcnt(n) __builtin_popcountll((long long)n)\n\n#define REPname(a, b, c, d, e, ...) e\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define DREPname(a, b, c, d, e, ...) e\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<std::vector<int>>;\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\nusing vll = std::vector<ll>;\nusing vvll = std::vector<vll>;\nusing vvvll = std::vector<vvll>;\ntemplate <class T = ll>\nusing V = std::vector<T>;\ntemplate <class T = ll>\nusing VV = V<V<T>>;\ntemplate <class T = ll>\nusing VVV = V<V<V<T>>>;\ntemplate <class T = ll>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T = ll>\nusing pqdn = std::priority_queue<T>;\n#line 7 \"SPJ-Library/template/kuma.hpp\"\n\nusing namespace std;\n#line 5 \"c.cpp\"\n\nvoid solve(int n) {\n\tint x, y, time_end;\n\tcin >> x >> y >> time_end;\n#ifdef LOCAL\n\tconst int len = 53;\n#else\n\tconst int len = 53;\n#endif\n\tconst int dir_max = 4;\n\tVVV<int> can_go(len, vvi(len, vi(dir_max, 0)));\n\trep(n) {\n\t\tint x1, y1;\n\t\tcin >> x1 >> y1;\n\t\tINT(x2, y2);\n\t\tint direction = 0;\n\t\tint distance = abs(x1 + y1 - (x2 + y2));\n\t\tif(x1 < x2) {\n\t\t\tdirection = 0;\n\t\t} else if(x1 > x2) {\n\t\t\tdirection = 2;\n\t\t} else if(y1 < y2) {\n\t\t\tdirection = 1;\n\t\t} else {\n\t\t\tdirection = 3;\n\t\t}\n\t\tassert(x1 + dx[direction] * distance == x2 && y1 + dy[direction] * distance == y2);\n\t\tint rev_dir = (direction + 2) % dir_max;\n\t\twhile(x1 != x2 || y1 != y2) {\n\t\t\tint nxtx = x1 + dx[direction];\n\t\t\tint nxty = y1 + dy[direction];\n\t\t\tcan_go[x1][y1][direction] = 1;\n\t\t\tcan_go[nxtx][nxty][rev_dir] = 1;\n\t\t\tx1 = nxtx;\n\t\t\ty1 = nxty;\n\t\t}\n\t}\n\n\tvector<pair<int, int>> conditions;\n\tmap<char, int> ch_dir;\n\tch_dir['N'] = 1;\n\tch_dir['E'] = 0;\n\tch_dir['S'] = 3;\n\tch_dir['W'] = 2;\n\n\tint dist = 0;\n\trep(time_end) {\n\t\tint t;\n\t\tcin >> t;\n\t\tdist += t;\n\t\tchar c;\n\t\tcin >> c;\n\t\tassert(ch_dir.count(c));\n\t\tconditions.emplace_back(dist, ch_dir[c]);\n\t}\n\n\tauto it = conditions.begin();\n\n\tvector<vector<vi>> ok(len, vvi(len, vi(dir_max, 0)));\n\trep(dir, dir_max) ok[x][y][dir] = 1;\n\n\t// debug(can_go);\n\n\trep(dist_now, 1, dist + 1) {\n\t\tvvvi tmp(len, vvi(len, vi(dir_max, 0)));\n\n\t\trep(i, len) rep(j, len) rep(dir, dir_max) {\n\t\t\tif(ok[i][j][dir] && can_go[i][j][dir]) {\n\t\t\t\ttmp[i + dx[dir]][j + dy[dir]][dir] = 1;\n\t\t\t}\n\t\t}\n\n\t\tfoa(vv, ok) foa(v, vv) foa(c, v) c = 0;\n\n\t\trep(i, len) rep(j, len) {\n\t\t\trep(dir, dir_max) if(tmp[i][j][dir]) {\n\t\t\t\trep(nxtdir, dir - 1, dir + 2) {\n\t\t\t\t\tif(can_go[i][j][(nxtdir + dir_max) % dir_max]) {\n\t\t\t\t\t\tok[i][j][(nxtdir + dir_max) % dir_max] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif(dist_now == it->first) {\n\t\t\trep(i, len) rep(j, len) rep(d, dir_max) {\n\t\t\t\tif(d != it->second) ok[i][j][d] = 0;\n\t\t\t}\n\n\t\t\tconst int dir = it->second;\n\t\t\trep(i, len) rep(j, len) {\n\t\t\t\tif(tmp[i][j][dir]) {\n\t\t\t\t\trep(nxtdir, dir - 1, dir + 2) {\n\t\t\t\t\t\tif(can_go[i][j][(nxtdir + dir_max) % dir_max]) {\n\t\t\t\t\t\t\tok[i][j][(nxtdir + dir_max) % dir_max] = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tit++;\n\t\t}\n\n\t\trep(i, len) rep(j, len) rep(d, dir_max) {\n\t\t\tif(ok[i][j][d]) {\n\t\t\t\tdebug(dist_now, i, j, d);\n\t\t\t}\n\t\t}\n\t}\n\tassert(it == conditions.end());\n\tdebug(conditions);\n\n\trep(i, len) rep(j, len) {\n\t\tif(*max_element(all(ok[i][j]))) print(i, j);\n\t}\n\n#ifdef LOCAL\n\tprint(\"finish!!\");\n#endif\n\n\treturn;\n}\n\nint main() {\n\tint n;\n\twhile(cin >> n && n) solve(n);\n\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3928,"score_of_the_acc":-0.0348,"final_rank":7},{"submission_id":"aoj_1349_6401492","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nclass Move {\npublic:\n int x;\n int y;\n int last;\n int next;\n Move(int x=0,int y=0,int last=-1,int next=-1):x(x),y(y),last(last),next(next){}\n bool canMove(int nextDir){\n return (last < 0 or (last - nextDir + 4) % 4 != 2) and\n (next < 0 or next == nextDir);\n }\n Move moved(int nextDir){\n const int dx[] = {1,0,-1,0};\n const int dy[] = {0,1,0,-1};\n return Move(x+dx[nextDir],y+dy[nextDir],nextDir);\n }\n Move withNext(int dir){\n return Move(x,y,last,dir);\n }\n pii position()const{\n return pii(x,y);\n }\n};\n\nbool operator<(const Move &a, const Move &b){\n return array<int,4>({a.x,a.y,a.last,a.next}) < array<int,4>({b.x,b.y,b.last,b.next});\n}\n \n\nset<pii> func(){\n int n = in();\n int x0 = in();\n int y0 = in();\n int t = in();\n vvvector<int> oks(51,vvector<int>(51,vector<int>(4,false)));\n rep(i,n){\n int x0 = in();\n int y0 = in();\n int x1 = in();\n int y1 = in();\n if(x0>x1)swap(x0,x1);\n if(y0>y1)swap(y0,y1);\n if(y0==y1){\n rep(x,x0,x1+1){\n if(x!=x0)oks[x][y0][2] = true;\n if(x!=x1)oks[x][y0][0] = true;\n }\n }else{\n rep(y,y0,y1+1){\n if(y!=y0)oks[x0][y][3] = true;\n if(y!=y1)oks[x0][y][1] = true;\n }\n }\n }\n method(moved,vector<Move>,Move p){\n vector<Move> res;\n rep(i,4){\n if(not p.canMove(i))continue;\n if(not oks[p.x][p.y][i])continue;\n Move mp = p.moved(i);\n res.emplace_back(mp);\n }\n return res;\n };\n set<Move> current;\n {\n rep(i,4){\n if(oks[x0][y0][i]){\n current.emplace(Move(x0,y0).withNext(i));\n }\n }\n }\n rep(_,t){\n int T = in();\n char D = in<char>();\n int dir;\n\n set<Move> ncurrent;\n set<pair<Move,int>> used;\n method(movedTimes,void,Move p,int time,int dir){\n method(rec,void,Move p,int t){\n if(t==time){\n if(p.last==dir){\n ncurrent.emplace(p);\n }else if(oks[p.x][p.y][dir] and p.canMove(dir)){\n ncurrent.emplace(p.withNext(dir));\n }\n return;\n }\n if(used.count(make_pair(p,t)))return;\n used.emplace(p,t);\n foreach(np,moved(p)){\n rec(np,t+1);\n }\n };\n rec(p,0);\n };\n switch(D){\n case 'E':\n dir = 0;\n break;\n case 'N':\n dir = 1;\n break;\n case 'W':\n dir = 2;\n break;\n case 'S':\n dir = 3;\n break;\n }\n foreach(e,current){\n movedTimes(e,T,dir);\n }\n current = ncurrent;\n }\n set<pii> res;\n foreach(i,current)res.emplace(i.position());\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n foreach(i,func())println(i);\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":4344,"score_of_the_acc":-0.1137,"final_rank":10},{"submission_id":"aoj_1349_6364313","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\ntypedef string::const_iterator State;\n#define eps 1e-8L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\ntypedef long double ld;\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\n#define ALL(x) (x).begin(), (x).end()\n\n#define int long long\nvoid solve()\n{\n int n, x0, y0, t;\n cin >> n >> x0 >> y0 >> t;\n set<tuple<int, int, int>> cur;\n REP(i, 4)\n {\n cur.insert({x0 * 2, y0 * 2, i});\n }\n set<pair<int, int>> valids;\n REP(i, n)\n {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n a *= 2;\n b *= 2;\n c *= 2;\n d *= 2;\n for (int i = min(a, c); i <= max(a, c); ++i)\n {\n for (int q = min(b, d); q <= max(b, d); ++q)\n {\n valids.insert({i, q});\n }\n }\n }\n REP(i, t)\n {\n int moves;\n string s;\n cin >> moves >> s;\n const int dx[4] = {-1, 0, 1, 0};\n const int dy[4] = {0, -1, 0, 1};\n REP(_, moves)\n {\n set<tuple<int, int, int>> nexts;\n for (auto x : cur)\n {\n REP(t, 4)\n {\n if (t == 2)\n continue;\n int itr = get<2>(x) + t;\n itr %= 4;\n int next_x = get<0>(x) + dx[itr];\n int next_y = get<1>(x) + dy[itr];\n if (valids.count({next_x, next_y}))\n {\n next_x += dx[itr];\n next_y += dy[itr];\n nexts.insert({next_x, next_y, itr});\n }\n if (get<2>(x) >= 4)\n break;\n }\n }\n cur = nexts;\n }\n {\n int expected;\n if (s == \"W\")\n expected = 0;\n else if (s == \"S\")\n expected = 1;\n else if (s == \"E\")\n expected = 2;\n else\n expected = 3;\n set<tuple<int, int, int>> filters;\n for (auto x : cur)\n {\n if (get<2>(x) == expected)\n filters.insert(x);\n REP(t, 4)\n {\n if (t % 2 == 0)\n continue;\n int itr = get<2>(x) + t;\n itr %= 4;\n int next_x = get<0>(x) + dx[itr];\n int next_y = get<1>(x) + dy[itr];\n if (valids.count({next_x, next_y}))\n {\n if (itr == expected)\n {\n filters.insert({get<0>(x), get<1>(x), itr + 4});\n }\n }\n }\n }\n cur = filters;\n }\n }\n set<pair<int, int>> ans;\n for (auto x : cur)\n {\n ans.insert({get<0>(x), get<1>(x)});\n }\n for (auto x : ans)\n {\n cout << x.first / 2 << \" \" << x.second / 2 << endl;\n }\n}\n#undef int\n\n// generated by oj-template v4.7.2\n// (https://github.com/online-judge-tools/template-generator)\nint main()\n{\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 1;\n // cin >> t; // comment out if solving multi testcase\n for (int testCase = 1; testCase <= t; ++testCase)\n {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":3636,"score_of_the_acc":-0.059,"final_rank":9},{"submission_id":"aoj_1349_6039630","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000001\n\nvector ok(51,vector(51,vector<bool>(4,false)));\nvector<int> dx = {1,0,-1,0},dy = {0,1,0,-1};\n\nvector<pair<pair<int,int>,int>> get(int d,int dir,vector<pair<pair<int,int>,int>> xy){\n\tvector f(51,vector(51,vector<bool>(4,false)));\n\trep(i,xy.size()){\n\t\tf[xy[i].first.first][xy[i].first.second][xy[i].second] = true;\n\t}\n\tvector<pair<pair<int,int>,int>> ret;\n\trep(i,d){\n\t\tvector nf(51,vector(51,vector<bool>(4,false)));\n\t\trep(j,51){\n\t\t\trep(k,51){\n\t\t\t\trep(l,4){\n\t\t\t\t\tif(f[j][k][l]==false)continue;\n\t\t\t\t\tif(ok[j][k][l]==false)continue;\n\t\t\t\t\tint x = j+dx[l],y = k+dy[l];\n\t\t\t\t\t//cout<<i<<','<<x<<','<<y<<endl;\n\t\t\t\t\trep(ll,4){\n\t\t\t\t\t\tif((l^ll)==2)continue;\n\t\t\t\t\t\tnf[x][y][ll] = true;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(i==d-1 && (l==dir || ll==dir)){\n\t\t\t\t\t\t\tret.emplace_back(make_pair(x,y),ll);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tswap(f,nf);\n\t}\n\treturn ret;\n\t\n}\n\nint main(){\n\t\n\tint n,x0,y0,t;\n\tcin>>n>>x0>>y0>>t;\t\n\t\n\trep(i,n){\n\t\tint xs,ys,xe,ye;\n\t\tcin>>xs>>ys>>xe>>ye;\n\t\tif(xs==xe){\n\t\t\tif(ys>ye)swap(ys,ye);\n\t\t\tfor(int j=ys;j<=ye;j++){\n\t\t\t\tif(j!=ye){\n\t\t\t\t\tok[xs][j][1] = true;\n\t\t\t\t}\n\t\t\t\tif(j!=ys){\n\t\t\t\t\tok[xs][j][3] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tif(xs>xe)swap(xs,xe);\n\t\t\tfor(int j=xs;j<=xe;j++){\n\t\t\t\tif(j!=xe){\n\t\t\t\t\tok[j][ys][0] = true;\n\t\t\t\t}\n\t\t\t\tif(j!=xs){\n\t\t\t\t\tok[j][ys][2] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvector<int> d(t),dir(t);\n\trep(i,t){\n\t\tcin>>d[i];\n\t\tchar c;\n\t\tcin>>c;\n\t\t\n\t\tif(c=='N')dir[i] = 1;\n\t\tif(c=='W')dir[i] = 2;\n\t\tif(c=='S')dir[i] = 3;\n\t\tif(c=='E')dir[i] = 0;\n\t}\n\t\n\t\n\tvector<pair<pair<int,int>,int>> xy;\n\trep(k,4){\n\t\txy.emplace_back(make_pair(x0,y0),k);\n\t}\n\trep(k,t){\n\t\txy = get(d[k],dir[k],xy);\n\t}\n\n\tvector<pair<int,int>> ans;\n\t//cout<<xy.size()<<endl;\n\trep(i,xy.size()){\n\t\tif(ok[xy[i].first.first][xy[i].first.second][xy[i].second]){\n\t\t\tans.push_back(xy[i].first);\n\t\t}\n\t}\n\tsort(ans.begin(),ans.end());\n\tans.erase(unique(ans.begin(),ans.end()),ans.end());\n\t//cout<<ans.size()<<endl;\n\trep(i,ans.size()){\n\t\tcout<<ans[i].first<<' '<<ans[i].second<<endl;\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":4044,"score_of_the_acc":-0.0403,"final_rank":8},{"submission_id":"aoj_1349_5778058","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MAX_T = 1005, MAX_C = 55;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nbool dp[MAX_T][MAX_C][MAX_C][4];\nbool adv[MAX_C][MAX_C][4];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, x_0, y_0, t;\n cin >> n >> x_0 >> y_0 >> t;\n for (; n--;) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n if (a == c) {\n if (b > d) swap(b, d);\n for (int i = b; i <= d; i++) {\n if (i != b) adv[a][i][3] = true;\n if (i != d) adv[a][i][1] = true;\n }\n } else {\n if (a > c) swap(a, c);\n for (int i = a; i <= c; i++) {\n if (i != a) adv[i][b][2] = true;\n if (i != c) adv[i][b][0] = true;\n }\n }\n }\n\n auto ctoi = [](char c) {\n if (c == 'E') return 0;\n if (c == 'N') return 1;\n if (c == 'W') return 2;\n return 3;\n };\n vector<int> way(MAX_T, -1);\n int sum = 0;\n for (; t--;) {\n int d;\n char c;\n cin >> d >> c;\n sum += d;\n way[sum] = ctoi(c);\n }\n for (int l = 0; l < 4; l++) dp[0][x_0][y_0][l] = true;\n\n for (int i = 0; i < sum; i++) {\n for (int j = 0; j < MAX_C; j++) {\n for (int k = 0; k < MAX_C; k++) {\n for (int l = 0; l < 4; l++) {\n if (!dp[i][j][k][l]) continue;\n for (int nl = 0; nl < 4; nl++) {\n if (!adv[j][k][nl]) continue; // able to advance\n if (~way[i] && l != way[i] && nl != way[i]) continue; // correct information\n if ((l ^ nl) == 2) continue; // prohibit U-turns\n int nx = j + dx[nl], ny = k + dy[nl];\n dp[i + 1][nx][ny][nl] = true;\n }\n }\n }\n }\n }\n\n for (int i = 0; i < MAX_C; i++) {\n for (int j = 0; j < MAX_C; j++) {\n bool ok = false;\n for (int k = 0; k < 4; k++) {\n if (dp[sum][i][j][k] && (k == way[sum] || ((k ^ way[sum]) != 2 && adv[i][j][way[sum]]))) {\n ok = true;\n }\n }\n if (ok) cout << i << ' ' << j << '\\n';\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":13220,"score_of_the_acc":-0.2857,"final_rank":14},{"submission_id":"aoj_1349_5315479","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n\treturn (ull)rng() % B;\n}\n\nconst int N=51;\n\nbool dp[1001][N][N][4];\nint ro[N][N][4];\nbool ch[1001][4];\n\n// 0:N 1:E 2:S 3:W\nint f(char c){\n\tif(c=='N')return 0;\n\telse if(c=='E')return 1;\n\telse if(c=='S')return 2;\n\telse return 3;\n}\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint n,sx,sy,t; cin >> n >> sx >> sy >> t;\n\tfor(int i=0;i<n;i++){\n\t\tint x,y,xx,yy; cin >> x >> y >> xx >> yy;\n\t\tif(x==xx){\n\t\t\tif(y>yy)swap(y,yy);\n\t\t\tfor(int j=y;j<=yy;j++){\n\t\t\t\tif(j>y)ro[x][j][2]=1;\n\t\t\t\tif(j<yy)ro[x][j][0]=1;\n\t\t\t}\n\t\t}\n\t\tif(y==yy){\n\t\t\tif(x>xx)swap(x,xx);\n\t\t\tfor(int j=x;j<=xx;j++){\n\t\t\t\tif(j>x)ro[j][y][3]=1;\n\t\t\t\tif(j<xx)ro[j][y][1]=1;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<1001;i++){\n\t\tfor(int j=0;j<4;j++){\n\t\t\tch[i][j]=true;\n\t\t}\n\t}\n\tfor(int i=0;i<4;i++){\n\t\tdp[0][sx][sy][i]=true;\n\t}\n\tint sum=0;\n\tfor(int i=0;i<t;i++){\n\t\tint d; cin >> d;\n\t\tchar c; cin >> c;\n\t\tsum+=d;\n\t\tfor(int j=0;j<4;j++){\n\t\t\tch[sum][j]=false;\n\t\t}\n\t\tch[sum][f(c)]=true;\n\t}\n\tfor(int i=0;i<sum;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tfor(int k=0;k<N;k++){\n\t\t\t\tfor(int l=0;l<4;l++){\n\t\t\t\t\tif(!dp[i][j][k][l])continue;\n\t\t\t\t\tif(!ro[j][k][l])continue;\n\t\t\t\t\tint x=j,y=k;\n\t\t\t\t\tif(l==0)y++;\n\t\t\t\t\telse if(l==1)x++;\n\t\t\t\t\telse if(l==2)y--;\n\t\t\t\t\telse x--;\n\t\t\t\t\tif(ch[i+1][l]){\n\t\t\t\t\t\tif(i+1==sum)dp[i+1][x][y][l]=true;\n\t\t\t\t\t\tfor(int d=-1;d<=1;d++){\n\t\t\t\t\t\t\tint nx=(l+d+4)%4;\n\t\t\t\t\t\t\tif(!ro[x][y][nx])continue;\n\t\t\t\t\t\t\tdp[i+1][x][y][nx]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tfor(int d=-1;d<=1;d++){\n\t\t\t\t\t\t\tint nx=(l+d+4)%4;\n\t\t\t\t\t\t\tif(!ro[x][y][nx])continue;\n\t\t\t\t\t\t\tif(!ch[i+1][nx])continue;\n\t\t\t\t\t\t\tdp[i+1][x][y][nx]=true;\n\t\t\t\t\t\t\tif(i+1==sum)dp[i+1][x][y][l]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<pair<int,int>> res;\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\tif(ch[sum][k] and dp[sum][i][j][k]){\n\t\t\t\t\tres.push_back({i,j});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(auto p:res){\n\t\tprintf(\"%d %d\\n\",p.first,p.second);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":9320,"score_of_the_acc":-0.1749,"final_rank":12},{"submission_id":"aoj_1349_5249092","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\n\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, -1, 0, 1};\n\nbool f[51][51][4];\n\nvector<tuple<int, int, int>> cur;\nvector<tuple<int, int, int>> nxt;\n\nbool memo[11][51][51][4];\n\nvector<int> d, dir;\n\nvoid dfs(int dist, int cx, int cy, int pd, int T) {\n if (memo[dist][cx][cy][pd]) return;\n memo[dist][cx][cy][pd] = true;\n\n if (dist == d[T]) {\n if (pd != dir[T] && !f[cx][cy][dir[T]]) return;\n if (pd != dir[T] && (dir[T] + 2) % 4 == pd) return;\n nxt.emplace_back(cx, cy, pd);\n return;\n }\n\n for (int Dir = 0; Dir < 4; Dir++) {\n if ((pd + 2) % 4 == Dir) continue;\n if (dist == 0 && T > 0 && dir[T - 1] != pd && dir[T - 1] != Dir) continue;\n if (!f[cx][cy][Dir]) continue;\n int nx = cx + dx[Dir], ny = cy + dy[Dir];\n assert(!(nx < 0 || nx > 50 || ny < 0 || ny > 50));\n dfs(dist + 1, nx, ny, Dir, T);\n }\n}\n\nvoid solve() {\n int N, x0, y0, t;\n cin >> N >> x0 >> y0 >> t;\n for (int i = 0; i < N; i++) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n if (a == c) {\n for (int j = min(b, d); j < max(b, d); j++) { f[a][j][3] = true; }\n for (int j = min(b, d) + 1; j <= max(b, d); j++) { f[a][j][1] = true; }\n } else {\n for (int j = min(a, c); j < max(a, c); j++) { f[j][b][0] = true; }\n for (int j = min(a, c) + 1; j <= max(a, c); j++) { f[j][b][2] = true; }\n }\n }\n\n for (int i = 0; i < t; i++) {\n int x;\n char c;\n cin >> x >> c;\n d.push_back(x);\n for (int j = 0; j < 4; j++)\n if (\"ESWN\"[j] == c) dir.push_back(j);\n }\n assert(d.size() == t && dir.size() == t);\n\n rep(i, 4) { cur.emplace_back(x0, y0, i); }\n\n for (int T = 0; T < t; T++) {\n memset(memo, false, sizeof(memo));\n for (auto [x, y, direc] : cur) { dfs(0, x, y, direc, T); }\n swap(cur, nxt);\n nxt.clear();\n }\n\n vector<P> ans;\n for (auto [x, y, direc] : cur) ans.emplace_back(x, y);\n sort(all(ans));\n ans.erase(unique(all(ans)), ans.end());\n\n for (auto [x, y] : ans) cout << x << ' ' << y << endl;\n\n return;\n}\n\nint main() {\n fastio();\n solve();\n // int t;\n // cin >> t;\n // while (t--) solve();\n\n // int t; cin >> t;\n // for(int i=1;i<=t;i++){\n // cout << \"Case #\" << i << \": \";\n // solve();\n // }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3624,"score_of_the_acc":-0.0132,"final_rank":4},{"submission_id":"aoj_1349_5180323","code_snippet":"#line 1 \"main.cpp\"\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconstexpr int X = 51;\nconstexpr int N = X * X;\n\nint enc(int x, int y) { return x * X + y; }\n\nvoid solve() {\n int n, x0, y0, t;\n cin >> n >> x0 >> y0 >> t;\n int s = enc(x0, y0);\n\n auto graph = vector(N, vector(4, -1));\n while (n--) {\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n if (sx == gx) {\n int x = sx;\n if (sy > gy) swap(sy, gy);\n\n for (int y = sy; y < gy; ++y) {\n graph[enc(x, y)][0] = enc(x, y + 1);\n graph[enc(x, y + 1)][2] = enc(x, y);\n }\n } else {\n int y = sy;\n if (sx > gx) swap(sx, gx);\n\n for (int x = sx; x < gx; ++x) {\n graph[enc(x, y)][1] = enc(x + 1, y);\n graph[enc(x + 1, y)][3] = enc(x, y);\n }\n }\n }\n\n vector<int> ds{-1};\n while (t--) {\n int d;\n char c;\n cin >> d >> c;\n\n for (int i = 0; i < d - 1; ++i) {\n ds.push_back(-1);\n }\n\n int i = 0;\n while (c != \"NESW\"[i]) ++i;\n ds.push_back(i);\n }\n\n t = ds.size() - 1;\n\n auto dp = vector(4, vector(N, false));\n // 直前の移動方向、座標\n for (int d = 0; d < 4; ++d) dp[d][s] = true;\n\n for (int i = 0; i < t; ++i) {\n int td = ds[i];\n auto ndp = vector(4, vector(N, false));\n\n for (int v = 0; v < N; ++v) {\n for (int pd = 0; pd < 4; ++pd) {\n if (!dp[pd][v]) continue;\n\n for (int d = 0; d < 4; ++d) {\n // Uターン\n if (abs(d - pd) == 2) continue;\n // 向き指定\n if (td != -1 && pd != td && d != td) continue;\n // 道の存在\n if (graph[v][d] == -1) continue;\n\n ndp[d][graph[v][d]] = true;\n }\n }\n }\n swap(dp, ndp);\n }\n\n int td = ds.back();\n for (int v = 0; v < N; ++v) {\n bool ok = false;\n for (int d = 0; d < 4; ++d) {\n if (abs(td - d) == 2 || !dp[d][v]) continue;\n if (d == td || graph[v][td] != -1) ok = true;\n }\n if (ok) {\n cout << v / X << \" \" << v % X << \"\\n\";\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3616,"score_of_the_acc":-0.013,"final_rank":3},{"submission_id":"aoj_1349_5175816","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/segtree>\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\nusing pl = pair<ll, ll>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\n#define rep(i,n) for (ll i = 0; i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define sz(x) ((int)(x).size())\n#define fi first\n#define se second\n#define endl '\\n'\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\nconst int inf = 1<<30;\nconst ll INF = 1ll<<60;\nconst ll mod = 1000000007;\n//const ll mod = 998244353;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\n\n\nbool G[1005][1005][4];\nbool st[1005][1005][4], nx[1005][1005][4], nx2[1005][1005][4];\nll d[105];\nchar c[105];\nll n, xx0, yy0, t, ds = 0;\n\nint main() {\n IOS;\n cin >> n >> xx0 >> yy0 >> t;\n rep(i,4) st[xx0+1][yy0+1][i] = true;\n // グラフをつくる\n rep(i,n) {\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\n x1++; y1++; x2++; y2++;\n if (x1 == x2) {\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 1001ll);\n for (ll y = y1; y < y2; y++) {\n G[x1][y][1] = true;\n G[x1][y+1][3] = true;\n }\n } else {\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 1001ll);\n for (ll x = x1; x < x2; x++) {\n G[x][y1][0] = true;\n G[x+1][y1][2] = true;\n }\n }\n }\n // 情報の入力\n rep(i,t) {\n cin >> d[i] >> c[i];\n ds += d[i];\n }\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\n rep(tim,ds) {\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n if (st[i][j][0]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][1]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n }\n if (st[i][j][2]) {\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][3]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n /*\n if (tar != -1) {\n int cnt = 0;\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n bool ok = 0;\n rep(k,4) if (nx2[i][j][k]) ok = 1;\n if (!ok) continue;\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\n }\n */\n }\n }\n rep(i,1001) rep(j,1001) rep(k,4) {\n st[i+1][j+1][k] = nx[i+1][j+1][k];\n nx[i+1][j+1][k] = 0;\n nx2[i+1][j+1][k] = 0;\n }\n if (tar != -1) tar = -1;\n /*\n rep(k,4) {\n printf(\"time = %lld, k = %lld\\n\", tim, k);\n rep(i,10) {\n rep(j,10) cout << st[i+1][j+1][k] << \" \"; cout << endl;\n } \n }\n rep(i,10) {\n rep(j,10) {\n bool ruth = 0;\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\n if (ruth) cout << \"1 \";\n else cout << \"0 \";\n }\n cout << endl;\n } cout << endl;\n */\n\n if (tim+1-ds2 != d[id]) continue;\n // 情報と矛盾するものを排除する、これが難しい\n if (c[id] == 'E') tar = 0;\n if (c[id] == 'N') tar = 1;\n if (c[id] == 'W') tar = 2;\n if (c[id] == 'S') tar = 3;\n ds2 += d[id++];\n //cout << ds2 << endl;\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n // 今tarを向いてないならfalseにする\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\n rep(k,4) {\n if (k != tar) {\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\n st[i][j][k] = 0;\n }\n }\n }\n }\n }\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\n if (ok) cout << i-1 << \" \" << j-1 << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":4630,"memory_kb":15200,"score_of_the_acc":-1.3419,"final_rank":19},{"submission_id":"aoj_1349_5175804","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/segtree>\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\nusing pl = pair<ll, ll>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\n#define rep(i,n) for (ll i = 0; i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define sz(x) ((int)(x).size())\n#define fi first\n#define se second\n#define endl '\\n'\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\nconst int inf = 1<<30;\nconst ll INF = 1ll<<60;\nconst ll mod = 1000000007;\n//const ll mod = 998244353;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\n\n\nbool G[55][55][4];\nbool st[55][55][4], nx[55][55][4], nx2[55][55][4];\nll d[105];\nchar c[105];\nll n, xx0, yy0, t, ds = 0;\n\nint main() {\n //IOS;\n cin >> n >> xx0 >> yy0 >> t;\n rep(i,4) st[xx0+1][yy0+1][i] = true;\n // グラフをつくる\n rep(i,n) {\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\n x1++; y1++; x2++; y2++;\n if (x1 == x2) {\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 51ll);\n for (ll y = y1; y < y2; y++) {\n G[x1][y][1] = true;\n G[x1][y+1][3] = true;\n }\n } else {\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 51ll);\n for (ll x = x1; x < x2; x++) {\n G[x][y1][0] = true;\n G[x+1][y1][2] = true;\n }\n }\n }\n // 情報の入力\n rep(i,t) {\n cin >> d[i] >> c[i];\n ds += d[i];\n }\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\n rep(tim,ds) {\n for (int i = 1; i <= 51; i++) {\n for (int j = 1; j <= 51; j++) {\n if (st[i][j][0]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][1]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n }\n if (st[i][j][2]) {\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][3]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n /*\n if (tar != -1) {\n int cnt = 0;\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n bool ok = 0;\n rep(k,4) if (nx2[i][j][k]) ok = 1;\n if (!ok) continue;\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\n }\n */\n }\n }\n rep(i,51) rep(j,51) rep(k,4) {\n st[i+1][j+1][k] = nx[i+1][j+1][k];\n nx[i+1][j+1][k] = 0;\n nx2[i+1][j+1][k] = 0;\n }\n if (tar != -1) tar = -1;\n /*\n rep(k,4) {\n printf(\"time = %lld, k = %lld\\n\", tim, k);\n rep(i,10) {\n rep(j,10) cout << st[i+1][j+1][k] << \" \"; cout << endl;\n } \n }\n rep(i,10) {\n rep(j,10) {\n bool ruth = 0;\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\n if (ruth) cout << \"1 \";\n else cout << \"0 \";\n }\n cout << endl;\n } cout << endl;\n */\n\n if (tim+1-ds2 != d[id]) continue;\n // 情報と矛盾するものを排除する、これが難しい\n if (c[id] == 'E') tar = 0;\n if (c[id] == 'N') tar = 1;\n if (c[id] == 'W') tar = 2;\n if (c[id] == 'S') tar = 3;\n ds2 += d[id++];\n //cout << ds2 << endl;\n for (int i = 1; i <= 51; i++) {\n for (int j = 1; j <= 51; j++) {\n // 今tarを向いてないならfalseにする\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\n rep(k,4) {\n if (k != tar) {\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\n st[i][j][k] = 0;\n }\n }\n }\n }\n }\n for (int i = 1; i <= 51; i++) {\n for (int j = 1; j <= 51; j++) {\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\n if (ok) cout << i-1 << \" \" << j-1 << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3160,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1349_5175794","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/segtree>\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\nusing pl = pair<ll, ll>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\n#define rep(i,n) for (ll i = 0; i < (n); i++)\n#define all(v) (v).begin(), (v).end()\n#define sz(x) ((int)(x).size())\n#define fi first\n#define se second\n#define endl '\\n'\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\nconst int inf = 1<<30;\nconst ll INF = 1ll<<60;\nconst ll mod = 1000000007;\n//const ll mod = 998244353;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\n\n\nbool G[1005][1005][4];\nbool st[1005][1005][4], nx[1005][1005][4], nx2[1005][1005][4];\nll d[105];\nchar c[105];\nll n, xx0, yy0, t, ds = 0;\n\nint main() {\n //IOS;\n cin >> n >> xx0 >> yy0 >> t;\n rep(i,4) st[xx0+1][yy0+1][i] = true;\n // グラフをつくる\n rep(i,n) {\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\n x1++; y1++; x2++; y2++;\n if (x1 == x2) {\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 1001ll);\n for (ll y = y1; y < y2; y++) {\n G[x1][y][1] = true;\n G[x1][y+1][3] = true;\n }\n } else {\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 1001ll);\n for (ll x = x1; x < x2; x++) {\n G[x][y1][0] = true;\n G[x+1][y1][2] = true;\n }\n }\n }\n // 情報の入力\n rep(i,t) {\n cin >> d[i] >> c[i];\n ds += d[i];\n }\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\n rep(tim,ds) {\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n if (st[i][j][0]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][1]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n }\n if (st[i][j][2]) {\n if (G[i][j][1]) nx[i][j+1][1] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (st[i][j][3]) {\n if (G[i][j][0]) nx[i+1][j][0] = 1;\n if (G[i][j][2]) nx[i-1][j][2] = 1;\n if (G[i][j][3]) nx[i][j-1][3] = 1;\n }\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n /*\n if (tar != -1) {\n int cnt = 0;\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\n bool ok = 0;\n rep(k,4) if (nx2[i][j][k]) ok = 1;\n if (!ok) continue;\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\n }\n */\n }\n }\n rep(i,1001) rep(j,1001) rep(k,4) {\n st[i+1][j+1][k] = nx[i+1][j+1][k];\n nx[i+1][j+1][k] = 0;\n nx2[i+1][j+1][k] = 0;\n }\n if (tar != -1) tar = -1;\n /*\n rep(k,4) {\n printf(\"time = %lld, k = %lld\\n\", tim, k);\n rep(i,10) {\n rep(j,10) cout << st[i+1][j+1][k] << \" \"; cout << endl;\n } \n }\n rep(i,10) {\n rep(j,10) {\n bool ruth = 0;\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\n if (ruth) cout << \"1 \";\n else cout << \"0 \";\n }\n cout << endl;\n } cout << endl;\n */\n\n if (tim+1-ds2 != d[id]) continue;\n // 情報と矛盾するものを排除する、これが難しい\n if (c[id] == 'E') tar = 0;\n if (c[id] == 'N') tar = 1;\n if (c[id] == 'W') tar = 2;\n if (c[id] == 'S') tar = 3;\n ds2 += d[id++];\n //cout << ds2 << endl;\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n // 今tarを向いてないならfalseにする\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\n rep(k,4) {\n if (k != tar) {\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\n st[i][j][k] = 0;\n }\n }\n }\n }\n }\n for (int i = 1; i <= 1001; i++) {\n for (int j = 1; j <= 1001; j++) {\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\n if (ok) cout << i-1 << \" \" << j-1 << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":4440,"memory_kb":15112,"score_of_the_acc":-1.2983,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1349_10848168\",\n \"code_snippet\": \"#include<map>\\n#include<set>\\n#include<cmath>\\n#include<queue>\\n#include<cctype>\\n#include<cstdio>\\n#include<vector>\\n#include<cstdlib>\\n#include<cstring>\\n#include<algorithm>\\ntypedef long long LL;\\nbool go[55][55][4];\\nbool f[55][55][1010][4];\\nstruct HN {\\n\\tint x, y, s, d;\\n\\tHN() {}\\n\\tHN(int x, int y, int s, int d): x(x), y(y), s(s), d(d) {}\\n};\\nint N, SX, SY, T, S;\\nstruct P {\\n\\tint x, y;\\n\\tP() {}\\n\\tP(int x, int y): x(x), y(y) {}\\n\\tbool operator < (const P &t) const {\\n\\t\\tif(x != t.x) {\\n\\t\\t\\treturn x < t.x;\\n\\t\\t}\\n\\t\\treturn y < t.y;\\n\\t}\\n};\\nchar ch[256];\\nint dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};\\nint dir[1010];\\nbool check(int s, int d) {\\n\\tif(dir[s] == -1) {\\n\\t\\treturn true;\\n\\t}\\n\\treturn dir[s] == d;\\n}\\nvoid process() {\\n\\tmemset(f, 0, sizeof(f));\\n\\tstd::queue<HN> q;\\n\\tfor(int i = 0; i < 4; i ++) {\\n\\t\\tif(go[SX][SY][i]) {\\n\\t\\t\\tf[SX][SY][0][i] = true;\\n\\t\\t\\tq.push(HN(SX, SY, 0, i));\\n\\t\\t}\\n\\t}\\n\\twhile(!q.empty()) {\\n\\t\\tHN hn = q.front();\\n\\t\\tq.pop();\\n\\t\\tint x = hn.x, y = hn.y, s = hn.s, d = hn.d;\\n\\t\\tif(s >= S) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tint nx = x + dx[d], ny = y + dy[d], ns = s + 1;\\n\\t\\tfor(int i = -1; i <= 1; i ++) {\\n\\t\\t\\tint nd = (d + i + 4) % 4;\\n\\t\\t\\tif(go[nx][ny][nd] && (check(ns, d) || check(ns, nd)) && !f[nx][ny][ns][nd]) {\\n\\t\\t\\t\\tf[nx][ny][ns][nd] = true;\\n\\t\\t\\t\\tq.push(HN(nx, ny, ns, nd));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tstd::vector<P> ans;\\n\\tfor(int i = 0; i <= 50; i ++) {\\n\\t\\tfor(int j = 0; j <= 50; j ++) {\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor(int k = 0; k < 4; k ++) {\\n\\t\\t\\t\\tif(f[i][j][S][k]) {\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(ok) {\\n\\t\\t\\t\\tans.push_back(P(i, j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::sort(ans.begin(), ans.end());\\n\\tint n = ans.size();\\n\\tfor(int i = 0; i < n; i ++) {\\n\\t\\tprintf(\\\"%d %d\\\\n\\\", ans[i].x, ans[i].y);\\n\\t}\\n}\\nint main() {\\n\\t//freopen(\\\"test.in\\\", \\\"rb\\\", stdin);\\n\\tch['N'] = 0, ch['W'] = 1, ch['S'] = 2, ch['E'] = 3;\\n\\twhile(scanf(\\\"%d%d%d%d\\\", &N, &SX, &SY, &T) == 4) {\\n\\t\\tmemset(go, 0, sizeof(go));\\n\\t\\tint x1, y1, x2, y2;\\n\\t\\tfor(int i = 0; i < N; i ++) {\\n\\t\\t\\tscanf(\\\"%d%d%d%d\\\", &x1, &y1, &x2, &y2);\\n\\t\\t\\tif(x1 == x2) {\\n\\t\\t\\t\\tif(y1 > y2) {\\n\\t\\t\\t\\t\\tstd::swap(y1, y2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int i = y1; i <= y2; i ++) {\\n\\t\\t\\t\\t\\tif(i != y1) {\\n\\t\\t\\t\\t\\t\\tgo[x1][i][2] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(i != y2) {\\n\\t\\t\\t\\t\\t\\tgo[x1][i][0] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif(x1 > x2) {\\n\\t\\t\\t\\t\\tstd::swap(x1, x2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(int i = x1; i <= x2; i ++) {\\n\\t\\t\\t\\t\\tif(i != x1) {\\n\\t\\t\\t\\t\\t\\tgo[i][y1][1] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(i != x2) {\\n\\t\\t\\t\\t\\t\\tgo[i][y1][3] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemset(dir, -1, sizeof(dir));\\n\\t\\tS = 0;\\n\\t\\tint d;\\n\\t\\tchar s[5];\\n\\t\\tfor(int i = 0; i < T; i ++) {\\n\\t\\t\\tscanf(\\\"%d%s\\\", &d, s);\\n\\t\\t\\tS += d;\\n\\t\\t\\tdir[S] = ch[(int)s[0]];\\n\\t\\t}\\n\\t\\tprocess();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 14968,\n \"score_of_the_acc\": -0.3353,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1349_10826894\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n#define NUM 51\\n\\nenum DIR{\\n\\tNorth,\\n\\tEast,\\n\\tSouth,\\n\\tWest,\\n};\\n\\nint diff_x[4] = {0,1,0,-1},diff_y[4] = {1,0,-1,0};\\nbool can_move[NUM][NUM][4],dp[2][NUM][NUM][4];\\nint table[128];\\nDIR dir_array[4] = {North,East,South,West};\\n\\nint N;\\n\\nbool rangeCheck(int x,int y){\\n\\n\\tif(x >= 0 && x < NUM && y >= 0 && y < NUM)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\ttable['N'] = 0;\\n\\ttable['E'] = 1;\\n\\ttable['S'] = 2;\\n\\ttable['W'] = 3;\\n\\n\\tint start_x,start_y,T;\\n\\tscanf(\\\"%d %d %d %d\\\",&N,&start_x,&start_y,&T);\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tfor(int p = 0; p < 4; p++)can_move[i][k][p] = false;\\n\\t\\t}\\n\\t}\\n\\n\\t//移動可能情報の作成\\n\\tint x1,y1,x2,y2;\\n\\tfor(int loop = 0; loop < N; loop++){\\n\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&x1,&y1,&x2,&y2);\\n\\n\\t\\tif(x1 == x2){ //縦の移動\\n\\n\\t\\t\\tfor(int y = min(y1,y2); y < max(y1,y2); y++){\\n\\t\\t\\t\\tcan_move[x1][y][North] = true;\\n\\t\\t\\t\\tcan_move[x1][y+1][South] = true;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //横の移動\\n\\n\\t\\t\\tfor(int x = min(x1,x2); x < max(x1,x2); x++){\\n\\t\\t\\t\\tcan_move[x][y1][East] = true;\\n\\t\\t\\t\\tcan_move[x+1][y1][West] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint CURRENT = 0,NEXT = 1;\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tfor(int p = 0; p < 4; p++){\\n\\t\\t\\t\\tdp[CURRENT][i][k][p] = false; //dp[CURRENT/NEXT][x][y][dir] = true/false\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < 4; i++)dp[CURRENT][start_x][start_y][i] = true;\\n\\n\\tint dist,next_x,next_y;\\n\\tchar buf[2];\\n\\n\\tDIR dir;\\n\\n\\tfor(int loop = 0; loop < T; loop++){\\n\\n\\t\\tscanf(\\\"%d %s\\\",&dist,buf);\\n\\t\\tdir = dir_array[table[buf[0]]];\\n\\n\\t\\tfor(int count = 0; count < dist; count++){ //合計でdist移動する\\n\\n\\t\\t\\t//dp[NEXT]の初期化\\n\\t\\t\\tfor(int i = 0; i < NUM; i++){\\n\\t\\t\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\t\\t\\tfor(int p = 0; p < 4; p++){\\n\\t\\t\\t\\t\\t\\tdp[NEXT][i][k][p] = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//dp[CURRENT]を走査\\n\\t\\t\\tfor(int i = 0; i < NUM; i++){ //xのループ\\n\\t\\t\\t\\tfor(int k = 0; k < NUM; k++){ //yのループ\\n\\t\\t\\t\\t\\tfor(int p = 0; p < 4; p++){ //今向いている方向\\n\\t\\t\\t\\t\\t\\tif(!dp[CURRENT][i][k][p])continue;\\n\\n\\t\\t\\t\\t\\t\\tfor(int a = 0; a < 4; a++){ //進んだ後に向く方向\\n\\t\\t\\t\\t\\t\\t\\tif(abs(p-a) == 2)continue; //Uターン禁止\\n\\n\\t\\t\\t\\t\\t\\t\\tnext_x = i+diff_x[p]; //今向いている向きに進む\\n\\t\\t\\t\\t\\t\\t\\tnext_y = k+diff_y[p];\\n\\n\\t\\t\\t\\t\\t\\t\\tif(rangeCheck(next_x,next_y) == false || can_move[i][k][p] == false\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t|| can_move[next_x][next_y][a] == false)continue; //範囲外または行けないならSKIP\\n\\n\\t\\t\\t\\t\\t\\t\\tif(count < dist-1){\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[NEXT][next_x][next_y][a] = true;\\n\\n\\t\\t\\t\\t\\t\\t\\t}else{ //count == dist-1:向きを考慮する!!\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif(dir_array[p] == dir || dir_array[a] == dir){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[NEXT][next_x][next_y][a] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tswap(CURRENT,NEXT);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tfor(int k = 0; k < NUM; k++){\\n\\t\\t\\tfor(int a = 0; a < 4; a++){\\n\\t\\t\\t\\tif(dp[CURRENT][i][k][a]){\\n\\t\\t\\t\\t\\tprintf(\\\"%d %d\\\\n\\\",i,k);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.0123,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1349_10480164\",\n \"code_snippet\": \"// AOJ #1349 Automotive Navigation\\n// 2025.5.13\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint g[52][52];\\nbool dp[1001][52][52][4];\\nint meas[1001];\\n\\nconst int dx[4] = {0, 1, -1, 0};\\nconst int dy[4] = {1, 0, 0, -1};\\n\\nint dir_id(char c){\\n if(c=='N') return 0;\\n if(c=='E') return 1;\\n if(c=='W') return 2;\\n if(c=='S') return 3;\\n return -1;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int n, sx, sy, t;\\n cin >> n >> sx >> sy >> t;\\n\\n for(int i=0;i<n;i++){\\n int x1,y1,x2,y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n if(x1==x2){\\n if(y1>y2) swap(y1,y2);\\n for(int y=y1;y<y2;y++){\\n g[x1][y] |= 1<<0;\\n g[x1][y+1] |= 1<<3;\\n }\\n } else {\\n if(x1>x2) swap(x1,x2);\\n for(int x=x1;x<x2;x++){\\n g[x][y1] |= 1<<1;\\n g[x+1][y1] |= 1<<2;\\n }\\n }\\n }\\n\\n int sumd = 0;\\n for(int i=0;i<=1000;i++) meas[i] = -1;\\n\\n for(int i=0;i<t;i++){\\n int d; char buf[5];\\n cin >> d >> buf;\\n sumd += d;\\n meas[sumd] = dir_id(buf[0]);\\n }\\n\\n for(int d=0;d<4;d++) dp[0][sx][sy][d] = true;\\n\\n for(int s=0; s<sumd; s++){\\n for(int x=0; x<=50; x++){\\n for(int y=0; y<=50; y++){\\n for(int l=0; l<4; l++){\\n if(!dp[s][x][y][l]) continue;\\n int mv = meas[s];\\n for(int p=0; p<4; p++){\\n if(!(g[x][y] & (1<<p))) continue;\\n if(l + p == 3) continue;\\n if(mv != -1 && p!=mv && l!=mv) continue;\\n int nx = x + dx[p], ny = y + dy[p];\\n if(nx<0||nx>50||ny<0||ny>50) continue;\\n dp[s+1][nx][ny][p] = true;\\n }\\n }\\n }\\n }\\n }\\n\\n int final_mv = meas[sumd];\\n set<pair<int,int>> ans;\\n for(int x=0;x<=50;x++){\\n for(int y=0;y<=50;y++){\\n bool ok=false;\\n for(int k=0;k<4;k++){\\n if(!dp[sumd][x][y][k]) continue;\\n if(k == final_mv){ ok=true; break; }\\n if(k + final_mv != 3 && (g[x][y] & (1<<final_mv))){ ok=true; break; }\\n }\\n if(ok) ans.emplace(x,y);\\n }\\n }\\n for(auto &p: ans) cout << p.first << \\\" \\\" << p.second << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11188,\n \"score_of_the_acc\": -0.228,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1349_10002993\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n\\nconst int mx=60;\\nconst int dmx=1010;\\nint Convert(int x,int y){return x*mx+y;}\\nconst string str=\\\"NESW\\\";\\nconst int dx[]={0,1,0,-1};\\nconst int dy[]={1,0,-1,0};\\nbool seen[mx][mx][4][dmx];\\n\\nint main(){\\n\\tint N,sx,sy,T;\\n\\tcin>>N>>sx>>sy>>T;\\n\\tsx+=2,sy+=2;\\n\\n\\tvector<vector<int>>G(mx*mx);\\n\\twhile(N--){\\n\\t\\tint a,b,c,d;\\n\\t\\tcin>>a>>b>>c>>d;\\n\\t\\ta+=2,b+=2,c+=2,d+=2;\\n\\t\\tif(a==c){\\n\\t\\t\\tfor(int i=min(b,d);i<max(b,d);i++){\\n\\t\\t\\t\\tG[Convert(a,i)].push_back(Convert(a,i+1));\\n\\t\\t\\t\\tG[Convert(a,i+1)].push_back(Convert(a,i));\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int i=min(a,c);i<max(a,c);i++){\\n\\t\\t\\t\\tG[Convert(i,b)].push_back(Convert(i+1,b));\\n\\t\\t\\t\\tG[Convert(i+1,b)].push_back(Convert(i,b));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int>info(dmx,-1);\\n\\tint goald=0,sum=0;\\n\\tfor(int i=0;i<T;i++){\\n\\t\\tint d;char c;cin>>d>>c;\\n\\t\\tsum+=d;\\n\\t\\tgoald=sum;\\n\\t\\tinfo[sum]=str.find(c);\\n\\t}\\n\\n\\t//x,y,px,py,dir,dist\\n\\tusing tup=tuple<int,int,int,int>;\\n\\tqueue<tup> que;\\n\\tque.push({sx,sy,-1,0});\\n\\n\\tset<pair<int,int>>ans;\\n\\n\\twhile(!que.empty()){\\n\\t\\tauto[x,y,dir,dist]=que.front();que.pop();\\n\\n\\t\\tif(dist>goald)break;\\n\\n\\n\\t\\tfor(int d=0;d<4;d++){\\n\\t\\t\\tint nx=x+dx[d],ny=y+dy[d];\\n\\t\\t\\tif(count(G[Convert(x,y)].begin(),G[Convert(x,y)].end(),Convert(nx,ny))==0)continue;\\n\\t\\t\\tif(seen[nx][ny][d][dist+1])continue;\\n\\t\\t\\tif(dir!=-1&&(dir+4-d)%4==2)continue;\\n\\t\\t\\tif(info[dist]!=-1&&info[dist]!=dir&&info[dist]!=d)continue;\\n\\n\\t\\t\\tseen[nx][ny][d][dist+1]=true;\\n\\t\\t\\tif(dist==goald&&(info[dist]==dir||info[dist]==d)){\\n\\t\\t\\t\\tans.insert({x-2,y-2});\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tque.push({nx,ny,d,dist+1});\\n\\t\\t}\\n\\t}\\n\\n\\tfor(auto[x,y]:ans)cout<<x<<' '<<y<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 14268,\n \"score_of_the_acc\": -0.3176,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1349_10002974\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n\\nconst int mx=60;\\nconst int dmx=1010;\\nint Convert(int x,int y){return x*mx+y;}\\nconst string str=\\\"NESW\\\";\\nconst int dx[]={0,1,0,-1};\\nconst int dy[]={1,0,-1,0};\\nbool seen[mx][mx][4][dmx];\\n\\nint main(){\\n\\tint N,sx,sy,T;\\n\\tcin>>N>>sx>>sy>>T;\\n\\tsx+=2,sy+=2;\\n\\n\\tvector<vector<int>>G(mx*mx);\\n\\twhile(N--){\\n\\t\\tint a,b,c,d;\\n\\t\\tcin>>a>>b>>c>>d;\\n\\t\\ta+=2,b+=2,c+=2,d+=2;\\n\\t\\tif(a==c){\\n\\t\\t\\tfor(int i=min(b,d);i<max(b,d);i++){\\n\\t\\t\\t\\tG[Convert(a,i)].push_back(Convert(a,i+1));\\n\\t\\t\\t\\tG[Convert(a,i+1)].push_back(Convert(a,i));\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tfor(int i=min(a,c);i<max(a,c);i++){\\n\\t\\t\\t\\tG[Convert(i,b)].push_back(Convert(i+1,b));\\n\\t\\t\\t\\tG[Convert(i+1,b)].push_back(Convert(i,b));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int>info(dmx,-1);\\n\\tint goald=0,sum=0;\\n\\tfor(int i=0;i<T;i++){\\n\\t\\tint d;char c;cin>>d>>c;\\n\\t\\tsum+=d;\\n\\t\\tgoald=sum;\\n\\t\\tinfo[sum]=str.find(c);\\n\\t}\\n\\n\\t//x,y,px,py,dir,dist\\n\\tusing tup=tuple<int,int,int,int>;\\n\\tvector<tup> que;\\n\\tque.push_back({sx,sy,-1,0});\\n\\n\\tset<pair<int,int>>ans;\\n\\n\\t//while(!que.empty()){\\n\\tfor(int t=0;t<(int)que.size();t++){\\n\\t\\tauto[x,y,dir,dist]=que[t];\\n\\n\\t\\tif(dist>goald)continue;\\n\\n\\n\\t\\tfor(int d=0;d<4;d++){\\n\\t\\t\\tint nx=x+dx[d],ny=y+dy[d];\\n\\t\\t\\tif(count(G[Convert(x,y)].begin(),G[Convert(x,y)].end(),Convert(nx,ny))==0)continue;\\n\\t\\t\\tif(seen[nx][ny][d][dist+1])continue;\\n\\t\\t\\tif(dir!=-1&&(dir+4-d)%4==2)continue;\\n\\t\\t\\tif(info[dist]!=-1&&info[dist]!=dir&&info[dist]!=d)continue;\\n\\n\\t\\t\\tif(dist==goald&&(info[dist]==dir||info[dist]==d)){\\n\\t\\t\\t\\tans.insert({x-2,y-2});\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tque.push_back({nx,ny,d,dist+1});\\n\\t\\t}\\n\\t}\\n\\n\\tfor(auto[x,y]:ans)cout<<x<<' '<<y<<endl;\\n}\",\n \"accuracy\": 0.03571428571428571,\n \"time_ms\": 20,\n \"memory_kb\": 36200,\n \"score_of_the_acc\": -0.9405,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1349_9808763\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\nusing i64 = long long;\\nusing f64 = long double;\\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n \\n int n, x0, y0, t; cin >> n >> x0 >> y0 >> t;\\n const int M = 51;\\n auto h = [&](int x, int y) { return x * M + y; };\\n vector to(M * M, vector(4, int(-1)));\\n rep(_, n) {\\n int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;\\n if(sx == ex) {\\n const int x = sx;\\n if(sy > ey) swap(sy, ey);\\n srep(y, sy, ey) {\\n const int u = h(x, y), v = h(x, y + 1);\\n to[u][0] = v;\\n to[v][2] = u;\\n }\\n } else {\\n const int y = sy;\\n if(sx > ex) swap(sx, ex);\\n srep(x, sx, ex) {\\n const int u = h(x, y), v = h(x + 1, y);\\n to[u][1] = v;\\n to[v][3] = u;\\n }\\n }\\n }\\n\\n vector<int> dir = {-1};\\n rep(_, t) {\\n int d; char c; cin >> d >> c;\\n rep(i, d-1) dir.push_back(-1);\\n if(c == 'N') dir.push_back(0);\\n if(c == 'E') dir.push_back(1);\\n if(c == 'S') dir.push_back(2);\\n if(c == 'W') dir.push_back(3);\\n }\\n const int LAST = dir.back();\\n dir.pop_back();\\n\\n vector dp(M * M, vector(4, int(0)));\\n dp[h(x0, y0)] = vector(4, int(1));\\n for(int cons : dir) {\\n vector nt(M * M, vector(4, int(0)));\\n rep(i, M * M) rep(d, 4) if(dp[i][d]) {\\n rep(nd, 4) {\\n if(abs(d - nd) == 2) continue;\\n if(cons != -1 and d != cons and nd != cons) continue;\\n const int ni = to[i][nd];\\n if(ni == -1) continue;\\n nt[ni][nd] = 1;\\n }\\n }\\n dp = move(nt);\\n }\\n\\n vector<pair<int, int>> ans;\\n rep(i, M * M) {\\n bool ok = [&] {\\n rep(d, 4) {\\n if(abs(d - LAST) == 2) continue;\\n if(dp[i][d]) {\\n if(d == LAST) return true;\\n if(to[i][LAST] != -1) return true;\\n }\\n }\\n return false;\\n }();\\n if(ok) ans.push_back({i / M, i % M});\\n }\\n sort(ans.begin(), ans.end());\\n for(auto [x, y] : ans) cout << x << \\\" \\\" << y << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.0297,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1349_8493021\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define per(i, n) for(int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for(int i = (l); i < (r); i++)\\n#define per2(i, l, r) for(int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for(auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template<typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\n\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\n\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n int n, x0, y0, t;\\n cin >> n >> x0 >> y0 >> t;\\n x0 *= 2, y0 *= 2;\\n int h = 101, w = 101;\\n vector<vector<bool>> road(h, vector<bool>(w, false));\\n rep(i, n) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n x1 *= 2, y1 *= 2, x2 *= 2, y2 *= 2;\\n if (x1 == x2) {\\n rep2(y, min(y1, y2), max(y1, y2) + 1) road[y][x1] = true;\\n }\\n else {\\n rep2(x, min(x1, x2), max(x1, x2) + 1) road[y2][x] = true;\\n }\\n }\\n vector<int> d(t);\\n vector<char> dirs(t);\\n rep(i, t) cin >> d[i] >> dirs[i], d[i] *= 2;\\n int sd = accumulate(all(d), 0);\\n vector<char> dl(sd + 1, '.');\\n int ns = 0;\\n rep(i, t) ns += d[i], dl[ns] = dirs[i];\\n string dc = \\\"ENWS\\\";\\n int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\\n vector f(h, vector(w, vector(4, 0)));\\n queue<pair<pii, int>> que;\\n auto check = [&](int ny, int nx, int dir) ->bool {\\n int ney = ny + dy[dir], nex = nx + dx[dir];\\n if (ney < 0 || h <= ney || nex < 0 || w <= nex)\\n return false;\\n return road[ney][nex];\\n };\\n rep(dir, 4) if (check(y0, x0, dir)) f[y0][x0][dir] = 1, que.emplace(pair(y0, x0), dir);\\n rep(nt, sd) {\\n queue<pair<pii, int>> nque;\\n vector nf(h, vector(w, vector(4, 0)));\\n while (sz(que)) {\\n auto [yx, ndir] = que.front();\\n que.pop();\\n auto [ny, nx] = yx;\\n if (nt == sd)\\n continue;\\n int ney = ny + dy[ndir], nex = nx + dx[ndir];\\n rep(dd, 4) {\\n if (dd == 2)\\n continue;\\n int dir = (ndir + dd) % 4;\\n if (!check(ney, nex, dir) || (dl[nt + 1] != '.' && dl[nt + 1] != dc[dir] && dl[nt + 1] != dc[ndir]))\\n continue;\\n if (!nf[ney][nex][dir])\\n nf[ney][nex][dir] = 1, nque.emplace(pair(ney, nex), dir);\\n }\\n }\\n swap(f, nf);\\n swap(que, nque);\\n }\\n rep(x, w) rep(y, h) {\\n rep(dir, 4) {\\n if (f[y][x][dir]) {\\n cout << x / 2 << ' ' << y / 2 << endl;\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 4604,\n \"score_of_the_acc\": -0.1298,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1349_7235414\",\n \"code_snippet\": \"#include <iostream>\\nusing namespace std;\\n\\n// Input\\nint N, SX, SY, T;\\nint AX[1009], AY[1009], BX[1009], BY[1009];\\nint D[1009]; char C[1009];\\nint Total_Time, Direction[1009];\\n\\n// Dynamic Programming\\nint dx[4] = {0, 1, 0, -1};\\nint dy[4] = {1, 0, -1, 0};\\nbool Road[1009][1009];\\nbool dp[1009][109][109][4];\\n\\nbool check(int ax, int ay) {\\n\\tif (ax < 0 || ay < 0 || ax > 100 || ay > 100) return false;\\n\\treturn Road[ax][ay];\\n}\\n\\nvoid Transition(int tm, int cx, int cy, int dir) {\\n\\tint dir0 = (dir + 0) % 4;\\n\\tint dir1 = (dir + 1) % 4;\\n\\tint dir3 = (dir + 3) % 4;\\n\\tcx += dx[dir];\\n\\tcy += dy[dir];\\n\\t\\n\\t// Pattern 1: No turn\\n\\tif (check(cx * 2 + dx[dir0], cy * 2 + dy[dir0]) == true) {\\n\\t\\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0) {\\n\\t\\t\\tdp[tm+1][cx][cy][dir0] = true;\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Pattern 2: Left Turn\\n\\tif (check(cx * 2 + dx[dir3], cy * 2 + dy[dir3]) == true) {\\n\\t\\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0 || Direction[tm+1] == dir3) {\\n\\t\\t\\tdp[tm+1][cx][cy][dir3] = true;\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Pattern 3: Right Turn\\n\\tif (check(cx * 2 + dx[dir1], cy * 2 + dy[dir1]) == true) {\\n\\t\\tif (Direction[tm+1] == -1 || Direction[tm+1] == dir0 || Direction[tm+1] == dir1) {\\n\\t\\t\\tdp[tm+1][cx][cy][dir1] = true;\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\t// Input\\n\\tcin >> N >> SX >> SY >> T;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tcin >> AX[i] >> AY[i] >> BX[i] >> BY[i];\\n\\t\\tif (AX[i] > BX[i]) swap(AX[i], BX[i]);\\n\\t\\tif (AY[i] > BY[i]) swap(AY[i], BY[i]);\\n\\t\\tfor (int j = AX[i] * 2; j <= BX[i] * 2; j++) {\\n\\t\\t\\tfor (int k = AY[i] * 2; k <= BY[i] * 2; k++) Road[j][k] = true;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <= 1000; i++) Direction[i] = -1;\\n\\tfor (int i = 0; i < T; i++) {\\n\\t\\tcin >> D[i] >> C[i];\\n\\t\\tTotal_Time += D[i];\\n\\t\\tif (C[i] == 'N') Direction[Total_Time] = 0;\\n\\t\\tif (C[i] == 'E') Direction[Total_Time] = 1;\\n\\t\\tif (C[i] == 'S') Direction[Total_Time] = 2;\\n\\t\\tif (C[i] == 'W') Direction[Total_Time] = 3;\\n\\t}\\n\\t\\n\\t// Dynamic Programming\\n\\tif (check(SX * 2 + dx[0], SY * 2 + dy[0]) == true) dp[0][SX][SY][0] = true;\\n\\tif (check(SX * 2 + dx[1], SY * 2 + dy[1]) == true) dp[0][SX][SY][1] = true;\\n\\tif (check(SX * 2 + dx[2], SY * 2 + dy[2]) == true) dp[0][SX][SY][2] = true;\\n\\tif (check(SX * 2 + dx[3], SY * 2 + dy[3]) == true) dp[0][SX][SY][3] = true;\\n\\tfor (int i = 0; i < Total_Time; i++) {\\n\\t\\tfor (int j = 0; j <= 50; j++) {\\n\\t\\t\\tfor (int k = 0; k <= 50; k++) {\\n\\t\\t\\t\\tfor (int l = 0; l < 4; l++) {\\n\\t\\t\\t\\t\\tif (dp[i][j][k][l] == false) continue;\\n\\t\\t\\t\\t\\t// cout << i << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << l << endl;\\n\\t\\t\\t\\t\\tTransition(i, j, k, l);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Output\\n\\tfor (int i = 0; i <= 50; i++) {\\n\\t\\tfor (int j = 0; j <= 50; j++) {\\n\\t\\t\\tbool flag = false;\\n\\t\\t\\tfor (int k = 0; k < 4; k++) {\\n\\t\\t\\t\\tif (dp[Total_Time][i][j][k] == true) flag = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (flag == true) cout << i << \\\" \\\" << j << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 38372,\n \"score_of_the_acc\": -1,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1349_6740595\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n using type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n using type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[value % 10];\\n value /= 10;\\n } while (value != 0);\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n __int128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n if (s[0] == '-') ret = -ret;\\n return ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n __uint128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_i128(s);\\n return in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_u128(s);\\n return in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n (std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n std::string res;\\n if (bit_num >= 0) {\\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n } else {\\n for (; val; val >>= 1) res += '0' + (val & 1);\\n std::reverse(res.begin(), res.end());\\n }\\n return res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n std::vector<T> res;\\n for (; val; val /= base) res.push_back(val % base);\\n if (res.empty()) res.push_back(T{ 0 });\\n return res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n auto res = digits_low_to_high(val, base);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n std::ostringstream ss;\\n for (auto it = v.begin(); it != v.end();) {\\n ss << *it;\\n if (++it != v.end()) ss << sep;\\n }\\n ss << end;\\n return ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_{};\\n\\n// ! code from here\\n\\nconstexpr int K = 50;\\n\\nconstexpr int dx[4]{ 1, 0, -1, 0 };\\nconstexpr int dy[4]{ 0, 1, 0, -1 };\\nconstexpr int E = 0, N = 1, W = 2, S = 3;\\n\\nint main() {\\n array<int, 256> ch_to_d{};\\n ch_to_d['E'] = E;\\n ch_to_d['N'] = N;\\n ch_to_d['W'] = W;\\n ch_to_d['S'] = S;\\n\\n input(int, n, x0, y0, t);\\n\\n vector h(K, vector<int8_t>(K + 1, false));\\n vector v(K + 1, vector<int8_t>(K, false));\\n\\n loop(n) {\\n input(int, x1, y1, x2, y2);\\n\\n if (x1 == x2) {\\n if (y1 > y2) swap(y1, y2);\\n rep(y, y1, y2) {\\n v[x1][y] = true;\\n }\\n } else if (y1 == y2) {\\n if (x1 > x2) swap(x1, x2);\\n rep(x, x1, x2) {\\n h[x][y1] = true;\\n }\\n }\\n }\\n\\n auto try_succ = [&](int x, int y, int d) -> optional<pair<int, int>> {\\n if (d == E) {\\n if (x == K or not h[x][y]) return std::nullopt;\\n return pair{ x + 1, y };\\n } else if (d == W) {\\n if (x == 0 or not h[x - 1][y]) return std::nullopt;\\n return pair{ x - 1, y };\\n } else if (d == N) {\\n if (y == K or not v[x][y]) return std::nullopt;\\n return pair{ x, y + 1 };\\n } else {\\n if (y == 0 or not v[x][y - 1]) return std::nullopt;\\n return pair{ x, y - 1 };\\n }\\n };\\n\\n vector<tuple<int, int, int>> st;\\n st.emplace_back(x0, y0, 0b1111);\\n\\n loop(t) {\\n input(int, dist);\\n input(char, dir_ch);\\n const int dir = ch_to_d[dir_ch];\\n\\n rep(cur_dist, dist - 1) {\\n vector<tuple<int, int, int>> nst;\\n for (auto [x, y, pd] : st) {\\n rep(d, 4) if (kth_bit(pd, d)) {\\n auto nxy = try_succ(x, y, d);\\n if (not nxy.has_value()) continue;\\n auto [nx, ny] = *nxy;\\n nst.emplace_back(nx, ny, 0b1111 & ~(1 << (d ^ 2)));\\n }\\n }\\n sort_unique_erase(nst);\\n nst.swap(st);\\n }\\n\\n vector<tuple<int, int, int>> nst;\\n for (auto [x, y, pd] : st) {\\n rep(d, 4) if (kth_bit(pd, d)) {\\n auto nxy = try_succ(x, y, d);\\n if (not nxy.has_value()) continue;\\n auto [nx, ny] = *nxy;\\n nst.emplace_back(nx, ny, (d == dir ? 0b1111 : 1 << dir) & ~(1 << (d ^ 2)));\\n }\\n }\\n sort_unique_erase(nst);\\n nst.swap(st);\\n }\\n\\n vector<pair<int, int>> ans;\\n for (auto [x, y, pd] : st) {\\n rep(d, 4) if (kth_bit(pd, d)) {\\n auto nxy = try_succ(x, y, d);\\n if (not nxy.has_value()) continue;\\n ans.emplace_back(x, y);\\n }\\n }\\n sort_unique_erase(ans);\\n\\n print_all(ans, \\\"\\\\n\\\");\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.032,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1349_6667840\",\n \"code_snippet\": \"#line 1 \\\"c.cpp\\\"\\n/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.05.30 15:48:54 */\\n\\n#line 2 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\n#line 2 \\\"SPJ-Library/template/basic_func.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <vector>\\n\\ntemplate <class T0, class T1, class T2>\\ninline bool in_range(T0 x, T1 lef, T2 rig) {\\n\\treturn ((lef <= x) && (x < rig));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n\\tif(a > b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n\\tif(a < b) {\\n\\t\\ta = b;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nvoid Yes(bool flag = true) { std::cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\nvoid YES(bool flag = true) { std::cout << (flag ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n'; }\\n\\ntemplate <class T>\\nvoid drop(T answer) {\\n\\tstd::cout << answer << '\\\\n';\\n\\texit(0);\\n}\\n\\ntemplate <class T>\\nvoid vout(std::vector<T> const &v, bool vertically = 0) {\\n\\tif(vertically) {\\n\\t\\tfor(auto const &a : v) {\\n\\t\\t\\tstd::cout << a << '\\\\n';\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(auto it = v.begin(); it != v.end(); it++) {\\n\\t\\tstd::cout << (*it);\\n\\t\\tif(it != v.end() - 1) {\\n\\t\\t\\tstd::cout << ' ';\\n\\t\\t}\\n\\t}\\n\\tstd::cout << '\\\\n';\\n\\treturn;\\n}\\n\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <class T>\\ninline void print(const T &x) {\\n\\tstd::cout << x << '\\\\n';\\n\\treturn;\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid print(const Head &H, const Tail &... T) {\\n\\tstd::cout << H << \\\" \\\";\\n\\tprint(T...);\\n}\\n\\ntemplate <class T>\\nvoid add(std::vector<T> &v, T value) {\\n\\tfor(auto &a : v) a += value;\\n\\treturn;\\n}\\n\\ntemplate <class T>\\nT greatest_lower_multiple(T x, T d) {\\n\\tif(d == 0) return 0;\\n\\tif(d < 0) d *= -1;\\n\\tT y = x % d;\\n\\tif(y < 0) y += d;\\n\\treturn x - y;\\n}\\n\\ntemplate <class T>\\nT least_upper_multiple(T x, T d) {\\n\\treturn -greatest_lower_multiple(-x, d);\\n}\\n\\n// ceil(a / b);\\ntemplate <class T>\\nT dup(T a, T b) {\\n\\tassert(b);\\n\\tif(b < 0) {\\n\\t\\ta *= -1;\\n\\t\\tb *= -1;\\n\\t}\\n\\treturn least_upper_multiple(a, b) / b;\\n}\\n\\nlong long pow_ll(long long a, long long n) {\\n\\tassert(n >= 0LL);\\n\\tif(n == 0) return 1LL;\\n\\tif(a == 0) return 0LL;\\n\\tif(a == 1) return 1LL;\\n\\tif(a == -1) return (n & 1LL) ? -1LL : 1LL;\\n\\tlong long res = 1;\\n\\twhile(n > 1LL) {\\n\\t\\tif(n & 1LL) res *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res * a;\\n}\\n\\nlong long modpow(long long a, long long n, long long mod) {\\t // a^n mod\\n\\tassert(n >= 0 && mod);\\n\\tif(mod == 1) return 0LL;\\n\\tlong long res = 1;\\n\\ta %= mod;\\n\\twhile(n > 0) {\\n\\t\\tif(n & 1) res = res * a % mod;\\n\\t\\ta = a * a % mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn res < 0 ? res + mod : res;\\n}\\n\\n// return x which satisfies a * x % mod == gcd(a, mod)\\n// not (mod | a)\\nlong long modinv(long long a, const long long mod) {\\n\\tlong long b = mod, u = 1, v = 0;\\n\\twhile(b) {\\n\\t\\tlong long t = a / b;\\n\\t\\ta -= t * b;\\n\\t\\tstd::swap(a, b);\\n\\t\\tu -= t * v;\\n\\t\\tstd::swap(u, v);\\n\\t}\\n\\tu %= mod;\\n\\tif(u < 0) u += mod;\\n\\treturn u;\\n}\\n\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) {\\n\\treturn (int)std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));\\n}\\ntemplate <class T>\\nvoid unq_sort(std::vector<T> &a) {\\n\\tstd::sort(a.begin(), a.end());\\n\\ta.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nstd::vector<int> press(const std::vector<T> &a) {\\n\\tstd::vector<T> vec = a;\\n\\tunq_sort(vec);\\n\\tstd::vector<int> ret;\\n\\tfor(const auto &v : a) ret.push_back(lb(vec, v));\\n\\treturn ret;\\n}\\n#line 1 \\\"SPJ-Library/template/header.hpp\\\"\\n#include <bits/stdc++.h>\\n#line 2 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 4 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#line 8 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\n#line 3 \\\"SPJ-Library/template/constants.hpp\\\"\\n\\nconstexpr int inf = 1000'000'000;\\nconstexpr long long INF = 1'000'000'000'000'000'000LL;\\nconstexpr int mod_1000000007 = 1000000007;\\nconstexpr int mod_998244353 = 998244353;\\nconst long double pi = acosl(-1.);\\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n#line 10 \\\"SPJ-Library/template/debug.hpp\\\"\\n\\nnamespace viewer {\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p);\\n\\nvoid view(const long long &e);\\n\\nvoid view(const int &e);\\n\\ntemplate <typename T>\\nvoid view(const T &e);\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v);\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v);\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v);\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v);\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v);\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m);\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m);\\n\\ntemplate <typename container_type>\\nvoid view_container(const container_type &c, bool vertically = false) {\\n\\ttypename container_type::const_iterator begin = c.begin();\\n\\tconst typename container_type::const_iterator end = c.end();\\n\\tif(vertically) {\\n\\t\\tstd::cerr << \\\"{\\\\n\\\";\\n\\t\\twhile(begin != end) {\\n\\t\\t\\tstd::cerr << '\\\\t';\\n\\t\\t\\tview(*(begin++));\\n\\t\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\t\\tstd::cerr << '\\\\n';\\n\\t\\t}\\n\\t\\tstd::cerr << '}';\\n\\t\\treturn;\\n\\t}\\n\\tstd::cerr << \\\"{ \\\";\\n\\twhile(begin != end) {\\n\\t\\tview(*(begin++));\\n\\t\\tif(begin != end) std::cerr << ',';\\n\\t\\tstd::cerr << ' ';\\n\\t}\\n\\tstd::cerr << '}';\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::pair<T, U> &p) {\\n\\tstd::cerr << '(';\\n\\tview(p.first);\\n\\tstd::cerr << \\\", \\\";\\n\\tview(p.second);\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::tuple<T0, T1, T2> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << ')';\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::tuple<T0, T1, T2, T3> &p) {\\n\\tstd::cerr << '(';\\n\\tview(std::get<0>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<1>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<2>(p));\\n\\tstd::cerr << \\\", \\\";\\n\\tview(std::get<3>(p));\\n\\tstd::cerr << ')';\\n}\\n\\nvoid view(const long long &e) {\\n\\tif(e == INF)\\n\\t\\tstd::cerr << \\\"INF\\\";\\n\\telse if(e == -INF)\\n\\t\\tstd::cerr << \\\"-INF\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\nvoid view(const int &e) {\\n\\tif(e == inf)\\n\\t\\tstd::cerr << \\\"inf\\\";\\n\\telse if(e == -inf)\\n\\t\\tstd::cerr << \\\"-inf\\\";\\n\\telse\\n\\t\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const T &e) {\\n\\tstd::cerr << e;\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_set<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::unordered_multiset<T> &s) {\\n\\tview_container(s);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<T> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T, std::size_t ary_size>\\nvoid view(const std::array<T, ary_size> &v) {\\n\\tview_container(v);\\n}\\n\\ntemplate <typename T>\\nvoid view(const std::vector<std::vector<T>> &vv) {\\n\\tview_container(vv, true);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::vector<std::pair<T, U>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid view(const std::vector<std::tuple<T0, T1, T2>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {\\n\\tview_container(v, true);\\n}\\n\\ntemplate <typename map_type>\\nvoid view_map_container(const map_type &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(typename map_type::const_iterator it = m.begin(); it != m.end(); it++) {\\n\\t\\tstd::cerr << \\\"\\\\t[\\\";\\n\\t\\tview(it->first);\\n\\t\\tstd::cerr << \\\"] : \\\";\\n\\t\\tview(it->second);\\n\\t\\tstd::cerr << '\\\\n';\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\ntemplate <typename T, typename U>\\nvoid view(const std::unordered_map<T, U> &m) {\\n\\tview_map_container(m);\\n}\\n\\n} // namespace viewer\\n\\n// when compiling : g++ foo.cpp -DLOCAL\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename T>\\nvoid debug_out(const T &x) {\\n\\tviewer::view(x);\\n}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(const Head &H, const Tail &... T) {\\n\\tviewer::view(H);\\n\\tstd::cerr << \\\", \\\";\\n\\tdebug_out(T...);\\n}\\n#define debug(...) \\\\\\n\\tdo { \\\\\\n\\t\\tstd::cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"] : [\\\"; \\\\\\n\\t\\tdebug_out(__VA_ARGS__); \\\\\\n\\t\\tstd::cerr << \\\"]\\\\n\\\"; \\\\\\n\\t} while(0)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n#line 2 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\n#line 6 \\\"SPJ-Library/template/scanner.hpp\\\"\\n\\nnamespace scanner {\\ntemplate <class T>\\nvoid scan(T &a) {\\n\\tstd::cin >> a;\\n}\\n\\ntemplate <class T, class L>\\nvoid scan(std::pair<T, L> &p) {\\n\\tscan(p.first);\\n\\tscan(p.second);\\n}\\n\\ntemplate <class T0, class T1, class T2>\\nvoid scan(std::tuple<T0, T1, T2> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tp = std::make_tuple(t0, t1, t2);\\n}\\n\\ntemplate <class T0, class T1, class T2, class T3>\\nvoid scan(std::tuple<T0, T1, T2, T3> &p) {\\n\\tT0 t0;\\n\\tT1 t1;\\n\\tT2 t2;\\n\\tT3 t3;\\n\\tscan(t0);\\n\\tscan(t1);\\n\\tscan(t2);\\n\\tscan(t3);\\n\\tp = std::make_tuple(t0, t1, t2, t3);\\n}\\n\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) {\\n\\tfor(auto &i : a) scan(i);\\n}\\n\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#line 7 \\\"SPJ-Library/template/io.hpp\\\"\\n\\n#define VEC(type, name, size) \\\\\\n\\tvector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tvector<vector<type>> name(h, vector<type>(w)); \\\\\\n\\tscanner::INPUT(name)\\n#define INT(...) \\\\\\n\\tint __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LL(...) \\\\\\n\\tlong long __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define STR(...) \\\\\\n\\tstring __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DBL(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define TPL3(type0, type1, type2, name) \\\\\\n\\tstd::tuple<type0, type1, type2> name; \\\\\\n\\tscanner::INPUT(name);\\n#define TPL4(type0, type1, type2, type3, name) \\\\\\n\\tstd::tuple<type0, type1, type2, type3> name; \\\\\\n\\tscanner::INPUT(name);\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << ' ' << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {\\n\\tfor(typename std::vector<T>::const_iterator it = v.begin(); it != v.end(); it++) {\\n\\t\\tif(it != v.begin()) std::cerr << ' ';\\n\\t\\tos << *it;\\n\\t}\\n\\treturn os;\\n}\\n\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t\\tstd::cin.tie(nullptr);\\n\\t\\tstd::cout << std::fixed << std::setprecision(15);\\n\\t\\tsrand((unsigned)time(NULL));\\n\\t}\\n} fast_io_;\\n#line 2 \\\"SPJ-Library/template/macros.hpp\\\"\\n\\n#define foa(s, v) for(auto &s : v)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define pcnt(n) __builtin_popcountll((long long)n)\\n\\n#define REPname(a, b, c, d, e, ...) e\\n#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)\\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\\n#define DREPname(a, b, c, d, e, ...) e\\n#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)\\n#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)\\n#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = std::vector<int>;\\nusing vvi = std::vector<std::vector<int>>;\\nusing vvvi = std::vector<std::vector<std::vector<int>>>;\\nusing vll = std::vector<ll>;\\nusing vvll = std::vector<vll>;\\nusing vvvll = std::vector<vvll>;\\ntemplate <class T = ll>\\nusing V = std::vector<T>;\\ntemplate <class T = ll>\\nusing VV = V<V<T>>;\\ntemplate <class T = ll>\\nusing VVV = V<V<V<T>>>;\\ntemplate <class T = ll>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T = ll>\\nusing pqdn = std::priority_queue<T>;\\n#line 7 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\nusing namespace std;\\n#line 5 \\\"c.cpp\\\"\\n\\nvoid solve(int n) {\\n\\tint x, y, time_end;\\n\\tcin >> x >> y >> time_end;\\n#ifdef LOCAL\\n\\tconst int len = 53;\\n#else\\n\\tconst int len = 53;\\n#endif\\n\\tconst int dir_max = 4;\\n\\tVVV<int> can_go(len, vvi(len, vi(dir_max, 0)));\\n\\trep(n) {\\n\\t\\tint x1, y1;\\n\\t\\tcin >> x1 >> y1;\\n\\t\\tINT(x2, y2);\\n\\t\\tint direction = 0;\\n\\t\\tint distance = abs(x1 + y1 - (x2 + y2));\\n\\t\\tif(x1 < x2) {\\n\\t\\t\\tdirection = 0;\\n\\t\\t} else if(x1 > x2) {\\n\\t\\t\\tdirection = 2;\\n\\t\\t} else if(y1 < y2) {\\n\\t\\t\\tdirection = 1;\\n\\t\\t} else {\\n\\t\\t\\tdirection = 3;\\n\\t\\t}\\n\\t\\tassert(x1 + dx[direction] * distance == x2 && y1 + dy[direction] * distance == y2);\\n\\t\\tint rev_dir = (direction + 2) % dir_max;\\n\\t\\twhile(x1 != x2 || y1 != y2) {\\n\\t\\t\\tint nxtx = x1 + dx[direction];\\n\\t\\t\\tint nxty = y1 + dy[direction];\\n\\t\\t\\tcan_go[x1][y1][direction] = 1;\\n\\t\\t\\tcan_go[nxtx][nxty][rev_dir] = 1;\\n\\t\\t\\tx1 = nxtx;\\n\\t\\t\\ty1 = nxty;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<pair<int, int>> conditions;\\n\\tmap<char, int> ch_dir;\\n\\tch_dir['N'] = 1;\\n\\tch_dir['E'] = 0;\\n\\tch_dir['S'] = 3;\\n\\tch_dir['W'] = 2;\\n\\n\\tint dist = 0;\\n\\trep(time_end) {\\n\\t\\tint t;\\n\\t\\tcin >> t;\\n\\t\\tdist += t;\\n\\t\\tchar c;\\n\\t\\tcin >> c;\\n\\t\\tassert(ch_dir.count(c));\\n\\t\\tconditions.emplace_back(dist, ch_dir[c]);\\n\\t}\\n\\n\\tauto it = conditions.begin();\\n\\n\\tvector<vector<vi>> ok(len, vvi(len, vi(dir_max, 0)));\\n\\trep(dir, dir_max) ok[x][y][dir] = 1;\\n\\n\\t// debug(can_go);\\n\\n\\trep(dist_now, 1, dist + 1) {\\n\\t\\tvvvi tmp(len, vvi(len, vi(dir_max, 0)));\\n\\n\\t\\trep(i, len) rep(j, len) rep(dir, dir_max) {\\n\\t\\t\\tif(ok[i][j][dir] && can_go[i][j][dir]) {\\n\\t\\t\\t\\ttmp[i + dx[dir]][j + dy[dir]][dir] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfoa(vv, ok) foa(v, vv) foa(c, v) c = 0;\\n\\n\\t\\trep(i, len) rep(j, len) {\\n\\t\\t\\trep(dir, dir_max) if(tmp[i][j][dir]) {\\n\\t\\t\\t\\trep(nxtdir, dir - 1, dir + 2) {\\n\\t\\t\\t\\t\\tif(can_go[i][j][(nxtdir + dir_max) % dir_max]) {\\n\\t\\t\\t\\t\\t\\tok[i][j][(nxtdir + dir_max) % dir_max] = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(dist_now == it->first) {\\n\\t\\t\\trep(i, len) rep(j, len) rep(d, dir_max) {\\n\\t\\t\\t\\tif(d != it->second) ok[i][j][d] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tconst int dir = it->second;\\n\\t\\t\\trep(i, len) rep(j, len) {\\n\\t\\t\\t\\tif(tmp[i][j][dir]) {\\n\\t\\t\\t\\t\\trep(nxtdir, dir - 1, dir + 2) {\\n\\t\\t\\t\\t\\t\\tif(can_go[i][j][(nxtdir + dir_max) % dir_max]) {\\n\\t\\t\\t\\t\\t\\t\\tok[i][j][(nxtdir + dir_max) % dir_max] = 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tit++;\\n\\t\\t}\\n\\n\\t\\trep(i, len) rep(j, len) rep(d, dir_max) {\\n\\t\\t\\tif(ok[i][j][d]) {\\n\\t\\t\\t\\tdebug(dist_now, i, j, d);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tassert(it == conditions.end());\\n\\tdebug(conditions);\\n\\n\\trep(i, len) rep(j, len) {\\n\\t\\tif(*max_element(all(ok[i][j]))) print(i, j);\\n\\t}\\n\\n#ifdef LOCAL\\n\\tprint(\\\"finish!!\\\");\\n#endif\\n\\n\\treturn;\\n}\\n\\nint main() {\\n\\tint n;\\n\\twhile(cin >> n && n) solve(n);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.0348,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1349_6401492\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nclass Move {\\npublic:\\n int x;\\n int y;\\n int last;\\n int next;\\n Move(int x=0,int y=0,int last=-1,int next=-1):x(x),y(y),last(last),next(next){}\\n bool canMove(int nextDir){\\n return (last < 0 or (last - nextDir + 4) % 4 != 2) and\\n (next < 0 or next == nextDir);\\n }\\n Move moved(int nextDir){\\n const int dx[] = {1,0,-1,0};\\n const int dy[] = {0,1,0,-1};\\n return Move(x+dx[nextDir],y+dy[nextDir],nextDir);\\n }\\n Move withNext(int dir){\\n return Move(x,y,last,dir);\\n }\\n pii position()const{\\n return pii(x,y);\\n }\\n};\\n\\nbool operator<(const Move &a, const Move &b){\\n return array<int,4>({a.x,a.y,a.last,a.next}) < array<int,4>({b.x,b.y,b.last,b.next});\\n}\\n \\n\\nset<pii> func(){\\n int n = in();\\n int x0 = in();\\n int y0 = in();\\n int t = in();\\n vvvector<int> oks(51,vvector<int>(51,vector<int>(4,false)));\\n rep(i,n){\\n int x0 = in();\\n int y0 = in();\\n int x1 = in();\\n int y1 = in();\\n if(x0>x1)swap(x0,x1);\\n if(y0>y1)swap(y0,y1);\\n if(y0==y1){\\n rep(x,x0,x1+1){\\n if(x!=x0)oks[x][y0][2] = true;\\n if(x!=x1)oks[x][y0][0] = true;\\n }\\n }else{\\n rep(y,y0,y1+1){\\n if(y!=y0)oks[x0][y][3] = true;\\n if(y!=y1)oks[x0][y][1] = true;\\n }\\n }\\n }\\n method(moved,vector<Move>,Move p){\\n vector<Move> res;\\n rep(i,4){\\n if(not p.canMove(i))continue;\\n if(not oks[p.x][p.y][i])continue;\\n Move mp = p.moved(i);\\n res.emplace_back(mp);\\n }\\n return res;\\n };\\n set<Move> current;\\n {\\n rep(i,4){\\n if(oks[x0][y0][i]){\\n current.emplace(Move(x0,y0).withNext(i));\\n }\\n }\\n }\\n rep(_,t){\\n int T = in();\\n char D = in<char>();\\n int dir;\\n\\n set<Move> ncurrent;\\n set<pair<Move,int>> used;\\n method(movedTimes,void,Move p,int time,int dir){\\n method(rec,void,Move p,int t){\\n if(t==time){\\n if(p.last==dir){\\n ncurrent.emplace(p);\\n }else if(oks[p.x][p.y][dir] and p.canMove(dir)){\\n ncurrent.emplace(p.withNext(dir));\\n }\\n return;\\n }\\n if(used.count(make_pair(p,t)))return;\\n used.emplace(p,t);\\n foreach(np,moved(p)){\\n rec(np,t+1);\\n }\\n };\\n rec(p,0);\\n };\\n switch(D){\\n case 'E':\\n dir = 0;\\n break;\\n case 'N':\\n dir = 1;\\n break;\\n case 'W':\\n dir = 2;\\n break;\\n case 'S':\\n dir = 3;\\n break;\\n }\\n foreach(e,current){\\n movedTimes(e,T,dir);\\n }\\n current = ncurrent;\\n }\\n set<pii> res;\\n foreach(i,current)res.emplace(i.position());\\n return res;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 4344,\n \"score_of_the_acc\": -0.1137,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1349_6364313\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\n#define eps 1e-8L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\ntypedef long double ld;\\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\\n#define ALL(x) (x).begin(), (x).end()\\n\\n#define int long long\\nvoid solve()\\n{\\n int n, x0, y0, t;\\n cin >> n >> x0 >> y0 >> t;\\n set<tuple<int, int, int>> cur;\\n REP(i, 4)\\n {\\n cur.insert({x0 * 2, y0 * 2, i});\\n }\\n set<pair<int, int>> valids;\\n REP(i, n)\\n {\\n int a, b, c, d;\\n cin >> a >> b >> c >> d;\\n a *= 2;\\n b *= 2;\\n c *= 2;\\n d *= 2;\\n for (int i = min(a, c); i <= max(a, c); ++i)\\n {\\n for (int q = min(b, d); q <= max(b, d); ++q)\\n {\\n valids.insert({i, q});\\n }\\n }\\n }\\n REP(i, t)\\n {\\n int moves;\\n string s;\\n cin >> moves >> s;\\n const int dx[4] = {-1, 0, 1, 0};\\n const int dy[4] = {0, -1, 0, 1};\\n REP(_, moves)\\n {\\n set<tuple<int, int, int>> nexts;\\n for (auto x : cur)\\n {\\n REP(t, 4)\\n {\\n if (t == 2)\\n continue;\\n int itr = get<2>(x) + t;\\n itr %= 4;\\n int next_x = get<0>(x) + dx[itr];\\n int next_y = get<1>(x) + dy[itr];\\n if (valids.count({next_x, next_y}))\\n {\\n next_x += dx[itr];\\n next_y += dy[itr];\\n nexts.insert({next_x, next_y, itr});\\n }\\n if (get<2>(x) >= 4)\\n break;\\n }\\n }\\n cur = nexts;\\n }\\n {\\n int expected;\\n if (s == \\\"W\\\")\\n expected = 0;\\n else if (s == \\\"S\\\")\\n expected = 1;\\n else if (s == \\\"E\\\")\\n expected = 2;\\n else\\n expected = 3;\\n set<tuple<int, int, int>> filters;\\n for (auto x : cur)\\n {\\n if (get<2>(x) == expected)\\n filters.insert(x);\\n REP(t, 4)\\n {\\n if (t % 2 == 0)\\n continue;\\n int itr = get<2>(x) + t;\\n itr %= 4;\\n int next_x = get<0>(x) + dx[itr];\\n int next_y = get<1>(x) + dy[itr];\\n if (valids.count({next_x, next_y}))\\n {\\n if (itr == expected)\\n {\\n filters.insert({get<0>(x), get<1>(x), itr + 4});\\n }\\n }\\n }\\n }\\n cur = filters;\\n }\\n }\\n set<pair<int, int>> ans;\\n for (auto x : cur)\\n {\\n ans.insert({get<0>(x), get<1>(x)});\\n }\\n for (auto x : ans)\\n {\\n cout << x.first / 2 << \\\" \\\" << x.second / 2 << endl;\\n }\\n}\\n#undef int\\n\\n// generated by oj-template v4.7.2\\n// (https://github.com/online-judge-tools/template-generator)\\nint main()\\n{\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 1;\\n // cin >> t; // comment out if solving multi testcase\\n for (int testCase = 1; testCase <= t; ++testCase)\\n {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.059,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1349_6039630\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define Inf 1000000001\\n\\nvector ok(51,vector(51,vector<bool>(4,false)));\\nvector<int> dx = {1,0,-1,0},dy = {0,1,0,-1};\\n\\nvector<pair<pair<int,int>,int>> get(int d,int dir,vector<pair<pair<int,int>,int>> xy){\\n\\tvector f(51,vector(51,vector<bool>(4,false)));\\n\\trep(i,xy.size()){\\n\\t\\tf[xy[i].first.first][xy[i].first.second][xy[i].second] = true;\\n\\t}\\n\\tvector<pair<pair<int,int>,int>> ret;\\n\\trep(i,d){\\n\\t\\tvector nf(51,vector(51,vector<bool>(4,false)));\\n\\t\\trep(j,51){\\n\\t\\t\\trep(k,51){\\n\\t\\t\\t\\trep(l,4){\\n\\t\\t\\t\\t\\tif(f[j][k][l]==false)continue;\\n\\t\\t\\t\\t\\tif(ok[j][k][l]==false)continue;\\n\\t\\t\\t\\t\\tint x = j+dx[l],y = k+dy[l];\\n\\t\\t\\t\\t\\t//cout<<i<<','<<x<<','<<y<<endl;\\n\\t\\t\\t\\t\\trep(ll,4){\\n\\t\\t\\t\\t\\t\\tif((l^ll)==2)continue;\\n\\t\\t\\t\\t\\t\\tnf[x][y][ll] = true;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif(i==d-1 && (l==dir || ll==dir)){\\n\\t\\t\\t\\t\\t\\t\\tret.emplace_back(make_pair(x,y),ll);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(f,nf);\\n\\t}\\n\\treturn ret;\\n\\t\\n}\\n\\nint main(){\\n\\t\\n\\tint n,x0,y0,t;\\n\\tcin>>n>>x0>>y0>>t;\\t\\n\\t\\n\\trep(i,n){\\n\\t\\tint xs,ys,xe,ye;\\n\\t\\tcin>>xs>>ys>>xe>>ye;\\n\\t\\tif(xs==xe){\\n\\t\\t\\tif(ys>ye)swap(ys,ye);\\n\\t\\t\\tfor(int j=ys;j<=ye;j++){\\n\\t\\t\\t\\tif(j!=ye){\\n\\t\\t\\t\\t\\tok[xs][j][1] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(j!=ys){\\n\\t\\t\\t\\t\\tok[xs][j][3] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tif(xs>xe)swap(xs,xe);\\n\\t\\t\\tfor(int j=xs;j<=xe;j++){\\n\\t\\t\\t\\tif(j!=xe){\\n\\t\\t\\t\\t\\tok[j][ys][0] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(j!=xs){\\n\\t\\t\\t\\t\\tok[j][ys][2] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvector<int> d(t),dir(t);\\n\\trep(i,t){\\n\\t\\tcin>>d[i];\\n\\t\\tchar c;\\n\\t\\tcin>>c;\\n\\t\\t\\n\\t\\tif(c=='N')dir[i] = 1;\\n\\t\\tif(c=='W')dir[i] = 2;\\n\\t\\tif(c=='S')dir[i] = 3;\\n\\t\\tif(c=='E')dir[i] = 0;\\n\\t}\\n\\t\\n\\t\\n\\tvector<pair<pair<int,int>,int>> xy;\\n\\trep(k,4){\\n\\t\\txy.emplace_back(make_pair(x0,y0),k);\\n\\t}\\n\\trep(k,t){\\n\\t\\txy = get(d[k],dir[k],xy);\\n\\t}\\n\\n\\tvector<pair<int,int>> ans;\\n\\t//cout<<xy.size()<<endl;\\n\\trep(i,xy.size()){\\n\\t\\tif(ok[xy[i].first.first][xy[i].first.second][xy[i].second]){\\n\\t\\t\\tans.push_back(xy[i].first);\\n\\t\\t}\\n\\t}\\n\\tsort(ans.begin(),ans.end());\\n\\tans.erase(unique(ans.begin(),ans.end()),ans.end());\\n\\t//cout<<ans.size()<<endl;\\n\\trep(i,ans.size()){\\n\\t\\tcout<<ans[i].first<<' '<<ans[i].second<<endl;\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4044,\n \"score_of_the_acc\": -0.0403,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1349_5778058\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int MAX_T = 1005, MAX_C = 55;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nbool dp[MAX_T][MAX_C][MAX_C][4];\\nbool adv[MAX_C][MAX_C][4];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, x_0, y_0, t;\\n cin >> n >> x_0 >> y_0 >> t;\\n for (; n--;) {\\n int a, b, c, d;\\n cin >> a >> b >> c >> d;\\n if (a == c) {\\n if (b > d) swap(b, d);\\n for (int i = b; i <= d; i++) {\\n if (i != b) adv[a][i][3] = true;\\n if (i != d) adv[a][i][1] = true;\\n }\\n } else {\\n if (a > c) swap(a, c);\\n for (int i = a; i <= c; i++) {\\n if (i != a) adv[i][b][2] = true;\\n if (i != c) adv[i][b][0] = true;\\n }\\n }\\n }\\n\\n auto ctoi = [](char c) {\\n if (c == 'E') return 0;\\n if (c == 'N') return 1;\\n if (c == 'W') return 2;\\n return 3;\\n };\\n vector<int> way(MAX_T, -1);\\n int sum = 0;\\n for (; t--;) {\\n int d;\\n char c;\\n cin >> d >> c;\\n sum += d;\\n way[sum] = ctoi(c);\\n }\\n for (int l = 0; l < 4; l++) dp[0][x_0][y_0][l] = true;\\n\\n for (int i = 0; i < sum; i++) {\\n for (int j = 0; j < MAX_C; j++) {\\n for (int k = 0; k < MAX_C; k++) {\\n for (int l = 0; l < 4; l++) {\\n if (!dp[i][j][k][l]) continue;\\n for (int nl = 0; nl < 4; nl++) {\\n if (!adv[j][k][nl]) continue; // able to advance\\n if (~way[i] && l != way[i] && nl != way[i]) continue; // correct information\\n if ((l ^ nl) == 2) continue; // prohibit U-turns\\n int nx = j + dx[nl], ny = k + dy[nl];\\n dp[i + 1][nx][ny][nl] = true;\\n }\\n }\\n }\\n }\\n }\\n\\n for (int i = 0; i < MAX_C; i++) {\\n for (int j = 0; j < MAX_C; j++) {\\n bool ok = false;\\n for (int k = 0; k < 4; k++) {\\n if (dp[sum][i][j][k] && (k == way[sum] || ((k ^ way[sum]) != 2 && adv[i][j][way[sum]]))) {\\n ok = true;\\n }\\n }\\n if (ok) cout << i << ' ' << j << '\\\\n';\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 13220,\n \"score_of_the_acc\": -0.2857,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1349_5315479\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n\\treturn (ull)rng() % B;\\n}\\n\\nconst int N=51;\\n\\nbool dp[1001][N][N][4];\\nint ro[N][N][4];\\nbool ch[1001][4];\\n\\n// 0:N 1:E 2:S 3:W\\nint f(char c){\\n\\tif(c=='N')return 0;\\n\\telse if(c=='E')return 1;\\n\\telse if(c=='S')return 2;\\n\\telse return 3;\\n}\\n\\nint main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tint n,sx,sy,t; cin >> n >> sx >> sy >> t;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint x,y,xx,yy; cin >> x >> y >> xx >> yy;\\n\\t\\tif(x==xx){\\n\\t\\t\\tif(y>yy)swap(y,yy);\\n\\t\\t\\tfor(int j=y;j<=yy;j++){\\n\\t\\t\\t\\tif(j>y)ro[x][j][2]=1;\\n\\t\\t\\t\\tif(j<yy)ro[x][j][0]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(y==yy){\\n\\t\\t\\tif(x>xx)swap(x,xx);\\n\\t\\t\\tfor(int j=x;j<=xx;j++){\\n\\t\\t\\t\\tif(j>x)ro[j][y][3]=1;\\n\\t\\t\\t\\tif(j<xx)ro[j][y][1]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<1001;i++){\\n\\t\\tfor(int j=0;j<4;j++){\\n\\t\\t\\tch[i][j]=true;\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<4;i++){\\n\\t\\tdp[0][sx][sy][i]=true;\\n\\t}\\n\\tint sum=0;\\n\\tfor(int i=0;i<t;i++){\\n\\t\\tint d; cin >> d;\\n\\t\\tchar c; cin >> c;\\n\\t\\tsum+=d;\\n\\t\\tfor(int j=0;j<4;j++){\\n\\t\\t\\tch[sum][j]=false;\\n\\t\\t}\\n\\t\\tch[sum][f(c)]=true;\\n\\t}\\n\\tfor(int i=0;i<sum;i++){\\n\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\tfor(int k=0;k<N;k++){\\n\\t\\t\\t\\tfor(int l=0;l<4;l++){\\n\\t\\t\\t\\t\\tif(!dp[i][j][k][l])continue;\\n\\t\\t\\t\\t\\tif(!ro[j][k][l])continue;\\n\\t\\t\\t\\t\\tint x=j,y=k;\\n\\t\\t\\t\\t\\tif(l==0)y++;\\n\\t\\t\\t\\t\\telse if(l==1)x++;\\n\\t\\t\\t\\t\\telse if(l==2)y--;\\n\\t\\t\\t\\t\\telse x--;\\n\\t\\t\\t\\t\\tif(ch[i+1][l]){\\n\\t\\t\\t\\t\\t\\tif(i+1==sum)dp[i+1][x][y][l]=true;\\n\\t\\t\\t\\t\\t\\tfor(int d=-1;d<=1;d++){\\n\\t\\t\\t\\t\\t\\t\\tint nx=(l+d+4)%4;\\n\\t\\t\\t\\t\\t\\t\\tif(!ro[x][y][nx])continue;\\n\\t\\t\\t\\t\\t\\t\\tdp[i+1][x][y][nx]=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tfor(int d=-1;d<=1;d++){\\n\\t\\t\\t\\t\\t\\t\\tint nx=(l+d+4)%4;\\n\\t\\t\\t\\t\\t\\t\\tif(!ro[x][y][nx])continue;\\n\\t\\t\\t\\t\\t\\t\\tif(!ch[i+1][nx])continue;\\n\\t\\t\\t\\t\\t\\t\\tdp[i+1][x][y][nx]=true;\\n\\t\\t\\t\\t\\t\\t\\tif(i+1==sum)dp[i+1][x][y][l]=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<pair<int,int>> res;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\tfor(int k=0;k<4;k++){\\n\\t\\t\\t\\tif(ch[sum][k] and dp[sum][i][j][k]){\\n\\t\\t\\t\\t\\tres.push_back({i,j});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(auto p:res){\\n\\t\\tprintf(\\\"%d %d\\\\n\\\",p.first,p.second);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9320,\n \"score_of_the_acc\": -0.1749,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1349_5249092\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\n\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, -1, 0, 1};\\n\\nbool f[51][51][4];\\n\\nvector<tuple<int, int, int>> cur;\\nvector<tuple<int, int, int>> nxt;\\n\\nbool memo[11][51][51][4];\\n\\nvector<int> d, dir;\\n\\nvoid dfs(int dist, int cx, int cy, int pd, int T) {\\n if (memo[dist][cx][cy][pd]) return;\\n memo[dist][cx][cy][pd] = true;\\n\\n if (dist == d[T]) {\\n if (pd != dir[T] && !f[cx][cy][dir[T]]) return;\\n if (pd != dir[T] && (dir[T] + 2) % 4 == pd) return;\\n nxt.emplace_back(cx, cy, pd);\\n return;\\n }\\n\\n for (int Dir = 0; Dir < 4; Dir++) {\\n if ((pd + 2) % 4 == Dir) continue;\\n if (dist == 0 && T > 0 && dir[T - 1] != pd && dir[T - 1] != Dir) continue;\\n if (!f[cx][cy][Dir]) continue;\\n int nx = cx + dx[Dir], ny = cy + dy[Dir];\\n assert(!(nx < 0 || nx > 50 || ny < 0 || ny > 50));\\n dfs(dist + 1, nx, ny, Dir, T);\\n }\\n}\\n\\nvoid solve() {\\n int N, x0, y0, t;\\n cin >> N >> x0 >> y0 >> t;\\n for (int i = 0; i < N; i++) {\\n int a, b, c, d;\\n cin >> a >> b >> c >> d;\\n if (a == c) {\\n for (int j = min(b, d); j < max(b, d); j++) { f[a][j][3] = true; }\\n for (int j = min(b, d) + 1; j <= max(b, d); j++) { f[a][j][1] = true; }\\n } else {\\n for (int j = min(a, c); j < max(a, c); j++) { f[j][b][0] = true; }\\n for (int j = min(a, c) + 1; j <= max(a, c); j++) { f[j][b][2] = true; }\\n }\\n }\\n\\n for (int i = 0; i < t; i++) {\\n int x;\\n char c;\\n cin >> x >> c;\\n d.push_back(x);\\n for (int j = 0; j < 4; j++)\\n if (\\\"ESWN\\\"[j] == c) dir.push_back(j);\\n }\\n assert(d.size() == t && dir.size() == t);\\n\\n rep(i, 4) { cur.emplace_back(x0, y0, i); }\\n\\n for (int T = 0; T < t; T++) {\\n memset(memo, false, sizeof(memo));\\n for (auto [x, y, direc] : cur) { dfs(0, x, y, direc, T); }\\n swap(cur, nxt);\\n nxt.clear();\\n }\\n\\n vector<P> ans;\\n for (auto [x, y, direc] : cur) ans.emplace_back(x, y);\\n sort(all(ans));\\n ans.erase(unique(all(ans)), ans.end());\\n\\n for (auto [x, y] : ans) cout << x << ' ' << y << endl;\\n\\n return;\\n}\\n\\nint main() {\\n fastio();\\n solve();\\n // int t;\\n // cin >> t;\\n // while (t--) solve();\\n\\n // int t; cin >> t;\\n // for(int i=1;i<=t;i++){\\n // cout << \\\"Case #\\\" << i << \\\": \\\";\\n // solve();\\n // }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.0132,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1349_5180323\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\nconstexpr int X = 51;\\nconstexpr int N = X * X;\\n\\nint enc(int x, int y) { return x * X + y; }\\n\\nvoid solve() {\\n int n, x0, y0, t;\\n cin >> n >> x0 >> y0 >> t;\\n int s = enc(x0, y0);\\n\\n auto graph = vector(N, vector(4, -1));\\n while (n--) {\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n if (sx == gx) {\\n int x = sx;\\n if (sy > gy) swap(sy, gy);\\n\\n for (int y = sy; y < gy; ++y) {\\n graph[enc(x, y)][0] = enc(x, y + 1);\\n graph[enc(x, y + 1)][2] = enc(x, y);\\n }\\n } else {\\n int y = sy;\\n if (sx > gx) swap(sx, gx);\\n\\n for (int x = sx; x < gx; ++x) {\\n graph[enc(x, y)][1] = enc(x + 1, y);\\n graph[enc(x + 1, y)][3] = enc(x, y);\\n }\\n }\\n }\\n\\n vector<int> ds{-1};\\n while (t--) {\\n int d;\\n char c;\\n cin >> d >> c;\\n\\n for (int i = 0; i < d - 1; ++i) {\\n ds.push_back(-1);\\n }\\n\\n int i = 0;\\n while (c != \\\"NESW\\\"[i]) ++i;\\n ds.push_back(i);\\n }\\n\\n t = ds.size() - 1;\\n\\n auto dp = vector(4, vector(N, false));\\n // 直前の移動方向、座標\\n for (int d = 0; d < 4; ++d) dp[d][s] = true;\\n\\n for (int i = 0; i < t; ++i) {\\n int td = ds[i];\\n auto ndp = vector(4, vector(N, false));\\n\\n for (int v = 0; v < N; ++v) {\\n for (int pd = 0; pd < 4; ++pd) {\\n if (!dp[pd][v]) continue;\\n\\n for (int d = 0; d < 4; ++d) {\\n // Uターン\\n if (abs(d - pd) == 2) continue;\\n // 向き指定\\n if (td != -1 && pd != td && d != td) continue;\\n // 道の存在\\n if (graph[v][d] == -1) continue;\\n\\n ndp[d][graph[v][d]] = true;\\n }\\n }\\n }\\n swap(dp, ndp);\\n }\\n\\n int td = ds.back();\\n for (int v = 0; v < N; ++v) {\\n bool ok = false;\\n for (int d = 0; d < 4; ++d) {\\n if (abs(td - d) == 2 || !dp[d][v]) continue;\\n if (d == td || graph[v][td] != -1) ok = true;\\n }\\n if (ok) {\\n cout << v / X << \\\" \\\" << v % X << \\\"\\\\n\\\";\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -0.013,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1349_5175816\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/segtree>\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pl = pair<ll, ll>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\n#define rep(i,n) for (ll i = 0; i < (n); i++)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define se second\\n#define endl '\\\\n'\\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\\nconst int inf = 1<<30;\\nconst ll INF = 1ll<<60;\\nconst ll mod = 1000000007;\\n//const ll mod = 998244353;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\n\\n\\nbool G[1005][1005][4];\\nbool st[1005][1005][4], nx[1005][1005][4], nx2[1005][1005][4];\\nll d[105];\\nchar c[105];\\nll n, xx0, yy0, t, ds = 0;\\n\\nint main() {\\n IOS;\\n cin >> n >> xx0 >> yy0 >> t;\\n rep(i,4) st[xx0+1][yy0+1][i] = true;\\n // グラフをつくる\\n rep(i,n) {\\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\\n x1++; y1++; x2++; y2++;\\n if (x1 == x2) {\\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 1001ll);\\n for (ll y = y1; y < y2; y++) {\\n G[x1][y][1] = true;\\n G[x1][y+1][3] = true;\\n }\\n } else {\\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 1001ll);\\n for (ll x = x1; x < x2; x++) {\\n G[x][y1][0] = true;\\n G[x+1][y1][2] = true;\\n }\\n }\\n }\\n // 情報の入力\\n rep(i,t) {\\n cin >> d[i] >> c[i];\\n ds += d[i];\\n }\\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\\n rep(tim,ds) {\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n if (st[i][j][0]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][1]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n }\\n if (st[i][j][2]) {\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][3]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n /*\\n if (tar != -1) {\\n int cnt = 0;\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n bool ok = 0;\\n rep(k,4) if (nx2[i][j][k]) ok = 1;\\n if (!ok) continue;\\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\\n }\\n */\\n }\\n }\\n rep(i,1001) rep(j,1001) rep(k,4) {\\n st[i+1][j+1][k] = nx[i+1][j+1][k];\\n nx[i+1][j+1][k] = 0;\\n nx2[i+1][j+1][k] = 0;\\n }\\n if (tar != -1) tar = -1;\\n /*\\n rep(k,4) {\\n printf(\\\"time = %lld, k = %lld\\\\n\\\", tim, k);\\n rep(i,10) {\\n rep(j,10) cout << st[i+1][j+1][k] << \\\" \\\"; cout << endl;\\n } \\n }\\n rep(i,10) {\\n rep(j,10) {\\n bool ruth = 0;\\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\\n if (ruth) cout << \\\"1 \\\";\\n else cout << \\\"0 \\\";\\n }\\n cout << endl;\\n } cout << endl;\\n */\\n\\n if (tim+1-ds2 != d[id]) continue;\\n // 情報と矛盾するものを排除する、これが難しい\\n if (c[id] == 'E') tar = 0;\\n if (c[id] == 'N') tar = 1;\\n if (c[id] == 'W') tar = 2;\\n if (c[id] == 'S') tar = 3;\\n ds2 += d[id++];\\n //cout << ds2 << endl;\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n // 今tarを向いてないならfalseにする\\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\\n rep(k,4) {\\n if (k != tar) {\\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\\n st[i][j][k] = 0;\\n }\\n }\\n }\\n }\\n }\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\\n if (ok) cout << i-1 << \\\" \\\" << j-1 << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4630,\n \"memory_kb\": 15200,\n \"score_of_the_acc\": -1.3419,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1349_5175804\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/segtree>\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pl = pair<ll, ll>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\n#define rep(i,n) for (ll i = 0; i < (n); i++)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define se second\\n#define endl '\\\\n'\\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\\nconst int inf = 1<<30;\\nconst ll INF = 1ll<<60;\\nconst ll mod = 1000000007;\\n//const ll mod = 998244353;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\n\\n\\nbool G[55][55][4];\\nbool st[55][55][4], nx[55][55][4], nx2[55][55][4];\\nll d[105];\\nchar c[105];\\nll n, xx0, yy0, t, ds = 0;\\n\\nint main() {\\n //IOS;\\n cin >> n >> xx0 >> yy0 >> t;\\n rep(i,4) st[xx0+1][yy0+1][i] = true;\\n // グラフをつくる\\n rep(i,n) {\\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\\n x1++; y1++; x2++; y2++;\\n if (x1 == x2) {\\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 51ll);\\n for (ll y = y1; y < y2; y++) {\\n G[x1][y][1] = true;\\n G[x1][y+1][3] = true;\\n }\\n } else {\\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 51ll);\\n for (ll x = x1; x < x2; x++) {\\n G[x][y1][0] = true;\\n G[x+1][y1][2] = true;\\n }\\n }\\n }\\n // 情報の入力\\n rep(i,t) {\\n cin >> d[i] >> c[i];\\n ds += d[i];\\n }\\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\\n rep(tim,ds) {\\n for (int i = 1; i <= 51; i++) {\\n for (int j = 1; j <= 51; j++) {\\n if (st[i][j][0]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][1]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n }\\n if (st[i][j][2]) {\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][3]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n /*\\n if (tar != -1) {\\n int cnt = 0;\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n bool ok = 0;\\n rep(k,4) if (nx2[i][j][k]) ok = 1;\\n if (!ok) continue;\\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\\n }\\n */\\n }\\n }\\n rep(i,51) rep(j,51) rep(k,4) {\\n st[i+1][j+1][k] = nx[i+1][j+1][k];\\n nx[i+1][j+1][k] = 0;\\n nx2[i+1][j+1][k] = 0;\\n }\\n if (tar != -1) tar = -1;\\n /*\\n rep(k,4) {\\n printf(\\\"time = %lld, k = %lld\\\\n\\\", tim, k);\\n rep(i,10) {\\n rep(j,10) cout << st[i+1][j+1][k] << \\\" \\\"; cout << endl;\\n } \\n }\\n rep(i,10) {\\n rep(j,10) {\\n bool ruth = 0;\\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\\n if (ruth) cout << \\\"1 \\\";\\n else cout << \\\"0 \\\";\\n }\\n cout << endl;\\n } cout << endl;\\n */\\n\\n if (tim+1-ds2 != d[id]) continue;\\n // 情報と矛盾するものを排除する、これが難しい\\n if (c[id] == 'E') tar = 0;\\n if (c[id] == 'N') tar = 1;\\n if (c[id] == 'W') tar = 2;\\n if (c[id] == 'S') tar = 3;\\n ds2 += d[id++];\\n //cout << ds2 << endl;\\n for (int i = 1; i <= 51; i++) {\\n for (int j = 1; j <= 51; j++) {\\n // 今tarを向いてないならfalseにする\\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\\n rep(k,4) {\\n if (k != tar) {\\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\\n st[i][j][k] = 0;\\n }\\n }\\n }\\n }\\n }\\n for (int i = 1; i <= 51; i++) {\\n for (int j = 1; j <= 51; j++) {\\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\\n if (ok) cout << i-1 << \\\" \\\" << j-1 << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1349_5175794\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/segtree>\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing pl = pair<ll, ll>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\n#define rep(i,n) for (ll i = 0; i < (n); i++)\\n#define all(v) (v).begin(), (v).end()\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define se second\\n#define endl '\\\\n'\\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\\nconst int inf = 1<<30;\\nconst ll INF = 1ll<<60;\\nconst ll mod = 1000000007;\\n//const ll mod = 998244353;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\n\\n\\nbool G[1005][1005][4];\\nbool st[1005][1005][4], nx[1005][1005][4], nx2[1005][1005][4];\\nll d[105];\\nchar c[105];\\nll n, xx0, yy0, t, ds = 0;\\n\\nint main() {\\n //IOS;\\n cin >> n >> xx0 >> yy0 >> t;\\n rep(i,4) st[xx0+1][yy0+1][i] = true;\\n // グラフをつくる\\n rep(i,n) {\\n ll x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;\\n x1++; y1++; x2++; y2++;\\n if (x1 == x2) {\\n if (y1 > y2) swap(y1, y2); y2 = min(y2, 1001ll);\\n for (ll y = y1; y < y2; y++) {\\n G[x1][y][1] = true;\\n G[x1][y+1][3] = true;\\n }\\n } else {\\n if (x1 > x2) swap(x1, x2); x2 = min(x2, 1001ll);\\n for (ll x = x1; x < x2; x++) {\\n G[x][y1][0] = true;\\n G[x+1][y1][2] = true;\\n }\\n }\\n }\\n // 情報の入力\\n rep(i,t) {\\n cin >> d[i] >> c[i];\\n ds += d[i];\\n }\\n ll id = 0, ds2 = 0, tar = -1; // 今いくつめの情報を処理しているか\\n rep(tim,ds) {\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n if (st[i][j][0]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][1]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n }\\n if (st[i][j][2]) {\\n if (G[i][j][1]) nx[i][j+1][1] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (st[i][j][3]) {\\n if (G[i][j][0]) nx[i+1][j][0] = 1;\\n if (G[i][j][2]) nx[i-1][j][2] = 1;\\n if (G[i][j][3]) nx[i][j-1][3] = 1;\\n }\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n /*\\n if (tar != -1) {\\n int cnt = 0;\\n if (nx2[i][j][0]) nx[i+1][j][0] = 1;\\n if (nx2[i][j][1]) nx[i][j+1][1] = 1;\\n if (nx2[i][j][2]) nx[i-1][j][2] = 1;\\n if (nx2[i][j][3]) nx[i][j-1][3] = 1;\\n bool ok = 0;\\n rep(k,4) if (nx2[i][j][k]) ok = 1;\\n if (!ok) continue;\\n if (tar == 0 && nx2[i][j][tar]) nx[i+1][j][0] = 1;\\n if (tar == 1 && nx2[i][j][tar]) nx[i][j+1][1] = 1;\\n if (tar == 2 && nx2[i][j][tar]) nx[i-1][j][2] = 1;\\n if (tar == 3 && nx2[i][j][tar]) nx[i][j-1][3] = 1;\\n }\\n */\\n }\\n }\\n rep(i,1001) rep(j,1001) rep(k,4) {\\n st[i+1][j+1][k] = nx[i+1][j+1][k];\\n nx[i+1][j+1][k] = 0;\\n nx2[i+1][j+1][k] = 0;\\n }\\n if (tar != -1) tar = -1;\\n /*\\n rep(k,4) {\\n printf(\\\"time = %lld, k = %lld\\\\n\\\", tim, k);\\n rep(i,10) {\\n rep(j,10) cout << st[i+1][j+1][k] << \\\" \\\"; cout << endl;\\n } \\n }\\n rep(i,10) {\\n rep(j,10) {\\n bool ruth = 0;\\n rep(k,4) if (st[i+1][j+1][k] || nx2[i+1][j+1][k]) ruth = 1;\\n if (ruth) cout << \\\"1 \\\";\\n else cout << \\\"0 \\\";\\n }\\n cout << endl;\\n } cout << endl;\\n */\\n\\n if (tim+1-ds2 != d[id]) continue;\\n // 情報と矛盾するものを排除する、これが難しい\\n if (c[id] == 'E') tar = 0;\\n if (c[id] == 'N') tar = 1;\\n if (c[id] == 'W') tar = 2;\\n if (c[id] == 'S') tar = 3;\\n ds2 += d[id++];\\n //cout << ds2 << endl;\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n // 今tarを向いてないならfalseにする\\n // 次の移動の始めにtarを向けるやつはnx2に避難させる\\n rep(k,4) {\\n if (k != tar) {\\n if ((k+2)%4 != tar && G[i][j][tar] && st[i][j][k]) nx2[i][j][tar] = 1;\\n st[i][j][k] = 0;\\n }\\n }\\n }\\n }\\n }\\n for (int i = 1; i <= 1001; i++) {\\n for (int j = 1; j <= 1001; j++) {\\n bool ok = 0; rep(k,4) if (st[i][j][k] || nx2[i][j][k]) ok = 1;\\n if (ok) cout << i-1 << \\\" \\\" << j-1 << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4440,\n \"memory_kb\": 15112,\n \"score_of_the_acc\": -1.2983,\n \"final_rank\": 18\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":7,"numItemsPerPage":100,"numTotalItems":2103,"offset":700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQ1NjI2OSwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5NDU5ODY5LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.yaEUx_01g81gHEn4RsWAgV7UuwYmySHnlH3C0bMz0b00ez9-DjqI5eyxqI4q961b3clUy5215a0nEOu6h5AbCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
group_id stringlengths 12 18 | problem_description stringlengths 85 3.02k | candidates listlengths 3 20 |
|---|---|---|
aoj_1231_cpp | Problem H:
Super Star
During a voyage of the starship Hakodate-maru (see Problem A), researchers found strange synchronized movements of stars. Having heard these observations, Dr. Extreme proposed a theory of "super stars". Do not take this term as a description of actors or singers. It is a revolutionary theory in as... | [
{
"submission_id": "aoj_1231_10848858",
"code_snippet": "//\n// main.cpp\n// poj 2069 Problem B : Super Star\n//\n// Created by nuu_tong on 2018/4/20.\n// Copyright © 2018年 apple. All rights reserved.\n//\n\n#include <iostream>\n#include <cmath>\n#include <cstdio>\nusing namespace std;\nstruct Point\n{\... |
aoj_1246_cpp | Problem G:
Concert Hall Scheduling
You are appointed director of a famous concert hall, to save it from bankruptcy. The hall is very
popular, and receives many requests to use its two fine rooms, but unfortunately the previous
director was not very efficient, and it has been losing money for many years. The two rooms a... | [
{
"submission_id": "aoj_1246_9706976",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)... |
aoj_1242_cpp | Problem C:
Area of Polygons
Yoko’s math homework today was to calculate areas of polygons in the
xy
-plane. Vertices are
all aligned to grid points (i.e. they have integer coordinates).
Your job is to help Yoko, not good either at math or at computer programming, get her home-
work done. A polygon is given by listing t... | [
{
"submission_id": "aoj_1242_10851351",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<cmath>\nusing namespace std;\nconst double eps=1e-8;\nstruct Point{double x,y;}p[1005];\nstruct seg{Point A,B;}s[1005];\nstruct SEG{int x,y;SEG(int _x=0,int _y=0){x=_x;y=_y;}}t[1005];... |
aoj_1250_cpp | Problem C:
Leaky Cryptography
The ACM ICPC judges are very careful about not leaking their problems, and all communications are encrypted. However, one does sometimes make mistakes, like using too weak an
encryption scheme. Here is an example of that.
The encryption chosen was very simple: encrypt each chunk of the inp... | [
{
"submission_id": "aoj_1250_4304282",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing ull = unsigned long long int;\nusing P = pair<ll, ll>;\n\nll decode(string s){\n ll res = 0;\n for(auto c : s){\n res <<= 4;\n if(isdigit(c)){\n ... |
aoj_1245_cpp | Problem F:
Gap
Let’s play a card game called Gap.
You have 28 cards labeled with two-digit numbers. The first digit (from 1 to 4) represents the
suit of the card, and the second digit (from 1 to 7) represents the value of the card.
First, you shuffle the cards and lay them face up on the table in four rows of seven car... | [
{
"submission_id": "aoj_1245_10853948",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <climits>\n#include <queue>\n#include <unordered_set>\n \nusing namespace std;\n \nclass State\n{\npublic:\n /**\n * 表格数字\n */\n int table[4][8];\n /**\n * 移动回数\n */\n int t... |
aoj_1248_cpp | Problem A:
The Balance
Ms. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine.
For example, to measure 200mg of aspirin using 300mg weights and 700mg weights, she can put
one 700mg weight on the side of the medicine and three 300mg weights on the opposite side
(Figure 1). Alth... | [
{
"submission_id": "aoj_1248_10852694",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nll EX_GCD(ll a, ll b, ll& x, ll& y) {\n\tll d = a;\n\tif (b != 0) {\n\t\td = EX_GCD(b, a % b, y, x);\n\t\ty -= (a / b) * x;\n\t}\n\telse {\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn ... |
aoj_1249_cpp | Problem B:
Make a Sequence
Your company’s next product will be a new game, which is a three-dimensional variant of the
classic game “Tic-Tac-Toe”. Two players place balls in a three-dimensional space (board), and
try to make a sequence of a certain length.
People believe that it is fun to play the game, but they still ... | [
{
"submission_id": "aoj_1249_10896082",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1253_cpp | Problem F:
Dice Puzzle
Let’s try a dice puzzle. The rules of this puzzle are as follows.
Dice with six faces as shown in Figure 1 are used in the puzzle.
Figure 1: Faces of a die
With twenty seven such dice, a 3 × 3 × 3 cube is built as shown in Figure 2.
Figure 2: 3 × 3 × 3 cube
When building up a cube made of dice, t... | [
{
"submission_id": "aoj_1253_10946393",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nenum POS {\n TOP = 1,\n FRONT,\n RIGHT,\n LEFT,\n BACK,\n BOTTOM\n};\n\n// dice[top][front][pos];\nint dice[7][7][7];\n\nvoid init() {\n int right[7][7] = {};\n right[1][2] = 3;... |
aoj_1254_cpp | Problem G:
Color the Map
You were lucky enough to get a map just before entering the legendary magical mystery world.
The map shows the whole area of your planned exploration, including several countries with
complicated borders. The map is clearly drawn, but in sepia ink only; it is hard to recognize at
a glance which... | [
{
"submission_id": "aoj_1254_10852648",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nconst double eps=1e-5;\nstruct Point\n{ int x,y;\n Point(){}\n Point(int _,int __){x=_;y=__;}\n};\nbool operator == (const Point &x,const Point &y)... |
aoj_1255_cpp | Problem H:
Inherit the Spheres
In the year 2xxx, an expedition team landing on a planet found strange objects made by an
ancient species living on that planet. They are transparent boxes containing opaque solid spheres
(Figure 1). There are also many lithographs which seem to contain positions and radiuses of
spheres.
... | [
{
"submission_id": "aoj_1255_6790069",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)\n#define all(x) begin(x), end(x)\ntemplate <type... |
aoj_1259_cpp | Problem C:
Colored Cubes
There are several colored cubes. All of them are of the same size but they may be colored
differently. Each face of these cubes has a single color. Colors of distinct faces of a cube may or
may not be the same.
Two cubes are said to be
identically
colored if some suitable rotations of one of th... | [
{
"submission_id": "aoj_1259_9220763",
"code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#... |
aoj_1258_cpp | Problem B:
Book Replacement
The deadline of Prof. Hachioji’s assignment is tomorrow. To complete the task, students have
to copy pages of many reference books in the library.
All the reference books are in a storeroom and only the librarian is allowed to enter it. To obtain
a copy of a reference book’s page, a student ... | [
{
"submission_id": "aoj_1258_4181658",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <tuple>\n#include <cmath... |
aoj_1252_cpp | Problem E:
Confusing Login Names
Meikyokan University is very famous for its research and education in the area of computer
science. This university has a computer center that has advanced and secure computing facilities
including supercomputers and many personal computers connected to the Internet.
One of the policies... | [
{
"submission_id": "aoj_1252_10850969",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<strin... |
aoj_1260_cpp | Problem D:
Organize Your Train
In the good old Hachioji railroad station located in the west of Tokyo, there are several parking
lines, and lots of freight trains come and go every day.
All freight trains travel at night, so these trains containing various types of cars are settled in
your parking lines early in the mo... | [
{
"submission_id": "aoj_1260_10851287",
"code_snippet": "#include <cmath>\n#include <ctime>\n#include <cstdio>\n#include <cctype>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <string>\n#in... |
aoj_1261_cpp | Problem E:
Mobile Computing
There is a mysterious planet called Yaen, whose space is 2-dimensional. There are many beautiful
stones on the planet, and the Yaen people love to collect them. They bring the stones back home
and make nice mobile arts of them to decorate their 2-dimensional living rooms.
In their 2-dimensio... | [
{
"submission_id": "aoj_1261_4673799",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <iostream>\n#include <cmath>\n#include <vector>\nusing namespace std;\n\nconst int N = 7, M = 1 << N;\nint tr[M]; //-1: root, 0: no use, else:left value\nint value[M];\nint ... |
aoj_1257_cpp | Problem A:
Sum of Consecutive Prime Numbers
Some positive integers can be represented by a sum of one or more consecutive prime numbers.
How many such representations does a given positive integer have? For example, the integer 53
has two representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three representat... | [
{
"submission_id": "aoj_1257_10734986",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nset<int>primes;\nint main(){\n int n;\n while(true){\n cin>>n;\n primes.clear();\n if(n==0)\n break;\n for(int i=2;i<=n;++i)\n primes.insert(i);\n ... |
aoj_1263_cpp | Problem G:
Network Mess
Gilbert is the network admin of Ginkgo company. His boss is mad about the messy network
cables on the floor. He finally walked up to Gilbert and asked the lazy network admin to illustrate
how computers and switches are connected. Since he is a programmer, he is very reluctant to
move throughout ... | [
{
"submission_id": "aoj_1263_1352467",
"code_snippet": "#include<bits/stdc++.h>\n\n#define REP(i,s,n) for(int i=s;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\nusing namespace std;\n\nconst int MAX_V = 50 * 30;\nconst int IINF = INT_MAX;\n\nstruct Edge { int src,dst; };\nvector<Edge> G[MAX_V];\nvector<int> comp... |
aoj_1262_cpp | Problem F:
Atomic Car Race
In the year 2020, a race of atomically energized cars will be held. Unlike today’s car races, fueling
is not a concern of racing teams. Cars can run throughout the course without any refueling.
Instead, the critical factor is tire (tyre). Teams should carefully plan where to change tires of
t... | [
{
"submission_id": "aoj_1262_3167974",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while ( cin >> n, n ) {\n vector<int> a(n+1);\n vector<double> d(10001, 100000000.0);\n d[0] = 0;\n vector<int> is(10001, 0);\n a[0] = 0;\n for ( int i = 1; i... |
aoj_1265_cpp | Problem I:
Shy Polygons
You are given two solid polygons and their positions on the
xy
-plane. You can move one
of the two along the
x
-axis (they can overlap during the move). You cannot move it in other
directions. The goal is to place them as compactly as possible, subject to the following condition:
the distance be... | [
{
"submission_id": "aoj_1265_10848496",
"code_snippet": "/*\n * Created By phyxnj@uestc\n * Last Compiler:\n * Sun, 29 Jul 2012 02:07:44 +0800\n */\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <algorithm>\n#include <cstdlib>\n#include <cmath>\n#include <set>\n#include <vector>\n#... |
aoj_1267_cpp | Problem B:
How I Mathematician Wonder What You Are!
After counting so many stars in the sky in his childhood, Isaac, now an astronomer and a
mathematician, uses a big astronomical telescope and lets his image processing program count
stars. The hardest part of the program is to judge if a shining object in the sky is r... | [
{
"submission_id": "aoj_1267_3894056",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n... |
aoj_1269_cpp | Problem D:
Sum of Different Primes
A positive integer may be expressed as a sum of different prime numbers (primes), in one way or
another. Given two positive integers
n
and
k
, you should count the number of ways to express
n
as a sum of
k
different primes. Here, two ways are considered to be the same if they sum up
t... | [
{
"submission_id": "aoj_1269_11031582",
"code_snippet": "//____ ____.__ __ _________ .__ .__ ________\n//\\ \\ / /|__| _____/ |_ ___________ \\_ ___ \\| |__ _____ _________ |__| / _____/_____ ____ ____\n// \\ Y / | |/ ___\\ __... |
aoj_1266_cpp | Problem A:
How I Wonder What You Are!
One of the questions children often ask is "How many stars are there in the sky?" Under ideal conditions, even with the naked eye, nearly eight thousands are observable in the northern hemisphere. With a decent telescope, you may find many more, but, as the sight field will be
limi... | [
{
"submission_id": "aoj_1266_4858020",
"code_snippet": "#include <iostream> \n#include<vector>\n#include<algorithm>\n#include<map>\n#include<string>\n#include<iomanip>\n#include<set>\n#include<queue>\n#include<deque>\n#include<sstream>\n#include<cmath>\n#include<bitset>\nusing namespace std;\n#define rep(i,... |
aoj_1268_cpp | Problem C:
Cubic Eight-Puzzle
Let's play a puzzle using eight cubes placed on a 3 × 3 board leaving one empty square.
Faces of cubes are painted with three colors. As a puzzle step, you can roll one of the cubes to
the adjacent empty square. Your goal is to make the specified color pattern visible from above
by a numbe... | [
{
"submission_id": "aoj_1268_10852687",
"code_snippet": "#include<cmath>\n#include<cstdio>\n#include<cstring>\n#include<iostream>\nusing namespace std;\nconst int n=3;\nconst int dx[]={-1,1,0,0},dy[]={0,0,-1,1};\nint fx,fy,t[4][4],ans;\nstruct node{\n\tint x,y;\n\tnode(int x=0,int y=0):x(x),y(y){}\n}a[4][4]... |
aoj_1273_cpp | Problem H:
The Best Name for Your Baby
In the year 29XX, the government of a small country somewhere on the earth introduced a law restricting first names of the people only to traditional names in their culture, in order to preserve their cultural uniqueness. The linguists of the country specifies a set of rules once ... | [
{
"submission_id": "aoj_1273_10851276",
"code_snippet": "#include <cctype>\n#include <cstddef>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\nint n, l, tot, to[501];\nstd::string s[51], f[21][501];\... |
aoj_1264_cpp | Problem H:
Bingo
A Bingo game is played by one gamemaster and several players. At the beginning of a game,
each player is given a card with
M
×
M
numbers in a matrix (See Figure 10).
As the game proceeds, the gamemaster announces a series of numbers one by one. Each player
punches a hole in his card on the announced nu... | [
{
"submission_id": "aoj_1264_10853849",
"code_snippet": "#include <iostream>\n#include <string.h>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <map>\nusing namespace std;\n\nconst int maxn = 7, maxv = 107, maxt = 10007, maxnum = 100000000;\n int n, m, res, total;\n int has... |
aoj_1272_cpp | Problem G:
Polygons on the Grid
The ultimate Tantra is said to have been kept in the most distinguished temple deep in the
sacred forest somewhere in Japan. Paleographers finally identified its location, surprisingly a
small temple in Hiyoshi, after years of eager research. The temple has an underground secret
room bui... | [
{
"submission_id": "aoj_1272_9593544",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Point {\n int x, y;\n int cross(const Point p) const { return x * p.y - y * p.x; }\n Point operator-(const Point p) const { return {x - p.x, y - p.y}; }\n int operator*(const Point p) const {... |
aoj_1275_cpp | Problem A:
And Then There Was One
Let’s play a stone removing game.
Initially,
n
stones are arranged on a circle and numbered 1, ... ,
n
clockwise (Figure 1). You are also given two numbers
k
and
m
. From this state, remove stones one by one following the rules explained below, until only one remains. In step 1, remove... | [
{
"submission_id": "aoj_1275_10895099",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1270_cpp | Problem E:
Manhattan Wiring
There is a rectangular area containing
n
×
m
cells. Two cells are marked with "2", and another two with "3". Some cells are occupied by obstacles. You should connect the two "2"s and also the two "3"s with non-intersecting lines. Lines can run only vertically or horizontally connecting
cente... | [
{
"submission_id": "aoj_1270_10865943",
"code_snippet": "#include <bits/stdc++.h>\ntypedef unsigned int T;\nT n, m;\nT ns[10][10];\nbool vis[10][10][70000];\nT ans[10][10][70000];\nT san[] = {\n\t1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, 59049\n};\n\nT f(T x, T y, T S) {\n\tif (x >= n) {\n\t\tif (S) ret... |
aoj_1277_cpp | Problem C:
Minimal Backgammon
Here is a very simple variation of the game backgammon, named “Minimal Backgammon”. The game is played by only one player, using only one of the dice and only one checker (the token used by the player).
The game board is a line of (
N
+ 1) squares labeled as 0 (the start) to
N
(the goal). ... | [
{
"submission_id": "aoj_1277_3231955",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, T, L, B;\n cout << fixed << setprecision(6);\n while (cin >> N >> T >> L >> B, N) {\n map<int, bool> Lose;\n for (int i = 0; i < L; i++) {\n int l;\n cin >> l;\n... |
aoj_1271_cpp | Problem F:
Power Calculus
Starting with
x
and repeatedly multiplying by
x
, we can compute
x
31
with thirty multiplications:
x
2
=
x
×
x
,
x
3
=
x
2
×
x
,
x
4
=
x
3
×
x
, ... ,
x
31
=
x
30
×
x
.
The operation of squaring can appreciably shorten the sequence of multiplications. The following is a way to compute x
31
wit... | [
{
"submission_id": "aoj_1271_10852802",
"code_snippet": "/*\n *Author: Zhaofa Fang\n *Created time: 2013-09-09-16.49 星期一\n */\n#include <cstdio>\n#include <cstdlib>\n#include <sstream>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <string>\n#include <utilit... |
aoj_1276_cpp | Problem B:
Prime Gap
The sequence of
n
- 1 consecutive composite numbers (positive integers that are not prime and
not equal to 1) lying between two successive prime numbers
p
and
p
+
n
is called a
prime
gap of length
n
. For example, (24, 25, 26, 27, 28) between 23 and 29 is a prime gap of length 6.
Your mission is to... | [
{
"submission_id": "aoj_1276_10803560",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define int long long\n#define endl '\\n'\n#define print(v) for(auto& x:v)cout<<x<<' ';cout<<endl\n\nconst int N = 2e6;\nint minp[N];\nbitset<N> vi... |
aoj_1279_cpp | Problem E:
Geometric Map
Your task in this problem is to create a program that finds the shortest path between two given
locations on a given street map, which is represented as a collection of line segments on a plane.
Figure 4 is an example of a street map, where some line segments represent streets and the
others ar... | [
{
"submission_id": "aoj_1279_4161973",
"code_snippet": "#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset... |
aoj_1280_cpp | Problem F:
Slim Span
Given an undirected weighted graph
G
, you should find one of spanning trees specified as follows.
The graph
G
is an ordered pair (
V
,
E
), where
V
is a set of vertices {
v
1
,
v
2
, ... ,
v
n
} and
E
is a set of undirected edges {
e
1
,
e
2
, ... ,
e
m
}. Each edge
e
∈
E
has its weight
w
(
e
).
A... | [
{
"submission_id": "aoj_1280_11066219",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <tuple>\n#include <algorithm>\nusing namespace std;\n\nclass unionfind{\npublic:\n unionfind(int n): n_(n), m_(n) {\n parent_.resize(n);\n size_.resize(n);\n for(int i=0; i<n; i+... |
aoj_1282_cpp | Problem H:
Bug Hunt
In this problem, we consider a simple programming language that has only declarations of one-
dimensional integer arrays and assignment statements. The problem is to find a bug in the given
program.
The syntax of this language is given in BNF as follows:
where
<
new line
>
denotes a new line charact... | [
{
"submission_id": "aoj_1282_10680131",
"code_snippet": "#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\n\n\nstruct custom_hash {\nstatic uint64_t splitmix64(u... |
aoj_1278_cpp | Problem D:
Lowest Pyramid
You are constructing a triangular pyramid with a sheet of craft paper with grid lines. Its base
and sides are all of triangular shape. You draw the base triangle and the three sides connected
to the base on the paper, cut along the outer six edges, fold the edges of the base, and assemble
them... | [
{
"submission_id": "aoj_1278_10067849",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,s,t) for(int i=s;i<t;i++)\n\nll sqrtz(ll x){\n if(x<0)return -201;\n ll z=sqrt(x)+2;\n while(z*z>x){\n z--;\n... |
aoj_1283_cpp | Problem I:
Most Distant Point from the Sea
The main land of Japan called Honshu is an island surrounded by the sea. In such an island, it
is natural to ask a question: "Where is the most distant point from the sea?" The answer to
this question for Honshu was found in 1996. The most distant point is located in former Us... | [
{
"submission_id": "aoj_1283_8998626",
"code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing... |
aoj_1281_cpp | Problem G:
The Morning after Halloween
You are working for an amusement park as an operator of an
obakeyashiki
, or a haunted house,
in which guests walk through narrow and dark corridors. The house is proud of their lively
ghosts, which are actually robots remotely controlled by the operator, hiding here and there in
... | [
{
"submission_id": "aoj_1281_10851166",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<cctype>\n#include<queue>\nusing namespace std;\n\nconst int maxs = 20;\nconst int maxn = 150;\nconst int dx[]= {1,-1,0,0,0};\nconst int dy[]= {0,0,1,-1,0};\n\ninline int ID(int a, int b, int c)\n{\n ret... |
aoj_1287_cpp | Problem C:
Stopped Watches
In the middle of Tyrrhenian Sea, there is a small volcanic island called Chronus. The island
is now uninhabited but it used to be a civilized island. Some historical records imply that the
island was annihilated by an eruption of a volcano about 800 years ago and that most of the
people in th... | [
{
"submission_id": "aoj_1287_9666489",
"code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing... |
aoj_1286_cpp | Problem B:
Expected Allowance
Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money.
In the first day of every month, the number of bills is decided as follows. Ujisato prepares
n
pieces of
m
-sided dice and declares the cutback
k
. Hideyuki rolls these dice. The number of
bills... | [
{
"submission_id": "aoj_1286_10895025",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1292_cpp | Problem H:
Top Spinning
Spinning tops are one of the most popular and the most traditional toys. Not only spinning
them, but also making one’s own is a popular enjoyment.
One of the easiest way to make a top is to cut out a certain shape from a cardboard and pierce
an axis stick through its center of mass. Professional... | [
{
"submission_id": "aoj_1292_4783909",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define LOOP 50000\n... |
aoj_1284_cpp | Problem J:
The Teacher’s Side of Math
One of the tasks students routinely carry out in their mathematics classes is to solve a polynomial equation. It is, given a polynomial, say
X
2
- 4
X
+ 1, to find its roots (2 ± √3).
If the students’ task is to find the roots of a given polynomial, the teacher’s task is then to fi... | [
{
"submission_id": "aoj_1284_10851232",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cctype>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <map>\n#include <iomanip>\n#include <cassert>\n\nusing namespace std... |
aoj_1295_cpp | Problem A:
Cubist Artwork
International Center for Picassonian Cubism
is a Spanish national museum of cubist artworks,
dedicated to Pablo Picasso. The center held a competition for an artwork that will be displayed
in front of the facade of the museum building. The artwork is a collection of cubes that are
piled up on ... | [
{
"submission_id": "aoj_1295_5841742",
"code_snippet": "#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n ... |
aoj_1289_cpp | Problem E:
Spherical Mirrors
A long time ago in a galaxy, far, far away, there were N spheres with various radii.
Spheres were mirrors, that is, they had reflective surfaces . . . .
You are standing at the origin of the galaxy (0, 0, 0), and emit a laser ray to the direction
(
u
,
v
,
w
). The ray travels in a straight... | [
{
"submission_id": "aoj_1289_7221053",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nstruct Point3D {\n\tdouble px, py, pz;\n};\n\nPoint3D operator+(const Point3D &a1, const Point3D &a2) {\n\treturn Point3D{ a1.px + a2.px, a1.py + a2.py, a1.pz + a2.pz };\n}\n\nPoint3D opera... |
aoj_1288_cpp | Problem D:
Digits on the Floor
Taro attempts to tell digits to Hanako by putting straight bars on the floor. Taro wants to
express each digit by making one of the forms shown in Figure 1.
Since Taro may not have bars of desired lengths, Taro cannot always make forms exactly as
shown in Figure 1. Fortunately, Hanako can... | [
{
"submission_id": "aoj_1288_10946400",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\nint n, xa[10010], xb[10010], ya[10010], yb[10010], v[1010][1010], xx1, xx2, q1[10010];\nint q[10010], qq[10010], r, ll, rr, in[10010], v1[10010], ans[100], c1, c2, c3;\ns... |
aoj_1291_cpp | Problem G:
Search of Concatenated Strings
The amount of information on the World Wide Web is growing quite rapidly. In this information
explosion age, we must survive by accessing only the Web pages containing information relevant
to our own needs. One of the key technologies for this purpose is keyword search. By usin... | [
{
"submission_id": "aoj_1291_10851194",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n\nconst int N=12;\nint i,j,n,m;\nchar s[6000],ss[6000];\nchar c[20][50];\nbool f[5500][1<<N];\nint len,ll,l[N+3];\nbool b[5030][N+1];\n\nvoid check(int... |
aoj_1290_cpp | Problem F:
Traveling Cube
On a small planet named Bandai, a landing party of the starship Tadamigawa discovered colorful
cubes traveling on flat areas of the planet surface, which the landing party named beds. A cube
appears at a certain position on a bed, travels on the bed for a while, and then disappears. After
a lo... | [
{
"submission_id": "aoj_1290_10946409",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <queue>\n#include <algorithm>\n\nusing namespace std;\n\n#define K\t0\t// Black\n#define W\t128\t// White\n#define R\t1\t// Red\n#define G\t2\t// Green\n#define B\t3\t// Blue\n#define... |
aoj_1300_cpp | Problem F:
Chemist's Math
You have probably learnt chemical equations (chemical reaction formulae) in your high-school
days. The following are some well-known equations.
2H
2
+ O
2
→ 2H
2
O (1)
C
a
(OH)
2
+ CO
2
→ C
a
CO
3
+ H
2
O ... | [
{
"submission_id": "aoj_1300_1055603",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <map>\n#include <cctype>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i... |
aoj_1294_cpp | Problem J:
Zigzag
Given several points on a plane, let’s try to solve a puzzle connecting them with a zigzag line.
The puzzle is to find the zigzag line that passes through all the given points with the minimum
number of turns. Moreover, when there are several zigzag lines with the minimum number of
turns, the shortest... | [
{
"submission_id": "aoj_1294_10853309",
"code_snippet": "#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<algorithm>\n#include<cstring>\n#include<cmath>\n#include<ctime>\n#include<map>\n#include<string>\n#include<vector>\n#include<set>\n\nusing namespace std;\n#define For(i,l,r) for (int i ... |
aoj_1299_cpp | Problem E:
Origami Through-Hole
Origami is the traditional Japanese art of paper folding. One day, Professor Egami found the
message board decorated with some pieces of origami works pinned on it, and became interested
in the pinholes on the origami paper. Your mission is to simulate paper folding and pin punching
on t... | [
{
"submission_id": "aoj_1299_3228821",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <array>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e12;\n#define EQ(n,m) (abs(... |
aoj_1296_cpp | Problem B:
Repeated Substitution with Sed
Do you know "sed," a tool provided with Unix? Its most popular use is to substitute every
occurrence of a string
contained in the input string (actually each input line) with another
string
β
. More precisely, it proceeds as follows.
Within the input string, every non-overlappi... | [
{
"submission_id": "aoj_1296_9003254",
"code_snippet": "// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\... |
aoj_1297_cpp | Problem C:
Swimming Jam
Despite urging requests of the townspeople, the municipal office cannot afford to improve many
of the apparently deficient city amenities under this recession. The city swimming pool is one
of the typical examples. It has only two swimming lanes. The Municipal Fitness Agency, under
this circumst... | [
{
"submission_id": "aoj_1297_10853354",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint n, tot, tot2, ans, lamp [100], lamp2 [100], Time [100], t [100];\n\nstruct data\n{\n\tint Time, lamp;\n} a [100];\n\nbool cmpp (int x, int ... |
aoj_1303_cpp | Problem I:
Hobby on Rails
ICPC (International Connecting Points Company) starts to sell a new railway toy. It consists
of a toy tramcar and many rail units on square frames of the same size. There are four types
of rail units, namely, straight (S), curve (C), left-switch (L) and right-switch (R) as shown in
Figure 9. A... | [
{
"submission_id": "aoj_1303_4937474",
"code_snippet": "#include<iostream>\n#include<cassert>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\n\n#define N 0\n#define E 1\n#define S 2\n#define W 3\n\nint dx[]={0,1,0,-1};\nint dy[]={-1,0,1,0};\nint curdir[]={S,W,N... |
aoj_1298_cpp | Problem D:
Separate Points
Numbers of black and white points are placed on a plane. Let's imagine that a straight line
of infinite length is drawn on the plane. When the line does not meet any of the points, the
line divides these points into two groups. If the division by such a line results in one group
consisting on... | [
{
"submission_id": "aoj_1298_10522105",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = ... |
aoj_1301_cpp | Problem G:
Malfatti Circles
The configuration of three circles packed inside a triangle such that each circle is tangent to the
other two circles and to two of the edges of the triangle has been studied by many mathematicians
for more than two centuries. Existence and uniqueness of such circles for an arbitrary triangl... | [
{
"submission_id": "aoj_1301_10852904",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <algorithm>\n#include <cmath>\n#include <iostream>\nusing namespace std;\nstruct Point\n{\n\tdouble x, y;\n}Tri[10];\ndouble length(Point p)\n{\n\treturn (sqrt(p.x * p.x + p.y * p.y))... |
aoj_1305_cpp | Problem A:
Membership Management
Peter is a senior manager of Agile Change Management (ACM) Inc., where each employee is a member of one or more task groups. Since ACM is agile, task groups are often reorganized and their members frequently change, so membership management is his constant headache.
Peter updates the me... | [
{
"submission_id": "aoj_1305_10739683",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<string>\n#include<vector>\n#include<stdlib.h>\n#include<algorithm>\n#include<iostream>\nusing namespace std;\n\nvector<string> q[111];\nint n;\nchar s[300];\n\nint main()\n{\n //freopen(\"x.in\",... |
aoj_1307_cpp | Problem C:
Towns along a Highway
There are several towns on a highway. The highway has no forks. Given the distances between the neighboring towns, we can calculate all distances from any town to others. For example, given five towns (A, B, C, D and E) and the distances between neighboring towns like in Figure C.1, we ... | [
{
"submission_id": "aoj_1307_10850484",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <map>\n#include <iostream>\n#include <vector>\nusing namespace std;\nint d[500];\nint sum[100];\nint n;\nvector<int>ans[1148576];\nint cnt;\nbool vis[1148576];\nint dis[500];\nint n... |
aoj_1304_cpp | Problem J:
Infected Land
The earth is under an attack of a deadly virus. Luckily, prompt actions of the Ministry of
Health against this emergency successfully confined the spread of the infection within a square
grid of areas. Recently, public health specialists found an interesting pattern with regard to the
transitio... | [
{
"submission_id": "aoj_1304_10946407",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); i++)\nconst int dx[8] = {1,1,1,-1,-1,-1,0,0};\nconst int dy[8] = {1,-1,0,1,-1,0,1,-1};\n... |
aoj_1309_cpp | Problem E:
The Two Men of the Japanese Alps
Two experienced climbers are planning a first-ever attempt: they start at two points of the equal altitudes on a mountain range, move back and forth on a single route keeping their altitudes equal, and finally meet with each other at a point on the route. A wise man told them... | [
{
"submission_id": "aoj_1309_10852715",
"code_snippet": "#define PII pair<int,int>\n#define PDD pair<double,double>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int N=10240;\nconst double EPS=1E-7;\n\nvector<PDD> v;\nint n,cnt,x[N],y[N],f[N],h[N],nextbase[N],prvbase[N],nxt[102][N],prv[102][N];... |
aoj_1306_cpp | Problem B:
Balloon Collecting
"Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the ground to capture the balloons. The player ... | [
{
"submission_id": "aoj_1306_6728978",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\narray<array<array<int,4>,101>,50501> dp;\n\nint main(){\n int n, INF = 1 << 30, r = 50500;\n while(cin >> n, n){\n int ans = -1;\n for(int t = 0; t <= r; t++){\n for(int p ... |
aoj_1308_cpp | Problem D:
Awkward Lights
You are working as a night watchman in an office building. Your task is to check whether all the lights in the building are turned off after all the office workers in the building have left the office. If there are lights that are turned on, you must turn off those lights. This task is not as ... | [
{
"submission_id": "aoj_1308_10853874",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <map>\n#include <set>\n#include <vector>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nconst int MAXN = 1000;\nint equ,var;... |
aoj_1310_cpp | Problem F:
Find the Multiples
You are given a sequence
a
0
a
1
...
a
N
-1
digits and a prime number
Q
. For each
i
≤
j
with
a
i
≠ 0, the subsequence
a
i
a
i
+1
...
a
j
can be read as a decimal representation of a positive integer. Subsequences with leading zeros are not considered. Your task is to count the number of p... | [
{
"submission_id": "aoj_1310_10851362",
"code_snippet": "#include <cstdio>\n#include <map>\n#include <iostream>\n#include <cstring>\nusing namespace std;\nusing std::map;\nint a[100010];\nmap<long long,int> mp;\nlong long pow_mod(long long a,long long b,long long p)\n{\n\tlong long ans = 1;\n\twhile(b) {\n\... |
aoj_1302_cpp | Problem H:
Twenty Questions
Consider a closed world and a set of features that are defined for all the objects in the world.
Each feature can be answered with "yes" or "no". Using those features, we can identify any
object from the rest of the objects in the world. In other words, each object can be represented
as a fi... | [
{
"submission_id": "aoj_1302_10848269",
"code_snippet": "#include<iostream>\n#include<fstream>\n#include<iomanip>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iomanip>\n#include<algorithm>\n#include<list>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n... |
aoj_1311_cpp | Problem G:
Test Case Tweaking
You are a judge of a programming contest. You are preparing a dataset for a graph problem to seek for the cost of the minimum cost path. You've generated some random cases, but they are not interesting. You want to produce a dataset whose answer is a desired value such as the number repres... | [
{
"submission_id": "aoj_1311_10848586",
"code_snippet": "/* ***********************************************\nAuthor :kuangbin\nCreated Time :2013/11/15 16:30:39\nFile Name :G.cpp\n************************************************ */\n\n#include <stdio.h>\n#include <string.h>\n#include <iostream>\... |
aoj_1315_cpp | Problem A:
Gift from the Goddess of Programming
The goddess of programming is reviewing a thick logbook, which is a yearly record of visitors
to her holy altar of programming. The logbook also records her visits at the altar.
The altar attracts programmers from all over the world because one visitor is chosen every
yea... | [
{
"submission_id": "aoj_1315_4851862",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst vector<int> convert={1440,60,1};\nvector<int> month={0,31,28,31,30,31,30,31,31,30,31,30};\n\nint time(string s,string t){\n int M=(s[0]-'0')*10+(s[1]-'0')-1;\n int D=(s[3]-'0')*10+(s[4]-'0')-1... |
aoj_1313_cpp | Problem I:
Intersection of Two Prisms
Suppose that
P
1
is an infinite-height prism whose axis is parallel to the
z
-axis, and
P
2
is also an infinite-height prism whose axis is parallel to the
y
-axis.
P
1
is defined by the polygon
C
1
which is the cross section of
P
1
and the
xy
-plane, and
P
2
is also defined by the ... | [
{
"submission_id": "aoj_1313_6066782",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i =... |
aoj_1316_cpp | Problem B:
The Sorcerer's Donut
Your master went to the town for a day. You could have a relaxed day without hearing his
scolding. But he ordered you to make donuts dough by the evening. Loving donuts so much, he
can't live without eating tens of donuts everyday. What a chore for such a beautiful day.
But last week, yo... | [
{
"submission_id": "aoj_1316_11047140",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<int, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = ... |
aoj_1314_cpp | Problem J:
Matrix Calculator
Dr. Jimbo, an applied mathematician, needs to calculate matrices all day for solving his own problems. In his laboratory, he uses an excellent application program for manipulating matrix expressions, however, he cannot use it outside his laboratory because the software consumes much of reso... | [
{
"submission_id": "aoj_1314_10908049",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MOD = 32768;\ntypedef vector<int> List;\ntypedef vector<vector<int>> Matrix;\nMatrix variables[26];\n\nMatrix parseExpr(const char*& p);\n\nvoid skip(const char *&p)\n{\n while ( p && *p... |
aoj_1318_cpp | Problem D:
Long Distance Taxi
A taxi driver, Nakamura, was so delighted because he got a passenger who wanted to go to a
city thousands of kilometers away. However, he had a problem. As you may know, most taxis in
Japan run on liquefied petroleum gas (LPG) because it is cheaper than gasoline. There are more
than 50,000... | [
{
"submission_id": "aoj_1318_10849725",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <vector>\n#include <queue>\n#include <map>\n#include <string>\n#include <cstring>\n#include <algorithm>\n\nusing namespace std;\n\nconst int maxn = 6000;\nconst int maxm = 6090;\ncon... |
aoj_1317_cpp | Problem C:
Weaker than Planned
The committee members of the Kitoshima programming contest had decided to use crypto-graphic software for their secret communication. They had asked a company, Kodai Software,
to develop cryptographic software that employed a cipher based on highly sophisticated mathematics.
According to ... | [
{
"submission_id": "aoj_1317_7228208",
"code_snippet": "#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\ntemplate <class T = int>\nusing V = vector<T>;\n\n\n#define repname(a, b, c, d, ...) d\n#define rep(...) ... |
aoj_1322_cpp | Problem H:
ASCII Expression
Mathematical expressions appearing in old papers and old technical articles are printed with typewriter in several lines, where a fixed-width or monospaced font is required to print characters (digits, symbols and spaces). Let us consider the following mathematical expression.
It is printed ... | [
{
"submission_id": "aoj_1322_5951862",
"code_snippet": "#define MOD_TYPE 1\n\n#pragma region Macros\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n//#include <atcoder/all>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long... |
aoj_1320_cpp | Problem F:
City Merger
Recent improvements in information and communication technology have made it possible to provide municipal service to a wider area more quickly and with less costs. Stimulated by this, and probably for saving their not sufficient funds, mayors of many cities started to discuss on mergers of their... | [
{
"submission_id": "aoj_1320_10954681",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nvector<int> ls;\nvector<vector<int>> v; // v[i][j] = overlap length a[i] suffix vs a[j] prefix\nunordered_map<long long,int> cac; // memo for sediv\nunordered_map<int,int> bp; // single-bit -> ... |
aoj_1312_cpp | Problem H:
Where's Wally
Do you know the famous series of children's books named "Where's Wally"? Each of the books contains a variety of pictures of hundreds of people. Readers are challenged to find a person called Wally in the crowd.
We can consider "Where's Wally" as a kind of pattern matching of two-dimensional gr... | [
{
"submission_id": "aoj_1312_10849705",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <list>\n#include <cctype>\n#include <functional>\n#include <iterator>\n#include <cstring>\n#include <cmath>\n#incl... |
aoj_1323_cpp | Problem I:
Encircling Circles
You are given a set of circles
C
of a variety of radii (radiuses) placed at a variety of positions, possibly overlapping one another. Given a circle with radius
r
, that circle may be placed so that it encircles all of the circles in the set
C
if r is large enough.
There may be more than o... | [
{
"submission_id": "aoj_1323_6159804",
"code_snippet": "#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<cis... |
aoj_1319_cpp | Problem E:
Driving an Icosahedral Rover
After decades of fruitless efforts, one of the expedition teams of ITO (Intersolar Tourism Organization) finally found a planet that would surely provide one of the best tourist attractions
within a ten light-year radius from our solar system. The most attractive feature of the p... | [
{
"submission_id": "aoj_1319_10851601",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int nt[20][3]={\n{5,1,4},\n{6,2,0},\n{7,3,1},\n{8,4,2},\n{9,0,3},\n{0,10,11},\n{1,11,12},\n{2,12,13},\n{3,13,14},\n{4,14,10},\n{15,5,9},\n{16,6,5},\n{17,7,6},\n{18,8,7},\n{19,9,8},\n{10,19,16},\n{... |
aoj_1321_cpp | Problem G:
Captain Q′s Treasure
You got an old map, which turned out to be drawn by the infamous pirate “Captain Q”. It shows the locations of a lot of treasure chests buried in an island.
The map is divided into square sections, each of which has a digit on it or has no digit. The digit represents the number of chests... | [
{
"submission_id": "aoj_1321_10851230",
"code_snippet": "#include <iostream>\n\n#include <cstdio>\n\n#include <string.h>\n\n#include <string>\n\n#include <algorithm>\n\n#include <map>\n\nusing namespace std;\n\n\nconst int maxn = 16;\n\nconst int inf = 100000000;\n\nstruct node\n\n{\n\n int x, y, c;\n\n}... |
aoj_1324_cpp | Problem J:
Round Trip
Jim is planning to visit one of his best friends in a town in the mountain area. First, he leaves his hometown and goes to the destination town. This is called the go phase. Then, he comes back to his hometown. This is called the return phase. You are expected to write a program to find the minimu... | [
{
"submission_id": "aoj_1324_10858211",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<algorithm>\n#include<iostream>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<map>\n#include<set>\n#include<string>\nusing namespace std;\n#define INF 199999999\n#define eps... |
aoj_1325_cpp | Problem A:
Ginkgo Numbers
We will define Ginkgo numbers and multiplication on Ginkgo numbers.
A
Ginkgo number
is a pair <
m
,
n
> where
m
and
n
are integers. For example, <1, 1>, <-2, 1> and <-3,-1> are Ginkgo numbers.
The multiplication on Ginkgo numbers is defined by <
m
,
n
> · <
x
,
y
> = <
mx
−
ny
,
my
+
nx
>. For... | [
{
"submission_id": "aoj_1325_10853137",
"code_snippet": "#include<cstring>\n#include<string>\n#include<sstream>\n#include<fstream>\n#include<iostream>\n#include<iomanip>\n#include<cstdio>\n#include<cctype>\n#include<algorithm>\n#include<queue>\n#include<deque>\n#include<map>\n#include<set>\n#include<vector>... |
aoj_1327_cpp | Problem C:
One-Dimensional Cellular Automaton
There is a one-dimensional cellular automaton consisting of
N
cells. Cells are numbered from 0 to
N
− 1.
Each cell has a state represented as a non-negative integer less than
M
. The states of cells evolve through discrete time steps. We denote the state of the i-th cell at... | [
{
"submission_id": "aoj_1327_11043071",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_1328_cpp | Problem D:
Find the Outlier
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function
f
(
x
) =
x
2
+ 2
x
+ 1, for instance, a possible expected calculatio... | [
{
"submission_id": "aoj_1328_10496662",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint d;\ndouble a[1003][1004];\ndouble k[20005];\nbool solve(){\n//\tfor(int i=1;i<=d+3;i++){\n\t////\tfor(int j=1;j<=d+2;j++){\n\t//\t\tcout<<a[i][j]<<\" \";\n\t//\t}\n\t//\tcout<<endl;\n\t//}\n\tint n=d+... |
aoj_1326_cpp | Problem B:
Stylish
Stylish
is a programming language whose syntax comprises
names
, that are sequences of Latin alphabet letters, three types of
grouping symbols
, periods ('.'), and newlines. Grouping symbols, namely round brackets ('(' and ')'), curly brackets ('{' and '}'), and square brackets ('[' and ']'), must ma... | [
{
"submission_id": "aoj_1326_9614938",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)... |
aoj_1336_cpp | Problem B:
The Last Ant
A straight tunnel without branches is crowded with busy ants coming and going. Some ants walk left to right and others right to left. All ants walk at a constant speed of 1 cm/s. When two ants meet, they try to pass each other. However, some sections of the tunnel are narrow and two ants cannot ... | [
{
"submission_id": "aoj_1336_10881257",
"code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long lo... |
aoj_1331_cpp | Problem G:
Let There Be Light
Suppose that there are some light sources and many spherical balloons. All light sources have sizes small enough to be modeled as point light sources, and they emit light in all directions. The surfaces of the balloons absorb light and do not reflect light. Surprisingly in this world, ball... | [
{
"submission_id": "aoj_1331_10958572",
"code_snippet": "#include <cstdio>\n#include <set>\n#include <cmath>\nusing namespace std;\nstruct Point\n{\n double x;\n double y;\n double z;\n void read()\n {\n scanf(\"%lf %lf %lf\",&x,&y,&z);\n }\n Point(double x=0,double y=0,double z=... |
aoj_1333_cpp | Problem I:
Beautiful Spacing
Text is a sequence of words, and a word consists of characters. Your task is to put words into a grid with
W
columns and sufficiently many lines. For the beauty of the layout, the following conditions have to be satisfied.
The words in the text must be placed keeping their original order. T... | [
{
"submission_id": "aoj_1333_10851267",
"code_snippet": "//#include<CSpreadSheet.h>\n\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<sstream>\n#include<cstdlib>\n#include<string>\n#include<string.h>\n#include<cstring>\n#include<algorithm>\n#include<vector>\n#include<map>\n#include<set>\n#i... |
aoj_1330_cpp | Problem F:
Never Wait for Weights
In a laboratory, an assistant, Nathan Wada, is measuring weight differences between sample pieces pair by pair. He is using a balance because it can more precisely measure the weight difference between two samples than a spring scale when the samples have nearly the same weight.
He is ... | [
{
"submission_id": "aoj_1330_11066164",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\nusing namespace std;\n\nclass unionfind{\npublic:\n unionfind(int n): n_(n) {\n parent_.resize(n);\n size_.resize(n);\n diff_.resize(n);\n for(int i=0; i<n; i++... |
aoj_1334_cpp | Problem J:
Cubic Colonies
In AD 3456, the earth is too small for hundreds of billions of people to live in peace. Interstellar Colonization Project with Cubes (ICPC) is a project that tries to move people on the earth to space colonies to ameliorate the problem. ICPC obtained funding from governments and manufactured s... | [
{
"submission_id": "aoj_1334_4876386",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 10005\n\n... |
aoj_1335_cpp | Problem A:
Equal Sum Sets
Let us consider sets of positive integers less than or equal to
n
. Note that all elements of a set are different. Also note that the order of elements doesn't matter, that is, both {3, 5, 9} and {5, 9, 3} mean the same set.
Specifying the number of set elements and their sum to be
k
and
s
, r... | [
{
"submission_id": "aoj_1335_11030135",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\nbool chmin(auto& a, const auto& b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, const auto& b) { return a < b ? a = b... |
aoj_1329_cpp | Problem E:
Sliding Block Puzzle
In sliding block puzzles, we repeatedly slide pieces (blocks) to open spaces within a frame to establish a goal placement of pieces.
A puzzle creator has designed a new puzzle by combining the ideas of sliding block puzzles and mazes. The puzzle is played in a rectangular frame segmented... | [
{
"submission_id": "aoj_1329_10853885",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<queue>\n#include<iostream>\nusing namespace std;\nconst int inf=0x3f3f3f3f;\nconst int maxn=60;\nint n,m;\nchar mp[maxn][maxn];\nconst int cx[]={-1,-1,0,1,2,2,0,1};\nconst int cy[]={0,1,2,2,0,1,-1,-1};\nst... |
aoj_1338_cpp | Problem D:
Clock Hands
We have an analog clock whose three hands (the second hand, the
minute
hand and the
hour
hand) rotate quite smoothly. You can measure two angles between the second hand and two other hands.
Write a program to find the time at which "No two hands overlap each other" and "Two angles between the sec... | [
{
"submission_id": "aoj_1338_9808827",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\ntemplate < class T > bool chm... |
aoj_1337_cpp | Problem C:
Count the Regions
There are a number of rectangles on the
x-y
plane. The four sides of the rectangles are parallel to either the
x
-axis or the
y
-axis, and all of the rectangles reside within a range specified later. There are no other constraints on the coordinates of the rectangles.
The plane is partition... | [
{
"submission_id": "aoj_1337_10852755",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <map>\n#include <algorithm>\nusing namespace std;\nconst int maxn = 555;\nint l[maxn],r[maxn],t[maxn],b[maxn];\nint X[maxn],Y[maxn],g[maxn][maxn];\nmap<int,int>mpx;\nmap<int,int>mpy;... |
aoj_1344_cpp | Problem J:
C(O|W|A*RD*|S)* CROSSWORD
Puzzle
The first crossword puzzle was published on December 21, 1913 by Arthur Wynne. To celebrate the centennial of his great-great-grandfather's invention, John "Coward" Wynne
1
was struggling to make crossword puzzles. He was such a coward that whenever he thought of a tricky clu... | [
{
"submission_id": "aoj_1344_5432770",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <algorithm>\n#include <cctype>\n#include <cassert>\n#include <array>\n#include <set>\nusing namespace std;\n\n#define ALL(v) begin(v),end(v)\n\nnamespace{\n\nstruct... |
aoj_1332_cpp | Problem H:
Company Organization
You started a company a few years ago and fortunately it has been highly successful. As the growth of the company, you noticed that you need to manage employees in a more organized way, and decided to form several groups and assign employees to them.
Now, you are planning to form n group... | [
{
"submission_id": "aoj_1332_10851055",
"code_snippet": "#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <iostream>\n\nusing namespace std;\n\nconst int MAXN = 1e4+10;\nconst int MAXG = 110;\n\nint n,m;\nint x[MAXN],op[MAXN],y[MAXN];\n\nint f[MAXG]... |
aoj_1339_cpp | Problem E:
Dragon's Cruller
Dragon's Cruller is a sliding puzzle on a torus. The torus surface is partitioned into nine squares as shown in its development in Figure E.1. Here, two squares with one of the sides on the development labeled with the same letter are adjacent to each other, actually sharing the side. Figure... | [
{
"submission_id": "aoj_1339_10857961",
"code_snippet": "#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define HASH 1000003\n#define MAXN 1000010\nint fir... |
aoj_1340_cpp | Problem F:
Directional Resemblance
Vectors have their directions and two vectors make an angle between them. Given a set of three-dimensional vectors, your task is to find the pair among them that makes the smallest angle.
Input
The input is a sequence of datasets. A dataset specifies a set of three-dimensional vectors... | [
{
"submission_id": "aoj_1340_10848362",
"code_snippet": "#include <bits/stdc++.h>\n//using namespace std;\n\ntypedef long double LD;\n\nconst LD INF = 1e15;\nconst LD eps = 1e-13;\nconst int N = 155555;\n\nint n, m, S, W;\n\ninline LD norm(const LD &x) {\n\treturn x * x;\n}\n\nstruct OriP {\n\tint x, y, z;\... |
aoj_1347_cpp | Problem C:
Shopping
Your friend will enjoy shopping. She will walk through a mall along a straight street, where $N$ individual shops (numbered from 1 to $N$) are aligned at regular intervals. Each shop has one door and is located at the one side of the street. The distances between the doors of the adjacent shops are ... | [
{
"submission_id": "aoj_1347_2717021",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <functional>\n#include <numeric>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <utility>\n#in... |
aoj_1342_cpp | Problem H:
Don't Burst the Balloon
An open-top box having a square bottom is placed on the floor. You see a number of needles vertically planted on its bottom.
You want to place a largest possible spheric balloon touching the box bottom, interfering with none of the side walls nor the needles.
Java Specific:
Submitted ... | [
{
"submission_id": "aoj_1342_9782093",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v)... |
aoj_1345_cpp | Problem A:
Bit String Reordering
You have to reorder a given bit string as specified. The only operation allowed is swapping adjacent bit pairs. Please write a program that calculates the minimum number of swaps required.
The initial bit string is simply represented by a sequence of bits, while the target is specified ... | [
{
"submission_id": "aoj_1345_10500246",
"code_snippet": "#include <iostream>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <ranges>\n#include <map>\nnamespace ranges = std::ranges;\nint N, M;\nstd::vector<int> rle(std::vector<int> a) {\n std::vector<int> res;\n for (int i = 0,... |
aoj_1341_cpp | Problem G:
Longest Chain
Let us compare two triples
a = (x
a
, y
a
, z
a
)
and
b = (x
b
, y
b
, z
b
)
by a partial order ∠ defined as follows.
a
∠
b
⇔
x
a
<
x
b
and
y
a
<
y
b
and
z
a
<
z
b
Your mission is to find, in the given set of triples, the longest ascending series
a
1
∠
a
2
∠ ... ∠
a
k
.
Input
The input is a se... | [
{
"submission_id": "aoj_1341_10853188",
"code_snippet": "#include<map>\n#include<set>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define MAXN 300010\nint A, B, C = ~(1<<31), M = (1<<16)-1;\nint myR... |
aoj_1343_cpp | Problem I:
Hidden Tree
Consider a binary tree whose leaves are assigned integer weights. Such a tree is called
balanced
if, for every non-leaf node, the sum of the weights in its left subtree is equal to that in the right subtree. For instance, the tree in the following figure is balanced.
Figure I.1. A balanced tree
A... | [
{
"submission_id": "aoj_1343_10853732",
"code_snippet": "#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\n#define MAXN 1010\nconst int mt = 131072;\nint a[MA... |
aoj_1348_cpp | Problem D:
Space Golf
You surely have never heard of this new planet surface exploration scheme, as it is being carried out in a project with utmost secrecy. The scheme is expected to cut costs of conventional rovertype mobile explorers considerably, using projected-type equipment nicknamed "observation bullets".
Bulle... | [
{
"submission_id": "aoj_1348_4963406",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\ntemplate<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}\ntemplate<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}... |
aoj_1349_cpp | Problem E:
Automotive Navigation
The International Commission for Perfect Cars (ICPC) has constructed a city scale test course for advanced driver assistance systems. Your company, namely the Automotive Control Machines (ACM), is appointed by ICPC to make test runs on the course.
The test course consists of streets, ea... | [
{
"submission_id": "aoj_1349_10848168",
"code_snippet": "#include<map>\n#include<set>\n#include<cmath>\n#include<queue>\n#include<cctype>\n#include<cstdio>\n#include<vector>\n#include<cstdlib>\n#include<cstring>\n#include<algorithm>\ntypedef long long LL;\nbool go[55][55][4];\nbool f[55][55][1010][4];\nstru... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.