codeforces stuff

Author: arknave

codeforces/20/c.cpp

@@ -0,0 +1,69 @@
+#include <cstdio>
+#include <queue>
+
+using namespace std;
+
+int N, M;
+//int edges[100010][3];
+vector<pair<int, int> > edges[100010];
+int previous[100010];
+bool seen[100010];
+
+struct node {
+    int n, prev;
+    long long dist;
+    node(int n, long long dist, int prev) : n(n), dist(dist), prev(prev) {};
+};
+
+bool operator<(node n1, node n2) {
+    return n1.dist > n2.dist;
+}
+
+int main() {
+    scanf("%d %d", &N, &M);
+    int a, b, w;
+    for(int i=0;i<M;i++) {
+        scanf("%d %d %d", &a, &b, &w);
+        edges[a - 1].push_back(make_pair(b - 1, w));
+        edges[b - 1].push_back(make_pair(a - 1, w));
+        previous[a - 1] = -1;
+        previous[b - 1] = -1;
+    }
+
+    priority_queue<node> pq;
+    pq.push(node(0, 0LL, -1));
+    while(!pq.empty()) {
+        node cur = pq.top();
+        pq.pop();
+        if(seen[cur.n]) {
+            continue;
+        }
+
+        seen[cur.n] = true;
+        previous[cur.n] = cur.prev;
+
+        if(cur.n == N - 1) {
+            break;
+        }
+
+        for(auto it = edges[cur.n].begin(); it != edges[cur.n].end(); it++) {
+            pq.push(node(it->first, it->second + cur.dist, cur.n));
+        }
+    }
+    vector<int> ans;
+    if(!seen[N - 1]) {
+        printf("-1\n");
+    } else {
+        int cur = N - 1;
+        while(cur > 0) {
+            ans.push_back(cur + 1);
+            cur = previous[cur];
+        }
+        printf("1");
+        for(vector<int>::reverse_iterator it = ans.rbegin(); it != ans.rend(); it++) {
+            printf(" %d", *it);
+        }
+        printf("\n");
+    }
+    return 0;
+}

codeforces/465/a.py

@@ -0,0 +1,10 @@
+n = int(raw_input())
+s = raw_input()
+carry = 1
+ans = 0
+for i, e in enumerate(s):
+    if carry == 0:
+        break
+    carry = 1 if (e == '1') else 0
+    ans = i
+print ans+1

codeforces/465/b.py

@@ -0,0 +1,14 @@
+n = int(raw_input())
+a = map(int, raw_input().split())
+letters = [i for i, e in enumerate(a) if e == 1]
+
+ans = 1 if len(letters) > 0 else 0
+for i, e in enumerate(letters):
+    if i == 0:
+        continue
+    if e - 1 == letters[i-1]:
+        ans += 1
+    else:
+        ans += 2
+
+print ans

codeforces/465/c.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+int N, P;
+int a[1001];
+string s;
+int main() {
+    cin >> N >> P;
+    cin >> s;
+    for(int i=0;i<N;i++) {
+        a[i] = s[i] - 'a';
+    }
+    bool tolerable = false;;
+    while(!tolerable) {
+        int i = N - 1;
+        a[i]++;
+        while(a[i] >= P) {
+            a[i] = 0;
+            i--;
+            if(i < 0) {
+                cout << "NO\n";
+                return 0;
+            }
+            a[i]++;
+        }
+        tolerable = true;
+        //check for doubles and triples
+        for(int mid=1;mid<N-1;mid++) {
+            if(a[mid-1] == a[mid+1] || a[mid-1] == a[mid] || a[mid] == a[mid+1]) tolerable = false;
+        }
+        if(N >= 2 && a[0] == a[1]) tolerable = false;
+    }
+    for(int i=0;i<N;i++) {
+        cout << ((char)(a[i] + 'a'));
+    }
+    cout << '\n';
+    return 0;
+}

codeforces/465/d.cpp

@@ -0,0 +1,95 @@
+#include <iostream>
+#define P 8
+#define C 3
+using namespace std;
+long long coords[8][3];
+int permutation[6][3] = {{0, 1, 2}, {0, 2, 1}, {1, 0, 2}, {1, 2, 0}, {2, 0, 1}, {2, 1, 0}};
+int current[] = {0, 0, 0, 0, 0, 0, 0, 0};
+
+void printans() {
+    cout << "YES\n";
+    for(int i=0;i<P; i++) {
+        cout << coords[i][permutation[current[i]][0]] << " "
+        << coords[i][permutation[current[i]][1]] << " "
+        << coords[i][permutation[current[i]][2]] << '\n';
+    }
+}
+
+long long square(long long x) {
+    return 1LL * x * x;
+}
+
+bool isgood() {
+    //calculate all the squared differences and see if they make sense
+    long long dists[] = {0, 0, 0};
+    long long counts[] = {0, 0, 0};
+    for(int i=0;i<P;i++) {
+        for(int j=i+1;j<P;j++) {
+            long long dist = 
+                square(coords[i][permutation[current[i]][0]] - coords[j][permutation[current[j]][0]]) + 
+                square(coords[i][permutation[current[i]][1]] - coords[j][permutation[current[j]][1]]) + 
+                square(coords[i][permutation[current[i]][2]] - coords[j][permutation[current[j]][2]]);
+            bool inserted = false;
+            for(int k=0;k<3;k++) {
+                if(dists[k] == dist) {
+                    counts[k]++;
+                    inserted = true;
+                    break;
+                } else if(dists[k] == 0) {
+                    dists[k] = dist;
+                    counts[k] = 1;
+                    inserted = true;
+                    break;
+                }
+            }
+            if(!inserted) return false;
+        }
+    }
+    if(counts[0] + counts[1] + counts[2] != 28) return false;
+    for(int i=0;i<6;i++) {
+        if(dists[permutation[i][0]] * 2 == dists[permutation[i][1]]
+                && dists[permutation[i][0]] * 3 == dists[permutation[i][2]]
+                && counts[permutation[i][0]] == 12 && counts[permutation[i][1]] == 12 && counts[permutation[i][2]] == 4) {
+            return true; 
+        }
+    }
+    return false;
+}
+
+bool increment() {
+    int i = P-1;
+    current[i]++;
+    while(current[i] == 6) {
+        current[i] = 0;
+        i--;
+        if(i < 0) {
+            return false;
+        }
+        current[i]++;
+    }
+    return true;
+}
+
+int main() {
+    for(int i=0;i<P;i++) {
+        for(int j=0;j<C;j++) {
+            cin >> coords[i][j];
+        }
+    }
+    if(isgood()) {
+        printans();
+        return 0;
+    }
+    bool done = false;
+    while(increment()) {
+        if(isgood()) {
+            done = true;
+            printans();
+            break;
+        }
+    }
+    if(!done) {
+        cout << "NO" << '\n';
+    }
+    return 0;
+}

codeforces/465/e.py

@@ -0,0 +1,9 @@
+s = raw_input()
+n = int(raw_input())
+for i in xrange(n):
+    inn, out = raw_input().split('->')
+    s = s.replace(inn, out)
+
+if len(s) == 0:
+    s = '0'
+print int(s, 10) % 1000000007