oj.uz

답안 #805647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805647 2023-08-03T19:26:04 Z HD1 Monthly railway pass (LMIO18_menesinis_bilietas) C++14
0 / 100
 391 ms 54252 KB 
// we all are lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_studio(0); cin.tie(0);
#define sz(x) long long(x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define ss second
#define ff first
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const int MAX=1e6;
const int inf=1e9;
const int mod=1e9+7;
vector<ii>gfo[MAX];
void solve(){
    ll n, m, u, v;
    char x;
    cin>>n>>m;
    for(ll i=0; i<m; i++){
        cin>>u>>v>>x;
        if(x=='A'){
            gfo[u].pb({v,1});
            gfo[v].pb({u,1});
        }
        else{
            gfo[u].pb({v,0});
            gfo[v].pb({u,0});
        }
    }
    cout<<n<<endl;
    return;
}
int main(){
    solve();
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 391 ms 54252 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Incorrect 13 ms 23764 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Incorrect 13 ms 23764 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Incorrect 13 ms 23764 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 391 ms 54252 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Incorrect 13 ms 23764 KB Output isn't correct
4 Halted 0 ms 0 KB -