Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
Страница 4 |
If Wa19: | zwqzwq | 1837. Число Исенбаева | 15 окт 2021 06:18 | 1 |
This case may help you: 2 A B C B D Isenbaev ans: A 2 B 1 C 2 D 1 Isenbaev 0 |
<-- Some Test Cases --> | diego.OCI.2019@gmail.com | 1837. Число Исенбаева | 7 апр 2020 21:53 | 1 |
Hi, I writed this post because I wanted to share with you some of the test cases* that helped me a lot at the time. I hope it helps you :) --> Test 1: 1 A B C --> Answer: A undefined B undefined C undefined ------------------------------ --> Test 2: 5 Isenbaev A B A B C D Q P C H N G N P --> Answer: A 1 B 1 C 2 D 5 G 4 H 3 Isenbaev 0 N 3 P 4 Q 5 ------------------------------ --> Test 3: 13 Fominykh Isenbaev BBB BBB CCC AAA Ayzenshteyn Oparin Samsonov Ayzenshteyn Chevdar Samsonov Dublennykh Fominykh Ivankov Burmistrov Dublennykh Kurpilyanskiy Cormen Leiserson Rivest Oparin AA AAA Isenbaev Oparin Toropov AA DD PP PP QQ RR RR SS TT TT Toropov Oparin --> Answer: AA 2 AAA 2 Ayzenshteyn 2 BBB 1 Burmistrov 3 CCC 2 Chevdar 3 Cormen undefined DD 3 Dublennykh 2 Fominykh 1 Isenbaev 0 Ivankov 2 Kurpilyanskiy 3 Leiserson undefined Oparin 1 PP 3 QQ 4 RR 3 Rivest undefined SS 3 Samsonov 2 TT 2 Toropov 1 ------------------------------ --> Test 4: 3 Isenbaev A B A B C A Q W --> Answer: A 1 B 1 C 2 Isenbaev 0 Q 2 W 2 ------------------------------ *(All test cases were made by other users, so you'll probably found them in other Posts/Topics/Discussions). Acknowledgments to: -> "Vit Demidenko" & "Nathalie" -> "Pavel Nikolov" -> "mccolt89" -> "Megakrit" -How I solved it: I solved this problem in Java, for that, I used: ->1 java.util.Scanner ->1 java.util.HashMap ->1 java.util.TreeMap ->3 java.util.HashSet ->1 java.util.LinkedList ->? java.util.StringTokenizer (or you can just simply use the Scanner method "next()"). (The structures can be declared inside loops or other structures). Hope all this helped you :)
Edited by author 08.04.2020 00:48 Edited by author 08.04.2020 00:49 |
Test #1 runtime error | roman velichkin | 1837. Число Исенбаева | 17 июн 2019 13:00 | 2 |
[code deleted] Edited by moderator 19.11.2019 23:08 problem was caused by comments, removed them and everything worked |
Страница 3 |
Hint! | basuki | 1837. Число Исенбаева | 27 мар 2019 21:45 | 1 |
Hint! basuki 27 мар 2019 21:45 |
WA4 Python 3, Help pls! | Moshkov Danil | 1837. Число Исенбаева | 30 окт 2018 09:36 | 2 |
Somebody can give me test case 4? I don't understand why it's wrong answer... Edited by author 30.10.2018 11:59 Edited by author 01.11.2018 09:17 |
Help Please WA30!!!! I 'm waiting !! thank you!!! | Yusufjon | 1837. Число Исенбаева | 25 июл 2018 00:22 | 1 |
I think my idea completely right What's wrong?????? import java.util.Scanner; public class Main { public static void main(String [] args) { Scanner in = new Scanner(System.in); int n; n = in.nextInt(); String s[][] = new String[n][3]; for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ s[i][j] = in.next(); } } boolean all[][] = new boolean[n][3]; String ss[][] = new String[3*n][3*n]; ss[0][0] = "Isenbaev"; int []index = new int[3*n]; for(int i=0;i<n;i++){ index[i] = 0; } index[0] = 1; int d = 1; for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ if(s[i][j].equalsIgnoreCase("Isenbaev"))all[i][j] = true; } } boolean BOR = false; for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ if(s[i][j].equalsIgnoreCase("Isenbaev"))BOR = true; } } for(int q=0;q<3*n;q++){ boolean bormi = false; for(int i=0;i<n;i++){ boolean bor = false; for(int j=0;j<3;j++){ for(int t=0;t<index[d-1];t++){ if(ss[d-1][t].equalsIgnoreCase(s[i][j])){ bor = true; break; } }if(bor)break; } if(bor){ for(int j=0;j<3;j++){ if(!all[i][j]){ ss[d][index[d]++] = s[i][j]; all[i][j] = true; bormi = true; for(int g=0;g<n;g++){ for(int h=0;h<3;h++){ if(s[g][h].equalsIgnoreCase(s[i][j]))all[g][h] = true; } } } } } } if(bormi)d++; } String []sss = new String[3*n]; int []son = new int[3*n]; for(int i=0;i<3*n;i++){ son[i] = -1; } int koef = 0; for(int i=0;i<d;i++){ if(i==0){ if(BOR){ BOR = false; }else i++; } for(int j=0;j<index[i];j++){ sss[koef] = ss[i][j]; son[koef++] = i; } } for(int i=0;i<n;i++){ for(int j=0;j<3;j++){ if(!all[i][j]){ boolean top = true; for(int p=0;p<koef;p++){ if(sss[p].equalsIgnoreCase(ss[i][j]))top = false; } if(top)sss[koef++] = s[i][j]; } } } n = koef; for(int i=0;i<n-1;i++){ if(sss[i].compareTo(sss[i+1])>0){ String S = sss[i]; sss[i] = sss[i+1]; sss[i+1] = S; int SS = son[i]; son[i] = son[i+1]; son[i+1] = SS; i=-1; } } for(int i=0;i<koef;i++){ if(son[i]!=-1)System.out.println(sss[i] + " " + son[i]); else System.out.println(sss[i] + " undefined" ); } } } Edited by author 25.07.2018 00:30 Edited by author 27.07.2018 23:09 |
WA #19 | Aditya Singh | 1837. Число Исенбаева | 23 дек 2017 01:46 | 1 |
WA #19 Aditya Singh 23 дек 2017 01:46 What is the test 19? Help please! |
WA Test#19 | Aidar_Valiev | 1837. Число Исенбаева | 29 июн 2017 19:17 | 1 |
Don't know, what's wrong. Give me tests please. |
Possible way to solve it (Python) | Mahilewets | 1837. Число Исенбаева | 14 май 2017 17:05 | 1 |
Create three dictionaries : used <boolean> connections <set<string>> distance <string> Then import queue. Then breadth - first search. |
Runtime Error (Python) | JuliM | 1837. Число Исенбаева | 9 авг 2016 16:37 | 1 |
Test 3 is RTE What can I optimise? n=int(input()) dic={} for i in range(n): team=input().split() for x in team: if x in dic: dic[x].extend((y for y in team if y!=x and y not in dic[x])) else: dic[x]=[y for y in team if y!=x] names=sorted(dic.keys()) s='Isenbaev' level = { s: 0 } k = 1 frontier = [s] while frontier: next = [] for u in frontier: for v in dic[u]: if v not in level: level[v] = k next.append(v) frontier = next k += 1 print('\n'.join((x+' '+str(level.get(x, 'undefined')) for x in names))) Edited by author 09.08.2016 16:37 |
Always WA1 what am i doing wrong? | newcomer | 1837. Число Исенбаева | 25 июл 2016 18:13 | 1 |
class Node: def __init__(self, name, number): self.name = name self.number = number self.children = [] def d(self, name): for i in self.children: if i.name == name: self.children.remove(i) for i in self.children: i.d(name)
def fnc(cmds, item, isenb, root): for c in cmds: if item.name in c: for n in c: if not n in isenb: isenb[n] = item.number + 1 item.children.append(Node(n, item.number + 1)) elif isenb[n] > (item.number + 1): isenb[n] = item.number + 1 root.d(n) item.children.append(Node(n, item.number + 1)) for i in item.children: fnc(cmds, i, isenb, root)
import sys if __name__=='__main__': n_command = input() if(int(n_command) > 0): isenb = {} cmds = [] for i in range(0,int(n_command)): cmds.append(input().split()) flag = False for c in cmds: if "Isenbaev" in c: flag = True break if flag: root = Node("Isenbaev", 0) isenb["Isenbaev"] = 0 fnc(cmds, root, isenb, root) for c in cmds: for i in c: if not i in isenb: isenb[i] = "underfined" s = '' for key,value in sorted(isenb.items()): if s == '': s += (str(key) + ' ' + str(value)) else: s += ('\n' + str(key) + ' ' + str(value)) sys.stdout.write(s) else: sys.stdout.flush() |
WA #1 | João Pedro Franco | 1837. Число Исенбаева | 27 мар 2016 05:57 | 1 |
WA #1 João Pedro Franco 27 мар 2016 05:57 Why? My solution is ok when i run with other tests that i have seen in this forum, but when i submit here, i get WA#1! Is there a problem about the output? Thanks. |
Решение (solution). | Човид | 1837. Число Исенбаева | 6 мар 2016 17:13 | 1 |
BFS (Поиск в ширину). [code deleted] Edited by moderator 19.11.2019 23:14 |
Please help I am getting runtime error in java 1.8 | Kandarp | 1837. Число Исенбаева | 30 окт 2016 11:08 | 2 |
[code deleted] Edited by moderator 19.11.2019 23:13 check 1 a aa aaa answer a undefined aa undefined aaa undefined |
RE - #14..(c++). because of map<string,int>? | OIdiot | 1837. Число Исенбаева | 9 фев 2015 07:13 | 2 |
/* Machine: Class4_B2 System: Windows7 SP1 32bit */ [code deleted] Edited by moderator 19.11.2019 23:15 My bad.. I thought it only contains 100 names, but 300 in fact. |
Why Restricted Function ???????????!!!!!!!!!!!!!!!!!!!!! | Ramkrushna Pradhan | 1837. Число Исенбаева | 20 авг 2023 18:31 | 2 |
This codes gives correct output in my system but submitting it shows Restricted Function. Plz help... ************************************** import Queue graph={} dic={} to_explore=Queue.Queue() def BFS(root): dic[root]=0 to_explore.put(root) while not to_explore.empty(): tmp=to_explore.get() for i in graph[tmp]: if i not in dic: dic[i]=dic[tmp]+1 to_explore.put(i) n=input() while n: s=raw_input().split() for i in s: if i not in graph: graph[i]=[] for j in s: if j!=i: if j not in graph[i]: graph[i].append(j) else: for j in s: if j!=i: if j not in graph[i]: graph[i].append(j) n-=1 if 'Isenbaev' in graph: BFS('Isenbaev') for i in graph: if i not in dic: dic[i]='undefined' for i in sorted(dic): print i,dic[i] else: for i in sorted(graph): print i,"undefined" Don`t the queue module starts with lowercase letter? Looks like: from queue(module) import Queue(function) Actually, I have pretty similar code and always have runtime error on the very first test Edited by author 20.08.2023 18:32 Edited by author 20.08.2023 18:32 |
Help!! WA test 9 | tinrodriguez | 1837. Число Исенбаева | 11 янв 2015 05:21 | 1 |
|
test case - WA 4 | Pavel Nikolov | 1837. Число Исенбаева | 12 апр 2015 23:40 | 2 |
5 Isenbaev A B A B C D Q P C H N G N P output: --------------------------------------- A 1 B 1 C 2 D 5 G 4 H 3 Isenbaev 0 N 3 P 4 Q 5 --------------------------------------- Edited by author 04.01.2015 15:44 My program pases it, but I still have WA4. I got AC, problem was small capacity of my arrays :-) Edited by author 13.04.2015 00:22 |
different between undefined and 3 | amirshir | 1837. Число Исенбаева | 9 фев 2015 06:59 | 2 |
what's different between undefined and 3? can you help me? Isenbaev -> a -> b -> c. In this chain, a is 1, b is 2 and c is 3. Obviously,there is a path from Isenbaev to c. But In this situation: Isenbaev -> a -> b. c. c isn't a teammate of anyone who is connected with Isenbaev. So, c is 'undefined'. |
WA #11 | Alexander31 | 1837. Число Исенбаева | 23 авг 2014 05:41 | 1 |
WA #11 Alexander31 23 авг 2014 05:41 People, please, help me. I got WA 11. Can anybody give me test? Here is my solution: #include <iostream> #include <map> #include <queue> #include <vector> using namespace std;
int minimum(int arr[300][300], map < int, string > Num, map < string, int >L, int cur) {
int min_ = 100499;
for (int i = 0; i < cur; ++i)
if (arr[cur][i] && L[Num[i]] < min_)
min_ = L[Num[i]];
return min_; }
void Level_up(map < string, int >Nam, map < int, string > Num, map < string, int >&Lev, int sz, int arr[300][300]) {
for (int i = 0; i < sz; ++i) {
int level = Lev[Num[i]];
if (!level && Num[i] != "Isenbaev") // Если имя ещё не встречалось
Lev[Num[i]] = level = minimum(arr, Num, Lev, sz) + 1;
for (int j = 0; j < sz; ++j)
if (i != j && arr[i][j])
if ((Num[j] != "Isenbaev" && Lev[Num[j]] == 0) || Lev[Num[j]] > level + 1)
Lev[Num[j]] = level + 1;
} }
int main() {
int N;
string f;
string s;
string t;
string P = "Isenbaev";
map < string, int >Name;
map < int, string > Number;
int count = 1;
Name[P] = count++;
Number[0] = P;
int arr[300][300];
map < string, int >Level;
bool flag = false;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> f >> s >> t;
if (f == P || s == P || t == P) flag = true;
if (!Name[f])
Name[f] = count++;
if (!Name[s])
Name[s] = count++;
if (!Name[t])
Name[t] = count++;
Number[Name[f] - 1] = f;
Number[Name[s] - 1] = s;
Number[Name[t] - 1] = t;
arr[Name[f] - 1][Name[s] - 1] = arr[Name[s] - 1][Name[f] - 1] = arr[Name[f] - 1][Name[t] - 1] = arr[Name[t] - 1][Name[f] - 1] = arr[Name[s] - 1][Name[t] - 1] = arr[Name[t] - 1][Name[s] - 1] = 1;
}
Level[P] = 0;
Level_up(Name, Number, Level, count - 1, arr);
for (map < string, int >::iterator it = Level.begin(); it != Level.end(); ++it) {
if (flag || !flag && it->first != P) {
cout << it->first << " ";
if (it->first != P)
if (it->second < count)
cout << it->second << endl;
else cout << "undefined" << endl;
else cout << it->second << endl;
}
}
return 0; } Sorry, for the my code and my English. Edited by author 24.08.2014 03:07 |