제출 #276273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
276273		JuliusMieliauskas	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	22 / 100	1 ms	416 KiB

adventure

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<long long>
#define MOD 1000000007
#define endl '\n'

typedef long long ll;

void print(vi v){
    cout<<"Contents of vector:\n";
    for(auto x : v) cout<<x<<" ";
    cout<<endl<<endl;
}

const int MAXN = 200009;
ll ar[MAXN];

ll fen[MAXN] = {0};

void upd(int p, int x) {
    for (int i = p; i < MAXN; i += i&(-i))  fen[i] += x;
}
ll get(int p) {
    // gauna sumą elementų nuo 1-ojo iki p-tojo
    ll ret = 0;
    for (int i = p; i > 0; i -= i&(-i))
        ret += fen[i];
    return ret;
}
ll get(int l, int r) {
    return get(r) - get(l-1);
}

void solve(){
    int m, n; cin>>m>>n;
    char ar[m][n];
    for(int i = 0; i<m; i++) for(int j = 0; j<n; j++) cin>>ar[i][j];

    if(m == 1){
        ll ans = 0;
        for(int i = 0; i<n-1; i++){
            if(ar[0][i] == 'N') ans++;
            if(ar[0][i] == 'S') ans += 3;
            if(ar[0][i] == 'W') ans += 2;
            if(ar[0][i] == 'X'){
                ans = -1;
                break;
            }
        }

        cout<<ans<<endl;

    }



}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    //ifstream cin(""); ofstream cout("");///cia failai

    //int T; cin>>T;
    int T = 1;

    for(int it = 1; it<=T; it++){
        solve();

    }
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 16
• Subtask 5: 0 / 50