oj.uz

답안 #1021705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021705 2024-07-13T02:59:32 Z lHog Monthly railway pass (LMIO18_menesinis_bilietas) C++17
0 / 100
 174 ms 7604 KB 

#include <bits/stdc++.h>
using namespace std;
long long N, E;
//void dfs(long long n, vector<vector<long long>>& g, vector<bool>& v) {
    //v[n] = true;
    //for (long long e : g[n]) {
        //if (!v[e]) {
            //dfs(e, g, v);
        //}
    //}
//}
//long long c(long long N, vector<pair<long long, long long>>& d) {
    //vector<vector<long long>> g(N);
    //for (auto d : d) {
        //g[d.first].push_back(d.second);
        //g[d.second].push_back(d.first);
    //}
    //vector<bool> v(N, false);
    //long long u = 0;
    //for (long long i = 0; i < N; ++i) {
        //if (!v[i]) {
            //u++;
            //dfs(i,g,v);
        //}
    //}
    //return u;
//}
int main() {
    cin >> N >> E;
    vector<pair<long long, long long>> d(E);
    for (long long i = 0; i < E; ++i) {
		char sodifjsd;
        cin >> d[i].first >> d[i].second >> sodifjsd;
    }
    //if (c(N,d) == 1) cout << N;
    //else cout << 0;
    cout << N;
    
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 7604 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 7604 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -