oj.uz

답안 #314860

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314860 2020-10-21T14:17:40 Z model_code Patkice (COCI20_patkice) C++17
30 / 50
 1 ms 384 KB 
#include <cassert>
#include <cstdio>
#include <algorithm>
 
using namespace std;
 
const int MAXN = 102;
const int INF = MAXN*MAXN;
 
typedef pair<int, int> ii;
 
ii operator+(const ii& a, const ii& b){
    return ii(a.first + b.first, a.second + b.second);
}
 
 
int r,s;
char mat[MAXN][MAXN];
 
 
//ENSW
ii delta[] = {ii(0, 1), ii(-1, 0), ii(1, 0), ii(0, -1)};
 
 
int measure(ii p){
    int d = 0;
    for(;;){
        switch(mat[p.first][p.second]){
        case 'x':
            return d;
        case '>':
            p = p+delta[0];
            break;
        case '^':
            p = p+delta[1];
            break;
        case 'v':
            p = p+delta[2];
            break;
        case '<':
            p = p+delta[3];
            break;
        default:
            return INF;
        }
        d++;
    }
    return INF;
}
 
int main(){
    scanf("%d%d", &r, &s);
    for(int i=0;i<r;i++){
        scanf("%s", mat[i]);
    }
    ii start;
    for(int i=0;i<r;i++){
        for(int j=0;j<s;j++){
            if(mat[i][j] == 'o')
                start = ii(i, j);
        }
    }
    int bl = INF;
    char s = 0;
  int cnt=0;
    for(int i=0;i<4;i++){
        int len = measure(start + delta[i]);
        if(len<bl){
            bl = len;
            s = "ENSW"[i]; cnt=1;
        } else if(len==bl) {cnt++;}
    }
  
    if(s)
       assert(cnt==1), printf(":)\n%c\n", s);
    else
        puts(":(");
}

Compilation message

patkice.cpp: In function 'int main()':
patkice.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   52 |     scanf("%d%d", &r, &s);
      |     ~~~~~^~~~~~~~~~~~~~~~
patkice.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |         scanf("%s", mat[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Runtime error 1 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -