oj.uz

Submission #11580

# Submission time Handle Problem Language Result Execution time Memory
11580 2014-12-02T14:47:10 Z gs14004 Senior Postmen (BOI14_postmen) C++
38 / 100
 500 ms 44576 KB 
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;

struct edge{int pos, rev; };

vector<edge> graph[500005];
vector<bool> cant[500005];

int n,m;

vector<int> cyc, temp;

void add_edge(int s, int e){
    graph[s].push_back({e,(int)graph[e].size()});
    graph[e].push_back({s,(int)graph[s].size()-1});
    cant[s].push_back(0);
    cant[e].push_back(0);
}

void f(int x){
    for (int i=0; i<graph[x].size(); i++) {
        if(cant[x][i]) continue;
        cant[x][i] = 1;
        int pos = graph[x][i].pos;
        int rev = graph[x][i].rev;
        cant[pos][rev] = 1;
        f(pos);
    }
    cyc.push_back(x);
}

int vis[500005];
int main(){
    scanf("%d %d",&n,&m);
    for (int i=0; i<m; i++) {
        int s,e;
        scanf("%d %d",&s,&e);
        add_edge(s,e);
    }
    f(1);
    for (int i=0; i<cyc.size(); i++) {
        temp.push_back(cyc[i]);
        if(vis[cyc[i]]){
            printf("%d",temp.back());
            temp.pop_back();
            while(temp.back() != cyc[i]){
                printf(" %d",temp.back());
                vis[temp.back()] = 0;
                temp.pop_back();
                if(temp.back() == cyc[i]) printf("\n");
            }
        }
        else vis[cyc[i]] = 1;
    }
}

Compilation message

postmen.cpp: In function 'void f(int)':
postmen.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<graph[x].size(); i++) {
                   ~^~~~~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<cyc.size(); i++) {
                   ~^~~~~~~~~~~
postmen.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
postmen.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&s,&e);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 31616 KB Output is correct
2 Correct 30 ms 31668 KB Output is correct
3 Correct 29 ms 31648 KB Output is correct
4 Correct 33 ms 32000 KB Output is correct
5 Correct 28 ms 31688 KB Output is correct
6 Correct 27 ms 32028 KB Output is correct
7 Correct 44 ms 32888 KB Output is correct
8 Correct 23 ms 31872 KB Output is correct
9 Correct 151 ms 39152 KB Output is correct
10 Correct 33 ms 31868 KB Output is correct
11 Correct 27 ms 31848 KB Output is correct
12 Correct 113 ms 39644 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 31636 KB Output is correct
2 Correct 28 ms 31616 KB Output is correct
3 Correct 28 ms 31616 KB Output is correct
4 Correct 32 ms 31872 KB Output is correct
5 Correct 25 ms 31744 KB Output is correct
6 Correct 29 ms 32000 KB Output is correct
7 Correct 34 ms 32976 KB Output is correct
8 Correct 30 ms 31872 KB Output is correct
9 Correct 173 ms 39260 KB Output is correct
10 Correct 24 ms 31872 KB Output is correct
11 Correct 25 ms 31832 KB Output is correct
12 Correct 120 ms 39692 KB Output is correct
13 Correct 165 ms 44424 KB Output is correct
14 Correct 134 ms 40820 KB Output is correct
15 Execution timed out 1096 ms 40628 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 31572 KB Output is correct
2 Correct 29 ms 31616 KB Output is correct
3 Correct 24 ms 31616 KB Output is correct
4 Correct 31 ms 31976 KB Output is correct
5 Correct 27 ms 31744 KB Output is correct
6 Correct 25 ms 32052 KB Output is correct
7 Correct 35 ms 32888 KB Output is correct
8 Correct 25 ms 31872 KB Output is correct
9 Correct 156 ms 39256 KB Output is correct
10 Correct 32 ms 31840 KB Output is correct
11 Correct 26 ms 31872 KB Output is correct
12 Correct 91 ms 39644 KB Output is correct
13 Correct 144 ms 44576 KB Output is correct
14 Correct 137 ms 40888 KB Output is correct
15 Execution timed out 1083 ms 40508 KB Time limit exceeded
16 Halted 0 ms 0 KB -