oj.uz

답안 #500359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500359 2021-12-30T19:21:39 Z GenericAccount Monthly railway pass (LMIO18_menesinis_bilietas) C++17
10 / 100
 3000 ms 85792 KB 
#include<bits/stdc++.h>

using namespace std;

vector<vector<int>>tConn;
vector<vector<int>>aConn;

int N,M;

struct Group{
vector<int>miestai;
vector<int>connections;

    void mergeGroup(Group g){
        for(int m:g.miestai) miestai.push_back(m);
            for(int c:g.connections)
                if(find(connections.begin(), connections.end(), c)==connections.end())
                    connections.push_back(c);
    }

    bool hasCity(int city){
        return (find(miestai.begin(), miestai.end(), city)!=miestai.end());
    }


    bool hasConnection(int conn){
        return (find(connections.begin(), connections.end(), conn)!=connections.end());
    }
};




int find_group_with_city(vector<Group> grupes, int cityId) {

  for (int i = 0; i < grupes.size(); i++) {
	if(grupes[i].hasCity(cityId))return i;
  }
  return -1;
}

void create_group(int cityId, vector<Group> & grupes) {
  Group g;
  g.miestai.push_back(cityId);
  grupes.push_back(g);
}

void change_ref(int from, int to, vector<Group> & grupes){
  for(Group g: grupes){
    for(int c: g.connections){
      if(c==from)c=to;
    }
  }
}
//N-miestu skaicius   M-transporto linijos

void dumpGroups(vector<Group> grupes){
  for (Group g : grupes) {
    for (int m : g.miestai) {
      cout<<m<<" ";
    }
    cout<<" ----> ";
    for (int c : g.connections) {
      cout<<c<<" ";
    }
    cout<<endl;
  }
}


int main() {
  cin >> N >> M;

  int a, b;
  char T;
  tConn.resize(N);
  aConn.resize(N);
  for (int i = 0; i < M; i++) {
    cin >> a >> b >> T;
    if(T=='T'){
      tConn[a-1].push_back(b-1);
      tConn[b-1].push_back(a-1);
    }
    else{
      aConn[a-1].push_back(b-1);
      aConn[b-1].push_back(a-1);
    }
  }
  vector<Group>grupes;
  vector<int>sk_grupe(N, -1);
  queue<int> nextToCheck;
  for (int i = 0; i < N; i++) {
    if (sk_grupe[i] == -1) {
      grupes.push_back(Group());
      nextToCheck.push(i);
      while (!nextToCheck.empty()) {
        if (sk_grupe[nextToCheck.front()] == -1) {
          sk_grupe[nextToCheck.front()] = grupes.size() - 1;
          grupes[grupes.size() - 1].miestai.push_back(nextToCheck.front());
          for (int c : tConn[nextToCheck.front()]) {
            nextToCheck.push(c);
          }
        }
        nextToCheck.pop();
      }
    }
  }
  for(Group & g: grupes){
    for (int m : g.miestai) {
      for (int c : aConn[m]) {
        if (!g.hasConnection(sk_grupe[c])){
          g.connections.push_back(sk_grupe[c]);
	}
      }
    }
  }

  int m=0;
  for (Group g : grupes) {
    if(g.connections.size()==grupes.size()-1){
      //turi visas grupes
      m+=g.miestai.size();
    }
  }
  cout<<m<<endl;
}

Compilation message

menesinis_bilietas.cpp: In function 'int find_group_with_city(std::vector<Group>, int)':
menesinis_bilietas.cpp:36:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Group>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for (int i = 0; i < grupes.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 35932 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 69 ms 60960 KB Output is correct
5 Correct 2 ms 1928 KB Output is correct
6 Correct 130 ms 7036 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 60960 KB Output is correct
2 Correct 2 ms 1928 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 1947 ms 17916 KB Output is correct
7 Execution timed out 3042 ms 85792 KB Time limit exceeded

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Incorrect 5 ms 460 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Incorrect 5 ms 460 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Incorrect 5 ms 460 KB Output isn't correct
6 Halted 0 ms 0 KB -