oj.uz

Submission #343336

# Submission time Handle Problem Language Result Execution time Memory
343336 2021-01-03T17:30:01 Z benedict0724 One-Way Streets (CEOI17_oneway) C++17
0 / 100
 12 ms 364 KB 
#include <bits/stdc++.h>

using namespace std;

vector<int> adj[1002];
pair<int, int> road[1002];
pair<int, int> haveTo[1002];
int subOf[1002];
bool visited[1002];
bool poss = false;

void dfs(int x, int s, int e){
    visited[x] = true;
    if(x == e){
        poss = true;
        return;
    }
    subOf[x] = 1;
    for(auto u : adj[x]){
        if(!visited[u] && (x != s || u != e)){
            dfs(u, s, e);
        }
        if(poss) return;
    }
}

int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    for(int i=1;i<=m;i++){
        int s, e;
        scanf("%d %d", &s, &e);
        adj[s].push_back(e);
        adj[e].push_back(s);
        road[i] = {s, e};
    }
    int p;
    scanf("%d", &p);
    for(int i=1;i<=p;i++){
        int s, e;
        scanf("%d %d", &s, &e);
        haveTo[i] = {s, e};
    }

    for(int i=1;i<=m;i++){
        int s = road[i].first, e = road[i].second;
        bool toL = true, toR = true;
        fill(visited, visited + 1002, false);
        fill(subOf, subOf + 1002, 0);
        poss = false;
        dfs(s, s, e);
        if(poss){
            printf("B");
            continue;
        }
        else{
            for(int j=1;j<=p;j++){
                if(subOf[haveTo[j].first] == 1 && subOf[haveTo[j].second] == 0){
                    toL = false;
                }
                if(subOf[haveTo[j].first] == 0 && subOf[haveTo[j].second] == 1){
                    toR = false;
                }
            }
            if(toL && toR) printf("B");
            else if(toL) printf("L");
            else if(toR) printf("R");
            else printf("Error\n");
        }
    }
}

Compilation message

oneway.cpp: In function 'int main()':
oneway.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
oneway.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d %d", &s, &e);
      |         ~~~~~^~~~~~~~~~~~~~~~~
oneway.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |     scanf("%d", &p);
      |     ~~~~~^~~~~~~~~~
oneway.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |         scanf("%d %d", &s, &e);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.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 9 ms 364 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 11 ms 364 KB Output is correct
8 Correct 12 ms 364 KB Output is correct
9 Incorrect 7 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 30.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 9 ms 364 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 11 ms 364 KB Output is correct
8 Correct 12 ms 364 KB Output is correct
9 Incorrect 7 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.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 9 ms 364 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 9 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 11 ms 364 KB Output is correct
8 Correct 12 ms 364 KB Output is correct
9 Incorrect 7 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -