AtCoder Grand Contest 023

Submission #2427944

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))


int solve(int n, vector<string>& s){
    vector<vector<char>> w(n*2, vector<char>(n*2));
    rep(i,n) rep(j,n){
        char ch = s[i][j];
        rep(a,2) rep(b,2) {
            w[i+n*a][j+n*b] = ch;
        }
    }
    int ans = 0;
    rep(of,n) {
        int neq = 0;
        repC2(i,j,n){
            if (w[of+i][j] != w[of+j][i]) ++neq;
        }
        if (neq == 0) ++ans;
    }
    return ans * n;
}

int main() {
    int n; cin >> n;
    vector<string> s(n);
    rep(i,n) cin >> s[i];
    cout << solve(n, s) << endl;
    return 0;
}

Submission

Task問題 B - Find Symmetries
User nameユーザ名 naoya_t
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 500
Source lengthソースコード長 1644 Byte
File nameファイル名
Exec time実行時間 19 ms
Memory usageメモリ使用量 768 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_01.txt,sample_02.txt,sample_03.txt
All 500 / 500 sample_01.txt,sample_02.txt,sample_03.txt,sample_01.txt,sample_02.txt,sample_03.txt,subtask_1_01.txt,subtask_1_02.txt,subtask_1_03.txt,subtask_1_04.txt,subtask_1_05.txt,subtask_1_06.txt,subtask_1_07.txt,subtask_1_08.txt,subtask_1_09.txt,subtask_1_10.txt,subtask_1_11.txt,subtask_1_12.txt,subtask_1_13.txt,subtask_1_14.txt,subtask_1_15.txt,subtask_1_16.txt,subtask_1_17.txt,subtask_1_18.txt,subtask_1_19.txt,subtask_1_20.txt,subtask_1_21.txt,subtask_1_22.txt,subtask_1_23.txt,subtask_1_24.txt,subtask_1_25.txt,subtask_1_26.txt,subtask_1_27.txt,subtask_1_28.txt,subtask_1_29.txt,subtask_1_30.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 17 ms 768 KB
subtask_1_04.txt AC 15 ms 640 KB
subtask_1_05.txt AC 14 ms 512 KB
subtask_1_06.txt AC 8 ms 512 KB
subtask_1_07.txt AC 14 ms 512 KB
subtask_1_08.txt AC 17 ms 768 KB
subtask_1_09.txt AC 19 ms 768 KB
subtask_1_10.txt AC 19 ms 768 KB
subtask_1_11.txt AC 19 ms 768 KB
subtask_1_12.txt AC 19 ms 768 KB
subtask_1_13.txt AC 19 ms 768 KB
subtask_1_14.txt AC 19 ms 768 KB
subtask_1_15.txt AC 19 ms 768 KB
subtask_1_16.txt AC 19 ms 768 KB
subtask_1_17.txt AC 19 ms 768 KB
subtask_1_18.txt AC 19 ms 768 KB
subtask_1_19.txt AC 19 ms 768 KB
subtask_1_20.txt AC 19 ms 768 KB
subtask_1_21.txt AC 19 ms 768 KB
subtask_1_22.txt AC 19 ms 768 KB
subtask_1_23.txt AC 19 ms 768 KB
subtask_1_24.txt AC 19 ms 768 KB
subtask_1_25.txt AC 19 ms 768 KB
subtask_1_26.txt AC 19 ms 768 KB
subtask_1_27.txt AC 19 ms 768 KB
subtask_1_28.txt AC 19 ms 768 KB
subtask_1_29.txt AC 19 ms 768 KB
subtask_1_30.txt AC 19 ms 768 KB