oj.uz

Submission #338257

# Submission time Handle Problem Language Result Execution time Memory
338257 2020-12-22T20:08:22 Z souvenir_vayne Patkice (COCI20_patkice) C++14
50 / 50
 1 ms 364 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define int long long
#define endl '\n'
#define ll long long
#define f first
#define fin cin
#define fout cout
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl
#define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl
#define all(x) x.begin(), x.end()
#define left vadia
#define lb lower_bound
#define right puta
using namespace std;
using namespace __gnu_pbds;
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str( ),"w",stdout);
}
typedef pair<ll, ll> pii;
typedef vector<vector<char>> mat;
typedef pair<int, string> pis;
const ll mod = 1e9+7;
typedef vector<int> vi;
typedef pair<int, pair<int, int>> piii;

int x[] = {0, -1, 1, 0};
int y[] = {1, 0, 0, -1};

int32_t main() {

    int l, c;
    cin >> l >> c;

    char m[105][105];
    int sx = 0, sy = 0;
    for(int i = 0; i < l; i++)
        for(int j = 0; j < c; j++) {
            cin >> m[i][j];
            if(m[i][j] == 'o')
                sx = i, sy = j;
        }

    int ans = INT_MAX, dir = -1;
    for(int z = 0; z < 4; z++) {
        int i = sx + x[z], j = sy + y[z], now = 1;
        while(true) {
            if(m[i][j] == 'v') i++;
            else if(m[i][j] == '>') j++;
            else if(m[i][j] == '<') j--;
            else if(m[i][j] == '^') i--;
            else if(m[i][j] == '.' or m[i][j] == 'o' or i < 0 or j < 0 or i >= l or j >= c) break;
            else if(m[i][j] == 'x') {
                if(now < ans) {
                    ans = now;
                    dir = z;
                }
                break;
            }
            now++;
        }
    }

    if(dir == -1)
        cout << ":(" << endl;

    else {
        cout << ":)" << endl;
        if(dir == 0) cout << "E" << endl;
        if(dir == 1) cout << "N" << endl;
        if(dir == 2) cout << "S" << endl;
        if(dir == 3) cout << "W" << endl;
    }




}

Compilation message

patkice.cpp: In function 'void setIO(std::string)':
patkice.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
patkice.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   freopen((s+".out").c_str( ),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct