-
chainerのメモリ削減の仕組み
-
逆伝播の計算時にいらない配列等を削除する仕組み
-
いらない配列とは?
-> +, -, sigmoidなど
-
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--- | |
title: ALMO デモページ | |
date: 2023-08-10 | |
author: abap34 | |
--- | |
# ALMO デモページ | |
## はじめに |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
理学院 | 工学院 | 物質理工学院 | 情報理工学院 | 生命理工学院 | 環境社会理工学院 | 合計 | ||
---|---|---|---|---|---|---|---|---|
U01 | 2 | 6 | 3 | 1 | 2 | 0 | 14 | |
U02 | 2 | 6 | 3 | 1 | 2 | 0 | 14 | |
U03 | 2 | 4 | 4 | 1 | 3 | 0 | 14 | |
U04 | 3 | 4 | 2 | 2 | 3 | 0 | 14 | |
U05 | 2 | 3 | 4 | 0 | 4 | 1 | 14 | |
U06 | 2 | 5 | 1 | 1 | 4 | 1 | 14 | |
U07 | 4 | 4 | 2 | 1 | 1 | 2 | 14 | |
U08 | 3 | 5 | 2 | 1 | 3 | 0 | 14 | |
U09 | 2 | 5 | 4 | 1 | 1 | 1 | 14 |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
S = "\t☆ | |
/\ | |
/★∴ \ | |
(人_人_人) | |
/∴∵★∵★∵ \ | |
(_人_人_人_) | |
/☆∴∵∴∵★ ∴ \ | |
(_人★人☆人_ ) | |
 ̄凵 ̄ " |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#define _GLIBCXX_DEBUG | |
#include <bits/stdc++.h> | |
using namespace std; | |
#define rep(i, n) for (int i = 0; i < (int)(n); i++) | |
#define ALL(a) (a).begin(), (a).end() | |
int get_d(vector<string> seat, int idx, int n) | |
// idxから最短にいる人の距離を返す | |
// seat:座席 | |
// n : seat length |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
void output(std::vector<std::vector<int>> A) | |
{ | |
for (auto vec_a : A) | |
{ | |
for (auto a : vec_a) | |
{ | |
std::cout << a << " "; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#define _GLIBCXX_DEBUG | |
#include <bits/stdc++.h> | |
using namespace std; | |
using Graph = vector<vector<int>>; | |
#define rep(i, n) for (int i = 0; i < (int)(n); i++) | |
#define ALL(a) (a).begin(), (a).end() | |
template <typename T> | |
void output_2d_arr(vector<T> A) | |
{ |
NewerOlder